• ETRI Journal
• /
• v.37 no.6
• /
• pp.1251-1258
• /
• 2015

We investigate an image recovery method for sparse-view computed tomography (CT) using an iterative shrinkage algorithm based on a second-order approach. The two-step iterative shrinkage-thresholding (TwIST) algorithm including a total variation regularization technique is elucidated to be more robust than other first-order methods; it enables a perfect restoration of an original image even if given only a few projection views of a parallel-beam geometry. We find that the incoherency of a projection system matrix in CT geometry sufficiently satisfies the exact reconstruction principle even when the matrix itself has a large condition number. Image reconstruction from fan-beam CT can be well carried out, but the retrieval performance is very low when compared to a parallel-beam geometry. This is considered to be due to the matrix complexity of the projection geometry. We also evaluate the image retrieval performance of the TwIST algorithm -sing measured projection data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.2109-2123
• /
• 2017

This paper presents a super-resolution reconstruction method based on sparse representation for two-dimensional bar code images. Considering the features of two-dimensional bar code images, Kirsch and LBP (local binary pattern) operators are used to extract the edge gradient and texture features. Feature extraction is constituted based on these two features and additional two second-order derivatives. By joint dictionary learning of the low-resolution and high-resolution image patch pairs, the sparse representation of corresponding patches is the same. In addition, the global constraint is exerted on the initial estimation of high-resolution image which makes the reconstructed result closer to the real one. The experimental results demonstrate the effectiveness of the proposed algorithm for two-dimensional bar code images by comparing with other reconstruction algorithms.

• 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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.9
• /
• pp.2087-2093
• /
• 2014

In this paper, an orthogonal matching pursuit (OMP) method combined with genetic algorithm (GA), named GAOMP, is proposed for sparse signal recovery. Some recent greedy algorithms such as SP, CoSaMP, and gOMP improved the reconstruction performance by deleting unsuitable atoms at each iteration. However they still often fail to converge to the solution because the support set could not avoid the local minimum during the iterations. Mutating the candidate support set chosen by the OMP algorithm, GAOMP is able to escape from the local minimum and hence recovers the sparse signal. Experimental results show that GAOMP outperforms several OMP based algorithms and the $l_1$ optimization method in terms of exact reconstruction probability.

• Structural Monitoring and Maintenance
• /
• v.3 no.3
• /
• pp.195-214
• /
• 2016

Monitoring of impact loads is a very important technique in the field of structural health monitoring (SHM). However, in most cases it is not possible to measure impact events directly, so they need to be reconstructed. Impact load reconstruction refers to the problem of estimating an input to a dynamic system when the system output and the impulse response function are usually known. Generally this leads to a so called ill-posed inverse problem. It is reasonable to use prior knowledge of the force in order to develop more suitable reconstruction strategies and to increase accuracy. An impact event is characterized by a short time duration and a spatial concentration. Moreover the force time history of an impact has a specific shape, which also can be taken into account. In this contribution these properties of the external force are employed to create a sample-force-dictionary and thus to transform the ill-posed problem into a sparse recovery task. The sparse solution is acquired by solving a minimization problem known as basis pursuit denoising (BPDN). The reconstruction approach shown here is capable to estimate simultaneously the magnitude of the impact and the impact location, with a minimum number of accelerometers. The possibility of reconstructing the impact based on a noisy output signal is first demonstrated with simulated measurements of a simple beam structure. Then an experimental investigation of a real beam is performed.

• Journal of Satellite, Information and Communications
• /
• v.9 no.4
• /
• pp.104-110
• /
• 2014

This paper considers two reconstruction schemes of structured-sparse signals, turbo inference and Markov chain Monte Carlo (MCMC) inference, in compressed sensing(CS) technique that is recently getting an important issue for an efficient video wireless transmission system using multi-copter as an unmanned aerial vehicle. Proposed reconstruction algorithms are setting importance on reduction of image data sizes, fast reconstruction speed and errorless reconstruction. As a result of experimentation with twenty kinds of images, we can find turbo reconstruction algorithm based on loopy belief propagation(BP) has more excellent performances than MCMC algorithm based on Gibbs sampling as aspects of average reconstruction computation time, normalized mean squared error(NMSE) values.

