Loading…

Mobile product search with Bag of Hash Bits and boundary reranking

Rapidly growing applications on smartphones have provided an excellent platform for mobile visual search. Most of previous visual search systems adopt the framework of "Bag of Words", in which words indicate quantized codes of visual features. In this work, we propose a novel visual search...

Full description

Saved in:
Bibliographic Details
Main Authors: Junfeng He, Jinyuan Feng, Xianglong Liu, Tao Cheng, Tai-Hsu Lin, Hyunjin Chung, Shih-Fu Chang
Format: Conference Proceeding
Language:English
Subjects:
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 3012
container_issue
container_start_page 3005
container_title
container_volume
creator Junfeng He
Jinyuan Feng
Xianglong Liu
Tao Cheng
Tai-Hsu Lin
Hyunjin Chung
Shih-Fu Chang
description Rapidly growing applications on smartphones have provided an excellent platform for mobile visual search. Most of previous visual search systems adopt the framework of "Bag of Words", in which words indicate quantized codes of visual features. In this work, we propose a novel visual search system based on "Bag of Hash Bits" (BoHB), in which each local feature is encoded to a very small number of hash bits, instead of quantized to visual words, and the whole image is represented as bag of hash bits. The proposed BoHB method offers unique benefits in solving the challenges associated with mobile visual search, e.g., low transmission cost, cheap memory and computation on the mobile side, etc. Moreover, our BoHB method leverages the distinct properties of hashing bits such as multi-table indexing, multiple bucket probing, bit reuse, and hamming distance based ranking to achieve efficient search over gigantic visual databases. The proposed method significantly outperforms state-of-the-art mobile visual search methods like CHoG, and other (conventional desktop) visual search approaches like bag of words via vocabulary tree, or product quantization. The proposed BoHB approach is easy to implement on mobile devices, and general in the sense that it can be applied to different types of local features, hashing algorithms and image databases. We also incorporate a boundary feature in the reranking step to describe the object shapes, complementing the local features that are usually used to characterize the local details. The boundary feature can further filter out noisy results and improve the search performance, especially at the coarse category level. Extensive experiments over large-scale data sets up to 400k product images demonstrate the effectiveness of our approach.
doi_str_mv 10.1109/CVPR.2012.6248030
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6248030</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6248030</ieee_id><sourcerecordid>6248030</sourcerecordid><originalsourceid>FETCH-LOGICAL-i218t-2b95cbbec59d5e54c5cc45fca1ed7f26177431d14ba193ee91d24be0d106c2d83</originalsourceid><addsrcrecordid>eNo1UNtKw0AUXFHBWvMB4sv-QOqevSX7aINaoaKI-lr2ctKu1qTspoh_b8A6LzMDwzAMIZfAZgDMXDfvzy8zzoDPNJc1E-yInIPUlQDOa35MClPV_17LEzIBpkWpDZgzUuT8wUaMCWb4hMwfexe3SHepD3s_0Iw2-Q39jsOGzu2a9i1d2DzqOGRqu0Bdv--CTT80YbLdZ-zWF-S0tduMxYGn5O3u9rVZlMun-4fmZllGDvVQcmeUdw69MkGhkl55L1XrLWCoWq6hqqSAANJZMALRQODSIQvjes9DLabk6q83IuJql-LXOGN1uED8Ak1VTOk</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Mobile product search with Bag of Hash Bits and boundary reranking</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Junfeng He ; Jinyuan Feng ; Xianglong Liu ; Tao Cheng ; Tai-Hsu Lin ; Hyunjin Chung ; Shih-Fu Chang</creator><creatorcontrib>Junfeng He ; Jinyuan Feng ; Xianglong Liu ; Tao Cheng ; Tai-Hsu Lin ; Hyunjin Chung ; Shih-Fu Chang</creatorcontrib><description>Rapidly growing applications on smartphones have provided an excellent platform for mobile visual search. Most of previous visual search systems adopt the framework of "Bag of Words", in which words indicate quantized codes of visual features. In this work, we propose a novel visual search system based on "Bag of Hash Bits" (BoHB), in which each local feature is encoded to a very small number of hash bits, instead of quantized to visual words, and the whole image is represented as bag of hash bits. The proposed BoHB method offers unique benefits in solving the challenges associated with mobile visual search, e.g., low transmission cost, cheap memory and computation on the mobile side, etc. Moreover, our BoHB method leverages the distinct properties of hashing bits such as multi-table indexing, multiple bucket probing, bit reuse, and hamming distance based ranking to achieve efficient search over gigantic visual databases. The proposed method significantly outperforms state-of-the-art mobile visual search methods like CHoG, and other (conventional desktop) visual search approaches like bag of words via vocabulary tree, or product quantization. The proposed BoHB approach is easy to implement on mobile devices, and general in the sense that it can be applied to different types of local features, hashing algorithms and image databases. We also incorporate a boundary feature in the reranking step to describe the object shapes, complementing the local features that are usually used to characterize the local details. The boundary feature can further filter out noisy results and improve the search performance, especially at the coarse category level. Extensive experiments over large-scale data sets up to 400k product images demonstrate the effectiveness of our approach.</description><identifier>ISSN: 1063-6919</identifier><identifier>ISBN: 9781467312264</identifier><identifier>ISBN: 1467312266</identifier><identifier>EISBN: 1467312282</identifier><identifier>EISBN: 1467312274</identifier><identifier>EISBN: 9781467312271</identifier><identifier>EISBN: 9781467312288</identifier><identifier>DOI: 10.1109/CVPR.2012.6248030</identifier><language>eng</language><publisher>IEEE</publisher><subject>Feature extraction ; Hamming distance ; Indexes ; Mobile communication ; Servers ; Visualization</subject><ispartof>2012 IEEE Conference on Computer Vision and Pattern Recognition, 2012, p.3005-3012</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6248030$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6248030$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Junfeng He</creatorcontrib><creatorcontrib>Jinyuan Feng</creatorcontrib><creatorcontrib>Xianglong Liu</creatorcontrib><creatorcontrib>Tao Cheng</creatorcontrib><creatorcontrib>Tai-Hsu Lin</creatorcontrib><creatorcontrib>Hyunjin Chung</creatorcontrib><creatorcontrib>Shih-Fu Chang</creatorcontrib><title>Mobile product search with Bag of Hash Bits and boundary reranking</title><title>2012 IEEE Conference on Computer Vision and Pattern Recognition</title><addtitle>CVPR</addtitle><description>Rapidly growing applications on smartphones have provided an excellent platform for mobile visual search. Most of previous visual search systems adopt the framework of "Bag of Words", in which words indicate quantized codes of visual features. In this work, we propose a novel visual search system based on "Bag of Hash Bits" (BoHB), in which each local feature is encoded to a very small number of hash bits, instead of quantized to visual words, and the whole image is represented as bag of hash bits. The proposed BoHB method offers unique benefits in solving the challenges associated with mobile visual search, e.g., low transmission cost, cheap memory and computation on the mobile side, etc. Moreover, our BoHB method leverages the distinct properties of hashing bits such as multi-table indexing, multiple bucket probing, bit reuse, and hamming distance based ranking to achieve efficient search over gigantic visual databases. The proposed method significantly outperforms state-of-the-art mobile visual search methods like CHoG, and other (conventional desktop) visual search approaches like bag of words via vocabulary tree, or product quantization. The proposed BoHB approach is easy to implement on mobile devices, and general in the sense that it can be applied to different types of local features, hashing algorithms and image databases. We also incorporate a boundary feature in the reranking step to describe the object shapes, complementing the local features that are usually used to characterize the local details. The boundary feature can further filter out noisy results and improve the search performance, especially at the coarse category level. Extensive experiments over large-scale data sets up to 400k product images demonstrate the effectiveness of our approach.</description><subject>Feature extraction</subject><subject>Hamming distance</subject><subject>Indexes</subject><subject>Mobile communication</subject><subject>Servers</subject><subject>Visualization</subject><issn>1063-6919</issn><isbn>9781467312264</isbn><isbn>1467312266</isbn><isbn>1467312282</isbn><isbn>1467312274</isbn><isbn>9781467312271</isbn><isbn>9781467312288</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNo1UNtKw0AUXFHBWvMB4sv-QOqevSX7aINaoaKI-lr2ctKu1qTspoh_b8A6LzMDwzAMIZfAZgDMXDfvzy8zzoDPNJc1E-yInIPUlQDOa35MClPV_17LEzIBpkWpDZgzUuT8wUaMCWb4hMwfexe3SHepD3s_0Iw2-Q39jsOGzu2a9i1d2DzqOGRqu0Bdv--CTT80YbLdZ-zWF-S0tduMxYGn5O3u9rVZlMun-4fmZllGDvVQcmeUdw69MkGhkl55L1XrLWCoWq6hqqSAANJZMALRQODSIQvjes9DLabk6q83IuJql-LXOGN1uED8Ak1VTOk</recordid><startdate>20120101</startdate><enddate>20120101</enddate><creator>Junfeng He</creator><creator>Jinyuan Feng</creator><creator>Xianglong Liu</creator><creator>Tao Cheng</creator><creator>Tai-Hsu Lin</creator><creator>Hyunjin Chung</creator><creator>Shih-Fu Chang</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>20120101</creationdate><title>Mobile product search with Bag of Hash Bits and boundary reranking</title><author>Junfeng He ; Jinyuan Feng ; Xianglong Liu ; Tao Cheng ; Tai-Hsu Lin ; Hyunjin Chung ; Shih-Fu Chang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i218t-2b95cbbec59d5e54c5cc45fca1ed7f26177431d14ba193ee91d24be0d106c2d83</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Feature extraction</topic><topic>Hamming distance</topic><topic>Indexes</topic><topic>Mobile communication</topic><topic>Servers</topic><topic>Visualization</topic><toplevel>online_resources</toplevel><creatorcontrib>Junfeng He</creatorcontrib><creatorcontrib>Jinyuan Feng</creatorcontrib><creatorcontrib>Xianglong Liu</creatorcontrib><creatorcontrib>Tao Cheng</creatorcontrib><creatorcontrib>Tai-Hsu Lin</creatorcontrib><creatorcontrib>Hyunjin Chung</creatorcontrib><creatorcontrib>Shih-Fu Chang</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE/IET Electronic Library</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Junfeng He</au><au>Jinyuan Feng</au><au>Xianglong Liu</au><au>Tao Cheng</au><au>Tai-Hsu Lin</au><au>Hyunjin Chung</au><au>Shih-Fu Chang</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Mobile product search with Bag of Hash Bits and boundary reranking</atitle><btitle>2012 IEEE Conference on Computer Vision and Pattern Recognition</btitle><stitle>CVPR</stitle><date>2012-01-01</date><risdate>2012</risdate><spage>3005</spage><epage>3012</epage><pages>3005-3012</pages><issn>1063-6919</issn><isbn>9781467312264</isbn><isbn>1467312266</isbn><eisbn>1467312282</eisbn><eisbn>1467312274</eisbn><eisbn>9781467312271</eisbn><eisbn>9781467312288</eisbn><abstract>Rapidly growing applications on smartphones have provided an excellent platform for mobile visual search. Most of previous visual search systems adopt the framework of "Bag of Words", in which words indicate quantized codes of visual features. In this work, we propose a novel visual search system based on "Bag of Hash Bits" (BoHB), in which each local feature is encoded to a very small number of hash bits, instead of quantized to visual words, and the whole image is represented as bag of hash bits. The proposed BoHB method offers unique benefits in solving the challenges associated with mobile visual search, e.g., low transmission cost, cheap memory and computation on the mobile side, etc. Moreover, our BoHB method leverages the distinct properties of hashing bits such as multi-table indexing, multiple bucket probing, bit reuse, and hamming distance based ranking to achieve efficient search over gigantic visual databases. The proposed method significantly outperforms state-of-the-art mobile visual search methods like CHoG, and other (conventional desktop) visual search approaches like bag of words via vocabulary tree, or product quantization. The proposed BoHB approach is easy to implement on mobile devices, and general in the sense that it can be applied to different types of local features, hashing algorithms and image databases. We also incorporate a boundary feature in the reranking step to describe the object shapes, complementing the local features that are usually used to characterize the local details. The boundary feature can further filter out noisy results and improve the search performance, especially at the coarse category level. Extensive experiments over large-scale data sets up to 400k product images demonstrate the effectiveness of our approach.</abstract><pub>IEEE</pub><doi>10.1109/CVPR.2012.6248030</doi><tpages>8</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1063-6919
ispartof 2012 IEEE Conference on Computer Vision and Pattern Recognition, 2012, p.3005-3012
issn 1063-6919
language eng
recordid cdi_ieee_primary_6248030
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Feature extraction
Hamming distance
Indexes
Mobile communication
Servers
Visualization
title Mobile product search with Bag of Hash Bits and boundary reranking
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T04%3A14%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Mobile%20product%20search%20with%20Bag%20of%20Hash%20Bits%20and%20boundary%20reranking&rft.btitle=2012%20IEEE%20Conference%20on%20Computer%20Vision%20and%20Pattern%20Recognition&rft.au=Junfeng%20He&rft.date=2012-01-01&rft.spage=3005&rft.epage=3012&rft.pages=3005-3012&rft.issn=1063-6919&rft.isbn=9781467312264&rft.isbn_list=1467312266&rft_id=info:doi/10.1109/CVPR.2012.6248030&rft.eisbn=1467312282&rft.eisbn_list=1467312274&rft.eisbn_list=9781467312271&rft.eisbn_list=9781467312288&rft_dat=%3Cieee_6IE%3E6248030%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i218t-2b95cbbec59d5e54c5cc45fca1ed7f26177431d14ba193ee91d24be0d106c2d83%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6248030&rfr_iscdi=true