1992
DOI: 10.1016/1049-9652(92)90054-2
|View full text |Cite
|
Sign up to set email alerts
|

Maximum likelihood unsupervised textured image segmentation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0

Year Published

1995
1995
2015
2015

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 37 publications
(22 citation statements)
references
References 9 publications
0
22
0
Order By: Relevance
“…Early methods proposed for unsupervised region-based texture segmentation include approaches based on split-and-merge methods [5], pyramid node linking [6], selective feature smoothing with clustering [7], and a quadtree method combining statistical and spatial information [8]. Examples of more recent approaches are methods based on local linear transforms and multiresolution feature extraction [9], feature smoothing and probabilistic relaxation [10], autoregressive models [11,12], Markov random field models [13][14][15][16], multichannel filtering [17][18][19], neural network-based generalization of the multichannel approach [20], wavelets [21,22], fractal dimension [23], and hidden Markov models [24]. A method for unsupervised segmentation of color textures using Markov random fields and a split-and-merge type algorithm was proposed by Panjwani and Healey [25].…”
Section: Introductionmentioning
confidence: 99%
“…Early methods proposed for unsupervised region-based texture segmentation include approaches based on split-and-merge methods [5], pyramid node linking [6], selective feature smoothing with clustering [7], and a quadtree method combining statistical and spatial information [8]. Examples of more recent approaches are methods based on local linear transforms and multiresolution feature extraction [9], feature smoothing and probabilistic relaxation [10], autoregressive models [11,12], Markov random field models [13][14][15][16], multichannel filtering [17][18][19], neural network-based generalization of the multichannel approach [20], wavelets [21,22], fractal dimension [23], and hidden Markov models [24]. A method for unsupervised segmentation of color textures using Markov random fields and a split-and-merge type algorithm was proposed by Panjwani and Healey [25].…”
Section: Introductionmentioning
confidence: 99%
“…The contours move in the normal direction with a speed of g(I(x, y))(κ(φ(x, y)) + ν), and therefore stops on the edges, where g(·) vanishes. The curvature term κ(·) maintains the regularity of the contours, while the constant term ν accelerates and keeps the contour evolution by minimizing the enclosed area [81].…”
Section: Edge-based Active Contoursmentioning
confidence: 99%
“…Traditionally, clustering in image segmentation is supervised or manually assisted by userspecifying the thresholds or the number of clusters [24], [25]. Several unsupervised image segmentation techniques have also been proposed, such as iterative dominance clustering [26], random field models [27], fuzzy clustering [28], and maximum likelihood [29]. Some of these techniques deal with less complex scenes and others with highly textured regions, and they are not readily extensible to complex satellite imagery.…”
Section: Methodsmentioning
confidence: 99%
“…The set of interpolated thresholds for a pixel is (28) such that (referring to Fig. 2) (29) such that , where is the four closest regions to the pixel. The points at the borders of the image are not surrounded by four regional centers.…”
Section: F Pointwise Interpolationmentioning
confidence: 99%