1995
DOI: 10.1109/34.368149
|View full text |Cite
|
Sign up to set email alerts
|

Texture segmentation using fractal dimension

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
221
0
9

Year Published

1999
1999
2024
2024

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 553 publications
(230 citation statements)
references
References 23 publications
0
221
0
9
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 probability density function of Weibull distribution is given by p(|C m,n |) = [.]. In this paper, the scale parameter, is considered for image segmentation [1,2]. Another parameter considered is the Fractal parameter, namely the Fractal dimension.…”
Section: Methodsmentioning
confidence: 99%
“…Fractal dimension is computed for an image pixel by considering a window that surrounds the pixel. Variation method defines Fractal dimension as the slope of the line that best fits the points (log(R/ ), log {(R/ ) 3 E }) where R is the window size and ranges from 1 to max, E is taken as the average of V (x,y), where V (x,y) is the th variation (difference between maximum and minimum pixel value) over a window of size 2 +1 [2,3,4]. The range of Weibull and Fractal parameters varies for optical and SAR images.…”
Section: Methodsmentioning
confidence: 99%
“…Each image object has a large number of characteristic properties; the so-called object features or attributes. In this sense, the best segmentation result is that which provides optimal information for further processing (Baatz & Schäpe, 2000;Chaudhuri & Sarkar, 1995;Hofmann et al, 1998;Laine & Fan, 1996;Mao & Jain, 1992).…”
Section: Image Segmentationmentioning
confidence: 99%