.png){kind=icon}
Return
Pyramid segmentation algorithms revisited
.png){kind=icon}
OA
AI
DOI：10.1016/j.patcog.2006.02.017.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The main goal of this work is to compare pyramidal structures proposed to solve segmentation tasks. Segmentation algorithms based on regular and irregular pyramids are described, together with the data structures and decimation procedures which encode and manage the information in the pyramid. In order to compare the different segmentation algorithms, we have employed three types of quality measurements: the shift variance measure, the F function and the Q function. (c) 2006 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
Keywords:
image segmentation
irregular pyramids
regular pyramids
combinatorial map
graphs
data structures
decimation schemes
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSaveShareSave
View more