• International Journal of CAD/CAM
• /
• v.8 no.1
• /
• pp.21-28
• /
• 2009

In the present work, an attempt has been made to construct branching surface from 2-D contours, which are given at different layers and may have branches. If a layer having more than one contour and corresponds to contour at adjacent layers, then it is termed as branching problem and approximated by adding additional points in between the layers. Firstly, the branching problem is converted to single contour case in which there is no branching at any layer and the final branching surface is obtained by skinning. Contours are constructed from the given input points at different layers by energy-based B-Spline approximation. 3-D curves are constructed after adding additional points into the contour points for all the layers having branching problem by using energy-based B-Spline formulation. Final 3-D surface is obtained by skinning 3-D curves and 2-D contours. There are three types of branching problems: (a) One-to-one, (b) One-to-many and (c) Many-to-many. Oneto-one problem has been done by plethora of researchers based on minimizations of twist and curvature and different tiling techniques. One-to-many problem is the one in which at least one plane must have more than one contour and have correspondence with the contour at adjacent layers. Many-to-many problem is stated as m contours at i-th layer and n contours at (i+1)th layer. This problem can be solved by combining one-to-many branching methodology. Branching problem is very important in CAD, medical imaging and geographical information system(GIS).

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.11
• /
• pp.629-654
• /
• 2003

A new multiresolutional scheme that reconstructs a polygonal mesh from the set of contours is presented. In the first step, we apply a radial gradient method to extract the contours on the sampled slices from a volume data. After classifying the types of the edges on the contours, we represent the contour using the context-free grammar. The polygons between two neighboring contours are generated through the traversal of the derivation trees of the context-free grammar. The polygonal surface of the coarsest resolution is refined through the refinement of the contours, which is executed by casting more rays on the slices. The topologies between the polygonal surfaces of various resolutions are maintained from the fact that the radial gradient method preserves the topologies of the contours of various resolutions. The proposed scheme provides efficient computation and compression methods for the tiling procedure with the feature preservation.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.11a
• /
• pp.407-413
• /
• 2003

To connect the gap on the contours at the summit area, we propose the linear interpolation in the polar coordinates. The results of appling both existing algorithms and proposed method to some graphic images, the proposed interpolation method was superior. Also by generating a new curve having similar appearance of neighboring contours, the connected contours were reconstructed naturally.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2002.08a
• /
• pp.617-620
• /
• 2002

Quantitative analysis of dynamic false contours on PDP is essential to evaluate the performance of algorithms for false contour reduction. It also serves as an optimization criterion for selecting the subfield pattern. In this paper, a color difference in uniform color space is defined as a new measure for dynamic false contours. Unlike the measures in previous works, it accounts for the channel dependencies among the RGB color channels.

• Proceedings of the KOSOMBE Conference
• /
• v.1994 no.05
• /
• pp.27-31
• /
• 1994

Intravascular ultrasound images of coranary artery contain very important informations on heart disease. The intimal contours on the image show informations and data to examine intravascular problems of patients. A new computation algorithm to detect the intimal and adventitial contours from the intravascular images was developed. An Image processing on gray level image was used. It uses arrays of pixels in each radial lines on the images. A "Robert" filter was adopted at first step for one dimensional image processing. Some other calculation techniques were developed to inclose the accuracy of automatically detected contours. The standard contour data to compare with automatically detected contour data were obtained through manually tracing by experienced cardiological medical doctors. The result of the new algorithm shows high accuracy of 80 % matching with the standard contour data.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.23-26
• /
• 2003

In this work. we propose an algorithm for detecting and compensating dynamic false contours in plasma display panels (PDPs). First, we detect the candidate pixels, which are likely to be corrupted by false contours, and merge those pixels into several regions. Second, we estimate the motion vectors of the selected regions. Finally, based on the motion information. we modify the luminance values of the pixels in the regions to alleviate the effects of false contours. Simulation results demonstrate that the proposed algorithm efficiently reduces dynamic false contours at low computational complexity.

• Journal of Korea Society of Industrial Information Systems
• /
• v.5 no.4
• /
• pp.60-66
• /
• 2000

This paper presents a contour connection scheme in a scanned contour image including broken lines for the developing of the automated contour vecterizing system. In the proposed scheme, the thinning of contours is performed, and then broken lines are connected Contours have end points if there exist broken lines. Each pair of end points is connected repeatedly according to their status to be one connected component per contour. The proposed scheme can be applied to develope an efficient automated contour vectorizing system.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.3
• /
• pp.30-39
• /
• 2010

This paper considers a problem of optimizing torch paths to cut stock plates nested with open contours. For each contour, one of the two ending points is to be selected as a starting point of cutting with the other being the exit point. A torch path is composed of a single depot and a series of starting and ending points of contours to be cut. The torch path optimization problem is shown to be formulated as an extended version of the standard travelling salesman problem. To solve the problem, a hybrid genetic algorithm with the local search of torch paths is proposed. The genetic algorithm is tested for hypothetical problems whose optimal solutions are known in advance due to the special structure of them. The computational results show that the algorithm generates very near optimal solutions for most cases of the test problems, which verifies the validity of the algorithms.

• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.4
• /
• pp.174-182
• /
• 2003

Recently, medical imaging has taken interest on CAD based solution for anatomical part fabrication or finite element analysis of human body. In principle, contours representing object boundary are obtained through image processing techniques. Surface models are then approximated by a skinning method. For this, various methods should be applied to medical images and contours. The major bottleneck of the reconstruction is to remove shape inconsistency between contours and to generate the branching surface. In order to solve these problems, bi-directional smoothing and the composite contour generation method are proposed. Bi-directional smoothing has advantage of removing the shape inconsistency between contours and minimizing shrinkage effect with a large number of iterations. The composite contour by the proposed method ensures smooth transition in branching region.

• Speech Sciences
• /
• v.1
• /
• pp.27-38
• /
• 1997

The differences in French Intonation between French and Korean learners can be applied to French intonation education. One native French speaker and three native Korean speakers who learned French language at High school were selected for this study. The subjects spoke test phrases based on the different syntactic structures. High-Speed speech Analysis system(RILP) was used for this experiment. The different intonation curves were showed at the end of phrase and at the beginning of phrase between French and Korean learners. At the end of phrases, French intonation appeared to have increasing and decending pitch contours in the case of wh-question, exclamation and finality. However, Korean learner's intonation showed only increasing pitch contours. At the beginning of phrase, French intonation shows decending pitch contours in the case of minor continuation and command. In contrast, Korean learner's intonation appeared to have increasing pitch contours. The new intonation training system using PC can have great effect on education of French as a second language.