• Title/Summary/Keyword: identity-vector

Search Result 97, Processing Time 0.021 seconds

TRILINEAR FORMS AND THE SPACE OF COMTRANS ALGEBRAS

  • IM, BOKHEE;SMITH, JONATHAN D.H.
    • Honam Mathematical Journal
    • /
    • v.27 no.4
    • /
    • pp.595-602
    • /
    • 2005
  • Comtrans algebras are modules equipped with two trilinear operations: a left alternative commutator and a translator satisfying the Jacobi identity, the commutator and translator being connected by the so-called comtrans identity. These identities have analogues for trilinear forms. On a given vector space, the set of all comtrans algebra structures itself forms a vector space. In this paper, the dimension of the space of comtrans algebra structures on a finite-dimensional vector space is determined.

  • PDF

Short utterance speaker verification using PLDA model adaptation and data augmentation (PLDA 모델 적응과 데이터 증강을 이용한 짧은 발화 화자검증)

  • Yoon, Sung-Wook;Kwon, Oh-Wook
    • Phonetics and Speech Sciences
    • /
    • v.9 no.2
    • /
    • pp.85-94
    • /
    • 2017
  • Conventional speaker verification systems using time delay neural network, identity vector and probabilistic linear discriminant analysis (TDNN-Ivector-PLDA) are known to be very effective for verifying long-duration speech utterances. However, when test utterances are of short duration, duration mismatch between enrollment and test utterances significantly degrades the performance of TDNN-Ivector-PLDA systems. To compensate for the I-vector mismatch between long and short utterances, this paper proposes to use probabilistic linear discriminant analysis (PLDA) model adaptation with augmented data. A PLDA model is trained on vast amount of speech data, most of which have long duration. Then, the PLDA model is adapted with the I-vectors obtained from short-utterance data which are augmented by using vocal tract length perturbation (VTLP). In computer experiments using the NIST SRE 2008 database, the proposed method is shown to achieve significantly better performance than the conventional TDNN-Ivector-PLDA systems when there exists duration mismatch between enrollment and test utterances.

Identifying Mobile Owner based on Authorship Attribution using WhatsApp Conversation

  • Almezaini, Badr Mohammd;Khan, Muhammad Asif
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.7
    • /
    • pp.317-323
    • /
    • 2021
  • Social media is increasingly becoming a part of our daily life for communicating each other. There are various tools and applications for communication and therefore, identity theft is a common issue among users of such application. A new style of identity theft occurs when cybercriminals break into WhatsApp account, pretend as real friends and demand money or blackmail emotionally. In order to prevent from such issues, data mining can be used for text classification (TC) in analysis authorship attribution (AA) to recognize original sender of the message. Arabic is one of the most spoken languages around the world with different variants. In this research, we built a machine learning model for mining and analyzing the Arabic messages to identify the author of the messages in Saudi dialect. Many points would be addressed regarding authorship attribution mining and analysis: collect Arabic messages in the Saudi dialect, filtration of the messages' tokens. The classification would use a cross-validation technique and different machine-learning algorithms (Naïve Baye, Support Vector Machine). Results of average accuracy for Naïve Baye and Support Vector Machine have been presented and suggestions for future work have been presented.

Robust Face Recognition based on Gabor Feature Vector illumination PCA Model (가버 특징 벡터 조명 PCA 모델 기반 강인한 얼굴 인식)

  • Seol, Tae-In;Kim, Sang-Hoon;Chung, Sun-Tae;Jo, Seong-Won
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.45 no.6
    • /
    • pp.67-76
    • /
    • 2008
  • Reliable face recognition under various illumination environments is essential for successful commercialization. Feature-based face recognition relies on a good choice of feature vectors. Gabor feature vectors are known to be more robust to variations of pose and illumination than any other feature vectors so that they are popularly adopted for face recognition. However, they are not completely independent of illuminations. In this paper, we propose an illumination-robust face recognition method based on the Gabor feature vector illumination PCA model. We first construct the Gabor feature vector illumination PCA model where Gator feature vector space is rendered to be decomposed into two orthogonal illumination subspace and face identity subspace. Since the Gabor feature vectors obtained by projection into the face identity subspace are separated from illumination, the face recognition utilizing them becomes more robust to illumination. Through experiments, it is shown that the proposed face recognition based on Gabor feature vector illumination PCA model performs more reliably under various illumination and Pose environments.

SEQUENCES IN THE RANGE OF A VECTOR MEASURE

  • Song, Hi Ja
    • Korean Journal of Mathematics
    • /
    • v.15 no.1
    • /
    • pp.13-26
    • /
    • 2007
  • We prove that every strong null sequence in a Banach space X lies inside the range of a vector measure of bounded variation if and only if the condition $\mathcal{N}_1(X,{\ell}_1)={\Pi}_1(X,{\ell}_1)$ holds. We also prove that for $1{\leq}p<{\infty}$ every strong ${\ell}_p$ sequence in a Banach space X lies inside the range of an X-valued measure of bounded variation if and only if the identity operator of the dual Banach space $X^*$ is ($p^{\prime}$,1)-summing, where $p^{\prime}$ is the conjugate exponent of $p$. Finally we prove that a Banach space X has the property that any sequence lying in the range of an X-valued measure actually lies in the range of a vector measure of bounded variation if and only if the condition ${\Pi}_1(X,{\ell}_1)={\Pi}_2(X,{\ell}_1)$ holds.

  • PDF

