Skip to main content

Detecting the Most Unusual Part of a Digital Image

  • Conference paper
Book cover Combinatorial Image Analysis (IWCIA 2008)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 4958))

Included in the following conference series:

Abstract

The purpose of this paper is to introduce an algorithm that can detect the most unusual part of a digital image. The most unusual part of a given shape is defined as a part of the image that has the maximal distance to all non intersecting shapes with the same form.

The method can be used to scan image databases with no clear model of the interesting part or large image databases, as for example medical databases.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fisher, Y.: Fractal Image Compression. Springer, Heidelberg (1995)

    Google Scholar 

  2. Hebb, D.: The Organization of Behavior: A Neurophysiological Theory. Wiley, New York (1949)

    Google Scholar 

  3. Hopfield, J.: Neural networks and physical systems with emergent collective computational properties. Proc.Natl.Acad.Sci.USA 79, 2554–2558 (1982)

    Article  MathSciNet  Google Scholar 

  4. Indyk, P.: Uncertainty Principles, Extractors, and Explicit Embedding of L2 into L1. In: 39th ACM Symposium on Theory of Computing, pp. 615–620 (2007)

    Google Scholar 

  5. Keogh, E., Lin, J., Fu, A.: HOT SAX: Efficiently finding the most unusual time series subsequence. In: Fifth IEEE International Conference on Data Mining, pp. 8–14 (2005)

    Google Scholar 

  6. Koroutchev, K., Korutcheva, E.: Bump formations in binary attractor neural network. Phys. Rev. E 73, 1–11 (2006)

    Google Scholar 

  7. Koroutchev, K., Korutcheva, E.: Bump formations in attractor neural network and their application to image reconstruction. In: The Proceedings of the 9th Granada Seminar on Computational and Statistical Physics, AIP, pp. 242–248 (2006)

    Google Scholar 

  8. Roudi, Y., Treves, A.: An associate network with spatially organized connectivity, JSTAT, P07010. pp. 1-20 (2004)

    Google Scholar 

  9. Ruderman, D.: The statistics of natural images. Network: Computation in Neural Systems 5, 517–548 (1994)

    Article  MATH  Google Scholar 

  10. Tsodyks, M., Feigel’man, M.: The enhanced storage capacity in neural networks with low activity level. Europhys. Lett. 6, 101–110 (1988)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Valentin E. Brimkov Reneta P. Barneva Herbert A. Hauptman

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koroutchev, K., Korutcheva, E. (2008). Detecting the Most Unusual Part of a Digital Image. In: Brimkov, V.E., Barneva, R.P., Hauptman, H.A. (eds) Combinatorial Image Analysis. IWCIA 2008. Lecture Notes in Computer Science, vol 4958. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78275-9_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78275-9_25

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-78275-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics