• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.5
• /
• pp.510-521
• /
• 2001

Image retrieval system should be construct for searching fast, efficient image be extract the accurate feature information of image with more massive and more complex characteristics. Image retrieval system are essential differences between image databases and traditional databases. These differences lead to interesting new issues in searching of image, data modeling. So, cause us to consider new generation method of database, efficient retrieval method of image. In this paper, To extract feature information of edge using in searching from input image, we was performed to extract the edge by convolution Laplacian mask and input image, and we implemented the annotation-based and content-based image retrieval system for searching fast, efficient image by generation image database from extracting feature information of edge and metadata. We can improve the performance of the image contents retrieval, because the annotation-based and content-based image retrieval system is using image index which is made up of the content-based edge feature extract information represented in the low level of image and annotation-based edge feature information represented in the high level of image. As a conclusion, image retrieval system proposed in this paper is possible the accurate management of the accumulated information for the image contents and the information sharing and reuse of image because the proposed method do construct the image database by metadata.

• The Korean Journal of Applied Statistics
• /
• v.34 no.2
• /
• pp.153-166
• /
• 2021

A main goal of pharmacogenomics studies is to predict individual's drug responsiveness based on high dimensional genetic variables. Due to a large number of variables, feature selection is required in order to reduce the number of variables. The selected features are used to construct a predictive model using machine learning algorithms. In the present study, we applied several hybrid feature selection methods such as combinations of logistic regression, ReliefF, TurF, random forest, and LASSO to a next generation sequencing data set of 400 epilepsy patients. We then applied the selected features to machine learning methods including random forest, gradient boosting, and support vector machine as well as a stacking ensemble method. Our results showed that the stacking model with a hybrid feature selection of random forest and ReliefF performs better than with other combinations of approaches. Based on a 5-fold cross validation partition, the mean test accuracy value of the best model was 0.727 and the mean test AUC value of the best model was 0.761. It also appeared that the stacking models outperform than single machine learning predictive models when using the same selected features.

• The Journal of Korea Robotics Society
• /
• v.8 no.4
• /
• pp.266-272
• /
• 2013

Facial feature extraction and tracking are essential steps in human-robot-interaction (HRI) field such as face recognition, gaze estimation, and emotion recognition. Active shape model (ASM) is one of the successful generative models that extract the facial features. However, applying only ASM is not adequate for modeling a face in actual applications, because positions of facial features are unstably extracted due to limitation of the number of iterations in the ASM fitting algorithm. The unaccurate positions of facial features decrease the performance of the emotion recognition. In this paper, we propose real-time facial feature extraction and tracking framework using ASM and LK optical flow for emotion recognition. LK optical flow is desirable to estimate time-varying geometric parameters in sequential face images. In addition, we introduce a straightforward method to avoid tracking failure caused by partial occlusions that can be a serious problem for tracking based algorithm. Emotion recognition experiments with k-NN and SVM classifier shows over 95% classification accuracy for three emotions: "joy", "anger", and "disgust".

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.705-716
• /
• 2005

There exist many feature point detection algorithms that developed in pattern recognition research . However, interactive applications for the pen-input displays such as Tablet PCs and LCD tablets have set different goals; reliable segmentation for different drawing styles and real-time on-the-fly fieature point defection. This paper presents a curvature estimation method crucial for segmenting freeHand pen input. It considers only local shape descriptors, thus, peforming a novel curvature estimation on-the-fly while drawing on a pen-input display This has been used for pen marking recognition to build a 3D sketch-based modeling application.

• Journal of Korean Society for Geospatial Information Science
• /
• v.10 no.5 s.23
• /
• pp.17-28
• /
• 2002

Time is regarded as an essential feature of land information enabling to track historical landmarks of land uses, ownerships, and taxations based on cadastral maps. Object-oriented temporal modeling helps to simulate and imitate time-varying cadastral data in a chronological and persistent manner. The aim of study is to analyze the role of temporal cadastre tracing footprints of foregoing events in response to various needs and demands associated with historical information of cadastral transactions. In this paper, temporal cadastral object model (TCOM) is proposed to delineate object version history. As an evidence of a new approach and conceptual idea for the importance of temporal cadastre, a part of spatio-temporal processes is illustrated to explain major changes of cadastral map. The feasibility and application of the approach is confirmed by proof-of-concept of temporal cadastre in land information management.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.657-667
• /
• 2019

