Bayesian Models for Finding and Grouping Junctions

  • M. A. Cazorla
  • F. Escolano
  • D. Gallardo
  • R. Rizo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1654)

Abstract

In this paper, we propose two Bayesian methods for detecting and grouping junctions. Our junction detection method evolves from the Kona approach, and it is based on a competitive greedy procedure inspired in the region competition method. Then, junction grouping is accomplished by finding connecting paths between pairs of junctions. Path searching is performed by applying a Bayesian A* algorithm that has been recently proposed. Both methods are efficient and robust, and they are tested with synthetic and real images.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    P. R. Beaudet. “Rotational invariant image operators” In Proc. of the 4th. International Conference on Pattern Recognition (1978)Google Scholar
  2. 2.
    J. Coughlan and A. Yuille “A Probabilistic Formulation of A*: O(N) Expected Convergence Rates for Visual Search” Submitted to Artificial Intelligence (1998)Google Scholar
  3. 3.
    M. de Berg, M. van Kreveld, M. Overmars and O. Schwarkopf “Computational Geometry: Algorithms and Applications” Springer-Verlag. (1997)Google Scholar
  4. 4.
    R. O. Duda and P. E. Hart “Pattern Classification and Scene Analisys” John Wiley and Sons. (1973)Google Scholar
  5. 5.
    W. Förstner. “A Framework for Low Level Feature Extraction.” Proc. of the European Conference on Computer Vision (1994)Google Scholar
  6. 6.
    W. Freeman and E. Adelson. “Junctions Detection and Classification” Proc. of ARVO (1991)Google Scholar
  7. 7.
    D. Geman and B. Jedynak “An Active Testing Model for Tracking Roads in Satellite Images.” IEEE Transaction on Pattern Analysis and Machine Intelligence.( 1996) vol. 18 n. 1 pp. 1–14.CrossRefGoogle Scholar
  8. 8.
    C. G. Harris and M. Stephens. “A combined corner and edge detection” 4th Alvey Vision Conference (1988) pp. 147–151Google Scholar
  9. 9.
    H. Ishikawa and D. Geiger “Segmentation by Grouping Junctions”. In Proc. of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (1998)Google Scholar
  10. 10.
    L. Kitchen and A. Rosenfeld. “Gray Level Corner Detection” Pattern Recognition Letters. (1982) vol. 1 n. 2 pp. 95–102CrossRefGoogle Scholar
  11. 11.
    T. Lindeberg and M-X. Li “Segmentation and Classification of Edges Using Minimum Description Length Aproximation and Complementary Cues”. Technical Report ISRN KTH/NA/P-96/01-SE, Royal Institute of Technology. Jan.(1996)Google Scholar
  12. 12.
    T-L Liu and D. Geiger “Visual Deconstruction: Recognizing Articulated Objects”. Proc. International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition. Eds. M. Pelillo and E. Hancock. Venice, Italy. Springer-Verlag. May (1997)Google Scholar
  13. 13.
    J. Matas and J. Kittler “Contextual Junction Finder” In J.L. Crowley and H. Christensen (Eds) Vision as Process (1995) pp. 133–141Google Scholar
  14. 14.
    J. Malik “Interpreting Line Drawings of Curved Objects”. International Journal of Computer Vision. (1996) vol. 1 n.1 pp. 73–104.CrossRefGoogle Scholar
  15. 15.
    J. Malik “On Binocularly Viewed Occlusion Junctions”. Proc. of the European Conference of Computer Vision (1996)Google Scholar
  16. 16.
    K. Brunnström, J-0. Eklundh and T. Uhlin “Active Fixation and Scene Exploration”. International Journal of Computer Vision.(1996) vol. 17 n. 2 pp. 137–162CrossRefGoogle Scholar
  17. 17.
    L. Parida, D. Geiger, and R. Hummel “Junctions: Detection, Classification, and Reconstruction” IEEE Transaction on Pattern Analysis and Machine Intelligence.( 1998) vol. 20 n. 7Google Scholar
  18. 18.
    J. Pearl “Heuristics” Addison-Wesley (1984)Google Scholar
  19. 19.
    J. Rissanen “A Universal Prior for Integers and Estimation by Minimum Description Length” Annals Statistics (1983) vol. 11 pp. 416–431MATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    K. Rohr “Recognizing Corners by Fitting Parametric Models” International Journal of Computer Vision (1992) vol. 9 pp. 213–230CrossRefGoogle Scholar
  21. 21.
    S. M. Smith and J. M. Brady “SUSAN= A New Approach to Low Level Image Processing” Int. J. Comp. Vision (1997) vol. 23 n. 1 pp. 45–78CrossRefGoogle Scholar
  22. 22.
    B. Vasselle, G. Giraudon, and M. Berthod “Following Corners on Curves and Surfaces in the Scale Space” In Proc. of the European Conference on Computer Vision 94 (1994) vol. 800 pp. 109–114Google Scholar
  23. 23.
    D. Waltz “Understanding Line Drawings of Scenes with Shadows” The Psychology of Computer Vision. McGraw-Hill. (1972)Google Scholar
  24. 24.
    A. Yuille and J. Coughlan “Twenty Questions, Focus of Attention and A?: A Theoretical Comparison of Optimization Strategies”. Proc. International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition. Eds. M. Pelillo and E. Hancock. Venice, Italy. Springer-Verlag. May (1997)Google Scholar
  25. 25.
    A. Yuille and J. Coughlan “Visual Search: Fundamental Bounds, Order Parameters, and Phase Transitions” Submitted to IEEE Transactions on Pattern Analysis and Machine Intelligence (1998)Google Scholar
  26. 26.
    S. C. Zhu and A. Yuille “Region Competition = Unifying Snakes, Region Growing, and Bayes/MDL for Multiband Image Segmentation” IEEE Transactions on Pattern Analysis and Machine Intelligence (1996) vol. 18 n. 9 pp. 884–900CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • M. A. Cazorla
    • 1
  • F. Escolano
    • 1
  • D. Gallardo
    • 1
  • R. Rizo
    • 1
  1. 1.Grupo Vgia: Visión, Gráficos e Inteligencia Artificial Departamento de Ciencia de la Computación e Inteligencia ArtificialUniversidad de AlicanteSan VicenteSpain

Personalised recommendations