• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.3
• /
• pp.89-95
• /
• 2015

Compresses sensing (CS) technique is beneficial for reducing power consumption of biopotential acquisition circuits in wireless healthcare system. This paper investigates the maximum possible compress ratio for various biopotential signal when the CS technique is applied. By using the CS technique, we perform the compression and reconstruction of typical electrocardiogram(ECG), electromyogram(EMG), electroencephalogram(EEG) signals. By comparing the original signal and reconstructed signal, we determines the validity of the CS-based signal compression. Raw-biopotential signal is compressed by using a psuedo-random matrix, and the compressed signal is reconstructed by using the Block Sparse Bayesian Learning(BSBL) algorithm. EMG signal, which is the most sparse biopotential signal, the maximum compress ratio is found to be 10, and the ECG'sl maximum compress ratio is found to be 5. EEG signal, which is the least sparse bioptential signal, the maximum compress ratio is found to be 4. The results of this work is useful and instrumental for the design of wireless biopotential signal monitoring circuits.

• Journal of the Optical Society of Korea
• /
• v.20 no.4
• /
• pp.515-523
• /
• 2016

Spectral reflectance is sparse in space, and while the traditional spectral-reconstruction algorithm does not make full use of this characteristic sparseness, the compressive sensing algorithm can make full use of it. In this paper, on the basis of analyzing compressive sensing based on the orthogonal matching pursuit algorithm, a new algorithm based on the Dice matching criterion is proposed. The Dice similarity coefficient is introduced, to calculate the correlation coefficient of the atoms and the residual error, and is used to select the atoms from a library. The accuracy of Spectral reconstruction based on the pseudo-inverse method, Wiener estimation method, OMP algorithm, and DOMP algorithm is compared by simulation on the MATLAB platform and experimental testing. The result is that spectral-reconstruction accuracy based on the DOMP algorithm is higher than for the other three methods. The root-mean-square error and color difference decreases with an increasing number of principal components. The reconstruction error decreases as the number of iterations increases. Spectral reconstruction based on the DOMP algorithm can improve the accuracy of color-information replication effectively, and high-accuracy color-information reproduction can be realized.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10a
• /
• pp.791-796
• /
• 1987

In this paper, an efficient algorithm to estimate the volume and surface area from ultrasonic imaging and a reconstruction algorithm to generate three-dimensional graphics are presented. The computing efficiency is Improved by using the graph theory and the algorithm to determine proper contour points is performed by applying several tolerances. The search for contour points is limited by the change in curvature in order to provide an efficient search of the minimum cost path. These algorithms are applied to a selected mathematical model of ellipsoid. The results show that the measured value of the volume and surface area for the tolerances of 1.0005, 1.001 and 1.002 approximate to the measured values for the tolerance of 1.000 resulting in small errors. The reconstructed 3-dimensional Images are sparse and consist of larger triangular tiles between two cross sections as tolerance is increased.

• 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 Advanced Information Technology and Convergence
• /
• v.9 no.1
• /
• pp.89-102
• /
• 2019

Collagen can be used in building artificial skin replacements for treatment of burns and towards the reconstruction of bone as well as researching cell behavior and cellular interaction. The strength of collagen in connective tissue rests on the characteristics of collagen fibers. 3D confocal imaging of collagen fibers enables the characterization of their spatial distribution as related to their function. However, the image stacks acquired with confocal laser-scanning microscope does not clearly show the collagen architecture in 3D. Therefore, we developed a new method to reconstruct, visualize and characterize collagen fibers from fluorescence confocal images. First, we exploit the tensor voting framework to extract sparse reliable information about collagen structure in a 3D image and therefore denoise and filter the acquired image stack. We then propose to segment the collagen fibers by defining an energy term based on the Hessian matrix. This energy term is minimized by a min cut-max flow algorithm that allows adaptive regularization. We demonstrate the efficacy of our methods by visualizing reconstructed collagen from specific 3D image stack.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.5
• /
• pp.409-416
• /
• 2017

