Large-Margin Learning of Compact Binary Image Encodings

DOI10.1109/TIP.2014.2337759MaRDI QIDQ4592447zbMATH OpenOpenAlexWikidataFDO

Authors Sakrapee Paisitkriangkrai, Chunhua Shen, Anton van den Hengel

Publication date 20 November 2017

Published in IEEE Transactions on Image Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1402.6383

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Information theory (general) (94A15) Source coding (94A29)

Abstract: The use of high-dimensional features has become a normal practice in many computer vision applications. The large dimension of these features is a limiting factor upon the number of data points which may be effectively stored and processed, however. We address this problem by developing a novel approach to learning a compact binary encoding, which exploits both pair-wise proximity and class-label information on training data set. Exploiting this extra information allows the development of encodings which, although compact, outperform the original high-dimensional features in terms of final classification or retrieval performance. The method is general, in that it is applicable to both non-parametric and parametric learning methods. This generality means that the embedded features are suitable for a wide variety of computer vision tasks, such as image classification and content-based image retrieval. Experimental results demonstrate that the new compact descriptor achieves an accuracy comparable to, and in some cases better than, the visual descriptor in the original space despite being significantly more compact. Moreover, any convex loss function and convex regularization penalty (e.g., $el{l}_p$ norm with $pge1$) can be incorporated into the framework, which provides future flexibility.

Cited in

(4)

• Learning big (image) data via coresets for dictionaries
• Learning compact binary code based on multiple heterogeneous features
• Fried Binary Embedding: From High-Dimensional Visual Features to High-Dimensional Binary Codes
• Learning Short Binary Codes for Large-scale Image Retrieval

This page was built for publication: Large-Margin Learning of Compact Binary Image Encodings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4592447)