skip to content
The combinatorics of object recognition in cluttered environments using constrained search Preview this item
ClosePreview this item
Checking...

The combinatorics of object recognition in cluttered environments using constrained search

Author: William Eric Leifur Grimson; Massachusetts Institute of Technology. Artificial Intelligence Laboratory.
Publisher: Cambridge, Mass. : Massachusetts Institute of Technology, Artificial Intelligence Laboratory, 1988.
Series: A.I. memo, 1019.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
When clustering techniques such as the Hough transform are used to isolate likely subspaces of the search space, empirical performance in cluttered scenes improves considerably. In this paper we establish formal bounds on the combinatorics of this approach. Under some simple assumptions, we show that the expected complexity of recognizing isolated objects is quadratic in the number of model and sensory fragments,  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: William Eric Leifur Grimson; Massachusetts Institute of Technology. Artificial Intelligence Laboratory.
OCLC Number: 20679780
Notes: Cover title.
"February, 1988."
Description: 40 pages : illustrations ; 28 cm.
Series Title: A.I. memo, 1019.
Responsibility: W. Eric L. Grimson.

Abstract:

When clustering techniques such as the Hough transform are used to isolate likely subspaces of the search space, empirical performance in cluttered scenes improves considerably. In this paper we establish formal bounds on the combinatorics of this approach. Under some simple assumptions, we show that the expected complexity of recognizing isolated objects is quadratic in the number of model and sensory fragments, but that the expected complexity of recognizing objects in cluttered environments is exponential in the size of the correct interpretation. We also provide formal bounds on the efficacy of using the Hough transform to preselect likely subspaces, showing that the problem remains exponential, but that in practical terms, the size of the problem is significantly decreased.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/20679780>
library:oclcnum"20679780"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/20679780>
rdf:typeschema:Book
schema:about
schema:about
<http://id.worldcat.org/fast/1055266>
rdf:typeschema:Intangible
schema:name"Pattern recognition systems"@en
schema:name"Pattern recognition systems."@en
schema:about
schema:about
schema:contributor
<http://viaf.org/viaf/141940489>
rdf:typeschema:Organization
schema:name"Massachusetts Institute of Technology. Artificial Intelligence Laboratory."
schema:creator
<http://viaf.org/viaf/94471156>
rdf:typeschema:Person
schema:familyName"Grimson"
schema:givenName"William Eric Leifur"
schema:name"Grimson, William Eric Leifur."
schema:datePublished"1988"
schema:description"When clustering techniques such as the Hough transform are used to isolate likely subspaces of the search space, empirical performance in cluttered scenes improves considerably. In this paper we establish formal bounds on the combinatorics of this approach. Under some simple assumptions, we show that the expected complexity of recognizing isolated objects is quadratic in the number of model and sensory fragments, but that the expected complexity of recognizing objects in cluttered environments is exponential in the size of the correct interpretation. We also provide formal bounds on the efficacy of using the Hough transform to preselect likely subspaces, showing that the problem remains exponential, but that in practical terms, the size of the problem is significantly decreased."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/22491175>
schema:inLanguage"en"
schema:name"The combinatorics of object recognition in cluttered environments using constrained search"@en
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.