• Title, Summary, Keyword: sparse reconstruction

Search Result 74, Processing Time 0.029 seconds

Sparse reconstruction of guided wavefield from limited measurements using compressed sensing

  • Qiao, Baijie;Mao, Zhu;Sun, Hao;Chen, Songmao;Chen, Xuefeng
    • Smart Structures and Systems
    • /
    • v.25 no.3
    • /
    • pp.369-384
    • /
    • 2020
  • A wavefield sparse reconstruction technique based on compressed sensing is developed in this work to dramatically reduce the number of measurements. Firstly, a severely underdetermined representation of guided wavefield at a snapshot is established in the spatial domain. Secondly, an optimal compressed sensing model of guided wavefield sparse reconstruction is established based on l1-norm penalty, where a suite of discrete cosine functions is selected as the dictionary to promote the sparsity. The regular, random and jittered undersampling schemes are compared and selected as the undersampling matrix of compressed sensing. Thirdly, a gradient projection method is employed to solve the compressed sensing model of wavefield sparse reconstruction from highly incomplete measurements. Finally, experiments with different excitation frequencies are conducted on an aluminum plate to verify the effectiveness of the proposed sparse reconstruction method, where a scanning laser Doppler vibrometer as the true benchmark is used to measure the original wavefield in a given inspection region. Experiments demonstrate that the missing wavefield data can be accurately reconstructed from less than 12% of the original measurements; The reconstruction accuracy of the jittered undersampling scheme is slightly higher than that of the random undersampling scheme in high probability, but the regular undersampling scheme fails to reconstruct the wavefield image; A quantified mapping relationship between the sparsity ratio and the recovery error over a special interval is established with respect to statistical modeling and analysis.

Block Sparse Signals Recovery via Block Backtracking-Based Matching Pursuit Method

  • Qi, Rui;Zhang, Yujie;Li, Hongwei
    • Journal of Information Processing Systems
    • /
    • v.13 no.2
    • /
    • pp.360-369
    • /
    • 2017
  • In this paper, a new iterative algorithm for reconstructing block sparse signals, called block backtracking-based adaptive orthogonal matching pursuit (BBAOMP) method, is proposed. Compared with existing methods, the BBAOMP method can bring some flexibility between computational complexity and reconstruction property by using the backtracking step. Another outstanding advantage of BBAOMP algorithm is that it can be done without another information of signal sparsity. Several experiments illustrate that the BBAOMP algorithm occupies certain superiority in terms of probability of exact reconstruction and running time.

Block Sparse Signals Recovery Algorithm for Distributed Compressed Sensing Reconstruction

  • Chen, Xingyi;Zhang, Yujie;Qi, Rui
    • Journal of Information Processing Systems
    • /
    • v.15 no.2
    • /
    • pp.410-421
    • /
    • 2019
  • Distributed compressed sensing (DCS) states that we can recover the sparse signals from very few linear measurements. Various studies about DCS have been carried out recently. In many practical applications, there is no prior information except for standard sparsity on signals. The typical example is the sparse signals have block-sparse structures whose non-zero coefficients occurring in clusters, while the cluster pattern is usually unavailable as the prior information. To discuss this issue, a new algorithm, called backtracking-based adaptive orthogonal matching pursuit for block distributed compressed sensing (DCSBBAOMP), is proposed. In contrast to existing block methods which consider the single-channel signal reconstruction, the DCSBBAOMP resorts to the multi-channel signals reconstruction. Moreover, this algorithm is an iterative approach, which consists of forward selection and backward removal stages in each iteration. An advantage of this method is that perfect reconstruction performance can be achieved without prior information on the block-sparsity structure. Numerical experiments are provided to illustrate the desirable performance of the proposed method.

