• Journal of Korea Multimedia Society
• /
• v.9 no.6
• /
• pp.720-727
• /
• 2006

In this paper, we propose a method which allows the SuperSQL query processor to share as much code as possible among various, generators, each of which is responsible for the output of a certain medium. SuperSQL is an enhanced query-processing system that converts database records into a variety of formats such as XML, HTML, PDF and etc. However, the existing SuperSQL media generator would require creation of a different processor for each medium, causing duplicated development cost. This research makes three main contributions: First, it analyzes the structures of various media, examining any possibility of integration based on their common structure. Second, it also facilitates the addition of a new output media generator by separating constructors and decorators from each medium. Last, it provides an integrated user interface to each media by method of the Media Abstraction Table Concept. We also show the performance and feasibility of our system using experimental results.

• Journal of Information Processing Systems
• /
• v.16 no.2
• /
• pp.261-276
• /
• 2020

Digital contents services are one of the topics that have been intensively studied in the media industry, where various semantic and ontology techniques are applied. However, query execution for ontology data is still inefficient, lack of sufficient extensible definitions for node relationships, and there is no specific semantic method fit for media data representation. In order to make the machine understand digital contents (DCs) data well, we analyze DCs data, including static data and dynamic data, and use ontology to specify and classify objects and the events of the particular objects. Then the formal representation method is proposed which not only redefines DCs data based on the technology of OWL/RDF, but is also combined with media segmentation methods. At the same time, to speed up the access mechanism of DCs data stored under the persistent database, an ontology-based DCs query solution is proposed, which uses the specified distance vector associated to a surveillance of semantic label (annotation) to detect and track a moving or static object.

• Journal of the Korea Society for Simulation
• /
• v.15 no.1
• /
• pp.59-67
• /
• 2006

In this paper, we propose an effective use of SuperSQL for efficient media publication that utilizes relational databases. SuperSQL is an enhanced SQL processing system that converts data stored in relational databases into a variety or applied formats, such as XML and HTML, as a result or query. In order to integrate various media generators in SuperSQL query processor, we discuss methods to prepare both for new media promptly and for efficient media publication processing system. This research makes two main contributions: (1) it is a study about methods to integrate media generators by combining common processes in SuperSQL query processor, and (2) it introduces the trinity data model, which divide the media generating processes into three aspects, which are value, structure and medium abstraction. We also show the good performance and feasibility of our system.

• The KIPS Transactions:PartB
• /
• v.12B no.7 s.103
• /
• pp.803-810
• /
• 2005

Information retrieval is one of the most challenging areas in which the ontology technology is effectively used. Among them image retrieval using the image meta data and ontology is the one that can substitute the keyword-based image retrieval. In the paper, the retrieval of visual media such as the art image and photo picture is handled. It is assumed that there are more than one service providers of the visual media and also there is one central service broker that mediates the user's query. Given the user's query the first step that must be done in the service broker is to get the list of candidate service providers that fit the query. This is done by defining various ontologies such as the service ontology and matching the query against the ontology and providers. A novel matching method based on the ASN.1. The experiment shows that the method is more effective than existing tree-based and interval-based methods. Ontology merging issue is also handled that can happen when the service providers register their service into the service broker. An effective method is also proposed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.2
• /
• pp.723-736
• /
• 2014

This paper proposes a matching engine for a query-by-singing/humming (QbSH) system with polyphonic music files like MP3 files. The pitch sequences extracted from polyphonic recordings may be distorted. So we use chroma-scale representation, pre-processing, compensation, and asymmetric dynamic time warping to reduce the influence of the distortions. From the experiment with 28 hour music DB, the performance of our QbSH system based on polyphonic database is very promising in comparison with the published QbSH system based on monophonic database. It shows 0.725 in MRR(Mean Reciprocal Rank). Our matching engine can be used for the QbSH system based on MIDI DB also and that performance was verified by MIREX 2011.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.3
• /
• pp.894-907
• /
• 2022

