Bayesian Models for Finding and Grouping Junctions

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.

• Type: Conference
• Year: 1999
• Where: EMMCVPR
• Authors: Miguel Cazorla, Francisco Escolano, Domingo Gallardo, Ramón Rizo
• Keywords: Bayesian Methods, Competitive Greedy Procedure, Computer Vision, EMMCVPR 1999, Junction Detection Method