Molecular characterization of a repetitive element of Xanthomonas oryzae pv. oryzae

  • Yun, Choong-Hyo
    • Proceedings of the Korean Society of Plant Pathology Conference
    • /
    • 1995.06b
    • /
    • pp.1-19
    • /
    • 1995
  • The plasmid pJEL 101 contains a highly repetitive element from the genome of Xanthomonas oryae pv. oryzae that has properties of an insertional element. The insertional nature of the element, hereto referred to as IS203, was confirmed by molecular analyses of the element and three related elements that were isolated from X. oryzae. The related sequences were isolated on the basis of transposition to the transposon-trapping vector pL3SAC and hybridization with pJEL101. The trapped elements (IS203a, IS203b, and IS203c) were each composed of 1,055 base pairs with 25 base terminal inverted repeats. The elements caused a three base pair target site duplication at the site of insertion in the sacRB gene. The sequence of pJEL 101 has 96% base pair identity with IS203a and 99% identity with IS203a and IS203c but lacks three nucleotides of the consensus left terminal repeat. IS203b has the same DNA sequences as IS203c but is inserted ito the sacRB gene in the opposite orientation. The longest open reading frame of IS203a could code for a protein of 318 amino acids and molecular weight of 37, 151. A search of the Genbank database revealed that IS203 has 51% identity with 909 nucleotides of IS4551 from Escherichia coli. The predicted protein of ORF1 has 40% and 30% amino acid identity to the ORF1 of Tn4551 and the transposase of IS30, respectively.

  • PDF

Optimization of CVQ codebook index for noisy channels (잡음이 존재하는 채널에서 이용되는 분류 벡터 양자화 코드북의 인덱스할당기법)

  • 한종기;김진욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.3C
    • /
    • pp.315-326
    • /
    • 2003
  • Abstract In this paper, an improved index assignment procedure is proposed to reduce the channel error effect in a communication system employing classified vector quantization(CVQ). The proposed algorithm consists of two parts: inner index assignment (IIA) and cross index assignment (CIA). The II A reduces the distortion resulting from the error in order bits, presenting the identity of each code vector in a subcodebook. The CIA modifies the indexes assigned by the IIA in such a way that the effect of the channel error occurring in class bits, indicating the class information of the code vector, can be minimized. Simulation results show that the proposed algorithms enable a reliable communication over noisy channels even without employing the channel encoding. Index Terms Classified vector quantization, index assignment.

Design of an Observer for Position and Speed Sensorless Vector Control of PMSM (PMSM의 위치 및 속도 센서리스 벡터제어를 위한 관측기의 설계)

  • 정동화
    • Journal of the Korean Society of Safety
    • /
    • v.13 no.1
    • /
    • pp.54-63
    • /
    • 1998
  • This paper proposes a theoretical analysis of a closed loop adaptive speed control system for control the inverter driven permanent magnet synchronous motor(PMSM). This control system utilizes a mechanically sensorless state observer for the generation of all controller feedback information. The observer processes measurements of stator frame voltage and current to produce estimates of rotor position and speed and rotor frame currents. It is shown that the identity observer, when properly formulated, has the same linearized error dynamics as the extended kalman filter(EKF). Consequently, it is shown that the gains within the identity observer can be designed in a manner identical to that of the EKF. In this way, the designability of the nonlinear observer is assured, as is the optimality of its performance for small errors. A sequence of simulation are performed and they demonstrate the successful performance.

  • PDF

PERMANENTS OF DOUBLY STOCHASTIC KITE MATRICES

  • Hwang, Suk-Geun;Lee, Jae-Don;Park, Hong-Sun
    • Journal of the Korean Mathematical Society
    • /
    • v.35 no.2
    • /
    • pp.423-432
    • /
    • 1998
  • Let p, q be integers such that 2 $\leq$ p, q $\leq$ n, and let $D_{p, q}$ denote the matrix obtained from $I_{n}$, the identity matrix of order n, by replacing each of the first p columns by an all 1's vector and by replacing each of the first two rows and each of the last q-2 rows by an all 1's vector. In this paper the permanent minimization problem over the face, determined by the matrix $D_{p, q}$, of the polytope of all n $\times$ n doubly stochastic matrices is treated.d.

  • PDF

Condition Monitoring Of Rotating Machine With Mass Unbalance Using Hidden Markov Model (은닉 마르코프 모델을 이용한 질량 편심이 있는 회전기기의 상태진단)

  • Ko, Jungmin;Choi, Chankyu;Kang, To;Han, Soonwoo;Park, Jinho;Yoo, Honghee
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2014.10a
    • /
    • pp.833-834
    • /
    • 2014
  • In recent years, a pattern recognition method has been widely used by researchers for fault diagnoses of mechanical systems. A pattern recognition method determines the soundness of a mechanical system by detecting variations in the system's vibration characteristics. Hidden Markov model has recently been used as pattern recognition methods in various fields. In this study, a HMM method for the fault diagnosis of a mechanical system is introduced, and a rotating machine with mass unbalance is selected for fault diagnosis. Moreover, a diagnosis procedure to identity the size of a defect is proposed in this study.

  • PDF