scispace - formally typeset
Search or ask a question
Topic

Multimedia database

About: Multimedia database is a research topic. Over the lifetime, 1404 publications have been published within this topic receiving 19856 citations. The topic is also known as: Multimedia database & MMDB.


Papers
More filters
Journal ArticleDOI
TL;DR: This paper focuses on the representation of magnetic resonances of different parts of the human body, such as knees, spinal column, arms, elbows, etc., using ontologies, and generates an output in the OM ontological language, where the data scanned by the SIFT algorithm represents a structure.
Abstract: This paper focuses on the representation of magnetic resonances of different parts of the human body, such as knees, spinal column, arms, elbows, etc., using ontologies. First, it maps the resonance images in a multimedia database. Then, automatically, using the SIFT pattern recognition algorithm, descriptors of the images stored in the database are extracted in order to recover useful data for the user; it uses the ontologies as an artificial intelligence tool and, in consequence, reduces generation of useless data. Why do we think this is an interesting task? Because, if the user requires information about any topics or (s)he has some illness or needs to undergo magnetic resonance, this tool will show him/her images and text to convey a better understanding, helping to obtain useful conclusions. Artificial intelligence techniques are used, such as machine learning, knowledge representation, and pattern recognition. The ontological relations introduced here are based on the common representation of language, using definition dictionaries, Roget's thesaurus, synonym dictionaries, and other resources The system generates an output in the OM ontological language [1]. This language represents a structure where our system adds the data scanned by the SIFT algorithm. The tests have been made in Spanish; however, thanks to the portability of our system, it is possible to extend the method to any language.

1 citations

Proceedings ArticleDOI
09 Sep 1997
TL;DR: This work has tried to use ODBC support for creating an application which supports multimedia objects loosely coupled to any RDBMS which may or may not support multi-media objects.
Abstract: Few commercially available RDBMSs provide multimedia support. Of the few which do, there is no standard way by means of which multimedia objects are supported. We have tried to use ODBC support for creating an application which supports multimedia objects loosely coupled to any RDBMS which may or may not support multi-media objects. The multi-media objects are stored on a file system distributed over the network and the application developed handles issues like concurrency, integrity and recovery. This loosely coupled approach allows the independent existence of the RDBMS, solves the problem of storage of large amounts of multimedia data by providing a file system that is distributed across nodes of a network.

1 citations

01 Jan 1999
TL;DR: This thesis proposes database techniques for efficient management of multimedia presentations, and presents the node code representation of nodes and paths in multimedia presentation graphs, and provides efficient algorithms and optimization techniques for the evaluation of queries with path algebra expressions.
Abstract: This thesis proposes database techniques for efficient management of multimedia presentations. The techniques proposed in the thesis include multimedia database design, buffer management techniques for multimedia servers, graphical query user interfaces, efficient graph query processing techniques, and electronic books for multimedia presentations. The problem of querying multimedia presentations based on content information should become an integral part of multimedia database systems, and users should be able to store, query, and possibly manipulate multimedia presentations using a single application/database management system software. In this thesis we propose such a database management system, called ViSiOn. Most multimedia servers reported in the literature are designed to serve multiple and independent video/audio streams. We think that multimedia servers also need to serve complete presentations. Multimedia presentations provide unique opportunities to develop algorithms for buffer management and admission control, as execution-time consumption requirements of presentations are known a priori. In our work, we examine presentations in three different domains (heavyweight, middleweight, and lightweight) and provide buffer management and admission control algorithms for the three domains. We propose two improvements (flattening and dynamic-adjustments) on the schedules created for heavyweight presentations. We model multimedia presentations as presentation graphs, which are directed acyclic graphs that visually specify multimedia presentations. Each node of a presentation graph represents a media stream. Edges depict sequential or concurrent playout of streams during a presentation. Information captured in each individual stream and the presentation order of streams constitute the content information of the presentation. Querying multimedia presentation graphs based on content is important for the retrieval of information from a database. To query the information flow throughout a multimedia presentation as well as in each individual multimedia stream, we use temporal operators Next, Connected, and Until, together with path formulas. These constructs allow us to specify and query paths along a presentation graph. We present an icon-based, graphical query language, GVISUAL that provides iconic representations for these constructs and a user-friendly graphical interface for query specification. To evaluate queries with path algebra expressions, we propose the node code system. In the node code system, the nodes of a presentation graph are assigned binary codes (node codes) that are used to represent nodes and paths in a presentation graph. Using node codes makes it easy to find parent-child, predecessor-successor relationships between nodes. A pair of node codes for connected nodes uniquely identifies a path, and allows efficient set-at-a-time evaluations of path algebra expressions. In this thesis, we present the node code representation of nodes and paths in multimedia presentation graphs, and provide efficient algorithms and optimization techniques for the evaluation of queries with path algebra expressions. Electronic books are typically large, usually contain hyper-linked table of contents, indexed search facilities on keywords, and occasionally have multimedia data such as images, maps, and audio/video streams. Most of the time, the sheer size of these electronic books and their static and black box nature impede the user in effectively learning from such books. We use the term electronic book as an application that contains and makes extensive use of a multimedia database and multimedia presentations stored in it. In this thesis, we use new and extended database techniques for electronic books containing hyperlinked text, instructor's audio/video clips, slides, animation, still images, etc. as well as content-based information about these data.

1 citations


Network Information
Related Topics (5)
Server
79.5K papers, 1.4M citations
77% related
Graph (abstract data type)
69.9K papers, 1.2M citations
75% related
Wireless sensor network
142K papers, 2.4M citations
75% related
Mobile computing
51.3K papers, 1M citations
75% related
Feature extraction
111.8K papers, 2.1M citations
74% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20232
20224
202113
20206
201911
201824