• 제목/요약/키워드: i-vectors

검색결과 318건 처리시간 0.027초

On the Distribution of the Scaled Residuals under Multivariate Normal Distributions

  • Cheolyong Park
    • Communications for Statistical Applications and Methods
    • /
    • 제5권3호
    • /
    • pp.591-597
    • /
    • 1998
  • We prove (at least empirically) that some forms of the scaled residuals calculated from i.i.d. multivariate normal random vectors are ancillary. We further show that, if the scaled residuals are ancillary, then they have the same distribution whatever form of rotation is rosed to remove sample correlations.

  • PDF

POSITION VECTORS OF A SPACELIKE W-CURVE IN MINKOWSKI SPACE 𝔼13

  • Ilarslan, Kazim;Boyacioglu, Ozgur
    • 대한수학회보
    • /
    • 제44권3호
    • /
    • pp.429-438
    • /
    • 2007
  • In this paper, we study the position vectors of a spacelike W-curve (or a helix), i.e., curve with constant curvatures, with spacelike, timelike and null principal normal in the Minkowski 3-space $\mathbb{E}_1^3$. We give some characterizations for spacelike W - curves whose image lies on the pseudohyperbolical space $\mathbb{H}_0^2$ and Lorentzian sphere $\mathbb{S}_1^2$ by using the positions vectors of the curve.

AE 신호 및 신경회로망을 이용한 공작기계 주축용 베어링 결함검출 (Detection of Main Spindle Bearing Defects in Machine Tool by Acoustic Emission Signal via Neural Network Methodology)

  • 정의식
    • 한국생산제조학회지
    • /
    • 제6권4호
    • /
    • pp.46-53
    • /
    • 1997
  • This paper presents a method of detection localized defects on tapered roller bearing in main spindle of machine tool system. The feature vectors, i.e. statistical parameters, in time-domain analysis technique have been calculated to extract useful features from acoustic emission signals. These feature vectors are used as the input feature of an neural network to classify and detect bearing defects. As a results, the detection of bearing defect conditions could be sucessfully performed by using an neural network with statistical parameters of acoustic emission signals.

  • PDF

An Application of a Parallel Algorithm on an Image Recognition

  • Baik, Ran
    • Journal of Multimedia Information System
    • /
    • 제4권4호
    • /
    • pp.219-224
    • /
    • 2017
  • This paper is to introduce an application of face recognition algorithm in parallel. We have experiments of 25 images with different motions and simulated the image recognitions; grouping of the image vectors, image normalization, calculating average image vectors, etc. We also discuss an analysis of the related eigen-image vectors and a parallel algorithm. To develop the parallel algorithm, we propose a new type of initial matrices for eigenvalue problem. If A is a symmetric matrix, initial matrices for eigen value problem are investigated: the "optimal" one, which minimize ${\parallel}C-A{\parallel}_F$ and the "super optimal", which minimize ${\parallel}I-C^{-1}A{\parallel}_F$. In this paper, we present a general new approach to the design of an initial matrices to solving eigenvalue problem based on the new optimal investigating C with preserving the characteristic of the given matrix A. Fast all resulting can be inverted via fast transform algorithms with O(N log N) operations.

동영상 검색을 위한 템포럴 텍스처 모델링 (Temporal Texture modeling for Video Retrieval)

  • 김도년;조동섭
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제50권3호
    • /
    • pp.149-157
    • /
    • 2001
  • In the video retrieval system, visual clues of still images and motion information of video are employed as feature vectors. We generate the temporal textures to express the motion information whose properties are simple expression, easy to compute. We make those temporal textures of wavelet coefficients to express motion information, M components. Then, temporal texture feature vectors are extracted using spatial texture feature vectors, i.e. spatial gray-level dependence. Also, motion amount and motion centroid are computed from temporal textures. Motion trajectories provide the most important information for expressing the motion property. In our modeling system, we can extract the main motion trajectory from the temporal textures.

  • PDF

Constructing $G^1$ Quadratic B$\acute{e}$zier Curves with Arbitrary Endpoint Tangent Vectors

  • Gu, He-Jin;Yong, Jun-Hai;Paul, Jean-Claude;Cheng, Fuhua (Frank)
    • International Journal of CAD/CAM
    • /
    • 제9권1호
    • /
    • pp.55-60
    • /
    • 2010
  • Quadratic B$\acute{e}$zier curves are important geometric entities in many applications. However, it was often ignored by the literature the fact that a single segment of a quadratic B$\acute{e}$zier curve may fail to fit arbitrary endpoint unit tangent vectors. The purpose of this paper is to provide a solution to this problem, i.e., constructing $G^1$ quadratic B$\acute{e}$zier curves satisfying given endpoint (positions and arbitrary unit tangent vectors) conditions. Examples are given to illustrate the new solution and to perform comparison between the $G^1$ quadratic B$\acute{e}$zier cures and other curve schemes such as the composite geometric Hermite curves and the biarcs.

An approach to improving the James-Stein estimator shrinking towards projection vectors

  • Park, Tae Ryong;Baek, Hoh Yoo
    • Journal of the Korean Data and Information Science Society
    • /
    • 제25권6호
    • /
    • pp.1549-1555
    • /
    • 2014
  • Consider a p-variate normal distribution ($p-q{\geq}3$, q = rank($P_V$) with a projection matrix $P_V$). Using a simple property of noncentral chi square distribution, the generalized Bayes estimators dominating the James-Stein estimator shrinking towards projection vectors under quadratic loss are given based on the methods of Brown, Brewster and Zidek for estimating a normal variance. This result can be extended the cases where covariance matrix is completely unknown or ${\sum}={\sigma}^2I$ for an unknown scalar ${\sigma}^2$.

Block Toeplitz Matrix Inversion using Levinson Polynomials

  • Lee, Won-Cheol;Nam, Jong-Gil
    • 한국통신학회논문지
    • /
    • 제24권8B호
    • /
    • pp.1438-1443
    • /
    • 1999
  • In this paper, we propose detection methods for gradual scene changes such as dissolve, pan, and zoom. The proposal method to detect a dissolve region uses scene features based on spatial statistics of the image. The spatial statistics to define shot boundaries are derived from squared means within each local area. We also propose a method of the camera motion detection using four representative motion vectors in the background. Representative motion vectors are derived from macroblock motion vectors which are directly extracted from MPEG streams. To reduce the implementation time, we use DC sequences rather than fully decoded MPEG video. In addition, to detect the gradual scene change region precisely, we use all types of the MPEG frames(I, P, B frame). Simulation results show that the proposed detection methods perform better than existing methods.

  • PDF

복수입력 시간지연 시스템의 유리근사화 (Rational approximation of multiple input delay systems)

  • 황이철;박경택
    • 한국정밀공학회지
    • /
    • 제14권1호
    • /
    • pp.194-204
    • /
    • 1997
  • In this paper, we consider the rational approximation of multiple input delay systems. The method of computing Hankel singular values and vectors is firstly introduced, where explicitly shows the structure of the corresponding Hankel singular vectors. Secondly, rational approximants are obtained from output nor- mal relizations, which are constructed by Hankel singular values and vectors. As a result, it is shown that rational approximants by output normal realization preserve intrinsic properties of time delay systems than Pad'e approximants.

  • PDF

A Direct Method to Derive All Generators of Solutions era Matrix Equation in a Petri Net - Extended Fourier-Motzkin Method -

  • Takata, Maki;Matsumoto, Tadashi;Moro, Seiichiro
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 ITC-CSCC -1
    • /
    • pp.490-493
    • /
    • 2002
  • In this paper, the old Fourier-Motzkin method (abbreviated as the old FH method from now on) is first modified to the form which can derive all minimal vectors as well as all minimal support vectors of nonnegative integer homogeneous solutions (i.e., T-invariants) for a matrix equation $Ax=b=0^{m{\times}1}$, $A\epsilonZ^{m{\times}n}$ and $b\epsilonZ^{m{\times}1}$, of a given Petri net, where the old FM method is a well-known and direct method that can obtain at least all minimal support solutions for $Ax=0^{m{\times}1}$ from the incidence matrix . $A\epsilonZ^{m{\times}n}$, Secondly, for $Ax=b\ne0^{m{\times}n}$ a new extended FM method is given; i.e., all nonnegative integer minimal vectors which contain all minimal support vectors of not only homogeneous but also inhomogeneous solutions are systematically obtained by applying the above modified FH method to the augmented incidence matrix $\tilde{A}$ =〔A,-b〕$\epsilon$ $Z^{m{\times}(n+1)}$ s.t. $\tilde{A}\tilde{x}$ = 0^{m{\times}1}$ However, note that for this extended FM method we need some criteria to obtain a minimal vector as well as a minimal support vector from both of nonnegative integer homogeneous and inhomogeneous solutions for Ax=b. Then those criteria are also discussed and given in this paper.

  • PDF