• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.127-133
• /
• 2009

To ensure access to rapidly growing video collection, video indexing is becoming more and more essential. A database for video should be build for fast searching and extracting the accurate features of video information with more complex characteristics. Moreover, video indexing structure supports efficient retrieval of interesting contents to reflect user preferences. In this paper, we propose semantic video retrieval method based on user preference. Unlikely the previous methods do not consider user preferences. Futhermore, the conventional methods show the result as simple text matching for the user's query that does not supports the semantic search. To overcome these limitations, we develop a method for user preference analysis and present a method of video ontology construction for semantic retrieval. The simulation results show that the proposed algorithm performs better than previous methods in terms of semantic video retrieval based on user preferences.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.6
• /
• pp.684-695
• /
• 2001

Recent recommender system uses a method of combining collaborative filtering system and content based filtering system in order to solve sparsity and first rater problem in collaborative filtering system. Collaborative filtering systems use a database about user preferences to predict additional topics. Content based filtering systems provide recommendations by matching user interests with topic attributes. In this paper, we describe a method for discovery of user preference through combining two techniques for recommendation that allows the application of machine learning algorithm. The proposed collaborative filtering method clusters user using genetic algorithm based on items categorized by Naive Bayes classifier and the content based filtering method builds user profile through extracting user interest using relevance feedback. We evaluate our method on a large database of user ratings for web document and it significantly outperforms previously proposed methods.

• Journal of Digital Convergence
• /
• v.15 no.3
• /
• pp.335-341
• /
• 2017

The study evaluates user experiences of I-um and Noondate, typical Social Dating Mobile Application Service in Korea, to suggest guidelines that are more user-centered and useful. I did some literature research followed with evaluation of theoretical backgrounds, present conditions. Also, I recasted to the six principles of "Honey comb model" by Peter Morville to conduct an in-depth interview. The result indicate that I-um needs to improve accuracy of matching system by checking user's interest and detailed profile. Noondate needs to develop the cards sorting systems so that user can supervise themselves. I expect this study will become a good resource for upgrading user experiences of Social Dating Service. I also believe that this study can guide other studies about user experience in other fields.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.5
• /
• pp.655-660
• /
• 2009

The context prediction algorithms are not suitable to provide real-time personalized service for users in context-awareness environment. The algorithms have problems like time delay in training data processing and the difficulties of implementation in real-time environment. In this paper, we propose a prediction algorithm with user modeling to shorten of processing time and to improve the prediction accuracy in the context prediction algorithm. The algorithm uses moving path of user contexts for context prediction and generates user model by time-series analysis of user's moving path. And that predicts the user context with the user model by sequence matching method. We compared our algorithms with the prediction algorithms by processing time and prediction accuracy. As the result, the prediction accuracy of our algorithm is similar to the prediction algorithms, and processing time is reduced by 40% in real time service environment.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.5
• /
• pp.49-58
• /
• 2005

There has been an increase in the interest of applications that use a combination of both pervasive computing technology and context-aware technology. This application based on the development environment along with the support of developing context-aware applications is now being researched thoroughly and by many. The service management system provides services that are needed for context-aware applications. This system is an integral part of the developmental environment of context-aware applications. But there is a restrictive matching based on ontology that uses simple syntactic matching or a plain type of service used in previous researches. And there is also no consideration for context-aware information. Also, if the user is unable to find a service that is satisfactory, or is a service which a user does not desire, they may use a service which is composed of other existing services. This paper proposes a service management system based on context-aware information. The proposed system enables the accurate finding of services by considering semantic matching methods based on ontology and context-aware information. If the user does not find a service that is helpful in the service registry, it can provide the service list to enable other existing service compositions, by providing the functionality of these service compositions. As a result, the experiment of the system proposed has shown that the system properly supported the service discovery based on context-aware information and service composition.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.2
• /
• pp.690-696
• /
• 2016

Search engines that rely on morphological matching of user query and web document content do not support individual interests. This research proposes a personalized web search scheme that returns the results that reflect the users' query intent and personal preferences. The performance of the personalized search depends on using an effective user profiling strategy to accurately capture the users' personal interests. In this study, the user profiles are the databases of topic words and customized weights based on the recent user queries and the frequency of topic words in click history. To determine the precise meaning of ambiguous queries and topic words, this strategy uses WordNet to calculate the semantic relatedness to words in the user profile. The experiments were conducted by installing a query expansion and re-ranking modules on the general web search systems. The results showed that this method has 92% precision and 82% recall in the top 10 search results, proving the enhanced performance.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.8
• /
• pp.597-602
• /
• 2016

