• 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 Communications and Networks
• /
• v.12 no.4
• /
• pp.317-329
• /
• 2010

In recent years, many sparse estimation methods, also known as compressed sensing, have been developed. However, most of these methods presume that the measurement matrix is completely known. We develop a new blind maximum likelihood method-the expectation-sparse-maximization (ESpaM) algorithm-for models where the measurement matrix is the product of one unknown and one known matrix. This method is a variant of the expectation-maximization algorithm to deal with the resulting problem that the maximization step is no longer unique. The ESpaM algorithm is justified theoretically. We present as well numerical results for two concrete examples of blind channel identification in digital communications, a doubly-selective channel model and linear time invariant sparse channel model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.4160-4176
• /
• 2015

Data compression like image and video compression has come a long way since the introduction of Compressive Sensing (CS) which compresses sparse signals such as images, videos etc. to very few samples i.e. M < N measurements. At the receiver end, a robust and efficient recovery algorithm estimates the original image or video. Many prominent algorithms solve least squares problem (LSP) iteratively in order to reconstruct the signal hence consuming more processing time. In this paper non-iterative threshold based recovery algorithm (NITRA) is proposed for the recovery of images and videos without solving LSP, claiming reduced complexity and better reconstruction quality. The elapsed time for images and videos using NITRA is in ㎲ range which is 100 times less than other existing algorithms. The peak signal to noise ratio (PSNR) is above 30 dB, structural similarity (SSIM) and structural content (SC) are of 99%.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.6
• /
• pp.167-173
• /
• 2016

Compressed Sensing(CS) is the theory that can recover signals which are sampled below the Nyquist sampling rate to original analog signals. In this paper, we propose the estimation algorithm of ultrasonic attenuation coefficients in the frequency domain using CS. While most estimation algorithms transform the time-domain signals into the frequency-domain using the Fourier transform, the proposed method directly utilize the spectral information in the recovery process by the basis matrix without the completely recovered signals in the time domain. We apply three transform bases for sparsifying and estimate the attenuation coefficients using the Centroid Downshift method with Dual-reference diffraction compensation technique. The estimation accuracy and execution time are compared for each basis matrix. Computer simulation results show that the DCT basis matrix exhibits less than 0.35% estimation error for the compressive ratio of 50% and about 6% average error for the compressive ratio of 70%. The proposed method which directly extracts frequency information from the CS signals can be extended to estimating for other ultrasonic parameters in the Quantitative Ultrasound (QUS) Analysis.

• Journal of Communications and Networks
• /
• v.18 no.1
• /
• pp.95-104
• /
• 2016

Massive multiple-input multiple-output (MIMO) is a promising approach for cellular communication due to its energy efficiency and high achievable data rate. These advantages, however, can be realized only when channel state information (CSI) is available at the transmitter. Since there are many antennas, CSI is too large to feed back without compression. To compress CSI, prior work has applied compressive sensing (CS) techniques and the fact that CSI can be sparsified. The adopted sparsifying bases fail, however, to reflect the spatial correlation and channel conditions or to be feasible in practice. In this paper, we propose a new sparsifying basis that reflects the long-term characteristics of the channel, and needs no change as long as the spatial correlation model does not change. We propose a new reconstruction algorithm for CS, and also suggest dimensionality reduction as a compression method. To feed back compressed CSI in practice, we propose a new codebook for the compressed channel quantization assuming no other-cell interference. Numerical results confirm that the proposed channel feedback mechanisms show better performance in point-to-point (single-user) and point-to-multi-point (multi-user) scenarios.

• Journal of Broadcast Engineering
• /
• v.17 no.6
• /
• pp.954-963
• /
• 2012

As a greedy algorithm reconstructing the sparse signal from underdetermined system, orthogonal matching pursuit (OMP) algorithm has received much attention. In this paper, we multiple candidate matching pursuit (MuCaMP), which builds up candidate support set in every iteration and uses the minimum residual at last iteration. Using the restricted isometry property (RIP), we derive the sufficient condition for MuCaMP to recover the sparse signal exactly. The MuCaMP guarantees to reconstruct the K-sparse signal when the sensing matrix satisfies the RIP constant ${\delta}_{N+K}<\frac{\sqrt{N}}{\sqrt{K}+3\sqrt{N}}$. In addition, we show a recovery performance both noiseless and noisy measurements.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.583-599
• /
• 2015

We apply the Bayesian matching pursuit (BMP) algorithm to the estimation of time-frequency selective channels in orthogonal frequency division multiplexing (OFDM) systems. By exploiting prior statistics and sparse characteristics of propagation channels, the Bayesian method provides a more accurate and efficient detection of the channel status information (CSI) than do conventional sparse channel estimation methods that are based on compressive sensing (CS) technologies. Using a reasonable approximation of the system model and a skillfully designed pilot arrangement, the proposed estimation scheme is able to address the Doppler-induced inter-carrier interference (ICI) with a relatively low complexity. Moreover, to further reduce the computational cost of the channel estimation, we make some modifications to the BMP algorithm. The modified algorithm can make good use of the group-sparse structure of doubly selective channels and thus reconstruct the CSI more efficiently than does the original BMP algorithm, which treats the sparse signals in the conventional manner and ignores the specific structure of their sparsity patterns. Numerical results demonstrate that the proposed Bayesian estimation has a good performance over rapidly time-varying channels.

• Journal of the Korea institute for structural maintenance and inspection
• /
• v.24 no.2
• /
• pp.23-32
• /
• 2020

The compression sensing technology, CAFB, was developed to obtain the raw signal of the target structure by compressing it into a signal of the intended frequency range. At this point, for compression sensing, the CAFB can be optimized for various reference signals depending on the desired frequency range of the target structure. In addition, optimized CAFB should be able to efficiently compress the effective structural answers of the target structure even in sudden/dangerous conditions such as earthquakes. In this paper, the targeted frequency range for efficient structural integrity monitoring of relatively flexible structures was set below 10Hz, and the optimization method of CAFB for this purpose and the seismic response performance of CAFB in seismic conditions were evaluated experimentally. To this end, in this paper, CAFB was first optimized using Kobe seismic waveform, and embedded it in its own wireless IDAQ system. In addition, seismic response tests were conducted on two span bridges using Kobe seismic waveform. Finally, using an IDAQ system with built-in CAFB, the seismic response of the two-span bridge was wirelessly obtained, and the compression signal obtained was cross-referenced with the raw signal. From the results of the experiment, the compression signal showed excellent response performance and data compression effects in relation to the raw signal, and CAFB was able to effectively compress and sensitize the effective structural response of the structure even in seismic situations. Finally, in this paper, the optimization method of CAFB was presented to suit the intended frequency range (less than 10Hz), and CAFB proved to be an economical and efficient data compression sensing technology for instrumentation-monitoring of seismic conditions.