On Integer Programming Approaches for Morphological Template Decomposition Problems in Computer Vision

P. Sussner, P.M. Pardalos and G.X. Ritter
Additional contact information
P. Sussner: University of Florida
P.M. Pardalos: University of Florida
G.X. Ritter: University of Florida

Journal of Combinatorial Optimization, 1997, vol. 1, issue 2, No 4, 165-178

Abstract: Abstract In morphological image processing and analysis, a template or structuringelement is applied to an image. Often savings in computation time and abetter fit to the given computer architecture can be achieved by using thetechnique of template decomposition. Researchers have written a multitude ofpapers on finding such decompositions for special classes of templates.Justifying recent integer programming approaches to the morphologicaltemplate decomposition problem in its general form, this paper proves theNP-completeness of this problem.

Keywords: computer vision; mathematical morphology; template decomposition; complexity; integer programming (search for similar items in EconPapers)
Date: 1997
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1023/A:1009707932516 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:1:y:1997:i:2:d:10.1023_a:1009707932516

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/A:1009707932516

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().