Hyperspectral Image Classification via Joint Sparse representation of Multi-layer Superpixles

  • Sima, Haifeng;Mi, Aizhong;Han, Xue;Du, Shouheng;Wang, Zhiheng;Wang, Jianfang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.10
    • /
    • pp.5015-5038
    • /
    • 2018
  • In this paper, a novel spectral-spatial joint sparse representation algorithm for hyperspectral image classification is proposed based on multi-layer superpixels in various scales. Superpixels of various scales can provide complete yet redundant correlated information of the class attribute for test pixels. Therefore, we design a joint sparse model for a test pixel by sampling similar pixels from its corresponding superpixels combinations. Firstly, multi-layer superpixels are extracted on the false color image of the HSI data by principal components analysis model. Secondly, a group of discriminative sampling pixels are exploited as reconstruction matrix of test pixel which can be jointly represented by the structured dictionary and recovered sparse coefficients. Thirdly, the orthogonal matching pursuit strategy is employed for estimating sparse vector for the test pixel. In each iteration, the approximation can be computed from the dictionary and corresponding sparse vector. Finally, the class label of test pixel can be directly determined with minimum reconstruction error between the reconstruction matrix and its approximation. The advantages of this algorithm lie in the development of complete neighborhood and homogeneous pixels to share a common sparsity pattern, and it is able to achieve more flexible joint sparse coding of spectral-spatial information. Experimental results on three real hyperspectral datasets show that the proposed joint sparse model can achieve better performance than a series of excellent sparse classification methods and superpixels-based classification methods.

An Efficient Model Based on Smoothed ℓ0 Norm for Sparse Signal Reconstruction

  • Li, Yangyang;Sun, Guiling;Li, Zhouzhou;Geng, Tianyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.4
    • /
    • pp.2028-2041
    • /
    • 2019
  • Compressed sensing (CS) is a new theory. With regard to the sparse signal, an exact reconstruction can be obtained with sufficient CS measurements. Nevertheless, in practical applications, the transform coefficients of many signals usually have weak sparsity and suffer from a variety of noise disturbances. What's worse, most existing classical algorithms are not able to effectively solve this issue. So we proposed an efficient algorithm based on smoothed ${\ell}_0$ norm for sparse signal reconstruction. The direct ${\ell}_0$ norm problem is NP hard, but it is unrealistic to directly solve the ${\ell}_0$ norm problem for the reconstruction of the sparse signal. To select a suitable sequence of smoothed function and solve the ${\ell}_0$ norm optimization problem effectively, we come up with a generalized approximate function model as the objective function to calculate the original signal. The proposed model preserves sharper edges, which is better than any other existing norm based algorithm. As a result, following this model, extensive simulations show that the proposed algorithm is superior to the similar algorithms used for solving the same problem.

A Study on the Reconstruction of a Frame Based Speech Signal through Dictionary Learning and Adaptive Compressed Sensing (Adaptive Compressed Sensing과 Dictionary Learning을 이용한 프레임 기반 음성신호의 복원에 대한 연구)

  • Jeong, Seongmoon;Lim, Dongmin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.12
    • /
    • pp.1122-1132
    • /
    • 2012
  • Compressed sensing has been applied to many fields such as images, speech signals, radars, etc. It has been mainly applied to stationary signals, and reconstruction error could grow as compression ratios are increased by decreasing measurements. To resolve the problem, speech signals are divided into frames and processed in parallel. The frames are made sparse by dictionary learning, and adaptive compressed sensing is applied which designs the compressed sensing reconstruction matrix adaptively by using the difference between the sparse coefficient vector and its reconstruction. Through the proposed method, we could see that fast and accurate reconstruction of non-stationary signals is possible with compressed sensing.

Quantitative Evaluation of Sparse-view CT Images Obtained with Iterative Image Reconstruction Methods (반복적 연산으로 얻은 Sparse-view CT 영상에 대한 정량적 평가)

  • Kim, H.S.;Gao, Jie;Cho, M.H.;Lee, S.Y.
    • Journal of Biomedical Engineering Research
    • /
    • v.32 no.3
    • /
    • pp.257-263
    • /
    • 2011
  • Sparse-view CT imaging is considered to be a solution to reduce x-ray dose of CT. Sparse-view CT imaging may have severe streak artifacts that could compromise the image qualities. We have compared quality of sparseview images reconstructed with two representative iterative reconstruction techniques, SIRT and TV-minimization, in terms of image error and edge preservation. In the comparison study, we have used the Shepp-Logan phantom image and real CT images obtained with a micro-CT. In both phantom image and real CT image tests, TV-minimization technique shows the best performance in error reduction and preserving edges. However, the excessive computation time of TV-minimization is a technical challenge for the practical use.

