• 한국정보통신학회논문지
• /
• 제15권5호
• /
• pp.1171-1176
• /
• 2011

본 논문에서는 주기적으로 배치된 렌즈 배열을 이용한 광학 픽업과 평면기반 컴퓨터 집적 영상 복원 (CIIR) 기술에서 요소 영상 크기와 3차원 물체의 복원 깊이 위치에 따른 복원 성능에 대한 분석을 제시한다. 주기적으로 배치된 렌즈 배열에서는 3차원 물체를 픽업할 때 주기성으로 인한 희박 표본화가 발생함이 보고된다. 또한 희박 표본화가 발생하는 3차원 물체의 위치는 요소 영상의 크기와 관계식을 제시한다. 희박 표본화를 회피하는 방안을 제시하고, 이론의 평가를 위해서 컴퓨터 실험을 진행했고 그 결과는 이론을 잘 뒷받침함을 보였다.

• 디지털콘텐츠학회 논문지
• /
• 제16권5호
• /
• pp.805-813
• /
• 2015

Compressive sensing 및 희소 복원 문제(sparse recovery problem)는 기존 디지털 기술의 한계를 극복할 수 있는 새로운 이론으로 많은 관심을 받고 있다. 그러나 신호 재구성에서 l1 norm 최적화 문제 해결에 많은 연산이 수행되며 따라서 병렬 처리 기법이 필요하다. 이 과정에서 무작위 행렬과 벡터 연산을 통한 변환 연산이 전체 과정 중에서 많은 부분을 차지하는데, 특히 원본 신호의 크기로 인해 이 과정에서 필요한 무작위 행렬을 메모리에 저장하기 곤란하며 계산 시 무작위 행렬의 절차적(procedural) 처리 방식이 필수적이다. 본 논문에서는 이 문제에 대한 해결책으로 단일 명령 다중 스레드(SIMT) 병렬 플랫폼 상에서 무작위 부분적 Haar 웨이블릿 변환을 절차적으로 계산할 수 있는 새로운 병렬 알고리듬을 제안한다.

• Smart Structures and Systems
• /
• 제20권1호
• /
• pp.35-42
• /
• 2017

Recently, compressive sensing based data loss recovery techniques have become popular for Structural Health Monitoring (SHM) applications. These techniques involve an encoding process which is onerous to sensor node because of random sensing matrices used in compressive sensing. In this paper, we are presenting a model where the sampled raw acceleration data is directly transmitted to base station/receiver without performing any type of encoding at transmitter. The received incomplete acceleration data after data losses can be reconstructed faithfully using compressive sensing based reconstruction techniques. An in-depth simulated analysis is presented on how random losses and continuous losses affects the reconstruction of acceleration signals (obtained from a real bridge). Along with performance analysis for different simulated data losses (from 10 to 50%), advantages of performing interleaving before transmission are also presented.

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

• Investigative Magnetic Resonance Imaging
• /
• 제23권1호
• /
• pp.1-16
• /
• 2019

Dynamic contrast enhanced (DCE) magnetic resonance (MR) imaging plays an important role in non-invasive detection and characterization of primary and metastatic lesions in the liver. Recently, efforts have been made to improve spatial and temporal resolution of DCE liver MRI for arterial phase imaging. Review of recent publications related to arterial phase imaging of the liver indicates that there exist primarily two approaches: breath-hold and free-breathing. For breath-hold imaging, acquiring multiple arterial phase images in a breath-hold is the preferred approach over conventional single-phase imaging. For free-breathing imaging, a combination of three-dimensional (3D) stack-of-stars golden-angle sampling and compressed sensing parallel imaging reconstruction is one of emerging techniques. Self-gating can be used to decrease respiratory motion artifact. This article introduces recent MRI technologies relevant to hepatic arterial phase imaging, including differential subsampling with Cartesian ordering (DISCO), golden-angle radial sparse parallel (GRASP), and X-D GRASP. This article also describes techniques related to dynamic 3D image reconstruction of the liver from golden-angle stack-of-stars data.

• 정보처리학회논문지:소프트웨어 및 데이터공학
• /
• 제4권4호
• /
• pp.187-194
• /
• 2015

