• Title/Summary/Keyword: mesh smoothing

Search Result 62, Processing Time 0.025 seconds

Reconstruction of the Lost Hair Depth for 3D Human Actor Modeling (3차원 배우 모델링을 위한 깊이 영상의 손실된 머리카락 영역 복원)

  • Cho, Ji-Ho;Chang, In-Yeop;Lee, Kwan-H.
    • Journal of the HCI Society of Korea
    • /
    • v.2 no.2
    • /
    • pp.1-9
    • /
    • 2007
  • In this paper, we propose a reconstruction technique of the lost hair region for 3D human actor modeling. An active depth sensor system can simultaneously capture both color and geometry information of any objects in real-time. However, it cannot acquire some regions whose surfaces are shiny and dark. Therefore, to get a natural 3D human model, the lost region in depth image should be recovered, especially human hair region. The recovery is performed using both color and depth images. We find out the hair region using color image first. After the boundary of hair region is estimated, the inside of hair region is estimated using an interpolation technique and closing operation. A 3D mesh model is generated after performing a series of operations including adaptive sampling, triangulation, mesh smoothing, and texture mapping. The proposed method can generate recovered 3D mesh stream automatically. The final 3D human model allows the user view interaction or haptic interaction in realistic broadcasting system.

  • PDF

Direct Reconstruction of Displaced Subdivision Mesh from Unorganized 3D Points (연결정보가 없는 3차원 점으로부터 차이분할메쉬 직접 복원)

  • Jung, Won-Ki;Kim, Chang-Heon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.6
    • /
    • pp.307-317
    • /
    • 2002
  • In this paper we propose a new mesh reconstruction scheme that produces a displaced subdivision surface directly from unorganized points. The displaced subdivision surface is a new mesh representation that defines a detailed mesh with a displacement map over a smooth domain surface, but original displaced subdivision surface algorithm needs an explicit polygonal mesh since it is not a mesh reconstruction algorithm but a mesh conversion (remeshing) algorithm. The main idea of our approach is that we sample surface detail from unorganized points without any topological information. For this, we predict a virtual triangular face from unorganized points for each sampling ray from a parameteric domain surface. Direct displaced subdivision surface reconstruction from unorganized points has much importance since the output of this algorithm has several important properties: It has compact mesh representation since most vertices can be represented by only a scalar value. Underlying structure of it is piecewise regular so it ran be easily transformed into a multiresolution mesh. Smoothness after mesh deformation is automatically preserved. We avoid time-consuming global energy optimization by employing the input data dependant mesh smoothing, so we can get a good quality displaced subdivision surface quickly.

Offsetting of Triangular Net using Distance Fields (거리장을 이용한 삼각망의 옵셋팅)

  • Yoo, Dong-Jin
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.24 no.9
    • /
    • pp.148-157
    • /
    • 2007
  • A new method which uses distance fields scheme and marching cube algorithm is proposed in order to get an accurate offset model of arbitrary shapes composed of triangular net. In the method, the space bounding the triangular net is divided into smaller cells. For the efficient calculation of distance fields, valid cells which will generate a portion of offset model are selected previously by the suggested detection algorithm. These valid cells are divided again into much smaller voxels which assure required accuracy. At each voxel distance fields are created by calculating the minimum distances between corner points of voxels and triangular net. After generating the whole distance fields, the offset surface were constructed by using the conventional marching cube algorithm together with mesh smoothing scheme. The effectiveness and validity of this new offset method was demonstrated by performing numerical experiments for the various types of triangular net.

A study on the Recognition of Hand-written Characters and Arabic numbers by Neural Networks (신경회로망을 이용한 필기체 한글 자모음 및 숫자인식에 관한 연구)

  • Oh, Dong-Su;Lee, Eun-Un;Yoo, Jae-Guen;Nam, Moon-Hyun
    • Proceedings of the KIEE Conference
    • /
    • 1991.07a
    • /
    • pp.900-904
    • /
    • 1991
  • In this paper, our study for the recognition of Hand-written Korean characters, Arabic numbers and alphabets by neural netwoks. This System extracts feature of character by using the MESH feature point of handwritten character, Arabic numbers and alphabets. To reduce the input image data, features are extracted from each input images. A MLP(multi-layer perceptron) with one hidden layer was trained with a modified BEP(back error propagation) algorithm. This method extracts feature sets of the characters directly from the scanner and can enhance computation speed without using the special preprocesses such as size normalization, smoothing, and thinning.

  • PDF

Mat Foundation Analysis Using Variable Node Plate Bending Element (변절점 굉판휨요소를 이용한 전면기초의 해석)

  • 최창근;김한수
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1992.04a
    • /
    • pp.7-12
    • /
    • 1992
  • The variable node plate bending element, ie, the element with one or two additional mid-side nodes is used in the analysis of mat foundation to generate the nearly ideal grid model in which more nodes are defined near the column location. The plate bending element used in this study is the one based on Mindlin/Reissner plate theory with substitute shear strain field and the nodal stresses of that element are obtained by the local smoothing technique. The interaction of the soil material with the mat foundation is modeled with Winkler springs connected to the nodal points in the mat model. The vertical stiffness of the soil material are represented in terms of a modulus of subgrade reaction and are computed in the same way as to the computation of consistent nodal force of uniform surface loading. Several mesh schemes were proposed and tested to find the most suitable scheme for mat foundation analysis.

  • PDF

