• Journal of the Korean Data and Information Science Society
• /
• v.22 no.4
• /
• pp.803-809
• /
• 2011

Properties of multivariate Shewhart and CUSUM charts for monitoring variance-covariance matrix, specially focused on correlation coefficient components, are investigated. The performances of the proposed charts based on control statistic Lawley-Hotelling $V_i$ and likelihood ratio test (LRT) statistic $TV_i$ are evaluated in terms of average run length (ARL). For monitoring correlation coe cient components of dispersion matrix, we found that CUSUM chart based on $TV_i$ gives relatively better performances and is more preferable, and the charts based on $V_i$ perform badly and are not recommended.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.3 no.3
• /
• pp.23-34
• /
• 1980

The method of principal component analysis is originated by K. Pearson, who considered this as geometrical method Principal component analysis is the most elementary method, and this means that the information having various type of characteristics which have been correlated among themselves, are summarized by orthogonal transformations of characteristics. I: Even though we have different result whether this method is applied to homogeneous population or not. In this research we should deal with the case of homogeneous population only. II: On the other hand, we can have different result whether we start from covariance matrix or matrix of correlation- coefficients. In this research we are studying based on covariance matrix.

• The Korean Journal of Applied Statistics
• /
• v.5 no.2
• /
• pp.283-292
• /
• 1992

Updating algorithms are studied for the basic statistics (mean, variance). For a linear model, a recursive formulae for least squares estimators of regression coefficients, residual sum of squares and variance-covariance matrix are also studied. Hotelling's $T^2$ statistics can be calculated recursively using the recursive formulae of mean vector and variance-covariance matrix without computing the sample variance-covariance matrix at each stage.

• ETRI Journal
• /
• v.41 no.5
• /
• pp.658-669
• /
• 2019

For dual-channel time-frequency (TF) overlapped signals with low sparsity in underdetermined blind source separation (UBSS), this paper proposes an effective method based on interval probability to estimate and expand the types of mixing matrices. First, the detection of TF single-source points (TF-SSP) is used to improve the TF sparsity of each source. For more distinguishability, as the ratios of the coefficients from different columns of the mixing matrix are close, a local peak-detection mechanism based on interval probability (LPIP) is proposed. LPIP utilizes uniform subintervals to optimize and classify the TF coefficient ratios of the detected TF-SSP effectively in the case of a high level of TF overlap among sources and reduces the TF interference points and redundant signal features greatly to enhance the estimation accuracy. The simulation results show that under both noiseless and noisy cases, the proposed method performs better than the selected mainstream traditional methods, has good robustness, and has low algorithm complexity.

• Interaction and multiscale mechanics
• /
• v.1 no.2
• /
• pp.231-250
• /
• 2008

The statistical two-order and two-scale method is developed for predicting the mechanics parameters, such as stiffness and strength of core-shell particle-filled polymer composites. The representation and simulation on meso-configuration of random particle-filled polymers are stated. And the major statistical two-order and two-scale analysis formulation is briefly given. The two-order and two-scale expressions for the strains and stresses of conventionally strength experimental components, including the tensional or compressive column, the twist bar and the bending beam, are developed by means of their classical solutions with orthogonal-anisotropic coefficients. Then a new effective mesh generation algorithm is presented. The mechanics parameters of core-shell particle-filled polymer composites, including the expected stiffness parameters, minimum stiffness parameters, and the expected elasticity limit strength and the minimum elasticity limit strength, are defined by means of the stiffness coefficients and elasticity strength criterions for core, shell and matrix. Finally, the numerical results for predicting both stiffness and elasticity limit strength parameters are compared with the experimental data.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2005.03a
• /
• pp.884-889
• /
• 2005

