• Journal of Mechanical Science and Technology
• /
• v.20 no.12
• /
• pp.2034-2042
• /
• 2006

In this study, a complete 3D surface reconstruction method is proposed based on the concept that the vertices, of surface model can be completely matched to the unstructured point cloud. In order to generate the initial mesh model from the point cloud, the mesh subdivision of bounding box and shrink-wrapping algorithm are introduced. The control mesh model for well representing the topology of point cloud is derived from the initial mesh model by using the mesh simplification technique based on the original QEM algorithm, and the parametric surface model for approximately representing the geometry of point cloud is derived by applying the local subdivision surface fitting scheme on the control mesh model. And, to reconstruct the complete matching surface model, the insertion of isolated points on the parametric surface model and the mesh optimization are carried out. Especially, the fast 3D surface reconstruction is realized by introducing the voxel-based nearest-point search algorithm, and the simulation results reveal the availability of the proposed surface reconstruction method.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.10a
• /
• pp.248-254
• /
• 2001

This paper presents a progressive algorithm for reconstructing a 3D structure from a given 2D sketch drawing (edge-vertex graph without hidden line removal) according to the user's sketch order. While previous methods reconstruct a 3D structure at once, the proposed method progressively calculate a 3D structure by optimizing the coordinates of vertices of an object according to the sketch order. The progressive method reconstructs the most plausible 3D object quickly by applying 3D constraints that are derived from the relationship between the object and the sketch drawing in the optimization process. The progressive reconstruction algorithm is discussed, and examples from a working implementation are given.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.30 no.8 s.251
• /
• pp.906-915
• /
• 2006

This study concerns an advanced 3D surface reconstruction method that the vertices of surface model can be completely matched to the unstructured point cloud measured from arbitrary complex shapes. The concept of bounding voxel model is introduced to generate the mesh model well-representing the geometrical and topological characteristics of point cloud. In the reconstruction processes, the application of various methodologies such as shrink-wrapping, mesh simplification, local subdivision surface fitting, insertion of is isolated points, mesh optimization and so on, are required. Especially, the effectiveness, rapidity and reliability of the proposed surface reconstruction method are demonstrated by the simulation results for the geometrically and topologically complex shapes like dragon and human mouth.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.6
• /
• pp.489-494
• /
• 2013

This paper tackles the problem of designing a dynamic output-feedback control for linear discrete-time norm-bounded uncertain systems with input saturation. By employing a LPV (Linear Parameter Varying) instead of LTI (Linear Time-Invariant) control, the useful information on interpolation parameters appearing in the procedure of representing saturation nonlinearity as a convex polytope is additionally applied in the control design procedure. By solving the addressed problem that can be recast into a convex optimization problem characterized by LMIs (Linear Matrix Inequalities) with one prescribed scalar, the vertices of convex set containing an LPV output-feedback control gain and the associated maximal invariant set of initial states are simultaneously obtained.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.4
• /
• pp.77-82
• /
• 2004

Being in an internet era, the rapid transmission of 3D mesh models is getting more important and efforts toward the compression of various aspects of mesh models have been provided. Even though a mesh model usually consists of coordinates of vertices and properties such as colors and normals, topology plays the most important part in the compression of other information in the models. Despite the extensive studies on Edgebreaker, the most frequently used and rigorously evaluated topology compressor, the probability distribution of its five op-codes, C, R, E, S, and L, has never been rigorously analyzed yet. In this paper, we present probability distribution of the op-codes which is useful for both the optimization of the compression performance and a priori estimation of compressed file size.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.5_6
• /
• pp.297-304
• /
• 2004

