Parallel motion estimation on the MDSP multiprocessor
Neural, Parallel & Scientific Computations
Small-diamond-based search algorithm for fast block motion estimation
Image Communication
A two-stage H.264/AVC encoder for video streaming with fast reference picture selection
Proceedings of the 4th ACM workshop on Wireless multimedia networking and performance modeling
Modeling of pattern-based block motion estimation and its application
IEEE Transactions on Circuits and Systems for Video Technology
A temporal approach for improving intra-frame concealment performance in H.264/AVC
IEEE Transactions on Circuits and Systems for Video Technology
Novel directional gradient descent searches for fast block motion estimation
IEEE Transactions on Circuits and Systems for Video Technology
Video Inpainting on Digitized Old Films
KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part II
FGIT '09 Proceedings of the 1st International Conference on Future Generation Information Technology
CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
Global translational motion estimation (GTME)
LSMS'07 Proceedings of the Life system modeling and simulation 2007 international conference on Bio-Inspired computational intelligence and applications
Video narrative authoring with motion inpainting
Proceedings of the 1st ACM international workshop on Multimodal pervasive video analysis
Narrative generation by repurposing digital videos
MMM'11 Proceedings of the 17th international conference on Advances in multimedia modeling - Volume Part I
Motion extrapolation via human motion analysis
Journal of Mobile Multimedia
Linear algorithm and hexagonal search based two-pass algorithm for motion estimation
CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
Fuzzy quantization based bit transform for low bit-resolution motion estimation
Image Communication
Hi-index | 0.00 |
We propose two cross-diamond-hexagonal search (CDHS) algorithms, which differ from each other by their sizes of hexagonal search patterns. These algorithms basically employ two cross-shaped search patterns consecutively in the very beginning steps and switch using diamond-shaped patterns. To further reduce the checking points, two pairs of hexagonal search patterns are proposed in conjunction with candidates found located at diamond corners. Experimental results show that the proposed CDHSs perform faster than the diamond search (DS) by about 144% and the cross-diamond search (CDS) by about 73%, whereas similar prediction quality is still maintained.