Skip to main content

Bayesian Models for Finding and Grouping Junctions

  • Conference paper
  • First Online:
Energy Minimization Methods in Computer Vision and Pattern Recognition (EMMCVPR 1999)

Part of the book series: Lecture Notes in Computer Science ((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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. R. Beaudet. “Rotational invariant image operators” In Proc. of the 4th. International Conference on Pattern Recognition (1978)

    Google Scholar 

  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. M. de Berg, M. van Kreveld, M. Overmars and O. Schwarkopf “Computational Geometry: Algorithms and Applications” Springer-Verlag. (1997)

    Google Scholar 

  4. R. O. Duda and P. E. Hart “Pattern Classification and Scene Analisys” John Wiley and Sons. (1973)

    Google Scholar 

  5. W. Förstner. “A Framework for Low Level Feature Extraction.” Proc. of the European Conference on Computer Vision (1994)

    Google Scholar 

  6. W. Freeman and E. Adelson. “Junctions Detection and Classification” Proc. of ARVO (1991)

    Google Scholar 

  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.

    Article  Google Scholar 

  8. C. G. Harris and M. Stephens. “A combined corner and edge detection” 4th Alvey Vision Conference (1988) pp. 147–151

    Google Scholar 

  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. L. Kitchen and A. Rosenfeld. “Gray Level Corner Detection” Pattern Recognition Letters. (1982) vol. 1 n. 2 pp. 95–102

    Article  Google Scholar 

  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. 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. J. Matas and J. Kittler “Contextual Junction Finder” In J.L. Crowley and H. Christensen (Eds) Vision as Process (1995) pp. 133–141

    Google Scholar 

  14. J. Malik “Interpreting Line Drawings of Curved Objects”. International Journal of Computer Vision. (1996) vol. 1 n.1 pp. 73–104.

    Article  Google Scholar 

  15. J. Malik “On Binocularly Viewed Occlusion Junctions”. Proc. of the European Conference of Computer Vision (1996)

    Google Scholar 

  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–162

    Article  Google Scholar 

  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. 7

    Google Scholar 

  18. J. Pearl “Heuristics” Addison-Wesley (1984)

    Google Scholar 

  19. J. Rissanen “A Universal Prior for Integers and Estimation by Minimum Description Length” Annals Statistics (1983) vol. 11 pp. 416–431

    Article  MATH  MathSciNet  Google Scholar 

  20. K. Rohr “Recognizing Corners by Fitting Parametric Models” International Journal of Computer Vision (1992) vol. 9 pp. 213–230

    Article  Google Scholar 

  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–78

    Article  Google Scholar 

  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–114

    Google Scholar 

  23. D. Waltz “Understanding Line Drawings of Scenes with Shadows” The Psychology of Computer Vision. McGraw-Hill. (1972)

    Google Scholar 

  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. 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. 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–900

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cazorla, M.A., Escolano, F., Gallardo, D., Rizo, R. (1999). Bayesian Models for Finding and Grouping Junctions. In: Hancock, E.R., Pelillo, M. (eds) Energy Minimization Methods in Computer Vision and Pattern Recognition. EMMCVPR 1999. Lecture Notes in Computer Science, vol 1654. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48432-9_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-48432-9_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66294-5

  • Online ISBN: 978-3-540-48432-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics