• Journal of Broadcast Engineering
• /
• v.11 no.4 s.33
• /
• pp.471-482
• /
• 2006

In this paper, we propose a new scheme to generate multi-view images utilizing depth map decomposition and adaptive edge smoothing. After carrying out smooth filtering based on an adaptive window size to regions of edges in the depth map, we decompose the smoothed depth map into four types of images: regular mesh, object boundary, feature point, and number-of-layer images. Then, we generate 3-D scenes from the decomposed images using a 3-D mesh triangulation technique. Finally, we extract multi-view images from the reconstructed 3-D scenes by changing the position of a virtual camera in the 3-D space. Experimental results show that our scheme generates multi-view images successfully by minimizing a rubber-sheet problem using edge smoothing, and renders consecutive 3-D scenes in real time through information decomposition of depth maps. In addition, the proposed scheme can be used for 3-D applications that need the depth information, such as depth keying, since we can preserve the depth data unlike the previous unsymmetric filtering method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.3
• /
• pp.575-591
• /
• 2011

We present a novel active contour-based two-pass approach to extract smooth feature regions from a triangular mesh. In the first pass, an active contour formulated in level-set surfaces is devised to extract feature regions with rough boundaries. In the second pass, the rough boundary curve is smoothed by minimizing internal energy, which is derived from its curvature. The separation of the extraction and smoothing process enables us to extract feature regions with smooth boundaries from a triangular mesh without user's initial model. Furthermore, smooth feature curves can also be obtained by skeletonizing the smooth feature regions. We tested our algorithm on facial models and proved its excellence.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.1
• /
• pp.149-159
• /
• 2008

In this paper, we propose a blind watermarking algorithm of 3d mesh model using spherical parameterization. Spherical parameterization is a useful method which is applicable to 3D data processing. Especially, orthogonal coordinate can not analyse the feature of the vertex coordination of the 3D mesh model, but this is possible to analyse and process. In this paper, the centroid center of the 3D model was set to the origin of the spherical coordinate, the orthogonal coordinate system was transformed to the spherical coordinate system, and then the spherical parameterization was applied. The watermark was embedded via addition/modification of the vertex after the feature analysis of the geometrical information and topological information. This algorithm is robust against to the typical geometrical attacks such as translation, scaling and rotation. It is also robust to the mesh reordering, file format change, mesh simplification, and smoothing. In this case, the this algorithm can extract the watermark information about $90{\sim}98%$ from the attacked model. This means it can be applicable to the game, virtual reality and rapid prototyping fields.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.6
• /
• pp.511-520
• /
• 2009

In this paper, we present a new iso-density surface reconstruction scheme based on a hierarchy on the input volume data and the output mesh data. From the input volume data, we construct a hierarchy of volumes, called a volume pyramid, based on a 3D dilation filter. After constructing the volume pyramid, we extract a coarse base mesh from the coarsest resolution of the pyramid with the Cell-boundary representation scheme. We iteratively fit this mesh to the iso-points extracted from the volume data under O(3)-adjacency constraint. For the surface fitting, the shrinking process and the smoothing process are adopted as in the SWIS (Shrink-wrapped isosurface) algorithm[6], and we subdivide the mesh to be able to reconstruct fine detail of the isosurface. The advantage of our method is that it generates a mesh which can be utilized by several multiresolution algorithms such as compression and progressive transmission.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.12 no.3
• /
• pp.101-108
• /
• 2004

A FEM-based efficient method is developed for the shape optimization of 2-D structures. The combined SLP and Simplex method are coupled with finite element analysis. Selected set of master nodes on the design boundaries are employed as design variables and assigned to move towards their normal directions. The other nodes along the design boundaries are grouped into the master node. By interpolating the repositioned master nodes, the B-spline curves are formed so that the rest mid-nodes efficiently settle down on the B-spline curves. Mesh smoothing scheme is also applied for the nodes on the design boundary to maintain most finite elements in good quality. Finally, a numerical implementation of optimum design of an automobile torque converter piston subjected to pressure and centrifugal loads is presented. The results shows additional weight up to 13% may be saved after the shape optimization.

• Structural Engineering and Mechanics
• /
• v.39 no.6
• /
• pp.767-793
• /
• 2011

An efficient edge-based smoothed finite element method (ES-FEM) has been recently developed for solving solid mechanics problems. The ES-FEM uses triangular elements that can be generated easily for complicated domains. In this paper, the complexity study of the ES-FEM based on triangular elements is conducted in detail, which confirms the ES-FEM produces higher computational efficiency compared to the FEM. Therefore, the ES-FEM offers an excellent platform for adaptive analysis, and this paper presents an efficient adaptive procedure based on the ES-FEM. A smoothing domain based energy (SDE) error estimate is first devised making use of the features of the ES-FEM. The present error estimate differs from the conventional approaches and evaluates error based on smoothing domains used in the ES-FEM. A local refinement technique based on the Delaunay algorithm is then implemented to achieve high efficiency in the mesh refinement. In this refinement technique, each node is assigned a scaling factor to control the local nodal density, and refinement of the neighborhood of a node is accomplished simply by adjusting its scaling factor. Intensive numerical studies, including an actual engineering problem of an automobile part, show that the proposed adaptive procedure is effective and efficient in producing solutions of desired accuracy.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.28 no.2
• /
• pp.149-157
• /
• 2004

