2017
DOI: 10.1109/tip.2017.2651395
|View full text |Cite
|
Sign up to set email alerts
|

Hierarchical Image Segmentation Based on Iterative Contraction and Merging

Abstract: In this paper, we propose a new framework for hierarchical image segmentation based on iterative contraction and merging. In the proposed framework, we treat the hierarchical image segmentation problem as a sequel of optimization problems, with each optimization process being realized by a contraction-and-merging process to identify and merge the most similar data pairs at the current resolution. At the beginning, we perform pixel-based contraction and merging to quickly combine image pixels into initial regio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
26
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 44 publications
(26 citation statements)
references
References 21 publications
0
26
0
Order By: Relevance
“…However, the method is simpler than region merging. According to the result, it can be seen that AMR can help seeded segmentation algorithms to achieve a hierarchical segmentation [47], [48]. Hierarchical segmentation is a multilevel segmentation scheme, and it usually outputs a coarse-to-fine hierarchy of segments ordered by the level of details.…”
Section: B the Monotonic Increasingness Property Of Amrmentioning
confidence: 99%
“…However, the method is simpler than region merging. According to the result, it can be seen that AMR can help seeded segmentation algorithms to achieve a hierarchical segmentation [47], [48]. Hierarchical segmentation is a multilevel segmentation scheme, and it usually outputs a coarse-to-fine hierarchy of segments ordered by the level of details.…”
Section: B the Monotonic Increasingness Property Of Amrmentioning
confidence: 99%
“…Instead of human subjectively specifying the two crucial parameters for removing noisy regions, our approach provides soft‐segmented results based on the estimated appearance overlap, and then automatically set up the relevant parameters in the Dense CRF framework, finally, per‐pixel accurate segmentation results are obtained based on a mean‐field inference. We believe that is the most significant difference between our approach and the GSF‐based approach. (iv) Many other prominent segmentation methods: Such as segmentation based on level set method [40–42], segmentation combined the saliency [43–45], and method based on region merging [6, 46], and so on. In addition, there are some co‐segmentation techniques [47–49] that are used for segmenting common objects in multiple images.…”
Section: Related Workmentioning
confidence: 99%
“…Mathematical morphology has been used in hierarchical image analysis with, e.g., hierarchical watersheds [3,4,5,6], binary partition trees [7,8,9], quasiflat zone hierarchies [10,11], and tree-based shape spaces [12]. Other methods for hierarchical image analysis consider regular and irregular pyramids [13], scale-set theory [14], multiscale combinatorial grouping [15], series of optimization problems [16], and generic image classification based on convolutional neural networks [17].…”
Section: Introductionmentioning
confidence: 99%