scispace - formally typeset
Open AccessProceedings ArticleDOI

Affinity learning on a tensor product graph with applications to shape and image retrieval

Xingwei Yang, +1 more
- pp 2369-2376
Reads0
Chats0
TLDR
This work proposes to utilize the Tensor product graph (TPG) obtained by the tensor product of the original graph with itself, and is able to achieve the bull's eye retrieval score of 99.99% on MPEG-7 shape dataset, which is much higher than the state-of-the-art algorithms.
Abstract
As observed in several recent publications, improved retrieval performance is achieved when pairwise similarities between the query and the database objects are replaced with more global affinities that also consider the relation among the database objects. This is commonly achieved by propagating the similarity information in a weighted graph representing the database and query objects. Instead of propagating the similarity information on the original graph, we propose to utilize the tensor product graph (TPG) obtained by the tensor product of the original graph with itself. By virtue of this construction, not only local but also long range similarities among graph nodes are explicitly represented as higher order relations, making it possible to better reveal the intrinsic structure of the data manifold. In addition, we improve the local neighborhood structure of the original graph in a preprocessing stage. We illustrate the benefits of the proposed approach on shape and image ranking and retrieval tasks. We are able to achieve the bull's eye retrieval score of 99.99% on MPEG-7 shape dataset, which is much higher than the state-of-the-art algorithms.

read more

Citations
More filters
Journal ArticleDOI

Affinity Learning with Diffusion on Tensor Product Graph

TL;DR: It is proved that a graph diffusion process on TPG is equivalent to a novel iterative algorithm on the original graph, which is guaranteed to converge, and new edge weights that can be interpreted as new, learned affinities are obtained.
Journal ArticleDOI

A Global/Local Affinity Graph for Image Segmentation

TL;DR: A novel sparse global/local affinity graph over superpixels of an input image is proposed to capture both short- and long-range grouping cues, and thereby enabling perceptual grouping laws, including proximity, similarity, continuity, and to enter in action through a suitable graph-cut algorithm.
Journal ArticleDOI

Shape Retrieval Using Hierarchical Total Bregman Soft Clustering

TL;DR: This paper considers the family of total Bregman divergences (tBDs) as an efficient and robust “distance” measure to quantify the dissimilarity between shapes, and proves that for any tBD, there exists a distribution which belongs to the lifted exponential family (lEF) of statistical distributions.
Journal ArticleDOI

Similarity Fusion for Visual Tracking

TL;DR: The approach contributes in two different aspects: multiple features are integrated into a unified similarity to enhance the discriminative ability of similarity measurements, and the neighborhood context of the samples in forthcoming frame are employed to further improve the measurements.
Journal ArticleDOI

Image re-ranking and rank aggregation based on similarity of ranked lists

TL;DR: This paper presents a novel context-based approach for redefining distances and later re-ranking images aiming to improve the effectiveness of CBIR systems, where distances among images are redefined based on the similarity of their ranked lists.
References
More filters
Journal ArticleDOI

Distinctive Image Features from Scale-Invariant Keypoints

TL;DR: This paper presents a method for extracting distinctive invariant features from images that can be used to perform reliable matching between different views of an object or scene and can robustly identify objects among clutter and occlusion while achieving near real-time performance.

Distinctive Image Features from Scale-Invariant Keypoints

TL;DR: The Scale-Invariant Feature Transform (or SIFT) algorithm is a highly robust method to extract and consequently match distinctive invariant features from images that can then be used to reliably match objects in diering images.
Proceedings ArticleDOI

Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories

TL;DR: This paper presents a method for recognizing scene categories based on approximate global geometric correspondence that exceeds the state of the art on the Caltech-101 database and achieves high accuracy on a large database of fifteen natural scene categories.
Proceedings ArticleDOI

Video Google: a text retrieval approach to object matching in videos

TL;DR: An approach to object and scene retrieval which searches for and localizes all the occurrences of a user outlined object in a video, represented by a set of viewpoint invariant region descriptors so that recognition can proceed successfully despite changes in viewpoint, illumination and partial occlusion.
Proceedings Article

Learning with Local and Global Consistency

TL;DR: A principled approach to semi-supervised learning is to design a classifying function which is sufficiently smooth with respect to the intrinsic structure collectively revealed by known labeled and unlabeled points.
Related Papers (5)