Applied connectionistic methods in computer vision to compare segmented images

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Bischoff, S., Reuss, D., & Wysotzki, F. (2003). Applied connectionistic methods in computer vision to compare segmented images. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2821, pp. 312–326). Springer Verlag. https://doi.org/10.1007/978-3-540-39451-8_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free