• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.12
• /
• pp.1122-1132
• /
• 2012

Compressed sensing has been applied to many fields such as images, speech signals, radars, etc. It has been mainly applied to stationary signals, and reconstruction error could grow as compression ratios are increased by decreasing measurements. To resolve the problem, speech signals are divided into frames and processed in parallel. The frames are made sparse by dictionary learning, and adaptive compressed sensing is applied which designs the compressed sensing reconstruction matrix adaptively by using the difference between the sparse coefficient vector and its reconstruction. Through the proposed method, we could see that fast and accurate reconstruction of non-stationary signals is possible with compressed sensing.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.43 no.10 s.352
• /
• pp.28-33
• /
• 2006

An integrated 3.125Gbps clock and data recovery (CDR) circuit is presented. The circuit does not need a reference clock. It has a phase and frequency detector (PFD), which incorporates a bang-bang type 4X oversampling PD and a rotational frequency detector (FD). It also has a ring oscillator type VCO with four delay stages and three zero-offset charge pumps. With a proposed PD and m, the tracking range of 24% can be achieved. Experimental results show that the circuit is capable of recovering clock and data at rates of 3.125Gbps with 0.18 um CMOS technology. The measured recovered clock jitter (p-p) is about 14ps. The CDR has 1.8volt single power supply. The power dissipation is about 140mW.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.1
• /
• pp.94-101
• /
• 2007

Streaming video is expected to become a key service in the developing heterogeneous wireless network. However, sufficient quality of service is not offered to video applications because of bursty packet losses. An effective solution for packet loss in wireless network is to perform a proper concealment at the receiver. However, most concealment methods can not conceal effectively the consecutively damaged macro blocks, since the neighboring blocks are lost. In the previous work, bidirectional motion vector tracking (BMVT) method has been proposed which uses the moving trajectory feature of the damaged macro blocks. In this paper, a channel-adaptive redundancy coding method for the better BMVT error concealment is presented. The proposed method provides enhanced video quality at the cost of a little bit overhead in the wireless error-prone network.

• The KIPS Transactions:PartB
• /
• v.13B no.6 s.109
• /
• pp.607-614
• /
• 2006

In this paper, we propose an error resilience video coder which uses a hybrid error concealment algorithm. Firstly, the algorithm uses the error concealment with data hiding. If the hiding information is lost, the motion vector of lost macroblock is computed with adaptive selection of adjacent motion vectors and OBMC (Overlapped Block Motion Compensation) is applied with this motion vector. We know our algorithm is more effective in case of continuous GOB. The results show more significant improvement than many temporal concealment methods such as MVRI (Motion Vector Rational Interpolation) or existing error concealment using data hiding.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.3 s.309
• /
• pp.9-16
• /
• 2006

Many image and video compression algorithms work by splitting the image into blocks and producing variable-length code bits for each block data. If variable-length code data are transmitted consecutively over error-prone channel without any error protection technique, the receiving decoder cannot decode the stream properly. So the standard image and video compression algorithms insert some redundant information into the stream to provide some protection against channel errors. One of redundancies is resynchronization marker, which enables the decoder to restart the decoding process from a known state in the event of transmission errors, but its usage should be restricted not to consume bandwidth too much. The Error Resilient Entropy Code(EREC) is well blown method which can regain synchronization without any redundant information. It can work with the overall prefix codes, which many image compression methods use. This paper proposes EREREC method to improve FEREC(Fast Error-Resilient Entropy Coding). It first calculates initial searching position according to bit lengths of consecutive blocks. Second, initial offset is decided using statistical distribution of long and short blocks, and initial offset can be adjusted to insure all offset sequence values can be used. The proposed EREREC algorithm can speed up the construction of FEREC slots, and can improve the compressed image quality in the event of transmission errors. The simulation result shows that the quality of transmitted image is enhanced about $0.3{\sim}3.5dB$ compared with the existing FEREC when random channel error happens.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1285-1295
• /
• 1999

