• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.355-356
• /
• 2006

MPEG-4 ER-BSAC decoder employes a full search method for maximum significance search and arithmetic decoding position search in spectral data decoding procedure. Then the search procedure have the most complexity. This paper proposes the new search method, the maximum significance tree structure, for the optimized implementation of BSAC decoder.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.36T no.3
• /
• pp.32-40
• /
• 1999

In this paper, we present a fast block matching motion estimation algorithm based on successive elimination algorithm (SEA). Based on the characteristic of center-biased motion vector distribution in the search area, the proposed method improves the performance of the SEA with a reduced the number of the search positions in the search area, In addition, to reduce the computational load, this method is combined with both the reduced bits mean absolute difference (RBMAD) matching criterion which can be reduced the computation complexity of pixel comparison in the block matching and pixel decimation technique which reduce the number of pixels used in block matching. Simulation results show that the proposed method provides better performance than existing fast algorithms and similar to full-search block motion estimation algorithm.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.4
• /
• pp.293-298
• /
• 2003

In this paper. we propose a fast search algorithm for nearest neighbor vector quantization (NNVQ). The proposed algorithm rejects those codewords which can not be the nearest codeword and reduces the search range of codebook. Hence it reduces computational time and complexity in encoding process, while it provides the same SD performance as the conventional full search algorithm. We apply the proposed algorithm to the adaptive multi-rate (AMR) speech coder and a general vector quantizer designed by LBG. algorithm. Simulation results show effectiveness of the proposed algorithm.

• Journal of Information Management
• /
• v.32 no.1
• /
• pp.1-22
• /
• 2001

In traditional environment, user must search each journal OPAC, bibliographic DB, and full-text DB and E-Journal separately until user finds scientific and technology informations that he needs. The purpose of this study is to build one-click service system of Journals that supports integrating search. This system provides various functions, such as, journal browsing, journal search, article search, alert function, my library, document delivery service by integrating databases and electronic journals. Users search all information sources through journal OPAC and acquire journal full-text by single interface.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2013.06a
• /
• pp.348-350
• /
• 2013

본 논문에서는 깊이영상의 특징을 이용하여 깊이영상에 보다 적합한 움직임 예측방법에 대한 방식을 제안한다. 기존 컬러영상 기반으로 제안되었던 대부분의 움직임 예측 방법들이 깊이영상에 적용할 경우 local minimum 에 빠지게 되어 이에 따른 압축 성능 저하가 있음을 확인하였다. 본 논문에서는 이러한 문제점들이 깊이영상의 오브젝트 경계 영역에서 나타나게 됨을 분석하며, 이러한 문제점을 해결하기 위해 깊이영상의 경계 영역에 대해 feature matching 방식을 이용한 full search 방식을 제안한다. 실험적인 결과는 제안방식이 기존 full search 방식과 비교하여 성능은 비슷하게 유지한 채 복잡도를 크게 개선할 수 있음을 보여준다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.54-63
• /
• 2000

We present a multi-resolution block matching algorithm (BMA) for fast motion estimation At the coarsest level, a motion vector (MV) having minimum matching error is chosen via a full search, and a MV with minimum matching error is concurrently found among the MVs of the spatially adjacent blocks Here, to examine the spatial MVs accurately, we propose an efficient method for searching full resolution MV s without MV quantization even at the coarsest level The chosen two MV s are used as the initial search centers at the middle level At the middle level, the local search is performed within much smaller search area around each search center If the method used at the coarsest level is adopted here, the local searches can be done at integer-pel accuracy A MV having minimum matching error is selected within the local search areas, and then the final level search is performed around this initial search center Since the local searches are performed at integer-pel accuracy at the middle level, the local search at the finest level does not take an effect on the overall performance So we can skip the final level search without performance degradation, thereby the search speed increases Simulation results show that in comparison with full search BMA, the proposed BMA without the final level search achieves a speed-up factor over 200 with minor PSNR degradation of 02dB at most, under a normal MPEG2 coding environment Furthermore, our scheme IS also suitable for hardware implementation due to regular data-flow.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.3
• /
• pp.258-268
• /
• 2001

