scispace - formally typeset
Journal ArticleDOI

Feature Combination in Kernel Space for Distance Based Image Hashing

Reads0
Chats0
TLDR
The scheme presents the extension of distance based hashing to kernel space for generating the indexing structure based on similarity in kernel space using the concept of multiple kernel learning to incorporate multiple features for defining the image indexing space.
Abstract
The paper presents a novel feature based indexing scheme for image collections. The scheme presents the extension of distance based hashing to kernel space for generating the indexing structure based on similarity in kernel space. The objective of the scheme is to incorporate multiple features for defining the image indexing space using the concept of multiple kernel learning. However, the indexing problems are defined with unique learning objective; therefore, a novel application of genetic algorithm is presented for the optimization task. The extensive evaluation of the proposed concept is performed for developing word based document indexing application of Devanagari, Bengali, and English scripts. In addition, the efficacy of the proposed concept is shown by experimental evaluations on handwritten digits and natural image collection.

read more

Citations
More filters
Journal ArticleDOI

Robust Image Hashing With Ring Partition and Invariant Vector Distance

TL;DR: This work incorporates ring partition and invariant vector distance to image hashing algorithm for enhancing rotation robustness and discriminative capability, and demonstrates that the proposed hashing algorithm is robust at commonly used digital operations to images.
Journal ArticleDOI

Robust Perceptual Image Hashing Based on Ring Partition and NMF

TL;DR: An efficient image hashing with a ring partition and a nonnegative matrix factorization (NMF) is designed, which has both the rotation robustness and good discriminative capability.
Journal ArticleDOI

Multiple feature kernel hashing for large-scale visual search

TL;DR: Experimental results show that the proposed multiple feature kernel hashing framework can achieve superior accuracy and efficiency over state-of-the-art methods, and alternating optimization ways efficiently learn hashing functions and the kernel space.
Journal ArticleDOI

Robust image hashing using ring partition-PGNMF and local features

TL;DR: The combination of global and local features is robust against the content-preserving operations, which has a desirable discriminative capability and is capable of localizing the counterfeit area.
Journal ArticleDOI

Scalable histopathological image analysis via supervised hashing with multiple features.

TL;DR: This work exploits joint kernel-based supervised hashing (JKSH) to integrate complementary features in a hashing framework to bridge the semantic gap between low-level features and high-level diagnosis in histopathological image analysis methods.
References
More filters
Book

Genetic algorithms in search, optimization, and machine learning

TL;DR: In this article, the authors present the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields, including computer programming and mathematics.
Journal ArticleDOI

Gradient-based learning applied to document recognition

TL;DR: In this article, a graph transformer network (GTN) is proposed for handwritten character recognition, which can be used to synthesize a complex decision surface that can classify high-dimensional patterns, such as handwritten characters.
Proceedings Article

A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise

TL;DR: In this paper, a density-based notion of clusters is proposed to discover clusters of arbitrary shape, which can be used for class identification in large spatial databases and is shown to be more efficient than the well-known algorithm CLAR-ANS.
Proceedings Article

A density-based algorithm for discovering clusters in large spatial Databases with Noise

TL;DR: DBSCAN, a new clustering algorithm relying on a density-based notion of clusters which is designed to discover clusters of arbitrary shape, is presented which requires only one input parameter and supports the user in determining an appropriate value for it.
Related Papers (5)