본 논문은 방대한 크기의 볼륨 데이타를 효율적으로 렌더링하기 위한 셀 기반 웨이브릿 압축 방법을 제시한다. 이 방법은 볼륨을 작은 크기의 셀로 나누고, 셀 단위로 웨이브릿 변환을 한 다음 복원 순서에 따른 런-길이(run-length) 인코딩을 수행하여 높은 압축율과 빠른 복원을 제공한다. 또한 최근 복원 정보를 캐쉬 자료 구조에 효율적으로 저장하여 복원 시간을 단축시키고, 에러 임계치의 정규화로 비정규화된 웨이브릿 압축보다 빠른 속도로 정규화된 압축과 같은 고화질의 이미지를 생성하였다. 본 연구의 성능을 평가하기 위하여 {{}} 해상도의 볼륨 데이타를 압축하여 쉬어-？ 분해(shear-warp factorization) 알고리즘에 적용한 결과, 손상이 거의 없는 상태로 약 27:1의 압축율이 얻어졌고, 약 3초의 렌더링 시간이 걸렸다.Abstract This paper presents an efficient cell-based wavelet compression method of large volume data. Volume data is divided into individual cell of {{}} voxels, and then wavelet transform is applied to each cell. The transformed cell is run-length encoded according to the reconstruction order resulting in a fairly good compression ratio and fast reconstruction. A cache structure is used to speed up the process of reconstruction and a threshold normalization scheme is presented to produce a higher quality rendered image. We have combined our compression method with shear-warp factorization, which is an accelerated volume rendering algorithm. Experimental results show the space requirement to be about 27:1 and the rendering time to be about 3 seconds for {{}} data sets while preserving the quality of an image as like as using original data.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.541-543
• /
• 2000

영역의 수와 윤곽선의 길이는 세그멘테이션 기반의 움직임 보상된 비디오 코딩에서 두 가지의 기본적인 제약사항이다. 이 논문에서 제안하는 코딩 스킴은 영역의 수를 축소하는 것에 초점을 맞추고, 윤곽성 코딩, 그리고 치환된 프레임 차이(DFD)의 압축에 초점을 맞춘다. 제안된 스킴의 가장 중요한 특징 중의 하나는 형태적인 필터를 기반으로 하는 spatio-temporal 단순성 알고리즘이고, 그것들과 함께 이미지는 작은 수의 영역으로 나누어질 수 있다. 이 스킴의 매우 중요한 특성은 세그멘테이션 맵 샘플링 기법으로, 그것은 윤곽선 길이를 매우 작은 복원 에러에 비례하여 약 50%까지 줄인다. 실험적인 결과는, 높은 압축 비율에 대하여 매우 작은 코딩 에러를 보여주었다.

• Annual Conference of KIPS
• /
• 2009.04a
• /
• pp.169-170
• /
• 2009

영상 해상도 향상 기술은 영상 처리의 많은 분야에서 사용되는 전처리 기술로서, 최근들어 감시 카메라 시스템에서의 영상 해상도 향상을 위한 연구가 진행되고 있다. 보간 과정에서의 블러링으로 인한 화질 저하를 해결하기 위해서, 본 논문에서는 하위 레벨 보간을 이용한 에러 추정과 영상 해상도 향상방법을 제안한다. 제안하는 방법에서는 하위 레벨 보간을 통해서 보간 과정에서 발생하는 손실 정보를 추정하고, 추정한 손실 정보를 보간 결과에 적용하여 영상 복원의 결과를 향상시킨다. 동일한 영상을 이용한 실험을 통해서 기존의 방법들보다 0.38~1.75dB의 객관적 화질의 개선을 확인하였고 주관적 화질 비교에서도 향상되었음을 확인하였다. 제안하는 방법은 감시 카메라 시스템을 비롯한 영상 확대를 위한 응용 환경에서 활용될 수 있다.

• The KIPS Transactions:PartB
• /
• v.10B no.2
• /
• pp.135-142
• /
• 2003

Robust extraction of 3D object's features, shape and global motion information from 2D image sequence is described. The object's 21 feature points on the pyramid type synthetic object are extracted automatically using color transform technique. The extracted features are used to recover the 3D shape and global motion of the object using stereo paraperspective camera model and sequential SVD(Singuiar Value Decomposition) factorization method. An inherent error of depth recovery due to the paraperspective camera model was removed by using the stereo image analysis. A 30 synthetic object with 21 features reflecting various position was designed and tested to show the performance of proposed algorithm by comparing the recovered shape and motion data with the measured values.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.6
• /
• pp.41-49
• /
• 2009

In this paper, the multi-camera calibration algorithm for optical motion capture system is proposed. This algorithm performs 1st camera calibration using DLT(Direct linear transformation} method and 3-axis calibration frame with 7 optical markers. And 2nd calibration is performed by waving with a wand of known length(so called wand dance} throughout desired calibration volume. In the 1st camera calibration, it is obtained not only camera parameter but also radial lens distortion parameters. These parameters are used initial solution for optimization in the 2nd camera calibration. In the 2nd camera calibration, the optimization is performed. The objective function is to minimize the difference of distance between real markers and reconstructed markers. For verification of the proposed algorithm, re-projection errors are calculated and the distance among markers in the 3-axis frame and in the wand calculated. And then it compares the proposed algorithm with commercial motion capture system. In the 3D reconstruction error of 3-axis frame, average error presents 1.7042mm(commercial system) and 0.8765mm(proposed algorithm). Average error reduces to 51.4 percent in commercial system. In the distance between markers in the wand, the average error shows 1.8897mm in the commercial system and 2.0183mm in the proposed algorithm.