Detecting Faint Curved Edges in Noisy Images

  • Sharon Alpert
  • Meirav Galun
  • Boaz Nadler
  • Ronen Basri
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6314)


A fundamental question for edge detection is how faint an edge can be and still be detected. In this paper we offer a formalism to study this question and subsequently introduce a hierarchical edge detection algorithm designed to detect faint curved edges in noisy images. In our formalism we view edge detection as a search in a space of feasible curves, and derive expressions to characterize the behavior of the optimal detection threshold as a function of curve length and the combinatorics of the search space. We then present an algorithm that efficiently searches for edges through a very large set of curves by hierarchically constructing difference filters that match the curves traced by the sought edges. We demonstrate the utility of our algorithm in simulations and in applications to challenging real images.


Edge Detection Noisy Image False Detection Beam Curve General Quadrangle 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Canny, J.: A computational approach to edge detection. TPAMI 8, 679–698 (1986)Google Scholar
  2. 2.
    Perona, P., Malik, J.: Scale space and edge detection using anisotropic diffusion. TPAMI 12, 629–639 (1990)Google Scholar
  3. 3.
    Galun, M., Basri, R., Brandt, A.: Multiscale edge detection and fiber enhancement using differences of oriented means. In: ICCV (2007)Google Scholar
  4. 4.
    Geback, T., Koumoutsakos, P.: Edge detection in microscopy images using curvelets. BMC Bioinformatics 10, 75 (2009)CrossRefGoogle Scholar
  5. 5.
    Yi, S., Labate, D., Easley, G.R., Krim, H.: A shearlet approach to edge analysis and detection. T-IP 18, 929–941 (2009)Google Scholar
  6. 6.
    Mei, X., Zhang, L.: p., Li, P.x.: An approach for edge detection based on beamlet transform. In: ICIG, pp. 353–357 (2007)Google Scholar
  7. 7.
    Dollar, P., Tu, Z., Belongie, S.: Supervised learning of edges and object boundaries. In: CVPR, pp. 1964–1971 (2006)Google Scholar
  8. 8.
    Martin, D., Fowlkes, C., Malik, J.: Learning to detect natural image boundaries using local brightness, color, and texture cues. TPAMI 26, 530–548 (2004)Google Scholar
  9. 9.
    Felzenszwalb, P., McAllester, D.: The generalized a* architecture. JAIR 29 (2007)Google Scholar
  10. 10.
    Arias-Castro, E., Candes, E., Helgason, H., Zeitouni, O.: Searching for a trail of evidence in a maze. Annals of Statistics 36, 1726–1757 (2008)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Donoho, D., Huo, X.: Beamlets and multiscale image analysis, multiscale and multiresolution methods. In: Engelfriet, J. (ed.) Simple Program Schemes and Formal Languages. LNCS, vol. 20, pp. 149–196. Springer, Heidelberg (1974)Google Scholar
  12. 12.
    Nadarajah, S., Kotz, S.: Exact distribution of the max/min of two gaussian random variables. TVLSI930 16, 210–212 (2008)Google Scholar
  13. 13.
    Martin, D., Fowlkes, C., Tal, D., Malik, J.: A database of human segmented natural images and its applications to evaluating segmentation algorithms and measuring ecological statistics. In: ICCV, pp. 416–423 (2001)Google Scholar
  14. 14.
    Van Rijsbergen, C.J.: Information Retrieval, 2nd edn. Dept. of Computer Science. University of Glasgow (1979)Google Scholar
  15. 15.
    Maire, M., Arbelaez, P., Fowlkes, C., Malik, J.: Using contours to detect and localize junctions in natural images. In: CVPR, pp. 1–8 (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Sharon Alpert
    • 1
  • Meirav Galun
    • 1
  • Boaz Nadler
    • 1
  • Ronen Basri
    • 1
  1. 1.Department of Computer Science and Applied MathematicsWeizmann Institute of ScienceRehovotIsrael

Personalised recommendations