A Novel Hexagonal Search Algorithm for Fast Block Matching Motion Estimation

Hamosfakidis, Anastasios; Paker, Yakup

doi:10.1155/s111086570220311x

Cited by 15 publications

(6 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In newly formed pattern there only three endpoints values are evaluated, where other three endpoints are overlapped. The Fig.6 represents an example of search path of Hexagonal algorithm [22].…”

Section: Hexagonal Search Algorithmmentioning

confidence: 99%

Bit Rate Reduction for H.264/AVC Video Based on Novel Hexagon Search Algorithm

Mamatha¹,

Keshaveni²

2018

IJIVP

View full text Add to dashboard Cite

Video compression without losing the quality of information is more complex and time consuming process in video communication. H.264/AVC is designed and developed to meet corresponding video compression. Motion estimation and motor vector are the two important key techniques considered during video compression. The encoder complexity and process time is increased as demand increases for better quality of video service. The proposed model mainly concentrated on bit rate reduction of H.264/AVC with reduced rate distortion optimization (RDO) computation. Based on the texture information each input frame slices into 16 × 16 and 4 × 4 Macro block (MB) divisions. For each MB a gradient bit cost and RDO value is calculated for the best mode selection. If the bit cost of the MB is less than predefined level then DC mode are directly chosen for frame prediction, similarly the process is repeated for all chroma samples. This process of mode selection minimizes the RDO calculation up to 36 modes, further the complexity of encoder is reduced by using a motion search algorithms. The proposed system is implemented using MATLAB tool with Hexagonal motion search and Binary Search methods to reduce the bit rate video frames. The system performance is analysed by using a PSNR value and bit rate of the Predicted frame.

show abstract

Section: Hexagonal Search Algorithmmentioning

confidence: 99%

Bit Rate Reduction for H.264/AVC Video Based on Novel Hexagon Search Algorithm

Mamatha¹,

Keshaveni²

2018

IJIVP

View full text Add to dashboard Cite

show abstract

“…However, its computational complexity is too huge to be applied to an encoding algorithm. Fast search algorithms greatly reduce the computational complexity with a slight decline in the encoding quality, and typical ones include the three-step search (TSS) of Koga et al [5], the four-step search (FSS) method of Po and Ma [6], the diamond search (DS) method of Zhu and Ma [7], the cross-diamond search (CDS) method of Cheung and Po [8], the hexagonal search (HS) method of Hamosfakidis and Paker [9], the hybrid unsymmetrical multi-Hexagon-grid search (UMHexagonS) method of Zhu et al [10], the enhanced hexagonal search (EHS) method of Zhu et al [11], the enhanced predictive zonal search (EPZS) method of Tourapis [12], and the test zone search (TZS) method of Purnachand et al [3].…”

Section: Introductionmentioning

confidence: 99%

A Highly Parallel and Scalable Motion Estimation Algorithm with GPU for HEVC

Xue

Ren

et al. 2017

Scientific Programming

View full text Add to dashboard Cite

We propose a highly parallel and scalable motion estimation algorithm, named multilevel resolution motion estimation (MLRME for short), by combining the advantages of local full search and downsampling. By subsampling a video frame, a large amount of computation is saved. While using the local full-search method, it can exploit massive parallelism and make full use of the powerful modern many-core accelerators, such as GPU and Intel Xeon Phi. We implanted the proposed MLRME into HM12.0, and the experimental results showed that the encoding quality of the MLRME method is close to that of the fast motion estimation in HEVC, which declines by less than 1.5%. We also implemented the MLRME with CUDA, which obtained 30-60x speed-up compared to the serial algorithm on single CPU. Specifically, the parallel implementation of MLRME on a GTX 460 GPU can meet the real-time coding requirement with about 25 fps for the 2560 × 1600 video format, while, for 832 × 480, the performance is more than 100 fps.

show abstract

“…In order to achieve compression of video signals, motion estimation between the successive frames is performed which contributes significant bit saving by transmitting only the motion vectors. This is the most computationally intensive operation in the coding and transmitting of video signals [1][2][3]. Due to this, block based motion compensation techniques have been proposed to alleviate the computational burden [8][9][10][11][12].…”

Section: Introductionmentioning

confidence: 99%

“…Experiment results show that the MEBSS can reduce average 20% bit rate and 2% encoding time while maintaining the same perceptual video quality and the maximum reduction in bit rate is more than 50%. Anastasias et al proposed Hexagonal (HS) that adopts center-biased checking point pattern for fast block motion estimation [3]. Experimental results show that HS provides competitive performance with reduced computational complexity.…”

Section: Introductionmentioning

confidence: 99%

A New Hybrid Search Scheme for Video Motion Estimation

Yan¹,

Meng²

2011

JCIT

View full text Add to dashboard Cite

For video compression problems inter frame prediction is well exploited by motion estimation algorithms, where the temporal redundancy between the successive frames are effectively removed. In order to alleviate computational complexity, several block-based fast motion estimation algorithms have been proposed. The efficiency of such algorithms largely depends on the low-resolution coarse search and fine resolution inner search to recognize the slow and fast movements of the object. This paper suggests a hybrid motion compensation technique (H-MCT) based on Cross Diamond Search (CDS) and Efficient Three Step Search (E3SS) algorithms, which effectively detect the slow and fast movements with less computation time. The performance of the proposed scheme is evaluated in terms of two matching criteria, namely sum of absolute difference (SAD) and mean absolute difference (MAD) as well as the fidelity measure, peak signal-to-noise ratio (PSNR). Experimental results show that the proposed scheme performs better than state-of-the-art algorithms such as CDS and E3SS by utilizing less number of search points.

show abstract

A Novel Hexagonal Search Algorithm for Fast Block Matching Motion Estimation

Cited by 15 publications

References 4 publications

Bit Rate Reduction for H.264/AVC Video Based on Novel Hexagon Search Algorithm

Bit Rate Reduction for H.264/AVC Video Based on Novel Hexagon Search Algorithm

A Highly Parallel and Scalable Motion Estimation Algorithm with GPU for HEVC

A New Hybrid Search Scheme for Video Motion Estimation

Contact Info

Product

Resources

About