i-manager Publications

Comparative Analysis of Diamond Search and its Star Refinement Algorithms for Motion Estimation

Satish Kumar Sahu*, Dolley Shukla**

* M.E. Student, Department of Electronics Telecommunication Engineering, SSTC, SSGI-FET, Junwani, Bhilai, Durg, India.

Associate Professor, Department of Information Technology, SSTC, SSGI, FET, Junwani, Bhilai, Durg, India

Periodicity:April - June'2017
DOI : https://doi.org/10.26634/jip.4.2.13749

Abstract

Motion estimation is a fundamental procedure for video compression. It is directly related to the compression efficiency by reducing temporal redundancies. Motion estimation is the most critical part of a video encoder and 50% coding complexity or computational time depends on it. To minimize the computational time, there were various ME algorithms proposed and implemented. In this paper, the authors provide performance analysis of Star refinement on Diamond search algorithm and after evaluation, they determine the most optimal algorithm. Each algorithm is evaluated using many test videos and compared through Peak Signal to Noise Ratio (PSNR) and per macro block search points (i.e. computation time) along with search areas. Results suggest that among all the evaluated algorithms, Star Diamond- Diamond Search has the best PSNR based on computation time.

Keywords

Diamond Search, Star Diamond Search, Star Diamond-Diamond Search, Motion Vector, Motion Estimation.

How to Cite this Article?

Sahu, S.K. and Shukla D. (2017). Comparative Analysis of Diamond Search and its Star Refinement Algorithms for Motion Estimation. i-manager’s Journal on Image Processing, 4(2), 16-21. https://doi.org/10.26634/jip.4.2.13749

References

[1]. Ankita P. Chauhan et al., (2012). “Comparative Study on Diamond Search Algorithm for Motion Estimation”. International Journal of Engineering Research & Technology (IJERT), Vol. 1 Issue 10.

[2]. Barjatya, A. (2004). Block matching algorithms for motion estimation. IEEE Transactions Evolution Computation, 8(3), 225-239.

[3]. Kerfa, D., & Belbachir, M. F. (2016). Star diamond: an efficient algorithm for fast block matching motion estimation in H264/AVC video codec. Multimedia Tools and Applications, 75(6), 3161-3175.

[4]. Kibeya, H., Belghith, F., Loukil, H., Ayed, M. A. B., & Masmoudi, N. (2014, March). TZSearch pattern search improvement for HEVC motion estimation modules. In Advanced Technologies for Signal and Image Processing st (ATSIP), 2014 1 International Conference on (pp. 95-99). IEEE.

[5]. Muzammil, M., Khan, Z. A., Ullah, M. O., & Ali, I. (2016, January). Performance analysis of block matching motion estimation algorithms for HD videos with different search parameters. In Intelligent Systems Engineering (ICISE), 2016 International Conference on (pp. 306-311). IEEE.

[6]. N.K. Nakum, A.M. Kothari, (2012). “A Review Paper on Implementation and Comparative Analysis of Motion Estimation Algorithm in Video Compression”, International Journal of Recent Technology and Engineering (IJRITE), Vol 1 Issue 5.

[7]. Satish Kumar Sahu, Mrs. Dolly Shukla, (2017). “A Review Paper on Motion Estimation Techniques”, International Journal of recent and innovation trends in computing and communication (IJRITCC), Vol. 5 Issue 2.

[8]. Zhu, S., & Ma, K. K. (1997, September). A new diamond search algorithm for fast block matching motion estimation. In Information, Communications and Signal Processing, 1997. ICICS., Proceedings of 1997 International Conference on (Vol. 1, pp. 292-296). IEEE.

[9]. Zhu, S., & Ma, K. K. (1998, October). A new star search algorithm for fast block-matching motion estimation. In Proc. Workshop on Very Low Bitrate Coding (VLBV) (pp. 173-176).

	North Americas,UK, Middle East,Europe		India	Rest of world
	USD	EUR	INR	USD-ROW
Pdf	35	35	200	20
Online	35	35	200	15
Pdf & Online	35	35	400	25

Comparative Analysis of Diamond Search and its Star Refinement Algorithms for Motion Estimation

Abstract

Keywords

How to Cite this Article?

References

If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Options for accessing this content: