• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1231-1238
• /
• 2005

This paper presents a new fast encoding algorithm for image vector quantization that incorporates the partial distances of multiple features with a multidimensional look-up table (LUT). Although the methods which were proposed earlier use the multiple features, they handles the multiple features step by step in terms of searching order and calculating process. On the other hand, the proposed algorithm utilizes these features simultaneously with the LUT. This paper completely describes how to build the LUT with considering the boundary effect for feasible memory cost and how to terminate the current search by utilizing partial distances of the LUT Simulation results confirm the effectiveness of the proposed algorithm. When the codebook size is 256, the computational complexity of the proposed algorithm can be reduced by up to the $70\%$ of the operations required by the recently proposed alternatives such as the ordered Hadamard transform partial distance search (OHTPDS), the modified $L_2-norm$ pyramid ($M-L_2NP$), etc. With feasible preprocessing time and memory cost, the proposed algorithm reduces the computational complexity to below the $2.2\%$ of those required for the exhaustive full search (EFS) algorithm while preserving the same encoding quality as that of the EFS algorithm.

• The Journal of the Korea Contents Association
• /
• v.3 no.2
• /
• pp.11-18
• /
• 2003

In this paper, we propose a fast variable block matching algorithm for motion estimation based on bit-patterns. Motion estimation in the proposed algorithm is peformed after the representation of image sequence is transformed 8-bit pixel values into 1-bit ones by the mean pixel value of search block, which brings a short searching time by reducing the computational complexity. Moreover, adaptive searching methods according to the motion information of the block make the procedure of motion estimation efficient by eliminating unnecessary searching processes of low motion block and deepening a searching procedure in high motion block. Experimental results show that the proposed algorithm provides bettor performance - average 0.5dB PSNR improvement and about 99% savings in the number of operations - than full search Hock matching algorithm with a fixed block size.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1133-1143
• /
• 2005

In this paper, we propose an enhanced two-step search scheme for rapid and reliable signal acquisition in UWB systems under multipath channels. The proposed TSS-LS (Two-Step Search scheme with the Linear search based Second step) achieves rapid acquisition performance comparable to the conventional TSS-BS (Two-Step Search scheme with the Bit reversal search based Second step) already proposed by the authors, based on the single-dwell search with two-step thresholds and search windows. However, unlike the TSS-BS which employs the bit reversal search in the second step, the proposed TSS-LS utilizes the linear search in the second step to improve the reliability of signal acquisition. Simulation results with multipath channel models by IEEE 802.15.3a show that the two-step search schemes for the UWB signal acquisition can achieve sig nificant reduction of the required mean acquisition time as compared to general search schemes. In addition, we observe that the proposed TSS-LS achieves quite good bit error rate performance for large signal-to-noise ratios, which is favorably comparable to the case of ideal perfect timing.

• Electronics and Telecommunications Trends
• /
• v.17 no.5 s.77
• /
• pp.119-128
• /
• 2002

최근 호텔, 커피숍, 레스토랑, 컨벤션 센터 등 유동 인구가 잦은 이른바 핫 스팟이라고 불리우는 지역에서 IEEE 802.11b와 같은 무선 랜 기술을 활용하여 가입자들에게 고속 무선 네트워크 접속 서비스를 제공하는 사업자들이 전세계적으로 점차 늘어나고 있다. 아직까지는 특정 사업자의 핫 스팟으로 서비스 가능 지역이 제한되어 있기 때문에 가용성이 낮아 앞으로 통신 서비스의 주류로 성장하기에는 어려움이 많을 것으로 예상되지만, 무선 랜은 고속 전송 속도와 넓은 서비스 커버리지 그리고 고속 이동성을 동시에 만족시키는 4세대 이동 통신 기술이 개발되기 전까지, 당분간 유선과 무선 기술 간의 가교 역할을 수행할 것으로 기대되고 있다. 따라서 본 고에서는 최근 국내에서도 큰 주목을 받고 있는 공중 무선 랜 서비스의 특성 및 비즈니스 모델을 분석하고, 각 지역별 서비스 사업자들의 동향을 파악함으로써 앞으로의 시장 발전 가능성을 탐색해 보고자 한다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.9-10
• /
• 2012