In this paper, we consider a framework of compressed sensing over finite fields. One measurement sample is obtained by an inner product of a row of a sensing matrix and a sparse signal vector. A recovery algorithm proposed in this study for sparse signals based probabilistic decoding is used to find a solution of compressed sensing. Until now compressed sensing theory has dealt with real-valued or complex-valued systems, but for the processing of the original real or complex signals, the loss of the information occurs from the discretization. The motivation of this work can be found in efforts to solve inverse problems for discrete signals. The framework proposed in this paper uses a parity-check matrix of low-density parity-check (LDPC) codes developed in coding theory as a sensing matrix. We develop a stochastic algorithm to reconstruct sparse signals over finite field. Unlike LDPC decoding, which is published in existing coding theory, we design an iterative algorithm using probability distribution of sparse signals. Through the proposed recovery algorithm, we achieve better reconstruction performance as the size of finite fields increases. Since the sensing matrix of compressed sensing shows good performance even in the low density matrix such as the parity-check matrix, it is expected to be actively used in applications considering discrete signals.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.9
• /
• pp.3745-3761
• /
• 2020

Low-rank representation methods already achieve many applications in the image reconstruction. However, for high-gradient image patches with rich texture details and strong edge information, it is difficult to find sufficient similar patches. Existing low-rank representation methods usually destroy image critical details and fail to preserve edge structure. In order to promote the performance, a new representation-based image super-resolution reconstruction method is proposed, which combines gradient domain guided image filter with the structure-constrained low-rank representation so as to enhance image details as well as reveal the intrinsic structure of an input image. Firstly, we extract the gradient domain guided filter of each atom in high resolution dictionary in order to acquire high-frequency prior information. Secondly, this prior information is taken as a structure constraint and introduced into the low-rank representation framework to develop a new model so as to maintain the edges of reconstructed image. Thirdly, the approximate optimal solution of the model is solved through alternating direction method of multipliers. After that, experiments are performed and results show that the proposed algorithm has higher performances than conventional state-of-the-art algorithms in both quantitative and qualitative aspects.

• Investigative Magnetic Resonance Imaging
• /
• v.19 no.1
• /
• pp.19-30
• /
• 2015

Purpose: A new compressed sensing technique by iterative truncation of small transformed coefficients (ITSC) is proposed for fast cardiac CINE MRI. Materials and Methods: The proposed reconstruction is composed of two processes: truncation of the small transformed coefficients in the r-f domain, and restoration of the measured data in the k-t domain. The two processes are sequentially applied iteratively until the reconstructed images converge, with the assumption that the cardiac CINE images are inherently sparse in the r-f domain. A novel sampling strategy to reduce the normalized mean square error of the reconstructed images is proposed. Results: The technique shows the least normalized mean square error among the four methods under comparison (zero filling, view sharing, k-t FOCUSS, and ITSC). Application of ITSC for multi-slice cardiac CINE imaging was tested with the number of slices of 2 to 8 in a single breath-hold, to demonstrate the clinical usefulness of the technique. Conclusion: Reconstructed images with the compression factors of 3-4 appear very close to the images without compression. Furthermore the proposed algorithm is computationally efficient and is stable without using matrix inversion during the reconstruction.

• ETRI Journal
• /
• v.44 no.6
• /
• pp.1034-1046
• /
• 2022

The learning-based multiview stereo (MVS) methods for three-dimensional (3D) reconstruction generally use 3D volumes for depth inference. The quality of the reconstructed depth maps and the corresponding point clouds is directly influenced by the spatial resolution of the 3D volume. Consequently, these methods produce point clouds with sparse local regions because of the lack of the memory required to encode a high volume of information. Here, we apply the atrous spatial pyramid pooling (ASPP) module in MVS methods to obtain dense feature maps with multiscale, long-range, contextual information using high receptive fields. For a given 3D volume with the same spatial resolution as that in the MVS methods, the dense feature maps from the ASPP module encoded with superior information can produce dense point clouds without a high memory footprint. Furthermore, we propose a 3D loss for training the MVS networks, which improves the predicted depth values by 24.44%. The ASPP module provides state-of-the-art qualitative results by constructing relatively dense point clouds, which improves the DTU MVS dataset benchmarks by 2.25% compared with those achieved in the previous MVS methods.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.4
• /
• pp.257-267
• /
• 2017

Compressed Sensing(CS) deals with linear inverse problems. The theoretical results of CS have had an impact on inference problems and presented amazing research achievements in the related fields including signal processing and information theory. However, in order for CS to be applied in practical environments, there are two significant challenges to be solved. One is to guarantee in real time recovery of CS signals, and the other is that the signals have to be sparse. To this end, the latest researches using deep learning technology have emerged. In this paper, we consider CS problems based on deep learning and discuss the latest research results. And the approaches for CS signal reconstruction using deep learning show superior results in terms of recovery time and performance. It is expected that the approaches for CS reconstruction using deep learning shown in recent studies can not only raise the possibility of utilization of CS, but also be highly exploited in the fields of signal processing and communication areas.