• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.8
• /
• pp.1792-1801
• /
• 2003

In these days, image mosaic is getting interest in the field of advertisement, tourism, game, medical imaging, and so on with the development of internet technology and the performance of personal computers. The main problem of mage mosaic is searching corresponding points correctly in the overlapped area between images. However, previous methods requires a lot of CPU times and data processing for finding corresponding points. And they need repeated recording with a revolution of 360 degree around objects or background. This paper presents a new image mosaic method which generates a panorama image from a video sequence recorded by a general video camera. Our method finds the corresponding points between two successive images by using a new direction oriented 3­step block matching methods. Experimental results show that the suggested method is more efficient than the methods based on existing block matching algorithm, such as full search and K­step search algorithm.

• Journal of Broadcast Engineering
• /
• v.16 no.5
• /
• pp.861-872
• /
• 2011

Many fast block-matching algorithms (BMAs) in motion estimation field reduce computational complexity by screening the number of checking points. Although many fast BMAs reduce computations, sometimes they should endure matching errors in comparison with full-search algorithm (FSA). In this paper, a novel fast BMA for constrained one-bit transform (C1BT)-based motion estimation is proposed in order to decrease the calculations of the block distortion measure. Unlike the classical fast BMAs, the proposed algorithm shows a new approach to reduce computations. It utilizes the binomial distribution based on the characteristic of binary plane which is composed of only two elements: 0 and 1. Experimental results show that the proposed algorithm keeps its peak signal-to-noise ratio (PSNR) performance very close to the FSA-C1BT while the computation complexity is reduced considerably.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06a
• /
• pp.203-207
• /
• 1996

This paper describes a method for estimating motion vectors in a video sequence. In this method, we find motion vectors using the full search method from the training images and then, train the codebook of the neural networks vector quantizer using these motion vectors. A motion vector can be estimated using the codebook as a motion prediction region. The codewords in the codebook represent the motion vectors for the input image sequences. Since the codebook is used as the search region for estimating the motion vectors, search points and computation can be reduced compared with the full search block matching algorithm. Additionally, the information required to transmit the motion vectors can be reduced.

• 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.

• Annual Conference of KIPS
• /
• 2006.05a
• /
• pp.153-156
• /
• 2006

본 논문에서는 H.264 표준화 기구인 Joint Video Team(JVT) 권고안의 정수 단위 화소 움직임 예측을 위한 Unsymmetrical-cross Multi-Hexagon-grid Search(UMHexagonS) 알고리즘에서 Uneven Multi-Hexagon-grid Search(UMHGS) 부분을 개선한 알고리즘을 제안한다. 제안하는 알고리즘은 이전 프레임의 동일위치 또는 상위 모드에서 이미 선택된 움직임 벡터(MV: Motion Vector)를 이용하여 신호 대 잡음 비(PSNR: Peak Signal to Noise Ratio) 및 평균 비트 율(Average Bitrates)을 유지하면서, 현재 매크로블록의 검색영역을 줄이는 것이 가능하다. 제안하는 알고리즘의 성능은 Full Search Block Matching Algorithm(FSBMA) 및 UMHexagonS 알고리즘의 integer pel 에 대한 SAD(Sum of Absolute Difference) 연산횟수로 비교평가 하였다. 그 결과, FSBMA 에 비하여 평균 97.64%, UMHexagonS 에 비하여는 평균 17.48%의 연산횟수를 감소시키는 우수함을 보였다.

• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.5
• /
• pp.317-321
• /
• 2013

This paper proposes a detection algorithm for view reversal in a stereoscopic video using a disparity map and motion vector field. We obtain the disparity map of a stereo image was obtained using a specific stereo matching algorithm and classify the image into the foreground and background. Next, the motion vector field of the image on a block basis was produced using a full search algorithm. Finally, the stereo image was considered to be reversed when the foreground moved toward the background and the covered region was in the foreground. The proposed algorithm achieved a good detection rate when the background was covered sufficiently by its moving foreground.

