• Journal of Energy Engineering
• /
• v.10 no.3
• /
• pp.183-187
• /
• 2001

Impedance imaging for binary mixture is a kind of nonlinear inverse problem, which is usually solved iteratively by the Newton-Raphson method. Then, the ill-posedness of Hessian matrix often requires the use of a regularization method to stabilize the solution. In this study, the Levenberg-Marquredt regularization method is introduced for the binary-mixture system with various resistivity contrasts (1:2∼1:1000). Several mixture distribution are tested and the results show that the Newton-Raphson iteration combined with the Levenberg-Marquardt regularization can reconstruct reasonably good images.

• Communications of the Korean Mathematical Society
• /
• v.9 no.4
• /
• pp.783-796
• /
• 1994

Let V be a vector space of dimension m over Q, and let (, ) be a non-degenerate bilinear form on V. Let r be the Witt index of V, and let $V = V' + V_0 + V"$ be the Witt decomposition, where $V_0$ is anisotropic and V', V" are paired non-singularly. Let H = O(m-r, r) be the isometry group of V, (, ), viewed as an algebraic group over Q. Let G = Sp(n) be the symplectic group of rank n defined over Q.ed over Q.

• Communications for Statistical Applications and Methods
• /
• v.6 no.3
• /
• pp.831-842
• /
• 1999

We propose a wavelet decomposition feature extraction method for the hand-written character recognition. Comparing the recognition rates of which methods with original image features and with selected features by the wavelet decomposition we study the characteristics of the proposed method. LDA(Linear Discriminant Analysis) QDA(Quadratic Discriminant Analysis) RDA(Regularized Discriminant Analysis) and NN(Neural network) are used for the calculation of recognition rates. 6000 hand-written numerals from CENPARMI at Concordia University are used for the experiment. We found that the set of significantly selected wavelet decomposed features generates higher recognition rate than the original image features.

• Bulletin of the Korean Chemical Society
• /
• v.18 no.12
• /
• pp.1281-1285
• /
• 1997

The time-dependent tracking inversion method is developed to extract the potential of the excited state from frequency-domain measurements, such as the absorption profile. Based on the relay of the regularized inversion procedure and time-dependent wave-packet propagation, the algorithm extract the underlying potential piece by piece by tracking the time-dependent data which can be synthesized from frequency-domain measurements. We have demonstrated the algorithm to extract the potential of excited state for a model diatomic molecule. Finally, we describe the merits of the time-dependent tracking inversion method compared to the time-dependent inversion and discuss several extensions of the algorithm.

• Structural Engineering and Mechanics
• /
• v.29 no.3
• /
• pp.279-288
• /
• 2008

In the present study, the discrete singular convolution (DSC) method is developed for buckling analysis of columns and thin plates having different geometries. Regularized Shannon's delta (RSD) kernel is selected as singular convolution to illustrate the present algorithm. In the proposed approach, the derivatives in both the governing equations and the boundary conditions are discretized by the method of DSC. The results obtained by DSC method were compared with those obtained by the other numerical and analytical methods.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.38 no.5
• /
• pp.23-32
• /
• 2001

Electrical impedance tomography (EIT) is a relatively new imaging modality in which the resistivity (conductivity) distribution of the unknown object is estimated based on the known sets of injected currents and measured voltages on the surface of the object. In this paper, we propose a dynamical EIT reconstruction algorithm based on the regularized extended Kalman filter(EKF). The EIT inverse problem is formulated as dynamic equation which consists of the slate equation and the observation equation, and the unknown state(resistivity) is estimated recursively with the aid of the EKF. In doing so, the generalized Tikhonov regularization technique is employed in the cost functional to mitigate the ill-posedness characteristics of the inverse problem. Computer simulations for the 16-channel synthetic data are provided to illustrate the reconstruction performance of the proposed algorithm.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.4
• /
• pp.689-697
• /
• 2010

In this study, we propose a new procedure for improving the character recognition of text area extracted from video images. The recognition of strings extracted from video, which are mixed with Hangul, English, numbers and special characters, etc., is more difficult than general character recognition because of various fonts and size, graphic forms of letters tilted image, disconnection, miscellaneous videos, tangency, characters of low definition, etc. We improved the recognition rate by taking commonly used letters and leaving out the barely used ones instead of recognizing all of the letters, and then using SVM and RDA character recognition methods. Our numerical results indicate that combining SVM and RDA performs better than other methods.

• Journal of Broadcast Engineering
• /
• v.8 no.1
• /
• pp.19-29
• /
• 2003

The demand for high-resolution images is gradually increasing, whereas many imaging systems yield aliased and undersampled images during image acquisition. In this paper, we propose a high-resolution image reconstruction algorithm considering inaccurate subpixel registration. A regularized Iterative reconstruction algorithm is adopted to overcome the ill-posedness problem resulting from inaccurate subpixel registration. In particular, we use multichannel image reconstruction algorithms suitable for application with multiframe environments. Since the registration error in each low-resolution has a different pattern, the regularization parameters are determined adaptively for each channel. We propose a methods for estimating the regularization parameter automatically. The preposed algorithm are robust against the registration error noise. and they do not require any prior information about the original image or the registration error process. Experimental results indicate that the proposed algorithms outperform conventional approaches in terms of both objective measurements and visual evaluation.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.6
• /
• pp.26-35
• /
• 2009

In this paper, we present morphology-based step region extraction and regularized iterative point-spread-function (PSF) estimation methods. The proposed PSF estimation method uses canny edge detector to extract the edge of the input image. We extract feasible vertical and horizontal edges using morphology analysis, such as the hit-or-miss transform. Given extracted edges we estimate the optimal step-response using flattening and normalization processes. The PSF is finally characterized by solving the equation which relates the optimal step response and the 2D isotropic PSF. We shows the restored image by the estimated PSF. The proposed algorithm can be applied a fully digital auto-focusing system without using mechanical focusing parts.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.1
• /
• pp.1-7
• /
• 2020

Fuzzy clustering, represented by FCM(Fuzzy C-Means), is a simple and efficient clustering method. However, the object function in FCM makes clusters affect clustering results proportional to the density of clusters, which can distort clustering results due to density difference between clusters. One method to alleviate this density problem is EDI-FCM(Extended Density-Independent FCM), which adds additional terms to the objective function of FCM to compensate for the density difference. In this paper, proposed is an enhanced EDI-FCM using regularization, Regularized EDI-FCM. Regularization is commonly used to make a solution space smooth and an algorithm noise insensitive. In clustering, regularization can reduce the effect of a high-density cluster on clustering results. The proposed method converges quickly and accurately to real centers when compared with FCM and EDI-FCM, which can be verified with experimental results.