Show simple item record

dc.contributor.authorEhrich, Roger W.en
dc.contributor.authorSchroeder, F. H.en
dc.date.accessioned2013-06-19T14:37:07Zen
dc.date.available2013-06-19T14:37:07Zen
dc.date.issued1979en
dc.identifierhttp://eprints.cs.vt.edu/archive/00000841/en
dc.identifier.urihttp://hdl.handle.net/10919/20303en
dc.description.abstractIn this paper an algorithm is given for generating linked edge boundaries between adjacent regions of different gray levels. In contrast with peak following algorithms, edges are treated as variable width regions, and the edge linking procedure is really a region grower. Edge linking is a parallel process on all the edges in pairs of adjacent scan lines, and contextual information in the direction of the scan lines is used to resolve ambiguous linking situations. The procedure relies heavily upon a one- dimensional edge detector that defers the formation of local edge interpretations until more informed decisions can be made by the edge linking procedure.en
dc.format.mimetypeapplication/pdfen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleContextual Boundary Formation by Scan Line Matchingen
dc.typeTechnical reporten
dc.contributor.departmentComputer Scienceen
dc.identifier.trnumberCS79009-Ren
dc.type.dcmitypeTexten
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000841/01/CS79009-R.pdfen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record