The Community for Technology Leaders
RSS Icon
Subscribe
Las Vegas, Nevada
Aug. 16, 2005 to Aug. 18, 2005
ISBN: 0-7695-2358-7
pp: 180-185
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
ABSTRACT
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.
INDEX TERMS
null
CITATION
Jik-Han Jung, Hwal-Suk Lee, Byung-Gyu Kim, Dong-Jo Park, "Fast Block Matching Algorithm Using Spatial Intensity Distribution", ICCIMA, 2005, Computational Intelligence and Multimedia Applications, International Conference on, Computational Intelligence and Multimedia Applications, International Conference on 2005, pp. 180-185, doi:10.1109/ICCIMA.2005.28
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool