Zhu S. & Ma K. (2000) A New Diamond Search Algorithm for Fast BlockMatching Motion Estimation. IEEE Transactions on Image Processing 9 (2), pp. 287--290.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....especially when using the brute force Full Search (FS) algorithm. Several techniques have been previously proposed in an effort to reduce the encoding complexity, such as for example the Three Step Search (TSS) 1] 2 D log Search [2] New Three Step Search (NTSS) 3] and Diamond Search (DS) [5 6]. Unfortunately, even though these algorithms can make the search faster, they usually incur a significant loss in visual quality. Besides, a common drawback of these algorithms is that the motion vectors are found by minimizing a distortion measure such as the SAD, or integral projection. In ....

S. Zhu and K.K. Ma, "A new diamond search algorithm for fast block matching motion estimation," Proc. oflnt. Conf Information, Communications and Signal Processing, vol. l, pp.292-6, 1997.

....is essential. Several algorithms have been proposed in an effort to reduce complexity by reducing the number of checking points examined. Well known techniques are for example the 3 Step Search [1] the New 3 Step Search [2] and the Diamond Correspondence: Email: alexismt ieee.org Search [3 4] algorithms. These techniques, even though could make the search faster, unfortunately at the same time were also affecting considerably the quality of the encoded video. Recently several new high efficiency algorithms were presented [6 8] that not only significantly reduce the number of checking ....

S. Zhu and K.K. Ma, "A new diamond search algorithm for fast block matching motion estimation," Proc. of Int. Conf. Information, Communications and Signal Processing, vol.1, pp.292-6, 1997.

....of bits for motion vector (MV) encoding [8] To resolve these problems, many fast search algorithms [9] 15] and rate distortion optimized algorithms [8] 16] 18] were developed. The fast search algorithms reduce computational complexity either by reducing the number of test positions [9] [14] or by reducing the computational cost of BDM for each position [15] 19] 31] The binary block matching 2 algorithms (BBMAs) 20] 21] based on one bit transform (1BT) belong to the latter. BBMA first uses 1BT to transform the luminance component of video sequences from full resolution ....

....The superiority of the proposed center biased search order over DZS is obvious. E. Performance of FBBMA FBBMA is compared, in terms of PSNR, speed up ratio to FS, and the average bits required for encoding the MVs of each macroblock, versus the ME algorithms FS, TSS [10] MPC [32] and DS [14]. The results are shown in Table V. The value of the threshold needed by MPC is set to be 28, which provides the best PSNR performance among all possible values for the tested sequences. Note that all the necessary overhead computation costs are taken into account when calculating the speed up ....

S. Zhu and K. -K. Ma, "A new diamond search algorithm for fast block-matching motion estimation," IEEE Trans. Image Process., vol. 9, no. 2, pp. 287-290, Feb. 2000.

.... process, especially when using the brute force Full Search (FS) algorithm Several techniques have been previously proposed in an effort to reduce the encoding complexity, such as for example the The H Step Search [1] 2 D log Search [2] New Tw Hb Step Search [3] and Diamond Search (DS) [5 6] Unfortunately, even though these algorithms can make the search faster, they usually incur a significant loss in visual quality Besides, a common drawback of these algorithms is that the motion vectors are found by minimizing a distortion measure such as the SAD, or integral projection In ....

S Zhu and K K Ma, "A new diamond search algorithm for fast block matching motion estimation," Proc. of Int. Conf. Information, Communications and Signal Processing, vol 1, pp 292-6, 1997

....searching all possible blocks. It can be seen that this algorithm is rather computational intensive, making it difficult to apply for real time video compression, particularly for software based imple mentations. For this reason, in the upcoming standard of MPEG 4 [1 2] the Diamond Search (DS) [6 7] algorithm was adopted, due to its superiority versus other well known algorithms such as Three Step Search (TSS) 3] 2 D log Search [4] and New Three Step Search (NTSS) 5] in both terms of computational complexity and output quality. 1 Correspondence: Email: alexis ee.ust.hk; Telephone ....

....In this paper a new algorithm named Predictive Diamond Search (PDS) will be presented which is an improvement of the DS algorithm, and not only manages to have similar complexity as DS, but can also achieve superior and more robust quality. 2. DIAMOND SEARCH The Diamond Search algorithm (DS) [6 7] is mainly based on the assumption that motion vectors are in general center biased [5] The algorithm always starts searching from the center (0,0) of the search area, by examining nine (9) checking points as seen in Figure 1a. If the minimum is found at the center, then four (4) additional ....

S. Zhu and K. K. Ma, "A new diamond search algorithm for fast block matching motion estimation," Proc. of Int. Conf. Information, Communications and Signal Processing , vol. 1, pp. 292-6, 1997.

....as previously mentioned. This research was partially supported by a grant from the Hongkong Telecom Institute of Information Technology and a grant from the Industry Department of Hong Kong Government. In an effort to reduce the complexity in the MPEG 4 encoder, the Diamond Search (DS) Algorithm [9] [10] was proposed and initially adopted in the standard. The algorithm was able to reduce complexity without, in most cases, significantly affecting the quality of the video stream. Unfortunately it was found that the algorithm had poor performance in some cases, especially cases with relatively ....

S. Zhu and K.K. Ma, "A new diamond search algorithm for fast block matching motion estimation," Proc. of Int. Conf. Information, Communications and Signal Processing, vol. 1, pp. 292-6, 1997.

No context found.

Shan Zhu, Kai-Kuang Ma, "A new diamond search algorithm for fast block-matching motion estimation," IEEE Transactions on Image Processing, vol. 9, no. 2, pp. 287-290, Feb. 2000.

No context found.

Zhu S. & Ma K. (2000) A New Diamond Search Algorithm for Fast BlockMatching Motion Estimation. IEEE Transactions on Image Processing 9 (2), pp. 287--290.

No context found.

Zhu S. &Ma K. (1997) A New Diamond Search Algorithm for Fast Block Matching Motion Estimation. In: International Conference on Information, Communications and Signal Processing, September 9--12, Singapore.

No context found.

S. Zhu and K.-K. Ma, "A new diamond search algorithm for fast blockmatching motion estimation," IEEE Trans. Circuit Syst. Video Technol., vol. 9, pp. 287--290, Mar. 2000.

No context found.

S. Zhu and K.-K. Ma, "A new diamond search algorithm for fast blockmatching motion estimation," IEEE Trans. Image Processing, vol. 9, pp. 287--290, Feb. 2000.

No context found.

S. Zhu, K. K. Ma, "A New Diamond Search Algorithm for Fast Block Matching Estimation," Proc. Of Int. Conf. Information, Communications and Signal Processing, Vol.1, pp. 292-296, 1997.

No context found.

S. Zhu and K. K. Ma, "A new diamond search algorithm for fast block- matching motion estimation," in IEEE Trans. Image Proc., vol. 9, no. 2, pp. 287-290, Feb. 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC