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 3, Issue 6 - Dec 2000
Volume 3, Issue 5 - Oct 2000
Volume 3, Issue 4 - Aug 2000
Volume 3, Issue 3 - Jun 2000
Volume 3, Issue 2 - Apr 2000
Volume 3, Issue 1 - Feb 2000
Selecting the target year
A Study on Flexible Attribude Tree and Patial Result Matrix for Content-baseed Retrieval and Browsing of Video Date.
Journal of Korea Multimedia Society, volume 3, issue 1, 2000, Pages 1~13
While various types of information can be mixed in a continuous video stream without any cleat boundary, the meaning of a video scene can be interpreted by multiple levels of abstraction, and its description can be varied among different users. Therefore, for the content-based retrieval in video data it is important for a user to be able to describe a scene flexibly while the description given by different users should be maintained consistently This paper proposes an effective way to represent the different types of video information in conventional database models such as the relational and object-oriented models. Flexibly defined attributes and their values are organized as tree-structured dictionaries while the description of video data is stored in a fixed database schema. We also introduce several browsing methods to assist a user. The dictionary browser simplifies the annotation process as well as the querying process of a user while the result browser can help a user analyze the results of a query in terms of various combinations of Query conditions.
Design and Implementation of the Educational System based on the Distributed Virtual Environment using VRML and EAI
Journal of Korea Multimedia Society, volume 3, issue 1, 2000, Pages 14~22
We have designed and implemented an educational system based on the distributed virtual environment. The developed system has a client-server architecture: the platform-independent server is implementes by Java machine and the client is composed of VRML, EAI, and general web browser. If a change occurs in this virtual environment, all connected users can perceive the updated environment immediately. the system maintains its virtual environment after it is modified by a user. Also, the system can accommodate many users by minimizing the information exchange. Since users can share multimedia information and virtual objects by overcoming the limitation of time and space, the educational effects can be progressed through the use of the developed system.
Automatic Face Extraction with Unification of Brightness Distribution in Candidate Region and Triangle Structure among Facial Features
Journal of Korea Multimedia Society, volume 3, issue 1, 2000, Pages 23~33
In this paper, we describe an algorithm which can extract human faces with natural pose from complex backgrounds. This method basically adopts the concept that facial region has the nearly same gray level for all pixels within appropriately scaled blocks. Based on the idea, we develop a hierarchial process that first, a block image data with pyramid structure of input image is generated, and some candidate regions for facial regions in the block image are Quickly determined, then finally the detailed facial features; organs are decided. To find the features easily, we introduce a local gray level transform which emphasizes dark and small regions, and estimate the geometrical triangle constraints among the facial features. The merit of our method is that we can be freed from the parameter assignment problem since the algorithm utilize a simple brightness computation, consequently robust systems not being depended on specific parameter values can be easily constructed.
An Algorithm for the Multi-view Image Improvement with the Resteicted Number of Images in Texture Extraction
Journal of Korea Multimedia Society, volume 3, issue 1, 2000, Pages 34~40
'[n this paper, we propose an efficient multi-view image coding algorithm which finds the optimal texture from a restricted number of multi-view image. The X-Y plane of the normalized object space is divided into the triangular patches. The depth of each node is determined by appling a block based disparity compensation method. Thereafter the texture of each patch is extracted by appling an affine transformation based disparity compensation method to the multi-view images. We reduced the number of images needed to determine the texture compared to traditional methods which use all the multi-view image in the texture extraction. The experimental results show that the SNR of images encoded by the proposed algorithm is better than that of images encoded by the traditional method by the approximately 0.2dB for the test sets of multi -view image called dragon, santa, city and kid. Image data recovered after encoding by the proposed method show a better visual results than after using traditional method.
A Design and Implementation of Product Search Support Agent based on the Behavior of Customers
Journal of Korea Multimedia Society, volume 3, issue 1, 2000, Pages 41~52
This paper introduces the design and implementation of product search support agent for an efficient Internet shopping. In existing shopping malls, electronic catalogs provide the product information by subject or keyword, or the buying information by purchasing history. This proposed product search support agent system is designed to analyze navigating patterns of customers, extract more effective buying information with regard to the current trend in customer navigating . In conclusion, this product search support agent can propose more suitable buying information to customers that he can be proposed to make purchases more efficiently.
Robust Digital Watermarking to JPEG Compression
Journal of Korea Multimedia Society, volume 3, issue 1, 2000, Pages 53~62
Digital watermarking has been considered as an important technique to protect the copyright of digital content. It is essential that a watermark embedded in a still or moving image resists against various attacks ranging from compression, filtering to cropping. In particular, as JPEG is a dominant still image compression standard for Internet applications, digital watermarking methods that are robust against the JPEG compression are especially required. Most digital watermarking methods proposed so far work by modulating pixels/coefficients without considering the quality level of JPEG, which renders watermarks readily removable. In this paper, we proposed a new digital watermarking method as follows. For providing the robustness against JPEG, the quality level of JPEG is used as parameter on watermarking so as to compute the loss of image caused by JPEG compression and we compute the difference of an original image resulted from JPEG compression. Also in proposed method, we compute the visual components that are derived from the information of edge within image and consideration of brightness discrimination which is one of human visual system's properties. Thus, we proposed new watermarking scheme that after constructing a watermark by considering the loss of image resulted from JPEG compression and visual components derived from the human visual system, the watermark is embedded into the image.
Design and Implementation of Distributed Collaborative Writing System for Engineering Design Process
Journal of Korea Multimedia Society, volume 3, issue 1, 2000, Pages 63~76
Most work done in CSCW (Computer Supported Collaborative Work) system has been targeted toward supporting the exchange of documents or messages among group members, and yet support for cognitive aspects such as group organization, division and merge of work, and work flow control. The objective of the study is to provide CSCW environment for the engineering design process such as CAD (Computer Aided Design) and CASE (Computer Aided Software Engineering). The proposed DCWA (Distributed Collaborative Writing Aid) system suggests a mechanism that unifies the group organization, work division, and work flow control in the CAO, CASE, and software simulation tool. In particular, CAD relates the group and work partition by providing expressing the relation of drawing object (e.g., binding, attachment, and proportional scaling) which is owned by different members of group, and CASE combining with the simulation tool supports the flexibility of the work flow control. Simulating the prototype before manu-facturing a product can reduce time and cost in development.
Local Model Checking for Verification of Real-Time Systems
Journal of Korea Multimedia Society, volume 3, issue 1, 2000, Pages 77~90
Real-Time verification is a procedure that verifies the correctness of specification related to requirement in time as well as in logic. One serious problem encountered in the verification task is that the state space grows exponentially owing to the unboundedness of time, which is termed the state space explosion problem. In this paper, we propose a real-time verification technique checking the correctness of specification by showing that a system model described in timed automata is equivalent to the characteristic of system property specified in timed modal-mu calculus. For this, we propose a local model checking method based on the value of the formula in initial state with constructing product graph concerned to only the nodes needed for verification process. Since this method does not search for every state of system model, the state space is reduced drastically so that the proposed method can be applied effectively to real-time system verification.
An Efficient Program Slicing Algorithm using Dynamic Control Information
Journal of Korea Multimedia Society, volume 3, issue 1, 2000, Pages 92~100
For the operation of the practical software systems, the development of new software, extension and modification phases of current software are successively needed through the new requirements added and their errors debugging detected. We need to understand current program exactly during a working serial jobs. When we'd like to extract the statements which influence the variable of specific statement of program, we generally analyze the program behavior through execution trace of program for the input values. It is important to compute dynamic program slice related to all statements that actually affect the value of a variable occurrence for a given program input and to develop techniques of its implementation. But traditional dynamic slicing techniques are inconvenient to make program execution history at the beginning implementation. In this paper, we propose a new improved algorithm which can produce program slice by use of dynamic control information and program slicing techniques except execution history file. Also we can find that the proposed program slicing approach is more efficient than the traditional program slicing algorithm on the practical testing environment.