Content adaptive image matching by color-entropy segmentation and inpainting Conference

Sun, Y, Xin, J. (2011). Content adaptive image matching by color-entropy segmentation and inpainting . Lecture Notes in Computer Science, 6855 LNCS(PART 2), 471-478. 10.1007/978-3-642-23678-5_56

cited authors

  • Sun, Y; Xin, J

abstract

  • Image matching is a fundamental problem in computer vision. One of the well-known techniques is SIFT (scale-invariant feature transform). SIFT searches for and extracts robust features in hierarchical image scale spaces for object identification. However it often lacks efficiency as it identifies many insignificant features such as tree leaves and grass tips in a natural building image. We introduce a content adaptive image matching approach by preprocessing the image with a color-entropy based segmentation and harmonic inpainting. Natural structures such as tree leaves have both high entropy and distinguished color, and so such a combined measure can be both discriminative and robust. The harmonic inpainting smoothly interpolates the image functions over the tree regions and so blurrs and reduces the features and their unnecessary matching there. Numerical experiments on building images show around 10% improvement of the SIFT matching rate with 20% to 30% saving of the total CPU time. © 2011 Springer-Verlag.

authors

publication date

  • September 20, 2011

published in

Digital Object Identifier (DOI)

start page

  • 471

end page

  • 478

volume

  • 6855 LNCS

issue

  • PART 2