• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.2
• /
• pp.209-215
• /
• 2000

In this paper we present polyline upward order preserving grid drawing algorithm for binary trees with n vertices that achieves 0(n) height, 0(log n) width and 0(nlog n) area, matching the previously known results, and that reduces the number of bends to 0(n/log n) from 0(n)

• Journal of the Korean Mathematical Society
• /
• v.43 no.2
• /
• pp.425-443
• /
• 2006

The aim of this paper is to obtain several results in approximation by Jackson-type generalizations of complex Picard, Poisson-Cauchy and Gauss-Weierstrass singular integrals in terms of higher order moduli of smoothness. In addition, these generalized integrals preserve some sufficient conditions for starlikeness and univalence of analytic functions. Also approximation results for vector-valued functions defined on the unit disk are given.

• Bulletin of the Korean Mathematical Society
• /
• v.38 no.2
• /
• pp.357-367
• /
• 2001

Let $Q(\beta)$ be the class of normalized strongly quasiconvex functions of order $\beta$ in the open unit disk. Sharp Fekete-Szego inequalities are obtained for functions belonging to the class $Q(\beta)$. We also consider the integral preserving properties in a sector.

• Journal of Electrical Engineering and information Science
• /
• v.3 no.2
• /
• pp.131-138
• /
• 1998

We derive a back-propagation learning algorithm of fuzzy neural networks using fuzzy operations, which preserves the shapes of fuzzy numbers, in order to utilize fuzzy if-then rules as well as numerical data in the learning of neural networks for classification problems and for fuzzy control problems. By introducing the shape preseving fuzzy operation into a neural network, the proposed network simplifies fuzzy arithmetic operations of fuzzy numbers with exact result in learning the network. And we illustrate our approach by computer simulations on numerical examples.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.392-395
• /
• 1999

The state assignment for a finite state machine greatly affects the delay, area, and testabilities of the sequential circuits. In order to minimize the dependencies among state variables, therefore possibly to reduce the length and number of feedback cycles, a new state assignment technique based on m-block partition is introduced in this paper. After the completion of state assignment and logic synthesis, partial scan design is performed to choose minimal number of scan flip-flops. Experiment shows drastic improvement in testabilities while preserving low area and delay overhead.

• Journal of the Korean Mathematical Society
• /
• v.43 no.1
• /
• pp.159-181
• /
• 2006

The objective of this paper is to show further results concerning the problem of extending total preorders from a subset of a topological space to the entire space using the approach introduced by Gyoseob Yi.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.12 no.3
• /
• pp.232-237
• /
• 2012

We introduce the notion of (L, e)-filters with fuzzy partially order e on complete residuated lattice L. We investigate (L, e)-filters induced by the family of (L, e)-filters and functions. In fact, we study the initial and final structures for the family of (L, e)-filters and functions. From this result, we define the product and co-product for the family of (L, e)-filters and functions.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.62 no.2
• /
• pp.90-94
• /
• 2013

In this paper, we propose a new algorithm to improve the contrast ratio, to preserve information of bright regions and to maintain the color of backlight image that appears with a great relative contrast. Backlight images of the natural environment have characteristics for difference of local brightness; the overall image contrast improvement is not easy. To improve the contrast of the backlight images, MSR (Multi-Scale Retinex) algorithm using the existing multi-scale Gaussian filter is applied. However, existing multi-scale Gaussian filter involves color distortion and information loss of bright regions due to excessive contrast enhancement and noise because of the brightness improvement of dark regions. Moreover, it also increases computational complexity due to the use of multi-scale Gaussian filter. In order to solve these problems, a linear MSR is performed that reduces the amount of computation from the HSV color space preventing the color distortion and information loss due to excessive contrast enhancement. It can also remove the noise of the dark regions which is occurred due to the improved contrast through edge preserving filter. Through experimental evaluation of the average color difference comparison of CIELAB color space and the visual assessment, we have confirmed excellent performance of the proposed algorithm compared to conventional MSR algorithm.

• Journal of Astronomy and Space Sciences
• /
• v.15 no.1
• /
• pp.175-182
• /
• 1998

Any classification process using SAR images presupposes the reduction of multiplicative speckle noise, since the variations caused by speckle make it extremely difficult to distinguish between neighboring classes within the feature space. Therefore, several adaptive filter algorithms have been developed in order to distinguish between them. These algorithms aim at the preservation of edges and single scattering peaks, and smooths homogeneous areas as much as possible. This task is rendered more difficult by the multiplicative nature of the speckle noise the signal variation depends on the signal itself. In this paper, LEE(Lee 1908) and R-LEE(Lee 1981) filters using local statistics, local mean and variance, are applied to RADARSAT SAR images. Also, a new method of speckle filtering, EPOS(Edge Preserving Optimal Speckle)(Hagg & Sties 1994) filter based on the statistical properties of speckle noise is described and applied. And then, the results of filtering SAR images with LEE, R-LEE and EPOS filters are compared with mean and median filters.

• Journal of Korea Multimedia Society
• /
• v.7 no.3
• /
• pp.319-326
• /
• 2004

In this paper, we propose color image segmentation by region merging method preserving the boundary of an object. The proposed method selects initial region by using quantized image's index map after vector quantizing an original image. After then, we merge regions by applying boundary restricted factor in order to consider the boundary of an object in HSI color space. Also we merge the regions in RGB color space for non-processed regions in HSI color space. And we reduce processing time by decreasing iterative process in region merging algorithm. Experimental results have demonstrated the superiority in region's segmentation results and processing time for various images.