Signal enhancement-a composite property mapping algorithm

1988/01/01 by J.A. Cadzow · 694 citations
Computer Science · Engineering · Mathematics · #Algorithm #Artificial intelligence #Blind Source Separation Techniques #Computer science #Convergence (economics) #Image (mathematics) #Mathematics #Noise (video) #Property (philosophy) #SIGNAL (programming language) #Set (abstract data type) #Structural Health Monitoring Techniques #Ultrasonics and Acoustic Wave Propagation

paper · doi:10.1109/29.1488

published in IEEE Transactions on Acoustics Speech and Signal Processing 36(1), 49-62 (Institute of Electrical and Electronics Engineers)

openalex publication_date 1988/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Abstract

A signal enhancement algorithm is developed that seeks to recover a signal from noise-contaminated distorted measurements made on that signal. This object is achieved by utilizing a set of properties which the signal is known or is hypothesized as possessing. The measured signal is modified to the smallest degree necessary to sequentially possess each of the individual properties. Conditions for the algorithm's convergence are established in which the primary requirement is that a composite property mapping be closed. This is a relatively unrestricted condition in comparison to that required of most existing signal-enhancement algorithms.>

Cited by

• Hankel and Toeplitz Rank-1 Decomposition of Arbitrary Matrices with Applications to Signal Direction-of-Arrival Estimation
• Learning Deep Analysis Dictionaries -- Part II: Convolutional Dictionaries
• An auto-parameter denoising method for nuclear magnetic resonance spectroscopy based on low-rank Hankel matrix
• Optimal structured approximation of Fourier subspaces, Toeplitz matrices, and exponential sums
• 2.5D Transformer: An Efficient 3D Seismic Interpolation Method without Full 3D Training
• Atomic norm denoising with applications to line spectral estimation
• Real-Time Learning of Predictive Dynamic Obstacle Models for Robotic Motion Planning
• Hankel Singular Value Decomposition as a method of preprocessing the Magnetic Resonance Spectroscopy
• Image space projection for low-rank signal estimation: Modified Gauss-Newton method
• Atomic Norm Denoising With Applications to Line Spectral Estimation
• The Sliding Frank-Wolfe Algorithm and its Application to\n Super-Resolution Microscopy
• Learnable Kernels for FRI -- Joint Kernel Encoder Optimization and Hardware Validation
• Fast Cadzow's Algorithm and a Gradient Variant
• A Fast Algorithm for Convolutional Structured Low-Rank Matrix Recovery
• Time Encoding of Finite-Rate-of-Innovation Signals
• Prony's method under an almost sharp multivariate Ingham inequality
• Optimal Rank-1 Hankel Approximation of Matrices: Frobenius Norm, Spectral Norm, and Cadzow's Algorithm
• Efficient Structured Matrix Rank Minimization
• A Quadratically Convergent Algorithm for Structured Low-Rank Approximation
• Ad Hoc Microphone Array Calibration: Euclidean Distance Matrix Completion Algorithm and Theoretical Guarantees
• Structured low rank approximation
• Estimation of Sparse MIMO Channels with Common Support

Related

• Spectral remapping of natural signals
• Stable Restoration and Separation of Approximately Sparse Signals
• Message Passing Algorithms for Compressed Sensing: I. Motivation and Construction
• Compressed Sensing: Mathematical Foundations, Implementation, and Advanced Optimization Techniques
• Freedom through Imperfection: Exploiting the flexibility offered by\n redundancy in signal processing