Training Single-Layer Morphological Perceptron Using Convex-Concave Programming (2401.02296v1)
Abstract: This paper concerns the training of a single-layer morphological perceptron using disciplined convex-concave programming (DCCP). We introduce an algorithm referred to as K-DDCCP, which combines the existing single-layer morphological perceptron (SLMP) model proposed by Ritter and Urcid with the weighted disciplined convex-concave programming (WDCCP) algorithm by Charisopoulos and Maragos. The proposed training algorithm leverages the disciplined convex-concave procedure (DCCP) and formulates a non-convex optimization problem for binary classification. To tackle this problem, the constraints are expressed as differences of convex functions, enabling the application of the DCCP package. The experimental results confirm the effectiveness of the K-DDCCP algorithm in solving binary classification problems. Overall, this work contributes to the field of morphological neural networks by proposing an algorithm that extends the capabilities of the SLMP model.
- H. J. A. M. Heijmans, “Mathematical Morphology: A Modern Approach in Image Processing Based on Algebra and Geometry,” SIAM Review, vol. 37, no. 1, pp. 1–36, 1995.
- P. Soille, Morphological Image Analysis. Berlin: Springer Verlag, 1999.
- G. Birkhoff, Lattice Theory. Providence: American Mathematical Society, 3 ed., 1993.
- C. Ronse, “Why Mathematical Morphology Needs Complete Lattices,” Signal Processing, vol. 21, no. 2, pp. 129–154, 1990.
- R. Cuninghame-Green, Minimax Algebra: Lecture Notes in Economics and Mathematical Systems 166. New York: Springer-Verlag, 1979.
- R. Cuninghame-Green, “Minimax Algebra and Applications,” in Advances in Imaging and Electron Physics (P. Hawkes, ed.), vol. 90, pp. 1–121, New York, NY: Academic Press, 1995.
- J. L. Davidson and F. A. Hummer, “Morphology neural networks: An introduction with applications,” Circuits, Systems and Signal Processing, vol. 12, pp. 177–210, 1993.
- G. X. Ritter and P. Sussner, “An introduction to morphological neural networks,” Proceedings of 13th International Conference on Pattern Recognition, vol. 4, pp. 709–717 vol.4, 1996.
- G. X. Ritter, P. Sussner, and J. L. Diaz-De-Leon, “Morphological associative memories,” IEEE Transactions on Neural Networks, vol. 9, no. 2, pp. 281–293, 1998.
- G. X. Ritter and P. Sussner, “An Introduction to Morphological Neural Networks,” in Proceedings of the 13th International Conference on Pattern Recognition, (Vienna, Austria), pp. 709–717, 1996.
- P. Sussner and E. L. Esmi, “Morphological perceptrons with competitive learning: Lattice-theoretical framework and constructive learning algorithm,” Information Sciences, vol. 181, pp. 1929–1950, 5 2011.
- G. X. Ritter and P. Sussner, “Associative Memories Based on Lattice Algebra,” in Computational Cybernetics and Simulation, (Orlando, Florida), 1997 IEEE International Conference on Systems, Man, and Cybernetics, 1997.
- G. Ritter and G. Urcid, “Lattice Algebra Approach to Single-Neuron Computation,” IEEE Transactions on Neural Networks, vol. 14, no. 2, pp. 282–295, 2003.
- CRC Press, 2021.
- R. A. Valente and M. E. Valle, “A Brief Account on Morphological Perceptron with Competitive Layer Trained by a Certain Genetic Algorithm,” in 1st BRICS Countries Congress (BRICS-CCI) and 11th Brazilian Congress (CBIC) on Computational Intelligence, (Porto de Galinhas), Sociedade Brasileira de Inteligência Computacional, 9 2013.
- R. d. A. Araújo, A. L. Oliveira, S. Soares, and S. Meira, “An evolutionary morphological approach for software development cost estimation,” Neural Networks, vol. 32, pp. 285–291, 8 2012.
- V. Charisopoulos and P. Maragos, “Morphological Perceptrons: Geometry and Training Algorithms,” in Mathematical Morphology and Its Applications to Signal and Image Processing (J. Angulo, S. Velasco-Forero, and F. Meyer, eds.), (Cham), pp. 3–15, Springer International Publishing, 2017.
- C. Cortes and V. Vapnik, “Support-vector networks,” Machine learning, vol. 20, no. 3, pp. 273–297, 1995.
- L. Rosasco, E. D. Vito, A. Caponnetto, M. Piana, and A. Verri, “Are Loss Functions All the Same?,” Neural Computation, vol. 16, pp. 1063–1076, 5 2004.
- A. L. Yuille and A. Rangarajan, “The concave-convex procedure,” Neural Computation, vol. 15, no. 4, pp. 915–936, 2003.
- X. Shen, S. Diamond, Y. Gu, and S. Boyd, “Disciplined convex-concave programming,” 2016.
- V. Charisopoulos and P. Maragos, “Morphological perceptrons: Geometry and training algorithms,” in Mathematical Morphology and Its Applications to Signal and Image Processing, pp. 3–15, Springer International Publishing, 2017.
- S. Diamond and S. Boyd, “Cvxpy: A python-embedded modeling language for convex optimization,” 2016.
- A. Bagirov, S. Taheri, N. Karmitsa, N. Sultanova, and S. Asadi, “Robust piecewise linear l 1 -regression via nonsmooth dc optimization,” Optimization Methods and Software, vol. 37, pp. 1–21, 12 2020.
- B. D. Ripley and N. L. Hjort, Pattern Recognition and Neural Networks. USA: Cambridge University Press, 1st ed., 1995.
- F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay, “Scikit-learn: Machine learning in python.” Journal of Machine Learning Research, 12(Oct):2825-2830, 2011.
- C. Cortes and V. Vapnik, “Support-vector networks,” Machine Learning, vol. 20, pp. 273–297, 9 1995.