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 11, Issue 12 - Dec 2008
Volume 11, Issue 11 - Nov 2008
Volume 11, Issue 10 - Oct 2008
Volume 11, Issue 9 - Sep 2008
Volume 11, Issue 8 - Aug 2008
Volume 11, Issue 7 - Jul 2008
Volume 11, Issue 6 - Jun 2008
Volume 11, Issue 5 - May 2008
Volume 11, Issue 4 - Apr 2008
Volume 11, Issue 3 - Mar 2008
Volume 11, Issue 2 - Feb 2008
Volume 11, Issue 1 - Jan 2008
Selecting the target year
Bayesian Nonlinear Blind Channel Equalizer based on Gaussian Weighted MFCM
Han, Soo-Whan ; Park, Sung-Dae ; Lee, Jong-Keuk ;
Journal of Korea Multimedia Society, volume 11, issue 12, 2008, Pages 1625~1634
In this study, a modified Fuzzy C-Means algorithm with Gaussian weights (MFCM_GW) is presented for the problem of nonlinear blind channel equalization. The proposed algorithm searches for the optimal channel output states of a nonlinear channel based on received symbols. In contrast to conventional Euclidean distance in Fuzzy C-Means (FCM), the use of the Bayesian likelihood fitness function and the Gaussian weighted partition matrix is exploited in this method. In the search procedure, all possible sets of desired channel states are constructed by considering the combinations of estimated channel output states. The set of desired states characterized by the maxima] value of the Bayesian fitness is selected and updated by using the Gaussian weights. After this procedure, the Bayesian equalizer with the final desired states is implemented to reconstruct transmitted symbols. The performance of the proposed method is compared with those of a simplex genetic algorithm (GA), a hybrid genetic algorithm (GA merged with simulated annealing (SA):GASA), and a previously developed version of MFCM. In particular, a relative]y high accuracy and a fast search speed have been observed.
Evaluation of Volumetric Texture Features for Computerized Cell Nuclei Grading
Kim, Tae-Yun ; Choi, Hyun-Ju ; Choi, Heung-Kook ;
Journal of Korea Multimedia Society, volume 11, issue 12, 2008, Pages 1635~1648
The extraction of important features in cancer cell image analysis is a key process in grading renal cell carcinoma. In this study, we applied three-dimensional (3D) texture feature extraction methods to cell nuclei images and evaluated the validity of them for computerized cell nuclei grading. Individual images of 2,423 cell nuclei were extracted from 80 renal cell carcinomas (RCCs) using confocal laser scanning microscopy (CLSM). First, we applied the 3D texture mapping method to render the volume of entire tissue sections. Then, we determined the chromatin texture quantitatively by calculating 3D gray-level co-occurrence matrices (3D GLCM) and 3D run length matrices (3D GLRLM). Finally, to demonstrate the suitability of 3D texture features for grading, we performed a discriminant analysis. In addition, we conducted a principal component analysis to obtain optimized texture features. Automatic grading of cell nuclei using 3D texture features had an accuracy of 78.30%. Combining 3D textural and 3D morphological features improved the accuracy to 82.19%. As a comparative study, we also performed a stepwise feature selection. Using the 4 optimized features, we could obtain more improved accuracy of 84.32%. Three dimensional texture features have potential for use as fundamental elements in developing a new nuclear grading system with accurate diagnosis and predicting prognosis.
An Efficient Binarization Method for Vehicle License Plate Character Recognition
Yang, Xue-Ya ; Kim, Kyung-Lok ; Hwang, Byung-Kon ;
Journal of Korea Multimedia Society, volume 11, issue 12, 2008, Pages 1649~1657
In this paper, to overcome the failure of binarization for the characters suffered from low contrast and non-uniform illumination in license plate character recognition system, we improved the binarization method by combining local thresholding with global thresholding and edge detection. Firstly, apply the local thresholding method to locate the characters in the license plate image and then get the threshold value for the character based on edge detector. This method solves the problem of local low contrast and non-uniform illumination. Finally, back-propagation Neural Network is selected as a powerful tool to perform the recognition process. The results of the experiments i1lustrate that the proposed binarization method works well and the selected classifier saves the processing time. Besides, the character recognition system performed better recognition accuracy 95.7%, and the recognition speed is controlled within 0.3 seconds.
An Approach to 3D Object Localization Based on Monocular Vision
Jung, Sung-Hoon ; Jang, Do-Won ; Kim, Min-Hwan ;
Journal of Korea Multimedia Society, volume 11, issue 12, 2008, Pages 1658~1667
Reconstruction of 3D objects from a single view image is generally an ill-posed problem because of the projection distortion. A monocular vision based 3D object localization method is proposed in this paper, which approximates an object on the ground to a simple bounding solid and works automatically without any prior information about the object. A spherical or cylindrical object determined based on a circularity measure is approximated to a bounding cylinder, while the other general free-shaped objects to a bounding box or a bounding cylinder appropriately. For a general object, its silhouette on the ground is first computed by back-projecting its projected image in image plane onto the ground plane and then a base rectangle on the ground is determined by using the intuition that touched parts of the object on the ground should appear at lower part of the silhouette. The base rectangle is adjusted and extended until a derived bounding box from it can enclose the general object sufficiently. Height of the bounding box is also determined enough to enclose the general object. When the general object looks like a round-shaped object, a bounding cylinder that encloses the bounding box minimally is selected instead of the bounding box. A bounding solid can be utilized to localize a 3D object on the ground and to roughly estimate its volume. Usefulness of our approach is presented with experimental results on real image objects and limitations of our approach are discussed.
A Post-processing Technique for the Improvement of Color Blurring Using Modulations of Chroma AC Coefficients in DCT-coded Images
Lee, Sung-Hak ;
Journal of Korea Multimedia Society, volume 11, issue 12, 2008, Pages 1668~1675
In this paper, we propose a post-processing technique developed for the subjective improvement of color resolution in DCT-coded color images. The high frequency components caused by complex object parts are compressed and impaired through DCT-based image processing, so color distortions such as blurs in high saturated regions are observed. It's mainly due to the severe loss of color data as Cb and Cr. Generally, the activities of chroma elements in DCT domain correlate strongly with that of luminance as spatial frequency gets higher, and based on the relations between chroma and luma AC activities, we compensate destructed Cb, Cr coefficients using modifications from Y coefficients. Simulation results show that the proposed method enhances color resolution in high saturated region, and improves the visual quality.
Multi-view Human Recognition based on Face and Gait Features Detection
Nguyen, Anh Viet ; Yu, He Xiao ; Shin, Jae-Ho ; Park, Sang-Yun ; Lee, Eung-Joo ;
Journal of Korea Multimedia Society, volume 11, issue 12, 2008, Pages 1676~1687
In this paper, we proposed a new multi-view human recognition method based on face and gait features detection algorithm. For getting the position of moving object, we used the different of two consecutive frames. And then, base on the extracted object, the first important characteristic, walking direction, will be determined by using the contour of head and shoulder region. If this individual appears in camera with frontal direction, we will use the face features for recognition. The face detection technique is based on the combination of skin color and Haar-like feature whereas eigen-images and PCA are used in the recognition stage. In the other case, if the walking direction is frontal view, gait features will be used. To evaluate the effect of this proposed and compare with another method, we also present some simulation results which are performed in indoor and outdoor environment. Experimental result shows that the proposed algorithm has better recognition efficiency than the conventional sing]e view recognition method.
Design and Evaluation of a Hierarchical Service Management Method using Bloom Filters for Large MANETs
Bae, Ihn-Han ;
Journal of Korea Multimedia Society, volume 11, issue 12, 2008, Pages 1688~1696
We propose a hierarchical service management method using Bloom filters for large MANETs. In this paper, a MANET is comprised of logical grid hierarchy, and each mobile node within the lowest service region multicasts the Attenuated Bloom Filter (ABF) for services itself to other nodes within the region. To advertise and discovery a service efficiently, the server node of the lowest server region sends the Summary Bloom Filter (SBF) for the ABFs to the server node of upper server region. Each upper server has the set of SBFs for lower vicinity service regions. The traffic load of the proposed method is evaluated by an analytical model, and is compared with that of two alternative advertisement solutions: complete advertisement and no advertisement. As a result, we identify that the traffic load of the proposed method is much lower than that of two alternative advertisement solutions.
Analysis of the Capacity Region for Two-tier Spatial Diversified Wireless Mesh Networks
Torregoza, John Paul ; Choi, Myeong-Gil ; Hwang, Won-Joo ;
Journal of Korea Multimedia Society, volume 11, issue 12, 2008, Pages 1697~1705
Several studies made for wireless mesh networks aim to optimize the capacity for wireless networks. Aside from protocol improvements, researches were also done on the physical layer particularly on modulation techniques and antenna efficiency schemes. This paper is concerned with the capacity improvements derived from using spatial diversity with smart adaptive array antennas. The use of spatial diversity, which has been widely proposed for use in cellular networks in order to lessen frequency re-use, can be used in mesh networks both to minimize co-channel interference (CCI) and enable multiple transmissions. This paper aims to study the capacity region and bounds in using smart antennas for single-channel multi-radio systems in relation to the number of spatial diversity or sectors as defined by the beam angle
Traffic based Estimation of Optimal Number of Super-peers in Clustered P2P Environments
Kim, Ju-Gyun ; Lee, Jun-Soo ;
Journal of Korea Multimedia Society, volume 11, issue 12, 2008, Pages 1706~1715
In a super-peer based P2P network, the network is clustered and each cluster is managed by a special peer, which is called a super-peer. A Super-peer has information of all the peers in its cluster. This type of clustered P2P model is known to have efficient information search and less traffic load than unclustered P2P model. In this paper, we compute the message traffic cost incurred by peers' query, join and update actions within a cluster as well as between the clusters. With these values, we estimate the optimal number of super-peers that minimizes the traffic cost for the various size of super-peer based P2P networks.
Joint Scheduling and Rate Optimization in Multi-channel Multi-radio Wireless Networks with Contention-based MAC
Bui, Dang Quang ; Choi, Myeong-Gil ; Hwang, Won-Joo ;
Journal of Korea Multimedia Society, volume 11, issue 12, 2008, Pages 1716~1721
Currently, Wireless Networks have some nice characteristics such as multi-hop, multi-channel, multi-radio, etc but these kinds of resources are not fully used. The most difficulty to solve this issue is to solve mixed integer optimization. This paper proposes a method to solve a class of mixed integer optimization for wireless networks by using AMPL modeling language with CPLEX solver. The result of method is scheduling and congestion control in multi-channel multi-radio wireless networks.
A Study on the Improvement of Flat-based Routing Protocol in Sensor Network
Lee, Seok-Cheol ; Kim, Chang-Soo ;
Journal of Korea Multimedia Society, volume 11, issue 12, 2008, Pages 1722~1729
This paper describes the contents about the efficient routing technique for improvement of transmission in Wireless Sensor Networks. Existing flat-based routing protocols have several problems like data overlap and implosion. Gossiping Algorithm in WSN is able to reduce the overhead and transmit packets through already set up the path but it takes place the data delivery and problem of worst-case. In this paper, we try to solve two problems that are data delivery and worst-case by selecting neighbor nodes using RSSI and number of linkage. The proposed model is available to real-mote and we confirmed the improvement of the performance against existing models.
Joint Power and Rate Control for QoS Guarantees in Infrastructure-based Multi-hop Wireless Network using Goal Programming
Torregoza, John Paul ; Choi, Myeong-Gil ; Hwang, Won-Joo ;
Journal of Korea Multimedia Society, volume 11, issue 12, 2008, Pages 1730~1738
Quality of Service (QoS) Guarantees grant ways for service providers to establish service differentiation among subscribers. On the other hand, service subscribers are also assured the level of service they paid for. In addition, the efficient level of service quality can be selected according to the subscribers' needs thus ensuring efficient use of available bandwidth. While network utility optimization techniques assure certain QoS metrics, a number of situations exist where some QoS goals are not met. The optimality of the network parameters is not mandatory to guarantee specified QoS levels. This paper proposes a joint data rate and power control scheme that guarantees service contract QoS level to a subscriber using Goal Programming. In using goal programming, this paper focuses on finding the range of feasible solutions as opposed to solving for the optimal. In addition, in case no feasible solution is found, an acceptable compromised solution is solved.
A Method to Minimize Classification Rules Based on Data Mining and Logic Synthesis
Kim, Jong-Wan ;
Journal of Korea Multimedia Society, volume 11, issue 12, 2008, Pages 1739~1748
When we conduct a data mining procedure on sample data sources, several rules are generated. But some rules are redundant or logically disjoint and therefore they can be removed. We suggest a new rule minimization algorithm inspired from logic synthesis to improve comprehensibility and eliminate redundant rules. The method can merge several relevant rules into one based on data mining and logic synthesis without high loss of accuracy. In case of two or more rules are candidates to be merged, we merge the rules with the attribute having the lowest information gain. To show the proposed method could be a reasonable solution, we applied the proposed approach to a problem domain constructing user preferred ontology in anti-spam systems.
Single Pass Algorithm for Text Clustering by Encoding Documents into Tables
Jo, Tae-Ho ;
Journal of Korea Multimedia Society, volume 11, issue 12, 2008, Pages 1749~1757
This research proposes a modified version of single pass algorithm specialized for text clustering. Encoding documents into numerical vectors for using the traditional version of single pass algorithm causes the two main problems: huge dimensionality and sparse distribution. Therefore, in order to address the two problems, this research modifies the single pass algorithm into its version where documents are encoded into not numerical vectors but other forms. In the proposed version, documents are mapped into tables and the operation on two tables is defined for using the single pass algorithm. The goal of this research is to improve the performance of single pass algorithm for text clustering by modifying it into the specialized version.
Creating Method for Multi-Size Web View Based on Query Restructuring Rules
Shin, Sang-Gyu ; Kim, Tai-Suk ;
Journal of Korea Multimedia Society, volume 11, issue 12, 2008, Pages 1758~1764
In this paper, we propose query restructure method which realizes not only to present the result from database in Web page but also to adapt user's browsing environments. Recently, wireless PDA (Personal Digital Assistant) and portable phone and terminals equipped with Web browser become very popular. Various browsers would be required to create the HTML which adapt to the user's browsing environment. We propose an adaptive data presentation system which is an extension of SQL which creates HTML pages dynamically adapting to the size of screen. In our proposed method, the three basic rules for the layout conversion are provided and applying these rules, an efficient layout conversion technique optimized to user environment is proposed. Moreover, we propose a standard for converting layouts and a layout optimization for adaptive conversion of layouts.
Design of Hot-spot generator for inserting content-based interactive advertising on DMB broadcasting
Park, Tae-Jin ; Park, Se-Hyun ; Lim, Soon-Bum ; Choy, Yoon-Chul ;
Journal of Korea Multimedia Society, volume 11, issue 12, 2008, Pages 1765~1774
Due to recent increase of product placement(aka. PPL) in TV drama and entertainment program, the audience of these programs is exposed to the advertisement in the form of the props and backgrounds without discernment. Advancement in digital data broadcasting technology enabled advertisers to insert detailed information of the product or associated advertisement link into the content of the broadcast program as an interactive advertisement. With the interactive advertisement, the audience can focus on the content of the program and the advertiser can create an advertisement with a rich content through the interaction between the advertisement and the audience. It is possible because the interactive advertisement is dynamic advertisement behavior only activated by the audience's intention. In this research, we develop a Hot-spot generator to insert interactive advertisement in the DMB broadcast program. We also suggest dynamic Hot-spot generation technique that allows the Hot-spot object to follow not only the shape of the advertising object in the program, but also the movement of the object as the program progresses.