This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2001 IEEE International Conference on Multimedia and Expo (ICME'01)
FAST FULL SEARCH BASED BLOCK MATCHING ALGORITHM FROM FAST KICK-OFF OF IMPOSSIBLE CANDIDATE CHECKING POINTS
Tokyo, Japan
August 22-August 25
ISBN: 0-7695-1198-8
ASCII Text
x 
 
Jong-Nam Kim, Sung-Cheal Byun, Byung-Ha Ahn, "FAST FULL SEARCH BASED BLOCK MATCHING ALGORITHM FROM FAST KICK-OFF OF IMPOSSIBLE CANDIDATE CHECKING POINTS," 2012 IEEE International Conference on Multimedia and Expo, pp. 177, 2001 IEEE International Conference on Multimedia and Expo (ICME'01), 2001.
 
 
BibTex
x
 
@article{ 10.1109/ICME.2001.1237815,
author = {Jong-Nam Kim and Sung-Cheal Byun and Byung-Ha Ahn},
title = {FAST FULL SEARCH BASED BLOCK MATCHING ALGORITHM FROM FAST KICK-OFF OF IMPOSSIBLE CANDIDATE CHECKING POINTS},
journal ={2012 IEEE International Conference on Multimedia and Expo},
volume = {0},
year = {2001},
isbn = {0-7695-1198-8},
pages = {177},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICME.2001.1237815},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - 2012 IEEE International Conference on Multimedia and Expo
TI - FAST FULL SEARCH BASED BLOCK MATCHING ALGORITHM FROM FAST KICK-OFF OF IMPOSSIBLE CANDIDATE CHECKING POINTS
SN - 0-7695-1198-8
SP
EP
A1 - Jong-Nam Kim,
A1 - Sung-Cheal Byun,
A1 - Byung-Ha Ahn,
PY - 2001
KW - null
VL - 0
JA - 2012 IEEE International Conference on Multimedia and Expo
ER -
 
Jong-Nam Kim, Syscon Lab. of Mechatronics, Kwang-Ju Institute of Science and Technology (K-JIST),
Sung-Cheal Byun, Syscon Lab. of Mechatronics, Kwang-Ju Institute of Science and Technology (K-JIST),
Byung-Ha Ahn, Syscon Lab. of Mechatronics, Kwang-Ju Institute of Science and Technology (K-JIST),
To reduce an amount of computation of full search (FS) algorithm for fast motion estimation, we propose a new and fast matching algorithm without any degradation of predicted images like the conventional FS. The computational reduction without any degradation in predicted image comes from fast kick-off of impossible motion vectors. The fast kick-off of improper motion vectors comes from sequential rejection with derived formula and subblock norms. The sequential rejection of impossible candidates is based on multiple decision boundaries. Our proposed algorithm reduces more the computations than the recent fast full search (FS) motion estimation algorithms.
Citation:
Jong-Nam Kim, Sung-Cheal Byun, Byung-Ha Ahn, "FAST FULL SEARCH BASED BLOCK MATCHING ALGORITHM FROM FAST KICK-OFF OF IMPOSSIBLE CANDIDATE CHECKING POINTS," icme, pp.177, 2001 IEEE International Conference on Multimedia and Expo (ICME'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.