CLC-Conference-Proceeding-2018
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
The stop function finds the zero or a value below<br />
a threshold ε prefixed, for example:<br />
In the iterations it is observed that there is no<br />
improvement in the minimization of the cost<br />
function, for example,<br />
.<br />
There is only a small change in the update of<br />
factors and .<br />
The maximum number of iterations is exceeded.<br />
About another stopping criteria can be read in<br />
Appendix 5.A of xxxvi .<br />
2. Three selected applications of the NMF<br />
NMF have been used as a solution model<br />
in different areas, for example, signal and image<br />
processing, as clustering methods, in text mining<br />
and many others. In this section some of the<br />
applications in which the Images Group of the<br />
University of Havana is currently working are<br />
presented.<br />
2.1 Image segmetation: Mamographies<br />
and Colposcopies<br />
The segmentation of images viewed from<br />
the perspective of the clustering algorithms can<br />
be considered as a semi-supervised technique.<br />
This task of image processing has been<br />
addressed in the literature with various strategies<br />
and is one of the first steps in the processing of<br />
images after the improvement of contrast,<br />
elimination of noise or some other necessary<br />
preprocessing depending on the appearance of<br />
the images to be treated.<br />
In this paper 2D images are considered<br />
and the adjacency matrix associated with the<br />
similarity graph, where the information of the<br />
pixels and their neighbors can been represented.<br />
.<br />
Depending on the application, information of<br />
similarity or dissimilarity can be represented.<br />
In xxxvii different graphs are studied with<br />
information of similarity between pixels (εneighborhood,<br />
knn, knnmutuo and complete).<br />
The introduction of<br />
superpixels<br />
constructed under certain considerations is also<br />
studied so that they represent the best possible<br />
local information and the dimension of the<br />
problem is reduced. The fundamental idea of<br />
segmentation is to achieve a new representation<br />
of the image so that it can be interpreted better.<br />
We will consider that in our images we<br />
do not have overlapping objects so that the<br />
segmentation can be seen as obtaining a partition<br />
in disjoint subsets whose union constitutes the<br />
complete image. Seen that way we take the<br />
definition from xxxviii :<br />
Definition 1: Let be an image on a 2-D,<br />
domain. Segmentation is defined as the<br />
process of finding<br />
a visual meaning to partitioning the domain<br />
: an object of the<br />
image<br />
.<br />
The term segmentation covers a wide<br />
range of processes through which the division of<br />
the image into different disjoint regions is<br />
obtained based on a certain homogeneity of<br />
these.<br />
Segmentation has been treated using<br />
threshold-based methods, graph-based methods<br />
(hierarchical segmentation), methods based on<br />
the recognition of edges or shapes, methods of<br />
growth of regions, those based on grouping<br />
algorithms and mathematical morphology. The<br />
success of many of them lies in the a priori<br />
information of the image, the definition of the