Normalized Cut Based Edge Detection

  • Mario Barrientos
  • Humberto Madrid
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6718)


This work introduces a new technique for edge detection based on a graph theory tool known as normalized cut. The problem involves to find certain eigenvector of a matrix called normalized laplacian, which is constructed in such way that it represents the relation of color and distance between the image’s pixels. The matrix dimensions and the fact that it is dense represents a trouble for the common eigensolvers. The power method seemed a good option to tackle this problem. The first results were not very impressive, but a modification of the function that relates the image pixels lead us to a more convenient laplacian structure and to a segmentation result known as edge detection. A deeper analysis showed that this procedure does not even need of the power method, because the eigenvector that defines the segmentation can be obtained with a closed form.


Edge detection normalized cut power method image segmentation 


  1. 1.
    Wu, Z., Leahy, R.: An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 15(11) (1993)Google Scholar
  2. 2.
    Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22(8) (2000)Google Scholar
  3. 3.
    Avalos, V.: Segmentación de imágenes usando técnicas espectrales de grafos (2007)Google Scholar
  4. 4.
    Golub, G., Van-Loan, C.: Matrix Computations, 3rd edn. John Hopkins Press, Baltimore (1996)Google Scholar
  5. 5.
    Pothen, A., Simon, H.D., Liou, K.P.: Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal on Matrix Analysis and Applications 11(3), 430–450 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Langville, A.N., Meyer, C.D.: Google’s PageRank and Beyond: The Science of Search Engine Rankings, pp. 40–41. Princeton University Press, Princeton (2006)Google Scholar
  7. 7.
    Chung, F.: Spectral Graph Theory. Number 92 in CBMS Regional Conference Series in Mathematics. American Mathematical Society, Providence (1997)Google Scholar
  8. 8.
    Madrid, H., Barrientos, M.: Detección de bordes basada en corte normalizado. In: Latin American Conference on Networked and Electronic Media (2010)Google Scholar
  9. 9.
    Arce, G.R.: Nonlinear signal processing: a statistical approach. Wiley, Chichester (2005)zbMATHGoogle Scholar
  10. 10.
    Lindeberg, T.: Edge detection and ridge detection with automatic scale selection. International Journal of Computer Vision 30(2), 117–154 (1996)CrossRefGoogle Scholar
  11. 11.
    MathWorks: Morphological operations on binary images (2011)Google Scholar
  12. 12.
    Martin, D., Fowlkes, C., Tal, D., Malik, J.: A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: Proc. 8th Int’l Conf. Computer Vision, vol. 2, pp. 416–423 (2001)Google Scholar
  13. 13.
    Dollar, P., Tu, Z., Belongie, S.: Supervised learning of edges and object boundaries. In: IEEE Computer Vision and Pattern Recognition, CVPR 2006 (2006)Google Scholar
  14. 14.
    Arbeláez, P.: Boundary extraction in natural images using ultrametric contour maps. Technical report, Université Paris Dauphin (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Mario Barrientos
    • 1
  • Humberto Madrid
    • 1
  1. 1.Applied Mathematics Research CenterAutonomous University of CoahuilaSaltilloMexico

Personalised recommendations