Efficient Motion Estimation Algorithm Research Articles

Efficient fast motion estimation algorithm for real-time applications

Efficient fast motion estimation algorithm for real-time applications

Correction to: Efficient fast motion estimation algorithm for real-time applications

Correction to: Efficient fast motion estimation algorithm for real-time applications

Hexagon Based Compressed Diamond Algorithm for motion estimation and its dedicated VLSI system for HD videos

Motion estimation (ME) is crucial to the performance of a video codec as it recognizes and mitigates temporal redundancies between consecutive frames of a video sequence. It is one of the most computationally intensive blocks in the video encoder. Block matching algorithm (BMA) is considered as one of the best approaches for performing ME due to its ease of implementation and efficiency. Several ME algorithms are based on fixed search patterns while the others are adaptive in nature and exploit the correlation present between neighboring macroblocks of a video frame. This paper introduces an efficient ME algorithm named Hexagon Based Compressed Diamond Algorithm (HCDA) that tries to reduce the complexity of ME by lowering the number of search points in the process. The algorithm uses an early termination technique and an adaptive search pattern that can uniformly deal with slow and fast motion content in a video. The proposed HCDA uses dual threshold technique based on the available spatial information. This further helps in terms of clock cycles or hardware resources during VLSI implementation. Moreover, VLSI design for HCDA can explore the adaptive nature of the algorithm and the adopted search methodology is handled by interleaved memory organization that enhances the operational speed. Supportive data re-use scheme with effective block for SAD computation contributes to a fair trade-off between speed and on-chip area. The designs can work at a maximum frequency of 262 MHz to process 76 HD (1280 × 720) frames per second. The corresponding gate count comes out to be 35.8 K gate equivalent. The encouraging experimental results obtained under various defined metrics indicate suitability of the proposed hardware architecture for its inclusions in portable battery powered consumer video devices.

Meteosat image sequence coding in the Radon field

The high demand for Meteosat image sequences for various fields and the high rate of presentation of methods dealing with these latter is facing with the low rate of presentation of remote sensing image sequence compression methods generally for different imagers. To tackle this issue, a novel Meteosat image sequence coding method in the Radon field is presented in this paper. The idea behind this paper is to show the contribution of the coding in Radon field to an efficient lossless compression. The Radon field, represented here by a new fast Mojette transform (FMT), gives a homogeneous field through a Mojette matrix engendered by the intra-projections and inter-projections redundancy. As a consequence, the use of an efficient block-based motion estimation (ME) algorithm such as adaptive rood pattern search (ARPS) becomes possible in a such environment, which can help to avoid many problems encountered when using the same techniques for remote sensing image as a block effect by way of example. In order to achieve a high lossless compression, the Sorted Run Length Coding (SRLC) is applied to encode besides the motion vectors (MVs), the residual error represented by separate long sequences of zeros in addition to other repeated symbols. The test phase showed that our proposed scheme exceeds the performances of the JPEG-LS standard. The proposed scheme can also be used as pre-technique for methods using Meteosat images in general and their sequences in particular after the decompression process such as meteorological phenomena tracking, segmentation, and so on.

Low complexity versatile video coding for traffic surveillance system

The versatile video coding (VVC) standard can efficiently compress the video data of traffic surveillance system, however, the encoding complexity of VVC is quite high. In this paper, we propose an efficient motion estimation (ME) algorithm for improving the encoding complexity of VVC. First, we propose a content oriented adaptive search range setting algorithm, where the search range size of the children coding units (CUs) can be adaptively set by using the best motion vector information of their parent CU. In addition, based on the high spatial correlation and similar characteristics, we propose a fast reference frame direction decision algorithm to further reduce the ME encoding complexity. The simulation results show that the encoding complexity saving performance of the proposed algorithm is quite well, i.e., the total encoding time is saved by an average of 34.27%, and the ME encoding time is saved by an average of 40.79%.

Low complexity versatile video coding for traffic surveillance system

The versatile video coding (VVC) standard can efficiently compress the video data of traffic surveillance system, however, the encoding complexity of VVC is quite high. In this paper, we propose an efficient motion estimation (ME) algorithm for improving the encoding complexity of VVC. First, we propose a content oriented adaptive search range setting algorithm, where the search range size of the children coding units (CUs) can be adaptively set by using the best motion vector information of their parent CU. In addition, based on the high spatial correlation and similar characteristics, we propose a fast reference frame direction decision algorithm to further reduce the ME encoding complexity. The simulation results show that the encoding complexity saving performance of the proposed algorithm is quite well, i.e., the total encoding time is saved by an average of 34.27%, and the ME encoding time is saved by an average of 40.79%.

Computationally Efficient Motion Estimation Algorithm for HEVC

