• Bulletin of the Korean Mathematical Society
• /
• v.52 no.5
• /
• pp.1423-1431
• /
• 2015

A clique-transversal set D of a graph G is a set of vertices of G such that D meets all cliques of G. The clique-transversal number is the minimum cardinality of a clique-transversal set in G. For every cubic graph with at most two bridges, we first show that it has a perfect matching which contains exactly one edge of each triangle of it; by the result, we determine the exact value of the clique-transversal number of line graph of it. Also, we present a sharp upper bound on the clique-transversal number of line graph of a cubic graph. Furthermore, we prove that the clique-transversal number of line graph of a triangle-free graph is at most the chromatic number of complement of the triangle-free graph.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.11
• /
• pp.879-885
• /
• 1990

An intergral equation is derived for surface current distribution of cylinders with end cap using quasistatic approximation method. The moment method is applied for numerical solution. Point matching method using Cubic B-spline function as a basis function, delta function as a weighting function is applied for moment method. And also, the influencial relation in accordance with structural variation is analized in case of spheroidal end up cap type and flat type.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.4
• /
• pp.241-250
• /
• 1986

Current distributions are the basis of analyzing and designing the antenna. In this paper, a method of deriving the current distribution of a spiral shaped thin wire scattere is proposed when plane wave is incident on it. The calculated results are also shown for severla spiral sizes and incidence angles selected. For numerical calculation, the method of point matching is used with a cubic B-spline function as a basis function.

• Journal of the Semiconductor & Display Technology
• /
• v.15 no.4
• /
• pp.103-106
• /
• 2016

3D technology is main factor in Augmented Reality. Depth map is essential to make cubic effect using 2d image. There are a lot of ways to construct Depth map. Among them, stereo matching is mainly used. This paper presents how to generate depth map using stereo matching. For stereo matching, existing Dynamic programming method is used. To make accurate stereo matching, High-Boost Filter is applied to preprocessing method. As a result, when depth map is generated, accuracy based on Ground Truth soared.

• Journal of Biomedical Engineering Research
• /
• v.29 no.6
• /
• pp.431-435
• /
• 2008

Quantitative information of a three dimensional(3D) kinematics of joint is very useful in knee joint surgery, understanding how knee kinematics related to joint injury, impairment, surgical treatment, and rehabilitation. In this paper, an automated 2D/3D image matching technique was developed to estimate the 3D in vivo knee kinematics using dual X-ray images. First, a 3D geometric model of the knee was reconstructed from CT scan data. The 3D in vivo position and orientation of femoral and tibial components of the knee joint could be estimated by minimizing the pixel by pixel difference between the projection images from the developed 3D model and the given X-ray images. The accuracy of the developed technique was validated by an experiment with a cubic phantom. The present 2D/3D image matching technique for the estimation of in vivo joint kinematics could be useful for pre-operative planning as well as post-operative evaluation of knee surgery.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.2
• /
• pp.676-687
• /
• 2015

Path planning algorithms are used to allow mobile robots to avoid obstacles and find ways from a start point to a target point. The general path planning algorithm focused on constructing of collision free path. However, a high continuous path can make smooth and efficiently movements. To improve the continuity of the path, the searched waypoints are connected by the proposed polynomial interpolation. The existing polynomial interpolation methods connect two points. In this paper, point groups are created with three points. The point groups have each polynomial. Polynomials are made by matching the differential values and simple matrix calculation. Membership functions are used to distribute the weight of each polynomial at overlapped sections. As a result, the path has $G^2$ continuity. In addition, the proposed method can analyze path numerically to obtain curvature and heading angle. Moreover, it does not require complex calculation and databases to save the created path.

• Journal of Mechanical Science and Technology
• /
• v.14 no.5
• /
• pp.518-529
• /
• 2000

