Bilinear Supervised Hashing Based on 2D Image Features
Hashing has been recognized as an efficient representation learning method to effectively handle big data due to its low computational complexity and memory cost. Most of the existing hashing methods focus on learning the low-dimensional vectorized binary features based on the high-dimensional raw v...
Gespeichert in:
Veröffentlicht in: | arXiv.org 2019-01 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Ding, Yujuan Wong, Wai Kueng Lai, Zhihui Zhang, Zheng |
description | Hashing has been recognized as an efficient representation learning method to effectively handle big data due to its low computational complexity and memory cost. Most of the existing hashing methods focus on learning the low-dimensional vectorized binary features based on the high-dimensional raw vectorized features. However, studies on how to obtain preferable binary codes from the original 2D image features for retrieval is very limited. This paper proposes a bilinear supervised discrete hashing (BSDH) method based on 2D image features which utilizes bilinear projections to binarize the image matrix features such that the intrinsic characteristics in the 2D image space are preserved in the learned binary codes. Meanwhile, the bilinear projection approximation and vectorization binary codes regression are seamlessly integrated together to formulate the final robust learning framework. Furthermore, a discrete optimization strategy is developed to alternatively update each variable for obtaining the high-quality binary codes. In addition, two 2D image features, traditional SURF-based FVLAD feature and CNN-based AlexConv5 feature are designed for further improving the performance of the proposed BSDH method. Results of extensive experiments conducted on four benchmark datasets show that the proposed BSDH method almost outperforms all competing hashing methods with different input features by different evaluation protocols. |
format | Article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2164929733</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2164929733</sourcerecordid><originalsourceid>FETCH-proquest_journals_21649297333</originalsourceid><addsrcrecordid>eNqNisEKgkAUAJcgSMp_WOgs6Ftd82oldq67POhlK7Zr-9y-v4I-oNMwzCxEBEplyS4HWImYeUjTFHQJRaEioWszGkvo5TlM5F-G6Spb5Luxvazxa85KOMjTA3uSDeEcPPFGLG84MsU_rsW2OV72bTJ59wzEcze44O0ndZDpvIKqVEr9d70BX840XQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2164929733</pqid></control><display><type>article</type><title>Bilinear Supervised Hashing Based on 2D Image Features</title><source>Free E- Journals</source><creator>Ding, Yujuan ; Wong, Wai Kueng ; Lai, Zhihui ; Zhang, Zheng</creator><creatorcontrib>Ding, Yujuan ; Wong, Wai Kueng ; Lai, Zhihui ; Zhang, Zheng</creatorcontrib><description>Hashing has been recognized as an efficient representation learning method to effectively handle big data due to its low computational complexity and memory cost. Most of the existing hashing methods focus on learning the low-dimensional vectorized binary features based on the high-dimensional raw vectorized features. However, studies on how to obtain preferable binary codes from the original 2D image features for retrieval is very limited. This paper proposes a bilinear supervised discrete hashing (BSDH) method based on 2D image features which utilizes bilinear projections to binarize the image matrix features such that the intrinsic characteristics in the 2D image space are preserved in the learned binary codes. Meanwhile, the bilinear projection approximation and vectorization binary codes regression are seamlessly integrated together to formulate the final robust learning framework. Furthermore, a discrete optimization strategy is developed to alternatively update each variable for obtaining the high-quality binary codes. In addition, two 2D image features, traditional SURF-based FVLAD feature and CNN-based AlexConv5 feature are designed for further improving the performance of the proposed BSDH method. Results of extensive experiments conducted on four benchmark datasets show that the proposed BSDH method almost outperforms all competing hashing methods with different input features by different evaluation protocols.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Binary codes ; Binary system ; Codes ; Computer memory ; Data management ; Feature recognition ; Learning ; Object recognition ; Robustness (mathematics) ; Vector processing (computers)</subject><ispartof>arXiv.org, 2019-01</ispartof><rights>2019. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>776,780</link.rule.ids></links><search><creatorcontrib>Ding, Yujuan</creatorcontrib><creatorcontrib>Wong, Wai Kueng</creatorcontrib><creatorcontrib>Lai, Zhihui</creatorcontrib><creatorcontrib>Zhang, Zheng</creatorcontrib><title>Bilinear Supervised Hashing Based on 2D Image Features</title><title>arXiv.org</title><description>Hashing has been recognized as an efficient representation learning method to effectively handle big data due to its low computational complexity and memory cost. Most of the existing hashing methods focus on learning the low-dimensional vectorized binary features based on the high-dimensional raw vectorized features. However, studies on how to obtain preferable binary codes from the original 2D image features for retrieval is very limited. This paper proposes a bilinear supervised discrete hashing (BSDH) method based on 2D image features which utilizes bilinear projections to binarize the image matrix features such that the intrinsic characteristics in the 2D image space are preserved in the learned binary codes. Meanwhile, the bilinear projection approximation and vectorization binary codes regression are seamlessly integrated together to formulate the final robust learning framework. Furthermore, a discrete optimization strategy is developed to alternatively update each variable for obtaining the high-quality binary codes. In addition, two 2D image features, traditional SURF-based FVLAD feature and CNN-based AlexConv5 feature are designed for further improving the performance of the proposed BSDH method. Results of extensive experiments conducted on four benchmark datasets show that the proposed BSDH method almost outperforms all competing hashing methods with different input features by different evaluation protocols.</description><subject>Binary codes</subject><subject>Binary system</subject><subject>Codes</subject><subject>Computer memory</subject><subject>Data management</subject><subject>Feature recognition</subject><subject>Learning</subject><subject>Object recognition</subject><subject>Robustness (mathematics)</subject><subject>Vector processing (computers)</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNqNisEKgkAUAJcgSMp_WOgs6Ftd82oldq67POhlK7Zr-9y-v4I-oNMwzCxEBEplyS4HWImYeUjTFHQJRaEioWszGkvo5TlM5F-G6Spb5Luxvazxa85KOMjTA3uSDeEcPPFGLG84MsU_rsW2OV72bTJ59wzEcze44O0ndZDpvIKqVEr9d70BX840XQ</recordid><startdate>20190105</startdate><enddate>20190105</enddate><creator>Ding, Yujuan</creator><creator>Wong, Wai Kueng</creator><creator>Lai, Zhihui</creator><creator>Zhang, Zheng</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20190105</creationdate><title>Bilinear Supervised Hashing Based on 2D Image Features</title><author>Ding, Yujuan ; Wong, Wai Kueng ; Lai, Zhihui ; Zhang, Zheng</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_21649297333</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Binary codes</topic><topic>Binary system</topic><topic>Codes</topic><topic>Computer memory</topic><topic>Data management</topic><topic>Feature recognition</topic><topic>Learning</topic><topic>Object recognition</topic><topic>Robustness (mathematics)</topic><topic>Vector processing (computers)</topic><toplevel>online_resources</toplevel><creatorcontrib>Ding, Yujuan</creatorcontrib><creatorcontrib>Wong, Wai Kueng</creatorcontrib><creatorcontrib>Lai, Zhihui</creatorcontrib><creatorcontrib>Zhang, Zheng</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ding, Yujuan</au><au>Wong, Wai Kueng</au><au>Lai, Zhihui</au><au>Zhang, Zheng</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Bilinear Supervised Hashing Based on 2D Image Features</atitle><jtitle>arXiv.org</jtitle><date>2019-01-05</date><risdate>2019</risdate><eissn>2331-8422</eissn><abstract>Hashing has been recognized as an efficient representation learning method to effectively handle big data due to its low computational complexity and memory cost. Most of the existing hashing methods focus on learning the low-dimensional vectorized binary features based on the high-dimensional raw vectorized features. However, studies on how to obtain preferable binary codes from the original 2D image features for retrieval is very limited. This paper proposes a bilinear supervised discrete hashing (BSDH) method based on 2D image features which utilizes bilinear projections to binarize the image matrix features such that the intrinsic characteristics in the 2D image space are preserved in the learned binary codes. Meanwhile, the bilinear projection approximation and vectorization binary codes regression are seamlessly integrated together to formulate the final robust learning framework. Furthermore, a discrete optimization strategy is developed to alternatively update each variable for obtaining the high-quality binary codes. In addition, two 2D image features, traditional SURF-based FVLAD feature and CNN-based AlexConv5 feature are designed for further improving the performance of the proposed BSDH method. Results of extensive experiments conducted on four benchmark datasets show that the proposed BSDH method almost outperforms all competing hashing methods with different input features by different evaluation protocols.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2019-01 |
issn | 2331-8422 |
language | eng |
recordid | cdi_proquest_journals_2164929733 |
source | Free E- Journals |
subjects | Binary codes Binary system Codes Computer memory Data management Feature recognition Learning Object recognition Robustness (mathematics) Vector processing (computers) |
title | Bilinear Supervised Hashing Based on 2D Image Features |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T00%3A41%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Bilinear%20Supervised%20Hashing%20Based%20on%202D%20Image%20Features&rft.jtitle=arXiv.org&rft.au=Ding,%20Yujuan&rft.date=2019-01-05&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2164929733%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2164929733&rft_id=info:pmid/&rfr_iscdi=true |