Light-Microscopy-Based Sparse Neural Circuit Reconstruction: Array Tomography and Other Methods

  • Rah, Jong-Cheol
    • Applied Microscopy
    • /
    • v.46 no.4
    • /
    • pp.176-178
    • /
    • 2016
  • Efficient neural circuit reconstruction requires sufficient lateral and axial resolution to resolve individual synapses and map a large enough volume of brain tissue to reveal the molecular identity and origin of these synapses. Sparse circuit reconstruction using array tomography meets many of these requirements but also has some limitations. In this minireview, the advantages and disadvantages of applicable imaging techniques will be discussed.

Distributed Video Compressive Sensing Reconstruction by Adaptive PCA Sparse Basis and Nonlocal Similarity

  • Wu, Minghu;Zhu, Xiuchang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.8
    • /
    • pp.2851-2865
    • /
    • 2014
  • To improve the rate-distortion performance of distributed video compressive sensing (DVCS), the adaptive sparse basis and nonlocal similarity of video are proposed to jointly reconstruct the video signal in this paper. Due to the lack of motion information between frames and the appearance of some noises in the reference frames, the sparse dictionary, which is constructed using the examples directly extracted from the reference frames, has already not better obtained the sparse representation of the interpolated block. This paper proposes a method to construct the sparse dictionary. Firstly, the example-based data matrix is constructed by using the motion information between frames, and then the principle components analysis (PCA) is used to compute some significant principle components of data matrix. Finally, the sparse dictionary is constructed by these significant principle components. The merit of the proposed sparse dictionary is that it can not only adaptively change in terms of the spatial-temporal characteristics, but also has ability to suppress noises. Besides, considering that the sparse priors cannot preserve the edges and textures of video frames well, the nonlocal similarity regularization term has also been introduced into reconstruction model. Experimental results show that the proposed algorithm can improve the objective and subjective quality of video frame, and achieve the better rate-distortion performance of DVCS system at the cost of a certain computational complexity.

Improvement of Analytic Reconstruction Algorithms Using a Sinogram Interpolation Method for Sparse-angular Sampling with a Photon-counting Detector

  • Kim, Dohyeon;Jo, Byungdu;Park, Su-Jin;Kim, Hyemi;Kim, Hee-Joung
    • Progress in Medical Physics
    • /
    • v.27 no.3
    • /
    • pp.105-110
    • /
    • 2016
  • Sparse angular sampling has been studied recently owing to its potential to decrease the radiation exposure from computed tomography (CT). In this study, we investigated the analytic reconstruction algorithm in sparse angular sampling using the sinogram interpolation method for improving image quality and computation speed. A prototype of the spectral CT system, which has a 64-pixel Cadmium Zinc Telluride (CZT)-based photon-counting detector, was used. The source-to-detector distance and the source-to-center of rotation distance were 1,200 and 1,015 mm, respectively. Two energy bins (23~33 keV and 34~44 keV) were set to obtain two reconstruction images. We used a PMMA phantom with height and radius of 50.0 mm and 17.5 mm, respectively. The phantom contained iodine, gadolinium, calcification, and lipid. The Feld-kamp-Davis-Kress (FDK) with the sinogram interpolation method and Maximum Likelihood Expectation Maximization (MLEM) algorithm were used to reconstruct the images. We evaluated the signal-to-noise ratio (SNR) of the materials. The SNRs of iodine, calcification, and liquid lipid were increased by 167.03%, 157.93%, and 41.77%, respectively, with the 23~33 keV energy bin using the sinogram interpolation method. The SNRs of iodine, calcification, and liquid state lipid were also increased by 107.01%, 13.58%, and 27.39%, respectively, with the 34~44 keV energy bin using the sinogram interpolation method. Although the FDK algorithm with the sinogram interpolation did not produce better results than the MLEM algorithm, it did result in comparable image quality to that of the MLEM algorithm. We believe that the sinogram interpolation method can be applied in various reconstruction studies using the analytic reconstruction algorithm. Therefore, the sinogram interpolation method can improve the image quality in sparse-angular sampling and be applied to CT applications.