Fast motion vector estimation using multiresolution-spatio-temporal correlations

Chalidabhongse, Junavit; Kuo, C.-C. Jay

doi:10.1109/76.585927

Cited by 183 publications

(130 citation statements)

References 18 publications

Supporting

Mentioning

130

Contrasting

Order By: Relevance

“…All of these other methods work directly in the image domain. Multi-resolution motion estimation schemes [18] [19] have also been proposed before. However, such schemes use lower resolutions to initialize the motion search for the next higher resolution, so as to reduce the search space and hence improve computational efficiency.…”

Section: Robust Dense Block Based Motion Estimation Using a 2bit Tmentioning

confidence: 99%

A Survey on Motion Estimation Techniques

2017

IJRTER

View full text Add to dashboard Cite

-Motion estimation is the most compute intensive part of video processing. It is the process of determining motion vectors that describe the transformation from one image to another in a video sequences. Therefore, it is sensible to perform motion estimation only where motion is present. Image data in an image sequence remains mostly the same between frames along motion. To exploit the image data redundancy in image sequences, there is a need to estimate motion. Motion estimation is applicable for video compression enhancement, stereo correspondence, object tracking and determination of optical flow. Many specific methods have been proposed in the context of one or more of these applications. Most motion estimation algorithms either operate directly in the image domain or finding the matching metric that measures how similar two pixels or two patches of pixels. In this paper, a review of various motion estimation techniques are presented.

show abstract

Section: Robust Dense Block Based Motion Estimation Using a 2bit Tmentioning

confidence: 99%

A Survey on Motion Estimation Techniques

2017

IJRTER

View full text Add to dashboard Cite

show abstract

“…Algorithms belonging to decimation of search positions are often trapped in local minima of distortion, thus resulting in poor ME accuracy. Predictive motion estimation [39][40][41][42][43], which utilizes the motion information in the spatial and/or temporal neighboring blocks to form an initial estimate of current MV, can effectively reduce the search area as well as the computation. The reduced motion search area also provides an additional compression since the overhead information of MV is less.…”

Section: Predictive Searchmentioning

confidence: 99%

Survey on Block Matching Motion Estimation Algorithms and Architectures with New Results

Huang

Chen

Tsai

et al. 2006

J VLSI Sign Process Syst Sign Image Video Technol

138

View full text Add to dashboard Cite

Abstract. Block matching motion estimation is the heart of video coding systems. During the last two decades, hundreds of fast algorithms and VLSI architectures have been proposed. In this paper, we try to provide an extensive exploration of motion estimation with our new developments. The main concepts of fast algorithms can be classified into six categories: reduction in search positions, simplification of matching criterion, bitwidth reduction, predictive search, hierarchical search, and fast full search. Comparisons of various algorithms in terms of video quality and computational complexity are given as useful guidelines for software applications. As for hardware implementations, full search architectures derived from systolic mapping are first introduced. The systolic arrays can be divided into inter-type and intra-type with 1-D, 2-D, and tree structures. Hexagonal plots are presented for system designers to clearly evaluate the architectures in six aspects including gate count, required frequency, hardware utilization, memory bandwidth, memory bitwidth, and latency. Next, architectures supporting fast algorithms are also reviewed. Finally, we propose our algorithmic and architectural co-development. The main idea is quick checking of the entire search range with simplified matching criterion to globally eliminate impossible candidates, followed by finer selection among potential best matched candidates. The operations of the two stages are mapped to the same hardware for resource sharing. Simulation results show that our design is ten times more area-speed efficient than full search architectures while the video quality is competitively the same.

show abstract

“…Fast ME algorithm based on multiresolution−spatio−tem− poral correlations (MRST) [42] uses MVs of spatially and temporally neighbouring MBs to determine the best candi− date to start the process. Four levels of the hierarchy are used, and averaging of 2×2 blocks of pixels is employed to generate coarser levels.…”

Section: Multiresolution (Hierarchical) 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

Fast motion vector estimation using multiresolution-spatio-temporal correlations

Cited by 183 publications

References 18 publications

A Survey on Motion Estimation Techniques

A Survey on Motion Estimation Techniques

Survey on Block Matching Motion Estimation Algorithms and Architectures with New Results

Block-based motion estimation algorithms — a survey

Contact Info

Product

Resources

About