In image guided surgery, a patient registration process is a critical process for the successful operation, which is required to use pre-operative images such as CT and MRI during operation. Though several patient registration methods have been studied, we concentrate on one method that utilizes 3D surface measurement data in this paper. First, a hand-held 3D surface measurement device measures the surface of the patient, and secondly this data is matched with CT or MRI data using optimization algorithms. However, generally used ICP algorithm is very slow without a proper initial location and also suffers from local minimum problem. Usually, this problem is solved by manually providing the proper initial location before performing ICP. But, it has a disadvantage that an experience user has to perform the method and also takes a long time. In this paper, we propose a method that can accurately find the proper initial location automatically. The proposed method finds the proper initial location for ICP by converting 3D data to 2D curvature images and performing image matching. Curvature features are robust to the rotation, translation, and even some deformation. Also, the proposed method is faster than traditional methods because it performs 2D image matching instead of 3D point cloud matching.

• Korean Journal of Optics and Photonics
• /
• v.13 no.6
• /
• pp.493-500
• /
• 2002

Fingerprint recognition is concerned with fingerprint acquisition and matching. Our research was focused on a fingerprint matching method using an inkless fingerprint input sensor at the fingerprint acquisition step. Since an inkless fingerprint sensor produces a digital-image-processed fingerprint image, we did not consider noise that can happen while acquiring the fingerprint. And making the user attempt fingerprint input as random, we considered image distortion that translation and rotation are included as complex. NJTC algorithm is used for fingerprint identification and verification. The method to find the center of the fingerprint is added in the NJTC algorithm to supplement discrimination of fingerprint recognition. From this center point, we decided the optimum cropping size for effective matching with pixels and demonstrated that the proposed method has high discrimination and high efficiency.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.7
• /
• pp.104-115
• /
• 1999

This paper proposes an efficient method for 3D modeling of a human face from trinocular images by reconstructing face surface using range data. By using a trinocular camera system, we mitigated the tradeoff between the occlusion problem and the range resolution limitation which is the critical limitation in binocular camera system. We also propose an MPC_MBS (Matching Pixel Count Multiple Baseline Stereo) area-based matching method to reduce boundary overreach phenomenon and to improve both of accuracy and precision in matching. In this method, the computing time can be reduced significantly by removing the redundancies. In the model generation sub-pixel accurate surface data are achieved by 2D interpolation of disparity values, and are sampled to make regular triangular meshes. The data size of the triangular mesh model can be controlled by merging the vertices that lie on the same plane within user defined error threshold.

• Journal of Korean Society for Geospatial Information Science
• /
• v.24 no.1
• /
• pp.89-98
• /
• 2016

In this paper, we proposed an automated areal feature matching method based on geometric similarity without user intervention and is applied into areal features of many-to-many relation, for confusion of spatial data-sets of different scale and updating cycle. Firstly, areal feature(node) that a value of inclusion function is more than 0.4 was connected as an edge in adjacency matrix and candidate corresponding areal features included many-to-many relation was identified by multiplication of adjacency matrix. For geometrical matching, these multiple candidates corresponding areal features were transformed into an aggregated polygon as a convex hull generated by a curve-fitting algorithm. Secondly, we defined matching criteria to measure geometrical quality, and these criteria were changed into normalized values, similarity, by similarity function. Next, shape similarity is defined as a weighted linear combination of these similarities and weights which are calculated by Criteria Importance Through Intercriteria Correlation(CRITIC) method. Finally, in training data, we identified Equal Error Rate(EER) which is trade-off value in a plot of precision versus recall for all threshold values(PR curve) as a threshold and decided if these candidate pairs are corresponding pairs or not. To the result of applying the proposed method in a digital topographic map and a base map of address system(KAIS), we confirmed that some many-to-many areal features were mis-detected in visual evaluation and precision, recall and F-Measure was highly 0.951, 0.906, 0.928, respectively in statistical evaluation. These means that accuracy of the automated matching between different spatial data-sets by the proposed method is highly. However, we should do a research on an inclusion function and a detail matching criterion to exactly quantify many-to-many areal features in future.