10 April 2018 Learning-to-rank approach to RGB-D visual search
Alioscia Petrelli, Luigi Di Stefano
Author Affiliations +
Abstract
Both color and depth information may be deployed to seek by content through RGB-D imagery. Previous works dealing with global descriptors for RGB-D images advocate a decision level merger in which color and depth representations, independently computed, are juxtaposed to pursue a search for similarities. Differently, we propose a “learning-to-rank” paradigm aimed at weighting the two information channels according to the specific traits of the task and data at hand, thereby effortlessly addressing the potential diversity across applications. In particular, we propose a method, referred to as “kNN-rank,” which can learn the regularities among the outputs yielded by similarity-based queries. Another contribution concerns the “HyperRGBD” framework, a set of tools conceived to enable seamless aggregation of existing RGB-D datasets to obtain data featuring desired peculiarities and cardinality.
© 2018 SPIE and IS&T 1017-9909/2018/$25.00 © 2018 SPIE and IS&T
Alioscia Petrelli and Luigi Di Stefano "Learning-to-rank approach to RGB-D visual search," Journal of Electronic Imaging 27(5), 051212 (10 April 2018). https://doi.org/10.1117/1.JEI.27.5.051212
Received: 13 January 2018; Accepted: 15 March 2018; Published: 10 April 2018
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Binary data

Visualization

Databases

Image retrieval

Feature extraction

RGB color model

Computer programming

RELATED CONTENT


Back to Top