10 citations · 31 across the 5 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
eess.IV2022★ 3 cited
Join, select, and insert: efficient out-of-core algorithms for hierarchical segmentation trees
Josselin Lefèvre, Jean Cousty, Benjamin Perret +1
Binary Partition Hierarchies (BPH) and minimum spanning trees are fundamental data structures involved in hierarchical analysis such as quasi-flat zones or watershed. However, clas…
cs.CV2022★ 7 cited
Efficient Multiscale Object-based Superpixel Framework
Felipe Belém, Benjamin Perret, Jean Cousty +2
Superpixel segmentation can be used as an intermediary step in many applications, often to improve object delineation and reduce computer workload. However, classical methods do no…