• Title/Summary/Keyword: Matrix Computation

Search Result 457, Processing Time 0.027 seconds

Development of MS Excel Macros to estimate regression models and test hypotheses of relationships between variables (Application to regression analysis of subway electric charges data) (MS Excel 함수들을 이용한 회귀 분석 모형 추정 및 관계 분석 검정을 위한 매크로 개발 (지하철 전기요금 자료 회귀분석에 응용))

  • Kim, Sook-Young
    • Journal of the Korea Computer Industry Society
    • /
    • v.10 no.5
    • /
    • pp.213-220
    • /
    • 2009
  • Regression analysis to estimate the fitted models and test hypotheses are basic statistical tools for survey data as well as experimental data. Data is collected as pairs of independent and dependent variables, and statistics are computed using matrix calculation. To estimate a best fitted model is a key to maximize reliability of regression analysis. To fit a regression model, plot data on XY axis and select the most fitted models. Researchers estimate the best model and test hypothesis with MS Excel's graph menu and matrix computation functions. In this study, I develop macros to estimate the fitted regression model and test hypotheses of relationship between variables. Subway electric charges data with one dependent variable and three independent variables are tested using developed macros, and compared with the results using built-in Excel of regression analysis.

  • PDF

A Performance Improvement of GLCM Based on Nonuniform Quantization Method (비균일 양자화 기법에 기반을 둔 GLCM의 성능개선)

  • Cho, Yong-Hyun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.25 no.2
    • /
    • pp.133-138
    • /
    • 2015
  • This paper presents a performance improvement of gray level co-occurrence matrix(GLCM) based on the nonuniform quantization, which is generally used to analyze the texture of images. The nonuniform quantization is given by Lloyd algorithm of recursive technique by minimizing the mean square error. The nonlinear intensity levels by performing nonuniformly the quantization of image have been used to decrease the dimension of GLCM, that is applied to reduce the computation loads as a results of generating the GLCM and calculating the texture parameters by using GLCM. The proposed method has been applied to 30 images of $120{\times}120$ pixels with 256-gray level for analyzing the texture by calculating the 6 parameters, such as angular second moment, contrast, variance, entropy, correlation, inverse difference moment. The experimental results show that the proposed method has a superior computation time and memory to the conventional 256-level GLCM method without performing the quantization. Especially, 16-gray level by using the nonuniform quantization has the superior performance for analyzing textures to another levels of 48, 32, 12, and 8 levels.

An Efficient Method to Compute a Covariance Matrix of the Non-local Means Algorithm for Image Denoising with the Principal Component Analysis (영상 잡음 제거를 위한 주성분 분석 기반 비 지역적 평균 알고리즘의 효율적인 공분산 행렬 계산 방법)

  • Kim, Jeonghwan;Jeong, Jechang
    • Journal of Broadcast Engineering
    • /
    • v.21 no.1
    • /
    • pp.60-65
    • /
    • 2016
  • This paper introduces the non-local means (NLM) algorithm for image denoising, and also introduces an improved algorithm which is based on the principal component analysis (PCA). To do the PCA, a covariance matrix of a given image should be evaluated first. If we let the size of neighborhood patches of the NLM S × S2, and let the number of pixels Q, a matrix multiplication of the size S2 × Q is required to compute a covariance matrix. According to the characteristic of images, such computation is inefficient. Therefore, this paper proposes an efficient method to compute the covariance matrix by sampling the pixels. After sampling, the covariance matrix can be computed with matrices of the size S2 × floor (Width/l) × (Height/l).

Characterization of Methanol-Water and Acetonitrile-Water Mixtures Using Iterative Target Transform Factor Analysis on Near Infrared Absorption Spectra (근적외선흡광스픽트럼에 대한 반복목표변환인자분석에 의한 메탄올-물 혼합액 및 아세토니트릴 -물 혼합액의 특성 확인)

  • 박영주;조정환
    • YAKHAK HOEJI
    • /
    • v.48 no.1
    • /
    • pp.6-12
    • /
    • 2004
  • Near-infrared spectra of methanol-water mixtures and acetonitrile-water mixtures were acquired to find interactions between solvents widely used for reverse-phase liquid chromatography. Mixtures were prepared to give a series of increasing mole fractions of methanol or acetonitrile in water. Data matrices of acquired spectra were analyzed to determine the proper number of principal components of each mixture system using Malinowski's factor indicator function. Initial guess of score matrix and loading matrix were calculated by nonlinear iterative partial least squares (NIPALS) algorithm for faster computation. Iterative target transform factor analysis (ITTFA) was applied to convert the initial estimation of score matrix to true concentration profile and loading matrix to pure spectra of pure components of the mixtures. In case of methanol-water the number of principal components was found to be 4 and those initial guess of factors were converted to the pure spectra of water methanol and two kinds of complexes. In case of acetonitrile-water the number of pure components of the mixtures was found to be 3 and the pure spectrum of acetonitrile-water complex was found. The nonlinear characteristics of concentration profiles of complexes in the solvent mixtures may give a good criteria in understanding their elution characteristics in reverse-phase liquid chromatogrsphy.

A Singular Value Decomposition based Space Vector Modulation to Reduce the Output Common-Mode Voltage of Direct Matrix Converters

  • Guan, Quanxue;Yang, Ping;Guan, Quansheng;Wang, Xiaohong;Wu, Qinghua
    • Journal of Power Electronics
    • /
    • v.16 no.3
    • /
    • pp.936-945
    • /
    • 2016
  • Large magnitude common-mode voltage (CMV) and its variation dv/dt have an adverse effect on motor drives that leads to early winding failure and bearing deterioration. For matrix converters, the switch states that connect each output line to a different input phase result in the lowest CMV among all of the valid switch states. To reduce the output CMV for matrix converters, this paper presents a new space vector modulation (SVM) strategy by utilizing these switch states. By this mean, the peak value and the root mean square of the CMV are dramatically decreased. In comparison with the conventional SVM methods this strategy has a similar computation overhead. Experiment results are shown to validate the effectiveness of the proposed modulation method.

