Skip to main content

Does Hausdorff Dimension Measure Texture Complexity?

  • Conference paper
Implementation and Application of Automata (CIAA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3317))

Included in the following conference series:

  • 591 Accesses

Abstract

It has been suggested by Jürgensen and Staiger [1] that local Hausdorff dimension is representative of local image texture complexity, or “messiness”. If true, this could be a useful local texture feature in computer vision applications such as image segmentation and object classification. In this study we investigate whether the interpretation of Hausdorff dimension as a measure of texture complexity corresponds to reality, that is, human perception of texture complexity. Jürgensen and Staiger consider black and white images described by finite-state and closed ω-languages [1]. The (local) Hausdorff dimension of an ω-language can be computed from its corresponding automaton. Thus, we are interested in the relationship between the Hausdorff dimension of ω-languages which describe black and white texture images and the perceived texture complexity of the image described.

This research was funded in part by NSERC grant RGPIN262027-03 (M. G. Eramian), in part by an NSERC Undergraduate Research Award (M. Drotar) and in part by institutional grants from the University of Saskatchewan.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Jürgensen, H., Staiger, L.: Local Hausdorff dimension. Acta Informatica 32, 491–507 (1995)

    MATH  MathSciNet  Google Scholar 

  2. Culik II, K., Kari, J.: Inference algorithms for WFA and image compression. In: Fisher, Y. (ed.) Fractal Image Encoding and Analysis. Springer, Heidelberg (1998)

    Google Scholar 

  3. Culik II, K., Valenta, V.: Finite automata based compression of bi-level and simple color images. Comput. and Graphics 21, 61–68 (1997)

    Article  Google Scholar 

  4. Staiger, L.: The Hausdorff dimension of ω-languages is computable. EATCS Bulletin 66, 178–182 (1998)

    MATH  MathSciNet  Google Scholar 

  5. Staiger, L.: Combinatorial properties of the Hausdorff dimension. J. Statistical Planning Inference 23, 95–100 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  6. Jürgensen, H., Staiger, L.: Local Hausdorff dimension and quadtrees. Technical Report 259, University ofWestern Ontario, Department of Computer Science (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Eramian, M.G., Drotar, M. (2005). Does Hausdorff Dimension Measure Texture Complexity? . In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds) Implementation and Application of Automata. CIAA 2004. Lecture Notes in Computer Science, vol 3317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30500-2_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30500-2_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24318-2

  • Online ISBN: 978-3-540-30500-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics