2006
DOI: 10.1016/j.patcog.2005.10.014
|View full text |Cite
|
Sign up to set email alerts
|

Vectorized image segmentation via trixel agglomeration

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
15
0

Year Published

2006
2006
2023
2023

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 37 publications
(15 citation statements)
references
References 7 publications
0
15
0
Order By: Relevance
“…The second segmentation algorithm is the dual contour/region segmentation of Prasad and Skourikine [23]( figure 3(b)). The approach consists in an edge detection step followed by a Constrained Delaunay Triangulation (CDT) to close the region contours.…”
Section: Image Segmentationmentioning
confidence: 99%
“…The second segmentation algorithm is the dual contour/region segmentation of Prasad and Skourikine [23]( figure 3(b)). The approach consists in an edge detection step followed by a Constrained Delaunay Triangulation (CDT) to close the region contours.…”
Section: Image Segmentationmentioning
confidence: 99%
“…We will use our vectorized image segmentation framework [5,6,7] to obtain our initial edge-based seed segmentation.…”
Section: Vectorized Image Segmentationmentioning
confidence: 99%
“…In contrast, we did not vary any parameters of our method across the images tested on in this paper. The Canny edge detection parameters that govern the initial segmentation as described in [7] were fixed at sigma = 1 and the high and low hysteresis thresholds were fixed at 0.6 and 0.0, respectively. Both the multiscale Ncuts and the mean shift methods yield over-segmentations of salient objects of interest compared to our method.…”
Section: Comparisonmentioning
confidence: 99%
See 2 more Smart Citations