Codon Constraints on Closed 2D Shapes

dc.creator	Richards, Whitman
dc.creator	Hoffman, Donald D.
dc.date	2004-10-01T20:17:27Z
dc.date	2004-10-01T20:17:27Z
dc.date	1984-05-01
dc.date.accessioned	2013-10-09T02:40:27Z
dc.date.available	2013-10-09T02:40:27Z
dc.date.issued	2013-10-09
dc.identifier	AIM-769
dc.identifier	http://hdl.handle.net/1721.1/5627
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description	Codons 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.
dc.format	24 p.
dc.format	3658738 bytes
dc.format	2856431 bytes
dc.format	application/postscript
dc.format	application/pdf
dc.language	en_US
dc.relation	AIM-769
dc.subject	vision
dc.subject	recognition
dc.subject	transversality
dc.subject	visual representation
dc.subject	sobject perception
dc.subject	figure-ground
dc.title	Codon Constraints on Closed 2D Shapes

Files in this item

Files	Size	Format	View
There are no files associated with this item.