• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2006.04a
• /
• pp.299-306
• /
• 2006

Using a level set method and topological derivatives, a topological shape optimization method that is independent of an initial design is developed for linearly elastic structures. In the level set method, the initial domain is kept fixed and its boundary is represented by an implicit moving boundary embedded in the level set function, which facilitates to handle complicated topological shape changes. The 'Hamilton-Jacobi (H-J)' equation and computationally robust numerical technique of 'up-wind scheme' lead the initial implicit boundary to an optimal one according to the normal velocity field while minimizing the objective function of compliance and satisfying the constraint of allowable volume. Based on the asymptotic regularization concept, the topological derivative is considered as the limit of shape derivative as the radius of hole approaches to zero. The required velocity field to update the H -J equation is determined from the descent direction of Lagrangian derived from optimality conditions. It turns out that the initial holes is not required to get the optimal result since the developed method can create holes whenever and wherever necessary using indicators obtained from the topological derivatives. It is demonstrated that the proper choice of control parameters for nucleation is crucial for efficient optimization process.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.6
• /
• pp.209-220
• /
• 2014

Compressive Sensing (CS) is a new signal acquisition paradigm which enables sampling under Nyquist rate for a special kind of signal called sparse signal. There are plenty of CS recovery methods but their performance are still challenging, especially at a low sub-rate. For CS recovery of natural images, regularizations exploiting some prior information can be used in order to enhance CS performance. In this context, this paper addresses improving quality of reconstructed natural images based on Dantzig selector and smooth filters (i.e., Gaussian filter and nonlocal means filter) to generate a new regularization called smooth residual error regularization. Moreover, total variation has been proved for its success in preserving edge objects and boundary of reconstructed images. Therefore, effectiveness of the proposed regularization is verified by experimenting it using augmented Lagrangian total variation minimization. This framework is considered as a new CS recovery seeking smoothness in residual images. Experimental results demonstrate significant improvement of the proposed framework over some other CS recoveries both in subjective and objective qualities. In the best case, our algorithm gains up to 9.14 dB compared with the CS recovery using Bayesian framework.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.32 no.4
• /
• pp.223-231
• /
• 2019

A continuum-based design sensitivity analysis(DSA) method is developed for electrostatic problems. To consider high order objective functions, we use 9-node finite element basis functions for analysis and DSA methods. As the design variables are parameterized with B-spline functions, smooth boundary variations are naturally obtained. To solve mesh entanglement problems during the optimization process, a mesh regularization scheme is employed. By minimizing the Dirichlet energy functional, mesh uniformity can be automatically achieved. In numerical examples for maximizing dielectrophoresis forces, the numerical results are compared with well-known electrode geometries and the obtained characteristics are discussed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.10
• /
• pp.3708-3728
• /
• 2021

Indian herbal plants are used in agriculture and in the food, cosmetics, and pharmaceutical industries. Laboratory-based tests are routinely used to identify and classify similar herb species by analyzing their internal cell structures. In this paper, we have applied computer vision techniques to do the same. The original leaf image was preprocessed using the Chan-Vese active contour segmentation algorithm to efface the background from the image by setting the contraction bias as (v) -1 and smoothing factor (µ) as 0.5, and bringing the initial contour close to the image boundary. Thereafter the segmented grayscale image was fed to a leaky capacitance fired neuron model (LCFN), which differentiates between similar herbs by combining different groups of pixels in the leaf image. The LFCN's decay constant (f), decay constant (g) and threshold (h) parameters were empirically assigned as 0.7, 0.6 and h=18 to generate the 1D feature vector. The LCFN time sequence identified the internal leaf structure at different iterations. Our proposed framework was tested against newly collected herbal species of natural images, geometrically variant images in terms of size, orientation and position. The 1D sequence and shape features of aloe, betel, Indian borage, bittergourd, grape, insulin herb, guava, mango, nilavembu, nithiyakalyani, sweet basil and pomegranate were fed into the 5-fold Bayesian regularization neural network (BRNN), K-nearest neighbors (KNN), support vector machine (SVM), and ensemble classifier to obtain the highest classification accuracy of 91.19%.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.11
• /
• pp.73-84
• /
• 1992

In this paper, an algorithm for recovering the 3-D shape from a single shaded image is proposed. In the proposed algorithm, by using the relation between the height and surface gradient (p, q), a set of linear equations is derived from the linearized reflectance function. Then the 3-D surface is recovered by employing the conjugate gradient technique. In order to improve the convergence speed of the solution, we also employ the hierarchical basis function and multiresolution images in the algorithm. A method for determining the regularization parameter, which is determined by trial and error in the conventional approach, is also introduced. In addition, the proposed algorithm attempts to recover the 3-D surface without requiring the boundary conditions, making it suitable for a real-time implementation. Simulation results for real image as well as synthetic image are provided to demonstrate the performance of the proposed algorithm.