A detailed and thorough parametric study of digital image correlation method is presented. A theoretical background and development of the method were introduced and the effects of various parameters on the determination of displacement outputs from the raw original and deformed image information were examined. Use of the normalized correlation coefficient, the use of 20 to 40 pixels for a searching window side, 6 variables searching, bi-cubic spline sub pixel interpolations and the use of coarse-fine search are some of the key choices among the results of parametric studies. The displacement outputs can be further processed with two dimensional curve fitting for the data noise reduction as well as displacement gradient calculation.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.5
• /
• pp.83-86
• /
• 1985

An alternative technique (or the numerical solution of Fredholm integral equations of second kind is presented. The approximate solution is obtained by fitting the data in mixed form at knots in the region of the problem. To decrease the error in the numerical solution, cubic B-spline functions which are twice continuously differentiable at knots are employed as basis function. For a given example, the results of this technique are compared with those of Moment method employing pulse functions for basis function and delta functions for test function and found to br in good agreement.

• Journal of International Society for Simulation Surgery
• /
• v.2 no.1
• /
• pp.26-32
• /
• 2015

Purpose When a surgeon examines the morphology of skull of patient, locations of craniometric landmarks of 3D computed tomography(CT) volume are one of the most important information for surgical purpose. The locations of craniometric landmarks can be found manually by surgeon from the 3D rendered volume or 2D sagittal, axial, and coronal slices which are taken by CT. Since there are many landmarks on the skull, finding these manually is time-consuming, exhaustive, and occasionally inexact. These inefficiencies raise a demand for a automatic localization technique for craniometric landmark points. So in this paper, we propose a novel method through which we can automatically find these landmark points, which are useful for surgical purpose. Materials and Methods At first, we align the experimental data (CT volumes) using Frankfurt Horizontal Plane (FHP) and Mid Sagittal Plane(MSP) which are defined by 3 and 2 cranial landmark points each. The target landmark of our experiment is the anterior nasal spine. Prior to constructing a statistical cubic model which would be used for detecting the location of the landmark from a given CT volume, reference points for the anterior nasal spine were manually chosen by a surgeon from several CT volume sets. The statistical cubic model is constructed by calculating weighted intensity means of these CT sets around the reference points. By finding the location where similarity function (squared difference function) has the minimal value with this model, the location of the landmark can be found from any given CT volume. Results In this paper, we used 5 CT volumes to construct the statistical cubic model. The 20 CT volumes including the volumes, which were used to construct the model, were used for testing. The range of age of subjects is up to 2 years (24 months) old. The found points of each data are almost close to the reference point which were manually chosen by surgeon. Also it has been seen that the similarity function always has the global minimum at the detection point. Conclusion Through the experiment, we have seen the proposed method shows the outstanding performance in searching the landmark point. This algorithm would make surgeons efficiently work with morphological informations of skull. We also expect the potential of our algorithm for searching the anatomic landmarks not only cranial landmarks.

• Journal of the Korea Fashion and Costume Design Association
• /
• v.10 no.3
• /
• pp.61-71
• /
• 2008

Knit wear with comfortable feeling of wearing and various coordinations gives new values to the modern people, who seek activities and individualities, and the demand for knit wear is on the rise. This article aims to analyze the aesthetic characteristics of Korean knit fashion. Fashion photographs from leading monthly fashion magazines in Korea from 2005 to 2007 had been analyzed. The knitting techniques, and designing characteristics and aesthetic values of Korean knit fashion had been studied. The major conclusions of the study are the following: 1. Korean knit fashion applies various knitting techniques. The knitting techniques used in Korean knit fashion are hand-knitting technique, crochet techniques, lace techniques, plain stitch, rib stitch, and purl stitch technique. 2. Decorations by trimming and matching with different textile materials are used more frequently than decorations by knit material itself. Decorating methods include fringes, spangle, beads, Rhine stone, motif and embroidery decorating. Matching with different textile materials made contrasting decoration effect. 3. Patterms by knitting structure and by arranging colors are applied. Cubic effect by knitting structure patterns, and geometric patterns by arranging colors are emphasized. 4. The formative feature beauties are natural beauty, feminine beauty, and decorative beauty. Korean knit fashion has developed creative and decorative designs through various knitting techniques and decorating techniques. As individual activities may be increased in the future, the designs and applications of knit fashion may be diversified.