Detecting the Most Unusual Part of a Digital Image
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 im...
Saved in:
Published in | Combinatorial Image Analysis Vol. 4958; pp. 286 - 294 |
---|---|
Main Authors | , |
Format | Book Chapter |
Language | English |
Published |
Germany
Springer Berlin / Heidelberg
2008
Springer Berlin Heidelberg |
Series | Lecture Notes in Computer Science |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
ISBN: | 9783540782742 3540782745 |
ISSN: | 0302-9743 1611-3349 |
DOI: | 10.1007/978-3-540-78275-9_25 |