• Title/Summary/Keyword: B-spline Fitting

Search Result 42, Processing Time 0.027 seconds

3-Dimensional Free Form Design Using an ASMOD (ASMOD를 이용한 3차원 자유 형상 설계)

  • 김현철;김수영;이창호
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.8 no.5
    • /
    • pp.45-50
    • /
    • 1998
  • This paper presents the process generating the 3-dimensional free f o r m hull form by using an ASMOD(Adaptive Spline Modeling of Observation Data) and a hybrid curve approximation. For example, we apply an ASMOD to the generation of a SAC(Sectiona1 Area Curve) in an initial hull form design. That is, we define SACS of real ships as B-spline curves by a hybrid curve approximation (which is the combination method of a B-spline fitting method and a genetic algorithm) and accumulate a database of control points. Then we let ASMOD learn from the correlation of principal dimensions with control points and make the ASMOD model for SAC generation. Identically, we apply an ASMOD to the generation of other hull form characteristic curves - design waterline curve, bottom tangent line, center profile line. Conclus~onally we can generate a design hull form from these hull form characteristic curves.

  • PDF

On B-spline Approximation for Representing Scattered Multivariate Data (비정렬 다변수 데이터의 B-스플라인 근사화 기법)

  • Park, Sang-Kun
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.35 no.8
    • /
    • pp.921-931
    • /
    • 2011
  • This paper presents a data-fitting technique in which a B-spline hypervolume is used to approximate a given data set of scattered data samples. We describe the implementation of the data structure of a B-spline hypervolume, and we measure its memory size to show that the representation is compact. The proposed technique includes two algorithms. One is for the determination of the knot vectors of a B-spline hypervolume. The other is for the control points, which are determined by solving a linear least-squares minimization problem where the solution is independent of the data-set complexity. The proposed approach is demonstrated with various data-set configurations to reveal its performance in terms of approximation accuracy, memory use, and running time. In addition, we compare our approach with existing methods and present unconstrained optimization examples to show the potential for various applications.

Trivariate B-spline Approximation of Spherical Solid Objects

  • Kim, Junho;Yoon, Seung-Hyun;Lee, Yunjin
    • Journal of Information Processing Systems
    • /
    • v.10 no.1
    • /
    • pp.23-35
    • /
    • 2014
  • Recently, novel application areas in digital geometry processing, such as simulation, dynamics, and medical surgery simulations, have necessitated the representation of not only the surface data but also the interior volume data of a given 3D object. In this paper, we present an efficient framework for the shape approximations of spherical solid objects based on trivariate B-splines. To do this, we first constructed a smooth correspondence between a given object and a unit solid cube by computing their harmonic mapping. We set the unit solid cube as a rectilinear parametric domain for trivariate B-splines and utilized the mapping to approximate the given object with B-splines in a coarse-to-fine manner. Specifically, our framework provides user-controllability of shape approximations, based on the control of the boundary condition of the harmonic parameterization and the level of B-spline fitting. Experimental results showed that our method is efficient enough to compute trivariate B-splines for several models, each of whose topology is identical to a solid sphere.

Difference Edge Acquisition for B-spline Active Contour-Based Face Detection (B-스플라인 능동적 윤곽 기반 얼굴 검출을 위한 차 에지 영상 획득)

  • Kim, Ga-Hyun;Jung, Ho-Gi;Suhr, Jae-Kyu;Kim, Jai-Hie
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.6
    • /
    • pp.19-27
    • /
    • 2010
  • This paper proposes a method for enhancing detection performance and reducing computational cost when detecting a human face by applying B-spline active contour to the frame difference of consecutive images. Firstly, the method estimates amount of user's motion using kurtosis. If the kurtosis is smaller than a pre-defined threshold, it is considered that the amount of user's motion is insufficient and thus the contour fitting is not applied. Otherwise, the contour fitting is applied by exploiting the fact that the amount of motion is sufficient. Secondly, for the contour fitting, difference edges are detected by combining the distance transformation of the binarized frame difference and the edges of current frame. Lastly, the face is located by assigning the contour fitting process to the detected difference edges. Kurtosis-based motion amount estimation can reduce a computational cost and stabilize the results of the contour fitting. In addition, distance transformation-based difference edge detection can enhance the problems of contour lag and discontinuous difference edges. Experimental results confirm that the proposed method can reduce the face localization error caused by the contour lag and discontinuity of edges, and decrease the computational cost by omitting approximately 39% of the contour fitting.

Data-Driven Kinematic Control for Robotic Spatial Augmented Reality System with Loose Kinematic Specifications

  • Lee, Ahyun;Lee, Joo-Haeng;Kim, Jaehong
    • ETRI Journal
    • /
    • v.38 no.2
    • /
    • pp.337-346
    • /
    • 2016
  • We propose a data-driven kinematic control method for a robotic spatial augmented reality (RSAR) system. We assume a scenario where a robotic device and a projector-camera unit (PCU) are assembled in an ad hoc manner with loose kinematic specifications, which hinders the application of a conventional kinematic control method based on the exact link and joint specifications. In the proposed method, the kinematic relation between a PCU and joints is represented as a set of B-spline surfaces based on sample data rather than analytic or differential equations. The sampling process, which automatically records the values of joint angles and the corresponding external parameters of a PCU, is performed as an off-line process when an RSAR system is installed. In an on-line process, an external parameter of a PCU at a certain joint configuration, which is directly readable from motors, can be computed by evaluating the pre-built B-spline surfaces. We provide details of the proposed method and validate the model through a comparison with an analytic RSAR model with synthetic noises to simulate assembly errors.