• Journal of applied mathematics & informatics
• /
• v.31 no.3_4
• /
• pp.353-363
• /
• 2013

A variant of the global conjugate gradient method for solving general linear systems with multiple right-hand sides is proposed. This method is called as the global conjugate gradient linear least squares (Gl-CGLS) method since it is based on the conjugate gradient least squares method(CGLS). We present how this method can be implemented for the image deblurring problems with Neumann boundary conditions. Numerical experiments are tested on some blurred images for the purpose of comparing the computational efficiencies of Gl-CGLS with CGLS and Gl-LSQR. The results show that Gl-CGLS method is numerically more efficient than others for the ill-posed problems.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.1
• /
• pp.37-56
• /
• 2013

This paper deals with the behavior of positive solutions to the following nonlocal polytropic filtration system $$\{u_t=(\mid(u^{m_1})_x{\mid}^{{p_1}^{-1}}(u^{m_1})_x)_x+u^{l_{11}}{{\int_0}^a}v^{l_{12}}({\xi},t)d{\xi},\;(x,t)\;in\;[0,a]{\times}(0,T),\\{v_t=(\mid(v^{m_2})_x{\mid}^{{p_2}^{-1}}(v^{m_2})_x)_x+v^{l_{22}}{{\int_0}^a}u^{l_{21}}({\xi},t)d{\xi},\;(x,t)\;in\;[0,a]{\times}(0,T)}$$ with nonlinear boundary conditions $u_x{\mid}{_{x=0}}=0$, $u_x{\mid}{_{x=a}}=u^{q_{11}}u^{q_{12}}{\mid}{_{x=a}}$, $v_x{\mid}{_{x=0}}=0$, $v_x|{_{x=a}}=u^{q21}v^{q22}|{_{x=a}}$ and the initial data ($u_0$, $v_0$), where $m_1$, $m_2{\geq}1$, $p_1$, $p_2$ > 1, $l_{11}$, $l_{12}$, $l_{21}$, $l_{22}$, $q_{11}$, $q_{12}$, $q_{21}$, $q_{22}$ > 0. Under appropriate hypotheses, the authors establish local theory of the solutions by a regularization method and prove that the solution either exists globally or blows up in finite time by using a comparison principle.

• Journal of Korean Society for Geospatial Information Science
• /
• v.20 no.4
• /
• pp.117-125
• /
• 2012

Although many studies have been conducted to extract buildings from airborne lidar data, most of them assume that all the boundaries of a building are straight line segments. This makes it difficult to model building boundaries containing curved segments correctly. This paper aims to model buildings containing curved segments as combination of straight lines and arcs. First, two sets of boundary points are extracted by adaptive convex hull algorithm and local convex hull algorithm with a larger radius. Then, arc segments are determined by average spacing of boundary points and intersection ratio of perpendicular lines. Finally, building boundary is modeled through regularization of least squares line or circle fitting. The experimental results showed that the proposed method can model the curved building boundaries as arc segments correctly by completeness of 69% and correctness of 100%. The approach will be utilized effectively to create automatically digital map that meets the conditions of the Korean digital mapping.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.3
• /
• pp.58-65
• /
• 2002

In order to reduce blocking artifacts in inter-frame coded images, we propose a new image restoration algorithm, which directly processes differential images before reconstruction. We note that blocking artifact in inter-frame coded images is caused by both 8$\times$8 DCT and 16$\times$16 macroblock based motion compensation, while that of intra-coded images is caused by 8$\times$8 DCT only. According to the observation, we Propose a new degradation model for differential images and the corresponding restoration algorithm that utilizes additional constraints and convex sets for discontinuity inside blocks. The proposed restoration algorithm is a modified version of standard regularization that incorporate!; spatially adaptive lowpass filtering with consideration of edge directions by utilizing a part of DCT coefficients. Most of video coding standard adopt a hybrid structure of block-based motion compensation and block discrete cosine transform (BDCT). By this reason, blocking artifacts are occurred on both block boundary and block interior For more complete removal of both kinds of blocking artifacts, the restored differential image must satisfy two constraints, such as, directional discontinuities on block boundary and block interior Those constraints have been used for defining convex sets for restoring differential images.

• 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.