Proceedings. 17th Brazilian Symposium on Computer Graphics and Image Processing
DOI: 10.1109/sibgra.2004.1352948
|View full text |Cite
|
Sign up to set email alerts
|

Postal envelope address block location by fractal-based approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 10 publications
0
5
0
Order By: Relevance
“…The time complexity (O(n) ) of the regiongrowing algorithm is the same as in other approaches. But, simplicity of this approach gives a time performance gain (6 times faster), compared with [2], which performs an iterative process (k-means algorithm) and uses large box sizes for computing the fractal dimension.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…The time complexity (O(n) ) of the regiongrowing algorithm is the same as in other approaches. But, simplicity of this approach gives a time performance gain (6 times faster), compared with [2], which performs an iterative process (k-means algorithm) and uses large box sizes for computing the fractal dimension.…”
Section: Discussionmentioning
confidence: 99%
“…The solution appears to work fast for well-constrained envelopes, whereby a large separation exists between the image regions since they mentioned a large drawback in the figures if the envelopes have more than one stamp for example. Eiterer et al [2] present a segmentation method based on calculation of fractal dimension from 2D variation procedure and k-means clustering. The authors have also computed the influence of box size r used in each image pixel.…”
Section: Introductionmentioning
confidence: 99%
“…State-of-the-art region-based segmentation approaches are based on graph cuts ( [11], [12]), active contours ( [13], [14]) or mean shift ( [15]) algorithms. In the past two decades manifold publications showed up high level segmentation algorithms combined with well matured texture features like Markov-random-eld statistics ( [16]), Wavelet features ( [17], [18]), Gabor lters ( [19]) and Fractal features ( [20]). Furthermore, there exist many more textural spectral-temporal features (literature review see [21]) and various new texture features and extensions were published (e.g.…”
Section: Introductionmentioning
confidence: 99%
“…Texture image segmentation identifies image regions that have homogeneous with respect to a selected texture measure. Recent approaches to texture based segmentation are based on linear transforms and multiresolution feature extraction [1], Markov random filed models [2,3], Wavelets [4 -6] and fractal dimension [7]. Although unsupervised texture-based image segmentation is not a novel approach, these have limited adoption due to their high computational complexity.…”
Section: Introductionmentioning
confidence: 99%