• The KIPS Transactions:PartA
• /
• v.12A no.1 s.91
• /
• pp.13-22
• /
• 2005

Similarly to the edges defined in a 2D image, we can define the geometric features representing the boundary of the distinctive parts appearing on 3D meshes. The geometric features have been used as basic primitives in several applications such as mesh simplification, mesh deformation, and mesh editing. In this paper, we propose geometric livewire and geometric livelane for extracting geometric features in a 3D mesh, which are the extentions of livewire and livelane methods in images. In these methods, approximate curvatures are adopted to represent the geometric features in a 3D mesh and the 3D mesh itself is represented as a weighted directed graph in which cost functions are defined for the weights of edges. Using a well-known shortest path finding algorithm in the weighted directed graph, we extracted geometric features in the 3D mesh among points selected by a user. In this paper, we also visualize the results obtained from applying the techniques to extracting geometric features in the general meshes modeled after human faces, cows, shoes, and single teeth.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.5
• /
• pp.87-96
• /
• 2005

In this paper, a mesh simplification algorithm using face constriction is proposed which considers the conservation of the volume of a 3D model. The face constriction method replaces three vertices of the candidate triangle with a new vertex, removing four faces at once. We propose a modified method, compensating an existing method, of considering curvature in the decision of the removing order of triangles. We also propose a method of determining a new vertex replacing the candidate triangle, which reflects curvature difference of the three surrounding areas of the three vertices of the triangle, while conserving the volume. It is shown by simulation that the proposed method conserves the volume and shows good constriction performance comparable to the other methods.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.2
• /
• pp.57-62
• /
• 1999

Estimation of the point spread function (PSF) is one of the main research topic of image processing, because it determines the performance of the auto-focusing system. In this paper, a new algorithm for PSF estimation is proposed, and its application to image restoration is also presented. The procedure for complete realization of the auto-focusing system consists of two steps: PSF estimation based on edge classification, and image restoration using the estimated PSF. More specifically, we divide imput image into multiple small image or block, estimate unit step response and average them on the blocks which contain edge, and estimate 2-dimensional isotropic PSF from the 1 dimensional step response. Finally we obtain in-focused image by using image restoration based on the estimated PSF.

• Journal of the Korea Society for Simulation
• /
• v.16 no.1
• /
• pp.21-29
• /
• 2007

In this paper, we present a method of detecting the boundary of the intima-media complex for automated measurement based on dynamic programming from carotid artery B-mode ultrasound images and then show the experimental results. We apply the dynamic programming for determining the optimal locations that a cost function is minimized. The cost function includes cost terms which are representing image features such as intensity, intensity gradient and geometrical continuity of the vessel interfaces. Moreover, we improve the boundary continuity by applying the B-spline to smooth the rough boundary due to noise such as speckle, dropout and weak edges. The proposed method has obtained more accurate reproducible results than conventional edge-detection by considering multiple image features and ensures efficient automated measurement by solving the problems of the inter- and intra-observer variability and its inefficiency due to manual measurement.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.4
• /
• pp.793-799
• /
• 2007

Generally, a semiconductor chip measured with a few micro units is captured by line scan camera for higher inspection accuracy. However, the faulty inspection requires an exact boundary detection algorithm, because it is very sensitive to scan speed and lighting conditions. In this paper we propose boundary detection with subpixel edge detection in order to increase the accuracy of bump faulty detection on chips. The bump edge is detected by first derivative to four directions from bump center point and the exact edge positions are searched by the subpixel method. Also, the exact bump boundary to calculate the actual bump size is computed by LSM(Least Squares Method) to minimize errors since the bump size is varied such as bump protrusion, bump bridge, and bump discoloration. Experimental results exhibit that the proposed algorithm shows large improvement comparable to the other conventional boundary detection algorithms.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.12
• /
• pp.109-120
• /
• 1998

