Abstract | ||
---|---|---|
Vanishing points (VPs) are crucial for inferring the three-dimensional structure of a scene and can be exploited in various computer vision applications. Previous VP detection algorithms have been proven effective but generally cannot guarantee a strong performance in both accuracy and computational time. We propose an artificial bee colony algorithm called dynamic clustering artificial bee colony (DCABC) that accurately and efficiently detects VPs in the image plane. The task is regarded as a dynamic line-clustering problem, and the line clusters are initialized by their orientation information. Inspired by the foraging behavior of bees, DCABC selects the clustering center and reclassifies the line segments based on a distance criterion until the terminating condition is met. The optimal line clusters determine the estimated VP. The dissimilarity among solutions is measured by the Hamming distance between two binary vectors, which simplifies the new solution construction. The performances of the proposed and existing algorithms are evaluated on the York Urban database. The results verify the efficiency and accuracy of our proposed algorithm. (C) The Authors. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1117/1.JEI.24.3.033024 | JOURNAL OF ELECTRONIC IMAGING |
Keywords | Field | DocType |
vanishing point estimation,visual measurement,dynamic clustering artificial bee colony,dynamic clustering | Line segment,Artificial bee colony algorithm,Dynamic clustering,Pattern recognition,Computer science,Image plane,Hamming distance,Artificial intelligence,Cluster analysis,Vanishing point,Binary number | Journal |
Volume | Issue | ISSN |
24 | 3 | 1017-9909 |
Citations | PageRank | References |
0 | 0.34 | 12 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Lei Han | 1 | 0 | 0.34 |
Tanghuai Fan | 2 | 13 | 9.73 |
Shengnan Zheng | 3 | 0 | 0.34 |
Chenrong Huang | 4 | 3 | 1.41 |