• Smart Structures and Systems
• /
• v.25 no.2
• /
• pp.123-133
• /
• 2020

Compressive sensing (CS) is a newly developed data acquisition and processing technique that takes advantage of the sparse structure in signals. Normally signals in their primitive space or format are reconstructed from their compressed measurements for further treatments, such as modal analysis for vibration data. This approach causes problems such as leakage, loss of fidelity, etc., and the computation of reconstruction itself is costly as well. Therefore, it is appealing to directly work on the compressed data without prior reconstruction of the original data. In this paper, a direct approach for modal analysis of damped systems is proposed by decomposing the compressed measurements with an appropriate dictionary. The damped free vibration function is adopted to form atoms in the dictionary for the following sparse decomposition. Compared with the normally used Fourier bases, the damped free vibration function spans a space with both the frequency and damping as the control variables. In order to efficiently search the enormous two-dimension dictionary with frequency and damping as variables, a two-step strategy is implemented combined with the Orthogonal Matching Pursuit (OMP) to determine the optimal atom in the dictionary, which greatly reduces the computation of the sparse decomposition. The performance of the proposed method is demonstrated by a numerical and an experimental example, and advantages of the method are revealed by comparison with another such kind method using POD technique.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.8
• /
• pp.12-19
• /
• 2017

In this paper a super-resolution time delay estimation algorithm that estimates the time delays of spread spectrum signals using sparse signal reconstruction approach is introduced. So far, the correlation method has been mostly used to estimate the time delays of spread spectrum signals. However it fails to accurately estimate the time delays in the case where the signals are spaced within approximately 1 PN chip duration and a further processing should be applied to the correlation outputs in order to enhance the resolution capability. Recently sparse signal approaches attract much interest in the area of directions-of-arrival estimation, of which SPICE is the most representative. Thus we introduce a super-resolution time delay estimation algorithm based on the SPICE approach and compare its performance with that of MUSIC algorithm by applying them to the ISO/IEC 24730-2.1 RTLS system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.657-667
• /
• 2019

This paper studies synthetic aperture radar (SAR) imaging problem which the scatterers are often distributed in block sparse pattern. To exploiting the sparse geometrical feature, a Kronecker constrained SAR imaging algorithm is proposed by combining the block sparse characteristics with the multiway sparse reconstruction framework with Tucker modeling. We validate the proposed algorithm via real data and it shows that the our algorithm can achieve better accuracy and convergence than the reference methods even in the demanding environment. Meanwhile, the complexity is smaller than that of the existing methods. The simulation experiments confirmed the effectiveness of the algorithm as well.

• The Journal of the Acoustical Society of Korea
• /
• v.37 no.1
• /
• pp.12-20
• /
• 2018

Efforts have been made to reconstruct low-resolution underwater images to high-resolution ones by using the image SR (Super-Resolution) method, all to improve efficiency when acquiring side-scan sonar images. As side-scan sonar images are similar with the optical images with respect to exploiting 2-dimensional signals, conventional image restoration methods for optical images can be considered as a solution. One of the most typical super-resolution methods for optical image is a sparse coding and there are studies for verifying applicability of sparse coding method for underwater images by analyzing sparsity of underwater images. Sparse coding is a method that obtains recovered signal from input signal by linear combination of dictionary and sparse coefficients. However, it requires huge computational load to accurately estimate sparse coefficients. In this study, a sparse coding based underwater image super-resolution method is applied while a selective reconstruction method for object region is suggested to reduce the processing time. For this method, this paper proposes an edge detection and object and non object region classification method for underwater images and combine it with sparse coding based image super-resolution method. Effectiveness of the proposed method is verified by reducing the processing time for image reconstruction over 32 % while preserving same level of PSNR (Peak Signal-to-Noise Ratio) compared with conventional method.