• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2001년도 봄 학술발표논문집 Vol.28 No.1 (B)
• /
• pp.151-153
• /
• 2001

Feature Simplification is an essential method for multiple representations of spatial features in GIS. However, spatial features re various, complex and a alrge size. Among spatial features which describe spatial information. linear feature is the msot common. Therefore, an efficient linear feature simplification method is most critical for spatial feature simplification in GIS. This paper propose an original method, by which the problem of linear feature simplification is mapped into the signal processing field. This method avoids conventional geometric computing in existing methods and exploits the advantageous properties of wavelet transform. Experimental results are presented to show that the proposed method outperforms the existing methods and achieves the time complexity of O(n), where n is the number of points of a linear feature. Furthermore, this method is not bound to two-dimension but can be extended to high-dimension space.

• Genomics & Informatics
• /
• 제17권4호
• /
• pp.39.1-39.20
• /
• 2019

Analyzing patterns in data points embedded in linear and non-linear feature spaces is considered as one of the common research problems among different research areas, for example: data mining, machine learning, pattern recognition, and multivariate analysis. In this paper, data points are heterogeneous sets of biosequences (composite data points). A composite data point is a set of ordinary data points (e.g., set of feature vectors). We theoretically extend the derivation of the largest generalized eigenvalue-based distance metric D_ij(γ₁) in any linear and non-linear feature spaces. We prove that D_ij(γ₁) is a metric under any linear and non-linear feature transformation function. We show the sufficiency and efficiency of using the decision rule $\bar{{\delta}}_{{\Xi}i}$(i.e., mean of D_ij(γ₁)) in classification of heterogeneous sets of biosequences compared with the decision rules min_𝚵iand median_𝚵i. We analyze the impact of linear and non-linear transformation functions on classifying/clustering collections of heterogeneous sets of biosequences. The impact of the length of a sequence in a heterogeneous sequence-set generated by simulation on the classification and clustering results in linear and non-linear feature spaces is empirically shown in this paper. We propose a new concept: the limiting dispersion map of the existing clusters in heterogeneous sets of biosequences embedded in linear and nonlinear feature spaces, which is based on the limiting distribution of nucleotide compositions estimated from real data sets. Finally, the empirical conclusions and the scientific evidences are deduced from the experiments to support the theoretical side stated in this paper.

• 대한전자공학회논문지
• /
• 제20권1호
• /
• pp.7-14
• /
• 1983

직선 및 곡선과 같은 선형 특징은 영상 처리에 있어 중요한 특징중의 하나이다. 본 논문에서는 의미있는 선형 특징의 새로운 기법이 제안된다. 이 기법은 그래프 이론의 미니멀 스패닝 트리를 이용하여 경계점들을 연결하고 그 다음, 헤어(의미없는 잔가지)와 불합리한 선분을 제거한다. 이와 같이 추적된 선형 특징을 근사화 묘사하기 위하여 부분 선형 근사화를 수행한다. 본 논문에서 제안된 기법으로 실험을 수행하여 그 결과를 보여 주었다.

• 한국측량학회:학술대회논문집
• /
• 한국측량학회 2010년 춘계학술발표회 논문집
• /
• pp.5-6
• /
• 2010

Needs for the methodology of segmentation of linear feature according to the shape characteristics of line feature are increasing in cartographic linear generalization. In this study, the line segmentation method using expansible moving window is presented. This method analyzes the generalization effect of line simplification algorithms depend on the line characters of linear feature and extracts the sections which show exclusively low positional error due to a specific algorithm. The description measurements of these segments are calculated and the target line data are segmented based on the measurements. For segmenting the linear feature to a homogeneous section, expansible moving window is applied. This segmentation method is expected to be used in the cartographic map generalization considering the shape characteristics of linear feature.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.394-394
• /
• 2000

This Paper proposes a new nonlinear partial least square method that extends the linear PLS. Proposed nonlinear PLS uses self-organizing feature map as PLS outer relation and multilayer neural network as PLS inner regression method.

• 한국지능시스템학회논문지
• /
• 제22권6호
• /
• pp.793-798
• /
• 2012

