On the error analysis of 'geometric hashing'
An experimental and theoretical analysis of the noise model in the geometric hashing technique is presented. The efficacy of the technique is discussed in the cases of affine transformations, similarities, and grid motions. The efficacy of the voting procedure, in geometric hashing is discussed, and...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 27 |
|---|---|
| container_issue | |
| container_start_page | 22 |
| container_title | |
| container_volume | |
| creator | Lamdan, Y. Wolfson, H.J. |
| description | An experimental and theoretical analysis of the noise model in the geometric hashing technique is presented. The efficacy of the technique is discussed in the cases of affine transformations, similarities, and grid motions. The efficacy of the voting procedure, in geometric hashing is discussed, and it is shown that its introduction significantly reduces the expected burden of the verification stage. The discussion is illustrated by results of simulations which have been performed to test the expected performance of the algorithm.< > |
| doi_str_mv | 10.1109/CVPR.1991.139655 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_139655</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>139655</ieee_id><sourcerecordid>139655</sourcerecordid><originalsourceid>FETCH-LOGICAL-i172t-77cab4a7716fe2e74e659408a6fac4213a0f820e421d74fbef1cf7d6d6b5a7513</originalsourceid><addsrcrecordid>eNotj89LwzAYQAMquE3v4im3XWzNl6T5cZTiLxhsDPU6vrZf1sjWStLL_nuFeXrv9OAxdgeiBBD-sf7abEvwHkpQ3lTVBZsLB85I0M5cshkIowrjwV-zec7fQkhlpZixh_XAp544pTQmjgMeTjlmPga-3NN4pCnFlveY-zjslzfsKuAh0-0_F-zz5fmjfitW69f3-mlVRLByKqxtsdFoLZhAkqwmU3ktHJqArZagUAQnBf1pZ3VoKEAbbGc601RoK1ALdn_uRiLa_aR4xHTancfULxrCQN4</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>On the error analysis of 'geometric hashing'</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Lamdan, Y. ; Wolfson, H.J.</creator><creatorcontrib>Lamdan, Y. ; Wolfson, H.J.</creatorcontrib><description>An experimental and theoretical analysis of the noise model in the geometric hashing technique is presented. The efficacy of the technique is discussed in the cases of affine transformations, similarities, and grid motions. The efficacy of the voting procedure, in geometric hashing is discussed, and it is shown that its introduction significantly reduces the expected burden of the verification stage. The discussion is illustrated by results of simulations which have been performed to test the expected performance of the algorithm.< ></description><identifier>ISSN: 1063-6919</identifier><identifier>ISBN: 0818621486</identifier><identifier>ISBN: 9780818621482</identifier><identifier>DOI: 10.1109/CVPR.1991.139655</identifier><language>eng</language><publisher>IEEE Comput. Soc. Press</publisher><subject>Computational modeling ; Error analysis ; Laboratories ; Mathematical model ; Performance evaluation ; Redundancy ; Robots ; Solid modeling ; Testing ; Voting</subject><ispartof>Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1991, p.22-27</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/139655$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2056,4048,4049,27924,54919</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/139655$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Lamdan, Y.</creatorcontrib><creatorcontrib>Wolfson, H.J.</creatorcontrib><title>On the error analysis of 'geometric hashing'</title><title>Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition</title><addtitle>CVPR</addtitle><description>An experimental and theoretical analysis of the noise model in the geometric hashing technique is presented. The efficacy of the technique is discussed in the cases of affine transformations, similarities, and grid motions. The efficacy of the voting procedure, in geometric hashing is discussed, and it is shown that its introduction significantly reduces the expected burden of the verification stage. The discussion is illustrated by results of simulations which have been performed to test the expected performance of the algorithm.< ></description><subject>Computational modeling</subject><subject>Error analysis</subject><subject>Laboratories</subject><subject>Mathematical model</subject><subject>Performance evaluation</subject><subject>Redundancy</subject><subject>Robots</subject><subject>Solid modeling</subject><subject>Testing</subject><subject>Voting</subject><issn>1063-6919</issn><isbn>0818621486</isbn><isbn>9780818621482</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1991</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj89LwzAYQAMquE3v4im3XWzNl6T5cZTiLxhsDPU6vrZf1sjWStLL_nuFeXrv9OAxdgeiBBD-sf7abEvwHkpQ3lTVBZsLB85I0M5cshkIowrjwV-zec7fQkhlpZixh_XAp544pTQmjgMeTjlmPga-3NN4pCnFlveY-zjslzfsKuAh0-0_F-zz5fmjfitW69f3-mlVRLByKqxtsdFoLZhAkqwmU3ktHJqArZagUAQnBf1pZ3VoKEAbbGc601RoK1ALdn_uRiLa_aR4xHTancfULxrCQN4</recordid><startdate>1991</startdate><enddate>1991</enddate><creator>Lamdan, Y.</creator><creator>Wolfson, H.J.</creator><general>IEEE Comput. Soc. Press</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>1991</creationdate><title>On the error analysis of 'geometric hashing'</title><author>Lamdan, Y. ; Wolfson, H.J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i172t-77cab4a7716fe2e74e659408a6fac4213a0f820e421d74fbef1cf7d6d6b5a7513</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1991</creationdate><topic>Computational modeling</topic><topic>Error analysis</topic><topic>Laboratories</topic><topic>Mathematical model</topic><topic>Performance evaluation</topic><topic>Redundancy</topic><topic>Robots</topic><topic>Solid modeling</topic><topic>Testing</topic><topic>Voting</topic><toplevel>online_resources</toplevel><creatorcontrib>Lamdan, Y.</creatorcontrib><creatorcontrib>Wolfson, H.J.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Lamdan, Y.</au><au>Wolfson, H.J.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>On the error analysis of 'geometric hashing'</atitle><btitle>Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition</btitle><stitle>CVPR</stitle><date>1991</date><risdate>1991</risdate><spage>22</spage><epage>27</epage><pages>22-27</pages><issn>1063-6919</issn><isbn>0818621486</isbn><isbn>9780818621482</isbn><abstract>An experimental and theoretical analysis of the noise model in the geometric hashing technique is presented. The efficacy of the technique is discussed in the cases of affine transformations, similarities, and grid motions. The efficacy of the voting procedure, in geometric hashing is discussed, and it is shown that its introduction significantly reduces the expected burden of the verification stage. The discussion is illustrated by results of simulations which have been performed to test the expected performance of the algorithm.< ></abstract><pub>IEEE Comput. Soc. Press</pub><doi>10.1109/CVPR.1991.139655</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1063-6919 |
| ispartof | Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1991, p.22-27 |
| issn | 1063-6919 |
| language | eng |
| recordid | cdi_ieee_primary_139655 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Computational modeling Error analysis Laboratories Mathematical model Performance evaluation Redundancy Robots Solid modeling Testing Voting |
| title | On the error analysis of 'geometric hashing' |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T20%3A51%3A59IST&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=On%20the%20error%20analysis%20of%20'geometric%20hashing'&rft.btitle=Proceedings.%201991%20IEEE%20Computer%20Society%20Conference%20on%20Computer%20Vision%20and%20Pattern%20Recognition&rft.au=Lamdan,%20Y.&rft.date=1991&rft.spage=22&rft.epage=27&rft.pages=22-27&rft.issn=1063-6919&rft.isbn=0818621486&rft.isbn_list=9780818621482&rft_id=info:doi/10.1109/CVPR.1991.139655&rft_dat=%3Cieee_6IE%3E139655%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=139655&rfr_iscdi=true |