본 논문에서는 RGB-D 입력 영상들로부터 3차원 공간을 움직이는 카메라의 실시간 포즈를 효과적으로 추적할 수 있는 시각 주행 거리측정기를 제안한다. 본 논문에서 제안하는 시각 주행 거리 측정기에서는 컬러 영상과 깊이 영상의 풍부한 정보를 충분히 활용하면서도 실시간 계산량을 줄이기 위해, 특징 기반의 저밀도 주행 거리 계산 방법을 사용한다. 본 시스템에서는 보다 정확한 주행 거리 추정치를 얻기 위해, 카메라 이동 이전과 이동 이후의 영상에서 추출한 특징들을 정합한 뒤, 정합된 특징들에 대한 추가적인 정상 집합 정제 과정과 주행 거리 정제 작업을 반복한다. 또한, 정제 후 잔여 정상 집합의 크기가 충분치 않은 경우에도 잔여 정상 집합의 크기에 비례해 최종 주행 거리를 결정함으로써, 추적 성공률을 크게 향상시켰다. TUM 대학의 벤치마크 데이터 집합을 이용한 실험과 3차원 장면 복원 응용 시스템의 구현을 통해, 본 논문에서 제안하는 시각 주행 거리 측정 방법의 높은 성능을 확인할 수 있었다.

• IEIE Transactions on Smart Processing and Computing
• /
• 제6권4호
• /
• pp.262-268
• /
• 2017

Intelligent video surveillance systems have been developed to monitor global areas and find specific target objects using a large-scale database. However, person re-identification presents some challenges, such as pose change and occlusions. To solve the problems, this paper presents an improved person re-identification method using sparse representation and saliency-based dictionary construction. The proposed method consists of three parts: i) feature description based on salient colors and textures for dictionary elements, ii) orthogonal atom selection using cosine similarity to deal with pose and viewpoint change, and iii) measurement of reconstruction error to rank the gallery corresponding a probe object. The proposed method provides good performance, since robust descriptors used as a dictionary atom are generated by weighting some salient features, and dictionary atoms are selected by reducing excessive redundancy causing low accuracy. Therefore, the proposed method can be applied in a large scale-database surveillance system to search for a specific object.

• International Journal of Contents
• /
• 제11권3호
• /
• pp.47-53
• /
• 2015

Visual object tracking is a fundamental problem in the field of computer vision, as it needs a proper model to account for drastic appearance changes that are caused by shape, textural, and illumination variations. In this paper, we propose a feature-based visual-object-tracking method with a sparse representation. Generally, most appearance-based models use the gray-scale pixel values of the input image, but this might be insufficient for a description of the target object under a variety of conditions. To obtain the proper information regarding the target object, the following combination of features has been exploited as a corresponding representation: First, the features of the target templates are extracted by using the HOG (histogram of gradient) and LBPs (local binary patterns); secondly, a feature-based sparsity is attained by solving the minimization problems, whereby the target object is represented by the selection of the minimum reconstruction error. The strengths of both features are exploited to enhance the overall performance of the tracker; furthermore, the proposed method is integrated with the particle-filter framework and achieves a promising result in terms of challenging tracking videos.

• Journal of Information Processing Systems
• /
• 제17권6호
• /
• pp.1083-1096
• /
• 2021

Compressed sensing-based matching pursuit algorithms can estimate the sparse channel of massive multiple input multiple-output systems with short pilot sequences. Although they have the advantages of low computational complexity and low pilot overhead, their accuracy remains insufficient. Simply multiplying the weight value and the estimated channel obtained in different iterations can only improve the accuracy of channel estimation under conditions of low signal-to-noise ratio (SNR), whereas it degrades accuracy under conditions of high SNR. To address this issue, an improved weighted matching pursuit algorithm is proposed, which obtains a suitable weight value u_op by training the channel data. The step of the weight value increasing with successive iterations is calculated according to the sparsity of the channel and u_op. Adjusting the weight value adaptively over the iterations can further improve the accuracy of estimation. The results of simulations conducted to evaluate the proposed algorithm show that it exhibits improved performance in terms of accuracy compared to previous methods under conditions of both high and low SNR.

• 한국멀티미디어학회논문지
• /
• 제22권4호
• /
• pp.443-454
• /
• 2019

In recent years, there has been active research on a recommender system that considers three or more inputs in addition to users and goods, making it a multi-dimensional array, also known as a tensor. The main issue with using tensor is that there are a lot of missing values, making it sparse. In order to solve this, the tensor can be shrunk using the tensor decomposition algorithm into a lower dimensional array called a factor matrix. Then, the tensor is reconstructed by calculating factor matrices to fill original empty cells with predicted values. This is called tensor reconstruction. In this paper, we propose a user-based Top-K recommender system by normalized PARAFAC tensor reconstruction. This method involves factorization of a tensor into factor matrices and reconstructs the tensor again. Before decomposition, the original tensor is normalized based on each dimension to reduce overfitting. Using the real world dataset, this paper shows the processing of a large amount of data and implements a recommender system based on Apache Spark. In addition, this study has confirmed that the recommender performance is improved through normalization of the tensor.