In this paper, we explored the new method for extracting feature from the electroencephalography (EEG) signal based on linear regression technique with the orthonormal polynomial bases. At first, EEG signals from electrodes around motor cortex were selected and were filtered in both spatial and temporal filter using band pass filter for alpha and beta rhymic band which considered related to the synchronization and desynchonization of firing neurons population during motor imagery task. Signal from epoch length 1s were fitted into linear regression with Legendre polynomials bases and extract the linear regression weight as final features. We compared our feature to the state of art feature, power band feature in binary classification using support vector machine (SVM) with 5-fold cross validations for comparing the classification accuracy. The result showed that our proposed method improved the classification accuracy 5.44% in average of all subject over power band features in individual subject study and 84.5% of classification accuracy with forward feature selection improvement.

• 대한음성학회지:말소리
• /
• 제29_30호
• /
• pp.43-60
• /
• 1995

Standard generative phonologists assumed that there were no orders or hierarchies among distinctive features. This means that the distinctive features which make up a segment are independent and unordered. The unordered linear matrix cannot explain phonological phenomena such as complex segments as hierarchical representation does neatly. The hierarchical feature representation theory which embodies the concept of multi-tiered phonological representation organizes distinctive features in the appearance of hierarchical dominance. This paper aims to show how we can solve some problems of the linear feature representation. As regard underlying representation the theory of underspecification is discussed. I propose a feature hierarchy similar to that of Sagey(1986) but slightly different. I show English consonantal assimilation in feature hierarchical model compared with that of feature changing theory of linear representation.

• 한국지능시스템학회논문지
• /
• 제20권1호
• /
• pp.101-108
• /
• 2010

본 논문에서는 퍼지 k-NN과 reconstruction error에 기반을 둔 feature selection을 이용한 lazy 분류기 설계를 제안하였다. Reconstruction error는 locally linear reconstruction의 평가 지수이다. 새로운 입력이 주어지면, 퍼지 k-NN은 local 분류기가 유효한 로컬 영역을 정의하고, 로컬 영역 안에 포함된 데이터 패턴에 하중 값을 할당한다. 로컬 영역과 하중 값을 정의한 우에, feature space의 차원을 감소시키기 위하여 feature selection이 수행된다. Reconstruction error 관점에서 우수한 성능을 가진 여러 개의 feature들이 선택 되어 지면, 다항식의 일종인 분류기가 하중 최소자승법에 의해 결정된다. 실험 결과는 기존의 분류기인 standard neural networks, support vector machine, linear discriminant analysis, and C4.5 trees와 비교 결과를 보인다.

• 대한음성학회지:말소리
• /
• 제33_34호
• /
• pp.71-89
• /
• 1997

In the framework of linear representation which allows for no internal structure within features, there is no way to represent nonlinear phonological phenomena such as complex segments. This paper shows how we carl solve some problems of the linear feature theory in relation to the hierarchical feature theory. The purpose of this paper is to explain lateral assimilation under hierarchical feature representation. Although arguments for the position of classes of distinctive features have been made the position of (lateral) remains the issue of debate. Sagey(1988) argues that the feature [lateral] is structurally dependent on the root node. In contrast Rice & Avery (1991) put the feature (lated) under the spontaneous voicing. I have discussed previous studies of feature hierarchy and I propose a revised model of feature representation. Within this model I have shown how well feature geometry describes lateralization as feature spreading.

• 대한전자공학회논문지SP
• /
• 제43권2호
• /
• pp.82-86
• /
• 2006

패턴인식 시스템은 일반적으로 데이터의 전처리, 특징 추출, 학습단계의 과정을 거쳐서 개발되어 진다. 그중에서도 특징 추출 과정은 다차원 공간을 가진 입력 데이터의 복잡도를 줄여서 다음 단계인 학습단계에서 계산 복잡도와 인식률을 향상시키는 역할을 한다. 패턴인식에서 특징 추출 기법으로써 principal component analysis, factor analysis, linear discriminant analysis 같은 방법들이 널리 사용되어져 왔다. 이 논문에서는 singular value decomposition (SVD) 방법이 패턴인식 시스템의 특징 추출과정에 유용하게 사용될 수 있음을 보인다. 특징 추출단계에서 SVD 기법의 유용성을 검증하기 위하여 원격탐사 응용에 적용하였는데, 실험결과는 널리 쓰이는 PCA에 비해 약 25%의 인식률의 향상을 가져온다는 것을 알 수 있다.