Inequivalent manifold ranking for content-based image retrieval
Lists
Only you see this
Abstract
We propose to improve the effectiveness and scalability of graph based manifold ranking methods in image retrieval applications by emphasizing reliable images while damping the effect of noisy or irregular ones. Label information is firstly passed between most reliable data points, then propagated to less reliable ones on manifold structure. By treating these images inequivalently, undesirable effect of noisy samples is greatly reduced, thus effectiveness of manifold ranking algorithms is enhanced. Also, graph size in terms of number of nodes and edges is dramatically reduced, resulting in a great speed-up of the algorithm. Our experiment on real world image data set demonstrates the effectiveness of the proposed approach.
BibTeX
@inproceedings{wang2008inequivalent,
author = {Fan Wang and Guihua Er and Qionghai Dai},
title = {{Inequivalent manifold ranking for content-based image retrieval}},
booktitle = {ICIP},
year = {2008},
url = {https://openreview.net/forum?id=-Yyr5_HLyjw},
}Loading related content...