Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of Korea Multimedia Society
Journal Basic Information
Journal DOI :
Korea Multimedia Society
Editor in Chief :
Volume & Issues
Volume 10, Issue 12 - Dec 2007
Volume 10, Issue 11 - Nov 2007
Volume 10, Issue 10 - Oct 2007
Volume 10, Issue 9 - Sep 2007
Volume 10, Issue 8 - Aug 2007
Volume 10, Issue 7 - Jul 2007
Volume 10, Issue 6 - Jun 2007
Volume 10, Issue 5 - May 2007
Volume 10, Issue 4 - Apr 2007
Volume 10, Issue 3 - Mar 2007
Volume 10, Issue 1 - Jan 2007
Selecting the target year
Multi-query Indexing Technique for Efficient Query Processing on Stream Data in Sensor Networks
Lee, Min-Soo ; Kim, Yearn-Jeong ; Yoon, Hye-Jung ;
Journal of Korea Multimedia Society, volume 10, issue 11, 2007, Pages 1367~1383
A sensor network consists of a network of sensors that can perform computation and also communicate with each other through wireless communication. Some important characteristics of sensor networks are that the network should be self administered and the power efficiency should be greatly considered due to the fact that it uses battery power. In sensor networks, when large amounts of various stream data is produced and multiple queries need to be processed simultaneously, the power efficiency should be maximized. This work proposes a technique to create an index on multiple monitoring queries so that the multi-query processing performance could be increased and the memory and power could be efficiently used. The proposed SMILE tree modifies and combines the ideas of spatial indexing techniques such as k-d trees and R+-trees. The k-d tree can divide the dimensions at each level, while the R+-tree improves the R-tree by dividing the space into a hierarchical manner and reduces the overlapping areas. By applying the SMILE tree on multiple queries and using it on stream data in sensor networks, the response time for finding an indexed query takes in some cases 50% of the time taken for a linear search to find the query.
Data Stream Storing Techniques for Supporting Hybrid Query
Shin, Jae-Jyn ; You, Byeong-Seob ; Eo, Sang-Hun ; Lee, Dong-Wook ; Bae, Hae-Young ;
Journal of Korea Multimedia Society, volume 10, issue 11, 2007, Pages 1384~1397
This paper proposes fast storage techniques for hybrid query of data streams. DSMS(Data Stream Management System) have been researched for processing data streams that have busting income. To process hybrid query that retrieve both current incoming data streams and past data streams data streams have to be stored into disk. But due to fast input speed of data stream and memory and disk space limitation, the main research is not about querying to stored data streams but about querying to current incoming data streams. Proposed techniques of this paper use circular buffer for maximizing memory utility and for make non blocking insertion possible. Data in a disk is compressed to maximize the number of data in the disk. Through experiences, proposed technique show that bursting insertion is stored fast.
Implementation of Music Information Retrieval System using YIN Pitch Information
Suk, Soo-Young ; Chung, Hyun-Yeol ;
Journal of Korea Multimedia Society, volume 10, issue 11, 2007, Pages 1398~1406
Providing natural and efficient access to the fast growing multimedia information is a critical aspect for content-based information system. Query by humming system allows the user to find a song by humming part of the tune form music database. Conventional music information retrieval systems use a high precision pitch extraction method. However, it is very difficult to extract true pitch perfectly. So, In this paper, we propose to use YIN parameter with applying the reliability to reduce the pitch extraction errors. And we describes developed music information retrieval method based on a query by humming system which uses reliable feature extraction. Developed system is based on a continuous dynamic programming algorithm with features including pitch, duration and energy along with their confidence measures. The experiment showed that the proposed method could reduce the errors of the top-10 7.2% and the top-1 9.1% compared with the cepsturm based multiple pitch candidate. The overall retrieval system achieved 92.8% correct retrieval in the top-10 rank list on a database of 155 songs.
Algorithm for Arbitrary Point Tracking using Pyramidal Optical Flow
Lee, Jae-Kwang ; Park, Chang-Joon ;
Journal of Korea Multimedia Society, volume 10, issue 11, 2007, Pages 1407~1416
This paper describes an algorithm for arbitrary point tracking using pyramidal optical flow. The optical flow is calculated based on the Lucas-Kanade's optical flow estimation in this paper. The image pyramid is employed to calculate a big motion while being sensitive to a small motion. Furthermore, a rectification process is proposed to reduce the error which is increased as it goes down to the lower level of the image pyramid. The accuracy of the optical flow estimation was increased by using some constraints and sub-pixel interpolation of the optical flow and this makes our algorithm to track points in which they do not have features such as edges or corners. The proposed algorithm is implemented and primary results are shown in this paper.
Improvement of Image Scrambling Scheme Using DPSS(Discrete Prolate Spheroidal Sequence) and Digital Watermarking Application
Lee, Hye-Joo ; Nam, Je-Ho ;
Journal of Korea Multimedia Society, volume 10, issue 11, 2007, Pages 1417~1426
As one of schemes to protect multimedia content. it is the selective encryption scheme to encrypt partially multimedia content. Compared AES(advanced encryption standard) of traditional encryption, the selective encryption scheme provides low security but is applicable to applications of multimedia content not to require high secrecy. In this paper, we improve the image scrambling scheme proposed by Van De Ville which scrambles an image without bandwidth expansion using DPSS(discrete prolate spheroidal sequence) to make it more secure based on Shujun's research which verifies the secrecy of Van De Ville's scheme. The proposed method utilizes an orthonormalized random matrix instead of Hadamard matrix for secret matrix and to add it for providing high secrecy against statistical attack or known-plaintext attack using some statistical property or estimate of secret matrix from a scrambled image. The experimental results show that the proposed method is more secure than the existing scheme. In addition, we show that the proposed method can be applied to access control or copy control of watermarking application.
Digital Video Watermarking Based on SPIHT Coding Using Motion Vector Analysis
Kwon, Seong-Geun ; Hwang, Eui-Chang ; Lee, Mi-Hee ; Jeong, Tai-Il ; Kwon, Ki-Ryong ;
Journal of Korea Multimedia Society, volume 10, issue 11, 2007, Pages 1427~1438
Video watermarking technologies are classified into types of four kinds. The first type is to embed the watermark into a raw video signal and to code the watermarked video signal. Most of video watermarking technologies fall into the category of this type. The second type is to apply watermarking to the coding process, such as block DCT and quantization. The third is to directly embed the watermark into the compressed bitstream itself. Generally, it is referred as labelling rather than watermarking. Finally, the fourth is to embed the water mark into MPEG motion vector. This type has the difficulty in real-time process because of the high complexity and has the blocking effects because of DCT-based on coder. In this paper, we proposed the digital video watermarking that embed the watermark in SPIHT video code for I-frame using motion vector analysis. This method can remove the blocking effect occurred at the DCT-based on coder and obtain video data that has progressive transmission property. The proposed method is to select the region for the watermark embedding in I frame using motion vector estimated from the previous P or B frame. And then, it is to perform DWT and embed the watermark based on HVS into the wavelet coefficients in the same subband of DWT as the motion vector direction. Finally, the watermarked video bitstream is obtained by the SPIHT coder. The experimental results verified that the proposed method has the invisibility from the objective and subjective image quality and the robustness against the various SPIHT compression and MPEG re-code.
An Adaptive and Fast Motion Estimation Algorithm using Initial Matching Errors
Jeong, Tae-Il ;
Journal of Korea Multimedia Society, volume 10, issue 11, 2007, Pages 1439~1445
In this paper, we propose a fast motion estimation algorithm using initial matching errors by sorting square sub-blocks to find complex sub-block area adaptively based on partial calculation of SAD(sum of absolute difference) while keeping the same prediction quality compared with the PDE(partial distortion elimination) algorithm. We reduced unnecessary calculations with square sub-block adaptive matching scan based initial SAD calculation of square sub-block in each matching block. Our algorithm reduces about 45% of computations for block matching error compared with conventional PDE(partial distortion elimination) algorithm without any degradation of prediction quality, and for algorithm will be useful to real-time video coding applications using MPEG-4 AVC or MPEG-2.
A Study on SoC Platform Design Supporting Dynamic Cooperation between Hardware and Software Modules
Lee, Dong-Geon ; Kim, Young-Mann ; Tak, Sung-Woo ;
Journal of Korea Multimedia Society, volume 10, issue 11, 2007, Pages 1446~1459
This paper presents and analyzes a novel technique that makes it possible to improve the performance of low-end embedded systems through SoC(System-on-a-Chip) platform supporting dynamic cooperation between hardware and software modules. Traditional embedded systems with limited hardware resources have the poor capability of carrying out multi-tasking jobs including complex calculations. The proposed SoC platform, which provides dynamic cooperation between hardware and software modules, decomposes a single specific system into tasks for given system requirements. Additionally, we also propose a technique for efficient communication and synchronization between hardware and software tasks in cooperation with each other. Several experiments are conducted to illustrate the application and efficiency of the proposed SoC platform. They show that the proposed SoC platform outperforms the traditional embedded system, where only software tasks run, as the number of memory access is increased and the system become more complex.
Design of a Binding for the performance Improvement of 3D Engine based on the Embedded Mobile Java Environment
Kim, Young-Ouk ; Roh, Young-Sup ;
Journal of Korea Multimedia Society, volume 10, issue 11, 2007, Pages 1460~1471
A 3-Dimensional engine in a mobile embedded device is divided into a C-based OpenGL/ES and a Java-based JSR184 which interprets and executes a byte code in a real-time. In these two standards, the JSR184 supporting Java objects uses more processor resources than an OpenGL/ES and thus has a constraint when it is used in an embedded device with a limited computing power. On the other hand, 3-Dimensional contents employed in existing personal computer are created by utilizing advantages of Java and secured numerous users in European market, due to the good quality in contents and extensive service in a commercial network, GSM. Because of the reason, a mobile embedded device used in a GSM network needs a JSR184 which can provide an existing Java-based 3-Dimensional contents without extra conversion processes, but the current version of Java-based 3-Dimensional engine has drawbacks in application to commercial products because it requires more computing power than the mobile embedded device. This paper proposes a binding technique with the advantages of Java objects to improve a processing speed of 3-Dimensional contents in limited resources of a mobile embedded device. The technique supports a JSR184 standard interface in the upper layer to utilize 3-Dimensional contents using Java, employs a different code-conversion language, KNI(Kilo Native Interface), in the middle layer to interface between OpenGL/ES and JSR184, and embodies an OpenGL/ES standard in the lower layer. The validity of the binding technique is demonstrated through a simulator and a FPGA embedding an ARM.
Development of the Integrated Loader/Linker System for the Java Class File and .NET PE File.
Ko, Kwang-Man ;
Journal of Korea Multimedia Society, volume 10, issue 11, 2007, Pages 1472~1482
The integrated loader/linker plays a very important role in creating all types of information and ensuring information integrity needed for substantial executions by receiving a PE input file, an intermediate representation of a java class file or a .NET environment, thereby allowing for saving information optimized for verification, resolution, initialization, and execution. This paper proposes a loader/linker system for integrating a java class file and .NET-based PE file. As a means of implementing the loader/linker system, a new execution file format(*.evm) and a memory format were designed to save all information of Java class files and .NET-based PE files, and enable the information in those files to be executed in a JVM or .NET environment through the use of saved execution information.
Implementation of a Library Function of Scanning RSSI and Indoor Positioning Modules
Yim, Jae-Geol ; Jeong, Seung-Hwan ; Shim, Kyu-Bark ;
Journal of Korea Multimedia Society, volume 10, issue 11, 2007, Pages 1483~1495
Thanks to IEEE 802.11 technique, accessing Internet through a wireless LAN(Local Area Network) is possible in the most of the places including university campuses, shopping malls, offices, hospitals, stations, and so on. Most of the APs(access points) for wireless LAN are supporting 2.4 GHz band 802.11b and 802.11g protocols. This paper is introducing a C# library function which can be used to read RSSIs(Received Signal Strength Indicator) from APs. An LBS(Location Based Service) estimates the current location of the user and provides useful user's location-based services such as navigation, points of interest, and so on. Therefore, indoor, LBS is very desirable. However, an indoor LBS cannot be realized unless indoor position ing is possible. For indoor positioning, techniques of using infrared, ultrasound, signal strength of UDP packet have been proposed. One of the disadvantages of these techniques is that they require special equipments dedicated for positioning. On the other hand, wireless LAN-based indoor positioning does not require any special equipments and more economical. A wireless LAN-based positioning cannot be realized without reading RSSIs from APs. Therefore, our C# library function will be widely used in the field of indoor positioning. In addition to providing a C# library function of reading RSSI, this paper introduces implementation of indoor positioning modules making use of the library function. The methods used in the implementation are K-NN(K Nearest Neighbors), Bayesian and trilateration. K-NN and Bayesian are kind of fingerprinting method. A fingerprint method consists of off-line phase and realtime phase. The process time of realtime phase must be fast. This paper proposes a decision tree method in order to improve the process time of realtime phase. Experimental results of comparing performances of these methods are also discussed.
A Design and Implementation of RSS Data Collecting Engine based on Web 2.0
Kang, Pil-Gu ; Kim, Jae-Hwan ; Lee, Sang-Jun ; Chae, Jin-Seok ;
Journal of Korea Multimedia Society, volume 10, issue 11, 2007, Pages 1496~1506
The environment of web service has changed a great deal due to the progress of internet technology and positive participation of users. The established web service is static and passive, but the recent web service is becoming dynamic and active. Web 2.0 reflects current web service change well. The primary feature of web 2.0 is positive participation of users. Since the size of generated information is becoming larger, it is highly required to share the information fast and correctly. The technology to satisfy this need is web syndication and tagging in web 2.0. The web syndication makes feeds for another site or users to receive the content of web site. In addition, the tagging is the kernel of a information. Many internet users share rapidly the information through tag search. In this paper, we propose the efficient technique to improve the web 2.0 technology such as web syndication and tagging by using the data collection engine. Data collection engine has stored in a database, a user's Web site to use the information. and it has a user's Web site with access to updated data to collect. The experimental results show that our approach can improve the search speed up to 3.14 times better than the existing method and reduce the size of data up to 66% for building associated tags.
A Video Image Design Analysis with Emphasis on Colors in Video Art
Cho, Hyang ;
Journal of Korea Multimedia Society, volume 10, issue 11, 2007, Pages 1507~1515
Many people have already mentioned the works of the Video Art. This is the age, video image is not a particular thing. We should not follow easily those things having been studied by a lot of people again. However, nowadays after he passed away, they voice their opinions that we should reanalyze his works properly. Therefore, it may be not new to make video image a subject of discussion. However, this study intends to look into the works of Paik Nam June once again from a new aspect that no preceding researchers did not pay much attention. It will be the main theme of this study to try to discover the expansion of nature and educational effects through technology by analyzing his works from another aspect as one person who lives in the age that video image is no more special.
A Memory-based Learning using Repetitive Fixed Partitioning Averaging
Yih, Hyeong-Il ;
Journal of Korea Multimedia Society, volume 10, issue 11, 2007, Pages 1516~1522
We had proposed the FPA(Fixed Partition Averaging) method in order to improve the storage requirement and classification rate of the Memory Based Reasoning. The algorithm worked not bad in many area, but it lead to some overhead for memory usage and lengthy computation in the multi classes area. We propose an Repetitive FPA algorithm which repetitively partitioning pattern space in the multi classes area. Our proposed methods have been successfully shown to exhibit comparable performance to k-NN with a lot less number of patterns and better result than EACH system which implements the NGE theory.
A Study on the Reuse of DVB EPG Data for ATSC EPG
Kim, Young-Hoon ; Paik, Doo-Won ;
Journal of Korea Multimedia Society, volume 10, issue 11, 2007, Pages 1523~1529
In this paper, we describe a method which reuses DVB EPG informations for the generation of ATSC EPG. For the efficient reuse, we analyze the differences and similarities of ATSC and DVB EPG informations, classify the informations reusable and convert DVB SI to ATSC PSIP. We implemented a system for the conversion and tested the validity of the system using broadcasting test equipments.
Implementation of the Speech Emotion Recognition System in the ARM Platform
Oh, Sang-Heon ; Park, Kyu-Sik ;
Journal of Korea Multimedia Society, volume 10, issue 11, 2007, Pages 1530~1537
In this paper, we implemented a speech emotion recognition system that can distinguish human emotional states from recorded speech captured by a single microphone and classify them into four categories: neutrality, happiness, sadness and anger. In general, a speech recorded with a microphone contains background noises due to the speaker environment and the microphone characteristic, which can result in serious system performance degradation. In order to minimize the effect of these noises and to improve the system performance, a MA(Moving Average) filter with a relatively simple structure and low computational complexity was adopted. Then a SFS(Sequential Forward Selection) feature optimization method was implemented to further improve and stabilize the system performance. For speech emotion classification, a SVM pattern classifier is used. The experimental results indicate the emotional classification performance around 65% in the computer simulation and 62% on the ARM platform.