Novel Point-Oriented Inner Searches for Fast Block Motion Estimation

Po, Lai-Man; Wong, Kwok-Wo; Ng, Ka-Ho

doi:10.1109/tmm.2006.886330

Cited by 32 publications

(14 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hexagon-based search (HS) algorithm can achieve substantial speed improvement over the DS algorithm with similar distortion performance. The enhanced versions of hexagonal search algorithm [6][7][8] have been proposed for further reduction of the search points over Hexagonal Search algorithm. These algorithms mainly concentrate on the fast inner search technique to improve the inner search speed.…”

Section: A Survey On Block Matching Algorithms For Video Coding (Adapmentioning

confidence: 99%

“…An Enhanced Hexagonal-based Search using Point-Oriented Inner Search (EHS-POIS) is presented in [7] to reduce the search points further. The EHS-POIS uses an efficient grouping method for the large hexagon which is based on minimizing Mean Internal Distance (MID) for each inner point, as shown in Figure 6(b).…”

Section: Enhanced Versions Of Hexagonal Search Algorithmmentioning

confidence: 99%

“…A possible classification of these fast search motion estimation algorithms into the following categories: reduction in search positions [1][2][3][4][5][6][7][8][9], predictive search [10][11][12][13][14], search pattern switching [15], [16], multi-resolution search [17][18][19][20] and Fractional-Pixel Interpolation [21][22]. Existing fast search motion estimation algorithms use one or a combination of these categories.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Survey on Block Matching Algorithms for Video Coding

Paramkusam¹,

Arun²

2017

IJECE

View full text Add to dashboard Cite

Block matching algorithm (BMA) for motion estimation (ME) is the heart to many motion-compensated video-coding techniques/standards, such as ISO MPEG-1/2/4 and ITU-T H.261/262/263/264/265, to reduce the temporal redundancy between different frames. During the last three decades, hundreds of fast block matching algorithms have been proposed. The shape and size of search patterns in motion estimation will influence more on the searching speed and quality of performance. This article provides an overview of the famous block matching algorithms and compares their computational complexity and motion prediction quality. Keyword:Block INTRODUCTIONThe main objective of block matching algorithms is to determine the direction and magnitude of motion (motion vector) for a macroblock in the current frame relative to the best matched candidate block in the reference frame. The search for the best matching candidate block may be carried out by comparing the macroblock in the current frame with some or all the possible candidate blocks in a search window. FullSearch (FS) is an exhaustive search algorithm and it is the simplest method to find the optimal motion vectors for each macroblock. It determines the best matched candidate block through calculating the Sum of Absolute Difference (SAD) for all candidate blocks in the search window. Although Full-Search can obtain the global optimal result, it has very intensive computations.To reduce the complexity of Full-Search, several fast search motion estimation algorithms have been proposed at the price of slightly impaired Peak Signal-to-Noise Ratio (PSNR) performance. A possible classification of these fast search motion estimation algorithms into the following categories: reduction in search positions [1][2][3][4][5][6][7][8][9], predictive search [10][11][12][13][14], search pattern switching [15], [16], multi-resolution search [17][18][19][20] and Fractional-Pixel Interpolation [21][22]. Existing fast search motion estimation algorithms use one or a combination of these categories. A popular example is the three-step search (TSS) algorithm [1]. However, its uniformly spaced search pattern is not well matched to most real-world video sequences in which the motion vector distribution is non-uniformly biased toward the zero vector. Such an observation inspired the new three-step search (NTSS) which has a centre-biased search pattern and supports a halfwaystop technique [2]. The centre-biased NTSS algorithm is an improved version of TSS, tends to achieve much superior performance with fewer number of search points on average. The search pattern has an important influence on speed and distortion performance in block motion estimation.In TSS and NTSS algorithms square-shaped search patterns of different sizes are employed. The Diamond search (DS) algorithm adopts a diamond-shaped search pattern [3], which is more efficient than

show abstract

Section: A Survey On Block Matching Algorithms For Video Coding (Adapmentioning

confidence: 99%

Section: Enhanced Versions Of Hexagonal Search Algorithmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Survey on Block Matching Algorithms for Video Coding

Paramkusam¹,

Arun²

2017

IJECE

View full text Add to dashboard Cite

show abstract

“…Later modifications of HEXBS introduce search centre prediction and more detai− led inner search of the final large hexagon shape [34][35][36].…”

Section: Characterization Of Algorithmsmentioning

confidence: 99%

Block-based motion estimation algorithms — a survey

Jakubowski

Pastuszak

2013

Opto-Electronics Review

View full text Add to dashboard Cite

In the multi-view video coding, both temporal and inter-view redundancies can be exploited by using standard block-based motion estimation (BBME) technique. In this paper, an extensive review of BBME algorithms proposed within the last three decades is presented. Algorithms are divided into five categories: 1) based on the search position number reduction; 2) multiresolution; 3) based on the simplification of matching criterion; 4) fast full search; 5) computation-aware. Algorithms are compared in terms of their efficiency and computational complexity.

show abstract

“…Hybrid Search Scheme [15] selects between DS and E3SS after first step. Point-Oriented Inner Searches [16] is extended version of DS and HS. BMAs with switching search patterns are not efficient for hardware implementation due to irregular memory access hence further analysis is restricted to search strategy with less complex patterns like DS.…”

Section: Full Search and Fast Searchmentioning

confidence: 99%

Early termination in diamond search method using statistical analysis

Shah¹,

Dalal

2013

2013 IEEE Second International Conference on Image Information Processing (ICIIP-2013)

View full text Add to dashboard Cite

Multimedia is key technology for today's handheld devices. Interactive messages, video chat, video conferencing are quickly replacing traditional way of communication which has become possible because of effective video processing methods that enable high compression. Variety of devices are used from high end computers to low end phones to serve the purpose. Specifically gadgets with low computational power, wants to achieve reasonable good quality video with little cost of computation which can be accomplish by proficient video coding. Motion Estimation and Motion Compensation are tools for video compression, in which motion information of the current block is predicted from adjacent blocks using Sum of Absolute Difference as cost function. Whole process is extremely computation rigorous and demands reduction in amount of computation withclause of sustaining visual quality, to make it suitable for end devices with low computation supremacy. In this paper statistical analysis of motion information is made which is used to diminish amount of computation in existing diamond search (DS) method.

show abstract

Novel Point-Oriented Inner Searches for Fast Block Motion Estimation

Cited by 32 publications

References 14 publications

A Survey on Block Matching Algorithms for Video Coding

A Survey on Block Matching Algorithms for Video Coding

Block-based motion estimation algorithms — a survey

Early termination in diamond search method using statistical analysis

Contact Info

Product

Resources

About