Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/7199Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Betke, Margrit | - |
| dc.creator | Makris, Nicholas | - |
| dc.date | 2004-10-20T20:49:32Z | - |
| dc.date | 2004-10-20T20:49:32Z | - |
| dc.date | 1995-01-25 | - |
| dc.date.accessioned | 2013-10-09T02:48:32Z | - |
| dc.date.available | 2013-10-09T02:48:32Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-1510 | - |
| dc.identifier | CBCL-109 | - |
| dc.identifier | http://hdl.handle.net/1721.1/7199 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | A fast simulated annealing algorithm is developed for automatic object recognition. The normalized correlation coefficient is used as a measure of the match between a hypothesized object and an image. Templates are generated on-line during the search by transforming model images. Simulated annealing reduces the search time by orders of magnitude with respect to an exhaustive search. The algorithm is applied to the problem of how landmarks, for example, traffic signs, can be recognized by an autonomous vehicle or a navigating robot. The algorithm works well in noisy, real-world images of complicated scenes for model images with high information content. | - |
| dc.format | 9 p. | - |
| dc.format | 1311904 bytes | - |
| dc.format | 735998 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-1510 | - |
| dc.relation | CBCL-109 | - |
| dc.subject | Template matching ; Fast simulated annealing; Information content of images; Traffic sign recognition for mobile robots or autonomous vehicles | - |
| dc.title | Fast Object Recognition in Noisy Images Using Simulated Annealing | - |
| 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.