Object Delineation by Iterative Dynamic Trees

Aparco-Cardenas, David; Rezende, Pedro J. de; Falcão, Alexandre X.

doi:10.1007/978-3-030-93420-0_13

Cited by 1 publication

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We observed that IW-sum improves effectiveness when the graph topology is constrained to the k-nearest neighbors. On the other hand, IOPF-dynmax, previously called IDT [11], appears as the best approach for object delineation, while IW-sum is the best suited for identification of emergency stations in road networks, and IW-max is the winner for clustering of twodimensional datasets.…”

Section: Discussionmentioning

confidence: 99%

“…The interested reader is also referred to our paper [11] presented at the CIARP 2021 Conference (https://ciarp25.org/) and to the book chapter [12] published by Elsevier in 2022.…”

Section: B Contributionsmentioning

confidence: 99%

“…Since IOPF is a generalization of the Iterative Spanning Forest (ISF) framework [20] from the image domain to the feature space, its application to image segmentation is straightforward. We call the methods for object delineation Iterative Dynamic Trees (IDT) [11]. A two-dimensional image is a pair (D I , I), such that I(p) assigns local image features (e.g., color space components) for each pixel p ∈ D I ⊂ Z 2 .…”

Section: A Iterative Dynamic Treesmentioning

confidence: 99%

See 2 more Smart Citations

Iterative Optimum-Path Forest: A Graph-Based Data Clustering Framework

Aparco-Cardenas

Falcão

Rezende

2022

Anais Estendidos Do XXXV Conference on Graphics, Patterns and Images (SIBGRAPI Estendido 2022)

View full text Add to dashboard Cite

Data clustering is widely recognized as a fundamental technique of paramount importance in pattern recognition and data mining. It is extensively used in many fields of the sciences, business and engineering, covering a broad spectrum of applications. Despite the large number of clustering methods, only a few of them take advantage of optimum connectivity among samples for more effective clustering. In this work, we aim to fill this gap by introducing a novel graph-based data clustering framework, called Iterative Optimum-Path Forest (IOPF), that exploits optimum connectivity for the design of improved clustering methods. The IOPF framework consists of four fundamental components: (i) sampling of a seed set S, (ii) partition of the graph induced from the dataset samples by an Optimum-Path Forest (OPF) rooted at S, (iii) recomputation of S based on the previous graph partition, and, after multiple iterations of the last two steps, (iv) selection of the forest with the lowest total cost across all iterations. IOPF can be regarded as a generalization of the Iterative Spanning Forest (ISF) framework for superpixel segmentation from the image domain to the feature space. Herein, we present four IOPF-based clustering solutions to illustrate distinct choices of its constituent components. These are thereafter employed to address three different problems, namely, unsupervised object segmentation, road network analysis and clustering of synthetic two-dimensional datasets, in order to assess their effectiveness under various graph topologies, and to ascertain their efficacy and robustness when compared to competitive baselines.

show abstract

Section: Discussionmentioning

confidence: 99%

“…The interested reader is also referred to our paper [11] presented at the CIARP 2021 Conference (https://ciarp25.org/) and to the book chapter [12] published by Elsevier in 2022.…”

Section: B Contributionsmentioning

confidence: 99%