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

Authors:
Kostadin Koroutchev;E. Korutcheva
Affiliations:
Universidad Autónoma de Madrid, Escuela Politécnica Superior, Madrid, Spain;Depto. De Física Fundamental, UNED, Madrid, Spain and G. Nadjakov Inst. Solid State Physics, Bulgarian Academy of Science, Sofia, Bulgaria
Venue:
MAMECTIS'08 Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems
Year:
2008

Citing 2
Cited 0

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 a digital image

IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce a fast 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 interesting shapes with the same form. The method is tested on two and three-dimensional images and have shown very good results without any predefined model. The results can be used to scan large image databases, as for example medical databases.