• Food Science of Animal Resources
• /
• v.38 no.2
• /
• pp.362-375
• /
• 2018

This study proposed a rapid microscopic examination method for pork freshness evaluation by using the self-assembled hyperspectral microscopic imaging (HMI) system with the help of feature extraction algorithm and pattern recognition methods. Pork samples were stored for different days ranging from 0 to 5 days and the freshness of samples was divided into three levels which were determined by total volatile basic nitrogen (TVB-N) content. Meanwhile, hyperspectral microscopic images of samples were acquired by HMI system and processed by the following steps for the further analysis. Firstly, characteristic hyperspectral microscopic images were extracted by using principal component analysis (PCA) and then texture features were selected based on the gray level co-occurrence matrix (GLCM). Next, features data were reduced dimensionality by fisher discriminant analysis (FDA) for further building classification model. Finally, compared with linear discriminant analysis (LDA) model and support vector machine (SVM) model, good back propagation artificial neural network (BP-ANN) model obtained the best freshness classification with a 100 % accuracy rating based on the extracted data. The results confirm that the fabricated HMI system combined with multivariate algorithms has ability to evaluate the fresh degree of pork accurately in the microscopic level, which plays an important role in animal food quality control.

• The Korean Journal of Applied Statistics
• /
• v.22 no.4
• /
• pp.745-758
• /
• 2009

Cluster analysis is the automated search for groups of related observations in a data set. To group the observations into clusters many techniques has been proposed, and a variety measures aimed at validating the results of a cluster analysis have been suggested. In this paper, we compare complete linkage, Ward's method, K-means and model-based clustering and compute validity measures such as connectivity, Dunn Index and silhouette with simulated data from multivariate distributions. We also select a clustering algorithm and determine the number of clusters of Korean consumers based on Korean consumers' palatability scores for Hanwoo bull in BBQ cooking method.

• The Korean Journal of Applied Statistics
• /
• v.31 no.1
• /
• pp.67-75
• /
• 2018

Multidimensional scaling (MDS) is an exploratory analysis of multivariate data to represent the dissimilarity among objects in the geometric low-dimensional space. However, a general MDS map only shows the information of objects without any information about variables. In this study, we used MDS based on the algorithm of Torgerson (Theory and Methods of Scaling, Wiley, 1958) to visualize some clusters of objects in categorical data. For this, we convert given data into a multiple indicator matrix. Additionally, we added the information of levels for each categorical variable on the MDS map by applying the partition method of Shin et al. (Korean Journal of Applied Statistics, 28, 1171-1180, 2015). Therefore, we can find information on the similarity among objects as well as find associations among categorical variables using the proposed MDS map.

• Journal of KIISE:Software and Applications
• /
• v.36 no.5
• /
• pp.347-352
• /
• 2009

Nonnegative matrix factorization (NMF) is a popular method for multivariate analysis of nonnegative data, the goal of which is decompose a data matrix into a product of two factor matrices with all entries in factor matrices restricted to be nonnegative. NMF was shown to be useful in a task of clustering (especially document clustering). In this paper we present an algorithm for orthogonal nonnegative matrix factorization, where an orthogonality constraint is imposed on the nonnegative decomposition of a term-document matrix. We develop multiplicative updates directly from true gradient on Stiefel manifold, whereas existing algorithms consider additive orthogonality constraints. Experiments on several different document data sets show our orthogonal NMF algorithms perform better in a task of clustering, compared to the standard NMF and an existing orthogonal NMF.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.253-260
• /
• 1999

In this paper, we suggest a new direct method for mage segmentation using texture and color information combined through a multivariate linear discriminant algorithm. The color texture is computed in nin 3${\times}$3 masks obtained from each 3${\times}$3${\times}$3 spatio-spectral neighborhood in the image using the classical haralick and Pressman texture features. Among these 9${\times}$28 texture features the best set was extracted from a training set. The resulting set of 10 features were used to segment an image into four different regions. The resulting segmentation was Compared to classical color and texture segmentation methods using both box classifiers and maximum likelihood classification. It compared favourably on the test image from a Fastred-Lightgreen stained prostatic histological tissue section based on visual inspection. The classification accuracy of 97.5% for the new method obtained on the training data was also among the best of the tested methods. If these results hold for a larger set of images, this method should be a useful tool for segmenting images where both color and texture are relevant for the segmentation process.

• Journal of Communications and Networks
• /
• v.5 no.2
• /
• pp.157-166
• /
• 2003

This paper deals with the problem of channel identification for Single Input Multiple Output (SIMO) slow fading channels using clustering algorithms. Due to the intrinsic memory of the discrete-time model of the channel, over short observation periods, the received data vectors of the SIMO model are spread in clusters because of the AWGN noise. Each cluster is practically centered around the ideal channel output labels without noise and the noisy received vectors are distributed according to a multivariate Gaussian distribution. Starting from the Markov SIMO channel model, simultaneous maximum ikelihood estimation of the input vector and the channel coefficients reduce to one of obtaining the values of this pair that minimizes the sum of the Euclidean norms between the received and the estimated output vectors. Viterbi algorithm can be used for this purpose provided the trellis diagram of the Markov model can be labeled with the noiseless channel outputs. The problem of identification of the ideal channel outputs, which is the focus of this paper, is then equivalent to designing a Vector Quantizer (VQ) from a training set corresponding to the observed noisy channel outputs. The Linde-Buzo-Gray (LBG)-type clustering algorithms [1] could be used to obtain the noiseless channel output labels from the noisy received vectors. One problem with the use of such algorithms for blind time-varying channel identification is the codebook initialization. This paper looks at two critical issues with regards to the use of VQ for channel identification. The first has to deal with the applicability of this technique in general; we present theoretical results for the conditions under which the technique may be applicable. The second aims at overcoming the codebook initialization problem by proposing a novel approach which attempts to make the first phase of the channel estimation faster than the classical codebook initialization methods. Sample simulation results are provided confirming the effectiveness of the proposed initialization technique.

