• Title/Summary/Keyword: dimension reduction method

Search Result 250, Processing Time 0.022 seconds

Performance Improvement of Polynomial Adaline by Using Dimension Reduction of Independent Variables (독립변수의 차원감소에 의한 Polynomial Adaline의 성능개선)

  • Cho, Yong-Hyun
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.5 no.1
    • /
    • pp.33-38
    • /
    • 2002
  • This paper proposes an efficient method for improving the performance of polynomial adaline using the dimension reduction of independent variables. The adaptive principal component analysis is applied for reducing the dimension by extracting efficiently the features of the given independent variables. It can be solved the problems due to high dimensional input data in the polynomial adaline that the principal component analysis converts input data into set of statistically independent features. The proposed polynomial adaline has been applied to classify the patterns. The simulation results shows that the proposed polynomial adaline has better performances of the classification for test patterns, in comparison with those using the conventional polynomial adaline. Also, it is affected less by the scope of the smoothing factor.

  • PDF

A variation of face recognition rate according to the reduction of low dimension in PCA method (PCA 저차원 축소에 따른 조명 있는 얼굴의 인식률 변화)

  • Song, Young-Jun;Kim, Dong-Woo;Kim, Young-Gil;Kim, Nam
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2006.11a
    • /
    • pp.533-535
    • /
    • 2006
  • In this paper, we experiment a face recognition rate of the shaded faces except to low dimension feature vectors; first, second, third dimension. It is known to robust the face recognition against illumination. But, it isn't obvious what is effect to recognition in terms of low dimension. We are analysis to the effect of low dimension(first, second, third dimension, and combination of these) under the shaded faces.

  • PDF

An Ensemble Classifier using Two Dimensional LDA

  • Park, Cheong-Hee
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.6
    • /
    • pp.817-824
    • /
    • 2010
  • Linear Discriminant Analysis (LDA) has been successfully applied for dimension reduction in face recognition. However, LDA requires the transformation of a face image to a one-dimensional vector and this process can cause the correlation information among neighboring pixels to be disregarded. On the other hand, 2D-LDA uses 2D images directly without a transformation process and it has been shown to be superior to the traditional LDA. Nevertheless, there are some problems in 2D-LDA. First, it is difficult to determine the optimal number of feature vectors in a reduced dimensional space. Second, the size of rectangular windows used in 2D-LDA makes strong impacts on classification accuracies but there is no reliable way to determine an optimal window size. In this paper, we propose a new algorithm to overcome those problems in 2D-LDA. We adopt an ensemble approach which combines several classifiers obtained by utilizing various window sizes. And a practical method to determine the number of feature vectors is also presented. Experimental results demonstrate that the proposed method can overcome the difficulties with choosing an optimal window size and the number of feature vectors.

Model-based inverse regression for mixture data

  • Choi, Changhwan;Park, Chongsun
    • Communications for Statistical Applications and Methods
    • /
    • v.24 no.1
    • /
    • pp.97-113
    • /
    • 2017
  • This paper proposes a method for sufficient dimension reduction (SDR) of mixture data. We consider mixture data containing more than one component that have distinct central subspaces. We adopt an approach of a model-based sliced inverse regression (MSIR) to the mixture data in a simple and intuitive manner. We employed mixture probabilistic principal component analysis (MPPCA) to estimate each central subspaces and cluster the data points. The results from simulation studies and a real data set show that our method is satisfactory to catch appropriate central spaces and is also robust regardless of the number of slices chosen. Discussions about root selection, estimation accuracy, and classification with initial value issues of MPPCA and its related simulation results are also provided.

Speed Improvement of SURF Matching Algorithm Using Reduction of Searching Range Based on PCA (PCA기반 검색 축소 기법을 이용한 SURF 매칭 속도 개선)

  • Kim, Onecue;Kang, Dong-Joong
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.7
    • /
    • pp.820-828
    • /
    • 2013
  • Extracting unique features from an image is a fundamental issue when making panorama images, acquiring stereo images, recognizing objects and analyzing images. Generally, the task to compare features to other images requires much computing time because some features are formed as a vector which has many elements. In this paper, we present a method that compares features after reducing the feature dimension extracted from an image using PCA(principal component analysis) and sorting the features in a linked list. SURF(speeded up robust features) is used to describe image features. When the dimension reduction method is applied, we can reduce the computing time without decreasing the matching accuracy. The proposed method is proved to be fast and robust in experiments.

Vowel Recognition Using the Fractal Dimension (프랙탈 차원을 이용한 모음인식)

  • 최철영;김형순;김재호;손경식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.6
    • /
    • pp.1140-1148
    • /
    • 1994
  • In this paper, we carried out some experiments on the Korean vowel recognition using the fractal dimension of the speech signals. We chose the Minkowski-Bouligand dimension as the fractal dimension, and computed it using the morphological covering method. For our experiments, we used both the fractal dimension and the LPC cepstrum which is conventionally known to be one of the best parameters for speech recognition, and examined the usefulness of the fractal dimension. From the vowel recognition experiments under various consonant contexts, we achieved the vowel recognition error rates of 5.6% and 3.2% for the case with only LPC cepstrum and that with both LPC cepstrum and the fractal dimension, respectively. The results indicate that the incorporation of the fractal dimension with LPC cepstrum gives more than 40% reduction in recognition errors, and indicates that the fractal dimension is a useful feature parameter for speech recognition.

  • PDF

