Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
International Journal of Contents
Journal Basic Information
Journal DOI :
The Korea Contents Association
Editor in Chief :
Volume & Issues
Volume 3, Issue 4 - Dec 2007
Volume 3, Issue 3 - Sep 2007
Volume 3, Issue 2 - Jun 2007
Volume 3, Issue 1 - Mar 2007
Selecting the target year
Efficient Face Recognition using Low-Dimensional PCA: Hierarchical Image & Parallel Processing
Song, Young-Jun ; Kim, Young-Gil ; Kim, Kwan-Dong ; Kim, Nam ; Ahn, Jae-Hyeong ;
International Journal of Contents, volume 3, issue 2, 2007, Pages 1~5
DOI : 10.5392/IJoC.2007.3.2.001
This paper proposes a technique for principal component analysis (PCA) to raise the recognition rate of a front face in a low dimension by hierarchical image and parallel processing structure. The conventional PCA shows a recognition rate of less than 50% in a low dimension (dimensions 1 to 6) when used for facial recognition. In this paper, a face is formed as images of 3 fixed-size levels: the 1st being a region around the nose, the 2nd level a region including the eyes, nose, and mouth, and the 3rd level image is the whole face. PCA of the 3-level images is treated by parallel processing structure, and finally their similarities are combined for high recognition rate in a low dimension. The proposed method under went experimental feasibility study with ORL face database for evaluation of the face recognition function. The experimental demonstration has been done by PCA and the proposed method according to each level. The proposed method showed high recognition of over 50% from dimensions 1 to 6.
Phantom Protection Method for Multi-dimensional Index Structures
Lee, Seok-Jae ; Song, Seok-Il ; Yoo, Jae-Soo ;
International Journal of Contents, volume 3, issue 2, 2007, Pages 6~17
DOI : 10.5392/IJoC.2007.3.2.006
Emerging modem database applications require multi-dimensional index structures to provide high performance for data retrieval. In order for a multi-dimensional index structure to be integrated into a commercial database system, efficient techniques that provide transactional access to data through this index structure are necessary. The techniques must support all degrees of isolation offered by the database system. Especially degree 3 isolation, called "no phantom read," protects search ranges from concurrent insertions and the rollbacks of deletions. In this paper, we propose a new phantom protection method for multi-dimensional index structures that uses a multi-level grid technique. The proposed mechanism is independent of the type of the multi-dimensional index structure, i.e., it can be applied to all types of index structures such as tree-based, file-based, and hash-based index structures. In addition, it has a low development cost and achieves high concurrency with a low lock overhead. It is shown through various experiments that the proposed method outperforms existing phantom protection methods for multi-dimensional index structures.
Mining Maximal Frequent Contiguous Sequences in Biological Data Sequences
Kang, Tae-Ho ; Yoo, Jae-Soo ; Kim, Hak-Yong ; Lee, Byoung-Yup ;
International Journal of Contents, volume 3, issue 2, 2007, Pages 18~24
DOI : 10.5392/IJoC.2007.3.2.018
Biological sequences such as DNA and amino acid sequences typically contain a large number of items. They have contiguous sequences that ordinarily consist of more than hundreds of frequent items. In biological sequences analysis(BSA), a frequent contiguous sequence search is one of the most important operations. Many studies have been done for mining sequential patterns efficiently. Most of the existing methods for mining sequential patterns are based on the Apriori algorithm. In particular, the prefixSpan algorithm is one of the most efficient sequential pattern mining schemes based on the Apriori algorithm. However, since the algorithm expands the sequential patterns from frequent patterns with length-1, it is not suitable for biological datasets with long frequent contiguous sequences. In recent years, the MacosVSpan algorithm was proposed based on the idea of the prefixSpan algorithm to significantly reduce its recursive process. However, the algorithm is still inefficient for mining frequent contiguous sequences from long biological data sequences. In this paper, we propose an efficient method to mine maximal frequent contiguous sequences in large biological data sequences by constructing the spanning tree with a fixed length. To verify the superiority of the proposed method, we perform experiments in various environments. The experiments show that the proposed method is much more efficient than MacosVSpan in terms of retrieval performance.
A Greedy Merging Method for User-Steered Mesh Segmentation
Ha, Jong-Sung ; Park, Young-Jin ; Yoo, Kwan-Hee ;
International Journal of Contents, volume 3, issue 2, 2007, Pages 25~29
DOI : 10.5392/IJoC.2007.3.2.025
In this paper, we discuss the mesh segmentation problem which divides a given 3D mesh into several disjoint sets. To solve the problem, we propose a greedy method based on the merging priority metric defined for representing the geometric properties of meaningful parts. The proposed priority metric is a weighted function using five geometric parameters, those are, a distribution of Gaussian map, boundary path concavity, boundary path length, cardinality, and segmentation resolution. In special, we can control by setting up the weight values of the proposed geometric parameters to obtain visually better mesh segmentation. Finally, we carry out an experiment on several 3D mesh models using the proposed methods and visualize the results.
The E-based Pedagogy for People with Disabilities
Kim, Yoon ;
International Journal of Contents, volume 3, issue 2, 2007, Pages 30~34
DOI : 10.5392/IJoC.2007.3.2.030
This paper concerns with the application of e-based education methodology for people with disabilities targeting to empower them. Instead of the classic educational support such as extended time to take exams, a reader and/or scribe to assist with exams and note taking services, we suggest the use of new pedagogy-the science of educations integrating the state-of-the art. In this paper, we introduce the definition of disabilities for the people who does not fully understand what they means, first, and then possible implementing tools which can empower them with accomplishments. Most of the research in the field of pedagogy has tended to concentrate on the behavioral aspects of instructional sciences. Therefore we would like to point out that we concentrate on the aspects of instructional science particularly related with people with disabilities.
Efficient Signal Feature Detection method using Spectral Correlation Function in the Fading channel
Song, Chang-Kun ; Kim, Kyung-Seok ;
International Journal of Contents, volume 3, issue 2, 2007, Pages 35~39
DOI : 10.5392/IJoC.2007.3.2.035
The cognitive radio communication is taking the attentions because the development of the technique came to be possible to analyze wireless signals. In the IEEE 802.22 WRAN Systems, how to detect a spectrum and signals is continuously studied. In this paper, we propose the efficient signal detection method using SCF (Spectral Correlation Function). It is easy to detect the signal feature when we are using the SCF. Because most modulated signals have the cyclo-stationarity which is unique for each signal. But the fading channel effected serious influence even though it detects the feature of the signal. We applied LMS(Least Mean Square) filter for the compensation of the signal which is effected the serious influence in the fading channel. And we analyze some signal patterns through the SCF. And we show the unique signal feature of each signal through the SCF method. It is robust for low SNR(Signal to Noise Ratio) environment and we can distinguish it in the fading channel using LMS Filter.
Improved Modular Inversion over GF(p)
Choi, Jong-Hwa ; Kim, Yong-Dae ; Ahn, Young-Il ; You, Young-Gap ;
International Journal of Contents, volume 3, issue 2, 2007, Pages 40~43
DOI : 10.5392/IJoC.2007.3.2.040
This paper proposed a new modular inverse algorithm based on the right-shifting binary Euclidean algorithm. For an n-bit numbers, the number of operations for the proposed algorithm is reduced about 61.3% less than the classical binary extended Euclidean algorithm. The proposed algorithm implementation shows substantial reduction in computation time over Galois field GF(p).