This paper studies synthetic aperture radar (SAR) imaging problem which the scatterers are often distributed in block sparse pattern. To exploiting the sparse geometrical feature, a Kronecker constrained SAR imaging algorithm is proposed by combining the block sparse characteristics with the multiway sparse reconstruction framework with Tucker modeling. We validate the proposed algorithm via real data and it shows that the our algorithm can achieve better accuracy and convergence than the reference methods even in the demanding environment. Meanwhile, the complexity is smaller than that of the existing methods. The simulation experiments confirmed the effectiveness of the algorithm as well.

• Journal of Korea Multimedia Society
• /
• v.18 no.6
• /
• pp.780-791
• /
• 2015

Recently, it is being held festival according to regional and seasonally cultural feature in nationwide. Especially, local festivals are being provided festival information services a variety of forms for tourists depending on development of information device. However, systems to provide notification information of local festivals are not persistent but mostly short term service. In this paper, we propose a mobile commerce and information notification system through festival information alerts and festival surrounding information using local based on service. In addition, we implement a festival information notification system that applies to beacon based on bluetooth in order to inform them on diverse festival. Finally, we take into account in terms of design of system using object-oriented design modeling to improve reusability of proposed system.

• Korean Journal of Remote Sensing
• /
• v.21 no.1
• /
• pp.31-49
• /
• 2005

We first review some history of the Global Geodynamics Project (GGP), particularly in the progress of ground-satellite gravity comparisons. The GGP Satellite Project has involved the measurement of ground-based superconducting gravimeters (SGs) in Europe for several years and we make quantitative comparisons with the latest satellite GRACE data and hydrological models. The primary goal is to recover information about seasonal hydrology cycles, and we find a good correlation at the microgal level between the data and modeling. One interesting feature of the data is low soil moisture resulting from the European heat wave in 2003. An issue with the ground-based stations is the possibility of mass variations in the soil above a station, and particularly for underground stations these have to be modeled precisely. Based on this work with a regional array, we estimate the effectiveness of future SG arrays to measure co-seismic deformation and silent-slip events. Finally we consider gravity surveys in volcanic areas, and predict the accuracy in modeling subsurface density variations over time periods from months to years.

• International Journal of CAD/CAM
• /
• v.6 no.1
• /
• pp.125-137
• /
• 2006

Nowadays, many commercial CAD systems support history-based, constraint-based and feature-based modeling. Unfortunately, most systems fail during the re-evaluation phase when various kind of topological changes occur. This issue is known as "persistent naming" which refers to the problem of identifying entities in an initial parametric model and matching them in the re-evaluated model. Most works in this domain focus on the persistent naming of atomic entities such as vertices, edges or faces. But very few of them consider the persistent naming of aggregates like shells (any set of faces). We propose in this paper a complete framework for identifying and matching any kind of entities based on their underlying topology, and particularly shells. The identifying method is based on the invariant structure of each class of form features (a hierarchical structure of shells) and on its topological evolution (an historical structure of faces). The matching method compares the initial and the re-evaluated topological histories, and computes two measures of topological similarity between any couple of entities occurring in both models. The naming and matching method has been implemented and integrated in a prototype of commercial CAD Software (Topsolid).

• Korean Journal of Computational Design and Engineering
• /
• v.6 no.2
• /
• pp.78-88
• /
• 2001

In order to adopt feature-based parametric modeling, CAD/CAM applications must have a geometric constraint solver that can handle a large set of geometric configurations efficiently and robustly. In this paper, we describe a graph constructive approach to solving geometric constraint problems. Usually, a graph constructive approach is efficient, however it has its limitation in scope; it cannot handle ruler-and-compass non-constructible configurations and under-constrained problems. To overcome these limitations. we propose an algorithm that isolates ruler-and-compass non-constructible configurations from ruler-and-compass constructible configurations and applies numerical calculation methods to solve them separately. This separation can maximize the efficiency and robustness of a geometric constraint solver. Moreover, the solver can handle under-constrained problems by classifying under-constrained subgraphs to simplified cases by applying classification rules. Then, it decides the calculating sequence of geometric entities in each classified case and calculates geometric entities by adding appropriate assumptions or constraints. By extending the clustering types and defining several rules, the proposed approach can overcome limitations of previous graph constructive approaches which makes it possible to develop an efficient and robust geometric constraint solver.