Principal selected response reduction in multivariate regression (다변량회귀에서 주선택 반응변수 차원축소)

  • Yoo, Jae Keun
    • The Korean Journal of Applied Statistics
    • /
    • v.34 no.4
    • /
    • pp.659-669
    • /
    • 2021
  • Multivariate regression often appears in longitudinal or functional data analysis. Since multivariate regression involves multi-dimensional response variables, it is more strongly affected by the so-called curse of dimension that univariate regression. To overcome this issue, Yoo (2018) and Yoo (2019a) proposed three model-based response dimension reduction methodologies. According to various numerical studies in Yoo (2019a), the default method suggested in Yoo (2019a) is least sensitive to the simulated models, but it is not the best one. To release this issue, the paper proposes an selection algorithm by comparing the other two methods with the default one. This approach is called principal selected response reduction. Various simulation studies show that the proposed method provides more accurate estimation results than the default one by Yoo (2019a), and it confirms practical and empirical usefulness of the propose method over the default one by Yoo (2019a).

Robust concurrent topology optimization of multiscale structure under load position uncertainty

  • Cai, Jinhu;Wang, Chunjie
    • Structural Engineering and Mechanics
    • /
    • v.76 no.4
    • /
    • pp.529-540
    • /
    • 2020
  • Concurrent topology optimization of macrostructure and microstructure has attracted significant interest due to its high structural performance. However, most of the existing works are carried out under deterministic conditions, the obtained design may be vulnerable or even cause catastrophic failure when the load position exists uncertainty. Therefore, it is necessary to take load position uncertainty into consideration in structural design. This paper presents a computational method for robust concurrent topology optimization with consideration of load position uncertainty. The weighted sum of the mean and standard deviation of the structural compliance is defined as the objective function with constraints are imposed to both macro- and micro-scale structure volume fractions. The Bivariate Dimension Reduction method and Gauss-type quadrature (BDRGQ) are used to quantify and propagate load uncertainty to calculate the objective function. The effective properties of microstructure are evaluated by the numerical homogenization method. To release the computation burden, the decoupled sensitivity analysis method is proposed for microscale design variables. The bi-directional evolutionary structural optimization (BESO) method is used to obtain the black-and-white designs. Several 2D and 3D examples are presented to validate the effectiveness of the proposed robust concurrent topology optimization method.

Music Mood Classification based on a New Feature Reduction Method and Modular Neural Network (단위 신경망과 특징벡터 차원 축소 기반의 음악 분위기 자동판별)

  • Song, Min Kyun;Kim, HyunSoo;Moon, Chang-Bae;Kim, Byeong Man;Oh, Dukhwan
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.18 no.4
    • /
    • pp.25-35
    • /
    • 2013
  • This paper focuses on building a generalized mood classification model with many mood classes instead of a personalized one with few mood classes. Two methods are adopted to improve the performance of mood classification. The one of them is feature reduction based on standard deviation of feature values, which is designed to solve the problem of lowered performance when all 391 features provided by MIR toolbox used to extract features of music. The experiments show that the feature reduction methods suggested in this paper have better performance than that of the conventional dimension reduction methods, R-Square and PCA. As performance improvement by feature reduction only is subject to limit, modular neural network is used as another method to improve the performance. The experiments show that the method also improves performance effectively.

Measurement of Rock Slope Joint using 3D Image Processing (3차원 영상처리를 이용한 암반 사면의 절리 측정에 관한 연구)

  • Lee, Seung-Ho;Hwang, Jeong-Cheol;Sim, Seok-Rae;Jeong, Tae-Young
    • Proceedings of the Korean Geotechical Society Conference
    • /
    • 2005.03a
    • /
    • pp.854-861
    • /
    • 2005
  • Studied accuracy and practical use possibility of joint measurement that using 3D laser scanner to rock slope. Measured joint of Rock slope and comparison applied 3 dimension laser scanner and clinometer. 3D laser scanning system preserves on computer calculating to 3 dimension coordinate scaning laser to object. and according to laser measurement method of interior, produce correct vector value from charge-coupled device(CCD) or laser reciver and telegram register and time measuring equipment. Create of object x, y, z point coordinates to 3 dimension space of computer. Such 3 dimension point datum (Point Clouds) forms relocate position informations that exist to practical space to computer space. Practical numerical values related between each other. Compared joint distribution and direction that measured by laser scanner and clinometer. By the result, Distribution of joint projected almost equally. Could get more joint datas by measurement of 3 dimension scanner than measured by clinometer. Therefore, There is effect that objectification of rock slope investigation data, shortening of investigation periods, investigation reduction of cost. could know that it is very effective method in joint measuring.

  • PDF