NDLI: A New Algorithm Based on Linearized Bregman Iteration with Generalized Inverse for Compressed Sensing

Content Provider	Springer Nature Link
Author	Qiao, Tiantian Li, Weiguo Wu, Boying
Copyright Year	2013
Abstract	This paper aims to solve the basis pursuit problem $\min_{u\in\mathbb{R}^{n}}\{\\|u\\|_{1}: Au=f\}$ in compressed sensing when A is any matrix, there are two contributions in this paper. First, we provide a simplified iterative formula that combines original linearized Bregman iteration together with a soft threshold and iterative formula for generalized inverse of matrix $A\in\mathbb{R}^{m\times n}$ . Furthermore, we also discuss its convergence. Compared to the original linearized Bregman method, the proposed simplified iterative scheme possesses obvious advantage. The workload and computing time are greatly reduced, when m≪n and $\operatorname{rank}(A)\ll m$ , especially. But the requirement of high accuracy cannot be achieved. So, we need to select the proper number of inner loop to achieve the goal of balancing the workload and the accuracy of the simplified iterative formula. Second, we propose a new chaotic iterative algorithm based on the simplified iteration. Under the same iterations, the computing time of the simplified iteration with q=1 (q is the number of inner loops) is almost the same as that of the chaotic method, but the precision of the latter is better than that of the former because it utilized more information; and the accuracy of the chaotic method achieves that of A † linearized Bregman iteration, while the computing time of the former is less than one half of the latter. In conclusion, the calculating efficiency of our two methods as regards A † iteration is improved, and specially the chaotic iteration is more competitive. Numerical results on compressed sensing are presented that demonstrate that our methods can be significantly more effective than the original linearized Bregman iterations, even when matrix A is ill-conditioned.
Starting Page	1527
Ending Page	1539
Page Count	13
File Format	PDF
ISSN	0278081X
Journal	Circuits, Systems, and Signal Processing
Volume Number	33
Issue Number	5
e-ISSN	15315878
Language	English
Publisher	Springer US
Publisher Date	2013-12-05
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Chaotic iterative Generalized inverse Linearized Bregman iteration Compressed sensing Sparse solution Circuits and Systems Electrical Engineering Signal, Image and Speech Processing Electronics and Microelectronics, Instrumentation
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Signal Processing

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Iterative Hard Thresholding Based on Randomized Kaczmarz Method

Compressed Blind Signal Reconstruction Model and Algorithm

Compressed Sensing for Sparse Error Correcting Model

Foveated Compressed Sensing

A Fast Recovery Method of 2D Geometric Compressed Sensing Signal

Orthogonal Greedy MUSIC: An Empirical Algorithm for Joint Sparse Recovery

An Adaptive Non-local Total Variation Blind Deconvolution Employing Split Bregman Iteration

A Distributed Secure Data Collection Scheme via Chaotic Compressed Sensing in Wireless Sensor Networks

A Generalized Hard Thresholding Pursuit Algorithm

A New Algorithm Based on Linearized Bregman Iteration with Generalized Inverse for Compressed Sensing

Similar Documents

Iterative Hard Thresholding Based on Randomized Kaczmarz Method

Compressed Blind Signal Reconstruction Model and Algorithm

Compressed Sensing for Sparse Error Correcting Model

Foveated Compressed Sensing

A Fast Recovery Method of 2D Geometric Compressed Sensing Signal

Orthogonal Greedy MUSIC: An Empirical Algorithm for Joint Sparse Recovery

An Adaptive Non-local Total Variation Blind Deconvolution Employing Split Bregman Iteration

A Distributed Secure Data Collection Scheme via Chaotic Compressed Sensing in Wireless Sensor Networks

A Generalized Hard Thresholding Pursuit Algorithm

A New Algorithm Based on Linearized Bregman Iteration with Generalized Inverse for Compressed Sensing