Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5867Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Herskovits, Annette | - |
| dc.creator | Binford, Thomas O. | - |
| dc.date | 2004-10-01T20:50:15Z | - |
| dc.date | 2004-10-01T20:50:15Z | - |
| dc.date | 1970-07-01 | - |
| dc.date.accessioned | 2013-10-09T02:41:40Z | - |
| dc.date.available | 2013-10-09T02:41:40Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-183 | - |
| dc.identifier | http://hdl.handle.net/1721.1/5867 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | A description is given of how edge erase of prismatic objects appear through a television camera serving as visual input to a computer. Two types of edge-finding predicates are proposed and compared, one linear in intensity, the other non-linear. A statistical analysis of both is carried out, assuming input data distorted by a Gaussian noise. Both predicates have been implemented as edge-verifying procedures, ie. Procedures aiming at high sensitivity and limited to looking for edges when approximate location and directions are given. Both procedures have been tried on actual scenes. Of the two procedures the non-linear one emerged as a satisfactory solution to line-verification because it performs well in spite of surface irregularities. | - |
| dc.format | 65 p. | - |
| dc.format | 28999168 bytes | - |
| dc.format | 1279420 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-183 | - |
| dc.title | On Boundary Detection | - |
| 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.
