Representing and Reasoning on Conceptual Queries Over Image Databases

M.-S. HacidM.-S. Hacid, C. RigottiC. Rigotti

Datei:HacidRigotti-LTCS-99-02.ps.gz

Download

M.-S. Hacid, C. Rigotti
Representing and Reasoning on Conceptual Queries Over Image Databases
Technical Report, LuFg Theoretical Computer Science, RWTH Aachen, volume LTCS-99-02, 1999. LTCS-Report

Details
Bibtex

KurzfassungAbstract
The problem of content management of multimedia data types (e.g., image, video, graphics) is becoming increasingly important with the development of advanced multimedia applications. Traditional database management systems are inadequate for the handling of such data types. They require new techniques for query formulation, retrieval, evaluation, and navigation. In this paper we develop a knowledge-based framework for modeling and retrieving image data by content. To represent the various aspects of an image object's characteristics, we propose a model which consists of three layers: (1) Feature and Content Layer, intended to contain image visual features such as contours, shapes, etc.; (2) Object Layer, which provides the (conceptual) content dimension of images; and (3) Schema Layer, which contains the structured abstractions of images, i.e., a general schema about the classes of objects represented in the object layer. We propose two abstract languages on the basis of description logics: one for describing knowledge of the object and schema layers, and the other, more expressive, for making queries. Queries can refer to the form dimension (i.e., information of the Feature and Content Layer) or to the content dimension (i.e., information of the Object Layer). These languages employ a variable free notation, and they are well suited for the design, verification and complexity analysis of algorithms. As the amount of information contained in the previous layers may be huge and operations performed at the Feature and Content Layer are time-consuming, resorting to the use of materialized views to process and optimize queries may be extremely useful. For that, we propose a formal framework for testing containment of a query in a view expressed in our query language. The algorithm we propose is sound and complete and relatively efficient.
Bemerkung: Note: See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@techreport{ Hacid-Rigotti-LTCS-99,
  address = {Germany},
  author = {M.-S. {~Hacid} and C. {Rigotti}},
  institution = {LuFg Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html},
  number = {LTCS-99-02},
  title = {{R}epresenting and {R}easoning on {C}onceptual {Q}ueries {O}ver {I}mage {D}atabases},
  type = {LTCS-Report},
  year = {1999},
}