This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth International Conference on Computational Intelligence and Multimedia Applications (ICCIMA'05)
Fast Block Matching Algorithm Using Spatial Intensity Distribution
Las Vegas, Nevada
August 16-August 18
ISBN: 0-7695-2358-7
Jik-Han Jung, Korea Advanced Institute of Science and Technology
Hwal-Suk Lee, Korea Advanced Institute of Science and Technology
Byung-Gyu Kim, Korea Advanced Institute of Science and Technology
Dong-Jo Park, Korea Advanced Institute of Science and Technology
Block matching algorithm is useful in many applications such as stereo vision, visual tracking and so on. And the heavy computational burden of the full-search algorithm induces many faster algorithms, which can be classified into two. One class reduces the search area where the other reduces the unnecessary computation of each candidate block. In this paper, a new matching algorithm, which reduces the computational burden by using vote strategy, is proposed. With the observation of the property that the best match also has the similar spatial intensity distribution, block matching algorithm is described. The proposed matching algorithm is fast and robust to speckle noise or object occlusion.
Citation:
Jik-Han Jung, Hwal-Suk Lee, Byung-Gyu Kim, Dong-Jo Park, "Fast Block Matching Algorithm Using Spatial Intensity Distribution," iccima, pp.180-185, Sixth International Conference on Computational Intelligence and Multimedia Applications (ICCIMA'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.