• 제목/요약/키워드: Subspace Projection

검색결과 69건 처리시간 0.032초

A PROJECTION ALGORITHM FOR SYMMETRIC EIGENVALUE PROBLEMS

  • PARK, PIL SEONG
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제3권2호
    • /
    • pp.5-16
    • /
    • 1999
  • We introduce a new projector for accelerating convergence of a symmetric eigenvalue problem Ax = x, and devise a power/Lanczos hybrid algorithm. Acceleration can be achieved by removing the hard-to-annihilate nonsolution eigencomponents corresponding to the widespread eigenvalues with modulus close to 1, by estimating them accurately using the Lanczos method. However, the additional Lanczos results can be obtained without expensive matrix-vector multiplications but a very small amount of extra work, by utilizing simple power-Lanczos interconversion algorithms suggested. Numerical experiments are given at the end.

  • PDF

스위칭 다이나믹을 이용한 단순화된 극점 배치 기법의 개발 (Development of a simplified pole-placement design using swtching dynamics)

  • 박귀태;김동식;서삼준;서호준
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
    • /
    • pp.947-952
    • /
    • 1993
  • A simplified pole-placement design method is developed by analysing dynamic characteristics of the switching dynamics. Unlike the design procedure of conventional pole-placement, in the proposed method, overall state-space is directly decomposed into two invariant subspaces by the projection operator which is defined in the equivalent system, and then the closed-loop poles are assigned to each subspace independently. Hence, computations for state-feedback gain matrix are easy and simple.

  • PDF

조명영향 분리 얼굴 고유특성 텍스쳐 부분공간 기반 얼굴 이미지 조명 정규화 (Face Illumination Normalization based on Illumination-Separated Face Identity Texture Subspace)

  • 최종근;정선태;조성원
    • 대한전자공학회논문지SP
    • /
    • 제47권1호
    • /
    • pp.25-34
    • /
    • 2010
  • 다양한 조명 환경에서 강인한 얼굴 인식 성취는 어렵다. 조명에 강인한 얼굴 인식을 위해서 보통 전처리 단계로 얼굴 이미지 조명 정규화를 수행한다. 기존 조명 전처리 기법들은 투영 음영을 효과적으로 처리할 수 없다. 본 논문에서는 조명 영향 분리 얼굴 고유특성 텍스쳐 부분공간에 기반한 새로운 얼굴 조명 정규화 기법을 제안한다. 조명분리 얼굴 고유특성 텍스쳐 부분 공간은 얼굴 텍스쳐 공간에서 조명 변화 영향이 분리된 부분공간으로 구축되기 때문에 얼굴 이미지를 이 부분공간으로 투영하여 얻은 얼굴 이미지는 조명 변화 영향이 최소화된 좋은 조명 정규화를 달성한다. 실험을 통해 본 논문에서 제안한 얼굴 조명정규화 기법이 표면 음영뿐만 아니라 투영 음영도 효과적으로 제거할 수 있으며, 좋은 얼굴 조명 정규화를 달성한다는 것을 확인하였다.

Improved Leakage Signal Blocking Methods for Two Channel Generalized Sidelobe Canceller

  • Kim, Ki-Hyeon;Ko, Han-Seok
    • 음성과학
    • /
    • 제13권1호
    • /
    • pp.117-128
    • /
    • 2006
  • The two-channel Generalized Sidelobe Canceller (GSC) scheme suffers from the presence of leakage signal in the reference channel. The leakage signal is caused by the dissimilar impulse responses between microphones, and different paths from speech source to microphones. Such leakage is detrimental to speech enhancement of the GSC since the desired reference signal becomes corrupted. In order to suppress the signal leakage, two matrix injection methods are proposed. In the first method, a simple gain compensation matrix is used. In the second, a projection matrix for reducing the error between the actual and the ideal primary and reference signals, is used. This paper describes the performance degradation resulting from leakage, and proposes effective methods to resolve the problem. Representative experiments were conducted to demonstrate the effectiveness of the proposed methods on recorded speech and noise in an actual automobile environment.

  • PDF

Transferring Skin Weights to 3D Scanned Clothes

  • Yoon, Seung-Hyun;Kim, Taejoon;Kim, Ho-Won;Lee, Jieun
    • ETRI Journal
    • /
    • 제38권6호
    • /
    • pp.1095-1103
    • /
    • 2016
  • We present a method for transferring deformation weights of a human character to three-dimensional (3D) scanned clothes. First, clothing vertices are projected onto a character skin. Their deformation weights are determined from the barycentric coordinates of the projection points. For more complicated parts, such as shoulders and armpits, continuously moving planes are constructed and employed as projection reference planes. Clothing vertices on a plane are projected onto the intersection curve of the plane with a character skin to achieve a smooth weight transfer. The proposed method produces an initial deformation for physically based clothing simulations. We demonstrated the effectiveness of our method through several deformation results for 3D scanned clothes.

Nonnegative estimates of variance components in a two-way random model

  • Choi, Jaesung
    • Communications for Statistical Applications and Methods
    • /
    • 제26권4호
    • /
    • pp.337-346
    • /
    • 2019
  • This paper discusses a method for obtaining nonnegative estimates for variance components in a random effects model. A variance component should be positive by definition. Nevertheless, estimates of variance components are sometimes given as negative values, which is not desirable. The proposed method is based on two basic ideas. One is the identification of the orthogonal vector subspaces according to factors and the other is to ascertain the projection in each orthogonal vector subspace. Hence, an observation vector can be denoted by the sum of projections. The method suggested here always produces nonnegative estimates using projections. Hartley's synthesis is used for the calculation of expected values of quadratic forms. It also discusses how to set up a residual model for each projection.