The features extracted by convolutional neural networks are more descriptive of images than traditional features, and their convolutional layers are more suitable for retrieving images than are fully connected layers. The convolutional layer features will consume considerable time and memory if used directly to match an image. Therefore, this paper proposes a feature weighting and region integration method for convolutional layer features to form global feature vectors and subsequently use them for image matching. First, the 3D feature of the last convolutional layer is extracted, and the convolutional feature is subsequently weighted again to highlight the edge information and position information of the image. Next, we integrate several regional eigenvectors that are processed by sliding windows into a global eigenvector. Finally, the initial ranking of the retrieval is obtained by measuring the similarity of the query image and the test image using the cosine distance, and the final mean Average Precision (mAP) is obtained by using the extended query method for rearrangement. We conduct experiments using the Oxford5k and Paris6k datasets and their extended datasets, Paris106k and Oxford105k. These experimental results indicate that the global feature extracted by the new method can better describe an image.

• Journal of Broadcast Engineering
• /
• v.9 no.2
• /
• pp.151-163
• /
• 2004

In this paper, we propose a content-based video indexing and retrieval system using MPEG-7 standard to retrieve and manage videos efficiently. The proposed system consists of video indexing module for a video DB and video retrieval module to allow various query methods on a web environment. Video indexing module stores metadata such as manually typed in keywords, automatically recognized character names, and MPEG-7 visual descriptors extracted by indexing module into a DB in a sever side. A user can access to retrieval module by a web and retrieve desired videos through various query methods like keywords, faces, example and sketch. For this retrieval system, we propose ATC(Adaptive Twin Comparison) as a cut detection method for efficient video indexing and QBME(Query By Modified Example) as an improved content-based query method for the convenience of users. Experimental results show that the proposed ATC method detects cuts well and the proposed QBME method provides the conveniences better than existing query methods such as QBE(Query By Example) and QBS(Query By Sketch).

• Journal of Broadcast Engineering
• /
• v.5 no.1
• /
• pp.41-49
• /
• 2000

In this paper, we propose a new method of indexing and searching based on object-specific features at different semantic levels for video retrieval. A moving trajectory model is used as an indexing key for accessing the individual object in the semantic level. By tracking individual objects with segmented data, we can generate motion trajectories and set model parameters using polynomial curve fitting. The proposed searching scheme supports various types of queries including query by example, query by sketch, and query on weighting parameters for event-based video retrieval. When retrieving the interested video clip, the system returns the best matching event in the similarity order.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.11
• /
• pp.515-524
• /
• 2017

In this paper, we design and implement an expert system for diagnosing ADHD. As a result of the analysis with DSM-IV-TR, the ADHD diagnostic criteria are changed according to the age group. With this analyzed diagnostic, objects and their values are set and rules are created. We design a diagnostic system consisting of 'ADHD diagnostic system engine' and 'user query response program'. The ADHD diagnostic system engine is a rule-based reasoning engine that is implemented in the Prolog language and receives INPUT from the user query response program. By INPUT, the rule is executed based on the ADHD diagnostic criteria and the OUTPUT is sent back to the 'user query response program' by inferring the diagnostic result. The 'user query response program' is implemented in the Python language and serves as an interface for handling conversation with the user. The bridge between 'ADHD diagnostic system engine' and 'user query response program' is performed through the Pyswip library. As a result, the ADHD Diagnostic Expert System will help you plan your treatment with reduced diagnostic costs and use-complexity.

• The KIPS Transactions:PartB
• /
• v.9B no.1
• /
• pp.105-112
• /
• 2002

In order to process video data effectively, we need to save its content on database and a content-based retrieval method which processes various queries of all users is required. In this paper, we present VRS(Video Retrieval System) which provides similarity query, SQBE(Scene Query By Example) query, and content-based retrieval by combining the feature-based retrieval and the annotation-based retrieval. The SQBE query makes it possible for a user to retrieve scones more exactly by inserting and deleting objects based on a retrieved scene. We proposed query language and query processing algorithm for SQBE query, and carried out performance evaluation on similarity retrieval. The proposed system is implemented with Visual C++ and Oracle.