Surface Reconstruction from Oriented Point Cloud Using a Box-Spline on the BCC Lattice (BCC 격자의 박스-스플라인을 이용한 입체 표면 복구 기법)

  • Kim, Hyunjun;Kim, Minho
    • Journal of the Korea Computer Graphics Society
    • /
    • v.21 no.2
    • /
    • pp.1-10
    • /
    • 2015
  • In this paper, we propose an improved surface reconstruction method from an oriented point cloud. Our method is a classical least-square scheme, but is based on the 7-direction box-spline and the BCC (Body-Centered Cubic) lattice, which results in surfaces with superior quality and lower computational overhead, compared to other methods based on the B-splines on the Cartesian lattice. Specifically, when compared with two of the most popular techniques our method results in better surfaces but only takes ${\approx}53%$ computation time.

Curve Reconstruction from Oriented Points Using Hierarchical ZP-Splines (계층적 ZP-스플라인을 이용한 곡선 복구 기법)

  • Kim, Hyunjun;Kim, Minho
    • Journal of the Korea Computer Graphics Society
    • /
    • v.22 no.5
    • /
    • pp.1-16
    • /
    • 2016
  • In this paper, we propose and efficient curve reconstruction method based on the classical least-square fitting scheme. Specifically, given planar sample points equipped with normals, we reconstruct the objective curve as the zero set of a hierarchical implicit ZP(Zwart-Powell)-spline that can recover large holes of dataset without loosing the fine details. As regularizers, we adopted two: a Tikhonov regularizer to reduce the singularity of the linear system and a discrete Laplacian operator to smooth out the isocurves. Benchmark tests with quantitative measurements are done and our method shows much better quality than polynomial methods. Compared with the hierarchical bi-quadratic spline for datasets with holes, our method results in compatible quality but with less than 90% computational overhead.

A Study on the Sweep Surface Modeling for Reverse Engineering (역공학을 위한 Sweep 곡면 모델링에 관한 연구)

  • 임금주;이희관;양균의
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2001.04a
    • /
    • pp.426-429
    • /
    • 2001
  • Many various products are manufactured which have sculptured surfaces recently. Constructing surface of these models is required technique called reverse engineering. In reverse engineering, a product which has sculptured surfaces is measured and we create surface model to acquire complete model data of object. Measured point data needs preprocess and sampling. Next a set of point data in a plane fit section curve. At last, surface is generated by fitting to section curves. Here we uses sweep surface. Sweep surface is compatible fitting CAD model to drawing. This paper discusses converting approximation of NURBS surface as a standard surface.

  • PDF

A Study on Reverse Design of Cam Mechanism using NURBS (NURBS를 이용한 캠 기구의 역설계에 관한 연구)

  • 김상진;신중호;김대원;윤호업
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2002.10a
    • /
    • pp.920-924
    • /
    • 2002
  • This paper presents the reverse design of a cam mechanism using NURBS(Nonuniform Rational B-spline curve). Cam is very difficult to make the accurate shape on the design and the manufacture. Because the cam shape is commonly made in order to move in special functions. The reverse design can be used to check accuracy between the designed data and the manufactured data of the cam shape and also reproduce the cam without the design data. The reverse design procedures consist of motion analysis and curve fitting. The motion analysis is used the central difference method and the relative velocity method to find the displacement and velocity. The curve fitting is used NURBS to develope the whole curve. The central difference method is derived in the 3 dimensional space.

  • PDF

Efficient point cloud data processing in shipbuilding: Reformative component extraction method and registration method

  • Sun, Jingyu;Hiekata, Kazuo;Yamato, Hiroyuki;Nakagaki, Norito;Sugawara, Akiyoshi
    • Journal of Computational Design and Engineering
    • /
    • v.1 no.3
    • /
    • pp.202-212
    • /
    • 2014
  • To survive in the current shipbuilding industry, it is of vital importance for shipyards to have the ship components' accuracy evaluated efficiently during most of the manufacturing steps. Evaluating components' accuracy by comparing each component's point cloud data scanned by laser scanners and the ship's design data formatted in CAD cannot be processed efficiently when (1) extract components from point cloud data include irregular obstacles endogenously, or when (2) registration of the two data sets have no clear direction setting. This paper presents reformative point cloud data processing methods to solve these problems. K-d tree construction of the point cloud data fastens a neighbor searching of each point. Region growing method performed on the neighbor points of the seed point extracts the continuous part of the component, while curved surface fitting and B-spline curved line fitting at the edge of the continuous part recognize the neighbor domains of the same component divided by obstacles' shadows. The ICP (Iterative Closest Point) algorithm conducts a registration of the two sets of data after the proper registration's direction is decided by principal component analysis. By experiments conducted at the shipyard, 200 curved shell plates are extracted from the scanned point cloud data, and registrations are conducted between them and the designed CAD data using the proposed methods for an accuracy evaluation. Results show that the methods proposed in this paper support the accuracy evaluation targeted point cloud data processing efficiently in practice.