• The Korean Journal of Applied Statistics
• /
• v.24 no.5
• /
• pp.963-977
• /
• 2011

PCA(Principal Component Analysis) is a well-studied statistical technique and an important tool for handling multivariate data. Although many algorithms exist for PCA, most of them are unsuitable for real time applications or high dimensional problems. Since it is desirable to avoid extensive matrix operations in such cases, alternative solutions are required to calculate the eigenvalues and eigenvectors of the sample covariance matrix. Erdogmus et al. (2004) proposed Recursive PCA(RPCA), which is a fast adaptive on-line solution for PCA, based on the first order perturbation theory. It facilitates the real-time implementation of PCA by recursively approximating updated eigenvalues and eigenvectors. However, the performance of the RPCA method becomes questionable as the size of newly-added data increases. In this paper, we modified the RPCA method by taking advantage of the mathematical relation of eigenvalues and eigenvectors of sample covariance matrix. We compared the performance of the proposed algorithm with that of RPCA, and found that the accuracy of the proposed method remarkably improved.

• Journal of Gastric Cancer
• /
• v.13 no.2
• /
• pp.98-105
• /
• 2013

Purpose: The aim of this study is to investigate the clinical factors affecting on the cure rate by invasive and open surgery for gastric cancer and to establish a subgroup of patients who can be applied by the early recovery after surgery program through this retrospective analysis. Materials and Methods: In this retrospective study, we analyzed 425 patients who underwent gastric cancer surgery between January 2011 and December 2011 and were managed with conventional clinical therapies. This clinical algorithm was made when the patient was in minimally invasive surgery group and discharged from hospital one day faster than them in open surgery group. Results: The completion rate of the clinical pathway was 62.4%. Despite the different applications of clinical pathway, completion rate in minimally invasive surgery group was significantly higher than that of open group (P<0.001). In multivariate analysis, the surgical procedure of minimally invasive surgery (odds ratio=4.281) was the most predictable factor to complete clinical pathway. Additionally, younger patients (odds ratio=1.933) who underwent distal gastrectomy (odds ratio=1.999) without combined resection (odds ratio=3.069) were predicted to accomplish the clinical pathway without any modifications. Conclusions: We concluded that high efficacy of the clinical pathway for gastric cancer surgery was expected to selected patients through retrospective analysis (expected completion rate=85.4%). In addition, these patients would become enrolled criteria for early recovery program in gastric cancer surgery.

• Genomics & Informatics
• /
• v.4 no.4
• /
• pp.161-166
• /
• 2006

The establishment of DNA microarray technology has enabled high-throughput analysis and molecular profiling of various types of cancers. By using the gene expression data from microarray analysis we are able to investigate diagnostic applications at the molecular level. The most important step in the application of microarray technology to cancer diagnostics is the selection of specific markers from gene expression profiles. In order to select markers of Immortalization and transformation we used c-myc and $H-ras^{V12}$ oncogene-transfected NIH3T3 cells as our model system. We have identified 8751 differentially expressed genes in the immortalization/transformation model by multivariate permutation F-test (95% confidence, FDR<0.01). Using the support vector machine algorithm, we selected 13 discriminative genes which could be used to predict immortalization and transformation with perfect accuracy. We assayed $H-ras^{V12}$-transfected 'transformed' cells to validate our immortalization/transformation dassification system. The selected molecular markers generated valuable additional information for tumor diagnosis, prognosis and therapy development.

• Asian-Australasian Journal of Animal Sciences
• /
• v.17 no.1
• /
• pp.7-12
• /
• 2004

Real time ultrasonic measurements for 13th rib fat thickness (LBF), longissimus muscle area (LEMA) and marbling score (LMS) of live animal at pre-harvest and subsequent carcass measurements for fat thickness (BF), longissimus muscle area (EMA), marbling score (MS) as well as body weight of live animal, carcass weight (CW), dressing percentage (DP), and total merit index (TMI) on 755 Korean beef steers were analyzed to estimate genetic parameters. Data were analyzed using multivariate animal models with an EM-REML algorithm. Models included fixed effects for year-season of birth, location of birth, test station, age of dam, linear and quadratic covariates for age or body weight at slaughter and random animal and residual effects. The heritability estimates for LEMA, LBF and LMS on RTU scans were 0.17, 0.41 and 0.55 in the age-adjusted model (Model 1) and 0.20, 0.52 and 0.55 in the weight-adjusted model (Model 2), respectively. The Heritability estimates for subsequent traits on carcass measures were 0.20, 0.38 and 0.54 in Model 1 and 0.23, 0.46 and 0.55 in Model 2, respectively. Genetic correlation estimate between LEMA and EMA was 0.81 and 0.79 in Model 1 and Model 2, respectively. Genetic correlation estimate between LBF and BF were high as 0.97 in Model 1 and 0.98 in Model 2. Real time ultrasonic marbling score were highly genetically correlated to carcass MS of 0.89 in Model 1 and 0.92 in Model 2. These results indicate that RTU scans would be alterative to carcass measurement for genetic evaluation of meat quality in a designed progeny-testing program in Korean beef cattle.