2017
DOI: 10.1007/978-3-319-57240-6_9
|View full text |Cite
|
Sign up to set email alerts
|

A Supervoxel-Based Solution to Resume Segmentation for Interactive Correction by Differential Image-Foresting Transforms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0
1

Year Published

2017
2017
2019
2019

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 29 publications
0
6
0
1
Order By: Relevance
“…ISF falls in the category of graph-based algorithms as a particular case of a more general framework [11] -the Image Foresting Transform (IFT). The IFT is a framework for the design of image operators based on connectivity, such as distance and geodesic transforms, morphological reconstructions, multiscale skeletonization, image description, regionand boundary-based image segmentation methods [26], [24], [27], [28], [29], [30], [31], [32], [33], with extensions to clustering and classification [34], [35], [36], [37], [38]. As discussed in [39], by choice of the connectivity function, the IFT algorithm computes a watershed transform from a set of seeds that corresponds to a graph cut in which the minimum gradient value in the cut is maximized.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…ISF falls in the category of graph-based algorithms as a particular case of a more general framework [11] -the Image Foresting Transform (IFT). The IFT is a framework for the design of image operators based on connectivity, such as distance and geodesic transforms, morphological reconstructions, multiscale skeletonization, image description, regionand boundary-based image segmentation methods [26], [24], [27], [28], [29], [30], [31], [32], [33], with extensions to clustering and classification [34], [35], [36], [37], [38]. As discussed in [39], by choice of the connectivity function, the IFT algorithm computes a watershed transform from a set of seeds that corresponds to a graph cut in which the minimum gradient value in the cut is maximized.…”
Section: Related Workmentioning
confidence: 99%
“…A first method based on the ISF framework appeared in [45] and has been successfully used in a high level application [33]. It is considered in our experiments.…”
Section: Related Workmentioning
confidence: 99%
“…To correct an existing segmentation, the seed set is initialized with the geodesic centers of the pre-segmented labels (cell candidates) for IFT-SC ( Figure 4H). More sophisticated procedures may also be considered for non-cell objects [15]. Since the user may desire to extend, merge, or split existing cells, the system provides for both interaction modes in total eight operations that can be used when editing scribbles: add, remove, extend, split, merge, undo, redo, and erase all.…”
Section: User Interactionmentioning
confidence: 99%
“…• IFT-SLIC [34,35]: Alexandre et al [34] developed a supervoxel generation method which initializes a seed set equally spaced like a grid, and moves them appropriately according to intensity and shape constraints, by regulating supervoxels compactness and boundary adherence. The natural returning of seeds allows the user to edit the presegmentation by IFT;…”
Section: Motivationmentioning
confidence: 99%
“…Features such as compactness (which gives a more regular shape) and boundary adherence are benefits of using this method. The format of partitions, compared to other methods, is more regular [35];…”
Section: Goals and Contributionsmentioning
confidence: 99%