• Communications for Statistical Applications and Methods
• /
• v.28 no.5
• /
• pp.521-536
• /
• 2021

As life expectancies increase continuously over the world, the accuracy of forecasting mortality is more and more important to maintain social systems in the aging era. Currently, the most popular model used is the Lee-Carter model but various studies have been conducted to improve this model with one of them being 6-parametric factor model (6-PFM) which is introduced in this paper. To this new model, long short-term memory (LSTM) and regularized LSTM are applied in addition to vector autoregression (VAR), which is a traditional time-series method. Forecasting accuracies of several models, including the LC model, 4-PFM, 5-PFM, and 3 6-PFM's, are compared by using the U.S. and Korea life-tables. The results show that 6-PFM forecasts better than the other models (LC model, 4-PFM, and 5-PFM). Among the three 6-PFMs studied, regularized LSTM performs better than the other two methods for most of the tests.

• Journal of the Chungcheong Mathematical Society
• /
• v.28 no.1
• /
• pp.145-150
• /
• 2015

Aussel et al. [1] introduced the notion of inverse quasi-variational inequalities (IQVI) by combining quasi-variational inequalities and inverse variational inequalities. Discussions are made in a finite dimensional Euclidean space. In this note, we develop an infinite dimensional version of IQVI by investigating some basic properties of the regularized gap function of IQVI in a Banach space.

• Journal of applied mathematics & informatics
• /
• v.29 no.3_4
• /
• pp.909-920
• /
• 2011

A regularized Newton method for nonlinear ill-posed problems is considered. In each Newton step an implicit iterative method with an appropriate stopping rule is proposed and analyzed. Under certain assumptions on the nonlinear operator, the convergence of the algorithm is proved and the algorithm is stable if the discrepancy principle is used to terminate the outer iteration. Numerical experiment shows the effectiveness of the method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1614-1632
• /
• 2017

Bag of visual words is a popular model in human action recognition, but usually suffers from loss of spatial and temporal configuration information of local features, and large quantization error in its feature coding procedure. In this paper, to overcome the two deficiencies, we combine sparse coding with spatio-temporal pyramid for human action recognition, and regard this method as the baseline. More importantly, which is also the focus of this paper, we find that there is a hierarchical structure in feature vector constructed by the baseline method. To exploit the hierarchical structure information for better recognition accuracy, we propose a tree regularized classifier to convey the hierarchical structure information. The main contributions of this paper can be summarized as: first, we introduce a tree regularized classifier to encode the hierarchical structure information in feature vector for human action recognition. Second, we present an optimization algorithm to learn the parameters of the proposed classifier. Third, the performance of the proposed classifier is evaluated on YouTube, Hollywood2, and UCF50 datasets, the experimental results show that the proposed tree regularized classifier obtains better performance than SVM and other popular classifiers, and achieves promising results on the three datasets.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8C
• /
• pp.824-831
• /
• 2005

In the reconstruction of high resolution (HR) images from low resolution (LR) images frames, the error in the estimated motion degrades the reliability of the reconstructed HR image. Some methods were recently proposed where motion estimation and HR reconstruction is performed simultaneously. The estimated motion is still prone to error when it is based on a simple block matching. In this paper, we propose a reconstruction of a HR image by applying POCS and a regularized block matching simultaneously. In this method, a motion vector is obtained from a regularized block matching algorithm since the motion of a pixel in an image is highly correlated with the motion in neighboring regions. Experimental results show that the improved accuracy of the estimated motion vectors results in higher PSNR of the reconstructed HR images.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.11
• /
• pp.44-53
• /
• 1999

This paper proposes an algorithm that postprocesses wavelet-compressed images by using regularized iterative image restoration. First, an appropriate modeling the image degradation system for wavelet-compression system is needed. Then, the method which uses one of nonlinear functions as constraint in regularized iterative restoration is proposed in order to remove coding artifacts efficiently, such as ringing artifact and blocking artifact, resulted from loss of high frequency coefficients. Lastly, experimental results show superiority of proposed algorithm as compared with existing algorithm.

