• Journal of Information Processing Systems
• /
• v.17 no.5
• /
• pp.1020-1033
• /
• 2021

Nowadays, online or mobile social network services (SNS) are very popular and widely spread in our society and daily lives to instantly share, disseminate, and search information. In particular, SNS such as YouTube, Flickr, Facebook, and Amazon allow users to upload billions of images or videos and also provide a number of multimedia information to users. Information retrieval in multimedia-rich SNS is very useful but challenging task. Content-based media retrieval (CBMR) is the process of obtaining the relevant image or video objects for a given query from a collection of information sources. However, CBMR suffers from the dimensionality curse due to inherent high dimensionality features of media data. This paper investigates the effectiveness of the kernel trick in CBMR, specifically, the kernel principal component analysis (KPCA) for dimensionality reduction. KPCA is a nonlinear extension of linear principal component analysis (LPCA) to discovering nonlinear embeddings using the kernel trick. The fundamental idea of KPCA is mapping the input data into a highdimensional feature space through a nonlinear kernel function and then computing the principal components on that mapped space. This paper investigates the potential of KPCA in CBMR for feature extraction or dimensionality reduction. Using the Gaussian kernel in our experiments, we compute the principal components of an image dataset in the transformed space and then we use them as new feature dimensions for the image dataset. Moreover, KPCA can be applied to other many domains including CBMR, where LPCA has been used to extract features and where the nonlinear extension would be effective. Our results from extensive experiments demonstrate that the potential of KPCA is very encouraging compared with LPCA in CBMR.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.33 no.6
• /
• pp.411-417
• /
• 2020

To utilize building information modeling (BIM) technology at the bridge maintenance stage, it is necessary to integrate large quantities of bridge inspection and model data for object-oriented information management. This research aims to establish the benefits of utilizing the extended industry foundation class (IFC)-BIM and ontology for bridge inspection information management. The IFC entities were extended to represent the bridge objects, and a method of generating the extended IFC-based information model was proposed. The bridge inspection ontology was also developed by extraction and classification of inspection concepts from the AASHTO standard. The classified concepts and their relationships were mapped to the ontology based on the semantic triples approach. Finally, the extended IFC-based BIM model was integrated with the ontology for bridge inspection data management. The effectiveness of the proposed framework for bridge inspection information management by integration of the extended IFC-BIM and ontology was tested and verified by extracting bridge inspection data via the SPARQL query.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.5
• /
• pp.45-52
• /
• 2004

According tothe development of digital media technologies various algorithms for video sequence matching have been proposed to match the video sequences efficiently. A large number of video sequence matching methods have focused on frame-wise query, whereas a relatively few algorithms have been presented for video sequence matching or video shot matching. In this paper, we propose an efficientalgorithm to index the video sequences and to retrieve the sequences for video sequence query. To improve the accuracy and performance of video sequence matching, we employ the Cauchy function as a similarity measure between histograms of consecutive frames, which yields a high performance compared with conventional measures. The key frames extracted from segmented video shots can be used not only for video shot clustering but also for video sequence matching or browsing, where the key frame is defined by the frame that is significantly different from the previous fames. Several key frame extraction algorithms have been proposed, in which similar methods used for shot boundary detection were employed with proper similarity measures. In this paper, we propose the efficient algorithm to extract key frames using the cumulative Cauchy function measure and. compare its performance with that of conventional algorithms. Video sequence matching can be performed by evaluating the similarity between data sets of key frames. To improve the matching efficiency with the set of extracted key frames we employ the Cauchy function and the modified Hausdorff distance. Experimental results with several color video sequences show that the proposed method yields the high matching performance and accuracy with a low computational load compared with conventional algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.05a
• /
• pp.50-54
• /
• 1999

This paper is proposed to image retrieval system using color and shape feature. Color feature used to four maximum value feature among the maximum value extracted from local color distribution histogram. The preprocessing of shape feature consist of edge extraction and weight central point extraction and angular sampling. The sum of distance from weight central point to contour and variation and max/min used to shape feature. The similarity is estimated compare feature of query image with the feature of images in database and the candidate of image is retrieved in order of similarity. We evaluate the effectiveness of shape feature and color feature in experiment used to two hundred of the closed image. The Recall and the Precision is each 0.72 and 0.53 in the result of average experiment. So the proposed method is presented useful method.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.12
• /
• pp.133-142
• /
• 2021

