Fast Motion Estimation Based on Binary Edge Information
Summary :
In this paper, we propose a fast full-search block matching algorithm for motion estimation, based on binary edge information. The binary edge information allows a faster search by reducing the computational complexity. It also reduces error, which is generated by the block located on the boundary of moving objects. After we transform the input image into an edge-based image using Sobel masks, we convert the result into a binary edge image using median-cut quantization. We then perform block matching using the binary edge image. If there exists blocks such that the error of the binary block matching exceeds threshold, we only perform edge intensity-based block matching within those blocks. We improve computational efficiency by eliminating an unnecessary searching process in no-motion regions. Simulation results have shown that the proposed method reduces the computational complexity and provides similar PSNR performance to the Full Search Block Matching Algorithm (FS-BMA)
- Publication
- IEICE TRANSACTIONS on Information Vol.E86-D No.8 pp.1456-1458
- Publication Date
- 2003/08/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Image Processing, Image Pattern Recognition
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Won Bae PARK, Nae Joung KWAK, Young Jun SONG, Jae Hyeong AHN, "Fast Motion Estimation Based on Binary Edge Information" in IEICE TRANSACTIONS on Information,
vol. E86-D, no. 8, pp. 1456-1458, August 2003, doi: .
Abstract: In this paper, we propose a fast full-search block matching algorithm for motion estimation, based on binary edge information. The binary edge information allows a faster search by reducing the computational complexity. It also reduces error, which is generated by the block located on the boundary of moving objects. After we transform the input image into an edge-based image using Sobel masks, we convert the result into a binary edge image using median-cut quantization. We then perform block matching using the binary edge image. If there exists blocks such that the error of the binary block matching exceeds threshold, we only perform edge intensity-based block matching within those blocks. We improve computational efficiency by eliminating an unnecessary searching process in no-motion regions. Simulation results have shown that the proposed method reduces the computational complexity and provides similar PSNR performance to the Full Search Block Matching Algorithm (FS-BMA)
URL: https://global.ieice.org/en_transactions/information/10.1587/e86-d_8_1456/_p
Copy
@ARTICLE{e86-d_8_1456,
author={Won Bae PARK, Nae Joung KWAK, Young Jun SONG, Jae Hyeong AHN, },
journal={IEICE TRANSACTIONS on Information},
title={Fast Motion Estimation Based on Binary Edge Information},
year={2003},
volume={E86-D},
number={8},
pages={1456-1458},
abstract={In this paper, we propose a fast full-search block matching algorithm for motion estimation, based on binary edge information. The binary edge information allows a faster search by reducing the computational complexity. It also reduces error, which is generated by the block located on the boundary of moving objects. After we transform the input image into an edge-based image using Sobel masks, we convert the result into a binary edge image using median-cut quantization. We then perform block matching using the binary edge image. If there exists blocks such that the error of the binary block matching exceeds threshold, we only perform edge intensity-based block matching within those blocks. We improve computational efficiency by eliminating an unnecessary searching process in no-motion regions. Simulation results have shown that the proposed method reduces the computational complexity and provides similar PSNR performance to the Full Search Block Matching Algorithm (FS-BMA)},
keywords={},
doi={},
ISSN={},
month={August},}
Copy
TY - JOUR
TI - Fast Motion Estimation Based on Binary Edge Information
T2 - IEICE TRANSACTIONS on Information
SP - 1456
EP - 1458
AU - Won Bae PARK
AU - Nae Joung KWAK
AU - Young Jun SONG
AU - Jae Hyeong AHN
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E86-D
IS - 8
JA - IEICE TRANSACTIONS on Information
Y1 - August 2003
AB - In this paper, we propose a fast full-search block matching algorithm for motion estimation, based on binary edge information. The binary edge information allows a faster search by reducing the computational complexity. It also reduces error, which is generated by the block located on the boundary of moving objects. After we transform the input image into an edge-based image using Sobel masks, we convert the result into a binary edge image using median-cut quantization. We then perform block matching using the binary edge image. If there exists blocks such that the error of the binary block matching exceeds threshold, we only perform edge intensity-based block matching within those blocks. We improve computational efficiency by eliminating an unnecessary searching process in no-motion regions. Simulation results have shown that the proposed method reduces the computational complexity and provides similar PSNR performance to the Full Search Block Matching Algorithm (FS-BMA)
ER -
English
