File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Optimal decomposition of convex morphological structuring elements for 4-connected parallel array processors

TitleOptimal decomposition of convex morphological structuring elements for 4-connected parallel array processors
Authors
KeywordsMorphology
Numerical analysis
Optimization
Parallel processing systems
Issue Date1994
PublisherI E E E. The Journal's web site is located at http://www.computer.org/tpami
Citation
Ieee Transactions On Pattern Analysis And Machine Intelligence, 1994, v. 16 n. 3, p. 304-313 How to Cite?
AbstractA morphological operation using a large structuring element can be decomposed equivalently into a sequence of recursive operations, each using a smaller structural element. However, an optimal decomposition of arbitrarily shaped structural elements is yet to be found. In this paper, we have derived an optimal decomposition of a specific class of structuring elements - convex sets - for a specific type of machine - 4-connected parallel array processors. The cost of morphological operation on 4-connected parallel array processors is the total number of 4-connected shifts required by the set of structuring elements. First, the original structuring element is decomposed into a set of prime factors, and their locations are determined while minimizing the cost function. Proofs are presented to show the optimality of the decomposition. Examples of optimal decomposition are given and compared to an existing decomposition reported by Xu.
Persistent Identifierhttp://hdl.handle.net/10722/65512
ISSN
2015 Impact Factor: 6.077
2015 SCImago Journal Rankings: 7.653

 

DC FieldValueLanguage
dc.contributor.authorPark, Hochongen_HK
dc.contributor.authorChin, Roland Ten_HK
dc.date.accessioned2010-08-31T07:14:55Z-
dc.date.available2010-08-31T07:14:55Z-
dc.date.issued1994en_HK
dc.identifier.citationIeee Transactions On Pattern Analysis And Machine Intelligence, 1994, v. 16 n. 3, p. 304-313en_HK
dc.identifier.issn0162-8828en_HK
dc.identifier.urihttp://hdl.handle.net/10722/65512-
dc.description.abstractA morphological operation using a large structuring element can be decomposed equivalently into a sequence of recursive operations, each using a smaller structural element. However, an optimal decomposition of arbitrarily shaped structural elements is yet to be found. In this paper, we have derived an optimal decomposition of a specific class of structuring elements - convex sets - for a specific type of machine - 4-connected parallel array processors. The cost of morphological operation on 4-connected parallel array processors is the total number of 4-connected shifts required by the set of structuring elements. First, the original structuring element is decomposed into a set of prime factors, and their locations are determined while minimizing the cost function. Proofs are presented to show the optimality of the decomposition. Examples of optimal decomposition are given and compared to an existing decomposition reported by Xu.en_HK
dc.languageengen_HK
dc.publisherI E E E. The Journal's web site is located at http://www.computer.org/tpamien_HK
dc.relation.ispartofIEEE Transactions on Pattern Analysis and Machine Intelligenceen_HK
dc.subjectMorphologyen_HK
dc.subjectNumerical analysisen_HK
dc.subjectOptimizationen_HK
dc.subjectParallel processing systemsen_HK
dc.titleOptimal decomposition of convex morphological structuring elements for 4-connected parallel array processorsen_HK
dc.typeArticleen_HK
dc.identifier.emailChin, Roland T: rchin@hku.hken_HK
dc.identifier.authorityChin, Roland T=rp01300en_HK
dc.description.naturelink_to_subscribed_fulltexten_HK
dc.identifier.doi10.1109/34.276129en_HK
dc.identifier.scopuseid_2-s2.0-0028397589en_HK
dc.identifier.volume16en_HK
dc.identifier.issue3en_HK
dc.identifier.spage304en_HK
dc.identifier.epage313en_HK
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridPark, Hochong=13604642400en_HK
dc.identifier.scopusauthoridChin, Roland T=7102445426en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats