• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.579-586
• /
• 2001

Digital watermarking is to embed imperceptible mark into image, video, audio, and text data to prevent the illegal copy of multimedia data. arbitrary modification, and also illegal sales of the copies without agreement of copyright ownership. In this paper, we study for the embedding and extraction of watermark key using wavelet in the luminance signal in order to implement the system to protect the copyright for image MPEG. First, the original image is analyzed into frequency domain by discrete wavelet transform. The RSA(Rivest, Shamir, Aldeman) public key of the coded target is RUN parameter of VLD(variable length coding). Because the high relationship among the adjacent RUN parameters effect the whole image, it prevents non-authorizer not to possess private key from behaving illegally. The Results show that the proposed method provides better moving picture and the distortion more key of insert than direct coded method on low-frequency domain based DCT.

• The KIPS Transactions:PartB
• /
• v.12B no.5 s.101
• /
• pp.521-526
• /
• 2005

In this Paper, we propose a keyword spotting system as an alternative to searching system for poor quality Korean document images and compare the Proposed system with an OCR-based document retrieval system. The system is composed of character segmentation, feature extraction for the query keyword, and word-to-word matching. In the character segmentation step, we propose an effective method to remove the connectivity between adjacent characters and a character segmentation method by making the variance of character widths minimum. In the query creation step, feature vector for the query is constructed by a combination of a character model by typeface. In the matching step, word-to-word matching is applied base on a character-to-character matching. We demonstrated that the proposed keyword spotting system is more efficient than the OCR-based one to search a keyword on the Korean document images, especially when the quality of documents is quite poor and point size is small.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.495-506
• /
• 2001

XML makes it possible for data to be exchanged regradless of the data model in which it is represented or the platform on which it is stored, serving as a standard for data exchange format on the internet. Especially, it is natural to send XML data without DTD on the internet when XML is data-centric. Therefore it is needed to extract relational schema to store XML data efficiently, to optimize queries, and to publish data which have been stored in the relational database in the XML format. In this paper, we proposed a method to generate relational database in the XML documents without DTD and store XML data using upper/lower bound schema extraction technique for semistructured data. In extracting a lower bound schema, we especially show an efficient technique for creating relational schema by using simulation with is more advanced than the datalog method.

• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1572-1580
• /
• 2009

Combing through entire video files for the purpose of recognizing and retrieving matching movies requires much time and memory space. Instead, most current similar movie-matching methods choose to analyze only a part of each movie's video-image information. Yet, these methods still share a critical problem of erroneously recognizing as being different matching videos that have been altered only in resolution or converted merely with a different codecs. This paper proposes an audio-information-based search algorithm by which similar movies can be identified. The proposed method prepares and searches through a database of movie's spectral peak information that remains relatively steady even with changes in the bit-rate, codecs, or sample-rate. The method showed a 92.1% search success rate, given a set of 1,000 video files whose audio-bit-rate had been altered or were purposefully written in a different codec.

• The KIPS Transactions:PartB
• /
• v.13B no.4 s.107
• /
• pp.393-400
• /
• 2006

There are many feature extraction methods for face recognition. We need a new method to overcome the small sample problem that the number of feature variables is larger than the sample size for face image data. The paper considers partial least squares(PLS) as a new dimension reduction technique for feature vector. Principal Component Analysis(PCA), a conventional dimension reduction method, selects the components with maximum variability, irrespective of the class information. So, PCA does not necessarily extract features that are important for the discrimination of classes. PLS, on the other hand, constructs the components so that the correlation between the class variable and themselves is maximized. Therefore PLS components are more predictive than PCA components in classification. The experimental results on Manchester and ORL databases shows that PLS is to be preferred over PCA when classification is the goal and dimension reduction is needed.

• The KIPS Transactions:PartB
• /
• v.14B no.1 s.111
• /
• pp.1-4
• /
• 2007

In this paper, we propose an efficient scheme for automatically detecting highlight scenes in soccer videos. Highlights are defined as shooting scenes and goal scenes. Through the analysis of soccer videos, we notice that most of highlight scenes are shown around the goal post area. It is also noticed that the TV camera zooms in a setter player or spectators after the highlight stones. Detection of highlight scenes for soccer videos consists of three steps. The first step is the extraction of the playing field using a statistical threshold. The second step is the detection of goal posts. In the final step, we detect a zooming of a soccer player or spectators by using connected component labeling of non-playing field. In order to evaluate the performance of our method, the precision and the recall are computed. Experimental results have shown the effectiveness of the proposed method, with 95.2% precision and 85.4% recall.

• The KIPS Transactions:PartB
• /
• v.16B no.3
• /
• pp.239-246
• /
• 2009

In this paper, we propose a Korean character recognition method from outboard signboard images. We have chosen 808 classes of Korean characters by an analysis of frequencies of appearance in a dictionary of signboard names. The proposed method mainly consists of three steps: feature extraction, rough classification, and coarse classification. The first step is to extract a nonlinear directional segments feature, which is immune to the distortion of character shapes. The second step computes an ordered set of 10 recognition candidates using a minimum distance classifier. The last step reorders the recognition candidates using a Fisher discriminant measure. As experimental results, the recognition accuracy is 80.45% for the first choice, and 93.51% for the top five choices.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.6 no.5
• /
• pp.367-372
• /
• 2005

In this paper, we proposed a method of content-based image retrieval using variable region. Content-based image retrieval uses color histogram for the most part. But the existing color histogram methods have a disadvantage that it reduces accuracy because of quantization error and absence of spatial information. In order to overcome this, we convert color information to HSV space, quantize hue factor being pure color information, and calculate histogram of the factor. On the other hand, to solve the problem of the absence of spatial information, we select object region in consideration of color feature and region correlation. It maintains the size of region in the selected object region. But non-object region is integrated in one region. After of selection variable region, we retrieve using color feature. As the result of experimentation, the proposed method improves 10$\%$ in average of precision.

• The KIPS Transactions:PartB
• /
• v.17B no.4
• /
• pp.263-274
• /
• 2010

To provide context-aware music recommendation service, first of all, we need to catch music mood that a user prefers depending on his situation or context. Among various music characteristics, music mood has a close relation with people‘s emotion. Based on this relationship, some researchers have studied on music mood detection, where they manually select a representative segment of music and classify its mood. Although such approaches show good performance on music mood classification, it's difficult to apply them to new music due to the manual intervention. Moreover, it is more difficult to detect music mood because the mood usually varies with time. To cope with these problems, this paper presents an automatic method to classify the music mood. First, a whole music is segmented into several groups that have similar characteristics by structural information. Then, the mood of each segments is detected, where each individual's preference on mood is modelled by regression based on Thayer's two-dimensional mood model. Experimental results show that the proposed method achieves 80% or higher accuracy.

• Journal of the Korean Institute of Navigation
• /
• v.23 no.1
• /
• pp.75-84
• /
• 1999

Although many studies on modelling of port competitive situation have been conducted, both theoretical frame and methodology are still very weak. In this study, therefore, a new algorithm called ESD (Extensional System Dynamics) for the evaluation of port competition was presented, and applied to simulate port systems in northeast asia. The detailed objectives of this paper are to develop Unit fort Model by using SD(System Dynamics) method; to develop Competitive Port Model by ESD method; to perform sensitivity analysis by altering parameters, and to propose port development strategies. For these the algorithm for the evaluation of part's competition was developed in two steps. Firstly, SD method was adopted to develop the Unit Port models, and secondly HFP(Hierarchical Fuzzy Process) method was introduced to expand previous SD method. The proposed models were then developed and applied to the five ports - Pusan, Kobe, Yokohama, Kaoshiung, Keelung - with real data on each ports, and several findings were derived. Firstly, the extraction of factors for Unit Port was accomplished by consultation of experts such as research worker, professor, research fellows related to harbor, and expert group, and finally, five factor groups - location, facility, service, cargo volumes, and port charge - were obtained. Secondly, system's structure consisting of feedback loop was found easily by location of representative and detailed factors on keyword network of STGB map. Using these keyword network, feedback loop was found. Thirdly, for the target year of 2003, the simulation for Pusan port revealed that liner's number would be increased from 829 ships to 1,450 ships and container cargo volumes increased from 4.56 million TEU to 7.74 million TEU. It also revealed that because of increased liners and container cargo volumes, length of berth should be expanded from 2,162m to 4,729m. This berth expansion was resulted in the decrease of congested ship's number from 97 to 11. It was also found that port's charge had a fluctuation. Results of simulation for Kobe, Yokohama, Kaoshiung, Keelung in northeast asia were also acquired. Finally, the inter port competition models developed by ESB method were used to simulate container cargo volumes for Pusan port. The results revealed that under competitive situation container cargo volume was smaller than non-competitive situation, which means Pusan port is lack of competitive power to other ports. Developed models in this study were then applied to estimate change of container cargo volumes in competitive relation by altering several parameters. And, the results were found to be very helpful for port mangers who are in charge of planning of port development.