Detecting the Most Unusual Part of a Digital Image

10/19/2008
by   K. Koroutchev, et al.
0

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.

READ FULL TEXT
research
05/03/2010

Detecting the Most Unusual Part of Two and Three-dimensional Digital Images

The purpose of this paper is to introduce an algorithm that can detect t...
research
06/20/2017

A Bayesian algorithm for detecting identity matches and fraud in image databases

A statistical algorithm for categorizing different types of matches and ...
research
06/14/2017

Delta Complexes in Digital Images. Approximating Image Object Shapes

In a computational topology of digital images, simplexes are replaced by...
research
06/02/2015

Image Retrieval Based on Binary Signature ang S-kGraph

In this paper, we introduce an optimum approach for querying similar ima...
research
06/06/2011

An efficient circle detection scheme in digital images using ant system algorithm

Detection of geometric features in digital images is an important exerci...
research
06/23/2022

Detecting Correlated Gaussian Databases

This paper considers the problem of detecting whether two databases, eac...
research
07/27/2021

Digital Collections of Examples in Mathematical Sciences

Some aspects of Computer Algebra (notably Computation Group Theory and C...

Please sign up or login with your details

Forgot password? Click here to reset