• 전자공학회논문지
• /
• 제52권10호
• /
• pp.118-128
• /
• 2015

압축센싱 기술이 직면하고 있는 두 가지의 도전과제는 복원 알고리즘의 연산 복잡도 개선과 부호화 효율 향상 문제이다. 이에 대한 해결방안으로, 본 논문은 최대 3 가지의 공간 해상도 조절 및 향상된 압축센싱 부호화 성능을 가능하게 하는 공간 스케일러블 Kronecker 압축센싱 구조를 제안한다. 제안 방법의 기저 계층(base layer)에서는 quincunx 샘플링 격자에 기반 하는 듀얼-해상도 센싱 행렬을 사용한다. 해당 센싱 행렬은 낮은 해상도의 영상에 대한 고속-프리뷰(preview) 기능을 가능케 한다. 향상 계층(enhancement layer)에서는 획득한 측정값과 예측 측정값 간의 잔차 측정값을 부호화 한다. 복원과정에서는 기저 계층으로부터 낮은 해상도의 복원 영상을 획득 할 수 있는 반면, 두 개의 계층을 모두 사용하여 복원하는 경우 높은 해상도의 영상을 획득할 수 있다. 실험 결과, 제안하는 구조가 종래의 단일 계층방법 및 다중-해상도 기반 구조에 비해, 2.0bpp일 때 PSNR 성능이 각각 5.75dB 및 5.05dB 더 향상됨을 확인하였다.

• IEIE Transactions on Smart Processing and Computing
• /
• 제3권1호
• /
• pp.19-27
• /
• 2014

Compressive sensing is an emerging sampling technique which enables sampling a signal at a much lower rate than the Nyquist rate. In this paper, we propose a novel framework based on Kronecker compressive sensing that provides multi-resolution image reconstruction capability. By exploiting the relationship of the sensing matrices between low and high resolution images, the proposed method can reconstruct both high and low resolution images from a single measurement vector. Furthermore, post-processing using BM3D improves its recovery performance. The experimental results showed that the proposed scheme provides significant gains over the conventional framework with respect to the objective and subjective qualities.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권4호
• /
• pp.1618-1637
• /
• 2018

By means of compressive sensing (CS) technique, this paper considers the collection of sensor data with spatiotemporal correlations in wireless sensor networks (WSNs). In energy-constrained WSNs, one-dimensional CS methods need a lot of data transmissions since they are less applicable in fully exploiting the spatiotemporal correlations, while the Kronecker CS (KCS) methods suffer performance degradations when the signal dimension increases. In this paper, an appropriate sensing matrix as well as an efficient sensing method is proposed to further reduce the data transmissions without the loss of the recovery performance. Different matrices for the temporal signal of each sensor node are separately designed. The corresponding energy-efficient data gathering method is presented, which only transmitting a subset of sensor readings to recover data of the entire WSN. Theoretical analysis indicates that the sensing structure could have the relatively small mutual coherence according to the selection of matrix. Compared with the existing spatiotemporal CS (CS-ST) method, the simulation results show that the proposed efficient measurement method could reduce data transmissions by about 25% with the similar recovery performance. In addition, compared with the conventional KCS method, for 95% successful recovery, the proposed sensing structure could improve the recovery performance by about 20%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권5호
• /
• pp.2468-2483
• /
• 2017

The construction of completely random sensing matrices of Compressive Sensing requires a large number of random numbers while that of deterministic sensing operators often needs complex mathematical operations. Thus both of them have difficulty in acquiring large signals efficiently. This paper focuses on the enhancement of the practicability of the structurally random matrices and proposes a semi-deterministic sensing matrix called Partial Kronecker product of Identity and Hadamard (PKIH) matrix. The proposed matrix can be viewed as a sub matrix of a well-structured, sparse, and orthogonal matrix. Only the row index is selected at random and the positions of the entries of each row are determined by a deterministic sequence. Therefore, the PKIH significantly decreases the requirement of random numbers, which has a complex generating algorithm, in matrix construction and further reduces the complexity of sampling. Besides, in order to process large signals, the corresponding fast sampling algorithm is developed, which can be easily parallelized and realized in hardware. Simulation results illustrate that the proposed sensing matrix maintains almost the same performance but with at least 50% less random numbers comparing with the popular sampling matrices. Meanwhile, it saved roughly 15%-35% processing time in comparison to that of the SRM matrices.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권2호
• /
• pp.657-667
• /
• 2019

This paper studies synthetic aperture radar (SAR) imaging problem which the scatterers are often distributed in block sparse pattern. To exploiting the sparse geometrical feature, a Kronecker constrained SAR imaging algorithm is proposed by combining the block sparse characteristics with the multiway sparse reconstruction framework with Tucker modeling. We validate the proposed algorithm via real data and it shows that the our algorithm can achieve better accuracy and convergence than the reference methods even in the demanding environment. Meanwhile, the complexity is smaller than that of the existing methods. The simulation experiments confirmed the effectiveness of the algorithm as well.