• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11C
• /
• pp.1073-1078
• /
• 2007

In this paper, we propose an iterative mixed norm image restoration algorithm using multi regularization parameters. A functional which combines the regularized $l_2$ norm functional and the regularized $l_4$ norm functional is proposed to efficiently remove arbitrary noise. The smoothness of each functional is determined by the regularization parameters. Also, a regularization parameter is used to determine the relative importance between the regularized $l_2$ norm functional and the regularized $l_4$ norm functional using kurtosis. An iterative algorithm is utilized for obtaining a solution and its convergence is analyzed. Experimental results demonstrate the capability of the proposed algorithm.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.489-492
• /
• 2003

In this paper, we propose an iterative mixed norm image restoration algorithm using multi regularization parameters. A functional which combines the regularized l$_2$ norm functional and the regularized l$_4$ functional is proposed. The smoothness of each functional is determined by the regularization parameters. Also, a regularization parameter is used to determine the relative importance between the regularized l$_2$ functional and the regularized l$_4$ functional. An iterative algorithm is utilized for obtaining a solution and its convergence is analyzed.

• The Journal of the Acoustical Society of Korea
• /
• v.35 no.5
• /
• pp.383-388
• /
• 2016

We develop two methods to select a constant in the RLS (Recursive Least Squares) with the convex regularization. The RLS with the convex regularization was proposed by Eksioglu and Tanc in order to estimate the sparse acoustic channel. However the algorithm uses the regularization constant which needs the information about the true channel response for the best performance. In this paper, we propose two methods to select the regularization constant which don't need the information about the true channel response. We show that the estimation performance using the proposed methods is comparable with the Eksioglu and Tanc's algorithm.

• East Asian mathematical journal
• /
• v.32 no.1
• /
• pp.129-138
• /
• 2016

In this paper, we propose an efficient regularization technique (The Method of Regularized Ratios) for the reconstruction of the shape of a rigid elastic scatterer from far field measurements. The approach used is based on the factorization method and creates via Picard's condition ratios, baptized Regularized Ratios, that serve to effectively remove unwanted singular values that may lead to poor reconstructions. This is achieved through the use of a sophisticated algorithm that progressively adjusts an initially set moderate tolerance. In comparison with the well established Tikhonov-Morozov regularization techniques our new algorithm appears to be more computationally efficient as it doesn't require computation of the regularization parameter for each point in the grid.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1245-1256
• /
• 2011

In this paper, we proposed a regularization interior point method for semidefinite programming with free variables which can be taken as an extension of the algorithm for standard semidefinite programming. Since an inexact search direction at each iteration is used, the computation of the designed algorithm is much less compared with the existing solution methods. The convergence analysis of the method is established under weak conditions.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.1
• /
• pp.43-50
• /
• 2010

Fuzzy c-means (FCM) and possibilistic c-means (PCM) are the two most well-known clustering algorithms in fuzzy clustering area, and have been applied in many applications in their original or modified forms. However, FCM's noise sensitivity problem and PCM's overlapping cluster problem are also well known. Recently there have been several attempts to combine both of them to mitigate the problems and possibilistic fuzzy c-means (PFCM) showed promising results. In this paper, we proposed a modified PFCM using regularization to reduce noise sensitivity in PFCM further. Regularization is a well-known technique to make a solution space smooth and an algorithm noise insensitive. The proposed algorithm, PFCM with regularization (PFCM-R), can take advantage of regularization and further reduce the effect of noise. Experimental results are given and show that the proposed method is better than the existing methods in noisy conditions.

• Smart Structures and Systems
• /
• v.31 no.3
• /
• pp.229-245
• /
• 2023

The absence of excitation measurements may pose a big challenge in the application of structural damage identification owing to the fact that substantial effort is needed to reconstruct or identify unknown input force. To address this issue, in this paper, an iterative strategy, a synergy of Tikhonov regularization method for force identification and modified Jaya algorithm (M-Jaya) for stiffness parameter identification, is developed for damage identification with partial output-only responses. On the one hand, the probabilistic clustering learning technique and nonlinear updating equation are introduced to improve the performance of standard Jaya algorithm. On the other hand, to deal with the difficulty of selection the appropriate regularization parameters in traditional Tikhonov regularization, an improved L-curve method based on B-spline interpolation function is presented. The applicability and effectiveness of the iterative strategy for simultaneous identification of structural damages and unknown input excitation is validated by numerical simulation on a 21-bar truss structure subjected to ambient excitation under noise free and contaminated measurements cases, as well as a series of experimental tests on a five-floor steel frame structure excited by sinusoidal force. The results from these numerical and experimental studies demonstrate that the proposed identification strategy can accurately and effectively identify damage locations and extents without the requirement of force measurements. The proposed M-Jaya algorithm provides more satisfactory performance than genetic algorithm, Gaussian bare-bones artificial bee colony and Jaya algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.11
• /
• pp.5481-5495
• /
• 2018

Single pixel imaging technology has developed for years, however the video acquisition on the single pixel camera is not a well-studied problem in computer vision. This work proposes a new scheme for single pixel camera to acquire video data and a new regularization for robust signal recovery algorithm. The method establishes a single pixel video compressive sensing scheme to reconstruct the video clips in spatial domain by recovering the difference of the consecutive frames. Different from traditional data acquisition method works in transform domain, the proposed scheme reconstructs the video frames directly in spatial domain. At the same time, a new regularization called spatial cluster is introduced to improve the performance of signal reconstruction. The regularization derives from the observation that the nonzero coefficients often tend to be clustered in the difference of the consecutive video frames. We implement an experiment platform to illustrate the effectiveness of the proposed algorithm. Numerous experiments show the well performance of video acquisition and frame reconstruction on single pixel camera.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06a
• /
• pp.33-36
• /
• 1998

Most image restoration problems are ill-posed and need to e regularized. A difficult task in image regularization is to avoid smoothing of image edges. In this paper, were proposed an edge-preserving image restoration algorithm using block-based edge classification. In order to exploit the local image characteristics, we classify image blocks into edge and no-edge blocks. We then apply an adaptive constrained least squares (CLS) algorithm to eliminate noise around the edges. Experimental results demonstrate that the proposed algorithm can preserve image edges during the regularization process.

• Structural Engineering and Mechanics
• /
• v.22 no.4
• /
• pp.401-418
• /
• 2006

Solutions to the problems of structural parameter estimation from modal response using leastsquares minimization of force or displacement residuals are generally sensitive to noise in the response measurements. The sensitivity of the parameter estimates is governed by the physical characteristics of the structure and certain features of the noisy measurements. It has been shown that the regularization method can be used to reduce effects of the measurement noise on the estimation error through adding a regularization function to the parameter estimation objective function. In this paper, we adopt the regularization function as the Euclidean norm of the difference between the values of the currently estimated parameters and the a priori parameter estimates. The effect of the regularization function on the outcome of parameter estimation is determined by a regularization factor. Based on a singular value decomposition of the sensitivity matrix of the structural response, it is shown that the optimal regularization factor is obtained by using the maximum singular value of the sensitivity matrix. This selection exhibits the condition where the effect of the a priori estimates on the solutions to the parameter estimation problem is minimal. The performance of the proposed algorithm is investigated in comparison with certain algorithms selected from the literature by using a numerical example.