In this paper, we present a novel computationally efficient motion estimation (ME) algorithm for high-efficiency video coding (HEVC). The proposed algorithm searches in the hexagonal pattern with a fixed number of search points at each grid. It utilizes the correlation between contiguous pixels within the frame. In order to reduce the computational complexity, the proposed algorithm utilizes pixel truncation, adaptive search range, sub-sampling and avoids some of the asymmetrical prediction unit techniques. Simulation results are obtained by using the reference software HM (e n c o d e r_l o w d e l a y_P_m a i n and e n c o d e r_r a n d o m a c c e s s_m a i n profile) and shows 55.49% improvement on search points with approximately the same PSNR and around 1% increment in bit rate as compared to the Test Zonal Search (TZS) ME algorithm. By utilizing the proposed algorithm, the BD-PSNR loss for the video sequences like B a s k e t b a l l P a s s_416 × 240@50 and J o h n n y_1280 × 720@60 is 0.0804 dB and 0.0392 dB respectively as compared to the HM reference software with the e n c o d e r_l o w d e l a y_P_m a i n profile.

Efficient motion estimation algorithm on the layers

The two-layer motion estimation (TME) algorithm searches the motion vectors on the layers with partial distortion measures to boost the computational speed of motion estimation. An efficient motion estimation algorithm is presented in which a fast partial distortion calculation method (FPDCM) has been developed to speed up the motion estimation process on the layers without affecting motion prediction quality. This FPDCM efficiently calculates the partial distortions on the layers faster by removing the redundant computations involved in the partial distortion calculation. As a result, the speed with motion estimation on the layers by using FPDCM is increased when compared with the TME algorithm. Experimental results are given to show the superiority of the proposed algorithm over TME as well as the state-of-the-art fast block matching algorithms.

Improvement and Research on Efficient Motion Estimation Algorithm in Video Compression Generations Analysis of Lip Image Streams for Isolate Words Recognition

Improvement and Research on Efficient Motion Estimation Algorithm in Video Compression Generations Analysis of Lip Image Streams for Isolate Words Recognition

An Optimized Motion Estimation Algorithm and Application in the FRUC System

Based on the optimized three-step search algorithm. Combining threshold judgment as well as local full search, a more efficient motion estimation algorithm is proposed. The algorithm not only inherited the traditional three-step algorithm’s quick speed but also kept the advantages of a relatively small amount of calculation, besides it can avoid the local optimum problem in the three-step search algorithm (TSS). In addition, the algorithm combined with the threshold judgment and local full search algorithm, so it also maintains satisfactory visual quality. Comparing the algorithm with TSS and local full search algorithm (LFS). The algorithm has great performance in search points and peak signal-to-noise ratio. Experimental results show that compared with LFS, search points drop by 34.61% ~ 54.47% .While compared with the TSS, the search points only rise by 6.15% ~ 12.21%. The average PSNR of proposed Algorithm is 0.24dB higher than LFS and 3.30dB higher than TSS.

Direction-Adaptive Motion Estimation (DAME) for Efficient Video Compression

ABSTRACTMotion estimation (ME) is widely accepted as an effective tool in video coding to reduce temporal correlation between frames and yields significant improvement in compression gain while sustaining the picture quality. Among various ME schemes, block-matching motion estimation (BMME) is the most popular approach due to its simplicity and efficiency. The BMME algorithms use search patterns to find out the best matched block. However, a single search pattern does not prove efficient in finding best matched block for all motion types. In this research, an efficient direction-adaptive motion estimation (DAME) algorithm is proposed which adaptively selects shape and size of the patterns based on motion content. Performance analysis of DAME algorithm on the reference code JM of H.264/AVC platform reveals that the proposed algorithm outperforms other existing BMME algorithms in search points without degrading the picture quality.

A Fast Block-Matching Motion Estimation Method Based on Difference Search Algorithm

The diamond search (DS) algorithm is one of the most efficient block matching motion estimation algorithms by far and has already been applied in MPEG2/4. Through our research, we found that there is still some redundancy in the algorithm. In this paper, an improved new difference based search (DBS) algorithm is proposed. Simulation results demonstrate that the new algorithm outperforms the well-known diamond search (DS) algorithm and four step-searches (4SS). It obtains almost the same Peak Signal to Noise Ratio (PSNR) while requires less computations than the DS algorithm and 4SS algorithm.

An Efficient Motion Estimation Algorithm for H.264/AVC

The efficient motion estimation algorithms are the important research hotspot in the real-time video coding-decoding technology. This paper proposes a novel and simple fast motion estimation algorithm based on adaptive search-pattern. The new algorithm includes three schemes: stationary block prediction, predictive search for non-stationary blocks, choosing a starting point and adaptive refinement search in merging process. Experiments show that the efficient motion estimation algorithm proposed can further reduce the computations of block-matching while improve the compression effect.

Simple and efficient motion estimation algorithm by continuum search

Motion estimation plays a vital role in reducing temporal correlation in video codecs but it requires high computational complexity. Different algorithms have tried to reduce this complexity. Howev...

