A graph-based ranked-list model for unsupervised distance learning on shape retrieval

Overview of the proposed Ranked-List Graph model

Overview of the proposed Ranked-List Graph model

Several re-ranking algorithms have been proposed recently. Some effective approaches are based on complex graph-based diffusion processes, which usually are time consuming and therefore inappro- priate for real-world large scale shape collections.

In this article, the authors present a novel rank-based algorithm for improving the effectiveness of shape retrieval tasks. The algorithm models each ranked list as a graph, establishing similarity connections among all top-k images. Next, a graph fusion approach is employed for obtaining a single graph representing the whole collection and exploiting the relationships encoded in the dataset manifold. Based on the fused graph, a new distance is learned and a new set of ranked lists is computed. The effectiveness of the proposed approach is demonstrated by the performance of an extensive experimental protocol considering widely used shape collections.


Daniel Carlos Guimarães Pedronette, Jurandy Almeida, Ricardo da S. Torres, A graph-based ranked-list model for unsupervised distance learning on shape retrieval, Pattern Recognition Letters, Volume 83, Part 3, 1 November 2016, Pages 357-367, ISSN 0167-8655, http://dx.doi.org/10.1016/j.patrec.2016.05.021.

Advertisements
This entry was posted in blog, publications, science and tagged , , , , , , , . Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s