Reconstruction of compressed samples in shift-invariant space base on matrix factorization

Authors:
Zhaoxuan Zhu;Houjun Wang;Zhigang Wang;Hao Zhang
Affiliations:
Institute of Astronautics & Aeronautics, University of Electronic Science and Technology of China, Chengdu 611731, China;College of Automation, University of Electronic Science and Technology of China, Sichuan, Chengdu 611731, China;College of Automation, University of Electronic Science and Technology of China, Sichuan, Chengdu 611731, China;College of Automation, University of Electronic Science and Technology of China, Sichuan, Chengdu 611731, China
Venue:
Computers and Electrical Engineering
Year:
2011

Citing 8
Cited 0

Atomic Decomposition by Basis Pursuit

SIAM Journal on Scientific Computing
Blind multiband signal reconstruction: compressed sensing for analog signals

IEEE Transactions on Signal Processing
Sampling Moments and Reconstructing Signals of Finite Rate of Innovation: Shannon Meets Strang–Fix

IEEE Transactions on Signal Processing
A general sampling theory for nonideal acquisition devices

IEEE Transactions on Signal Processing
Minimum rate sampling and reconstruction of signals with arbitrary frequency support

IEEE Transactions on Information Theory
Perfect reconstruction formulas and bounds on aliasing error in sub-Nyquist nonuniform sampling of multiband signals

IEEE Transactions on Information Theory
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

IEEE Transactions on Information Theory
Compressed sensing

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

According to the model of compressed sampling in shift-invariant space, the over-complete dictionary is usually a function matrix, which increases the complexity of reconstructing samples. In order to reduce the complexity of reconstructing samples, this paper proposes a reconstruction method based on matrix factorization. The method transforms over-complete dictionary into the multiplication of a reversible function matrix and a constant matrix using least squares error, and converts the samples reconstruction into the computing of constant matrix, which reduces the complexity of samples reconstruction. Meanwhile, the feasibility and convergence of method is analyzed in theory. Finally, the convergence and reconstruction error of the method is validated by simulation; and it is shown that the method is effective.