: A combination of K-means, watershed segmentation method, and Difference In Strength (DIS) map was used to perform image segmentation and edge detection tasks. We obtained an init...
We propose simple and fast methods based on nearest neighbors that order objects from high-dimensional data sets from typical points to untypical points. On the one hand, we show ...
Stefan Harmeling, Guido Dornhege, David M. J. Tax,...
Bipartite graphs appear in various scenes in the real world, and visualizing these graphs helps improve our understanding of network structures. The amount of information that is a...
clustering of documents according to sharing of topics at multiple levels of abstraction. Given a corpus of documents, a posterior inference algorithm finds an approximation to a ...
David M. Blei, Thomas L. Griffiths, Michael I. Jor...
We propose a new method to unmix hyperspectral images. Our method exploits the structure of the material abundance maps by assuming that in some regions of the spatial dimension, ...