• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6C
• /
• pp.376-383
• /
• 2011

Since the first arrival path may not be the strongest path of UWB(Ultra Wide Band) multipath channels, this makes ToA(Time-of-Arrival) estimation becomes a challengeable issue. Furthermore, because of ultra bandwidth of received signals, the compressed sensing theory is employed to reduce the complexity caused by very high Nyquist sampling rate in coherent UWB receivers. In this paper, we propose a ToA estimation scheme which provides precise estimation performance, while exploiting the benefits of compressed sensing-based UWB receivers. Simulation results show that the proposed scheme can outperform other low complexity schemes in a wide range of signal-to-noise ratios.

• Journal of Korea Multimedia Society
• /
• v.20 no.5
• /
• pp.731-739
• /
• 2017

Distributed compressed video sensing (DCVS) is a framework that integrates both compressed sensing and distributed video coding characteristics to achieve a low complexity video sampling. In DCVS schemes, motion estimation & motion compensation is employed at the decoder side, similarly to distributed video coding (DVC), for a low-complex encoder. However, since a simple BCS-SPL algorithm is applied to a residual arising from motion estimation and compensation in conventional MC-BCS-SPL (motion compensated block compressed sensing with smoothed projected Landweber) scheme, the reconstructed visual qualities are severly degraded in Wyner-Ziv (WZ) frames. Furthermore, the scheme takes lots of iteration to reconstruct WZ frames. In this paper, the conventional MC-BCS-SPL algorithm is improved to be operated in more effective way in WZ frames. That is, first, the proposed algorithm calculates a correlation coefficient between two reference key frames and, then, by selecting adaptively the reference frame, the residual reconstruction in pixel domain is performed to the conventional BCS-SPL scheme. Experimental results show that the proposed algorithm achieves significantly better visual qualities than conventional MC-BCS-SPL algorithm, while resulting in the significant reduction of the decoding time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1287-1300
• /
• 2018

Target-tracking algorithm based on ad hoc camera sensor networks (ACSNs) utilizes the distributed observation capability of nodes to achieve accurate target tracking. A compressed sensing-based multiple-target tracking algorithm (CSMTTA) for ACSNs is proposed in this work based on the study of camera node observation projection model and compressed sensing model. The proposed algorithm includes reconfiguration of observed signals and evaluation of target locations. It reconfigures observed signals by solving the convex optimization of L1-norm least and forecasts node group to evaluate a target location by the motion features of the target. Simulation results show that CSMTTA can recover the subtracted observation information accurately under the condition of sparse sampling to a high target-tracking accuracy and accomplish the distributed tracking task of multiple mobile targets.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.188-190
• /
• 2012

Compressed Sensing (CS) has been developed for several years. Among many CS algorithms for image, the Block-based Compressed Sensing with Smoothed Projected Landweber (BCS-SPL) demonstrates its excellent performance in low-complexity and near-optimal reconstruction. Several noise filtering algorithms of image reconstruction have been introduced such as the Wiener or the median filters, etc. In general, each filter has its own advantages and disadvantages depending on specific coding scheme. In this paper, we show that reconstruction performance can be varied according to the choice of filter. When a sub-rate value is changed, different filter causes different effect as well. Concerning the sub-rate, an inner filter can be chosen to improve the reconstructed image quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.5
• /
• pp.806-808
• /
• 2015

In this paper, we suggest the method of pilot tone design for a compressed channel sensing in order to decrease the peak to average power ratio (PAPR) in orthogonal frequency division multiplexing (OFDM) systems.

• Journal of IKEEE
• /
• v.25 no.1
• /
• pp.76-82
• /
• 2021

In this paper, the compressed sensing basic pursuit denoise algorithm adopted to synthetic aperture radar imaging is investigated to improve the object recognition. From the incomplete data sets for image processing, the compressed sensing algorithm had been integrated to recover the data before the conventional back- projection algorithm was involved to obtain the synthetic aperture radar images. This method can lead to the reduction of measurement events while scanning the objects. An ultra-wideband radar scheme using a stripmap synthetic aperture radar algorithm was utilized to detect objects hidden behind the box. The Ultra-Wideband radar system with 3.1~4.8 GHz broadband and UWB antenna were implemented to transmit and receive signal data of two conductive cylinders located inside the paper box. The results confirmed that the images can be reconstructed by using a 30% randomly selected dataset without noticeable distortion compared to the images generated by full data using the conventional back-projection algorithm.

• Korean Journal of Radiology
• /
• v.24 no.12
• /
• pp.1293-1297
• /
• 2023

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2497-2517
• /
• 2020

For compressed sensing (CS) applications, it is significant to construct deterministic measurement matrices with good practical features, including good sensing performance, low memory cost, low computational complexity and easy hardware implementation. In this paper, a deterministic construction method of bipolar measurement matrices is presented based on binary sequence family (BSF). This method is of interest to be applied for sparse signal restore and image block CS. Coherence is an important tool to describe and compare the performance of various sensing matrices. Lower coherence implies higher reconstruction accuracy. The coherence of proposed measurement matrices is analyzed and derived to be smaller than the corresponding Gaussian and Bernoulli random matrices. Simulation experiments show that the proposed matrices outperform the corresponding Gaussian, Bernoulli, binary and chaotic bipolar matrices in reconstruction accuracy. Meanwhile, the proposed matrices can reduce the reconstruction time compared with their Gaussian counterpart. Moreover, the proposed matrices are very efficient for sensing performance, memory, complexity and hardware realization, which is beneficial to practical CS.

• Geophysics and Geophysical Exploration
• /
• v.14 no.4
• /
• pp.335-341
• /
• 2011

Most sensing and instrumentation systems should have very higher sampling rate than required data rate not to miss important information. This means that the system can be inefficient in some cases. This paper introduces two new research areas about information acquisition with high accuracy from less number of sampled data. One is Compressed Sensing technology (which obtains original information with as little samples as possible) and the other is Super-Resolution technology (which gains very high-resolution information from restrictively sampled data). This paper explains fundamental theories and reconstruction algorithms of compressed sensing technology and describes several applications to geophysical exploration. In addition, this paper explains the fundamentals of super-resolution technology and introduces recent research results and its applications, e.g. FRI (Finite Rate of Innovation) and LIMS (Least-squares based Iterative Multipath Super-resolution). In conclusion, this paper discusses how these technologies can be used in geophysical exploration systems.

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