• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.5
• /
• pp.25-31
• /
• 2009

The recently developed sampling theory, "compressed sensing" is gathering huge interest in MR reconstruction area because of its feasibility of high spatio-temporal resolution of dynamic MRI which has been limited in conventional methods based on Nyquist sampling theory. Since dynamic MRI usually has high redundant information along temporal direction, this can be very sparsely represented in most of cases. Therefore, compressed sensing that exploits the sparsity of unknown images can be effectively applied in most of dynamic MRI. This review article briefly introduces currently proposed compressed sensing based dynamic MR imaging algorithms and other methods exploiting sparsity. By comparing them with conventional methods, you may have insight how the compressed sensing based methods can impact nearly every area of clinical dynamic MRI.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.1
• /
• pp.58-78
• /
• 2016

Compressed sensing (CS) possesses the potential benefits for spectrum sensing of wideband signal in cognitive radio. The sparsity of signal in frequency domain denotes the number of occupied channels for spectrum sensing. This paper presents a scheme of adaptively adjusting the number of compressed measurements to reduce the unnecessary computational complexity when priori information about the sparsity of signal cannot be acquired. Firstly, a method of sparsity estimation is introduced because the sparsity of signal is not available in some cognitive radio environments, and the relationship between the amount of used data and estimation accuracy is discussed. Then the SNR of the compressed signal is derived in the closed form. Based on the SNR of the compressed signal and estimated sparsity, an adaptive algorithm of adjusting the number of compressed measurements is proposed. Finally, some simulations are performed, and the results illustrate that the simulations agree with theoretical analysis, which prove the effectiveness of the proposed adaptive adjusting of compressed measurements.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.5
• /
• pp.15-24
• /
• 2009

Compressed sensing addresses the recovery of a sparse vector from its few linear measurements. Recently, the success for the vector case has been extended to the matrix case. Compressed sensing of low-rank matrices solves the ill-posed inverse problem with fie low-rank prior. The problem can be formulated as either the rank minimization or the low-rank approximation. In this paper, we survey recently proposed efficient algorithms to solve these two formulations.

• Journal of Biomedical Engineering Research
• /
• v.31 no.6
• /
• pp.464-471
• /
• 2010

Compressed sensing can be used to reduce scan time or to enhance spatial resolution in MRI. It is now recognized that compressed sensing works well in reconstructing magnitude images if the sampling mask and the sparsifying transform are well chosen. Phase images also play important roles in MRI particularly in chemical shift imaging and magnetic resonance electrical impedance tomography (MREIT). We reconstruct MRI phase images using the compressed sensing technique. Through computer simulation and real MRI experiments, we reconstructed phase images using the compressed sensing technique and we compared them with the ones reconstructed by conventional Fourier reconstruction technique. As compared to conventional Fourier reconstruction with the same number of phase encoding steps, compressed sensing shows better performance in terms of mean squared phase error and edge preservation. We expect compressed sensing can be used to reduce the scan time or to enhance spatial resolution of MREIT.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.9
• /
• pp.2213-2231
• /
• 2013

Compressed sensing is a novel technology used in the field of wireless communication and sensor networks for channel estimation, signal detection, data gathering, network monitoring, and other applications. It plays a significant role in highly secure, real-time, well organized, and cost-effective data communication in smart-grid (SG) systems, which consist of multi-tier network standards that make it challenging to synchronize in power management communication. In this paper, we present a multi-layer communication model for SG systems and propose compressed-sensing based data transmission at every layer of the SG system to improve data transmission performance. Our approach is to utilize the compressed-sensing procedure at every layer in a controlled manner. Simulation results demonstrate that the proposed monitoring devices need less transmission power than conventional systems. Additionally, secure, reliable, and real-time data transmission is possible with the compressed-sensing technique.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.9
• /
• pp.765-774
• /
• 2013

In this paper, we present a cooperative compressed spectrum sensing scheme for correlated signals in decentralized wideband cognitive radio networks. Compressed sensing is a signal processing technique that can recover signals which are sampled below the Nyquist rate with high probability, and can solve the necessity of high-speed analog-to-digital converter problem for wideband spectrum sensing. In compressed sensing, one of the main issues is to design recovery algorithms which accurately recover original signals from compressed signals. In this paper, in order to achieve high recovery performance, we consider the multiple measurement vector model which has a sequence of compressed signals, and propose a cooperative sparse Bayesian recovery algorithm which models the temporal correlation of the input signals.

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

• Journal of Communications and Networks
• /
• v.17 no.5
• /
• pp.517-524
• /
• 2015

The fast and accurate spectrum sensing over an ultra-wide bandwidth is a big challenge for the radio environment cognition. Considering sparse signal feature, two novel compressed sensing schemes are proposed, which can reduce compressed sampling rate in contrast to the traditional scheme. One algorithm is dynamically adjusting compression ratio based on modulation recognition and identification of symbol rate, which can reduce compression ratio. Furthermore, without priori information of the modulation and symbol rate, another improved algorithm is proposed with the application potential in practice, which does not need to reconstruct the signals. The improved algorithm is divided into two stages, which are the approaching stage and the monitoring stage. The overall sampling rate can be dramatically reduced without the performance deterioration of the spectrum detection compared to the conventional static compressed sampling rate algorithm. Numerous results show that the proposed compressed sensing technique can reduce sampling rate by 35%, with an acceptable detection probability over 0.9.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.5
• /
• pp.32-39
• /
• 2009

Compressed Sensing is a method to sample analog signals at a rate under the Nyquist rate. With this scheme, it is possible to represent signals with a relatively smaller number of measurements than that of the conventional sampling method, and the original signals are reconstructed with high probability from the acquired measurements using the linear programming. Compressed sensing allows measurement time and/or the amount of ADC (analog-to-digital converter) resources for the signal acquisitions to be reduced. In this paper, we presents the backgrounds of the compressed sensing, a way to acquire measurements from an analog signal with a random basis, and the signal recovery method. Also we introduce applications of compressed sensing in wireless communications.