In this paper, we propose a new block matching algorithm that extracts motion vectors from consecutive range data. The proposed method defines a matching metric that integrates intensity, hue and range. Our algorithm begins matching with a small matching template. If the matching degree is not good enough, we slightly expand the size of a matching template and then repeat the matching process until our matching criterion is satisfied or the predetermined maximum size has been reached. As the iteration proceeds, we adaptively adjust weights of the matching metric by considering the importance of each feature. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Jang, S. W., Pomplun, M., & Shin, M. C. (2003). Block matching integrating intensity, hue, and range. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2781, 442–449. https://doi.org/10.1007/978-3-540-45243-0_57
Mendeley helps you to discover research relevant for your work.