Multi-level successive elimination algorithm for motion estimation in video coding

Gao, Xiqi; Duanmu, Chunjiang; Zou, Cairong; He, Zanming

doi:10.1109/iscas.1999.779983

Cited by 5 publications

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For PDS, it suffers inherently from branch misprediction penalty; say, for example, it happens in Intel CPUs. Except for the " Table Tennis" sequence and the VOs, the SEA requires less 15) computational time as compared to that of the PDS, while the SEA actually requires more operations. Even though the presence of these two drawbacks, our experimental results show that the CPME-PDS gives the best performance for sequences containing high-motion activities and the video objects.…”

Section: B Experimental Results and Discussionmentioning

confidence: 99%

See 1 more Smart Citation

New adaptive partial distortion search using clustered pixel matching error characteristic

Hui¹,

Siu²,

Chan³

2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)

View full text Add to dashboard Cite

Abstract-In order to reduce the computation load, many conventional fast block-matching algorithms have been developed to reduce the set of possible searching points in the search window. All of these algorithms produce some quality degradation of a predicted image. Alternatively, another kind of fast block-matching algorithms which do not introduce any prediction error as compared with the full-search algorithm is to reduce the number of necessary matching evaluations for every searching point in the search window. The partial distortion search (PDS) is a well-known technique of the second kind of algorithms. In the literature, many researches tried to improve both lossy and lossless block-matching algorithms by making use of an assumption that pixels with larger gradient magnitudes have larger matching errors on average. Based on a simple analysis, it is found that, on average, pixel matching errors with similar magnitudes tend to appear in clusters for natural video sequences. By using this clustering characteristic, we propose an adaptive PDS algorithm which significantly improves the computation efficiency of the original PDS. This approach is much better than other algorithms which make use of the pixel gradients. Furthermore, the proposed algorithm is most suitable for motion estimation of both opaque and boundary macroblocks of an arbitrary-shaped object in MPEG-4 coding.

show abstract

Section: B Experimental Results and Discussionmentioning

confidence: 99%

“…By making use of the Minkowski's inequality, the SEA eliminates an impossible candidates MB without calculating the SAD. 4) The fourth category is to use a combination of the above techniques to further improve the coding efficiency, [14] and [15].…”

Section: Introductionmentioning

confidence: 99%

New adaptive partial distortion search using clustered pixel matching error characteristic

Hui¹,

Siu²,

Chan³

2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)

View full text Add to dashboard Cite

show abstract

Multi-scale based motion estimation for high quality video coding

Kim

Jung

Park

et al. 2011

2011 IEEE International Conference on Consumer Electronics (ICCE)

View full text Add to dashboard Cite

Block-based motion estimation (ME) has been widely used in various video coding standards due to its effectiveness removing temporal redundancy. It plays a key role in the transmission and storage of video signals at reduced bit rates. In this paper, a novel motion estimation algorithm is proposed to enhance video quality by reflecting enlarging and reducing movements such as zoom in/out scene. The experimental results show that the proposed algorithm achieves average quality enhancement of 1.19dB (up to 2.34db) in PSNR gain with acceptable increment of ME time.

show abstract