Inverted Index Compression for Scalable Image Matching 倒排索引图像匹配

Inverted Index Compression for Scalable Image Matching 倒排索引图像匹配

ID:37638936

大小:127.55 KB

页数:10页

时间:2019-05-27

Inverted Index Compression for Scalable Image Matching  倒排索引图像匹配_第1页
Inverted Index Compression for Scalable Image Matching  倒排索引图像匹配_第2页
Inverted Index Compression for Scalable Image Matching  倒排索引图像匹配_第3页
Inverted Index Compression for Scalable Image Matching  倒排索引图像匹配_第4页
Inverted Index Compression for Scalable Image Matching  倒排索引图像匹配_第5页
资源描述:

《Inverted Index Compression for Scalable Image Matching 倒排索引图像匹配》由会员上传分享,免费在线阅读,更多相关内容在行业资料-天天文库

1、InvertedIndexCompressionforScalableImageMatchingDavidM.Chen1,SamS.Tsai1,VijayChandrasekhar1,GabrielTakacs1,RamakrishnaVedantham2,RadekGrzeszczuk2,BerndGirod11DepartmentofElectricalEngineering,StanfordUniversity,Stanford,CA943052NokiaResearchCenter,PaloAlto,CA94304AbstractToperformfastimagema

2、tchingagainstlargedatabases,aVocabularyTree(VT)usesaninvertedindexthatmapsfromeachtreenodetodatabaseimageswhichhavevisitedthatnode.Theinvertedindexcanrequiregigabytesofmemory,whichsignificantlyslowsdownthedatabaseserver.Inthispaper,wedesign,develop,andcomparetechniquesforinvertedindexcompress

3、ionforimage-basedretrieval.Weshowthatthesetechniquessignificantlyreducememoryusage,byasmuchas5×,withoutlossinrecognitionaccuracy.Ourworkincludesfastdecodingmethods,anofflinedatabasereorderingschemethatexploitsthesimilaritybetweenimagesforadditionalmemorysavings,andageneralizedcodingschemeforso

4、ft-binnedfeaturedescriptorhistograms.Wealsoshowthatreducedindexmemorypermitsmemory-intensiveimagematchingtechniquesthatboostrecognitionaccuracy.1.IntroductionInthepastfewyears,advancesinvisualsearchhaveledtothedevelopmentofnumerousimage-basedretrievalsystems[1][2][3][4].Mostoftheadvancesareb

5、asedonlocalimagefeaturessuchasSIFT[5],SURF[6],andCHoG[7]whichcanbematchedrobustlydespitephotometricandgeometricdistortions.Equallyimportantforlarge-scaleimagesearcharedatastructureswhichefficientlyindexlocalfeatures,andthemostnotableofthesearetheVocabularyTree(VT)[8]anditsrecentextensions[9][

6、10].Tofacilitatefastsearchthroughadatabasecontainingbillionsoffeatures,theVTsplitsthefeaturedescriptorspacebytree-structedvectorquantization(TSVQ),wheretheVQcentroidsarethetreenodes.Eachimage’ssetoffeaturedescriptorscanthenbecompactlysummarizedbyatreehistogram,whichcountshowofteneachtreenode

7、isvisited.Tospeedupimagesearch,theVTof[8]usesaninvertedindex.Foreachtreenode,theinvertedindexstoresalistofimageIDsindicatingwhichdatabaseimageshavevisitedthatnode,aswellasthevisitfrequencies.Fig.1showsaVT-basedretrievalsystemwithaninvertedindex.Dur

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。