IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
A graph-based framework for thermal faceprint characterization
ICIAP'11 Proceedings of the 16th international conference on Image analysis and processing: Part I
Computers and Electrical Engineering
An Optimum-Path Forest framework for intrusion detection in computer networks
Engineering Applications of Artificial Intelligence
Brain tissue MR-image segmentation via optimum-path forest clustering
Computer Vision and Image Understanding
A data reduction and organization approach for efficient image annotation
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Hi-index | 0.00 |
We propose an approach for data clustering based on optimum-path forest. The samples are taken as nodes of a graph, whose arcs are defined by an adjacency relation. The nodes are weighted by their probability density values (pdf) and a connectivity function is maximized, such that each maximum of the pdf becomes root of an optimum-path tree (cluster), composed by samples “more strongly connected” to that maximum than to any other root. We discuss the advantages over other pdf-based approaches and present extensions to large datasets with results for interactive image segmentation and for fast, accurate, and automatic brain tissue classification in magnetic resonance (MR) images. We also include experimental comparisons with other clustering approaches. © 2009 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 19, 50–68, 2009.