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. |
Year | DOI | Venue |
---|---|---|
1999 | 10.1007/3-540-48432-9_6 | EMMCVPR |
Keywords | DocType | ISBN |
competitive greedy procedure,bayesian models,grouping junctions,real image,junction grouping,bayesian a,grouping junction,region competition method,kona approach,junction detection method evolves,bayesian method,bayesian model | Conference | 3-540-66294-4 |
Citations | PageRank | References |
4 | 0.44 | 15 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Miguel Cazorla | 1 | 325 | 44.17 |
Francisco Escolano | 2 | 532 | 46.61 |
Domingo Gallardo | 3 | 25 | 3.92 |
R. Rizo | 4 | 51 | 14.90 |