Detecting the most unusual part of a digital image

Authors:
Kostadin Koroutchev;Elka Korutcheva
Affiliations:
EPS, Universidad Autónoma de Madrid, Cantoblanco, Madrid, Spain;Depto. de Física Fundamental, Universidad Nacional de Educación a Distancia, Madrid, Spain and G.Nadjakov Inst. Solid State Physics, Bulgarian Academy of Sciences, Sofia, Bulgaria
Venue:
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Year:
2008

Citing 2
Cited 3

HOT SAX: Efficiently Finding the Most Unusual Time Series Subsequence

ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Uncertainty principles, extractors, and explicit embeddings of l2 into l1

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing

Detecting the most unusual part of two- and three-dimensional digital images

Pattern Recognition
Fast algorithm for detecting the most unusual part of digital images with application to medical databases

MAMECTIS'08 Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems
Detection of Unusual Objects and Temporal Patterns in EEG Video Recordings

ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part I

Quantified Score

Hi-index	0.00

Visualization

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.