• Journal of IKEEE
• /
• v.4 no.2 s.7
• /
• pp.249-256
• /
• 2000

In EIT(electrical impedance tomography), the internal resistivity(or conductivity) distribution of the unknown object is estimated using the boundary voltage data induced by different current patterns using various reconstruction algorithms. In this paper, we present a regularized modified Newton-Raphson(mNR) scheme which employs additional a priori information in the cost functional as soft constraint and the weighting matrices in the cost functional are selected based on the exponentially weighted least square criterion. The computer simulation for the 32 channels synthetic data shows that the reconstruction performance of the proposed scheme is improved compared to that of the conventional regularized mNR at the expense of slightly increased computational burden.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.807-824
• /
• 2016

In this paper, a method of mood classification based on user brainwaves is proposed for real-time application in commercial services. Unlike conventional mood analyzing systems, the proposed method focuses on classifying real-time user moods by analyzing the user's brainwaves. Applying brainwave-related research in commercial services requires two elements - robust performance and comfortable fit of. This paper proposes a filter based on Regularized Common Spatial Patterns (RCSP) and presents its use in the implementation of mood classification for a music service via a wireless consumer electroencephalography (EEG) device that has only 14 pins. Despite the use of fewer pins, the proposed system demonstrates approximately 10% point higher accuracy in mood classification, using the same dataset, compared to one of the best EEG-based mood-classification systems using a skullcap with 32 pins (EU FP7 PetaMedia project). This paper confirms the commercial viability of brainwave-based mood-classification technology. To analyze the improvements of the system, the changes of feature variations after applying RCSP filters and performance variations between users are also investigated. Furthermore, as a prototype service, this paper introduces a mood-based music list management system called MyMusicShuffler based on the proposed mood-classification method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2607-2627
• /
• 2017

Nonnegative matrix factorization (NMF) has received considerable attention due to its effectiveness of reducing high dimensional data and importance of producing a parts-based image representation. Most of existing NMF variants attempt to address the assertion that the observed data distribute on a nonlinear low-dimensional manifold. However, recent research results showed that not only the observed data but also the features lie on the low-dimensional manifolds. In addition, a few hard priori label information is available and thus helps to uncover the intrinsic geometrical and discriminative structures of the data space. Motivated by the two aspects above mentioned, we propose a novel algorithm to enhance the effectiveness of image representation, called Dual graph-regularized Constrained Nonnegative Matrix Factorization (DCNMF). The underlying philosophy of the proposed method is that it not only considers the geometric structures of the data manifold and the feature manifold simultaneously, but also mines valuable information from a few known labeled examples. These schemes will improve the performance of image representation and thus enhance the effectiveness of image classification. Extensive experiments on common benchmarks demonstrated that DCNMF has its superiority in image classification compared with state-of-the-art methods.

• Journal of Biomedical Engineering Research
• /
• v.22 no.4
• /
• pp.311-319
• /
• 2001

Statistical reconstruction methods in the context of a Bayesian framework have played an important role in emission tomography since they allow to incorporate a priori information into the reconstruction algorithm. Given the ill-posed nature of tomographic inversion and the poor quality of projection data, the Bayesian approach uses regularizers to stabilize solutions by incorporating suitable prior models. In this work we show that, while the quantitative performance of the standard filtered backprojection (FBP) algorithm is not as good as that of Bayesian methods, the application of spline-regularized smoothing to the sinogram space can make the FBP algorithm improve its performance by inheriting the advantages of using the spline priors in Bayesian methods. We first show how to implement the spline-regularized smoothing filter by deriving mathematical relationship between the regularization and the lowpass filtering. We then compare quantitative performance of our new FBP algorithms using the quantitation of bias/variance and the total squared error (TSE) measured over noise trials. Our numerical results show that the second-order spline filter applied to FBP yields the best results in terms of TSE among the three different spline orders considered in our experiments.