• Proceedings of the KSMRM Conference
• /
• 2007.10a
• /
• pp.21-21
• /
• 2007

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.1
• /
• pp.53-76
• /
• 2020

The synchronous phasor measurement algorithm is the core content of the phasor measurement unit. This manuscript proposes a dynamic synchronous phasor measurement algorithm based on compressed sensing theory. First, a dynamic signal model based on the Taylor series was established. The dynamic power signal was preprocessed using a least mean square error adaptive filter to eliminate interference from noise and harmonic components. A Chirplet overcomplete dictionary was then designed to realize a sparse representation. A reduction of the signal dimension was next achieved using a Gaussian observation matrix. Finally, the improved orthogonal matching pursuit algorithm was used to realize the sparse decomposition of the signal to be detected, the amplitude and phase of the original power signal were estimated according to the best matching atomic parameters, and the total vector error index was used for an error evaluation. Chroma 61511 was used for the output of various signals, the simulation results of which show that the proposed algorithm cannot only effectively filter out interference signals, it also achieves a better dynamic response performance and stability compared with a traditional DFT algorithm and the improved DFT synchronous phasor measurement algorithm, and the phasor measurement accuracy of the signal is greatly improved. In practical applications, the hardware costs of the system can be further reduced.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.9
• /
• pp.85-91
• /
• 2012

When an image is reconstructed by the conventional compressed sensing with random measurement points, most degradation in the reconstructed image occurs in the transient regions. To solve this problem, in this paper, an adaptive compressed sensing that estimates the transient regions in the image and acquires more data at those regions is proposed, which can reconstruct an image with higher quality. The proposed method roughly analyzes the characteristics of image using the randomly-acquired data, acquires additional data at the adaptively-determined points based on the image characteristics, and reconstructs the final image. It is confirmed that with the same number of acquired data, the proposed method reconstructs the image of higher quality than the conventional method.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.4
• /
• pp.155-162
• /
• 2013

The conventional block-based compressed sensing uses a fixed block size for signal reconstruction, and the reconstructed signal is degraded because the block size suitable to the signal characteristics is not used. To solve this problem, in this paper, a variable block size method for compressed sensing is proposed that estimates the signal characteristics and selects a proper block size for each frame, thereby improving the quality of the reconstructed signal. The proposed method reconstructs the signal with different block sizes, analyzes the signal characteristics using correlation coefficients for each frame, and select the block size for the frame. It is confirmed that, with the same acquired data, the proposed method reconstructs the signal of higher quality than the conventional fixed block size method.

• Nuclear Engineering and Technology
• /
• v.52 no.7
• /
• pp.1495-1502
• /
• 2020

A new method of X-ray source spectrum estimation based on compressed sensing is proposed in this paper. The algorithm K-SVD is applied for sparse representation. Nonnegative constraints are added by modifying the L₁ reconstruction algorithm proposed by Rosset and Zhu. The estimation method is demonstrated on simulated spectra typical of mammography and CT. X-ray spectra are simulated with the Monte Carlo code Geant4. The proposed method is successfully applied to highly ill conditioned and under determined estimation problems with a good performance of suppressing noises. Results with acceptable accuracies (MSE < 5%) can be obtained with 10% Gaussian white noises added to the simulated experimental data. The biggest difference between the proposed method and the existing methods is that multiple prior knowledge of X-ray spectra can be included in one dictionary, which is meaningful for obtaining the true X-ray spectrum from the measurements.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.9
• /
• pp.106-113
• /
• 2015

This paper integrates human visual system (HVS) characteristics into compressed sensing recovery of color images. The proposed visual weighting of each color channel in group-sparsity minimization not only pursues sparsity level of image but also reflects HVS characteristics well. Additionally, an edge-preserving filter is embedded in the scheme to remove noise while preserving edges of image so that quality of reconstructed image is further enhanced. Experimental results show that the average PSNR of the proposed method is 0.56 ~ 4dB higher than that of the state-of-the art group-sparsity minimization method. These results prove the excellence of the proposed method in both terms of objective and subjective qualities.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.5
• /
• pp.572-578
• /
• 2018

This paper considers Group Testing as one of combinatorial problems. The group testing first began to inspect soldier's syphilis infection during World War II and have long established an academic basis. Recently, there has been much interest in related areas because of the rediscovery of the value of the group testing. The group testing is the same as finding a few defect samples out of a large number of samples, which is similar to the inverse problem of Compressed Sensing. In this paper, we introduce the definition of the group testing, and specify the classes of the group testing and the bounds on performance of the group testing. In addition, we show a lower bound for the number of tests required to find defective samples using the theoretical theorem which is mainly used for relationship between conditional entropy and the probability of error in the information theory. We see how our result can be different from other related results.