이진 특징 기술자는 실수 벡터 형태의 특징 기술자보다 빠르게 특징점 추출 및 정합이 가능하고 메모리 공간도 적게 차지하는 장점이 있다. 하지만, 특징점의 수가 많아질수록 정합에 많은 시간이 소요되므로 실시간 처리가 중요한 객체 추적에 적용하기 위해서는 정합의 고속화 방법에 대한 연구가 필요하다. 이에 본 논문에서는 이진 특징 기술자의 군집화를 통한 특징점의 고속 정합 방법을 제안한다. 제안된 방법은 k-means 군집화 알고리즘을 기반으로 정합을 위한 기술자 탐색을 효과적으로 수행함으로써 군집화를 사용하지 않는 기존의 정합 방법에 비해 빠르면서도 높은 정확도를 유지한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.561-564
• /
• 2006

오늘날 컴퓨터와 데이터 통신의 급속한 발달로 인해 멀티미디어 정보통신 기술이 비약적으로 발전하고 있다. 이러한 멀티미디어 데이터 중에서 동영상은 다른 데이터 형태에 비해 정보량이 매우 방대하다. 따라서 동영상을 처리하는 시스템에서는 압축 기법이 매우 중요한 역할을 차지한다. 이에 본 논문은 연속제거 알고리즘을 기반으로 이전블록 초기 움직임 벡터 사용 및 strip단위 블록 합을 통하여 고속의 움직임 추정을 통해 영상을 복호화 하였고, 기존의 완전탐색 블록 정합방식과 영상 복원 능력 및 연산량을 비교 평가하였다. 뿐만 아니라 이후 이를 바탕으로 고속 움직임 추정 모듈을 VHDL로 구현하여 본 논문의 프로그램을 성능평가의 기준으로 이용할 것이다.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.279-279
• /
• 2006

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12C
• /
• pp.1623-1632
• /
• 2004

In this paper, we analyze the performance of linear search and bit reversal search algorithms based on the single-dwell serial search for rapid UWB (Ultra Wide Band) signal acquisition in typical indoor wireless channel environments. Simulation results according to bin spacing and frame interval in IEEE 802.15 Task Group 3a UWB indoor wireless channels show that bit reversal search algorithm achieves much smaller normalized mean acquisition time than linear search algorithm. In particular, it is found that the normalized mean acquisition time of the bit reversal search according to the range of searching termination interval closely matches the ideal case. In addition, we observe that the acquisition performance of bit reversal search algorithm becomes much better as bin spacing gets finer.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1121-1130
• /
• 2003

This paper proposes a new motion estimation algorithm using the temporal continuity of motion. We set up a wide global search region (GSR), which basically corresponds to the search region of FSA, and local search regions (LSRs), the positions for which are predicted by the motion vectors of the temporal neighbor blocks, are constructed in the GSR. The previous frame blocks that possibly have effects on the current block are to be the temporal neighbor blocks. Then Motion estimation is only performed in the areas made by LSRs. Experimental results show that the proposed method can maintain visual qualifies with significant reductions of complexity by reducing search regions, when compared to the conventional FSA.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.3
• /
• pp.273-281
• /
• 2004

There is the temporal correlation of the video sequence between the motion vector of current block and the motion vector of previous block. In this paper, we propose the prediction search algorithm for block matching using the temporal correlation of the video sequence and the center-biased property of motion vectors. The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(sum of absolute difference) value by the predicted motion vector from the same block of the previous frame and the predictor candidate point on each search region. Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved up to the 1.06㏈ as depend on the video sequences and improved about 0.19∼0.46㏈ on an average except the full search(FS) algorithm.