Fast Algorithm for Detecting the Most Unusual Part of Digital Images with Application to Medical Databases

摘要

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 intersecting 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.