Graph matching with geometric constraints for near-duplicated image retrieval


In recent years, graph matching has attracted much attention to solve computer vision problems, such as image re-ranking and object recognition. However, graph matching algorithms, e.g., reweighted random walks, cannot be properly applied for near-duplicated image retrieval (NDIR) due to the ignorance of duplicated patches in images. Therefore, this paper… (More)
DOI: 10.1145/2499788.2499847


6 Figures and Tables

Slides referencing similar topics