oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Image Compressive Sensing Recovery Using Adaptively Learned Sparsifying Basis via L0 Minimization  [PDF]
Jian Zhang,Chen Zhao,Debin Zhao,Wen Gao
Computer Science , 2014, DOI: 10.1016/j.sigpro.2013.09.025
Abstract: From many fewer acquired measurements than suggested by the Nyquist sampling theory, compressive sensing (CS) theory demonstrates that, a signal can be reconstructed with high probability when it exhibits sparsity in some domain. Most of the conventional CS recovery approaches, however, exploited a set of fixed bases (e.g. DCT, wavelet and gradient domain) for the entirety of a signal, which are irrespective of the non-stationarity of natural signals and cannot achieve high enough degree of sparsity, thus resulting in poor CS recovery performance. In this paper, we propose a new framework for image compressive sensing recovery using adaptively learned sparsifying basis via L0 minimization. The intrinsic sparsity of natural images is enforced substantially by sparsely representing overlapped image patches using the adaptively learned sparsifying basis in the form of L0 norm, greatly reducing blocking artifacts and confining the CS solution space. To make our proposed scheme tractable and robust, a split Bregman iteration based technique is developed to solve the non-convex L0 minimization problem efficiently. Experimental results on a wide range of natural images for CS recovery have shown that our proposed algorithm achieves significant performance improvements over many current state-of-the-art schemes and exhibits good convergence property.
Permutation Enhanced Parallel Reconstruction with A Linear Compressive Sampling Device  [PDF]
Hao Fang,Sergiy A. Vorobyov,Hai Jiang
Computer Science , 2013,
Abstract: In this letter, a permutation enhanced parallel reconstruction architecture for compressive sampling is proposed. In this architecture, a measurement matrix is constructed from a block-diagonal sensing matrix and the sparsifying basis of the target signal. In this way, the projection of the signal onto the sparsifying basis can be divided into several segments and all segments can be reconstructed in parallel. Thus, the computational complexity and the time for reconstruction can be reduced significantly. This feature is especially appealing for big data processing. Furthermore, to reduce the number of measurements needed to achieve the desired reconstruction error performance, permutation is introduced for the projection of the signal. It is shown that the permutation can be performed implicitly by using a pre-designed measurement matrix. Thus, the permutation enhanced parallel reconstruction can be achieved with a linear compressive sampling device.
Generalized Alternating Projection Based Total Variation Minimization for Compressive Sensing  [PDF]
Xin Yuan
Mathematics , 2015,
Abstract: We consider the total variation (TV) minimization problem used for compressive sensing and solve it using the generalized alternating projection (GAP) algorithm. Extensive results demonstrate the high performance of proposed algorithm on compressive sensing, including two dimensional images, hyperspectral images and videos. We further derive the Alternating Direction Method of Multipliers (ADMM) framework with TV minimization for video and hyperspectral image compressive sensing under the CACTI and CASSI framework, respectively. Connections between GAP and ADMM are also provided.
Compressive hyperspectral imaging via adaptive sampling and dictionary learning  [PDF]
Mingrui Yang,Frank de Hoog,Yuqi Fan,Wen Hu
Computer Science , 2015,
Abstract: In this paper, we propose a new sampling strategy for hyperspectral signals that is based on dictionary learning and singular value decomposition (SVD). Specifically, we first learn a sparsifying dictionary from training spectral data using dictionary learning. We then perform an SVD on the dictionary and use the first few left singular vectors as the rows of the measurement matrix to obtain the compressive measurements for reconstruction. The proposed method provides significant improvement over the conventional compressive sensing approaches. The reconstruction performance is further improved by reconditioning the sensing matrix using matrix balancing. We also demonstrate that the combination of dictionary learning and SVD is robust by applying them to different datasets.
Nonconvex Compressed Sampling of Natural Images and Applications to Compressed MR Imaging  [PDF]
Wenze Shao,Haisong Deng,Zhuihui Wei
ISRN Computational Mathematics , 2012, DOI: 10.5402/2012/982792
Abstract: There have been proposed several compressed imaging reconstruction algorithms for natural and MR images. In essence, however, most of them aim at the good reconstruction of edges in the images. In this paper, a nonconvex compressed sampling approach is proposed for structure-preserving image reconstruction, through imposing sparseness regularization on strong edges and also oscillating textures in images. The proposed approach can yield high-quality reconstruction as images are sampled at sampling ratios far below the Nyquist rate, due to the exploitation of a kind of approximate ? 0 seminorms. Numerous experiments are performed on the natural images and MR images. Compared with several existing algorithms, the proposed approach is more efficient and robust, not only yielding higher signal to noise ratios but also reconstructing images of better visual effects. 1. Introduction In the past several decades, image compression [1, 2] and superresolution [3, 4] have been the primary techniques to alleviate the storage/transmission burden in image acquisition. As for image compression, it is known that, however, the compression-and-then-decompression scheme is not economical [5]. Though superresolution is capable of economically reconstructing high-resolution images to subpixel precision from multiple low-resolution images of the similar view, subpixel shifts have to be estimated in advance. It is a pity that accurate motion estimation is not an easy job for superresolution, thus resulting in a possible compromise of image quality (e.g., spatial resolution, signal to noise ratio (SNR)). Recently, a novel sampling theory, called compressed sensing or compressive sampling (CS) [5–9], asserts that one can reconstruct signals from far fewer samples or measurements than traditional sampling methods use. The emergence of CS has offered a great opportunity to economically acquire signals or images even as the sampling ratio is significantly below the Nyquist rate. In fact, CS has become one of the hottest research topics in the field of signal processing. Though there have been many relevant results on encoding and decoding of sparse signals, our focus in this paper is mainly on the compressed sampling of natural images and its applications to magnetic resonance imaging (MRI) reconstruction. Recently, there have been proposed several algorithms for compressed imaging reconstruction (e.g., [6, 11–17]). In essence, each of them solves a minimization problem of single ? 1 norm or total variation (TV) or their combination either directly or asymptotically, and the
Modified Frame Reconstruction Algorithm for Compressive Sensing  [PDF]
Graeme Pope
Mathematics , 2009,
Abstract: Compressive sensing is a technique to sample signals well below the Nyquist rate using linear measurement operators. In this paper we present an algorithm for signal reconstruction given such a set of measurements. This algorithm generalises and extends previous iterative hard thresholding algorithms and we give sufficient conditions for successful reconstruction of the original data signal. In addition we show that by underestimating the sparsity of the data signal we can increase the success rate of the algorithm. We also present a number of modifications to this algorithm: the incorporation of a least squares step, polynomial acceleration and an adaptive method for choosing the step-length. These modified algorithms converge to the correct solution under similar conditions to the original un-modified algorithm. Empirical evidence show that these modifications dramatically increase both the success rate and the rate of convergence, and can outperform other algorithms previously used for signal reconstruction in compressive sensing.
Optimized Projection Matrix for Compressive Sensing  [cached]
Xu Jianping,Pi Yiming,Cao Zongjie
EURASIP Journal on Advances in Signal Processing , 2010,
Abstract: Compressive sensing (CS) is mainly concerned with low-coherence pairs, since the number of samples needed to recover the signal is proportional to the mutual coherence between projection matrix and sparsifying matrix. Until now, papers on CS always assume the projection matrix to be a random matrix. In this paper, aiming at minimizing the mutual coherence, a method is proposed to optimize the projection matrix. This method is based on equiangular tight frame (ETF) design because an ETF has minimum coherence. It is impossible to solve the problem exactly because of the complexity. Therefore, an alternating minimization type method is used to find a feasible solution. The optimally designed projection matrix can further reduce the necessary number of samples for recovery or improve the recovery accuracy. The proposed method demonstrates better performance than conventional optimization methods, which brings benefits to both basis pursuit and orthogonal matching pursuit.
Optimized Projection Matrix for Compressive Sensing  [cached]
Jianping Xu,Yiming Pi,Zongjie Cao
EURASIP Journal on Advances in Signal Processing , 2010, DOI: 10.1155/2010/560349
Abstract: Compressive sensing (CS) is mainly concerned with low-coherence pairs, since the number of samples needed to recover the signal is proportional to the mutual coherence between projection matrix and sparsifying matrix. Until now, papers on CS always assume the projection matrix to be a random matrix. In this paper, aiming at minimizing the mutual coherence, a method is proposed to optimize the projection matrix. This method is based on equiangular tight frame (ETF) design because an ETF has minimum coherence. It is impossible to solve the problem exactly because of the complexity. Therefore, an alternating minimization type method is used to find a feasible solution. The optimally designed projection matrix can further reduce the necessary number of samples for recovery or improve the recovery accuracy. The proposed method demonstrates better performance than conventional optimization methods, which brings benefits to both basis pursuit and orthogonal matching pursuit.
Bi-level Protected Compressive Sampling  [PDF]
Leo Yu Zhang,Kwok-Wo Wong,Yushu Zhang,Jiantao Zhou
Mathematics , 2014,
Abstract: Some pioneering works have investigated embedding cryptographic properties in compressive sampling (CS) in a way similar to one-time pad symmetric cipher. This paper tackles the problem of constructing a CS-based symmetric cipher under the key reuse circumstance, i.e., the cipher is resistant to common attacks even a fixed measurement matrix is used multiple times. To this end, we suggest a bi-level protected CS (BLP-CS) model which makes use of the advantage of the non-RIP measurement matrix construction. Specifically, two kinds of artificial basis mismatch techniques are investigated to construct key-related sparsifying bases. It is demonstrated that the encoding process of BLP-CS is simply a random linear projection, which is the same as the basic CS model. However, decoding the linear measurements requires knowledge of both the key-dependent sensing matrix and its sparsifying basis. The proposed model is exemplified by sampling images as a joint data acquisition and protection layer for resource-limited wireless sensors. Simulation results and numerical analyses have justified that the new model can be applied in circumstances where the measurement matrix can be re-used.
Application of Compressive Sensing Theory for the Reconstruction of Signals in Plastic Scintillators  [PDF]
L. Raczyński,P. Kowalski,T. Bednarski,P. Bia?as,E. Czerwiński,?. Kap?on,A. Kochanowski,G. Korcyl,J. Kowal,T. Kozik,W. Krzemień,M. Molenda,P. Moskal,Sz. Nied?wiecki,M. Pa?ka,M. Pawlik,Z. Rudy,P. Salabura,N. G. Sharma,M. Silarski,A. S?omski,J. Smyrski,A. Strzelecki,W. Wi?licki,M. Zieliński
Physics , 2013, DOI: 10.5506/APhysPolBSupp.6.1121
Abstract: Compressive Sensing theory says that it is possible to reconstruct a measured signal if an enough sparse representation of this signal exists in comparison to the number of random measurements. This theory was applied to reconstruct signals from measurements of plastic scintillators. Sparse representation of obtained signals was found using SVD transform.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.