The following pages link to Laurent Najman (Q621996):
Displaying 50 items.
- Artwork 3D model database indexing and classification (Q621998) (← links)
- Weighted fusion graphs: Merging properties and watersheds (Q1005244) (← links)
- Fusion graphs: merging properties and watersheds (Q1009213) (← links)
- The Montagne Russe algorithm for global optimization (Q1298711) (← links)
- Hierarchical segmentations with graphs: quasi-flat zones, minimum spanning trees, and saliency maps (Q1635986) (← links)
- An introduction to gamma-convergence for spectral clustering (Q1690397) (← links)
- Well-composedness in Alexandrov spaces implies digital well-composedness in \(\mathbb {Z}^n\) (Q1690405) (← links)
- Watersheds, mosaics, and the emergence paradigm (Q1775627) (← links)
- A tutorial on well-composedness (Q1799490) (← links)
- Mutational equations of the morphological dilation tubes (Q1898089) (← links)
- Euler method for mutational equations (Q1910096) (← links)
- Lattice operators underlying dynamic systems (Q1915625) (← links)
- On the equivalence between hierarchical segmentations and ultrametric watersheds (Q1932859) (← links)
- Hierarchizing graph-based image segmentation algorithms relying on region dissimilarity: the case of the Felzenszwalb-Huttenlocher method (Q1980880) (← links)
- Shape-based analysis on component-graphs for multivalued image processing (Q1980885) (← links)
- Erratum to: ``Hierarchizing graph-based image segmentation algorithms relying on region dissimilarity: the case of the Felzenszwalb-Huttenlocher method'' (Q1980886) (← links)
- A 4D counter-example showing that DWCness does not imply CWCness in \(n\)D (Q2037375) (← links)
- Graph-based supervoxel computation from iterative spanning forest (Q2061832) (← links)
- An equivalence relation between morphological dynamics and persistent homology in \(n\)-D (Q2061847) (← links)
- Continuous well-composedness implies digital well-composedness in \(n\)-D (Q2127280) (← links)
- An equivalence relation between morphological dynamics and persistent homology in 1D (Q2189349) (← links)
- Watersheding hierarchies (Q2189357) (← links)
- On the probabilities of hierarchical watersheds (Q2189358) (← links)
- Characterization of graph-based hierarchical watersheds: theory and algorithms (Q2203342) (← links)
- Power spectral clustering (Q2217383) (← links)
- Topological properties of the first non-local digitally well-composed interpolation on \(n\)-D cubical grids (Q2217389) (← links)
- Equivalence between digital well-composedness and well-composedness in the sense of Alexandrov on \(n\)-d cubical grids (Q2217390) (← links)
- Some theoretical links between shortest path filters and minimum spanning tree filters (Q2320438) (← links)
- How to make \(n\)-D plain maps defined on discrete surfaces Alexandrov-well-composed in a self-dual way (Q2320444) (← links)
- Collapses and watersheds in pseudomanifolds of arbitrary dimension (Q2513430) (← links)
- Quasi-linear algorithms for the topological watershed (Q2573032) (← links)
- Some equivalence relation between persistent homology and morphological dynamics (Q2678925) (← links)
- Dual Constrained TV-based Regularization on Graphs (Q2873237) (← links)
- (Q2912423) (← links)
- A Comparison of Some Morphological Filters for Improving OCR Performance (Q2946789) (← links)
- New Characterizations of Minimum Spanning Trees and of Saliency Maps Based on Quasi-flat Zones (Q2946804) (← links)
- Shape-Based Analysis on Component-Graphs for Multivalued Image Processing (Q2946832) (← links)
- When Convex Analysis Meets Mathematical Morphology on Graphs (Q2946834) (← links)
- How to Make nD Functions Digitally Well-Composed in a Self-dual Way (Q2946841) (← links)
- Ranking Orientation Responses of Path Operators: Motivations, Choices and Algorithmics (Q2946851) (← links)
- Efficient Computation of Attributes and Saliency Maps on Tree-Based Image Representations (Q2946858) (← links)
- Some Morphological Operators on Simplicial Complex Spaces (Q3000725) (← links)
- (Q3005333) (← links)
- (Q3005335) (← links)
- (Q3005336) (← links)
- (Q3005341) (← links)
- (Q3005349) (← links)
- Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts (Q3013056) (← links)
- Surface Reconstruction Using Power Watershed (Q3013060) (← links)
- Combinatorial Continuous Maximum Flow (Q3113797) (← links)
