• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.4
• /
• pp.753-758
• /
• 2017

The ray-shooting problem is to find the first intersection point on the surface of given geometric objects where a ray moving along a straight line hits. Since rays are usually given in the form of queries, this problem is typically solved as follows. First, a data structure for a collection of objects is constructed as preprocessing. Then, the answer for each query ray is quickly computed using the data structure. In this paper, we consider the ray-shooting problem about the set of vertical line segments on the x-axis. We present a new data structure called a convex layer tree for n vertical line segments given by input. This is a tree structure consisting of layers of convex hulls of vertical line segments. It can be constructed in O(n log n) time and O(n) space and is easy to implement. We also present an algorithm to solve each query in O(log n) time using this data structure.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.8
• /
• pp.45-54
• /
• 2014

In this paper, we proposed an effective quality improvement scheme of magnified image using the surface characteristics in image. If the surface in image is estimated as simple convex surface or simple concave surface, the interpolated value can be calculated to have the surface characteristics by using the other method in the proposed scheme. The calculated value becomes the interpolated pixel value inmagnified image. So, themagnified image reflects the surface characteristics of the real image. If the surface is not estimated as simple convex surface or simple concave surface, the interpolated value is calculated more accurately than bilinear interpolation by using the method of the proposed scheme. The PSNR values of the magnified images using the proposed schemes are greater than those of the magnified images using the previous interpolation schemes.

• The KIPS Transactions:PartA
• /
• v.13A no.5 s.102
• /
• pp.429-434
• /
• 2006

A CCTV system reduces some number of cameras if we use convex-mirror. In this case, convex-mirror Image distorted, we need transformation to flat images. In the center of mirror images, a transformed image has no distortion, but at near boundary image has plentiful distortion. This distortion is caused by occlusion of angled ray and diffraction. We know that the linear filtering approach cannot separate noise from signal where their Fourier spectra overlap. But using a non-linear discretization method, we shall reduce blurred noise. In this paper, we introduce the backward solution of nonlinear wave equation for reducing blurred noise and biased expansion of equilibrium contour. We propose, after applying the introduced method, and calculate with discretization method. To analysis the experimental result, we investigate to PSNR and get about 4dB better than current method.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.6
• /
• pp.51-58
• /
• 2012

Scirtothrips Dorsalis (Thysanoptera: Thripidae) recently has been recognized as a major source of the pest damage in the citrus fruit orchards. So its arrival has been predicted periodically but it is difficult to identify adults of the pest with the naked eyes because of their size smaller than the 0.8mm. In this paper, we propose a method to detect candidate areas for automatic identification of Scirtothrips Dorsalis on forecasting traps. The proposed method uses a histogram-based template matching where the composite image synthesized with the gray-scale image and the gradient image is used. In our experiments, images are acquired by the optical microscopy with 50 magnifications. To show the usefulness of the proposed method, it is compared with the method we previously suggested. Also, the performances when the proposed method is applied to noise-reduced images and gradient images are examined. The experimental results show that the proposed method is approximately 14.42% better than our previous method, 41.63% higher than the case that the noise-reduced image is used, and 21.17% higher than the case that the gradient image is used.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.6
• /
• pp.257-266
• /
• 2015

There is no polynomial-time algorithm that can be obtain the optimal solution for economic load dispatch problem with non-convex fuel cost functions. Therefore, electrical field uses quadratic fuel cost function unavoidably. This paper proposes a valve-point optimization (VPO) algorithm for economic load dispatch problem with non-convex fuel cost functions. This algorithm sets the initial values to maximum powers $P_i{\leftarrow}P_i^{max}$ for each generator. It then reduces the generation power of generator i with an average power cost of $_{max}\bar{c}_i$ to a valve point power $P_{ik}$. The proposed algorithm has been found to perform better than the extant heuristic methods when applied to 13 and 40-generator benchmark data. This paper consequently proves that the optimal solution to economic load dispatch problem with non-convex fuel cost functions converges to the valve-point power of each generator.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.1
• /
• pp.46-51
• /
• 2004

his paper presents a novel design technique for the TS fuzzy classifier via linear matrix inequalities(LMI). To design the TS fuzzy classifier built by the TS fuzzy model, the consequent parameters are determined to maximize the classifier's performance. Differ from the conventional fuzzy classifier design techniques, convex optimization technique is used to resolve the determination problem. Consequent parameter identification problems are first reformulated to the convex optimization problem. The convex optimization problem is then efficiently solved by converting linear matrix inequality problems. The TS fuzzy classifier has the optimal consequent parameter via the proposed design procedure in sense of the minimum classification error. Simulations are given to evaluate the proposed fuzzy classifier; Iris data classification and Wisconsin Breast Cancer Database data classification. Finally, simulation results show the utility of the integrated linear matrix inequalities approach to design of the TS fuzzy classifier.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.11
• /
• pp.59-68
• /
• 2013

In this paper, an effective scheme was proposed to estimate simple convex surface and simple concave surface which exist in image. This scheme is applied to input image to estimate simple convex surface or simple concave surface. When simple convex surface or simple concave surface exists, another proposed efficient interpolation scheme is used for the interpolated pixel to have the characteristics of simple convex surface or simple concave surface. The magnified image using the proposed schemes is more similar to the real image than the magnified image using the previous schemes. The PSNR values of the magnified images using the proposed schemes are greater than those of the magnified images using the previous interpolation schemes.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1302-1311
• /
• 2003

This paper presents a more stable method of multiresolution editing for a triangular mesh. The basic idea of our paper is to embed an editing area of a mesh onto a 2D region and to produce 3D surfaces which interpolate the editing-information. In this paper, we adopt the extended convex combination approach based on the shape-preserving parameterization for the embedding, which guarantees no self-intersection on the 2D embedded mesh. That is, the result of the embedding is stable. Moreover, we adopt the multi-level B-spline approach to generate the surface containing all of 3D editing-information, which can make us control the editing area in several levels. Hence, this method supports interactive editing and thus can produce intuitive editing results.

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

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.7
• /
• pp.913-918
• /
• 2007

Human motion analysis is an important research subject in human-robot interaction (HRI). However, before analyzing the human motion, silhouette of human body should be extracted from sequential images obtained by CCD camera. The intelligent robot system requires more robust silhouette extraction method because it has internal vibration and low resolution. In this paper, we discuss the hybrid silhouette extraction method for detecting and tracking the human motion. The proposed method is to combine and optimize the temporal and spatial gradient information. Also, we propose some compensation methods so as not to miss silhouette information due to poor images. Finally, we have shown the effectiveness and feasibility of the proposed method through some experiments.