GPU-Based ECC Decode Unit for Efficient Massive Data Reception Acceleration

  • Kwon, Jisu;Seok, Moon Gi;Park, Daejin
    • Journal of Information Processing Systems
    • /
    • v.16 no.6
    • /
    • pp.1359-1371
    • /
    • 2020
  • In transmitting and receiving such a large amount of data, reliable data communication is crucial for normal operation of a device and to prevent abnormal operations caused by errors. Therefore, in this paper, it is assumed that an error correction code (ECC) that can detect and correct errors by itself is used in an environment where massive data is sequentially received. Because an embedded system has limited resources, such as a low-performance processor or a small memory, it requires efficient operation of applications. In this paper, we propose using an accelerated ECC-decoding technique with a graphics processing unit (GPU) built into the embedded system when receiving a large amount of data. In the matrix-vector multiplication that forms the Hamming code used as a function of the ECC operation, the matrix is expressed in compressed sparse row (CSR) format, and a sparse matrix-vector product is used. The multiplication operation is performed in the kernel of the GPU, and we also accelerate the Hamming code computation so that the ECC operation can be performed in parallel. The proposed technique is implemented with CUDA on a GPU-embedded target board, NVIDIA Jetson TX2, and compared with execution time of the CPU.

Privacy-preserving Outsourcing Schemes of Modular Exponentiations Using Single Untrusted Cloud Server

  • Zhao, Ling;Zhang, Mingwu;Shen, Hua;Zhang, Yudi;Shen, Jian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.2
    • /
    • pp.826-845
    • /
    • 2017
  • Outsourcing computation is one of the most important applications in cloud computing, and it has a huge ability to satisfy the demand of data centers. Modular exponentiation computation, broadly used in the cryptographic protocols, has been recognized as one of the most time-consuming calculation operations in cryptosystems. Previously, modular exponentiations can be securely outsourced by using two untrusted cloud servers. In this paper, we present two practical and secure outsourcing modular exponentiations schemes that support only one untrusted cloud server. Explicitly, we make the base and the index blind by putting them into a matrix before send to the cloud server. Our schemes provide better performance in higher efficiency and flexible checkability which support single cloud server. Additionally, there exists another advantage of our schemes that the schemes are proved to be secure and effective without any cryptographic assumptions.

RowAMD Distance: A Novel 2DPCA-Based Distance Computation with Texture-Based Technique for Face Recognition

  • Al-Arashi, Waled Hussein;Shing, Chai Wuh;Suandi, Shahrel Azmin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.11
    • /
    • pp.5474-5490
    • /
    • 2017
  • Although two-dimensional principal component analysis (2DPCA) has been shown to be successful in face recognition system, it is still very sensitive to illumination variations. To reduce the effect of these variations, texture-based techniques are used due to their robustness to these variations. In this paper, we explore several texture-based techniques and determine the most appropriate one to be used with 2DPCA-based techniques for face recognition. We also propose a new distance metric computation in 2DPCA called Row Assembled Matrix Distance (RowAMD). Experiments on Yale Face Database, Extended Yale Face Database B, AR Database and LFW Database reveal that the proposed RowAMD distance computation method outperforms other conventional distance metrics when Local Line Binary Pattern (LLBP) and Multi-scale Block Local Binary Pattern (MB-LBP) are used for face authentication and face identification, respectively. In addition to this, the results also demonstrate the robustness of the proposed RowAMD with several texture-based techniques.

Efficient Computation of Fixed and Mixed Polarity Reed-Muller Function Vector over GF(p)

  • Kim Young Gun;Kim Jong O;Kim Heung Soo
    • Proceedings of the IEEK Conference
    • /
    • 2004.08c
    • /
    • pp.503-508
    • /
    • 2004
  • This paper proposes an efficient computation method for fixed and mixed polarity Reed -Muller function vector over Galois field GF(p). Function vectors of fixed polarity Heed Muller function with single variable can be generated by proposed method. The n-variable function vectors can be calculated by means of the Kronecker product of a single variable function vector corresponding to each variable. Thus, all fixed and mixed polarity Reed-Muller function vectors are calculated directly without using a polarity function vector table or polarity coefficient matrix.

  • PDF

Free Vibration Analysis of Rectangular Plates by the Combined Transfer Stiffness Coefficient Method and Finite Element Method (전달강성계수법과 유한요소법의 조합에 의한 사각평판의 자유진동해석)

  • 문덕홍;최명수
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 1998.04a
    • /
    • pp.353-358
    • /
    • 1998
  • In general, we have used the finite element method(FEM) to find natural frequencies of plates. In this method, however, it is necessary to use a large amount of computer memory and computation time because the FEM requires many degrees of freedom for finding natural frequencies of plates correctly. Therefore it was very difficult to analyze the free vibration of plates correctly on personal computer. For overcoming this disadvantage of the FEM, the authors have developed the finite element-transfer stiffness coefficient method(FE-TSCM) which is based on the concept of modeling techniques in the FEM and the transfer of the stiffness coefficient in the transfer stiffness coefficient method. In this paper, we formulate free vibration analysis algorithm of rectangular plates using the FE-TSCM. Some numerical examples of rectangular plates are proposed, and their results and computation times obtained by the FE-TSCM are compared with those by the FEM and the finite element-transfer matrix method in order to demonstrate the accuracy and efficiency of the FE-TSCM.

  • PDF