• Journal of Biomedical Engineering Research
• /
• v.36 no.5
• /
• pp.211-220
• /
• 2015

Recently, model-based iterative reconstruction (MBIR) has played an important role in transmission tomography by significantly improving the quality of reconstructed images for low-dose scans. MBIR is based on the penalized-likelihood (PL) approach, where the penalty term (also known as the regularizer) stabilizes the unstable likelihood term, thereby suppressing the noise. In this work we further improve MBIR by using a more expressive regularizer which can restore the underlying image more accurately. Here we used a spline regularizer derived from a linear combination of the two-dimensional splines with first- and second-order spatial derivatives and applied it to a non-quadratic convex penalty function. To derive a PL algorithm with the spline regularizer, we used a separable paraboloidal surrogates algorithm for convex optimization. The experimental results demonstrate that our regularization method improves reconstruction accuracy in terms of both regional percentage error and contrast recovery coefficient by restoring smooth edges as well as sharp edges more accurately.

• Journal of computational fluids engineering
• /
• v.22 no.1
• /
• pp.51-58
• /
• 2017

A penalized VIC method offers an efficient hybrid particle-mesh algorithm to simulate an incompressible viscous flow passing a solid body in an infinite domain. In this manner, the computational domain needs to be restricted to a relatively small region to reduce computational cost which would be very high in case of using a large domain. In this paper, we present how to dispose of far-field particles to avoid an unnecessarily large computational domain. The present approach constraints expansion of the domain and thus prevents the incremental computational cost. To validate the numerical approach, a flow around an impulsively started sphere was simulated for Reynolds numbers of 100 and 1000.

• Communications for Statistical Applications and Methods
• /
• v.24 no.2
• /
• pp.143-154
• /
• 2017

A variable selection method based on probabilistic principal component analysis (PCA) using penalized likelihood method is proposed. The proposed method is a two-step variable reduction method. The first step is based on the probabilistic principal component idea to identify principle components. The penalty function is used to identify important variables in each component. We then build a model on the original data space instead of building on the rotated data space through latent variables (principal components) because the proposed method achieves the goal of dimension reduction through identifying important observed variables. Consequently, the proposed method is of more practical use. The proposed estimators perform as the oracle procedure and are root-n consistent with a proper choice of regularization parameters. The proposed method can be successfully applied to high-dimensional PCA problems with a relatively large portion of irrelevant variables included in the data set. It is straightforward to extend our likelihood method in handling problems with missing observations using EM algorithms. Further, it could be effectively applied in cases where some data vectors exhibit one or more missing values at random.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.1
• /
• pp.125-133
• /
• 2013

In this paper, penalized binary logistic regression models are employed as statistical models for determining the discharge of 668 patients with a chief complaint of dyspnea based on 11 blood tests results. Specifically, the ridge model based on $L^2$ penalty and the Lasso model based on $L^1$ penalty are considered in this paper. In the comparison of prediction accuracy, our models are compared with the logistic regression models with all 11 explanatory variables and the selected variables by variable selection method. The results show that the prediction accuracy of the ridge logistic regression model is the best among 4 models based on 10-fold cross-validation.

• The Korean Journal of Applied Statistics
• /
• v.28 no.2
• /
• pp.281-288
• /
• 2015

In this paper, we study an approximate procedure to evaluate a penalized maximum likelihood estimator (MLE) for a mixed effects model. The procedure approximates the Hessian matrix of the penalized MLE with a structured sparse matrix or an arrowhead type matrix to speed its computation. In this paper, we numerically investigate the gain in computation time as well as approximation error from the considered approximation procedure.

• Communications for Statistical Applications and Methods
• /
• v.27 no.6
• /
• pp.603-624
• /
• 2020

