A Description Logic for Image Retrieval

Authors:
Eugenio Di Sciascio;Francesco M. Donini;Marina Mongiello
Affiliations:
-;-;-
Venue:
AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Year:
1999

Citing 10
Cited 0

A constraint-based approach to shape management in multimedia databases

Multimedia Systems
A fuzzy description logic

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Content-Based Image Retrieval Systems

Computer
Query by Image and Video Content: The QBIC System

Computer
An Intelligent Image Database System

IEEE Transactions on Software Engineering
The Terminological Image Retrieval Model

ICIAP '97 Proceedings of the 9th International Conference on Image Analysis and Processing-Volume II
NeTra: a toolbox for navigating large image databases

ICIP '97 Proceedings of the 1997 International Conference on Image Processing (ICIP '97) 3-Volume Set-Volume 1 - Volume 1
Query-by-Pictorial-Example

IEEE Transactions on Software Engineering
A scheme for integrating concrete domains into concept languages

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Generalizing term subsumption languages to fuzzy logic

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a simple description logic for semantic indexing in image retrieval. The language allows to describe complex shapes as composition of more simple ones, using geometric transformations to describe the relative positions of shape components. An extensional semantics is provided, which allows us to formally define reasoning services -such as recognition, subsumption, and satisfiability - and to study the computational properties of the formalism. The logic is devised for exact recognition of complex shapes, but it can be extended to include similarity degrees.