Implicit finite element analysis of the flat surface-straight edge hemming process is performed by using a commercial code ABAQUS/Standard. Methods of finite element modeling for springback simulation and contact pair definition are discussed. An optimal mesh system is chosen through the error analysis that is based on the smoothing of discontinuity in the state variables. This study has focused on the investigation of the influence of process parameters in flanging, pre-hemming and main hemming on final hem quality, which can be defined by turn-down, warp and roll-in. The parameters adopted in this parametric study are flange length, flange angle, flanging die corner radius, face angle and insertion angle of pre-hemming punch, and over-stroke of pre-hemming and main hemming punches.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2008.05a
• /
• pp.1634-1638
• /
• 2008

하천의 2차원 흐름 해석, 유사이동 해석, 오염확산 해석을 위한 유체의 수치해석법에는 유한요소법, 유한차분법, 유한차분법의 변형인 유한체적법, 경계적분법 등이 있다. 유체에 대한 수치해석 기법으로 전통적으로 가장 많이 사용되고 있는 방법은 유한차분법이지만, 비구조적 요소망(unstructured mesh)을 이용하여 복잡한 형상을 표현하기가 상대적으로 용이한 유한요소법이 다양한 형태의 하천 해석에는 더욱 적합할 것이다. 본 연구에서는 비구조적 요소망을 advanced front method를 이용하여 생성해 보았다. Advanced front method는 해석하고자 하는 영역에 적절한 절점들을 생성한 후 삼각 요소망을 구성하는 grid based advanced front method와 절점들을 생성하지 않고 해석 영역에 삼각 요소를 바로 구성하는 element based advanced front method로 나눌 수 있다. Grid based advanced front method에서 해석 영역에 적절한 절점을 생성하는 방법으로는 일반적인 격자 구조의 절점 생성 방법을 적용하였으며 경계와의 거리가 가까운 절점은 생성되지 않으며, 삼각 요소를 구성할 때에는 두 개의 인접 절점을 비교하여 최적의 삼각 요소를 구성하게 된다. 단 두 개의 인접 절점만을 비교함으로서 비교적 빠른 시간 안에 최적의 삼각 요소망을 구성할 수 있다. 삼각 요소망을 생성한 후에는 Laplacian smoothing을 이용하여 삼각 요소망의 형질을 개선하였다. Element based advanced front method는 외부 경계에서부터 시작된 Front가 내부 영역으로 확대되어지며 각 Front에서 적절한 절점을 직접 생성하여 바로 삼각 요소를 구성하게 된다. Front에서 생성된 절점은 인접 절점들이 있는지 검색하여 인접 절점이 있다면 생성된 절점은 삭제되어지며 인접 절점이 삼각 요소를 위한 나머지 한 점으로 채택되어진다. Front는 외부 경계와 교차되어지지 않아야 하며 또한 연속된 Front를 효율적으로 관리하기 위해 list 자료 구조를 활용하였다.

• Journal of the Korea Computer Graphics Society
• /
• v.23 no.4
• /
• pp.11-19
• /
• 2017

We propose a new pipeline of fluid surface reconstruction that incorporates hybrid SDF(signed distance fields) and adaptive fluid surface techniques to finely reconstruct liquid-solid mixed surfaces. Previous particle-based fluid simulation suffer from a noisy surface problem when the particles are distributed irregularly. If a smoothing scheme is applied to reduce the problem, sharp and detailed features can be lost by over-smoothing artifacts. Our method constructs a hybrid SDF by combining signed distance values from the solid and liquid parts of the object. We also proposed a method of adaptively reconstructing the surface of the fluid to further improve the overall efficiency. This not only shows the detailed surface of the solid and liquid parts, but also the detail of the solid surface and the smooth fluid surface when both materials are mixed. We introduce the concept of guiding shape and propose a method to get signed distance value quickly. In addition, the hybrid SDF and mesh reconstruction techniques are integrated in the adaptive framework. As a result, our method improves the overall efficiency of the pipeline to restore fluid surfaces.

• The Journal of Korean Association of Computer Education
• /
• v.9 no.1
• /
• pp.89-95
• /
• 2006

The local geometric properties such as curvatures and normal vectors play important roles for analyzing the local shape of objects in the fields of computer graphics and computer vision. The result of the geometric operations such as mesh simplification and mesh smoothing is dependent on how to compute the curvatures of meshes because there is no exact mathematical definition of curvature at vertices on 3D meshes. Therefore, In this paper, we indicate the fatal error in computing the sectional curvatures of the most previous discrete curvature estimations. Moreover, we present a discrete curvature estimation to overcome the error, which is based on the parabola interpolation and the geometric properties of Bezier curves. Therefore, We can well distinguish between the sharp vertices and the flat ones, so our method may be applied to a variety of geometric operations.