• Journal of Information Processing Systems
• /
• 제15권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.

• 한국멀티미디어학회논문지
• /
• 제20권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)
• /
• 제13권5호
• /
• pp.2454-2468
• /
• 2019

The existing direct position determinations(DPD) for coherently distributed(CD) sources are mostly applicable for uniform linear array(ULA), which result in a low degree of freedom(DOF), and it is difficult for them to realize the effective positioning in underdetermined condition. In this paper, a novel DPD algorithm for coherently distributed sources based on compressed sensing with a moving nested array is present. In this algorithm, the nested array is introduced to DPD firstly, and a positioning model of signal moving station based on nested array is constructed. Owing to the features of coherently distributed sources, the cost function of compressed sensing is established based on vectorization. For the sake of convenience, unconstrained transformation and convex transformation of cost functions are carried out. Finally, the position coordinates of the distribution source signals are obtained according to the theory of optimization. At the same time, the complexity is analyzed, and the simulation results show that, in comparison with two-step positioning algorithms and subspace-based algorithms, the proposed algorithm effectively solves the positioning problem in underdetermined condition with the same physical element number.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권2호
• /
• pp.580-592
• /
• 2012

In this paper, a new compressive feedback (CF) scheme based on distributed compressed sensing (DCS) for time-corrected MIMO channel is proposed. First, the channel state information (CSI) is approximated by using a subspace matrix, then, the approximated CSI is compressed using a compressive matrix. At the base station, the approximated CSI can be robust recovered with simultaneous orthogonal matching pursuit (SOMP) algorithm by using forgone CSIs. Simulation results show our proposed DCS-CF method can improve the reliability of system without creating a large performance loss.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권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.

• Journal of electromagnetic engineering and science
• /
• 제11권4호
• /
• pp.250-256
• /
• 2011

This paper applies a compressed algorithm to improve the spectrum sensing performance of cognitive radio technology. At the fusion center, the recovery error in the analog to information converter (AIC) when reconstructing the transmit signal from the received time-discrete signal causes degradation of the detection performance. Therefore, we propose a subspace pursuit (SP) algorithm to reduce the recovery error and thereby enhance the detection performance. In this study, we employ a wide-band, low SNR, distributed compressed sensing regime to analyze and evaluate the proposed approach. Simulations are provided to demonstrate the performance of the proposed algorithm.

• 한국정보통신학회논문지
• /
• 제21권7호
• /
• pp.1355-1363
• /
• 2017

최근에 낮은 복잡도의 부호화기를 구현하기 위해 분산 비디오 부호화 와 압축센싱을 결합한 구조로서 분산 압축 비디오 센싱기술에 대한 연구가 활발히 진행되고 있다. 기존에 움직임 보상 블록 압축센싱 기술(MC-BCS-SPL)은 가장 간단한 표본화를 추구하면서 모든 압축센싱 프레임을 갖는 DCVS방식중의 효과적인 방안으로 다루어져 왔다. 이 방식은 키 프레임과 WZ 프레임으로 분리하여 압축센싱한다. 그러나 MC-BCS-SPL 방식은 복호화기에서 WZ 프레임을 복원할 때, 움직임이 큰 영상 시퀀스의 경우에 화질 저하가 발생시키는 단점이 존재한다. 본 논문에서는 이러한 기존의 문제점을 극복하기 위한 개선된 MC-BCS-SPL 방식을 제안한다. 제안한 방식은 연속적인 키 프레임 간 에 존재하는 높은 상관관계를 이용하여 키 프레임을 참조함으로써 초기 영상을 보정한다. GOP 예측 구조 방식에 따른 율-왜곡 성능을 비교한다. 다양한 실험 결과를 통하여 제안하는 알고리즘이 기존 알고리즘보다 더 좋은 화질을 제공함을 보여준다.

• 한국산업정보학회논문지
• /
• 제22권2호
• /
• pp.27-34
• /
• 2017

가장 간단한 샘플링을 위한 목적으로 SPL (Smoothed Projected Landweber)기법 기반의 움직임 보상 블록 압축센싱 기법이 모든 센싱 프레임들에 대해 분산 압축 비디오 센싱 기술이 적용되는 효과적인 방안으로 연구되어 오고 있다. 그러나 기존의 움직임 보상 블록기반의 압축센싱 기법은 매우 간단하여 복원된 위너-지브 프레임에서 우수한 화질을 제공하지 못하는 한계점이 있다. 본 논문에서는 기존의 움직임 보상 블록기반의 압축센싱 기법을 이용한 위너-지브 프레임에서 우수한 화질을 제공될 수 있도록 알고리즘을 변형한다. 즉, 제안된 알고리즘은 참조 프레임이 연속적인 프레임들에 있어 시간적 상관관계에 기초해서 적응적으로 선택되도록 하는 방법으로 설계된다. 다양한 실험 결과를 통하여 제안한 알고리즘은 기존의 알고리즘에 비해 우수한 화질을 제공할 수 있음을 확인한다.

• Journal of Information Processing Systems
• /
• 제19권3호
• /
• pp.377-384
• /
• 2023

The existence of abnormal breakpoint data leads to poor channel balance in wireless sensor networks (WSN). To enhance the communication quality of WSNs, a method for positioning abnormal breakpoint data in WSNs on the basis of signal reconstruction is studied. The WSN signal is collected using compressed sensing theory; the common part of the associated data set is mined by exchanging common information among the cluster head nodes, and the independent parts are updated within each cluster head node. To solve the non-convergence problem in the distributed computing, the approximate term is introduced into the optimization objective function to make the sub-optimization problem strictly convex. And the decompressed sensing signal reconstruction problem is addressed by the alternating direction multiplier method to realize the distributed signal reconstruction of WSNs. Based on the reconstructed WSN signal, the abnormal breakpoint data is located according to the characteristic information of the cross-power spectrum. The proposed method can accurately acquire and reconstruct the signal, reduce the bit error rate during signal transmission, and enhance the communication quality of the experimental object.

• 대한전자공학회논문지SP
• /
• 제48권2호
• /
• pp.134-140
• /
• 2011

압축 센싱 (Compressed Sensing) 기술을 통해 $M{\times}N$ 측정 행렬의 원소들이 특정의 독립적인 확률 분포에서 뽑혀 identically 분포의 성질을 가지고 있을 때 $M{\ll}N$의 경우에도 스파스 (sparse) 신호를 높은 확률로 정확하게 복원할 수 있다. $L_1$-최소화 알고리즘이 불완전한 측정에 대해서도 스파스 (sparse) 신호를 복원할 수 있다는 것은 잘 알려진 사실이다. 본 논문에서는 OMP를 변형시킨 support 검출과 가중치 기법을 이용한 $L_1$-최소화 방법을 통하여 스파스 (sparse) 신호의 복원 성능을 향상시키는 알고리즘을 제안하고자 한다.