Performance Analysis of Feature Point Detectors in SFF-Inspired Relative Depth Estimation

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 222)

Abstract

This paper is a part of the research that attempts to develop a new method for estimating relative depth of scene based on focus cue inspired by the Shape From Focus (SFF) technique which basically is a 3-D vision technique aiming at scene reconstruction. The proposed method is developed for scene with objects whose geometrical dimensions are of macro-level unlike the conventional SFF algorithms which could deal with extremely small objects in order to avoid parallax. This is essentially because SFF techniques involve motion of either the camera or the object causing structure dependent pixel motion in the image. This hinders finding the corresponding pixels in the sequence of images to perform a measure of image focus and resulting in erroneous reconstruction. The parallax effect is tackled using a matching technique which tracks point correspondences in the image sequence. The points with good local contrast are extracted using the so-called interest point detectors. The paper analyses five different point detectors used to extract feature points in the image. The point detectors were analysed for a number of parameters like repeatability, false detects, matchability and information content. The paper compares their performance and attempts to bring out their advantages and limitations. Three different conditions viz., uniform illumination, non-linear illumination changes, presence of impulse noise in the image were considered. The image processing method is validated for two different textures, one being a repetitive pattern and other a non-repetitive pattern.

Keywords

Shape from focus Parallax Image blur Sparse reconstruction Feature point detector Quantitative evaluation 

References

  1. 1.
    Nayar SK, Nakagawa Y (1990) Shape from Focus: an Effective approach for rough surfaces CRA90. pp 218–225Google Scholar
  2. 2.
    Xiong Y, Shafer SA (1993) Depth from focusing and defocusing. IEEE Comput Vis Pattern Recogn 68–73Google Scholar
  3. 3.
    Förstner W, Gülch E (1987) A fast operator for detection and precise location of distinct points, corners and circular features. In: Proceedings of the intercommission conference on fast processing of photogrammetric data. pp 281–305Google Scholar
  4. 4.
    Harris C, Stephens M (1988) A combined corner and edge detector. In: Proceedings of 4th Alvey vision conference. Manchester, 147–151Google Scholar
  5. 5.
    Sojka E (2002) A new algorithm for detecting corners in digital images. In: Proceedings of SCCG 2002. ACM SIGGRAPH, NY, pp 55–62Google Scholar
  6. 6.
    Lepetit V, Fua P (2006) Key point recognition using randomized trees. IEEE Trans Pattern Anal Mach Intell 28(9):1465–1479CrossRefGoogle Scholar
  7. 7.
    Fischler MA, Bolles RC (1981) Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Commun ACM 24(6):381–395Google Scholar
  8. 8.
    Schmid C, Mohr R, Bauckhage C (2000) Evaluation of interest point detectors. Int J Comput Vis 37(2):151–172Google Scholar
  9. 9.
    Helmli FS, Scherer S (2001) Adaptive shape from focus with an error estimation in light microscopy. In: Proceedings of the 2nd international symposium on image and signal processing and analysisGoogle Scholar
  10. 10.
    Sahay RR, Rajagopalan AN (2011) Dealing With parallax in shape-from-focus. IEEE Trans Image Process 20(2):558–569Google Scholar
  11. 11.
    Moravec H (1980) Obstacle avoidance and navigation in the real world by a seeing robot rover, Tech report CMU-RI-TR-3. Carnegie-Mellon University, Robotics InstituteGoogle Scholar

Copyright information

© Springer India 2013

Authors and Affiliations

  1. 1.Division of Mechatronics, Department of Production Technology, MIT CampusAnna UniversityChennaiIndia

Personalised recommendations