Hierarchical mesh decomposition using fuzzy clustering and cuts
Cutting up a complex object into simpler sub-objects is a fundamental problem in various
disciplines. In image processing, images are segmented while in computational geometry …
disciplines. In image processing, images are segmented while in computational geometry …
Computing geodesics and minimal surfaces via graph cuts
Boykov, Kolmogorov - Proceedings Ninth IEEE international …, 2003 - ieeexplore.ieee.org
Geodesic active contours and graph cuts are two standard image segmentation techniques.
We introduce a new segmentation method combining some of their benefits. Our main …
We introduce a new segmentation method combining some of their benefits. Our main …
Image segmentation with ratio cut
S Wang, JM Siskind - IEEE Transactions on Pattern Analysis …, 2003 - ieeexplore.ieee.org
This paper proposes a new cost function, cut ratio, for segmenting images using graph-
based methods. The cut ratio is defined as the ratio of the corresponding sums of two …
based methods. The cut ratio is defined as the ratio of the corresponding sums of two …
A new graph-theoretic approach to clustering and segmentation
M Pavan, M Pelillo - 2003 IEEE Computer Society Conference …, 2003 - ieeexplore.ieee.org
We develop a framework for the image segmentation problem based on a new graph-
theoretic formulation of clustering. The approach is motivated by the analogies between the …
theoretic formulation of clustering. The approach is motivated by the analogies between the …
Learning affinity functions for image segmentation: Combining patch-based and gradient-based approaches
The paper studies the problem of combining region and boundary cues for natural image
segmentation. We employ a large database of manually segmented images in order to learn …
segmentation. We employ a large database of manually segmented images in order to learn …
Graph partition by swendsen-wang cuts
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph
partition problems. The recent literature witnessed two popular graph cut algorithms: the …
partition problems. The recent literature witnessed two popular graph cut algorithms: the …
Contribution à la surveillance des systèmes de production à l'aide des réseaux de neurones dynamiques: Application à la e-maintenance
R Zemouri - 2003 - theses.hal.science
Les méthodes de surveillance industrielle sont divisées en deux catégories: méthodes de
surveillance avec modèle formel de l'équipement, et méthodes de surveillance sans modèle …
surveillance avec modèle formel de l'équipement, et méthodes de surveillance sans modèle …
Business intelligence explorer: a knowledge map framework for discovering business intelligence on the Web
Nowadays, information overload hinders the discovery of business intelligence on the World
Wide Web. Existing business intelligence tools suffer from a lack of analysis and …
Wide Web. Existing business intelligence tools suffer from a lack of analysis and …
Dominant sets and hierarchical clustering
Pavan, Pelillo - Proceedings Ninth IEEE International …, 2003 - ieeexplore.ieee.org
Dominant sets are a new graph-theoretic concept that has proven to be relevant in
partitional (flat) clustering as well as image segmentation problems. However, in many …
partitional (flat) clustering as well as image segmentation problems. However, in many …
[图书][B] Angiography and plaque imaging: advanced segmentation techniques
JS Suri, S Laxminarayan - 2003 - taylorfrancis.com
Recent, rapid advances in mathematical engineering and applied mathematics have
opened the door to solving complex problems in angiography imaging. For the first time, this …
opened the door to solving complex problems in angiography imaging. For the first time, this …