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 New Bit-rate Converter for Considering Texture and Shape Information in MPEG4
Journal of Korea Multimedia Society, volume 3, issue 4, 2000, Pages 333~338
MPEG2(or some situations, MPEG is mostly used to change the raw image into the compressed bitstreams for digital image processing. Also these bitsreams are stored in computer for several applications such as multimedia area. Transmission channels have various capacities according to the application area, and the bitstreams stored in computer should be converted in order not to exceed the capacities of a transmission channel. So the problem is how to convert compressed bitstreams of a given bit-rate into compressed bitstreams of other bit-rates. Such a specific transcoding problem in this paper is referred to as bit-rate conversion. Several researches have been done on bit-rate conversion for the bitstreams compressed by MPEG. But the existing schemes are not suitable fort MPEG4 applications because it needs to transmit shape information( which is not necessary for MPEG2) as well as texture information in MPEG4 system. So we propose a new bit-rate converter which considers both texture and shape information.
Segmentation of MR Brain Image Using Scale Space Filtering and Fuzzy Clustering
Journal of Korea Multimedia Society, volume 3, issue 4, 2000, Pages 339~346
Medical image is analyzed to get an anatomical information for diagnostics. Segmentation must be preceded to recognize and determine the lesion more accurately. In this paper, we propose automatic segmentation algorithm for MR brain images using T1-weighted, T2-weighted and PD images complementarily. The proposed segmentation algorithm is first, extracts cerebrum images from 3 input images using cerebrum mask which is made from PD image. And next, find 3D clusters corresponded to cerebrum tissues using scale filtering and 3D clustering in 3D space which is consisted of T1, T2, and PD axis. Cerebrum images are segmented using FCM algorithm with its initial centroid as the 3D cluster's centroid. The proposed algorithm improved segmentation results using accurate cluster centroid as initial value of FCM algorithm and also can get better segmentation results using multi spectral analysis than single spectral analysis.
An Adaptive AEC Based on the Wavelet Transform Using M-channel Subband QMF Filter Banks
Journal of Korea Multimedia Society, volume 3, issue 4, 2000, Pages 347~355
This paper presents an adaptive AEC(acoustic echo canceller) based on the wavelet transform using M-channel subband QMF filter banks. The proposed algorithm improves the performance of AEC with a realtime process by a low complexity of wavelet transform filter banks, a subband processing and a orthogonality of wavelet subband filter. Adaptive filter coefficients of each subband are updated using LMS algorithm with a low complexity and a easy realization for a realtime processing and a reduction of hardware cost. For a input signal, a white Gaussian noise and a real speech signal with a environment noises are used for a performance estimation of the proposed algorithm. As a result of computer simulation, the proposed AEC has a low asymptotic error, a low computation complexity and a robust performance.
Past Block Matching Motion Estimation based on Multiple Local Search Using Spatial Temporal Correlation
Journal of Korea Multimedia Society, volume 3, issue 4, 2000, Pages 356~364
Block based fast motion estimation algorithm use the fixed search pattern to reduce the search point, and are based on the assumption that the error in the mean absolute error space monotonically decreases to the global minimum. Therefore, in case of many local minima in a search region we are likely to find local minima instead of the global minimum and highly rely on the initial search points. This situation is evident in the motion boundary. In this paper we define the candidate regions within the search region using the motion information of the neighbor blocks and we propose the multiple local search method (MLSM) which search for the solution throughout the candidate regions to reduce the possibilities of isolation to the local minima. In the MLSM we mark the candidate region in the search point map and we avoid to search the candidate regions already visited to reduce the calculation. In the simulation results the proposed method shows more excellent results than that of other gradient based method especially in the search of motion boundary. Especially, in PSNR the proposed method obtains similar estimate accuracy with the significant reduction of search points to that of full search.
Adaptive Image Restoration Using Local Characteristics of Degradation
Journal of Korea Multimedia Society, volume 3, issue 4, 2000, Pages 365~371
To restore image degraded by out-of-focus blur and additive noise, an iterative restoration is used. Acceleration parameter is usually applied equally to all over the image without considering the local characteristics of degraded images. As a result, the conventional methods are not effective in restoring severely degraded edge region and shows slow convergence rate. To solve this problem we propose an adaptive iterative restoration according to local degradation, in which the acceleration parameter has low value in flat region that is less degraded and high value in edge region that is more degraded. Through experiments, we verified that the proposed method showed better results with fast convergence rate, showed Visually better image in edge region and lower MSE than the conventional methods.
Fast Variable-size Block Matching Algorithm for Motion Estimation Based on Bit-pattern
Journal of Korea Multimedia Society, volume 3, issue 4, 2000, Pages 372~379
In this paper, we propose a fast variable-size block matching algorithm for motion estimation based on bit-pattern. Motion estimation in the proposed algorithm is performed after the representation of image sequence is transformed 8bit pixel values into 1bit ones depending on the mean value of search block, which brings a short searching time by reducing the computational complexity. Moreover, adaptive searching methods according to the motion information of the block make the procedure of motion estimation efficient by eliminating an unnecessary searching of low motion block and deepening a searching procedure in high motion block. Experimental results show that the proposed algorithm provides better performance-0.5dB PSNR improvement-than full search block matching algorithm with a fixed block size.
Corresponding Points Estimation of Motion Images by Orthogonal Function Expansion
Journal of Korea Multimedia Society, volume 3, issue 4, 2000, Pages 380~388
In computing the optical flow, Horn and Schunck's method which is a representative algorithm is based on differentiation. Therefore it is difficult to estimate the velocity for a large displacement by this algorithm. In this paper, we propose a method for estimating nonuniform motion from sequential images which is based on integral brightness constancy constraints. The equations which transform a source image to a target image are expressed as a function of the displacement field. If marginal effects can be neglected, the form of the transformation integral transform or orthogonal expansion can be determined from the expansion coefficients of the two images. The apparent displacement field is then computed iteratively by a projection method which utilities the functional derivatives of the linearized moment equations. We demonstrate that the performance of the orthogonal function transform on the data set of large motion.
The Study on an Using Effect of Head Mounted Display to the Body in Virtual Environments
Journal of Korea Multimedia Society, volume 3, issue 4, 2000, Pages 389~398
The focus of this study is to investigate how personal display system - Head Mounted Display(HMD) and VDU-affect to the body in virtual environments. This prediction was tested by a comparing of playing 3D games while wearing a HMD and monitoring a VDU for an hour. As quantitative measuring and analyzing tools, SSQ, RSSQ, pre and post posture stability test and vision test are used. The results showed that SSQ and RSSQ total score (TS) are related with the results of pre and post posture stability test and SSQ and RSSQ TS of HMD is higher than TS of VDU by one point five times. Especially, TS of MRG3C, having large field of view, has a possibility by two times of simulator sickness (SS). And in order to investigate the degree of SS regarding to the simulator control condition, two conditions, subjective-passive and subjective-active environments were compared. However, there was no significant difference between two environments. The repetition of the same environment has no effect to reduce the SS. Disorientation and oculomotor scores of the SSQ and RSSQ are higher than that of another symptoms. In addition, RSSQ score of strain/confusion is higher than that of nausea. Therefore, we assume that personal fear could possibly increase the simulator sickness in virtual environments.
Design and Implementation of Bandwidth Management Algorithm for Video Conference System
Journal of Korea Multimedia Society, volume 3, issue 4, 2000, Pages 399~406
There are sendee_based research and receiver_based research for dynamic adaptation to network congestion which arises from multicast video conference ; the former results in bandwidth waste of receivers who use high available bandwidth on account of average loss rate in transmission rate, the latter in short of the method that divides layers of available bandwidth of receivers dynamically. In order to do so, in this paper, we established two multicast groups divided into non-congestion status and congestion status according to receiver's network state, and implemented the bandwidth management algorithm which is designed for providing receivers with profitable qualities for available bandwidth by letting them choose each group dynamically in reference to loss rate. As a result, experiments proved that bandwidth waste problem was improved by receiver's dynamic choice according to loss rate.
Simulation of Efficient Flow Control for FAB of Semiconductor Manufacturing
Journal of Korea Multimedia Society, volume 3, issue 4, 2000, Pages 407~415
The ultimate goal of flow control in the semiconductor fabrication process, one of the most equipment-intensive and complex manufacturing process, is to reduce lead time and work in process. In this paper, we propose stand alone layout in the form of job shop using group technology to improve the Productivity and eliminate the inefficiency in FMS (flexible manufacture system). The performance of stand alone layout and in-line layout are analyzed and compared while varying number of device variable chanties. The analysis of in-line layout is obtained by examining its adoption in the memory products of semiconductor factory. The comparison is performed through simulation using ProSys; a window 95 based discrete system simulation software, as a tool for comparing performance of two proposed layouts. The comparison demonstrates that when the number of device variable change is small, in-line layout is more efficient in terms of production Quantity. However, as the number of device variable change is more than 14 times, stand alone layout prevails over in-line layout.
Improved Speed of Convergence in Self-Organizing Map using Dynamic Approximate Curve
Journal of Korea Multimedia Society, volume 3, issue 4, 2000, Pages 416~423
The existing self-organizing feature map of Kohonen has weakpoint that need too much input patterns in order to converse into the learning rate and equilibrium state when it trains. Making up for the current weak point, B.Bavarian suggested the method of that distributed the learning rate such as Gaussian function. However, this method has also a disadvantage which can not achieve the right self-organizing. In this paper, we proposed the method of improving the convergence speed and the convergence rate of self-organizing feature map converting the Gaussian function into dynamic approximate curve used in when trains the self-organizing feature map.
A Modified LVDS Interface Circuit and Coding Method for the LCD Driving System
Journal of Korea Multimedia Society, volume 3, issue 4, 2000, Pages 424~432
In this paper, we propose a new signaling method and circuits for interface between the host and LCD (Liquid Crystal Display) controller in the LCD system. The proposed circuits are allowed to transmit two data signals through modified-LVDS circuits and can reduce the operating frequency to a half. Then, we can solve EMI(Electro Magnetic Interference) problem and the power consumption by using differential signaling method. We have compared and analyzed the proposed method and the conventional methods in the power consumption and data rate. In addition, the proposed methods reduce hardware complexity significantly.