Improving graph matching via density maximization
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)
|Collections||ANU Research Publications|
|Source:||Proceedings of the IEEE International Conference on Computer Vision|
|01_Wang_Improving_graph_matching_via_2013.pdf||1.49 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.