Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Deep Supervised Hashing for Fast Multi-Label Image

View through CrossRef
In this paper, most of the existing Hashing methods is mapping the hand extracted features to binary code, and designing the loss function with the label of images. However, hand-crafted features and inadequacy considering all the loss of the network will reduce the retrieval accuracy. Supervised hashing method improves the similarity between sample and hash code by training data and labels of image. In this paper, we propose a novel deep hashing method which combines the objective function with pairwise label which is produced by the Hamming distance between the label binary vector of images, quantization error and the loss of hashing code between the balanced value as loss function to train network. The experimental results show that the proposed method is more accurate than most of current restoration methods.
Title: Deep Supervised Hashing for Fast Multi-Label Image
Description:
In this paper, most of the existing Hashing methods is mapping the hand extracted features to binary code, and designing the loss function with the label of images.
However, hand-crafted features and inadequacy considering all the loss of the network will reduce the retrieval accuracy.
Supervised hashing method improves the similarity between sample and hash code by training data and labels of image.
In this paper, we propose a novel deep hashing method which combines the objective function with pairwise label which is produced by the Hamming distance between the label binary vector of images, quantization error and the loss of hashing code between the balanced value as loss function to train network.
The experimental results show that the proposed method is more accurate than most of current restoration methods.

Related Results

BMFS: Bidirectional weighted approach for multi-label feature selection algorithm
BMFS: Bidirectional weighted approach for multi-label feature selection algorithm
Abstract Shortcomings of the existing multi-label feature selection algorithms, such as non-considering the correlation of label space, ignoring the possible difference of ...
Proxy-Guided Semi-supervised Hashing for Cross-modal Retrieval
Proxy-Guided Semi-supervised Hashing for Cross-modal Retrieval
Abstract With the exponential growth of multimodal data, cross-modal retrieval has become increasingly important. While supervised deep hashing methods have achieve...
Hubungan Pengetahuan terkait Label Gizi dengan Kebiasaan Membaca Label Gizi pada Siswa SMA Al-Islam
Hubungan Pengetahuan terkait Label Gizi dengan Kebiasaan Membaca Label Gizi pada Siswa SMA Al-Islam
Latar Belakang: Masih sedikit konsumen yang dapat memahami dan menggunakan label gizi sesuai dengan fungsinya. Hal ini dikarenakan masih rendahnya kesadaran masyarakat terkait pent...
Fuze Well Mechanical Interface
Fuze Well Mechanical Interface
<div class="section abstract"> <div class="htmlview paragraph">This interface standard applies to fuzes used in airborne weapons that use a 3-Inch Fuze Well. It defin...
Double Exposure
Double Exposure
I. Happy Endings Chaplin’s Modern Times features one of the most subtly strange endings in Hollywood history. It concludes with the Tramp (Chaplin) and the Gamin (Paulette Godda...
The many faces of a text : applications and enhancements of multi-label text classification algorithms
The many faces of a text : applications and enhancements of multi-label text classification algorithms
Multi-Label Text Classification (MLTC) is a challenging yet vital component of analyzing large text collections. The aim of MLTC is to assign one or multiple labels to a text, whic...
Persons and Their Private Personas: Living with Yourself
Persons and Their Private Personas: Living with Yourself
Public life is usually understood to be whatever we do or say in our formal and professional relationships. At the workplace, at the doctor’s office or at the café, we need to make...

Back to Top