z-logo
open-access-imgOpen Access
KI 2003: Advances in Artificial Intelligence
Author(s) -
Andreas Günter,
Rudolf Kruse,
Bernd Neumann
Publication year - 2003
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
DOI - 10.1007/b13477
Subject(s) - computer science , artificial intelligence
Two similarity measures to compare whole and parts of images are proposed. These measures consider the color, shape and texture properties of image segments as well as their relative positions mutually. After image segmentation MPEG-7 descriptors are computed for each segment. Now the information reduced images will be represented by labeled graphs. To compute the first similarity measure it is necessary to solve the Maximum Weight Clique Problem in an extended compatibility graph. This problem is solved by a connectionistic method. The second similarity measure needs to solve a special kind of Consistent Labeling Problem. This is done by a connectionistic method too. Both measures may be used to improve the similarity measurement of images for instance in image and video retrieval, object recognition, stereo and many other Computer Vision tasks

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom