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

Annealing and the normalized N-cut

Abstract: We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut problem, while the low temperature solution computes the normalized N-cut. The intermediate solutions provide a sequence of refinements of the 2-cut that can be used to split the data to K clusters with 2 ≤ K ≤ N. This approach only requires specification of the upper limit on the number of expected clusters N, since by controlling the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2008
2008
2022
2022

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 25 publications
0
3
0
Order By: Relevance
“…Therefore, how to improve the ability of feature representation is one of the challenges of the current work. The early image segmentation algorithms mainly extract the low-level features of the image for segmentation [10], and the segmentation results often do not contain semantic information. With the development of deep learning, a series of network models based on Convolutional Neural Networks (CNNs) [11] have been proposed successively and have entered a new stage of semantic segmentation.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, how to improve the ability of feature representation is one of the challenges of the current work. The early image segmentation algorithms mainly extract the low-level features of the image for segmentation [10], and the segmentation results often do not contain semantic information. With the development of deep learning, a series of network models based on Convolutional Neural Networks (CNNs) [11] have been proposed successively and have entered a new stage of semantic segmentation.…”
Section: Introductionmentioning
confidence: 99%
“…Early image segmentation algorithms (watershed [6], N-Cut [7], Grab cut [8], etc.) mainly segment an image by extracting its low-level features, and the segmentation results did not contain semantic information.…”
Section: Introductionmentioning
confidence: 99%
“…Graph-based image segmentation has witnessed an explosion of interest in recent years [1][2][3][4][5][6][7][8][9]. However, this image segmentation technique is typically suffers memory overhead and time consuming drawbacks [10].…”
Section: Introductionmentioning
confidence: 99%