Diamond Search Optimization-Based Technique for Motion Estimation in Video Compression

Diamond Search Optimization-Based Technique for Motion Estimation in Video Compression

Ravi Prasad Ravuri
Copyright: © 2023 |Pages: 14
DOI: 10.4018/IJeC.316773
Article PDF Download
Open access articles are freely available for download

Abstract

In video compression procedure, movement estimation is one of the key segments due to its high computation unpredictability in finding the movement vectors between the frames. The purpose of movement estimation is to diminish the storage space, data transfer capacity, and transmission cost for transmission of video in numerous mixed media administration applications by decreasing the redundancies while preserving the better quality of the video. Each algorithm has its own benefits and culpabilities. Among these, block-based movement estimation calculations are most powerful and adaptable. In this paper, diamond search-hybrid teaching and learning-based optimization (DS-HTLBO) has been proposed for motion estimation. The performance of the proposed DS-HTLBO method is analyzed by considering different performance evaluation parameters such as peak signal-to-noise ratio, mean square error, and compression ratio. The comparative outcomes reveal that the proposed DS-HTLBO method outperformed in terms of PSNR of 41% and CR of 5.47% with other DS, 4SS, and NTSS methods.
Article Preview
Top

1. Introduction

In these days, the videos are in superior quality or top-notch characteristics, so it requires a huge transmission data transfer capacity and a measure of storage (Khalid, B et al, 2020). To lessen the excess information in the video, there are different systems to utilize that pack the data without contrarily influencing the nature of the frames (Madine, F et al, 2018). Video compression strategies are utilized to decrease repetition in video information without influencing visual quality (Yaakob, R et al, 2013).The key advance in the evacuation of temporal redundancy is the Motion Estimation (ME) where a Motion Vector (MV) is anticipated among the Current Frame (CF) and a Reference Frame (RF) (Díaz-Cortés et al, 2017). Block matching (BM) is one of the ME technique, where the frames of considered digital video is partitioned into number of macro blocks (Shiju, P et al, 2018). Every square in the CF, the best coordinating block is recognized in the hunting space of the past frame to limit the Mean-Square-Error (MSE) among macro blocks. The key test is the assessment of MSE is very tedious (Kwon et al 2020, Murthy et al 2016 and Mukherjee et al 2018). Thus, BM algorithm for ME is measured as an advancement issue and it has an objective to find the better coordinating macro square for an objective (Lee et al 2011). There exist different methodologies that were acquainted with accelerate BM through a settled subsection of the inquiry region at the expense of inadequate precision (Nalluri et al 2015).

The authors in (Al-Najdawi et al 2014) proposed DS algorithm which goes for further decreasing the computational multifaceted nature. It will be demonstrated that the proposed DS (Diamond Search) can additionally accelerate the other searching algorithms by a factor of two and keep up its consistency with great execution practically comparable (Yu et al 2017) with the New Three Step Search (NTSS), Four Step Search (4SS), Adaptive Rood Pattern Search (ARPS), and so on. These methodologies were discovered successful, however they unsuccessful to found the trade-off among precision and rapidity (Jianhua et al 1997). Following the motion estimation, a motion compensation is utilized for video compression in the encrypting of video information (Kim et al 2014). It is utilized to acquire the first frame with the assistance of a reference frame as well as the motion vector. The past frames are considered as the RF (Patnaik et al 2015). At the point, when CF could be precisely orchestrated from recently communicated or deposited frames, so that the compression proficiency can be enhanced.

The organization of the paper is listed as next to this introduction section, the prevailing literature survey is presented in section 2. Section 3 explains the motivation of the research work. The proposed method has been explained in section 4. Section 5 gives the simulation results and the conclusion part is described in section 6.

Complete Article List

Search this Journal:
Reset
Volume 20: 1 Issue (2024)
Volume 19: 7 Issues (2023)
Volume 18: 6 Issues (2022): 3 Released, 3 Forthcoming
Volume 17: 4 Issues (2021)
Volume 16: 4 Issues (2020)
Volume 15: 4 Issues (2019)
Volume 14: 4 Issues (2018)
Volume 13: 4 Issues (2017)
Volume 12: 4 Issues (2016)
Volume 11: 4 Issues (2015)
Volume 10: 4 Issues (2014)
Volume 9: 4 Issues (2013)
Volume 8: 4 Issues (2012)
Volume 7: 4 Issues (2011)
Volume 6: 4 Issues (2010)
Volume 5: 4 Issues (2009)
Volume 4: 4 Issues (2008)
Volume 3: 4 Issues (2007)
Volume 2: 4 Issues (2006)
Volume 1: 4 Issues (2005)
View Complete Journal Contents Listing