• 한국멀티미디어학회논문지
• /
• 제11권6호
• /
• pp.777-786
• /
• 2008

Human face avatar is important information in nowadays, such as describing real people in virtual world. In this paper, we have presented a face avatar creation and warping algorithm by using face feature analysis method, in order to detect face feature, we utilized local mean method based on facial feature appearance and face geometric information. Then detect facial candidates by using it's character in $YC_bC_r$ color space. Meanwhile, we also defined the rules which are based on face geometric information to limit searching range. For analyzing face feature, we used face feature points to describe their feature, and analyzed geometry relationship of these feature points to create the face avatar. Then we have carried out simulation on PC and embed mobile device such as PDA and mobile phone to evaluate efficiency of the proposed algorithm. From the simulation results, we can confirm that our proposed algorithm will have an outstanding performance and it's execution speed can also be acceptable.

• 한국실내디자인학회논문집
• /
• 제26권1호
• /
• pp.3-12
• /
• 2017

In today's society, Monolithic expresses itself as a single featured work with a consistent exterior in the urban environment. In particular, such characteristics of the monolithic work have become increasingly influential in the modern society with the emergence of the minimalism. Monolithic architecture in modern has common feature which is maintaining simple construction format (Mass) with complicated and abundance space (Volume) inside. This simple architecture exterior leads new stimulus which is different from previous format and evokes unique sensibility and thoughts with monumental expressing. Uniformed exterior revealed thru purity of material builds up strong presence by itself. In contract with simple exterior, diverse space is expressed by consistent concept and process. Through this, it shows creating metaphorical space and space-oriented feature. We can interpret modern monolithic architecture as a sensation and alternative against Gestalt architecture in consequence of chasing clarity, visual stimulus and uncertain tendency only. It provides architectural experience by spatial imaginary and unexpected space development to users through exclusivetendency against outside and stressing un-private, we can evaluate its value as a space-oriented construction which helped us to think about space meaning in modern society.

• 한국항공우주학회지
• /
• 제45권9호
• /
• pp.794-806
• /
• 2017

지속적으로 우주파편이 증가하고 있는 상황에서 국가 우주자산을 안전하게 보호하고 우주개발국으로서 우주환경 보호에 관심을 가지는 것은 중요하다. 우주파편의 급격한 증가를 막기 위한 효과적인 방법 중 하나는 충돌위험이 큰 우주파편들, 그리고 임무가 종료된 폐기위성을 직접 제거해 나가는 것이다. 본 논문에서는 영상기반 우주파편 추적시스템의 안정적인 인식모델을 위해 인공신경망을 적용한 연구에 대해 다루었다. 한국항공우주연구원에서 개발한 지상기반 우주쓰레기 청소위성 테스트베드인 KARICAT을 활용하여 우주환경이 모사된 영상을 획득하였고, 깊이불연속성에 기인한 영상분할 후 각 객체에 대한 구조 및 색상 기반 특징을 부호화한 벡터를 추출하였다. 특징벡터는 3차원 표면적, 점군의 주성분 벡터, 2차원 형상정보, 색상기반 정보로 구성되어있으며, 이 범주를 기반으로 분리한 특징벡터를 입력으로 하는 인공신경망 모델을 설계하였다. 또한 인공신경망의 성능 향상을 위해 입력되는 특징벡터의 범주에 따라 모델을 분할하여 각 모델 별 학습 후 앙상블기법을 적용하였다. 적용 결과 앙상블 기법에 따른 인식 모델의 성능 향상을 확인하였다.

• 전자공학회논문지B
• /
• 제29B권8호
• /
• pp.44-53
• /
• 1992

In this paper, a matching method is proposed to improve the correct matching rate in stereo correspondence matching in which the fingerprint of zero-crossing points on the scale-space is used as the robust matching feature. The dynamic programming, which is appropriate for the fingerprint feature, is introduced for correspondence matching. We also improve the matching rate by using the post-processing for correcting mismatched points. In simulation, we apply the proposed algorithm to the synthetic and real images and obtain good matching results.

• Journal of Information Technology Applications and Management
• /
• 제23권2호
• /
• pp.143-152
• /
• 2016

We can organize, manage, search, and process the documents efficiently by a document clustering. In general, the documents are clustered in a high dimensional feature space because the documents consist of many terms. In this paper, we propose a new method to cluster the documents efficiently in a low dimensional feature space by finding the core concepts from a domain ontology corresponding to the particular area documents. The experiment shows that our clustering method has a good performance.

