Search Results for author:
Found 7 papers, 2 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.
Atlas-based automated detection of swim bladder in Medaka embryo
An automated random forest clas-sifier is built from these descriptors in order to classify embryos with and without a swim bladder.
VOIDD: automatic vessel of intervention dynamic detection in PCI procedures
We present the automatic VOIDD algorithm to detect the vessel of intervention which is going to be treated during the procedure by combining information from the vessel image with contrast agent injection and images acquired during guidewire tip navigation.
New characterizations of minimum spanning trees and of saliency maps based on quasi-flat zones
We study three representations of hierarchies of partitions: dendrograms (direct representations), saliency maps, and minimum spanning trees.
A graph-based mathematical morphology reader
This survey paper aims at providing a "literary" anthology of mathematical morphology on graphs.
