Partition min-hash for partial-duplicate image determination
Images in a database or collection of images are each divided into multiple partitions with each partition corresponding to an area of an image. The partitions in an image may overlap with each other. Min-hash sketches are generated for each of the partitions and stored with the images. A user may s...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Patent |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | KE QIFA ISARD MICHAEL A LEE DAVID CHANGSOO |
description | Images in a database or collection of images are each divided into multiple partitions with each partition corresponding to an area of an image. The partitions in an image may overlap with each other. Min-hash sketches are generated for each of the partitions and stored with the images. A user may submit an image and request that an image that is a partial match for the submitted image be located in the image collection. The submitted image is similarly divided into partitions and min-hash sketches are generated from the partitions. The min-hash sketches are compared with the stored min-hash sketches for matches, and images having partitions whose sketches are matches are returned as partial matching images. |
format | Patent |
fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US8452106B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US8452106B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US8452106B23</originalsourceid><addsrcrecordid>eNrjZLAJSCwqySzJzM9TyM3M081ILM5QSMsvUigACSfm6KaUFuRkJieWpCpk5iampyqkpJakFgFVJoK08DCwpiXmFKfyQmluBgU31xBnD93Ugvz41OKCxOTUvNSS-NBgCxNTI0MDMycjYyKUAACyqi_q</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Partition min-hash for partial-duplicate image determination</title><source>esp@cenet</source><creator>KE QIFA ; ISARD MICHAEL A ; LEE DAVID CHANGSOO</creator><creatorcontrib>KE QIFA ; ISARD MICHAEL A ; LEE DAVID CHANGSOO</creatorcontrib><description>Images in a database or collection of images are each divided into multiple partitions with each partition corresponding to an area of an image. The partitions in an image may overlap with each other. Min-hash sketches are generated for each of the partitions and stored with the images. A user may submit an image and request that an image that is a partial match for the submitted image be located in the image collection. The submitted image is similarly divided into partitions and min-hash sketches are generated from the partitions. The min-hash sketches are compared with the stored min-hash sketches for matches, and images having partitions whose sketches are matches are returned as partial matching images.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; PHYSICS</subject><creationdate>2013</creationdate><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://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20130528&DB=EPODOC&CC=US&NR=8452106B2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20130528&DB=EPODOC&CC=US&NR=8452106B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>KE QIFA</creatorcontrib><creatorcontrib>ISARD MICHAEL A</creatorcontrib><creatorcontrib>LEE DAVID CHANGSOO</creatorcontrib><title>Partition min-hash for partial-duplicate image determination</title><description>Images in a database or collection of images are each divided into multiple partitions with each partition corresponding to an area of an image. The partitions in an image may overlap with each other. Min-hash sketches are generated for each of the partitions and stored with the images. A user may submit an image and request that an image that is a partial match for the submitted image be located in the image collection. The submitted image is similarly divided into partitions and min-hash sketches are generated from the partitions. The min-hash sketches are compared with the stored min-hash sketches for matches, and images having partitions whose sketches are matches are returned as partial matching images.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2013</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZLAJSCwqySzJzM9TyM3M081ILM5QSMsvUigACSfm6KaUFuRkJieWpCpk5iampyqkpJakFgFVJoK08DCwpiXmFKfyQmluBgU31xBnD93Ugvz41OKCxOTUvNSS-NBgCxNTI0MDMycjYyKUAACyqi_q</recordid><startdate>20130528</startdate><enddate>20130528</enddate><creator>KE QIFA</creator><creator>ISARD MICHAEL A</creator><creator>LEE DAVID CHANGSOO</creator><scope>EVB</scope></search><sort><creationdate>20130528</creationdate><title>Partition min-hash for partial-duplicate image determination</title><author>KE QIFA ; ISARD MICHAEL A ; LEE DAVID CHANGSOO</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US8452106B23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2013</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>KE QIFA</creatorcontrib><creatorcontrib>ISARD MICHAEL A</creatorcontrib><creatorcontrib>LEE DAVID CHANGSOO</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>KE QIFA</au><au>ISARD MICHAEL A</au><au>LEE DAVID CHANGSOO</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Partition min-hash for partial-duplicate image determination</title><date>2013-05-28</date><risdate>2013</risdate><abstract>Images in a database or collection of images are each divided into multiple partitions with each partition corresponding to an area of an image. The partitions in an image may overlap with each other. Min-hash sketches are generated for each of the partitions and stored with the images. A user may submit an image and request that an image that is a partial match for the submitted image be located in the image collection. The submitted image is similarly divided into partitions and min-hash sketches are generated from the partitions. The min-hash sketches are compared with the stored min-hash sketches for matches, and images having partitions whose sketches are matches are returned as partial matching images.</abstract><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | |
ispartof | |
issn | |
language | eng |
recordid | cdi_epo_espacenet_US8452106B2 |
source | esp@cenet |
subjects | CALCULATING COMPUTING COUNTING PHYSICS |
title | Partition min-hash for partial-duplicate image determination |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T03%3A37%3A49IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=KE%20QIFA&rft.date=2013-05-28&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS8452106B2%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |