Fast algorithm for detecting the most unusual part of 2d and 3d digital images. Application to large medical databases

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 de ned as a part of the image that has the maximal distance to all non intersecting shapes with the same form. The method is tested on two and three-dimensional images and have shown very good results without any prede ned model. The results can be used to scan large image databases, as for example medical databasesThe work is financially supported by Spanish Grants TIN 2004 07676-G01-01, TIN 2007 66862 (K.K.) and DGI.M.CyT.FIS2005- 1729 (E.K.