60 research outputs found
Subsampled Multichannel Blind Deconvolution by Sparse Power Factorization
In this technical report, we show that sparse power factorization (SPF) is an effective solution to the subsampled multichannel blind deconvolution (SMBD) problem when the input signal follows a sparse model. SMBD is formulated as the recovery of a sparse rank-one matrix. Unlike the recovery of rank-one matrix or of sparse matrix, when there are multiple priors on the solution simultaneously,
SPF outperforms convex relaxation approaches both theoretically and empirically. We confirm that SPF exhibits the same advantage in the context of SMBD.National Science Foundation/CCF 10-18789Ope
Joint deconvolution and demosaicing
International audienceWe present a new method to jointly perform deblurring and color- demosaicing of RGB images. Our method is derived following an inverse problem approach in a MAP framework. To avoid noise am- plification and allow for interpolation of missing data, we make use of edge-preserving spatial regularization and spectral regularization. We demonstrate the improvements brought by our algorithm by processing both simulated and real RGB images obtained with a Bayer's color filter and with different types of blurring
Generic Feasibility of Perfect Reconstruction with Short FIR Filters in Multi-channel Systems
We study the feasibility of short finite impulse response (FIR) synthesis for
perfect reconstruction (PR) in generic FIR filter banks. Among all PR synthesis
banks, we focus on the one with the minimum filter length. For filter banks
with oversampling factors of at least two, we provide prescriptions for the
shortest filter length of the synthesis bank that would guarantee PR almost
surely. The prescribed length is as short or shorter than the analysis filters
and has an approximate inverse relationship with the oversampling factor. Our
results are in form of necessary and sufficient statements that hold
generically, hence only fail for elaborately-designed nongeneric examples. We
provide extensive numerical verification of the theoretical results and
demonstrate that the gap between the derived filter length prescriptions and
the true minimum is small. The results have potential applications in synthesis
FB design problems, where the analysis bank is given, and for analysis of
fundamental limitations in blind signals reconstruction from data collected by
unknown subsampled multi-channel systems.Comment: Manuscript submitted to IEEE Transactions on Signal Processin
Image enhancement methods and applications in computational photography
Computational photography is currently a rapidly developing and cutting-edge topic in applied optics, image sensors and image processing fields to go beyond the limitations of traditional photography. The innovations of computational photography allow the photographer not only merely to take an image, but also, more importantly, to perform computations on the captured image data. Good examples of these innovations include high dynamic range imaging, focus stacking, super-resolution, motion deblurring and so on. Although extensive work has been done to explore image enhancement techniques in each subfield of computational photography, attention has seldom been given to study of the image enhancement technique of simultaneously extending depth of field and dynamic range of a scene. In my dissertation, I present an algorithm which combines focus stacking and high dynamic range (HDR) imaging in order to produce an image with both extended depth of field (DOF) and dynamic range than any of the input images. In this dissertation, I also investigate super-resolution image restoration from multiple images, which are possibly degraded by large motion blur. The proposed algorithm combines the super-resolution problem and blind image deblurring problem in a unified framework. The blur kernel for each input image is separately estimated. I also do not make any restrictions on the motion fields among images; that is, I estimate dense motion field without simplifications such as parametric motion. While the proposed super-resolution method uses multiple images to enhance spatial resolution from multiple regular images, single image super-resolution is related to techniques of denoising or removing blur from one single captured image. In my dissertation, space-varying point spread function (PSF) estimation and image deblurring for single image is also investigated. Regarding the PSF estimation, I do not make any restrictions on the type of blur or how the blur varies spatially. Once the space-varying PSF is estimated, space-varying image deblurring is performed, which produces good results even for regions where it is not clear what the correct PSF is at first. I also bring image enhancement applications to both personal computer (PC) and Android platform as computational photography applications
Structured least squares problems and robust estimators
Cataloged from PDF version of article.A novel approach is proposed to provide robust and
accurate estimates for linear regression problems when both the
measurement vector and the coefficient matrix are structured and
subject to errors or uncertainty. A new analytic formulation is developed
in terms of the gradient flow of the residual norm to analyze
and provide estimates to the regression. The presented analysis
enables us to establish theoretical performance guarantees to compare
with existing methods and also offers a criterion to choose the
regularization parameter autonomously. Theoretical results and
simulations in applications such as blind identification, multiple
frequency estimation and deconvolution show that the proposed
technique outperforms alternative methods in mean-squared error
for a significant range of signal-to-noise ratio values
Tuning-free Plug-and-Play Hyperspectral Image Deconvolution with Deep Priors
Deconvolution is a widely used strategy to mitigate the blurring and noisy
degradation of hyperspectral images~(HSI) generated by the acquisition devices.
This issue is usually addressed by solving an ill-posed inverse problem. While
investigating proper image priors can enhance the deconvolution performance, it
is not trivial to handcraft a powerful regularizer and to set the
regularization parameters. To address these issues, in this paper we introduce
a tuning-free Plug-and-Play (PnP) algorithm for HSI deconvolution.
Specifically, we use the alternating direction method of multipliers (ADMM) to
decompose the optimization problem into two iterative sub-problems. A flexible
blind 3D denoising network (B3DDN) is designed to learn deep priors and to
solve the denoising sub-problem with different noise levels. A measure of 3D
residual whiteness is then investigated to adjust the penalty parameters when
solving the quadratic sub-problems, as well as a stopping criterion.
Experimental results on both simulated and real-world data with ground-truth
demonstrate the superiority of the proposed method.Comment: IEEE Trans. Geosci. Remote sens. Manuscript submitted June 30, 202
Recommended from our members
Structured Sub-Nyquist Sampling with Applications in Compressive Toeplitz Covariance Estimation, Super-Resolution and Phase Retrieval
Sub-Nyquist sampling has received a huge amount of interest in the past decade. In classical compressed sensing theory, if the measurement procedure satisfies a particular condition known as Restricted Isometry Property (RIP), we can achieve stable recovery of signals of low-dimensional intrinsic structures with an order-wise optimal sample size. Such low-dimensional structures include sparse and low rank for both vector and matrix cases. The main drawback of conventional compressed sensing theory is that random measurements are required to ensure the RIP property. However, in many applications such as imaging and array signal processing, applying independent random measurements may not be practical as the systems are deterministic. Moreover, random measurements based compressed sensing always exploits convex programs for signal recovery even in the noiseless case, and solving those programs is computationally intensive if the ambient dimension is large, especially in the matrix case. The main contribution of this dissertation is that we propose a deterministic sub-Nyquist sampling framework for compressing the structured signal and come up with computationally efficient algorithms. Besides widely studied sparse and low-rank structures, we particularly focus on the cases that the signals of interest are stationary or the measurements are of Fourier type. The key difference between our work from classical compressed sensing theory is that we explicitly exploit the second-order statistics of the signals, and study the equivalent quadratic measurement model in the correlation domain. The essential observation made in this dissertation is that a difference/sum coarray structure will arise from the quadratic model if the measurements are of Fourier type. With these observations, we are able to achieve a better compression rate for covariance estimation, identify more sources in array signal processing or recover the signals of larger sparsity. In this dissertation, we will first study the problem of Toeplitz covariance estimation. In particular, we will show how to achieve an order-wise optimal compression rate using the idea of sparse arrays in both general and low-rank cases. Then, an analysis framework of super-resolution with positivity constraint is established. We will present fundamental robustness guarantees, efficient algorithms and applications in practices. Next, we will study the problem of phase-retrieval for which we successfully apply the sparse array ideas by fully exploiting the quadratic measurement model. We achieve near-optimal sample complexity for both sparse and general cases with practical Fourier measurements and provide efficient and deterministic recovery algorithms. In the end, we will further elaborate on the essential role of non-negative constraint in underdetermined inverse problems. In particular, we will analyze the nonlinear co-array interpolation problem and develop a universal upper bound of the interpolation error. Bilinear problem with non-negative constraint will be considered next and the exact characterization of the ambiguous solutions will be established for the first time in literature. At last, we will show how to apply the nested array idea to solve real problems such as Kriging. Using spatial correlation information, we are able to have a stable estimate of the field of interest with fewer sensors than classic methodologies. Extensive numerical experiments are implemented to demonstrate our theoretical claims
From Symmetry to Geometry: Tractable Nonconvex Problems
As science and engineering have become increasingly data-driven, the role of
optimization has expanded to touch almost every stage of the data analysis
pipeline, from the signal and data acquisition to modeling and prediction. The
optimization problems encountered in practice are often nonconvex. While
challenges vary from problem to problem, one common source of nonconvexity is
nonlinearity in the data or measurement model. Nonlinear models often exhibit
symmetries, creating complicated, nonconvex objective landscapes, with multiple
equivalent solutions. Nevertheless, simple methods (e.g., gradient descent)
often perform surprisingly well in practice.
The goal of this survey is to highlight a class of tractable nonconvex
problems, which can be understood through the lens of symmetries. These
problems exhibit a characteristic geometric structure: local minimizers are
symmetric copies of a single "ground truth" solution, while other critical
points occur at balanced superpositions of symmetric copies of the ground
truth, and exhibit negative curvature in directions that break the symmetry.
This structure enables efficient methods to obtain global minimizers. We
discuss examples of this phenomenon arising from a wide range of problems in
imaging, signal processing, and data analysis. We highlight the key role of
symmetry in shaping the objective landscape and discuss the different roles of
rotational and discrete symmetries. This area is rich with observed phenomena
and open problems; we close by highlighting directions for future research.Comment: review paper submitted to SIAM Review, 34 pages, 10 figure
- …