Sparse mathematical morphology using non-negative matrix factorization

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Sparse modelling involves constructing a succinct representation of initial data as a linear combination of a few typical atoms of a dictionary. This paper deals with the use of sparse representations to introduce new nonlinear operators which efficiently approximate the dilation/erosion. Non-negative matrix factorization (NMF) is a dimensional reduction (i.e., dictionary learning) paradigm particularly adapted to the nature of morphological processing. Sparse NMF representations are studied to introduce pseudo-morphological binary dilations/erosions. The basic idea consists in processing exclusively the image dictionary and then, the result of processing each image is approximated by multiplying the processed dictionary by the coefficient weights of the current image. These operators are then extended to grey-level images by means of the level-set decomposition. The performance of the present method is illustrated using families of binary shapes and face images. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Angulo, J., & Velasco-Forero, S. (2011). Sparse mathematical morphology using non-negative matrix factorization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6671 LNCS, pp. 1–12). Springer Verlag. https://doi.org/10.1007/978-3-642-21569-8_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free