scispace - formally typeset
Search or ask a question
Topic

Noise (signal processing)

About: Noise (signal processing) is a research topic. Over the lifetime, 61013 publications have been published within this topic receiving 621165 citations.


Papers
More filters
01 Jan 1979
TL;DR: The multiple signal classification (MUSIC) algorithm is described, which provides asymptotically unbiased estimates of number of incident wavefronts present and directions of arrival (DOA) (or emitter locations) and strengths and cross correlations among the incident waveforms.
Abstract: Processing the signals received on an array of sensors for the location of the emitter is of great enough interest to have been treated under many special case assumptions. The general problem considers sensors with arbitrary locations and arbitrary directional characteristics (gain/phase/polarization) in a noise/interference environment of arbitrary covariance matrix. This report is concerned first with the multiple emitter aspect of this problem and second with the generality of solution. A description is given of the multiple signal classification (MUSIC) algorithm, which provides asymptotically unbiased estimates of 1) number of incident wavefronts present; 2) directions of arrival (DOA) (or emitter locations); 3) strengths and cross correlations among the incident waveforms; 4) noise/interference strength. Examples and comparisons with methods based on maximum likelihood (ML) and maximum entropy (ME), as well as conventional beamforming are included. An example of its use as a multiple frequency estimator operating on time series is included.

1,042 citations

Posted Content
TL;DR: In this article, the eigenvalues of the covariance matrix of signals received at the secondary users are used for signal detection in cognitive radio systems, and the proposed methods overcome the noise uncertainty problem, and can even perform better than the ideal energy detection when the signals to be detected are highly correlated.
Abstract: Spectrum sensing is a fundamental component is a cognitive radio. In this paper, we propose new sensing methods based on the eigenvalues of the covariance matrix of signals received at the secondary users. In particular, two sensing algorithms are suggested, one is based on the ratio of the maximum eigenvalue to minimum eigenvalue; the other is based on the ratio of the average eigenvalue to minimum eigenvalue. Using some latest random matrix theories (RMT), we quantify the distributions of these ratios and derive the probabilities of false alarm and probabilities of detection for the proposed algorithms. We also find the thresholds of the methods for a given probability of false alarm. The proposed methods overcome the noise uncertainty problem, and can even perform better than the ideal energy detection when the signals to be detected are highly correlated. The methods can be used for various signal detection applications without requiring the knowledge of signal, channel and noise power. Simulations based on randomly generated signals, wireless microphone signals and captured ATSC DTV signals are presented to verify the effectiveness of the proposed methods.

1,022 citations

Journal ArticleDOI
TL;DR: It is shown how a variant of PLS can be used to achieve a signal correction that is as close to orthogonal as possible to a given Y-vector or Y-matrix and is applied to four different data sets of multivariate calibration.

1,003 citations

Posted Content
TL;DR: A new generative model where samples are produced via Langevin dynamics using gradients of the data distribution estimated with score matching, which allows flexible model architectures, requires no sampling during training or the use of adversarial methods, and provides a learning objective that can be used for principled model comparisons.
Abstract: We introduce a new generative model where samples are produced via Langevin dynamics using gradients of the data distribution estimated with score matching Because gradients can be ill-defined and hard to estimate when the data resides on low-dimensional manifolds, we perturb the data with different levels of Gaussian noise, and jointly estimate the corresponding scores, ie, the vector fields of gradients of the perturbed data distribution for all noise levels For sampling, we propose an annealed Langevin dynamics where we use gradients corresponding to gradually decreasing noise levels as the sampling process gets closer to the data manifold Our framework allows flexible model architectures, requires no sampling during training or the use of adversarial methods, and provides a learning objective that can be used for principled model comparisons Our models produce samples comparable to GANs on MNIST, CelebA and CIFAR-10 datasets, achieving a new state-of-the-art inception score of 887 on CIFAR-10 Additionally, we demonstrate that our models learn effective representations via image inpainting experiments

983 citations

Journal ArticleDOI
TL;DR: A new definition of virtual dimensionality (VD) is introduced, defined as the minimum number of spectrally distinct signal sources that characterize the hyperspectral data from the perspective view of target detection and classification.
Abstract: With very high spectral resolution, hyperspectral sensors can now uncover many unknown signal sources which cannot be identified by visual inspection or a priori. In order to account for such unknown signal sources, we introduce a new definition, referred to as virtual dimensionality (VD) in this paper. It is defined as the minimum number of spectrally distinct signal sources that characterize the hyperspectral data from the perspective view of target detection and classification. It is different from the commonly used intrinsic dimensionality (ID) in the sense that the signal sources are determined by the proposed VD based only on their distinct spectral properties. These signal sources may include unknown interfering sources, which cannot be identified by prior knowledge. With this new definition, three Neyman-Pearson detection theory-based thresholding methods are developed to determine the VD of hyperspectral imagery, where eigenvalues are used to measure signal energies in a detection model. In order to evaluate the performance of the proposed methods, two information criteria, an information criterion (AIC) and minimum description length (MDL), and the factor analysis-based method proposed by Malinowski, are considered for comparative analysis. As demonstrated in computer simulations, all the methods and criteria studied in this paper may work effectively when noise is independent identically distributed. This is, unfortunately, not true when some of them are applied to real image data. Experiments show that all the three eigenthresholding based methods (i.e., the Harsanyi-Farrand-Chang (HFC), the noise-whitened HFC (NWHFC), and the noise subspace projection (NSP) methods) produce more reliable estimates of VD compared to the AIC, MDL, and Malinowski's empirical indicator function, which generally overestimate VD significantly. In summary, three contributions are made in this paper, 1) an introduction of the new definition of VD, 2) three Neyman-Pearson detection theory-based thresholding methods, HFC, NWHFC, and NSP derived for VD estimation, and 3) experiments that show the AIC and MDL commonly used in passive array processing and the second-order statistic-based Malinowski's method are not effective measures in VD estimation.

968 citations


Network Information
Related Topics (5)
Robustness (computer science)
94.7K papers, 1.6M citations
78% related
Feature extraction
111.8K papers, 2.1M citations
77% related
Communication channel
137.4K papers, 1.7M citations
77% related
Signal
674.2K papers, 4.5M citations
76% related
Image processing
229.9K papers, 3.5M citations
75% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202238
20211,674
20202,196
20192,610
20182,361
20172,326