Numerical Simulation of Blood Cell Motion in a Simple Shear Flow

  • Choi, Choeng-Ryul;Kim, Chang-Nyung;Hong, Tae-Hyub
    • Proceedings of the KSME Conference
    • /
    • 2008.11a
    • /
    • pp.1487-1491
    • /
    • 2008
  • Detailed knowledge on the motion of blood cells flowing in micro-channels under simple shear flow and the influence of blood flow is essential to provide a better understanding on the blood rheological properties and blood cell aggregation. The microscopic behavior of red blood cell (RBCs) is numerically investigated using a fluid-structure interaction (FSI) method based on the Arbitrary-Lagrangian-Eulerian (ALE) approach and the dynamic mesh method (smoothing and remeshing) in FLUENT (ANSYS Inc., USA). The employed FSI method could be applied to the motions and deformations of a single blood cell and multiple blood cells, and the primary thrombogenesis caused by platelet aggregation. It is expected that, combined with a sophisticated large-scale computational technique, the simulation method will be useful for understanding the overall properties of blood flow from blood cellular level (microscopic) to the resulting rheological properties of blood as a mass (macroscopic).

  • PDF

Study of Shape Optimization for Automobile Lock-up Clutch Piston Design with B-spline Curve Fitting and Simplex Method (B-spline Curve Fitting 과 심플렉스법을 적용한 자동차 록업클러치 피스톤 형상최적설계에 관한 연구)

  • Kim, Choel;Hyun, Seok-Jeong;Son, Jong-Ho;Shin, Se-Hyun
    • Proceedings of the KSME Conference
    • /
    • 2003.11a
    • /
    • pp.1334-1339
    • /
    • 2003
  • An efficient method is developed for the shape optimization of 2-D structures. The sequential linear programming is used for minimization problems. Selected set of master nodes are employed as design variables and assigned to move towards the normal direction. After adapting the nodes on the design boundary, the B-spline curves and mesh smoothing schemes are used to maintain the finite element 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.

  • PDF

Trends of Full 3D Human Reconstruction Technology Based on Image (이미지 기반 완전 3D 인간 복원 기술 동향)

  • Song, Dae-Young;Lee, HeeKyung;Seo, Jeongil;Cho, Donghyeon
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2022.11a
    • /
    • pp.106-108
    • /
    • 2022
  • 이미지 기반 3D 형상 복원에 있어서, 이미지에 보이지 않는 폐색(Occlusion) 영역 부분에 대한 정보가 손실되므로 완전한 복원에 어려움이 있으며, 세밀한 텍스쳐(Texture) 표현이 이루어지지 않고 심한 평활화(Smoothing)나 고립된 노이즈 메쉬(Isolated Noise Mesh) 등 구조적 훼손이 발생한다. 주로 깊은 신경망을 이용하여, 음함수(Implicit Function) 기반 방법은 사전훈련이 완료된 보조 신경망들을 전면부에 배치하거나, Hourglass 등 임베딩(Embedding) 아키텍처를 추가하거나, 또는 표면 법선(Surface Normal)과 같은 환시(Hallucination)를 생성하여 신경망에 입력하기도 한다. 이 논문에서는, 인물의 이미지를 입력받아 색상, 머리카락 및 의상을 포함하는 완전 3D 인간 복원 기술들을 조망해본다.

  • PDF

Surface Reconstruction from Cross-Sectional Images using the Shrink-Wrapping Algorithm (Shrink-Wrapping 알고리즘을 이용한 단층영상으로부터의 표면 재구성)

  • Park, Eun-Jin;Choi, Young-Kyu
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.1
    • /
    • pp.28-37
    • /
    • 2007
  • This paper addresses a new surface reconstruction scheme for approximating the isosurface from a set of tomographic cross sectional images. Differently from the novel Marching cube algorithm, our method does not extract iso-density surface(isosurface) directly from the voxels but calculates the iso-density point(isopoint) first. After building the relatively coarse initial mesh by the Cell-boundary algorithm approximating the isosurface, it produces the final isosurface by iteratively shrinking and smoothing the initial mesh. Comparing with the Marching Cube algorithm, our method is robust and does not make any crack in resulting surface model. Furthermore, the proposed method surmounts the O(1)-adjacency limitation of MC in defining the isopoints by permitting the O(2) and O(3)-adjacent isopoints in surface reconstruction, and can produce more accurate isosurface. According to experiments, it is proved to be very robust and efficient for isosurface reconstruction from cross sectional images.

A reverse engineering system for reproducing a 3D human bust (인체 흉상 복제를 위한 역공학 시스템)

  • 최회련;전용태;장민호;노형민;박세형
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2001.04a
    • /
    • pp.15-19
    • /
    • 2001
  • A dedicated reverse engineering(RE) system for rapid manufacturing of human head in a 3D bust has been developed. The first step in the process is to capture the surface details of a human head and shoulder by three scanners based upon the digital moire fringe technique. Then the multiple scans captured from different angles are aligned and merged into a single polygonal mesh, and the aligned data set is refined by smoothing, subdividing or hole filling process. Finally, the refined data set is sent to a 4-axis computer numerically control(NC) machine to manufacture a replica. In this paper, we mainly describe on the algorithms and software for aligning multiple data sets. The method is based on the recently popular Iterative Closest Point(ICP) algorithm that aligns different polygonal meshes into one common coordinate system. The ICP algorithm finds the nearest positions on one scan to a collection of points on the other scan by minimizing the collective distance between different scans. We also integrate some heuristics into the ICP to enhance the aligning process. A typical example is presented to validate the system and further research work is also discussed.

  • PDF