In this paper, a mesh simplification algorithm based on wavelet transform and 2D planar sampling is proposed for efficient handling of 3D objects in computer applications. Since 3D vertices are directly transformed with wavelets in conventional mesh compression and simplification algorithms, it is difficult to solve tiling optimization problems which reconnect vertices into faces in the synthesis stage highly demanding vertex connectivities. However, a 3D mesh is sampled onto 2D planes and 2D polygons on the planes are independently simplified in the proposed algorithm. Accordingly, the transform of 2D polygons is very tractable and their connection information Is replaced with a sequence of vertices. The vertex sequence of the 2D polygons on each plane is analyzed with wavelets and the transformed data are simplified by removing small wavelet coefficients which are not dominant in the subjective quality of its shape. Therefore, the proposed algorithm is able to change the mesh level-of-detail simply by controlling the distance of 2D sampling planes and the selective removal of wavelet coefficients. Experimental results show that the proposed algorithm is a simple and efficient simplification technique with less external distortion.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3C
• /
• pp.419-425
• /
• 2004

This paper presents a new method which is calculated to use only three vanishing points in order to compute the dimensions of object and its pose from a single image of perspective projection taken by a camera. Our approach is to only compute three vanishing points without informations such as the focal length and rotation matrix from images in the case of perspective projection. We assume that the object can be modeled as a linear function of a dimension vector v. The input of reconstruction is a set of correspondences between features in the model and features in the image. To minimize each the dimensions of the parameterized models, this reconstruction of optimization can be solved by standard nonlinear optimization techniques with a multi-start method which generates multiple starting points for the optimizer by sampling the parameter space uniformly.

• Journal of the Korea Computer Graphics Society
• /
• v.18 no.4
• /
• pp.1-8
• /
• 2012

We present improved deformation energy to enhance the visual quality of a shape deformation technique, where we preserve the local structure of an input planar shape. The deformation energy, in general, consists of several constraints such as Laplacian coordinate constraint to preserve the quality of deformed silhouette edges, mean value coordinates and edge length constraints to preserve the quality of deformed internal shape, and user-specified position constraints to control the shape deformation. When the positions of user-specified vertices change, shape deformation techniques compute the positions of the other vertices by means of nonlinear least squares optimization to minimize the deformation energy. When a user-specified vertex changes its position rapidly, it is frequently observed that the visual quality of the deformed shape decrease rapidly, which is mainly caused by unnecessary enlargement of the Laplacian vectors and unnecessary change of the edge directions along the boundary of the shape. In this paper, we propose improved deformation energy by prohibiting the Laplacian and edge length constraints from changing unnecessarily. The proposed deformation energy incorporated with well-known optimization technique can enhance the visual quality of shape deformation along the silhouette and within the interior of the planar shape while sacrificing only a little execution time.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.18 no.1
• /
• pp.74-85
• /
• 2010

In order to formulate the compounded polypropylene(C-PP) which is suitable to an automotive door trim panel, 9 sorts of properties were measured after manufacturing the C-PP using an extruder and an injection machine with polypropylene(PP), ethylene-octene rubber(EOR) and talc. Mixture design, especially extreme vertices design, in DOE with MINITAB - commercial software was used to analyze the data. The relations between each property and each component, for example, $y=0.00907222x_1+0.00870556x_2+0.0155722x_3$ for specific gravity, were found out by the regression analysis and the variance analysis. The optimized formulation of the C-PP for an automotive door trim panel was acquired at PP(77.6962), EOR(11.0238) and talc(10.2800) by use of the response optimizer(mixture) in MINITAB.

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.2
• /
• pp.3-13
• /
• 1993

In this study, we develop a B & B type algorithm for the concave minimization problem with 0-1 knapsack constraint. Our algorithm reformulates the original problem into the singly linearly constrained concave minimization problem by relaxing 0-1 integer constraint in order to get a lower bound. But this relaxed problem is the concave minimization problem known as NP-hard. Thus the linear function that underestimates the concave objective function over the given domain set is introduced. The introduction of this function bears the following important meanings. Firstly, we can efficiently calculate the lower bound of the optimal object value using the conventional convex optimization methods. Secondly, the above linear function like the concave objective function generates the vertices of the relaxed solution set of the subproblem, which is used to update the upper bound. The fact that the linear underestimating function is uniquely determined over a given simplex enables us to fix underestimating function by considering the simplex containing the relaxed solution set. The initial containing simplex that is the intersection of the linear constraint and the nonnegative orthant is sequentially partitioned into the subsimplices which are related to subproblems.