Computational VBSME Optimization: Motion-Only Partitioning with Progressive Early Termination
Received: 26 November 2025 | Revised: 1 January 2026 | Accepted: 6 January 2026 | Online: 6 June 2026
Corresponding author: Vinutha Mallikarjunappa
Abstract
This study presents two motion-only Variable Block Size Motion Estimation (VBSME) algorithms: Hierarchical Motion-Only VBSME (HMO-VBSME) and Integrated Bit-Planar Motion-Only Block Matching (IBPMO-BM). Both algorithms utilize pure motion vector characteristics for block size decisions while extending traditional motion estimation to support 32×32 blocks through a four-level structure (32→16→8→4). Both algorithms integrate directional search pattern optimization that adapts search positions based on previous motion vectors, reducing search complexity by 44% to 89%. HMO-VBSME employs hierarchical planar Sum of Absolute Differences (SAD) computation with multi-level early termination. IBPMO-BM introduces bit-SAD computation with early termination, using motion-driven block size selection. Experimental results on standard video sequences demonstrate that both algorithms maintain PSNR values comparable to Full Search Block Matching Estimation (FSBME), while achieving computational savings of 77% to 97%. A significant proportion of 32×32 blocks are selected (28.4% to 97.4% across sequences), reducing motion vector overhead and improving compression efficiency. These characteristics make both algorithms ideal for ultra-low-complexity real-time video coding applications.
Keywords:
motion estimation, variable block size, hierarchical SAD, bit-planar processing, motion-only analysis, video compressionReferences
R. Li, B. Zeng, and M. L. Liou, "A new three-step search algorithm for block motion estimation," IEEE Transactions on Circuits and Systems for Video Technology, vol. 4, no. 4, pp. 438–442, Dec. 1994.
S. Zhu and K. K. Ma, "A new diamond search algorithm for fast block-matching motion estimation," IEEE Transactions on Image Processing, vol. 9, no. 2, pp. 287–290, Oct. 2000.
M. Bierling, "Displacement Estimation By Hierarchical Blockmatching," in Visual Communications and Image Processing ’88: Third in a Series, Oct. 1988, vol. 1001, pp. 942–953.
W. Li and E. Salari, "Successive elimination algorithm for motion estimation," IEEE Transactions on Image Processing, vol. 4, no. 1, pp. 105–107, Jan. 1995.
M. J. Chen, L. G. Chen, and T. D. Chiueh, "One-dimensional full search motion estimation algorithm for video coding," IEEE Transactions on Circuits and Systems for Video Technology, vol. 4, no. 5, pp. 504–509, July 1994.
Y. W. Huang, B. Y. Hsieh, T. C. Chen, and L. G. Chen, "Analysis, fast algorithm, and VLSI architecture design for H.264/AVC intra frame coder," IEEE Transactions on Circuits and Systems for Video Technology, vol. 15, no. 3, pp. 378–401, Mar. 2005.
Y. W. Chen, M. H. Hsiao, H. T. Chen, C. Y. Liu, and S. Y. Lee, "Content-Aware Fast Motion Estimation Algorithm," Journal of Visual Communication and Image Representation, vol. 19, no. 4, pp. 256–269, May 2008.
Y. G. Lee, "Early search termination for fast motion estimation," EURASIP Journal on Image and Video Processing, vol. 2015, no. 1, Dec. 2015, Art. no. 29.
T. Wiegand, G. J. Sullivan, G. Bjontegaard, and A. Luthra, "Overview of the H.264/AVC video coding standard," IEEE Transactions on Circuits and Systems for Video Technology, vol. 13, no. 7, pp. 560–576, July 2003.
G. Thapa, K. Sharma, and M. K. Ghose, "Multi Resolution Motion Estimation Techniques for Video Compression: A Survey," International Journal of Computer Engineering & Technology (IJCET), vol. 3, no. 2, pp. 399–406, 2012.
X. Liyin, S. Xiuqin, and Z. Shun, "A review of motion estimation algorithms for video compression," in 2010 International Conference on Computer Application and System Modeling (ICCASM 2010), Oct. 2010, pp. 446-450.
A. Dosovitskiy et al., "FlowNet: Learning Optical Flow with Convolutional Networks," in 2015 IEEE International Conference on Computer Vision (ICCV), Dec. 2015, pp. 2758–2766.
E. Ilg, N. Mayer, T. Saikia, M. Keuper, A. Dosovitskiy, and T. Brox, "FlowNet 2.0: Evolution of Optical Flow Estimation with Deep Networks," in 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), July 2017, pp. 1647–1655.
Y. H. Ho, C. Y. Cho, and W. H. Peng, "Deep Reinforcement Learning for Video Prediction," in 2019 IEEE International Conference on Image Processing (ICIP), Sept. 2019, pp. 604–608.
Z. Teed and J. Deng, "RAFT: Recurrent All-Pairs Field Transforms for Optical Flow," in Computer Vision – ECCV 2020, vol. 12347, A. Vedaldi, H. Bischof, T. Brox, and J. M. Frahm, Eds. Springer International Publishing, 2020, pp. 402–419.
M. Atif, Z. H. Khand, S. Khan, F. Akhtar, and A. Rajput, "Storage Optimization using Adaptive Thresholding Motion Detection," Engineering, Technology & Applied Science Research, vol. 11, no. 2, pp. 6869–6872, Apr. 2021.
M. Vinutha and T. M. Manu, "Interframe Prediction Based Stationary Block Revalidation VBSME Using Full Search and Vector-Driven Techniques," Journal of Mobile Multimedia, vol. 21, no. 6, pp. 1195–1220, Nov. 2025.
M. Vinutha and T. M. Manu, "A novel Direction-based Spiral-Skip Search Block_Matching Motion Estimation," in 2024 Global Conference on Communications and Information Technologies (GCCIT), Oct. 2024, pp. 1–6.
"Derf’s Test Media Collection," Xiph.org. https://media.xiph.org/video/derf/.
Downloads
How to Cite
License
Copyright (c) 2026 Vinutha Mallikarjunappa, T. M. Manu

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain the copyright and grant the journal the right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) after its publication in ETASR with an acknowledgement of its initial publication in this journal.