• Communications for Statistical Applications and Methods
• /
• 제20권3호
• /
• pp.175-184
• /
• 2013

Kernel principal component analysis(PCA) maps observations in nonlinear feature space to a reduced dimensional plane of principal components. We do not need to specify the feature space explicitly because the procedure uses the kernel trick. In this paper, we propose a graphical scheme to represent variables in the kernel principal component analysis. In addition, we propose an index for individual variables to measure the importance in the principal component plane.

• Journal of Astronomy and Space Sciences
• /
• 제33권4호
• /
• pp.319-321
• /
• 2016

Reviewing the two MeV-GeV investigations in the field of the HESS J1745-303 performed using Fermi Large Area Telescope data, we confirmed that the emission peak comfortably coincides with 'Region A' in the TeV regime, which is the brightest part of this feature. The MeV-TeV spectrum can be precisely described by a single power-law. Also, recent investigation has shown that the MeV-GeV feature is elongated from 'Region A' toward the north-west, which is similar to the case of largescale atomic/molecular gas distribution.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제31권12호
• /
• pp.1684-1690
• /
• 2004

본 논문은 시험 표본 주위의 영역에 대한 속성을 이용한 다중 인식기 선택 방법을 제안한다. 기존의 DCS-LA 동적 인식기 선택 방법은 시험 표본 주위의 학습표본들을 사용해서 각 인식기의 국부적 정확성을 계산하여 인식기를 동적으로 선택하기 때문에 인식 시간이 오래 걸린다. 본 논문에서는 특징공간에서 국부적인 속성을 계산해서 그 속성값에 적합한 인식기를 미리 선정해서 저장해 놓은 후 시험 표본이 들어오면 그 주변의 속성값에 따라 저장된 인식기에서 선택을 하기 때문에 인식시간을 줄일 수 있다. 국부적인 속성으로는 표본 주위의 작은 영역에 대한 엔트로피와 밀도를 계산하여 사용하였으며 이들을 특징공간속성(Feature Space Attribute)라고 하였다. 이들 두 속성으로 이루어지는 속성 공간을 규칙적인 사각형 셀로 나누어, 학습과정에서 각각의 학습표본에 대해 계산된 속성값이 어떤 셀에 속하는지를 구한다. 또한 각 셀에 속하는 학습표본들에 대해 각 인식기의 국부적 정확도를 구하여 셀에 저장한다. 시험 과정에서 시험표본에 대해 속성값 계산을 통해 그 표본이 속하는 셀을 구한 후 그 셀에서 국부적 정확도가 가장 높은 인식기로 인식한다. Elena 데이타베이스를 사용해서 기존의 방법과 제안된 방법을 비교하였다. 제안된 방법은 기존의 DCS-LA와 거의 같은 인식률을 나타내지만 인식속도는 약 4배 가까이 빨라짐을 실험을 통해 확인할 수 있었다.

• 한국멀티미디어학회논문지
• /
• 제14권12호
• /
• pp.1544-1548
• /
• 2011

A process of choosing a subset of original features, so called feature selection, is considered as a crucial preprocessing step to image processing applications. There are already large pools of techniques developed for machine learning and data mining fields. In this paper, basically two methods, non-feature selection and feature selection, are investigated to compare their predictive effectiveness of classification. Color co-occurrence feature is used for defining image features. Standard Sequential Forward Selection algorithm are used for feature selection to identify relevant features and redundancy among relevant features. Four color spaces, RGB, YCbCr, HSV, and Gaussian space are considered for computing color co-occurrence features. Gray-level image feature is also considered for the performance comparison reasons. The experimental results are presented.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권9호
• /
• pp.4317-4335
• /
• 2018

Semi-supervised multi-view latent space learning is gaining considerable popularity recently in many machine learning applications due to the high cost and difficulty to obtain the large amount of label information of data. Although some semi-supervised multi-view latent space learning methods have been presented, there is still much space for improvement: 1) How to learn latent discriminant intact feature representations by employing data of multiple views; 2) How to exploit the manifold structure of both labeled and unlabeled point in the learned latent intact space effectively. To address the above issues, we propose an approach called semi-supervised multi-view manifold discriminant intact space learning ($SM^2DIS$) for image classification in this paper. $SM^2DIS$ aims to seek a manifold discriminant intact space for data of different views by making use of both the discriminant information of labeled data and the manifold structure of both labeled and unlabeled data. Experimental results on MNIST, COIL-20, Multi-PIE, and Caltech-101 databases demonstrate the effectiveness and robustness of our proposed approach.