Name
Abstract | ||
|---|---|---|
For a variety of visual search and visual key points based navigation applications, compression of visual key point features like SIFT is an important part of the overall system that can directly affect the efficiency and latency. In this work, we examine a new approach in visual key points compression, that utilizes subspaces that optimized for preserving key point feature matching properties than the reconstruction performance, and allows for a set of optimal subspaces on Grassmann manifold that can better adapt to the local manifold geometry. The simulation demonstrates that such scheme has very low overhead in signaling subspaces, and has very much improved performance on the repeatability of the keypoint matching subject to bit rate constraints. |
Year | Venue | Keywords |
|---|---|---|
2017 | 2017 24TH IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP) | Visual query, LPP, Compression, Visual identification, Grassmann manifold |
Field | DocType | ISSN |
Computer vision,Scale-invariant feature transform,Visual search,Locality,Visualization,Computer science,Search engine indexing,Binary tree,Artificial intelligence,Grassmannian,Manifold | Conference | 1522-4880 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhaobin Zhang | 1 | 3 | 2.80 |
| Li Li | 2 | 8 | 3.03 |
| Zhu Li | 3 | 25 | 9.14 |
| Houqiang Li | 4 | 2090 | 172.30 |