Advertisement

Solving Problems in Mathematical Morphology through Reductions to the U-Curve Problem

  • Marcelo S. Reis
  • Junior Barrera
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7883)

Abstract

The U-curve problem is an optimization problem that consists in, given a finite set S, a Boolean lattice \((\mathcal{P}(S), \subseteq)\) and a chain \(\mathcal{L}\), minimize a function \(c:\mathcal{P}(S) \rightarrow \mathcal{L}\) that satisfies an extension of Matheron’s increasing-decreasing decomposition (i.e., a function that is decomposable in U-shaped curves). This problem may be used to model problems in the domain of Mathematical Morphology, for instance, morphological operator design and some types of combinatorial optimization problems. Recently, we introduced the U-Curve-Search (UCS) algorithm, which is a solver to the U-curve problem. In this paper, we recall the principles of the UCS algorithm, present a constrained version of Serra’s formulation of the Tailor problem, prove that this problem is a U-curve problem, apply the UCS algorithm to solve it and compare the performance of UCS with another optimization algorithm. Besides, we present applications of UCS in the context of W-operator design.

Keywords

combinatorial optimization morphological operator W-operator U-curve problem Tailor problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Banon, G.J.F., Barrera, J.: Minimal representations for translation-invariant set mappings by Mathematical Morphology. SIAM Journal on Applied Mathematics 51(6), 1782–1798 (1991)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Ris, M., Barrera, J., Martins Jr., D.C.: U-curve: A branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem. Pattern Recogn. 43(3), 557–568 (2010)zbMATHCrossRefGoogle Scholar
  3. 3.
    Reis, M.S.: Minimization of decomposable in U-shaped curves functions defined on poset chains – algorithms and applications. PhD thesis, Institute of Mathematics and Statistics, University of São Paulo, Brazil (2012) (in Portuguese)Google Scholar
  4. 4.
    Serra, J.: Le problème du Tailleur. In: Int. report, CMM, School of Mines, Paris, pp. 1–5 (February 1988)Google Scholar
  5. 5.
    Roerdink, J.: The generalized tailor problem. Mathematical Morphology and its Applications to Image and Signal Processing, 57–64 (1996)Google Scholar
  6. 6.
    Barrera, J., Terada, R., Hirata Jr., R., Hirata, N.S.T.: Automatic programming of morphological machines by PAC learning. Fund. Inform., 229–258 (2000)Google Scholar
  7. 7.
    Martins Jr., D.C., Cesar Jr., R.M., Barrera, J.: W-operator window design by minimization of mean conditional entropy. Pattern Anal. Appl. 9(2), 139–153 (2006)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Reis, M.S.: featsel – a feature selection framework (2010), http://www.ime.usp.br/~msreis/featsel

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Marcelo S. Reis
    • 1
  • Junior Barrera
    • 1
  1. 1.Institute of Mathematics and StatisticsUniversity of São PauloBrazil

Personalised recommendations