• 한국주거학회:학술대회논문집
• /
• 한국주거학회 2008년 추계학술발표대회 논문집
• /
• pp.385-390
• /
• 2008

The residence plan of Korea has been formed with bias for quantitative growth and uniformity failing at obtaining human value. Also, rapid growth brought about severe problems of deteriorated human life and destruction of environment. The solution for these problems is pursued in many directions, but there is short of active plan yet. The residence shall develop into new direction to satisfy the demand by reflecting society and culture as well as residents. This study examines external design with symbolic representation of regional feature as an alternative for uniform residence environment problem. This study will be a basic data upon suggesting the direction for planning high quality residence environment. This study examined the elements which form external space of residence complex, designed plan for external space of residence complex, and examined how to reflect regional feature which is important element of local community and culture on the space plan for residence complex based on the evaluation by local residents centered on Gimcheon-si, Gyeongbuk which just started local specialty by fostering. 'Special Area for Grape Industry.'

• Spatial Information Research
• /
• 제19권5호
• /
• pp.75-86
• /
• 2011

실세계의 도시에 대한 3차원 모델링은 도시계획과 의사결정을 하기 위하여 필수적인 작업이다. 또한 무선인터넷 발달과 함께 이용자의 위치를 파악하여 정보를 제공하는 위치기반서비스에 대한 소비자 증가로 많은 3차원 도시모델이 개발되고 있다. 특히 우리나라 도심지역의 경우에는 초고층 건물들의 밀집으로 실외뿐만 아니라 실내공간 모델링에 대한 연구가 필요하며, 공간 모델을 통해서 최단경로 등의 공간 분석이 통한 위치기반서비스가 제공될 수 있어야 한다. 지금까지 많은 연구가 진행된 3차원 도시모델들은 피처 모델로, 기본요소들(primitives)을 조합하여 공간을 표현하고, 관계성은 공유하는 기본요소들을 찾아야지만 표현할 수 있기 때문에 복잡한 3차원 공간 객체들 사이에서는 관계성을 정의하기 힘들다. 따라서 최단경로와 같이 공간간의 관계성을 기반으로 도출되는 공간 분석을 하기 위해서는 공간간의 관계성 표현이 필요하다. 본 연구에서는 복잡한 3차원 실내공간간의 관계성을 효율적으로 표현하는 네트워크 기반의 위상학적 데이터 모델인 보행 공간 관계 모델을 개발하였다.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2006년도 가을 학술발표논문집 Vol.33 No.2 (C)
• /
• pp.222-225
• /
• 2006

한국은 다른 나라에 비해 많은 인터넷 사용자를 가지고 있다. 이에 비례해서 한국의 인터넷 유저들은 Spam Mail에 대해 많은 불편함을 호소하고 있다. 이러한 문제를 해결하기 위해 본 논문은 다양한 Feature Weighting, Feature Selection 그리고 문서 분류 알고리즘들을 이용한 한국어 스팸 문서 Filtering연구에 대해 기술한다. 그리고 한국어 문서(Spam/Non-Spam 문서)로부터 영사를 추출하고 이를 각 분류 알고리즘의 Input Feature로써 이용한다. 그리고 우리는 Feature weighting 에 대해 기존의 전통적인 방법이 아니라 각 Feature에 대해 Variance 값을 구하고 Global Feature를 선택하기 위해 Max Value Selection 방법에 적용 후에 전통적인 Feature Selection 방법인 MI, IG, CHI 들을 적용하여 Feature들을 추출한다. 이렇게 추출된 Feature들을 Naive Bayes, Support Vector Machine과 같은 분류 알고리즘에 적용한다. Vector Space Model의 경우에는 전통적인 방법 그대로 사용한다. 그 결과 우리는 Support Vector Machine Classifier, TF-IDF Variance Weighting(Combined Max Value Selection), CHI Feature Selection 방법을 사용할 경우 Recall(99.4%), Precision(97.4%), F-Measure(98.39%)의 성능을 보였다.

• Journal of applied mathematics & informatics
• /
• 제9권2호
• /
• pp.793-806
• /
• 2002

Feature-based similarity retrieval become an important research issue in image database systems. The features of image data are useful to discrimination of images. In this paper, we propose the highspeed k-Nearest Neighbor search algorithm based on Self-Organizing Maps. Self-Organizing Maps (SOM) provides a mapping from high dimensional feature vectors onto a two-dimensional space. The mapping preserves the topology of the feature vectors. The map is called topological feature map. A topological feature map preserves the mutual relations (similarity) in feature spaces of input data. and clusters mutually similar feature vectors in a neighboring nodes. Each node of the topological feature map holds a node vector and similar images that is closest to each node vector. In topological feature map, there are empty nodes in which no image is classified. We experiment on the performance of our algorithm using color feature vectors extracted from images. Promising results have been obtained in experiments.

• Journal of information and communication convergence engineering
• /
• 제21권1호
• /
• pp.82-89
• /
• 2023

Various machine-learning models may yield high predictive power for massive time series for time series prediction. However, these models are prone to instability in terms of computational cost because of the high dimensionality of the feature space and nonoptimized hyperparameter settings. Considering the potential risk that model training with a high-dimensional feature set can be time-consuming, we evaluate a feature-importance-based feature selection method to derive a tradeoff between predictive power and computational cost for time series prediction. We used two machine learning techniques for performance evaluation to generate prediction models from a retail sales dataset. First, we ranked the features using impurity- and Local Interpretable Model-agnostic Explanations (LIME) -based feature importance measures in the prediction models. Then, the recursive feature elimination method was applied to eliminate unimportant features sequentially. Consequently, we obtained a subset of features that could lead to reduced model training time while preserving acceptable model performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권8호
• /
• pp.3984-4005
• /
• 2017

