• 제목/요약/키워드: Data Matrix

검색결과 2,896건 처리시간 0.029초

일반화 선형혼합모형의 임의효과 공분산행렬을 위한 모형들의 조사 및 고찰 (Survey of Models for Random Effects Covariance Matrix in Generalized Linear Mixed Model)

  • 김지영;이근백
    • 응용통계연구
    • /
    • 제28권2호
    • /
    • pp.211-219
    • /
    • 2015
  • 일반화 선형혼합모델은 일반적으로 경시적 범주형 자료를 분석하는데 사용된다. 이 모델에서 임의효과는 반복 측정치들의 시간에 따른 의존성을 설명한다. 임의효과 공분산행렬의 추정은 여러가지 제약조건들 때문에 쉽지 않은 문제이다. 제약조건으로는 행렬의 모수들의 수가 많으며, 또한 추정된 공분산행렬은 양정치성을 만족하여야 한다. 이러한 제한을 극복하기 위해, 임의효과 공분산행렬의 모형화를 위한 여러가지 방법이 제안되었다: 수정 단냠레스키분해, 이동평균 단냠레스키분해와 부분 자기상관행렬을 이용한 방법이 있다. 이 논문에서 위의 제안된 방법들을 소개한다.

Inverse Eigenvalue Problems with Partial Eigen Data for Acyclic Matrices whose Graph is a Broom

  • Sharma, Debashish;Sen, Mausumi
    • Kyungpook Mathematical Journal
    • /
    • 제57권2호
    • /
    • pp.211-222
    • /
    • 2017
  • In this paper, we consider three inverse eigenvalue problems for a special type of acyclic matrices. The acyclic matrices considered in this paper are described by a graph called a broom on n + m vertices, which is obtained by joining m pendant edges to one of the terminal vertices of a path on n vertices. The problems require the reconstruction of such a matrix from given partial eigen data. The eigen data for the first problem consists of the largest eigenvalue of each of the leading principal submatrices of the required matrix, while for the second problem it consists of an eigenvalue of each of its trailing principal submatrices. The third problem has an eigenvalue and a corresponding eigenvector of the required matrix as the eigen data. The method of solution involves the use of recurrence relations among the leading/trailing principal minors of ${\lambda}I-A$, where A is the required matrix. We derive the necessary and sufficient conditions for the solutions of these problems. The constructive nature of the proofs also provides the algorithms for computing the required entries of the matrix. We also provide some numerical examples to show the applicability of our results.

Implementation and Experiments of Sparse Matrix Data Structure for Heat Conduction Equations

  • Kim, Jae-Gu;Lee, Ju-Hee;Park, Geun-Duk
    • 한국컴퓨터정보학회논문지
    • /
    • 제20권12호
    • /
    • pp.67-74
    • /
    • 2015
  • The heat conduction equation, a type of a Poisson equation which can be applied in various areas of engineering is calculating its value with the iteration method in general. The equation which had difference discretization of the heat conduction equation is the simultaneous equation, and each line has the characteristic of expressing in sparse matrix of the equivalent number of none-zero elements with neighboring grids. In this paper, we propose a data structure for sparse matrix that can calculate the value faster with less memory use calculate the heat conduction equation. To verify whether the proposed data structure efficiently calculates the value compared to the other sparse matrix representations, we apply the representative iteration method, CG (Conjugate Gradient), and presents experiment results of time consumed to get values, calculation time of each step and relevant time consumption ratio, and memory usage amount. The results of this experiment could be used to estimate main elements of calculating the value of the general heat conduction equation, such as time consumed, the memory usage amount.

New Watermarking Technique Using Data Matrix and Encryption Keys

  • Kim, Il-Hwan;Kwon, Chang-Hee;Lee, Wang-Heon
    • Journal of Electrical Engineering and Technology
    • /
    • 제7권4호
    • /
    • pp.646-651
    • /
    • 2012
  • Meaningful logos or random sequences have been used in the current digital watermarking techniques of 2D bar code. The meaningful logos can not only be created by copyright holders based on their unique information, but are also very effective when representing their copyrights. The random sequences enhance the security of the watermark for verifying one's copyrights against intentional or unintentional attacks. In this paper, we propose a new watermarking technique taking advantage of Data Matrix as well as encryption keys. The Data Matrix not only recovers the original data by an error checking and correction algorithm, even when its high-density data storage and barcode are damaged, but also encrypts the copyright verification information by randomization of the barcode, including ownership keys. Furthermore, the encryption keys and the patterns are used to localize the watermark, and make the watermark robust against attacks, respectively. Through the comparison experiments of the copyright information extracted from the watermark, we can verify that the proposed method has good quality and is robust to various attacks, such as JPEG compression, filtering and resizing.

Parts-Based Feature Extraction of Spectrum of Speech Signal Using Non-Negative Matrix Factorization

  • Park, Jeong-Won;Kim, Chang-Keun;Lee, Kwang-Seok;Koh, Si-Young;Hur, Kang-In
    • Journal of information and communication convergence engineering
    • /
    • 제1권4호
    • /
    • pp.209-212
    • /
    • 2003
  • In this paper, we proposed new speech feature parameter through parts-based feature extraction of speech spectrum using Non-Negative Matrix Factorization (NMF). NMF can effectively reduce dimension for multi-dimensional data through matrix factorization under the non-negativity constraints, and dimensionally reduced data should be presented parts-based features of input data. For speech feature extraction, we applied Mel-scaled filter bank outputs to inputs of NMF, than used outputs of NMF for inputs of speech recognizer. From recognition experiment result, we could confirm that proposed feature parameter is superior in recognition performance than mel frequency cepstral coefficient (MFCC) that is used generally.

