Search Results for author:
Found 4 papers, 3 papers with code
Join, select, and insert: efficient out-of-core algorithms for hierarchical segmentation trees
Binary Partition Hierarchies (BPH) and minimum spanning trees are fundamental data structures involved in hierarchical analysis such as quasi-flat zones or watershed.
Efficient Multiscale Object-based Superpixel Framework
Superpixel segmentation can be used as an intermediary step in many applications, often to improve object delineation and reduce computer workload.
Component Tree Loss Function: Definition and Optimization
In this article, we propose a method to design loss functions based on component trees which can be optimized by gradient descent algorithms and which are therefore usable in conjunction with recent machine learning approaches such as neural networks.
Ultrametric Fitting by Gradient Descent
We study the problem of fitting an ultrametric distance to a dissimilarity graph in the context of hierarchical cluster analysis.
