• Journal of Internet Computing and Services
• /
• v.13 no.4
• /
• pp.53-62
• /
• 2012

Object segmentation is a demanding research area and not a trivial problem of image processing and computer vision. Tremendous segmentation algorithms were addressed on gray-scale (or biomedical) images that rely on numerous image features as well as their strategies. These works in practice cannot apply to natural color images because of their negative effects to color values due to the use of gray-scale gradient information. In this paper, we proposed a new approach for color object segmentation by modifying a geometric active contour model named distance regularized level set evolution (DRLSE). Its speed function will be designed to exploit as much as possible color gradient information of images. Finally, we provide experiments to show performance of our method with respect to its accuracy and time efficiency using various color images.

• Journal of Hydrogen and New Energy
• /
• v.32 no.6
• /
• pp.592-611
• /
• 2021

In this study a rarely available high-throughput cycling data set of 124 commercial lithium iron phosphate/graphite cells cycled under fast-charging conditions, with widely varying cycle lives ranging from 150 to 2,300 cycles including in-cycle temperature and per-cycle IR measurements. We worked out own Python codes which reproduced the various data plots and machine learning approaches for cycle life prediction using early cycles and more details not presented in the article and the supplementary information. Particularly, we applied regularized ridge, lasso and elastic net linear regression models using features extracted from capacity fade curves, discharge voltage curves, and other data such as internal resistance and cell can temperature. We found that due to the limitation in the quantity and quality of the data from costly and lengthy battery testing a careful hyperparameter tuning may be required and that model features need to be extracted based on the domain knowledge.

• Journal of applied mathematics & informatics
• /
• v.31 no.5_6
• /
• pp.795-812
• /
• 2013

The merit function arises from the development of the solution methods for the complementarity problems defined over the cone of non negative real vectors and has been well extended to the complementarity problems defined over the symmetric cones. In this paper, we focus on the extension of the merit functions including the gap function, the regularized gap function, the implicit Lagrangian and others to the complementarity problems defined over the nonsymmetric matrix cone. These theoretical results of this paper suggest new solution methods based on unconstrained and/or simply constrained methods to solve the matrix cone complementarity problems (MCCP).

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.3
• /
• pp.843-852
• /
• 2016

A vortex sheet is susceptible to the Kelvin-Helmhotz instability, which leads to a singularity at finite time. The vortex blob model provided a regularization for the motion of vortex sheets in an inviscid fluid. In this paper, we consider the blob model for viscous vortex sheets and present a linear stability analysis for regularized sheets. We show that the diffusing viscous vortex sheet is unstable to small perturbations, regardless of the regularization, but the viscous sheet in the sharp limit becomes stable, when the regularization is applied. Both the regularization parameter and viscosity damp the growth rate of the sharp viscous vortex sheet for large wavenumbers, but the regularization parameter gives more significant effects than viscosity.

• Journal of the Korean Mathematical Society
• /
• v.55 no.4
• /
• pp.849-875
• /
• 2018

The purpose of this paper is to present an operator method of regularization for the problem of finding a solution of a system of nonlinear ill-posed equations with a monotone hemicontinuous mapping and N inverse-strongly monotone mappings in Banach spaces. A regularization parameter choice is given and convergence rate of the regularized solutions is estimated. We also give the convergence and convergence rate for regularized solutions in connection with the finite-dimensional approximation. An iterative regularization method of zero order in a real Hilbert space and two examples of numerical expressions are also given to illustrate the effectiveness of the proposed methods.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.4
• /
• pp.39-44
• /
• 2004

The three-dimensional (3D) wavelet transform with motion compensation is suitable for very high quality video coding due to both spatial and temporal decorrelations. However, it still suffers from image degradation such as ringing artifact and afterimage because of the loss of high frequency components by quantization. This paper proposes an iterative regularized enhancement of the motion-compensated 3D wavelet coded video. We also propose the adaptive implementation of the constraints for the regularization. It selectively suppresses the high frequency component along only the corresponding edge direction.

• ETRI Journal
• /
• v.38 no.3
• /
• pp.435-443
• /
• 2016

In this paper, an efficient beam tracking algorithm for a regularized zero-forcing (RZF) approach in slowly fading multiple-input and single-output (MISO) broadcast channels is considered. By modifying an RZF equation, an RZF beam tracking algorithm is proposed using matrix perturbation theory. The proposed algorithm utilizes both beams from the previous time step and channel difference (between the previous and current time steps) to calculate the RZF beams. The tracking performance of the proposed algorithm is analyzed in terms of the mean square error (MSE) between a tracking approach and an exact recomputing approach, and in terms of the additional MSE caused by the beam tracking error at the receiver. Numerical results show that the proposed algorithm has almost the same performance as the exact recomputing approach in terms of the sum rate.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1903-1906
• /
• 2003

This paper proposes an adaptive regularized noise smoothing algorithm for range image using the area decreasing flow method, which can preserve meaningful edges during the smoothing process. Although the area decreasing flow method can easily smooth Gaussian noise, it has two problems; ⅰ) it is not easy to remove impulsive noise from observed range data, and ⅱ) it is also difficult to remove noise near edge when the adaptive regularization is used. In the paper, therefore, the second smoothness constraint is addtionally incorporated into the existing regularization algorithm, which minimizes the difference between the median filtered data and the estimated data. As a result, the Proposed algorithm can effectively remove the noise of dense range data with edge preserving.

• Journal of Korean Institute of Industrial Engineers
• /
• v.36 no.1
• /
• pp.13-21
• /
• 2010

The prediction of contract cancellation of customers is essential in insurance companies but it is a difficult problem because the customer database is large and the target or cancelled customers are a small proportion of the database. This paper proposes a new data mining approach to the binary classification by handling a large-scale unbalanced data. Over-sampling, clustering, regularized logistic regression and boosting are also incorporated in the proposed approach. The proposed approach was applied to a real data set in the area of insurance and the results were compared with some other classification techniques.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.373-385
• /
• 2006

To solve a class of nonlinear parameter estimation problems, a method combining the regularized structured nonlinear total least norm (RSNTLN) method and parameter separation scheme is suggested. The method guarantees the convergence of parameters and has an advantages in reducing the residual norm over the use of RSNTLN only. Numerical experiments for two models appeared in signal processing show that the suggested method is more effective in obtaining solution and parameter with minimum residual norm.