An image segmentation approach based on the fuzzy worm searching and MIN-MAX clustering algorithm is proposed in this paper. This algorithm deals with fuzzy worm value and min-max node at a gross scene level, which investigates the edge information including fuzzy worm action and spatial relationship of the pixels as the parameters of its objective function. But the conventional segmentation methods for edge extraction generally need the mask information for the algebraic model, and take long run times at mask operation, whereas the proposed algorithm has single operation according to active searching of fuzzy worms. In addition, we also propose both genetic fuzzy worm searching and genetic min-max clustering using genetic algorithm to complete clustering and fuzzy searching on grey-histogram of image for the optimum solution, which can automatically determine the size of ranges and has both strong robust and speedy calculation. The simulation results showed that the proposed algorithm adaptively divided the quantized images in histogram region and performed single searching methods, significantly alleviating the increase of the computational load and the memory requirements.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.11
• /
• pp.64-74
• /
• 1999

A new clock skew optimization for clock routing using link-edge insertion is proposed in this paper. It satisfies the given skew bound and prevent the total wire length from increasing. As the clock skew is the major constraint for high speed synchronous ICs, it must be minimized in order to obtain high performance. But clock skew minimization can increase total wire length, therefore clock routing is performed within the given skew bound which can not induce the malfunction. Clock routing under the specified skew bound can decrease total wire length Not only total wire length and delay time minimization algorithm using merging point relocation method but also clock skew reduction algorithm using link-edge insertion technique between two nodes whose delay difference is large is proposed. The proposed algorithm construct a new clock routing topology which is generalized graph model while previous methods uses only tree-structured routing topology. A new cost function is designed in order to select two nodes which constitute link-edge. Using this cost function, delay difference or clock skew is reduced by connecting two nodes whose delay difference is large and distance difference is short. Furthermore, routing topology construction and wire sizing algorithm is developed to reduce clock delay. The proposed algorithm is implemented in C programming language. From the experimental results, we can get the delay reduction under the given skew bound.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.2
• /
• pp.84-91
• /
• 2009

This paper presents an online partial 3D modeling methodology that uses a mobile augmented reality system and aerial photographs, and a tracking methodology that compares the 3D model with a video image. Instead of relying on models which are created in advance, the system generates a 3D model for a real building on the fly by combining frontal and aerial views. A user's initial pose is estimated using an aerial photograph, which is retrieved from a database according to the user's GPS coordinates, and an inertial sensor which measures pitch. We detect edges of the rooftop based on Graph cut, and find edges and a corner of the bottom by minimizing the proposed cost function. To track the user's position and orientation in real-time, feature-based tracking is carried out based on salient points on the edges and the sides of a building the user is keeping in view. We implemented camera pose estimators using both a least squares estimator and an unscented Kalman filter (UKF). We evaluated the speed and accuracy of both approaches, and we demonstrated the usefulness of our computations as important building blocks for an Anywhere Augmentation scenario.

• Journal of Digital Convergence
• /
• v.20 no.3
• /
• pp.325-331
• /
• 2022

As IoT devices are used in various ways in an edge network environment, multiple studies are being conducted that utilizes the information collected from IoT devices in various applications. However, it is not easy to apply accurate IoT data immediately as IoT data collected according to network environment (interference, interference, etc.) are frequently missed or error occurs. In order to minimize mistakes in IoT data collected in an edge network environment, this paper proposes a management technique that ensures the reliability of IoT data by randomly generating signature values of IoT data and allocating only Security Information (SI) values to IoT data in bit form. The proposed technique binds IoT data into a blockchain by applying multiple hash chains to asymmetrically link and process data collected from IoT devices. In this case, the blockchainized IoT data uses a probability function to which a weight is applied according to a correlation index based on deep learning. In addition, the proposed technique can expand and operate grouped IoT data into an n-layer structure to lower the integrity and processing cost of IoT data.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.2
• /
• pp.110-125
• /
• 2010

We present a novel scheme for generating line drawings from 2D images, aiming to facilitate effective visual communication. In contrast to conventional edge detectors, our technique imitates the human line drawing process to generate lines effectively and intuitively. Our technique consists of three parts: line extraction, line rendering, and user guidance. In line extraction, we extract lines by estimating a likelihood function to effectively find the genuine shape boundaries. In line rendering, we consider the feature scale and the blurriness of lines with which the detail and the focus-level of lines are controlled. We also employ stroke textures to provide a variety of illustration styles. User guidance is allowed to modify the shapes and positions of lines interactively, where immediate response is provided by GPU implementation of most line extraction operations. Experimental results demonstrate that our technique generates various kinds of line drawings from 2D images enabled by the control over detail, focus, and style.