• Investigative Magnetic Resonance Imaging
• /
• v.23 no.2
• /
• pp.114-124
• /
• 2019

Purpose: We investigate biases in the assessments of left ventricular function (LVF), by compressed sensing (CS)-cine magnetic resonance imaging (MRI). Materials and Methods: Cardiovascular cine images with short axis view, were obtained for 8 volunteers without CS. LVFs were assessed with subsampled data, with compression factors (CF) of 2, 3, 4, and 8. A semi-automatic segmentation program was used, for the assessment. The assessments by 3 CS methods (ITSC, FOCUSS, and view sharing (VS)), were compared to those without CS. Bland-Altman analysis and paired t-test were used, for comparison. In addition, real-time CS-cine imaging was also performed, with CF of 2, 3, 4, and 8 for the same volunteers. Assessments of LVF were similarly made, for CS data. A fixed compensation technique is suggested, to reduce the bias. Results: The assessment of LVF by CS-cine, includes bias and random noise. Bias appeared much larger than random noise. Median of end-diastolic volume (EDV) with CS-cine (ITSC or FOCUSS) appeared -1.4% to -7.1% smaller, compared to that of standard cine, depending on CF from (2 to 8). End-systolic volume (ESV) appeared +1.6% to +14.3% larger, stroke volume (SV), -2.4% to -16.4% smaller, and ejection fraction (EF), -1.1% to -9.2% smaller, with P < 0.05. Bias was reduced from -5.6% to -1.8% for EF, by compensation applied to real-time CS-cine (CF = 8). Conclusion: Loss of temporal resolution by adopting missing data from nearby cardiac frames, causes an underestimation for EDV, and an overestimation for ESV, resulting in underestimations for SV and EF. The bias is not random. Thus it should be removed or reduced for better diagnosis. A fixed compensation is suggested, to reduce bias in the assessment of LVF.

• Investigative Magnetic Resonance Imaging
• /
• v.14 no.1
• /
• pp.10-20
• /
• 2010

Purpose : Recently, the Recon Challenge at the 2009 ISMRM workshop on Data Sampling and Image Reconstruction at Sedona, Arizona was held to evaluate feasibility of highly accelerated acquisition of time resolved contrast enhanced MR angiography. This paper provides the step-by-step description of the winning results of k-t FOCUSS in this competition. Materials and Methods : In previous works, we proved that k-t FOCUSS algorithm successfully solves the compressed sensing problem even for less sparse cardiac cine applications. Therefore, using k-t FOCUSS, very accurate time resolved contrast enhanced MR angiography can be reconstructed. Accelerated radial trajectory data were synthetized from X-ray cerebral angiography images and provided by the organizing committee, and radiologists double blindly evaluated each reconstruction result with respect to the ground-truth data. Results : The reconstructed results at various acceleration factors demonstrate that each components of compressed sensing, such as sparsifying transform and incoherent sampling patterns, etc can have profound effects on the final reconstruction results. Conclusion : From reconstructed results, we see that the compressed sensing dynamic MR imaging algorithm, k-t FOCUSS enables high resolution time resolved contrast enhanced MR angiography.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3498-3511
• /
• 2016

We investigate the channel state information (CSI) in multi-input multi-output (MIMO) cooperative networks that employ the amplify-and-forward transmission scheme. Least squares and expectation conditional maximization have been proposed in the system. However, neither of these two approaches takes advantage of channel sparsity, and they cause estimation performance loss. Unlike linear channel estimation methods, several compressed channel estimation methods are proposed in this study to exploit the sparsity of the MIMO cooperative channels based on the theory of compressed sensing. First, the channel estimation problem is formulated as a compressed sensing problem by using sparse decomposition theory. Second, the lower bound is derived for the estimation, and the MIMO relay channel is reconstructed via compressive sampling matching pursuit algorithms. Finally, based on this model, we propose a novel algorithm so called sparsity adaptive expectation maximization (SAEM) by using Kalman filter and expectation maximization algorithm so that it can exploit channel sparsity alternatively and also track the true support set of time-varying channel. Kalman filter is used to provide soft information of transmitted signals to the EM-based algorithm. Various numerical simulation results indicate that the proposed sparse channel estimation technique outperforms the previous estimation schemes.