Non-Negative Matrix Factorization을 이용한 음성 스펙트럼의 부분 특징 추출 (Parts-based Feature Extraction of Speech Spectrum Using Non-Negative Matrix Factorization)

  • 박정원;김창근;허강인
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
    • /
    • pp.49-52
    • /
    • 2003
  • In this paper, we propose new speech feature parameter using NMf(Non-Negative Matrix Factorization). NMF can represent multi-dimensional data based on effective dimensional reduction through matrix factorization under the non-negativity constraint, and reduced data present parts-based features of input data. In this paper, we verify about usefulness of NMF algorithm for speech feature extraction applying feature parameter that is got using NMF in Mel-scaled filter bank output. According to recognition experiment result, we could confirm that proposal feature parameter is superior in recognition performance than MFCC(mel frequency cepstral coefficient) that is used generally.

  • PDF

전달 행렬을 이용한 강체 운동 측정의 정확도 개선 (Improving Accuracy of Measurement of Rigid Body Motion by Using Transfer Matrix)

  • 고강호;국형석
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2002년도 춘계학술대회논문집
    • /
    • pp.253-259
    • /
    • 2002
  • The rigid body characteristics (value of mass, Position of center of mass, moments and products of inertia) of mechanical systems can be identified from FRF data or vibration spectra of rigid body motion. Therefore the accuracy of rigid body characteristics is connected directly with the accuracy of measured data for rigid body motions. In this paper, a method of improving accuracy of measurement of rigid body motion is presented. Applying rigid body theory, ail translational and rotational displacements at a tentative point on the rigid body are calculated using the measured translational displacements for several points and transfer matrix. Then the estimated displacements for the identical points are calculated using the 6 displacements of the tentative Point and transfer matrix. By using correlation coefficient between measured and estimated displacements, we can detect the existence of errors that are contained in a certain measured displacement. Consequently, the improved rigid body motion with respect to a tentative point can be obtained by eliminating the contaminated data.

  • PDF

Estimating People's Position Using Matrix Decomposition

  • Dao, Thi-Nga;Yoon, Seokhoon
    • International journal of advanced smart convergence
    • /
    • 제8권2호
    • /
    • pp.39-46
    • /
    • 2019
  • Human mobility estimation plays a key factor in a lot of promising applications including location-based recommendation systems, urban planning, and disease outbreak control. We study the human mobility estimation problem in the case where recent locations of a person-of-interest are unknown. Since matrix decomposition is used to perform latent semantic analysis of multi-dimensional data, we propose a human location estimation algorithm based on matrix factorization to reconstruct the human movement patterns through the use of information of persons with correlated movements. Specifically, the optimization problem which minimizes the difference between the reconstructed and actual movement data is first formulated. Then, the gradient descent algorithm is applied to adjust parameters which contribute to reconstructed mobility data. The experiment results show that the proposed framework can be used for the prediction of human location and achieves higher predictive accuracy than a baseline model.

다변량 경시적 자료 분석을 위한 공분산 행렬의 모형화 비교 연구 (Comparison study of modeling covariance matrix for multivariate longitudinal data)

  • 곽나영;이근백
    • 응용통계연구
    • /
    • 제33권3호
    • /
    • pp.281-296
    • /
    • 2020
  • 같은 개체로부터 반복 측정한 자료를 경시적 자료(longitudinal data)라고 한다. 이러한 자료를 분석하려면 흔히 사용되는 횡단 자료 분석과는 다른 분석 방법이 필요하다. 즉, 경시적 자료에서 공변량의 효과를 추정할 때에는 반복 측정된 결과 간의 상관성을 고려해야 하며, 따라서 공분산행렬을 모형화 하는 것이 매우 중요하다. 그러나 추정해야 할 모수가 많고, 추정된 공분산행렬이 양정치성을 만족해야 하므로 공분산 행렬의 모형화는 쉽지 않다. 특히 다변량 경시적 자료분석을 위한 공분산행렬의 모형화는 더욱더 심층적인 방법론을 사용해야 한다. 본 논문은 다변량 경시적 자료분석을 위한 공분산행렬을 모형화하기 위해 두 가지 방법론을 고찰한다. 두 방법 모두 수정된 콜레스키 분해(modified Cholesky decomposition)를 이용하여 시간에 따른 응답변수들의 상관관계를 설명하고 있다. 하지만 같은 시간에서 관측된 응답변수들간의 상관관계를 설명하는 방법이 다르다. 첫 번째 방법론에서는 향상된 선형 공분산 모형(enhanced linear covariance models)을 사용하여 공분산행렬이 양정치성을 만족하도록 한다. 두 번째 방법론에서는 분산-공분산 분해(variance-correlation decomposition)와 초구분해(hypersphere decomposition)을 이용하여 공분산 행렬을 모형화 한다. 이 두 방법론의 성능을 비교하고자 모의실험을 진행한다.

Multivariate control charts for monitoring correlation coefficients in dispersion matrix

  • Chang, Duk-Joon;Heo, Sun-Yeong
    • Journal of the Korean Data and Information Science Society
    • /
    • 제23권5호
    • /
    • pp.1037-1044
    • /
    • 2012
  • Multivariate control charts for effectively monitoring every component in the dispersion matrix of multivariate normal process are considered. Through the numerical results, we noticed that the multivariate control charts based on sample statistic $V_i$ by Hotelling or $W_i$ by Alt do not work effectively when the correlation coefficient components in dispersion matrix are increased. We propose a combined procedure monitoring every component of dispersion matrix, which operates simultaneously both control charts, a chart controlling variance components and a chart controlling correlation coefficients. Our numerical results show that the proposed combined procedure is efficient for detecting changes in both variances and correlation coefficients of dispersion matrix.