• 제목/요약/키워드: projection matrix

Search Result 181, Processing Time 0.025 seconds

Online Parameter Estimation of SPMSM using Affine Projection Algorithm (Affine Projection 알고리즘을 이용한 표면 부착형 영구자석 전동기의 온라인 파라미터 추정)

  • Moon, Byung-Hun;Kim, Hyoung-Woo;Choi, Joon-Young
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.23 no.1
    • /
    • pp.66-71
    • /
    • 2018
  • We propose an online parameter estimation method for surface-mounted permanent-magnet synchronous motor (SPMSM) using an affine projection algorithm (APA). The proposed method estimates parameters with two APAs based on the discrete-time model equation of SPMSM during motor operation. The first APA is designed to estimate inductance, and the second APA is designed to estimate resistance and flux linkage. However, in case when the d-axis current is controlled to 0A, the second APA cannot estimate resistance and flux linkage simultaneously because the matrix rank in APA becomes deficient. To overcome this problem, we temporarily inject a negative reference current input to the d-axis control loop, and the matrix in the APA then becomes full rank, which enables the simultaneous estimation of resistance and flux linkage. The proposed method is verified by PSIM simulation and an actual experiment, and the results reveal that SPMSM parameters can be estimated online during motor operation.

Nonnegative variance component estimation for mixed-effects models

  • Choi, Jaesung
    • Communications for Statistical Applications and Methods
    • /
    • v.27 no.5
    • /
    • pp.523-533
    • /
    • 2020
  • This paper suggests three available methods for finding nonnegative estimates of variance components of the random effects in mixed models. The three proposed methods based on the concepts of projections are called projection method I, II, and III. Each method derives sums of squares uniquely based on its own method of projections. All the sums of squares in quadratic forms are calculated as the squared lengths of projections of an observation vector; therefore, there is discussion on the decomposition of the observation vector into the sum of orthogonal projections for establishing a projection model. The projection model in matrix form is constructed by ascertaining the orthogonal projections defined on vector subspaces. Nonnegative estimates are then obtained by the projection model where all the coefficient matrices of the effects in the model are orthogonal to each other. Each method provides its own system of linear equations in a different way for the estimation of variance components; however, the estimates are given as the same regardless of the methods, whichever is used. Hartley's synthesis is used as a method for finding the coefficients of variance components.

STOCHASTIC GRADIENT METHODS FOR L2-WASSERSTEIN LEAST SQUARES PROBLEM OF GAUSSIAN MEASURES

  • YUN, SANGWOON;SUN, XIANG;CHOI, JUNG-IL
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.25 no.4
    • /
    • pp.162-172
    • /
    • 2021
  • This paper proposes stochastic methods to find an approximate solution for the L2-Wasserstein least squares problem of Gaussian measures. The variable for the problem is in a set of positive definite matrices. The first proposed stochastic method is a type of classical stochastic gradient methods combined with projection and the second one is a type of variance reduced methods with projection. Their global convergence are analyzed by using the framework of proximal stochastic gradient methods. The convergence of the classical stochastic gradient method combined with projection is established by using diminishing learning rate rule in which the learning rate decreases as the epoch increases but that of the variance reduced method with projection can be established by using constant learning rate. The numerical results show that the present algorithms with a proper learning rate outperforms a gradient projection method.

Bilateral Diagonal 2DLDA Method for Human Face Recognition (얼굴 인식을 위한 쌍대각 2DLDA 방법)

  • Kim, Young-Gil;Song, Young-Jun;Kim, Dong-Woo;Ahn, Jae-Hyeong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.19 no.5
    • /
    • pp.648-654
    • /
    • 2009
  • In this paper, a method called bilateral diagonal 2DLDA is proposed for face recognition. Two methods called Dia2DPCA and Dia2DLDA were suggested to reserve the correlations between the variations in the rows and columns of diagonal images. However, these methods work in the row direction of these images. A row-directional projection matrix can be obtained by calculating the between-class and within-class covariance matrices making an allowance for the column variation of alternative diagonal face images. In addition, column-directional projection matrix can be obtained by calculating the between-class and within-class covariance matrices making an allowance for the row variation in diagonal images. A bilateral projection scheme was applied using left and right multiplying projection matrices. As a result, the dimension of the feature matrix and computation time can be reduced. Experiments carried out on an ORL face database show that the proposed method with three different distance measures, namely, Frobenius, Yang and AMD, is more accurate than some methods, such as 2DPCA, B2DPCA, 2DLDA, etc.

Three Dimensional Target Volume Reconstruction from Multiple Projection Images

  • Cheong, Kwang-Ho;Suh, Tae-Suk;Lee, Hyoung-Koo;Choe, Bo-Young
    • Proceedings of the Korean Society of Medical Physics Conference
    • /
    • 2002.09a
    • /
    • pp.439-441
    • /
    • 2002
  • The aim of this study is to reconstruct the 3D target volume from multiple projection images. It was assumed that we were already aware of the target position exactly, and all processes were performed in Target Coordinates whose origin was the center of the target. We used six projections: two projections were used to make a Reconstruction Box and four projections were for image acquisition. Reconstruction Box was made up of voxels of 3D matrix. Projection images were transformed into 3D volume in this virtual box using geometrical based back-projection method. Algorithm was applied to an ellipsoid model and horse-shoe shaped model. Projection images were created using C program language by geometrical method and reconstruction was also accomplished using C program language and Matlab(The Mathwork Inc., USA). For ellipsoid model, reconstructed volume was slightly overestimated but target shape and position was proved to be correct. For horse-shoe shaped model, reconstructed volume was somewhat different from original target model but there was a considerable improvement in target volume determination.

  • PDF

