• The Journal of the Korea Contents Association
• /
• v.14 no.2
• /
• pp.28-38
• /
• 2014

For western music there has been a volume of researches on music information analysis for automatic transcription or content-based music retrieval. But it is hard to find the similar research on Korean traditional music. In this paper we propose several algorithms to automatically analyze the structure of Korean traditional music 'Pansori'. The proposed algorithm automatically distinguishes between the 'sound' part and 'speech' part which are named 'sori' and 'aniri', respectively, using the ratio of phonetic and pause time intervals. For rhythm called 'jangdan' classification the algorithm makes the robust decision using the majority voting process based on template matching. Also an algorithm is suggested to detect the bar positions in the 'sori' part based on Kalman filter. Every proposed algorithm in the paper works so well enough for the sample music sources of 'Pansori' that the results may be used to automatically transcribe the 'Pansori'.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.11a
• /
• pp.161-166
• /
• 2003

In this paper, we propose a novel method of design and implementation for the multimedia monitoring system using Web Camera. Recently WebCam is variously applied to many different areas and implemented as an improved performance using convenient functions of Web in this Internet era. Multimedia moving pictures has been popularly used in a variety of ways in different areas of monitoring systems in order to enhance the performance and the service with their data compression capability and the speed of the communication network these days. The design method of WebCam system presented in this paper might offer not only a convenient function of the monitoring system but great application capabilities. It can be used for a real time application of the multimedia picture and audio transmission so that the monitoring system can manage the security information in the sense for the reality. Tn addition, the monitoring system may be used as an inreal-time application using data storage and retrieval features of the Web. We offer both functions of monitoring in this structured form of implemented system.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.227-237
• /
• 2000

A Web database System is a large-scaled multimedia application system that has multimedia processing facilities and cooperates with relational/Object-Oriented DBMS. Conventional hypertext modeling methods and DB gateway have limitations for Web database because of their restricted versatile presentation abilities and inefficient concurrency control caused by bottleneck in cooperation processing. Thus, we suggest a Dynamic Navigation Model & Virtual Graph Structure. The Dynamic Navigation Model supports implicit query processing and dynamic creation of navigation spaces, and introduce node-link creation rule considering navigation styles. We propose a mapping methodology between the suggested hypertext model and the relational data model, and suggest a dynamic allocation scheduling technique for query processing server based on weighted value. We show that the proposed technique enhances the retrieval performance of Web database systems in processing complex queries concurrently.

• Journal of KIISE:Databases
• /
• v.35 no.2
• /
• pp.169-181
• /
• 2008

Because moving objects usually move on spatial networks, efficient trajectory index structures are required to achieve good retrieval performance on their trajectories. However, there has been little research on trajectory index structures for spatial networks such as FNR-tree and MON-tree. But, because FNR-tree and MON-tree are stored by the unit of the moving object's segment, they can't support the whole moving objects' trajectory. In this paper, we propose an efficient trajectory index structure, named Trajectory of Moving objects on Network Tree(TMN Tree), for moving objects. For this, we divide moving object data into spatial and temporal attribute, and preserve moving objects' trajectory. Then, we design index structure which supports not only range query but trajectory query. In addition, we divide user queries into spatio-temporal area based trajectory query, similar-trajectory query, and k-nearest neighbor query. We propose query processing algorithms to support them. Finally, we show that our trajectory index structure outperforms existing tree structures like FNR-Tree and MON-Tree.

• Journal of Korea Multimedia Society
• /
• v.6 no.3
• /
• pp.397-408
• /
• 2003

Existing indexing mechanisms of XML data using numbering scheme have a drawback of rebuilding the entire index structure when insertion, deletion, and update occurs on the data. We propose a new indexing mechanism based on split blocks to cope with this problem. The XML data are split into blocks, where there exists at most a relationship between two blocks, and numbering scheme is applied to each block. This mechanism reduces the overhead of rebuilding index structures when insertion, deletion, and update occurs on the data. We also propose two algorithms, Parent-Child Block Merge Algorithm and Ancestor-Descendent Algorithm which retrieve the relationship between two entities in the XML hierarchy using this indexing mechanism. We also propose a mechanism in which the identifier of a block has the information of its Parents' block to expedite retrieval process of the ancestor-descendent relationship and also propose two algorithms. Parent-Child Block Merge Algorithm and Ancestor-Descendent Algorithm using this indexing mechanism.

• Journal of KIISE:Databases
• /
• v.30 no.3
• /
• pp.225-236
• /
• 2003