Power efficient motion estimation algorithm and architecture based on pixel truncation

A new block matching algorithm and its VLSI architecture for performing Motion Estimation (ME) are presented in this paper. In the reported fast two stage search algorithm, ME is performed in two stages. In the first stage, pixel truncation is used. In the second stage, ME is performed with full pixel resolution with an adaptive search pattern. The main advantage of the proposed algorithm is the inclusion of an early termination mechanism to reduce overall power consumption for the resulting architecture. The paper also introduces a suitable architecture to implement the proposed ME algorithm. In this architecture, a new memory management scheme has been proposed so that different bit planes can be accessed at different stages of ME from the same memory module. It has been shown that the proposed architecture can save approximately 27% power compared to another recently reported architecture. The proposed architecture can therefore be considered suitable for portable, battery-powered video consumer devices <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sup> .

Efficient Motion Estimation Algorithms for Video Coding

This work proposes an efficient motion estimation algorithm for video coding. The proposed method calculates the partial distortion by replacing a certain number pixels of each partial sub-macroblock. In addition to increase the probability of the rejection of unsuitable motion vectors without additional computations, the proposed approach reduce computational complexity significantly and obtains better objective quality than conventional motion estimation algorithms.

Motion estimation using two-stage predictive search algorithms based on joint spatio-temporal correlation information

Motion estimation is one of the major problems in developing a real-time software-based video codec since it has high search complexity. In the motion estimation process, the motion field of the current block can generally be tracked from the motion fields of the neighboring blocks in the spatial and temporal directions. In this paper, two efficient fast motion estimation algorithms with a two-stage predictive search based on joint spatio-temporal correlations are proposed to reduce the search complexity. In the first stage, a rough search from the given motion vectors associated with six spatially and temporally correlated blocks attempts to find a starting point of the adequate search range that is closer to the global optimum. In the second stage, block-based gradient descent search ( Liu & Feig, 1996) and predictive partial search (proposed) algorithms are used for fine search to elaborately search the adequate range from the starting point for the best motion vector. Simulation results demonstrate that our algorithms effectively reduce the average number of checked points to only 1.55% and 0.78% as compared to the full search method and yield a great performance improvement in terms of computational complexity, PSNR and bit rates as compared to full search and some well-known fast search methods.

Application of An Improved Motion Estimated Three Step Search Algorithm in infrared Video

Infrared video image compression is an important video processing technology infrastructure. This thesis proposes a efficient and fast block matching motion estimation algorithm. One strategy of this algorithm is to begin searching from two positions the predictive search centre and the(0,0)position, which earl still hold direction when the relatively predictive error is big. The other strategy is to adopt the Big Small Square search pattern, which chooses search step according to the moving state of objects. Experimental results show that the algorithm galls highly reduce computational complexity with little video quality dropping.

Predictive cross-hexagon search algorithm for fast block motion estimation

Block-matching motion estimation plays an important role in real-time video compression and thus has significant impact on searching speed and quality of performance. In order to address these issues, we introduce a highly efficient block motion estimation algorithm, referred to as a predictive cross-hexagon search (PCHS) algorithm, that can considerably reduce the complexity of the Joint Video Team (JVT) encoder. In contrast to many classical fast motion estimation algorithms, PCHS has three desirable features: (1) prediction of a search center, (2) usage of search patterns with different sizes, and (3) early algorithm termination that makes it adaptive and effective. We set four predictor candidates for initial search point options and then increase the accuracy of the predictor. The different-size search patterns, including small cross search patterns, hexagon search patterns, and cross-hexagon search patterns, used in the searching process can better suit more motion types. Due to the high accuracy of the predictor, the proposed algorithm adapts early termination; as the predictor is good enough, the search stops early. Therefore, the PCHS algorithm is suitable for real-time video encoding, as it can speed up the encoder without sacrificing performance compared with other fast algorithms.

Efficient Hierarchical Motion Estimation Algorithm and Its VLSI Architecture

This paper addresses the development and hardware implementation of an efficient hierarchical motion estimation algorithm, HMEA, using multiresolution frames to reduce the computational complexity. Excellent estimation performance is ensured using an averaging filter to downsample the original image. At the smallest resolution, the least two motion vector candidates are selected using a full-search block matching algorithm. At the middle level, these two candidate motion vectors are employed as the center points for small range local searches. Then, at the original resolution, the final motion vector is obtained by performing a local search around the single candidate from the middle level. HMEA exhibits regular data flow and is suitable for hardware implementation. An efficient VLSI architecture that includes an averaging filter to downsample the image and two 2-D semisystolic processing element arrays to determine the sum of absolute difference in pipeline is also presented. Simulation results indicate that HMEA is more area-efficient and faster than many full-search and multiresolution architectures while maintaining high video quality. This architecture with 59K gates and 1393 bytes of RAM is implemented for a search range of [ -16.0, +15.5].