Advertisement

Graph Theoretical Measures for Land Development

  • Cem Ünsalan
  • Kim L. Boyer
Part of the Advances in Computer Vision and Pattern Recognition book series (ACVPR)

Abstract

In the previous chapters, we concentrated on land use classification. This chapter extends this problem and casts it as measuring organization on land. Therefore, we introduce graph theoretical measures over panchromatic images here. We extract primitives from the image, calculate measures on these primitives, and fuse these measures to determine the final region type. Our primitives are lines extracted by line support regions; see Chap.  6). We represent each straight line segment as a vertex in a graph and define a neighborhood tolerance to construct edges between these vertices. We then compute measures on these graphs to infer the type of region. These measures generally increase with respect to the degree of organization in the image. To form these measures, we first consider unweighted graphs and use the circuit rank and degree (valency) sequence. Then, we consider weighted graphs and introduce measures based on graph partitioning and the graph spectrum. For our purposes, the level of development (or, roughly, the degree of organization) is based on the type and density of construction (buildings, streets, etc.) and its geometric regularity. Our measures are defined to infer this indirectly from the organization of lines in the image. We consider rural areas without buildings to be the least developed, proceeding through sparse residential, dense residential, commercial, industrial, to urban centers. We concede that the concept of “degree of organization” is not mathematically precise. This chapter represents a step toward quantifying this notion.

Keywords

False Alarm Random Graph Weighted Graph Straight Line Segment Laplacian Matrix 
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.

References

  1. 1.
    C. Ünsalan, K.L. Boyer, IEEE Trans. Pattern Anal. Mach. Intell.47(4), 575 (2005) CrossRefGoogle Scholar
  2. 2.
    S. Sarkar, K.L. Boyer, Comput. Vis. Image Underst.71, 110 (1998) CrossRefGoogle Scholar
  3. 3.
    C. Berge,The Theory of Graphs (Dover, New York, 2001) MATHGoogle Scholar
  4. 4.
    B. Bollobas,Random Graphs, 2nd edn. (Cambridge University Press, Cambridge, 2001) MATHCrossRefGoogle Scholar
  5. 5.
    L.S. Shapiro, J.M. Brady, Image Vis. Comput.10, 283 (1992) CrossRefGoogle Scholar
  6. 6.
    J. Shi, J. Malik, IEEE Trans. Pattern Anal. Mach. Intell.22(8), 888 (2000) CrossRefGoogle Scholar
  7. 7.
    B. Mohar, inProceedings of the Sixth Quadrennial Conference on the Theory and Applications of Graphs, vol. 2, 1998, pp. 871–898 Google Scholar
  8. 8.
    M. Fiedler, Czecholoslovak Math. J.98, 298 (1973) MathSciNetGoogle Scholar
  9. 9.
    M. Fiedler, Czecholoslovak Math. J.100, 619 (1975) MathSciNetGoogle Scholar
  10. 10.
    M. Fiedler, inCombinatorics and Graph Theory, vol. 25 (1989), pp. 57–70 Google Scholar
  11. 11.
    P. Perona, W. Freeman, inProceedings of the ECCV98 (1998), pp. 655–670 Google Scholar
  12. 12.
    Y. Weiss, inProceedings of the ICCV99 (1999), pp. 975–982 Google Scholar
  13. 13.
    Y. Gdalyahu, D. Weinshall, M. Werman, IEEE Trans. Pattern Anal. Mach. Intell.23(10), 1053 (2001) CrossRefGoogle Scholar
  14. 14.
    M. Pavan, M. Pelillo, inProceedings of CVPR03 (2003), pp. 145–152 Google Scholar
  15. 15.
    R.A. Horn, C.R. Johnson,Matrix Analysis (Cambridge University Press, Cambridge, 1985) MATHCrossRefGoogle Scholar
  16. 16.
    E.P. Wigner, Ann. Math.62, 548 (1955) MathSciNetMATHCrossRefGoogle Scholar
  17. 17.
    E.P. Wigner, Ann. Math.65, 203 (1957) MathSciNetMATHCrossRefGoogle Scholar
  18. 18.
    E.P. Wigner, Ann. Math.67, 325 (1958) MathSciNetMATHCrossRefGoogle Scholar
  19. 19.
    L. Arnold, J. Math. Anal. Appl.20, 262 (1967) MathSciNetMATHCrossRefGoogle Scholar
  20. 20.
    L. Arnold, Linear Algebra Appl.13, 185 (1976) MATHCrossRefGoogle Scholar
  21. 21.
    J. Shen, Linear Algebra Appl.326, 1 (2001) MathSciNetMATHCrossRefGoogle Scholar
  22. 22.
    I.J. Farkas, I. Derenyi, A.L. Barabasi, T. Vicsek, Phys. Rev. E64, 1 (2001) CrossRefGoogle Scholar
  23. 23.
    D.J. Watts, S.H. Strogatz, Nature393, 440 (1998) CrossRefGoogle Scholar
  24. 24.
    D.J. Watts,Small Worlds, The Dynamics of Networks Between Order and Randomness (Princeton University Press, New Jersey, 1999) Google Scholar
  25. 25.
    I. Gutman, O.E. Polansky,Mathematical Concepts in Organic Chemistry (Springer, Berlin, 1986) MATHCrossRefGoogle Scholar
  26. 26.
    D. Cvetkovic, M. Doob, I. Gutman, A. Torgasev,Recent Results in the Theory of Graph Spectra (Elsevier, New York, 1988) MATHGoogle Scholar
  27. 27.
    G. Strang,Linear Algebra and Its Applications, 3rd edn. (Harcourt College Publishers, Florida, USA, 1986) Google Scholar

Copyright information

© Springer-Verlag London Limited 2011

Authors and Affiliations

  1. 1.Electrical and Electronics EngineeringYeditepe UniversityKayisdagiTurkey
  2. 2.Dept. Electrical, Comp. & Systems Eng.Rensselaer Polytechnic InstituteTroyUSA

Personalised recommendations