Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6550Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Grimson, W. Eric L. | - |
| dc.date | 2004-10-04T15:31:13Z | - |
| dc.date | 2004-10-04T15:31:13Z | - |
| dc.date | 1990-04-01 | - |
| dc.date.accessioned | 2013-10-09T02:45:56Z | - |
| dc.date.available | 2013-10-09T02:45:56Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-1226 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6550 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | Many current recognition systems use constrained search to locate objects in cluttered environments. Previous formal analysis has shown that the expected amount of search is quadratic in the number of model and data features, if all the data is known to come from a sinlge object, but is exponential when spurious data is included. If one can group the data into subsets likely to have come from a single object, then terminating the search once a "good enough" interpretation is found reduces the expected search to cubic. Without successful grouping, terminated search is still exponential. These results apply to finding instances of a known object in the data. In this paper, we turn to the problem of selecting models from a library, and examine the combinatorics of determining that a candidate object is not present in the data. We show that the expected search is again exponential, implying that naﶥ approaches to indexing are likely to carry an expensive overhead, since an exponential amount of work is needed to week out each of the incorrect models. The analytic results are shown to be in agreement with empirical data for cluttered object recognition. | - |
| dc.format | 2065629 bytes | - |
| dc.format | 1611358 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-1226 | - |
| dc.title | The Effect of Indexing on the Complexity of Object Recognition | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.