• 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 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.

• The KIPS Transactions:PartA
• /
• v.10A no.5
• /
• pp.571-578
• /
• 2003

The appearnace of web technology has accelerated the development of the multimedia technology, the computer communication technology and the multimedia application contents. Researches on WBI(Web-based Instruction) system have combined the technology of the digital library and LOD,. REcently WBI(Web-based Instruction) model which is based on web has been proposed in the part of the new activity model of teaching-learning. As the demand of the customized coursewares from the lwarners is increased, the needs of the efficient and automated education agents in the web-based instruction are recognized. In this paper we propose a system monitors learner's behaviors constantly, evaluates them, and calculates his accomplishment. And the system offers suitable course to learner applying this accomplishment degree to agent's schedules. Therefore, the learner achieves an active and complete learning from the repeated and suitable course semantic-based retrieval.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2599-2613
• /
• 2015

Multi-index hashing (MIH) is the state-of-the-art method for indexing binary codes, as it di-vides long codes into substrings and builds multiple hash tables. However, MIH is based on the dataset codes uniform distribution assumption, and will lose efficiency in dealing with non-uniformly distributed codes. Besides, there are lots of results sharing the same Hamming distance to a query, which makes the distance measure ambiguous. In this paper, we propose a data-oriented multi-index hashing method (DOMIH). We first compute the covariance ma-trix of bits and learn adaptive projection vector for each binary substring. Instead of using substrings as direct indices into hash tables, we project them with corresponding projection vectors to generate new indices. With adaptive projection, the indices in each hash table are near uniformly distributed. Then with covariance matrix, we propose a ranking method for the binary codes. By assigning different bit-level weights to different bits, the returned bina-ry codes are ranked at a finer-grained binary code level. Experiments conducted on reference large scale datasets show that compared to MIH the time performance of DOMIH can be improved by 36.9%-87.4%, and the search accuracy can be improved by 22.2%. To pinpoint the potential of DOMIH, we further use near-duplicate image retrieval as examples to show the applications and the good performance of our method.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.2
• /
• pp.25-30
• /
• 2003

Recently, development of digital technology is occupying a large part of multimedia information like character, voice, image, video, etc. Research about video indexing and retrieval progresses especially in research relative to video. In this paper, we propose new algorithm(Frame Feature Comparison) for MPEG video segmentation. Shot, Scene Change detection is basic and important works that segment it in MPEG video sequence. Generally, the segmentation algorithm that uses much has defect that occurs an error detection according to a flash of camera, movement of camera and fast movement of an object, because of comparing former frames with present frames. Therefore, we distinguish a scene change one more time using a scene change point detected in the conventional algorithm through comparing its mean value with abutted frames. In the result, we could detect more corrective scene change than the conventional algorithm.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.6
• /
• pp.141-147
• /
• 1999

Optical disk technology with a laser beam for data recording and retrieval is one of the most promising route for high density information storage in multimedia era. As the storage density and data transfer rates are increased, mechanical issues, mainly noise and vibration, become critical. Rubber materials are extensively used in various machine design application, mainly for vibration/shock/noise control devices. Over the years an enormous effort has been put into developing procedures to provide properties of rubber components with complex shape and under pre-deformed state. In this paper, non-linear large deformations of a rubber mount for optical disk drive were investigated using the finite element method. A tension test of rubber material was performed, to calculate a strain energy function. According to the pre-deformed state, the variation of rubber mount stiffness were calculated and the reliability of numerical results were checked by compared with the measuring the deflection values. Also, the effects of the pre-deformed rubber mount on the system dynamic characteristics were investigated and the relation between the static stiffness variation of rubber mount and the natural frequence variation of system was discussed.

• The KIPS Transactions:PartD
• /
• v.14D no.7
• /
• pp.727-732
• /
• 2007

Most of previous work on indexing and searching time series focused on the similarity matching and retrieval of one-attribute time series. However, multimedia databases such as music, video need to handle the similarity search in multi-attribute time series. The limitation of the current similarity models for multi-attribute sequences is that there is no consideration for attributes' sequences. The multi-attribute sequences are composed of several attributes' sequences. Since the users may want to find the similar patterns considering attributes's sequences, it is more appropriate to consider the similarity between two multi-attribute sequences in the viewpoint of attributes' sequences. In this paper, we propose the similarity search method based on attributes's sequences in multi-attribute time series databases. The proposed method can efficiently reduce the search space and guarantees no false dismissals. In addition, we give preliminary experimental results to show the effectiveness of the proposed method.

• Journal of Information Management
• /
• v.31 no.4
• /
• pp.50-70
• /
• 2000

Since the contents of internet resources are beginning to include texts, images and sounds, different Web-based image search engines have been developed accordingly. It is a fact that these diversities of multimedia contents have made search process and retrieval of relevant information very difficult. The purpose of the study is to compare and evaluate its special features and performance of the existing image search engines in order to provide user help to select appropriate search engines. The study selected AV Photo Finder, Lycos MultiMedia, Amazing Picture Machine, Image Surfer, WebSeek, Ditto for comparison and evaluation because of their reputations of popularity among users of image search engines. The methodology of the study was to analyze previous related literature and establish criteria for the evaluation of image search engines. The study investigated characteristics, indexing methods, search capabilities, screen display and user interfaces of different search engines for the purpose of comparison of its performance. Finally, the study measured relative recall and precision ratios to evaluate their electiveness of retrieval under the experimental set up. Results of the comparative analysis in regard to its search performance are as follows. AV Photo Finder marked the highest rank among other image search engines. Ditto and WebSeek also showed comparatively high precision ratio. Lycos MultiMedia and Image Surfer follows after them. Amazing Picture Machine stowed the lowest in ranking.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.6 no.2
• /
• pp.35-44
• /
• 2016

MICE industry is emerging as a new growth engine recently. Most of the domestic MICE events are carried out at low cost on a small scale. The event organizers want to cut down on costs of prints such as brochures and other promotional printed materials, as well as the personnel costs for the simple guide job needed on site, which are generated repeatedly and wastefully. The existing mobile web has a defect that the participants can't easily earn the information in the fixed menu, but have to search by themselves wasting lots of time. Therefore, it is necessary to develop the solution enables providing information efficiently at low cost for short-term use during the events. In this study, we implemented specific total management system for exhibitions and convention using beacon. The information system for exhibitions and events using beacon can raise the management efficiency, and the digital brochure function based on CMS heightens the information retrieval ability and also reduces costs. Organizers can manage their event efficiently in a small exhibition and convention event by running an online website and operate a site management system by them selves.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.9
• /
• pp.93-101
• /
• 2014

Movie stories can be retrieved efficiently by analyzing a script, which is a blueprint of the movie. Although the movie script is described in the formatted structure of Final Draft, it is hard to restore the type without analyzing the story of the sentences since the scripts open on the website are mostly broken. For this purpose, it is necessary to develop and provide the web-based script analysis software so that users collaboratively and freely check and correct the errors in the results after automatically parsing the script. Hence, in this paper we suggest the structure of the web-based collaborative script analysis platform that enables users to modify and filter the type error of the script for high level of film data accumulation and performance evaluation for the implementation results is conducted. Through the experiment, accuracy of automatically parsing appears to be 64.95% and performance of modification by collaboration showed 99.58% of accuracy of parsing with errors mostly corrected after passing through 5 steps of modification.