Image recognition has become an increasingly important topic for its wide application. It is highly challenging when facing to large-scale database with large variance. The recognition systems rely on a key component, i.e. the low-level feature or the learned mid-level feature. The recognition performance can be potentially improved if the data distribution information is exploited using a more sophisticated way, which usually a function over hidden variable, model parameter and observed data. These methods are called generative score space. In this paper, we propose a discriminative extension for the existing generative score space methods, which exploits class label when deriving score functions for image recognition task. Specifically, we first extend the regular generative models to class conditional models over both observed variable and class label. Then, we derive the mid-level feature mapping from the extended models. At last, the derived feature mapping is embedded into a discriminative classifier for image recognition. The advantages of our proposed approach are two folds. First, the resulted methods take simple and intuitive forms which are weighted versions of existing methods, benefitting from the Bayesian inference of class label. Second, the probabilistic generative modeling allows us to exploit hidden information and is well adapt to data distribution. To validate the effectiveness of the proposed method, we cooperate our discriminative extension with three generative models for image recognition task. The experimental results validate the effectiveness of our proposed approach.

• 한국콘텐츠학회논문지
• /
• 제19권1호
• /
• pp.125-131
• /
• 2019

소실점이란 실제 공간의 평행한 선들이 영상 내에 투영되면서 한곳에 모이는 점으로, 도로 공간에서의 소실점은 매우 중요한 공간정보이다. 도로 공간에서의 소실점을 이용해 추출된 차선의 위치를 개선하거나, 깊이지도 영상을 생성할 수 있다. 본 논문에서는 자동차의 시점을 기준으로 도로를 촬영한 영상을 Deep Neural Network(DNN)과 Histogram of Oriented Gradient(HoG) Feature를 이용한 소실점 검출 방법을 제안한다. 제안하는 알고리즘에서는 영상을 블록별로 나눠서 주요 에지 방향을 추출하는 HoG Feature 추출 단계와 DNN 학습 단계, 그리고 Test 단계로 나뉜다. 학습단계에서는 자동차 시점으로 기준으로 도로 영상 2300장으로 학습을 진행한다. 그리고 Test 단계에서는 Normalized Euclidean Distance(NormDist) 방법을 사용하여 제안하는 알고리즘의 효율성을 측정한다.

• 복식
• /
• 제54권3호
• /
• pp.99-112
• /
• 2004

The purpose of this research is to examine the relation between the cyber environment and the contemporary fashion design by studying the formative feature characteristics of cyber character's fashion in the on-line game from the point of the contemporary fashion design. The research method is to understand the general concept of the cyber-space and characters and then is to contemplate characteristics and formative features of game character's fashion of the cyber-space mainly with cyber characters that were closely linked with features of the contemporary fashion design. As a result, the formative feature of game character's fashion of the cyber-space was to be classified into four categories; reactionism, mechanism, futurism, sensualism. First, reactionism takes traditional elements with symbolical and compromising form. Second, mechanism has a tendency of deconstruction due to its vitality and sense of velocity for objects through employing geometrical forms and new materials. Third, futurism deviates from the established framework. It makes use of high-tech materials and has surrealistic and futuristic features. Fourth, sensualism does emphasize sensual parts of the body and intends to convey aesthetic atmosphere through association of ideas. Character's fashion of the cyber on-line game is unnatural and artificial in its forms and wear for the lack of knowledge for costume's structure, and it shows just simplified design that accept extremely partial fragment of features in the contemporary fashion design.

• 천문학회보
• /
• 제37권2호
• /
• pp.109.2-109.2
• /
• 2012

Current microlensing follow-up observations focus on high-magnification events because of the high efficiency of planet detection. However, central perturbations of high-magnification events caused by a planet can also be produced by a very close or a very wide binary companion, and the two kinds of central perturbations are not generally distinguished without time consuming detailed modeling (a planet-binary degeneracy). Hence, it is important to resolve the planet-binary degeneracy that occurs in high-magnification events. In this paper, we investigate caustic-crossing high-magnification events caused by a planet and a wide binary companion. From this study, we find that because of the different magnification excess patterns inside the central caustics induced by the planet and the binary companion, the light curves of the caustic-crossing planetary-lensing events exhibit a feature that is discriminated from those of the caustic-crossing binary-lensing events, and the feature can be used to immediately distinguish between the planetary and binary companions.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.1263-1266
• /
• 1998

In this paper, we propose an optimal feature extraction method for normally distributed multiclass data. We search the whole feature space to find a set of features that give the smallest classification error for the Gaussian ML classifier. Initially, we start with an arbitrary feature vector. Assuming that the feature vector is used for classification, we compute the classification error. Then we move the feature vector slightly and compute the classification error with this vector. Finally we update the feature vector such that the classification error decreases most rapidly. This procedure is done by taking gradient. Alternatively, the initial vector can be those found by conventional feature extraction algorithms. We propose two search methods, sequential search and global search. Experiment results show that the proposed method compares favorably with the conventional feature extraction methods.