The compression method is necessarily used to send the high quality moving picture that contains a number of data in image processing. In the field of moving picture compression method, the motion estimation algorithm is used to reduce the temporal redundancy. Block matching algorithm to be usually used is distinguished partial search algorithm with full search algorithm. Full search algorithm be used in this paper is the method to compare the reference block with entire block in the search window. It is very efficient and has simple data flow and control circuit. But the bigger the search window, the larger hardware size, because large computational operation is needed. In this paper, we design the full search block matching motion estimator. Using the DCT DC values, we decide luminance. And we apply 3 bit compare-selector using bit plane to I(Intra coded) picture, not using 8 bit luminance signals. Also it is suggested that use the same selective bit for the P(Predicted coded) and B(Bidirectional coded) picture. We compare based full search method with PSNR(Peak Signal to Noise Ratio) for C language modeling. Its condition is the reference block 8$\times$8, the search window 24$\times$24 and 352$\times$288 gray scale standard video images. The result has small difference that we cannot see. And we design the suggested motion estimator that hardware size is proved to reduce 38.3％ for structure I and 30.7％ for structure II. The memory is proved to reduce 31.3％ for structure I and II.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.13 no.5
• /
• pp.430-442
• /
• 2013

This paper presents a fast multi-reference frame integer motion estimator for H.264/AVC. The proposed system uses the previously proposed fast multi-reference frame algorithm. The previously proposed algorithm executes a full search area motion estimation in reference frames 0 and 1. After that, the search areas of motion estimation in reference frames 2, 3 and 4 are minimized by a linear relationship between the motion vector and the distances from the current frame to the reference frames. For hardware implementation, the modified algorithm optimizes the search area, reduces the overlapping search area and modifies a division equation. Because the search area is reduced, the amount of computation is reduced by 58.7%. In experimental results, the modified algorithm shows an increase of bit-rate in 0.36% when compared with the five reference frame standard. The pipeline structure and the memory controller are also adopted for real-time video encoding. The proposed system is implemented using 0.13 um CMOS technology, and the gate count is 1089K with 6.50 KB of internal SRAM. It can encode a Full HD video ($1920{\times}1080P@30Hz$) in real-time at a 135 MHz clock speed with 5 reference frames.

• Journal of Broadcast Engineering
• /
• v.7 no.4
• /
• pp.317-326
• /
• 2002

The adaptive coding schemes in H.264 standardization provide a significant ceding efficiency and some additional features like error resilience and network friendliness. The variable block size motion compensation using multiple reference frames is one of the key H.264 coding elements to provide main performance gain, but also the main culprit that increases the overall computational complexity. For this reason, this paper proposes a selective motion estimation algorithm based on variable block size for fast motion estimation in H.264. After we find the SAD(Sum of Absolute Difference) at initial points using diamond search, we decide whether to perform additional motion search in each block. Simulation results show that the proposed method is five times faster than the conventional full search in case of search range $\pm$32.

• Journal of Information Technology Services
• /
• v.7 no.3
• /
• pp.253-269
• /
• 2008

In this paper, we present an application called Semantic Search which is built on different supporting technologies and is designed to improve traditional web searching. The Semantic Search is becoming crucial challenges on semantic web. The assessment and the implementation of the research on Semantic Search is not full-fledged whereas its research is highly interested. Also there exists only little research that offers a commercial use Semantic Search System that should be taken into the account in measuring the effectiveness of a Semantic Search System. This paper proposes an implementation and evaluation for the Semantic Search System. Firstly, we built Semantic Search System which includes a case of development and it's procedure. Secondly, We presented the measurement of our Semantic Search System's effectiveness. Finally, the evaluation offers useful implications to the researchers and practitioners to improve the research level to the commercial use.