Show simple item record

Codon Constraints on Closed 2D Shapes

dc.date.accessioned2004-10-01T20:17:27Z
dc.date.accessioned2018-11-24T10:09:49Z
dc.date.available2004-10-01T20:17:27Z
dc.date.available2018-11-24T10:09:49Z
dc.date.issued1984-05-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/5627
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/5627
dc.description.abstractCodons are simple primitives for describing plane curves. They thus are primarily image-based descriptors. Yet they have the power to capture important information about the 3-D world, such as making part boundaries explicit. The codon description is highly redundant (useful for error-correction). This redundancy can be viewed as a constraint on the number of possible codon strings. For smooth closed strings that represent the bounding contour (silhouette) of many smooth 3D objects, the constraints are so strong that sequences containing 6 elements yield only 33 generic shapes as compared with a possible number of 15, 625 combinations.en_US
dc.format.extent24 p.en_US
dc.format.extent3658738 bytes
dc.format.extent2856431 bytes
dc.language.isoen_US
dc.subjectvisionen_US
dc.subjectrecognitionen_US
dc.subjecttransversalityen_US
dc.subjectvisual representationen_US
dc.subjectsobject perceptionen_US
dc.subjectfigure-grounden_US
dc.titleCodon Constraints on Closed 2D Shapesen_US


Files in this item

FilesSizeFormatView
AIM-769.pdf2.856Mbapplication/pdfView/Open
AIM-769.ps3.658Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record