Fast Feature-Oriented Visual Connection for Large Image Collections
| dc.contributor.author | Yan, Qingan | en_US |
| dc.contributor.author | Xu, Zhan | en_US |
| dc.contributor.author | Xiao, Chunxia | en_US |
| dc.contributor.editor | J. Keyser, Y. J. Kim, and P. Wonka | en_US |
| dc.date.accessioned | 2015-03-03T12:54:14Z | |
| dc.date.available | 2015-03-03T12:54:14Z | |
| dc.date.issued | 2014 | en_US |
| dc.description.abstract | Deriving the visual connectivity across large image collections is a computationally expensive task. Different from current image-oriented match graph construction methods which build on pairwise image matching, we present a novel and scalable feature-oriented image matching algorithm for large collections. Our method improves the match graph construction procedure in three ways. First, instead of building trees repeatedly, we put the feature points of the input image collection into a single kd-tree and select the leaves as our anchor points. Then we construct an anchor graph from which each feature can intelligently find a small portion of related candidates to match. Finally, we design a new form of adjacency matrix for fast feature similarity measuring, and return all the matches in different photos across the whole dataset directly. Experiments show that our feature-oriented correspondence algorithm can explore visual connectivity between images with significant improvement in speed. | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.identifier.doi | 10.1111/cgf.12502 | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/cgf.12502 | en_US |
| dc.publisher | The Eurographics Association and John Wiley and Sons Ltd. | en_US |
| dc.title | Fast Feature-Oriented Visual Connection for Large Image Collections | en_US |