Improving graph matching via density maximization
Abstract
Graph matching has been widely used in various applications in computer vision due to its powerful performance. However, it poses three challenges to image sparse feature matching: (1) The combinatorial nature limits the size of the possible matches, (2)
Description
Keywords
Citation
Collections
Source
Proceedings of the IEEE International Conference on Computer Vision
Type
Book Title
Entity type
Access Statement
License Rights
Restricted until
2037-12-31
Downloads
File
Description