There is an emerging interest in brain functional connectivity (FC) based on functional Magnetic Resonance Imaging in Alzheimer's disease (AD) studies. The complex and high-dimensional structure of FC makes it challenging to explore the association between altered connectivity and AD susceptibility. We develop a pipeline to refine FC as proper covariates in a penalized logistic regression model and classify normal and AD susceptible groups. Three different quantification methods are proposed for FC refinement. One of the methods is dimension reduction based on common component analysis (CCA), which is employed to address the limitations of the other methods. We applied the proposed pipeline to the Alzheimer's Disease Neuroimaging Initiative (ADNI) data and deduced pathogenic FC biomarkers associated with AD susceptibility. The refined FC biomarkers were related to brain regions for cognition, stimuli processing, and sensorimotor skills. We also demonstrated that a model using CCA performed better than others in terms of classification performance and goodness-of-fit.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.10
• /
• pp.3458-3478
• /
• 2022

Automatic modulation recognition is the core algorithm in the field of modulation classification in communication systems. Our investigations show that deep learning (DL) based modulation recognition techniques have achieved effective progress for multiple-input multiple-output (MIMO) systems. However, network complexity is always an additional burden for high-accuracy classifications, which makes it impractical. Therefore, in this paper, we propose a low-complexity dimensional interactive lightweight network (DilNet) for MIMO systems. Specifically, the signals received by different antennas are cooperatively input into the network, and the network calculation amount is reduced through the depth-wise separable convolution. A two-dimensional interactive attention (TDIA) module is designed to extract interactive information of different dimensions, and improve the effectiveness of the cooperation features. In addition, the TDIA module ensures low complexity through compressing the convolution dimension, and the computational burden after inserting TDIA is also acceptable. Finally, the network is trained with a penalized statistical entropy loss function. Simulation results show that compared to existing modulation recognition methods, the proposed DilNet dramatically reduces the model complexity. The dimensional interactive lightweight network trained by penalized statistical entropy also performs better for recognition accuracy in MIMO systems.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.3
• /
• pp.500-506
• /
• 2019

In this study, we present a decision function of optimal smoothing parameter for baseline correction using Asymmetrically reweighted penalized least squares (arPLS). Baseline correction is very important due to influence on performance of spectral analysis in application of spectroscopy. Baseline is often estimated by parameter selection using visual inspection on analyte spectrum. It is a highly subjective procedure and can be tedious work especially with a large number of data. For these reasons, an objective procedure is necessary to determine optimal parameter value for baseline correction. The proposed function is defined by modeling the median value of possible parameter range as the length and order of the background signal. The median value increases as the length of the signal increases and decreases as the degree of the signal increases. The simulated data produced a total of 112 signals combined for the 7 lengths of the signal, adding analytic signals and linear and quadratic, cubic and 4th order curve baseline respectively. According to the experimental results using simulated data with linear, quadratic, cubic and 4th order curved baseline, and real Raman spectra, we confirmed that the proposed function can be effectively applied to optimal parameter selection for baseline correction using arPLS.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.729-731
• /
• 2004

This paper deals with the design of a low order $H_{\infty}$ controller by using an iterative linear matrix inequality (LMI) method. The low order $H_{\infty}$ controller is represented in terms of LMIs with a rank condition. To solve the non-convex rank-constrained LMI problem, a linear penalty function is incorporated into the objective function so that minimizing the penalized objective function subject to LMIs amounts to a convex optimization problem. With an increasing sequence of the penalty parameter, the solution of the penalized optimization problem moves towards the feasible region of the original non-convex problem. The proposed algorithm is, therefore, convergent. Numerical experiments show the effectiveness of the proposed algorithm.

• Genomics & Informatics
• /
• v.14 no.4
• /
• pp.149-159
• /
• 2016

With the success of the genome-wide association studies (GWASs), many candidate loci for complex human diseases have been reported in the GWAS catalog. Recently, many disease prediction models based on penalized regression or statistical learning methods were proposed using candidate causal variants from significant single-nucleotide polymorphisms of GWASs. However, there have been only a few systematic studies comparing existing methods. In this study, we first constructed risk prediction models, such as stepwise linear regression (SLR), least absolute shrinkage and selection operator (LASSO), and Elastic-Net (EN), using a GWAS chip and GWAS catalog. We then compared the prediction accuracy by calculating the mean square error (MSE) value on data from the Korea Association Resource (KARE) with body mass index. Our results show that SLR provides a smaller MSE value than the other methods, while the numbers of selected variables in each model were similar.