• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 22,080
Next 10 →

Noise Removal Algorithm for Images Corrupted by Additive Gaussian Noise

by Shyam Lal, Mahesh Ch, Gopal Krishna Upadhyay
"... ABSTRACT-This paper presents noise removal algorithm for gray scale images corrupted by additive Gaussian noise. A robust open close sequence filter based on mathematical morphology for high probability additive Gaussian noise removal is discussed. First, an additive Gaussian noise detector using ma ..."
Abstract - Add to MetaCart
ABSTRACT-This paper presents noise removal algorithm for gray scale images corrupted by additive Gaussian noise. A robust open close sequence filter based on mathematical morphology for high probability additive Gaussian noise removal is discussed. First, an additive Gaussian noise detector using

On the Accuracy of the High SNR Approximation of the Differential Entropy of Signals in Additive Gaussian Noise

by Ramy H. Gohary, Halim Yanikomeroglu
"... Abstract—One approach for analyzing the high signal-to-noise ra-tio (SNR) capacity of non-coherent wireless communication systems is to ignore the noise component of the received signal in the computation of its differential entropy. In this paper we consider the error incurred by this approximation ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
by this approximation when the transmitter and the receiver have one antenna each, and the noise has a Gaussian distribution. For a general instance of this case, we show that the approximation error decays as 1/SNR. In addition, we consider the special instance in which the received signal corresponds to a signal

Ziv-Zakaı̈ bound for harmonic retrieval in multiplicative and additive Gaussian noise

by Mounir Ghogho - in Proc. of IEEE Workshop on Statistical Signal Processing (SSP , 2005
"... The paper addresses the problem of the lower performance bound evaluation for harmonic retrieval in multiplicative and additive noise, especially when the SNR is low and/or when the number of available samples is small. As a nov-elty, we express an accurate approximation of the Ziv-Zakai bound in cl ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
The paper addresses the problem of the lower performance bound evaluation for harmonic retrieval in multiplicative and additive noise, especially when the SNR is low and/or when the number of available samples is small. As a nov-elty, we express an accurate approximation of the Ziv-Zakai bound

The Estimation of the Frequency of a Complex Exponential in Additive Gaussian Noise

by Sam Reisenfeld
"... Abstract- A new algorithm for the precise estimation of the frequency of a complex exponential signal in additive, complex, white Gaussian noise is presented. The algorithm has low computational complexity and is well suited for nu-merous real time applications. The DFT based algorithm performs an i ..."
Abstract - Add to MetaCart
Abstract- A new algorithm for the precise estimation of the frequency of a complex exponential signal in additive, complex, white Gaussian noise is presented. The algorithm has low computational complexity and is well suited for nu-merous real time applications. The DFT based algorithm performs

ROBUST SUPER-EXPONENTIAL METHODS FOR BLIND EQUALIZATION OF AN SISO-IIR SYSTEM WITH ADDITIVE GAUSSIAN NOISE

by Mitsuru Kawamotoa, Kiyotaka Kohnob, Yujiro Inouyeb, Asoke K. N
"... The present paper deals with the blind equalization prob-lem of a single-input single-output infinite impulse response (SISO-IIR) system with additive Gaussian noise. To solve the problem, we propose a ”super-exponential method” (SEM). The novel point of the proposed SEM is that even when Gaussian n ..."
Abstract - Add to MetaCart
The present paper deals with the blind equalization prob-lem of a single-input single-output infinite impulse response (SISO-IIR) system with additive Gaussian noise. To solve the problem, we propose a ”super-exponential method” (SEM). The novel point of the proposed SEM is that even when Gaussian

Capacity of multi-antenna Gaussian channels

by I. Emre Telatar - EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS , 1999
"... We investigate the use of multiple transmitting and/or receiving antennas for single user communications over the additive Gaussian channel with and without fading. We derive formulas for the capacities and error exponents of such channels, and describe computational procedures to evaluate such form ..."
Abstract - Cited by 2923 (6 self) - Add to MetaCart
We investigate the use of multiple transmitting and/or receiving antennas for single user communications over the additive Gaussian channel with and without fading. We derive formulas for the capacities and error exponents of such channels, and describe computational procedures to evaluate

Image denoising using a scale mixture of Gaussians in the wavelet domain

by Javier Portilla, Vasily Strela, Martin J. Wainwright, Eero P. Simoncelli - IEEE TRANS IMAGE PROCESSING , 2003
"... We describe a method for removing noise from digital images, based on a statistical model of the coefficients of an overcomplete multiscale oriented basis. Neighborhoods of coefficients at adjacent positions and scales are modeled as the product of two independent random variables: a Gaussian vecto ..."
Abstract - Cited by 513 (17 self) - Add to MetaCart
coefficient reduces to a weighted average of the local linear estimates over all possible values of the hidden multiplier variable. We demonstrate through simulations with images contaminated by additive white Gaussian noise that the performance of this method substantially surpasses that of previously

Calibrating noise to sensitivity in private data analysis

by Cynthia Dwork, Frank Mcsherry, Kobbi Nissim, Adam Smith - In Proceedings of the 3rd Theory of Cryptography Conference , 2006
"... Abstract. We continue a line of research initiated in [10, 11] on privacypreserving statistical databases. Consider a trusted server that holds a database of sensitive information. Given a query function f mapping databases to reals, the so-called true answer is the result of applying f to the datab ..."
Abstract - Cited by 649 (60 self) - Add to MetaCart
to the database. To protect privacy, the true answer is perturbed by the addition of random noise generated according to a carefully chosen distribution, and this response, the true answer plus noise, is returned to the user. Previous work focused on the case of noisy sums, in which f =P i g(xi), where xi denotes

EURASIP Journal on Applied Signal Processing 2005:15, 2500–2513 c ○ 2005 Hindawi Publishing Corporation Restoration of Astrophysical Images—The Case of Poisson Data with Additive Gaussian Noise

by H. Lantéri, C. Theys , 2004
"... We consider the problem of restoring astronomical images acquired with charge coupled device cameras. The astronomical object is first blurred by the point spread function of the instrument-atmosphere set. The resulting convolved image is corrupted by a Poissonian noise due to low light intensity, t ..."
Abstract - Add to MetaCart
, then, a Gaussian white noise is added during the electronic read-out operation. We show first that the split gradient method (SGM) previously proposed can be used to obtain maximum likelihood (ML) iterative algorithms adapted in such noise combinations. However, when ML algorithms are used for image

Just Relax: Convex Programming Methods for Identifying Sparse Signals in Noise

by Joel A. Tropp , 2006
"... This paper studies a difficult and fundamental problem that arises throughout electrical engineering, applied mathematics, and statistics. Suppose that one forms a short linear combination of elementary signals drawn from a large, fixed collection. Given an observation of the linear combination that ..."
Abstract - Cited by 483 (2 self) - Add to MetaCart
that has been contaminated with additive noise, the goal is to identify which elementary signals participated and to approximate their coefficients. Although many algorithms have been proposed, there is little theory which guarantees that these algorithms can accurately and efficiently solve the problem
Next 10 →
Results 1 - 10 of 22,080
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University