View Item 

Show simple item record

A parallel algorithm for determining two-dimensional object positions using incomplete information about their boundaries

dc.contributor.authorAmini, Amir A.en_US
dc.contributor.authorWeymouth, Terry E.en_US
dc.contributor.authorAnderson, David J.en_US
dc.date.accessioned2006-04-07T20:55:30Z
dc.date.available2006-04-07T20:55:30Z
dc.date.issued1989en_US
dc.identifier.citationAmini, Amir A., Weymouth, Terry E., Anderson, David J. (1989)."A parallel algorithm for determining two-dimensional object positions using incomplete information about their boundaries." Pattern Recognition 22(1): 21-28. <http://hdl.handle.net/2027.42/28103>en_US
dc.identifier.urihttp://www.sciencedirect.com/science/article/B6V14-48MPNDG-1DN/2/109fafb492331c8a1a9762b9bdc4a438en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/28103
dc.description.abstractExtraction of two-dimensional object locations using current techniques is a computationally intensive process. In this paper a parallel algorithm is presented that can specify the location of objects from edge streaks produced by an edge operator. Best-first searches are carried out in a number of non-interacting and localized edge streak spaces. The outcome of each search is a hypothesis. Each edge streak votes for a single hypothesis; it may also take part in the formation of other hypotheses. A poll of the votes determined the stronger hypotheses. The algorithm can be used as a front end to a visual pattern recognition system where features are extracted from the hypothesized object boundary or from the area localized by the hypothesized boundary.Experimental results from a biomedical domain are presented.en_US
dc.format.extent701161 bytes
dc.format.extent3118 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherElsevieren_US
dc.titleA parallel algorithm for determining two-dimensional object positions using incomplete information about their boundariesen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelScience (General)en_US
dc.subject.hlbsecondlevelComputer Scienceen_US
dc.subject.hlbtoplevelScienceen_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI 48109-2212, U.S.A.en_US
dc.contributor.affiliationumDepartment of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI 48109-2212, U.S.A.en_US
dc.contributor.affiliationumDepartment of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI 48109-2212, U.S.A.en_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/28103/1/0000551.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1016/0031-3203(89)90034-4en_US
dc.identifier.sourcePattern Recognitionen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
0000551.pdf
Size:
684.7KB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.