Model-Reduction of Linear Discrete Large-Scale Systems (행렬부호함수를 이용한 이산치 계통의 모델 저차화)

  • 천희영;박귀태;이창훈;박승규
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.35 no.8
    • /
    • pp.333-340
    • /
    • 1986
  • This paper presents an approach for determining the discrete reduced-order models for largescale system by using matrix sign function. We define projection operators based on the matrix sign function and develop the algorithm for model-reduction by using them. Simulation studies show that the proposed altgorithm is very useful.

  • PDF

Estimable functions of less than full rank linear model (불완전계수의 선형모형에서 추정가능함수)

  • Choi, Jaesung
    • Journal of the Korean Data and Information Science Society
    • /
    • v.24 no.2
    • /
    • pp.333-339
    • /
    • 2013
  • This paper discusses a method for getting a basis set of estimable functions of less than full rank linear model. Since model parameters are not estimable estimable functions should be identified for making inferences proper about them. So, it suggests a method of using full rank factorization of model matrix to find estimable functions in easy way. Although they might be obtained in many different ways of using model matrix, the suggested full rank factorization technique could be one of much easier methods. It also discusses how to use projection matrix to identify estimable functions.

Transmission waveform design for compressive sensing active sonar using the matrix projection from Gram matrix to identity matrix and a constraint for bandwidth (대역폭 제한 조건과 Gram 행렬의 단위행렬로의 사영을 이용한 압축센싱 능동소나 송신파형 설계)

  • Lee, Sehyun;Lee, Keunhwa;Lim, Jun-Seok;Cheong, Myoung-Jun
    • The Journal of the Acoustical Society of Korea
    • /
    • v.38 no.5
    • /
    • pp.522-533
    • /
    • 2019
  • The compressive sensing model for range-Doppler estimation can be expressed as an under-determined linear system y = Ax. To find the solution of the linear system with the compressive sensing method, matrix A should be sufficiently incoherent and x to be sparse. In this paper, we propose a transmission waveform design method that maintains the bandwidth required by the sonar system while lowering the mutual coherence of the matrix A so that the matrix A is incoherent. The proposed method combines two methods of optimizing the sensing matrix with the alternating projection and suppressing unwanted frequency bands using the DFT (Discrete Fourier Transform) matrix. We compare range-Doppler estimation performance of existing waveform LFM(Linear Frequency Modulated) and designed waveform using the matched filter and the compressive sensing method. Simulation shows that the designed transmission waveform has better detection performance than the existing waveform LFM.

Convergence Analysis of Noise Robust Modified AP(affine projection) Algorithm

  • Kim, Hyun-Tae;Park, Jang-Sik
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.1
    • /
    • pp.23-28
    • /
    • 2010
  • According to increasing projection order, the AP algorithm bas noise amplification problem in large background noise. This phenomenon degrades the performances of the AP algorithm. In this paper, we analyze convergence characteristic of the AP algorithm and then suggest a noise robust modified AP algorithm for reducing this problem. The proposed algorithm normalizes the update equation to reduce noise amplification of AP algorithm, by adding the multiplication of error power and projection order to auto-covariance matrix of input signal. By computer simulation, we show the improved performance than conventional AP algorithm.

One injection for a great projection: a quick and simple procedure for nipple reconstruction

  • Tanini, Sara;Calabrese, Sara;Lucattelli, Elena;Russo, Giulia Lo
    • Archives of Plastic Surgery
    • /
    • v.48 no.2
    • /
    • pp.179-184
    • /
    • 2021
  • Women attach great importance to the presence of a three-dimensional nipple upon completion of the breast reconstruction process. To meet patients' expectations, nipple-areolar complex reconstruction should achieve symmetry in position, size, shape, texture, and color, as well as minimizing donor-site morbidity. However, it is well known that regardless of the reconstructive technique, loss of nipple projection can be reasonably expected. We developed and evaluated a quick, simple, and innovative technique using injectable Integra Flowable Wound Matrix to increase nipple projection after reconstruction. Twenty breast cancer patients who underwent nipple reconstruction resulting in unsatisfactory projection were enrolled in our retrospective study. Nipple projection was measured at the time of surgery and after 6 and 12 months. A visual analogue scale was used to assess patients' satisfaction. Our technique yielded reliable results in terms of the long-lasting maintenance of nipple projection. This method is high-priced, but cost-effective, since one kit may suffice for three patients. Furthermore, our patients were very appreciative of this technique as a single-step, minimally invasive, painless procedure with no reported necessity of re-intervention.