Travel pattern recognition is widely used in many aspects such as user trajectory query, user behavior prediction, interest recommendation based on user location, user privacy protection and municipal transportation planning. Because the current recognition accuracy cannot meet the application requirements, the study of travel pattern recognition is the focus of trajectory data research. With the popularization of GPS navigation technology and intelligent mobile devices, a large amount of user mobile data information can be obtained from it, and many meaningful researches can be carried out based on this information. In the current travel pattern research method, the feature extraction of trajectory is limited to the basic attributes of trajectory (speed, angle, acceleration, etc.). In this paper, permutation entropy was used as an eigenvalue of trajectory to participate in the research of trajectory classification, and also used as an attribute to measure the complexity of time series. Velocity permutation entropy and angle permutation entropy were used as characteristics of trajectory to participate in the classification of travel patterns, and the accuracy of attribute classification based on permutation entropy used in this paper reached 81.47%.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.447-450
• /
• 2003

In this research, we propose an automatic knowledge acquisition and composite knowledge expression mechanism based on machine learning and relational database. Most of traditional approaches to develop a knowledge base and inference engine of expert systems were based on IF-THEN rules, AND-OR graph, Semantic networks, and Frame separately. However, there are some limitations such as automatic knowledge acquisition, complicate knowledge expression, expansibility of knowledge base, speed of inference, and hierarchies among rules. To overcome these limitations, many of researchers tried to develop an automatic knowledge acquisition, composite knowledge expression, and fast inference method. As a result, the adaptability of the expert systems was improved rapidly. Nonetheless, they didn't suggest a hybrid and generalized solution to support the entire process of development of expert systems. Our proposed mechanism has five advantages empirically. First, it could extract the specific domain knowledge from incomplete database based on machine learning algorithm. Second, this mechanism could reduce the number of rules efficiently according to the rule extraction mechanism used in machine learning. Third, our proposed mechanism could expand the knowledge base unlimitedly by using relational database. Fourth, the backward inference engine developed in this study, could manipulate the knowledge base stored in relational database rapidly. Therefore, the speed of inference is faster than traditional text -oriented inference mechanism. Fifth, our composite knowledge expression mechanism could reflect the traditional knowledge expression method such as IF-THEN rules, AND-OR graph, and Relationship matrix simultaneously. To validate the inference ability of our system, a real data set was adopted from a clinical diagnosis classifying the dermatology disease.

• The KIPS Transactions:PartB
• /
• v.12B no.1 s.97
• /
• pp.31-38
• /
• 2005

This paper proposes an object-based image retrieval scheme using color adjacency and clustering method. Color adjacency features in boundary regions are utilized to extract candidate blocks of interest from image database and a clustering method is used to extract the regions of interest(ROI) from candidate blocks of interest. To measure the similarity between the query and database images, the histogram intersection technique is used. The color pair information used in the proposed method is robust against translation, rotation, and scaling. Consequently, experimental results have shown that the proposed scheme is superior to existing methods in terms of ANMRR.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8C
• /
• pp.783-792
• /
• 2005

This paper proposes a feature extraction method for sketch-based image retrieval of animation character. We extract the specific regions using the detection of scene change and correlation points between two frames, and the property of animation production. We detect the area of focused similar colors in extracted specific region. And it is used as feature descriptor for image retrieval that focused color(FC) of regions, size, relation between FCs. Finally, an user can retrieve the similar character using property of animation production and user's sketch as a query Image.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.1
• /
• pp.28-33
• /
• 2003

This paper proposes a database index and retrieval method using the PCA(Principal Component Analysis). We perform a scene change detection and key frame extraction from the DC Image constructed by DCT DC coefficients in the compressed video stream that is video compression standard such as MPEG. In the extracted key frame, we use the PCA, then we can make codebook that has a statistical data as a codeword, which is saved as a database index. We also provide retrieval image that are similar to user's query image in a video database. As a result of experiments, we confirmed that the proposed method clearly showed superior performance in video retrieval and reduced computation time and memory space.

• The KIPS Transactions:PartB
• /
• v.12B no.3 s.99
• /
• pp.357-364
• /
• 2005

In this paper, we propose an accurate and fast keyword spotting system for searching user-specified keyword in Hangul document images by using two-level image-to-image matching. The system is composed of character segmentation, creating a query image, feature extraction, and matching procedure. Two different feature vectors are used in the matching procedure. An experiment using 1600 Hangul word images from 8 document images, downloaded from the website of Korea Information Science Society, demonstrates that the proposed system is superior to conventional image-based document retrieval systems.