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 8, Issue 12 - Dec 2005
Volume 8, Issue 11 - Nov 2005
Volume 8, Issue 10 - Oct 2005
Volume 8, Issue 9 - Sep 2005
Volume 8, Issue 8 - Aug 2005
Volume 8, Issue 7 - Jul 2005
Volume 8, Issue 6 - Jun 2005
Volume 8, Issue 5 - May 2005
Volume 8, Issue 4 - Apr 2005
Volume 8, Issue 3 - Mar 2005
Volume 8, Issue 2 - Feb 2005
Volume 8, Issue 1 - Jan 2005
Selecting the target year
Bayesian Image Reconstruction Using Edge Detecting Process for PET
Um, Jong-Seok ;
Journal of Korea Multimedia Society, volume 8, issue 12, 2005, Pages 1565~1571
Images reconstructed with Maximum-Likelihood Expectation-Maximization (MLEM) algorithm have been observed to have checkerboard effects and have noise artifacts near edges as iterations proceed. To compensate this ill-posed nature, numerous penalized maximum-likelihood methods have been proposed. We suggest a simple algorithm of applying edge detecting process to the MLEM and Bayesian Expectation-Maximization (BEM) to reduce the noise artifacts near edges and remove checkerboard effects. We have shown by simulation that this algorithm removes checkerboard effects and improves the clarity of the reconstructed image and has good properties based on root mean square error (RMS).
3D Mesh Model Watermarking Based on Projection
Lee Suk-Hwan ; Kwon Ki-Ryong ;
Journal of Korea Multimedia Society, volume 8, issue 12, 2005, Pages 1572~1580
The common requirements for watermarking are usually invisibility, robustness, and capacity. We proposed the watermarking for 3D mesh model based on projection onto convex sets for invisibility and robustness among requirements. As such, a 3D mesh model is projected alternatively onto two convex sets until it converge a point. The robustness convex set is designed to be able to embed watermark into the distance distribution of vertices. The invisibility convex set is designed for the watermark to be invisible based on the limit range of vertex movement. The watermark can be extracted using the decision values and index that the watermark was embedded with. Experimental results verify that the watermarked mesh model has both robustness against mesh simplification, cropping, affine transformations, and vertex randomization and invisibility.
Efficient Control for the Distortion Incurred by Dropping DCT Coefficients in Compressed Domain
Kim Jin-Soo ; Yun Mong-Han ; Park Jong-Kab ;
Journal of Korea Multimedia Society, volume 8, issue 12, 2005, Pages 1581~1588
The primary goal of this paper is to facilitate the rate-distortion control in compressed domain, without introducing a full decoding and re-encoding system in pixel domain. For this aim, the error propagation behavior over several frame-sequences due to DCT coefficients-drop is investigated on the basis of statistical and empirical properties. Then, such properties are used to develop a simple estimation model for the CD distortion accounting for the characteristics of the underlying coded-frame. Experimental results show that the proposed model allows us to effectively control rate-distortions into coded-frames over different kinds of video sequences.
An On-line Algorithm to Search Minimum Total Error for Imprecise Real-time Tasks with 0/1 Constraint
Song Gi-Hyeon ;
Journal of Korea Multimedia Society, volume 8, issue 12, 2005, Pages 1589~1596
The imprecise real-time system provides flexibility in scheduling time-critical tasks. Most scheduling problems of satisfying both 0/1 constraint and timing constraints, while the total error is minimized, are NP complete when the optional tasks have arbitrary processing times. Liu suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on uniprocessors for minimizing the total error. Song et al suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on multiprocessors for minimizing the total error. But, these algorithms are all off-line algorithms. On the other hand, in the case of on line scheduling, Shih and Liu proposed the NORA algorithm which can find a schedule with the minimum total error for a task system consisting solely of on-line tasks that are ready upon arrival. But, for the task system with 0/1 constraint, it has not been known whether the NORA algorithm can be optimal or not in the sense that it guarantees all mandatory tasks are completed by their deadlines and the total error is minimized. So, this paper suggests an optimal algorithm to search minimum total error for the imprecise on-line real-time task system with 0/1 constraint. Furthermore, the proposed algorithm has the same complexity, O(N log N), as the NORA algorithm, where N is the number of tasks.
Practical Patching for Efficient Bandwidth Sharing in VOD Systems
Ha Soak-Jeong ;
Journal of Korea Multimedia Society, volume 8, issue 12, 2005, Pages 1597~1604
Recursive Patching is an efficient multicast technique for large-scale video on demand systems and recursively shares existing video streams with asynchronous clients. When Recursive Patching initiates a transition stream, it always makes a transition stream have additional data for the worst future request. In order to share a VOD server's limited network bandwidth efficiently, this paper proposes Practical Patching that removes the unnecessary data included in the transition stream. The proposed Practical Patching dynamically expands ongoing transition streams when a new request actually arrives at the server. As a result, the transition streams never have unnecessary data. Simulation result confirmed that the proposed technique is better than Recursive Patching in terms of service latency and defection rate.
Simulation-based Design Verification for High-performance Computing System
Jeong Taikyeong T. ;
Journal of Korea Multimedia Society, volume 8, issue 12, 2005, Pages 1605~1612
This paper presents the knowledge and experience we obtained by employing multiprocessor systems as a computer simulation design verification to study high-performance computing system. This paper also describes a case study of symmetric multiprocessors (SMP) kernel on a 32 CPUs CC-NUMA architecture using an actual architecture. A small group of CPUs of CC-NUMA, high-performance computer system, is clustered into a processing node or cluster. By simulating the system design verification tools; we discussed SMP OS kernel on a CC-NUMA multiprocessor architecture performance which is
of the total execution time and remote memory access latency is occupied
of the OS time. In this paper, we demonstrated our simulation results for multiprocessor, high-performance computing system performance, using simulation-based design verification.
Distance Based Dynamic Probabilistic Broadcasting in Ad Hoc Wireless Networks
Kim Jae-Soo ; Kim Jeong-Hong ;
Journal of Korea Multimedia Society, volume 8, issue 12, 2005, Pages 1613~1622
Broadcasting is fundamental and effective data dissemination mechanism for route discovery, address resolution, and many other network services in mobile ad hoc networks. Although many approaches for broadcasting have been proposed to minimize the number of retransmissions, none of them guarantee the best-suited bounds of retransmissions. Appropriate use of probabilistic method can lower the chance of contention and collision among neighboring nodes, so that it reduces the number of rebroadcasts. In this paper, we propose a probabilistic approach that dynamically adjusts the rebroadcasting probability according to the distance between the sender and the receiver. While the rebroadcast probabilities of a mobile node close to sender will be set lower, the rebroadcast probabilities of a mobile node far away from sender wi1l be set to higher, The rebroadcast probability of a node wi1l be set according to the distance from sender. We evaluate the performance of proposed approach by comparing it with flooding as well as a fixed probabilistic broadcast approach. Simulation results showed that the performance of proposed scheme outperforms by about
than flooding scheme and outperforms by about
than fixed probabilistic scheme.
Performance Evaluation of AMC in Clustered OFDM System
Cho, Ju-Phil ;
Journal of Korea Multimedia Society, volume 8, issue 12, 2005, Pages 1623~1630
Adaptive modulation and coding (AMC), which has a number of variation levels in accordance with the fading channel variation, is a promising technique for communication systems. In this paper, we present an AMC method using the cluster in OFDM system for bandwidth efficiency and performance improvement. The AMC schemes applied into each cluster or some clusters are determined by the minimum or the average SNR value among all the sub carriers within the corresponding cluster. It is important to find the optimal information on cluster because AMC performance can be varied according to the number and position of cluster. It is shown by computer simulation that the AMC method outperforms the fixed modulation in terms of bandwidth efficiency and its performance can be determined by the position and number of clusters.
Parameter Estimations of ML Test Based Decoders for Perceptually Watermarked Images
Lee, Jin-Geol ;
Journal of Korea Multimedia Society, volume 8, issue 12, 2005, Pages 1631~1637
Based on the generalized Gaussian pdf of DCT coefficients of images, Hernandez et al. propose the ML test applied watermark decoder. For images with watermarks shaped by the visibility thresholds of DCT coefficients and the luminance masking of human visual system, they conclude that the ML test with an appropriately chosen parameter associated with the pdf of DCT coefficients outperforms the correlation based decoder. In this paper, the parameter is estimated using various methods including a novel one for watermarks shaped by the visibility thresholds of DCT coefficients and the luminance masking as Hernandez et al. did and with the contrast masking added, and its effect on performance is compared.
Practical Revision for Implementing the Distributing Security-Mediated PKI
Yang Jong-Phil ; Shim Mi-Sun ; Rhee Kyung Hyune ;
Journal of Korea Multimedia Society, volume 8, issue 12, 2005, Pages 1638~1648
The SEM approach to PKl offers several advantages, such as immediate revocation of users' signing ability without CRLs and compatibility with the standard RSA. However, it has a weakness against denial of service attack caused by breaking down or being compromised. G. Vanrenen et al. proposed a distributed SEM approach to overcome the weaknesses. However, it does not provide the desirable properties such as instant availability and immunity against denial of service attack, due to inadequate usage of threshold cryptography and proactive secret sharing. In this paper, we point out its structural contradictions and propose a modified version of distributed SEM approach.
A Fast Implementation of JPEG and Its Application to Multimedia Service in Mobile Handset
Jeong Gu-Min ; Jung Doo-Hee ; Na Seung-Won ; Lee Yang-Sun ;
Journal of Korea Multimedia Society, volume 8, issue 12, 2005, Pages 1649~1657
In this paper, a fast implementation of JPEG is discussed and its application to multimedia service is presented for mobile wireless internet. A fast JPEG player is developed based on several fast algorithms for mobile handset. In the color transformation, RCT is adopted instead of ICT for JPEG source. For the most time-consuming DCT part, the binDCT can reduce the decoding time. In upsampling and RGB conversion, the transformation from YCbCr to RGB 16 bit is made at one time. In some parts, assembly language is applied for high-speed. Also, an implementation of multimedia in mobile handset is described using MJPEG (Motion JPEG) and QCELP(Qualcomm Code Excited Linear Prediction Coding). MJPEG and QCELP are used for video and sound, which are synchronized in handset. For the play of MJPEG, the decoder is implemented as a S/W upon the MSM 5500 baseband chip using the fast JPEG decoder. For the play of QCELP, the embedded QCELP player in handset is used. The implemented multimedia player has a fast speed preserving the image quality.
Translation Java Bytecode to EVM SIL Code for Embedded Virtual Machines
Lee, Yang-Sun ; Park, Jin-Ki ;
Journal of Korea Multimedia Society, volume 8, issue 12, 2005, Pages 1658~1668
This paper presents the bytecode-to-SIL translator which enables the execution of the java program in EVM(Embedded Virtual Machine) environment without JVM(java Virtual Machine), translating bytecodes produced by compiling java programs into SIL(Standard Intermediate Language) codes. EVM, what we are now developing, is a virtual machine solution that can download and execute dynamic application programs written in sequential languages like C language as well as object oriented languages such as C#, Java, etc. EVM is a virtual machine mounted on embedded systems such as mobile device, set-top box, or digital TV, and converts the application program into SIL, an assembly language symbolic form, and execute it. SIL is a virtual machine code for embedded systems, based on the analysis of existing virtual machine codes such as bytecode, MSIL, etc. SIL has such features as to accommodate various programming languages, and in particularly has an operation code set to accept both object-oriented languages and sequential languages. After compiling, a program written in java language is converted to bytecode, and also executed by JVM platform but not in other platform such as .NET, EVM platform. For this reason, we designed and implemented the bytecode-to-SIL translator system for programs written in java language to be executed in the EVM platform without JVM. This work improves the execution speed of programs, enhances the productivity, and provides an environment for programmers to execute application programs at various platforms.