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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
P. R. Beaudet. “Rotational invariant image operators” In Proc. of the 4th. International Conference on Pattern Recognition (1978)
J. Coughlan and A. Yuille “A Probabilistic Formulation of A*: O(N) Expected Convergence Rates for Visual Search” Submitted to Artificial Intelligence (1998)
M. de Berg, M. van Kreveld, M. Overmars and O. Schwarkopf “Computational Geometry: Algorithms and Applications” Springer-Verlag. (1997)
R. O. Duda and P. E. Hart “Pattern Classification and Scene Analisys” John Wiley and Sons. (1973)
W. Förstner. “A Framework for Low Level Feature Extraction.” Proc. of the European Conference on Computer Vision (1994)
W. Freeman and E. Adelson. “Junctions Detection and Classification” Proc. of ARVO (1991)
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.
C. G. Harris and M. Stephens. “A combined corner and edge detection” 4th Alvey Vision Conference (1988) pp. 147–151
H. Ishikawa and D. Geiger “Segmentation by Grouping Junctions”. In Proc. of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (1998)
L. Kitchen and A. Rosenfeld. “Gray Level Corner Detection” Pattern Recognition Letters. (1982) vol. 1 n. 2 pp. 95–102
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)
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)
J. Matas and J. Kittler “Contextual Junction Finder” In J.L. Crowley and H. Christensen (Eds) Vision as Process (1995) pp. 133–141
J. Malik “Interpreting Line Drawings of Curved Objects”. International Journal of Computer Vision. (1996) vol. 1 n.1 pp. 73–104.
J. Malik “On Binocularly Viewed Occlusion Junctions”. Proc. of the European Conference of Computer Vision (1996)
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
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
J. Pearl “Heuristics” Addison-Wesley (1984)
J. Rissanen “A Universal Prior for Integers and Estimation by Minimum Description Length” Annals Statistics (1983) vol. 11 pp. 416–431
K. Rohr “Recognizing Corners by Fitting Parametric Models” International Journal of Computer Vision (1992) vol. 9 pp. 213–230
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
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
D. Waltz “Understanding Line Drawings of Scenes with Shadows” The Psychology of Computer Vision. McGraw-Hill. (1972)
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)
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)
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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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