MOLAP systems store data in a multidimensional away called a 'cube' and access them using way indexes. When a cube is placed into disk, it can be Partitioned into a set of chunks of the same side length. Such a cube storage scheme is called the chunk-based MOLAP cube storage scheme. It gives data clustering effect so that all the dimensions are guaranteed to get a fair chance in terms of the query processing speed. In order to achieve high space utilization, sparse chunks are further compressed. Due to data compression, the relative position of chunks cannot be obtained in constant time without using indexes. In this paper, we propose a bitmap index for chunk-based MOLAP cubes. The index can be constructed along with the corresponding cube generation. The relative position of chunks is retained in the index so that chunk retrieval can be done in constant time. We placed in an index block as many chunks as possible so that the number of index searches is minimized for OLAP operations such as range queries. We showed the proposed index is efficient by comparing it with multidimensional indexes such as UB-tree and grid file in terms of time and space.

• Journal of KIISE:Databases
• /
• v.31 no.1
• /
• pp.13-22
• /
• 2004

With the proliferation of multimedia data, there is an increasing need to support the indexing and retrieval of high-dimensional image data. Although there have been many efforts, the performance of existing multidimensional indexing methods is not satisfactory in high dimensions. Thus the dimensionality reduction and the approximate solution methods were tried to deal with the so-called dimensionality curse. But these methods are inevitably accompanied by the loss of precision of query results. Therefore, recently, the vector approximation-based methods such as the VA- file and the LPC-file were developed to preserve the precision of query results. However, the performance of the vector approximation-based methods depend largely on the size of the approximation file and they lose the advantages of the multidimensional indexing methods that prune much search space. In this paper, we propose a new index structure called the GC-tree for efficient similarity search in image databases. The GC-tree is based on a special subspace partitioning strategy which is optimized for clustered high-dimensional images. It adaptively partitions the data space based on a density function and dynamically constructs an index structure. The resultant index structure adapts well to the strongly clustered distribution of high-dimensional images.

• The KIPS Transactions:PartD
• /
• v.18D no.2
• /
• pp.133-142
• /
• 2011

To ensure the successful employment of semantic web services, it is essential that they rely on the use of high quality ontologies. However, building such ontologies is difficult and costly, thus hampering web service deployment. This study automatically builds ontologies from WSDL documents and their underlying semantics, and presents discovery methods of similar web service operations using these ontologies. The key ingredient is techniques that cluster parameters in the collection of web services into semantically meaningful concepts, and capture the hierarchical relationships between the words contained in the tag. We implement an operation retrieval system for web services. This system finds out a ranked set of similar operations using a novel similarity measurement method, and selects the most optimal operation which satisfies user's requirements. It can be directly used for the web services composition.

• Journal of Korean Society of Archives and Records Management
• /
• v.2 no.1
• /
• pp.119-131
• /
• 2002

The study designs and implements a KORMARC/EAD integrated system for the Myongji Digital Library Collections. The purpose of this paper is to design the metadata to Myongji Korean History Collections to provide digital information of high quality to clients, and to develop and implement a model for managing digital library collections. In order to test the model and the quality of the derived metadata, we built a metadata management system, which is connected to the existing KORMARC system. The system consists of two modules- a retrieval and an input module. While in the retrieve mode, one can retrieve KORMARC records of books and archival items, with links to modified EAD files for archival items or to image files for books, in the input mode, one can type two types of data such as a catalog data and an inventory data. Finally, we evaluated the proposed system via mail questionnaires, and propose three suggestions to make this system a much more comprehensive and effective system.

• Asian Pacific Journal of Cancer Prevention
• /
• v.15 no.10
• /
• pp.4339-4347
• /
• 2014

Purpose: This study aimed at exploring treatment delay (TD) among cancer patients in China with an attempt to develop a practical methodology facilitating frontline Chinese clinicians in promoting earlier cancer diagnosis and treatment. Materials and Methods: The study comprised framework development, qualitative interviews and paired factor rating. Framework development utilized systematic literature review, soft systems thinking and consensus groups. Qualitative interviews employed a checklist of open questions soliciting information about all the domains included the framework from cancer patients drawn via stratified randomized sampling of inpatients at 10 hospitals in Hefei, China. Paired factor rating used a self-developed computer aid and the interviewed patients as referring cases to weigh the relative importance of the factors listed in the framework in terms of their contributions to specific components of total delay (TD). Results: a) A conceptual framework was proposed consisting of a 6-step path to TD and 36 category determinants. b) A total of 227 patients were interviewed; their TD was 267.3 mean or 108 median days ranging from 0 to 2475 days; average appraisal, illness, behavioral, preparation and treatment delay accounted for 52.1%, 9.4%, 0.30%, 8.8% and 29.4% of the TD respectively. Individual side factors were rated substantially more important than environmental side factors (60% vs. 40%); most influential TD factors included cancer symptoms, overall health, family relations and knowledge about cancer and health. Conclusions: The framework proposed together with the interviewing and rating approaches used provide a potential new methodology for understanding cancer patients' TD and promoting earlier cancer treatment.