A lot of landslides were occurred in Gangnung, Macheon and Geochang areas by Typhoons such as RUSA(2002) and MEAMI(2003). Soil properties of these areas are investigated regarding geological conditions in this study. The shallow plane failure were occurred in Gangnung and Geochang areas, whereas the deep circle failure were occurred in Macheon area. The matrix in Gangnung and Geochang areas was composed of Granite, and the matrix in Macheon area was composed of Gabbro. The disturbed and undisturbed soils were sampled in these areas. As the results of laboratory tests using sampled soils, the coefficient of permeability in Granite region is lower than that in Gabbro region. In the cases that the silt and clay contents are included less than 4% for the soils of Granite region and less than 7% for the soils of Gabbro region, the coefficients of permeability are rapidly increased for both soils. In addition, the simple equations for predicting the coefficients of permeability are proposed using the effective particle size and the silt and clay contents according to geological condition.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.6
• /
• pp.167-173
• /
• 2016

Compressed Sensing(CS) is the theory that can recover signals which are sampled below the Nyquist sampling rate to original analog signals. In this paper, we propose the estimation algorithm of ultrasonic attenuation coefficients in the frequency domain using CS. While most estimation algorithms transform the time-domain signals into the frequency-domain using the Fourier transform, the proposed method directly utilize the spectral information in the recovery process by the basis matrix without the completely recovered signals in the time domain. We apply three transform bases for sparsifying and estimate the attenuation coefficients using the Centroid Downshift method with Dual-reference diffraction compensation technique. The estimation accuracy and execution time are compared for each basis matrix. Computer simulation results show that the DCT basis matrix exhibits less than 0.35% estimation error for the compressive ratio of 50% and about 6% average error for the compressive ratio of 70%. The proposed method which directly extracts frequency information from the CS signals can be extended to estimating for other ultrasonic parameters in the Quantitative Ultrasound (QUS) Analysis.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.2
• /
• pp.45-55
• /
• 1994

In this paper, a block based image approximation technique using the Self Affine System(SAS) from the fractal theory is suggested. Each block of an image is divided into 4 tiles and 4 affine mapping coefficients are found for each tile. To find the affine mapping cefficients that minimize the error between the affine transformed image block and the reconstructed image block, the matrix euation is solved by setting each partial differential coefficients to aero. And to ensure the convergence of coding block. 4 uniformly partitioned affine transformation is applied. Variable block size technique is employed in order to applynatural image reconstruction property of fractal image coding. Large blocks are used for encoding smooth backgrounds to yield high compression efficiency and texture and edge blocks are divided into smaller blocks to preserve the block detail. Affine mapping coefficinets are found for each block having 16$\times$16, 8$\times$8 or 4$\times$4 size. Each block is classified as shade, texture or edge. Average gray level is transmitted for shade bolcks, and coefficients are found for texture and edge blocks. Coefficients are quantized and only 16 bytes per block are transmitted. Using the proposed algorithm, the computational load increases linearly in proportion to image size. PSNR of 31.58dB is obtained as the result using 512$\times$512, 8 bits per pixel Lena image.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.1
• /
• pp.41-48
• /
• 1999

This paper presents a production method to GRM coefficients which is consists of 3n polarities to n variables over GF(3). General production method is searching for transformation matrix for a single variable and then kronecker products for n times. This paper presents a production method of GRM coefficients using DD(Decision Diagrma). Change of coefficients to a single variable are apply to DD and extended to n variables.

• Investigative Magnetic Resonance Imaging
• /
• v.19 no.1
• /
• pp.19-30
• /
• 2015

Purpose: A new compressed sensing technique by iterative truncation of small transformed coefficients (ITSC) is proposed for fast cardiac CINE MRI. Materials and Methods: The proposed reconstruction is composed of two processes: truncation of the small transformed coefficients in the r-f domain, and restoration of the measured data in the k-t domain. The two processes are sequentially applied iteratively until the reconstructed images converge, with the assumption that the cardiac CINE images are inherently sparse in the r-f domain. A novel sampling strategy to reduce the normalized mean square error of the reconstructed images is proposed. Results: The technique shows the least normalized mean square error among the four methods under comparison (zero filling, view sharing, k-t FOCUSS, and ITSC). Application of ITSC for multi-slice cardiac CINE imaging was tested with the number of slices of 2 to 8 in a single breath-hold, to demonstrate the clinical usefulness of the technique. Conclusion: Reconstructed images with the compression factors of 3-4 appear very close to the images without compression. Furthermore the proposed algorithm is computationally efficient and is stable without using matrix inversion during the reconstruction.