• Journal of Internet Computing and Services
• /
• v.11 no.2
• /
• pp.49-60
• /
• 2010

H.264/AVC offers a better encoding efficiency than conventional video standards by adopting many new encoding techniques. However, the advanced coding techniques also add to the overall complexity for H.264/AVC encoder. Accordingly, it is necessary to perform optimization to alleviate the level of complexity for the video encoder. The amount of computation for motion estimation is of particular importance. In this paper, we propose a diamond web-grid search algorithm combined with efficient stationary block skip method which employs full diamond and dodecagon search patterns, and the variable thresholds are used for performing an effective skip of stationary blocks. The experimental results indicate that the proposed technique reduces the computations of the unsymmetrical-cross multi-hexagon-grid search algorithm by up to 12% while maintaining a similar PSNR performance.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.1
• /
• pp.49-55
• /
• 2007

To improved the multi-resolution fast hierarchical motion estimation by using de-interlacing algorithm that is effective in term of both performance and VLSI implementation, is proposed so as to cover large search area field-based as well as frame based image processing in SoC design. In this paper, we have simulated a various picture mode M=2 or M=3. As a results, the proposed algorithm achieved the motion estimation performance PSNR compare with the full search block matching algorithm, the average performance degradation reached to -0.7dB, which did not affect on the subjective quality of reconstructed images at all. And acquiring the more desirable to adopt design SoC for the fast hierarchical motion estimation, we exploit foreground and background search algorithm (FBSA) base on the dual arithmetic processor element(DAPE). It is possible to estimate the large search area motion displacement using a half of number PE in general operation methods. And the proposed architecture of MHME improve the VLSI design hardware through the proposed FBSA structure with DAPE to remove the local memory. The proposed FBSA which use bit array processing in search area can improve structure as like multiple processor array unit(MPAU).

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.5
• /
• pp.56-65
• /
• 2009

Stereoscopic images consist of the left image and the right image. Thus, stereoscopic images have much amounts of data than single image. Then an efficient image compression technique is needed, the DPCM-based predicted coding compression technique is used in most video coding standards. Motion and disparity estimation are needed to realize the predicted coding compression technique. Their performing algorithm is block matching algorithm used in most video coding standards. Full search algorithm is a base algorithm of block matching algorithm which finds an optimal block to compare the base block with every other block in the search area. This algorithm presents the best efficiency for finding optimal blocks, but it has very large computational loads. In this paper, we have proposed fast disparity estimation algorithm using motion and disparity vector information of the prior frame in stereo image coding. We can realize fast disparity vector estimation in order to reduce search area by taking advantage of global disparity vector and to decrease computational loads by limiting search points using motion vectors and disparity vectors of prior frame. Experimental results show that the proposed algorithm has better performance in the simple image sequence than complex image sequence. We conclude that the fast disparity vector estimation is possible in simple image sequences by reducing computational complexities.

• Journal of Korea Multimedia Society
• /
• v.3 no.4
• /
• pp.356-364
• /
• 2000

Block based fast motion estimation algorithm use the fixed search pattern to reduce the search point, and are based on the assumption that the error in the mean absolute error space monotonically decreases to the global minimum. Therefore, in case of many local minima in a search region we are likely to find local minima instead of the global minimum and highly rely on the initial search points. This situation is evident in the motion boundary. In this paper we define the candidate regions within the search region using the motion information of the neighbor blocks and we propose the multiple local search method (MLSM) which search for the solution throughout the candidate regions to reduce the possibilities of isolation to the local minima. In the MLSM we mark the candidate region in the search point map and we avoid to search the candidate regions already visited to reduce the calculation. In the simulation results the proposed method shows more excellent results than that of other gradient based method especially in the search of motion boundary. Especially, in PSNR the proposed method obtains similar estimate accuracy with the significant reduction of search points to that of full search.