PROJECTIONS OF ALGEBRAIC VARIETIES WITH ALMOST LINEAR PRESENTATION II

  • Ahn, Jeaman
    • 충청수학회지
    • /
    • 제34권2호
    • /
    • pp.181-188
    • /
    • 2021
  • Let X be a nondegenerate reduced closed subscheme in ℙn. Assume that πq : X → Y = πq(X) ⊂ ℙn-1 is a generic projection from the center q ∈ Sec(X) \ X where Sec(X) = ℙn. Let Z be the singular locus of the projection πq(X) ⊂ ℙn-1. Suppose that IX has the almost minimal presentation, which is of the form R(-3)β2,1 ⊕ R(-4) → R(-2)β1,1 → IX → 0. In this paper, we prove the followings: (a) Z is either a linear space or a quadric hypersurface in a linear subspace; (b) $H^1({\mathcal{I}_X(k)})=H^1({\mathcal{I}_Y(k)})$ for all k ∈ ℤ; (c) reg(Y) ≤ max{reg(X), 4}; (d) Y is cut out by at most quartic hypersurfaces.

Two Dimensional Slow Feature Discriminant Analysis via L2,1 Norm Minimization for Feature Extraction

  • Gu, Xingjian;Shu, Xiangbo;Ren, Shougang;Xu, Huanliang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권7호
    • /
    • pp.3194-3216
    • /
    • 2018
  • Slow Feature Discriminant Analysis (SFDA) is a supervised feature extraction method inspired by biological mechanism. In this paper, a novel method called Two Dimensional Slow Feature Discriminant Analysis via $L_{2,1}$ norm minimization ($2DSFDA-L_{2,1}$) is proposed. $2DSFDA-L_{2,1}$ integrates $L_{2,1}$ norm regularization and 2D statically uncorrelated constraint to extract discriminant feature. First, $L_{2,1}$ norm regularization can promote the projection matrix row-sparsity, which makes the feature selection and subspace learning simultaneously. Second, uncorrelated features of minimum redundancy are effective for classification. We define 2D statistically uncorrelated model that each row (or column) are independent. Third, we provide a feasible solution by transforming the proposed $L_{2,1}$ nonlinear model into a linear regression type. Additionally, $2DSFDA-L_{2,1}$ is extended to a bilateral projection version called $BSFDA-L_{2,1}$. The advantage of $BSFDA-L_{2,1}$ is that an image can be represented with much less coefficients. Experimental results on three face databases demonstrate that the proposed $2DSFDA-L_{2,1}/BSFDA-L_{2,1}$ can obtain competitive performance.

점진적 프로젝션을 이용한 고차원 글러스터링 기법 (High-Dimensional Clustering Technique using Incremental Projection)

  • 이혜명;박영배
    • 한국정보과학회논문지:데이타베이스
    • /
    • 제28권4호
    • /
    • pp.568-576
    • /
    • 2001
  • 대부분의 클러스터링 알고리즘들은 고차원 공간에서 성능이 급격히 저하되는 경향이 있다. 더욱이 고차원 데이타는 상당한 양의 잡음 데이타를 포함하고 있으므로 알고리즘의 추가적인 효과성 문제를 야기한다. 그러므로 고차원 데이타의 구조와 특성을 지원하는 적합한 클러스터링 기법이 개발되어야 한다. 본 논문에서는 선형변환 프로젝션을 이용한 클러스터링 알고리즘 CLIP을 제안한다. CLIP은 고차원 클러스터링의 효율성 및 효과성 문제를 극복하기 위해 개발되었으며, 클러스터 형성에 밀접하게 연관된 부분 공간에서 클러스터를 탐사하는 기법이다. 알고리즘의 주요 사상은 각1차원적 부분공간에서의 클러스터링에 기본을 두고 있지만. 점진적인 프로젝션을 이용하여 고차원 클러스터를 탐사한 뿐만 아니라 연산을 획기적으로 줄인다. CLIP의 성능을 평가하기 위해 합성 데이타를 이용한 일련의 실험을 통하여 효율성 및 효과성을 증명한다

  • PDF

양서류 울음 소리 식별을 위한 특징 벡터 및 인식 알고리즘 성능 분석 (Performance assessments of feature vectors and classification algorithms for amphibian sound classification)

  • 박상욱;고경득;고한석
    • 한국음향학회지
    • /
    • 제36권6호
    • /
    • pp.401-406
    • /
    • 2017
  • 본 논문에서는 양서류 울음소리를 통한 종 인식 시스템 개발을 위해, 음향 신호 분석에서 활용되는 주요 알고리즘의 인식 성능을 평가했다. 먼저, 멸종위기 종을 포함하여 총 9 종의 양서류를 선정하여, 각 종별 울음소리를 야생에서 녹음하여 실험 데이터를 구축했다. 성능평가를 위해, MFCC(Mel Frequency Cepstral Coefficient), RCGCC(Robust Compressive Gammachirp filterbank Cepstral Coefficient), SPCC(Subspace Projection Cepstral Coefficient)의 세 특징벡터와 GMM(Gaussian Mixture Model), SVM(Support Vector Machine), DBN-DNN(Deep Belief Network - Deep Neural Network)의 세 인식기가 고려됐다. 추가적으로, 화자 인식에 널리 사용되는 i-vector를 이용한 인식 실험도 수행했다. 인식 실험 결과, SPCC-SVM의 경우 98.81 %로 가장 높은 인식률을 확인 할 수 있었으며, 다른 알고리즘에서도 90 %에 가까운 인식률을 확인했다.