• Title/Summary/Keyword: 삼차원 분할

Search Result 57, Processing Time 0.035 seconds

Segmentation and Compression Techniques for 3D Animation Models (삼차원 애니메이션 모델의 분할 및 부호화 방법)

  • 안정환;임동근;호요성
    • Proceedings of the IEEK Conference
    • /
    • 2000.09a
    • /
    • pp.353-356
    • /
    • 2000
  • 최근 복잡한 실제 사물을 가상 공간상에 표현하기 위해 삼차원 모델을 많이 이용하고 있다. 기존의 삼차원 데이터 처리는 주로 정지 모델에 대해 기하학 정보와 위상학 정보를 표현하거나 다중 해상도(Level of Details, LOD)로 나타내는데 역점을 두었다. 그러나 네트웍을 통한 가상 공간에서 삼차원 애니메이션에 대한 응용이 점차 늘어남에 따라 이러한 데이터를 효율적으로 압축하여 전송하거나 저장할 필요가 생겼다 본 논문에서는 삼차원 애니메이션 모델의 공간적 또는 시간적 상관 관계를 이용하여 삼차원 모델 정보를 부호화하는 방법을 제안한다. 먼저 주어진 모델의 움직임을 분석하고 이를 (r,θ,ø)의 구 좌표계로 변환한 후 (θ,ø)의 분포에 따라 모델을 분할(Segmentation)한다. 그리고 움직임 벡터는 Affine 변환을 이용하여 삼차원 공간에서의 움직임을 정의한다. Key프레임에 해당하는 정지 모델의 기하학 정보와 위상학 정보를 압축하고, LOD 기술을 적용하여 손실 혹은 무손실로 부호화하여 전송한다. 또한 Key프레임 사이의 화면에서는 선형 또는 비선형 보간법으로 각 분할 부분을 복원하고, 이를 조합하여 전체적인 삼차원 모델을 복원한다.

  • PDF

Representation of Three-dimensional Polygonal Mesh Models Using Hierarchical Partitioning and View dependent Progressive Transmission (계층적 분할을 이용한 삼차원 다각형 메쉬 모델의 표현 및 인간 시점에 따른 점진적 전송 방법)

  • 김성열;호요성
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.6
    • /
    • pp.132-140
    • /
    • 2003
  • In this paper, we propose a new scheme for view-dependent transmission of three-dimensional (3-D) polygonal mesh models with hierarchial partitioning. In order to make a view-dependent representation of 3-D mesh models, we combine sequential and progressive mesh transmission techniques. By setting higher priorities to visible parts than invisible parts, we can obtain good qualify of 3-D models in a limited transmission bandwidth. In this paper, we use a multi -layer representation of 3-D mesh models based on hierarchical partitioning. After representing the 3-D mesh model in a hierarchical tree, we determine resolutions of partitioned submeshes in the last level. Then, we send 3-D model data by view-dependent selection using mesh merging and mesh splitting operations. By the partitioned mesh merging operation, we can reduce the joint boundary information coded redundantly in the partitioned submeshes. We may transmit additional mesh information adaptively through the mesh spritting operation.

Mesh Segmentation Reflecting Global and Local Geometric Characteristics (전역 및 국부 기하 특성을 반영한 메쉬분할)

  • Im, Jeong-Hun;Ha, Jong-Sung;Yoo, Kwan-Hee
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.06b
    • /
    • pp.167-170
    • /
    • 2007
  • 본 논문에서는 텍스춰매핑, 재메쉬화, 메쉬의 단순화와 모핑 및 압축 등 다양한 분야에 적용되는 메쉬분할 문제를 다룬다. 메쉬분할은 주어진 삼차원 메쉬를 서로 떨어진 집합(disjoint sets)으로 분할하는 것으로서 여러 연구자들에 의해 많은 연구 결과들이 제시되어 왔다. 본 논문에서는 삼차원 메쉬가 가지고 있는 기하학적 특성을 고려하여 메쉬를 분할하는 방법을 제시하고자 한다. 먼저 메쉬의 국부적 기하 특성인 곡률 정보와 전역적 기하 특성인 볼록성을 이용하여 삼차원 메쉬를 구성하는 첨예정점을 추출하였고, 이들간의 거리 정보를 이용하여 이 첨예정점들을 군집화(clustering)하였다. 최종 메쉬분할을 위해 분할된 첨예정점에 속하지 않는 나머지 정점들에 대해 거리 정보를 이용하여 군집화를 수행하였다. 본 논문에서 제안한 메쉬분할 방법을 검증하기 위해 벤치마크로 공개된 여러 메쉬 모델에 대해 실험하여 그 결과를 보여주었다.

  • PDF

Selective Segmentation of 3-D Objects Using Surface Detection and Volume Growing (표면 검출과 볼륨 확장을 이용한 삼차원 물체의 선택 분할)

  • Bae, So-Young;Choi, Soo-Mi;Choi, Yoo-Joo;Kim, Myoung-Hee
    • The KIPS Transactions:PartA
    • /
    • v.9A no.1
    • /
    • pp.83-92
    • /
    • 2002
  • The segmentation of target objects from three dimensional volume images is an essential step for visualization and volume measurement. In this paper, we present a method to detect the surface of objects by improving the widely used levoy filtering for volume visualization. Using morphological operators we generate completely closed surfaces and selectively segment objects using the volume growing algorithm. The presented method was applied to 3-D artificial sphere images and angiocardiograms. We quantitatively compared this method with the conventional levoy filtering using artificial sphereimages, and the results showed that our method is better in the aspect of voxel errors. The results of visual comparison using angiocardiograms also showed that our method is more accurate. The presented method in this paper is very effective for segmentation of volume data because segmentation, visualization and measurement are frequently used together for 3-D image processing and they can be easily related in our method.

Computational Efficiency of 3-D Contact Analysis by Domain/Boundary Decomposition Formulation (영역/경계 분할 정식화에 의한 삼차원 접촉 해석의 효율성 검토)

  • Kim, Yong-Uhn;Ryu, Han-Yeol;Shin, Eui-Sup
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.20 no.4
    • /
    • pp.469-476
    • /
    • 2007
  • A domain/boundary decomposition technique is applied to carry out efficient finite element analyses of 3-D contact problems. Appropriate penalty functions are selected for connecting an interface and contact interfaces with neighboring subdomains that satisfy continuity constraints. As a consequence, all the effective stiffness matrices have positive definiteness, and computational efficiency can be improved to a considerable degree. If necessary, any complex-shaped 3-D domain can be divided into several simple-shaped subdomains without considering the conformity of meshes along the interface. With a set of numerical examples, the basic characteristics of computational efficiency are investigated carefully.

A Collusion-secure Fingerprinting Scheme for Three-dimensional Mesh Models (삼차원 메쉬 모델에 적용한 공모방지 핑거프린팅 기법)

  • Hur, Yung;Jeon, Jeong-Hee;Ho, Yo-Sung
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.41 no.4
    • /
    • pp.113-123
    • /
    • 2004
  • This paper presents a new collusion-secure fingerprinting scheme to embed fingerprints into three-dimensional(3-D) mesh models efficiently. In the proposed scheme, we make the same number of fingerprints as the number of customers based on the finite projective geometry, partition a 3-D mesh model related to the number of bits assigned to each fingerprint and then embed a watermark representing copyright information into each submesh to be marked. Considering imperceptibility and robustness of the watermarking algorithm we embed the watermark signal into mid-frequency DCT coefficients obtained by transforming vertex coordinates in the triangle strips which are generated from the submeshes to be marked. Experimental results show that our scheme is robust to additive random noises, MPEG-4 SNHC 3-D mesh coding, geometrical transformations, and fingerprint attacks by two traitors' collusion. In addition, we can reduce the number of bits assigned to each fingerprint significantly.

Three-dimensional Numerical Analysis of Detonation Wave Structures in a Square Tube (정사각관 내 데토네이션 파 구조의 삼차원 수치 해석)

  • Cho, Deok-Rae;Won, Su-Hee;Shin, Jae-Ryul;Lee, Soo-Han;Choi, Jeong-Yeol
    • Journal of the Korean Society of Propulsion Engineers
    • /
    • v.11 no.1
    • /
    • pp.1-10
    • /
    • 2007
  • Three dimensional structures of detonation waves propagating in a square tube were investigated using a high resolution CFD code coupled with a conservation equation of reaction progress variable and an one-step irreversible reaction. The code were parallelized based on domain decomposition technique using MPI library. The computations were carried on an in-house Windows cluster with AMD processors. Three-dimensional unsteady analysis results in the smoked-foil records caused by the instabilities of the detonation waves, which showed the rectangular and diagonal modes of detonation instabilities depending on the initial condition of disturbances and the spinning detonation for case of small reaction constant.

Visualization of Affine Invariant Tetrahedrization (Slice-Based Method for Visualizing the Structure of Tetrahedrization) (어파인 불변성 사면체 분할법의 가시화 (절편 법을 이용한 사면체 구조의 가시화))

  • Lee, Kun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.7
    • /
    • pp.1894-1905
    • /
    • 1996
  • Delauuany triangulation which is the dual of Dirichlet tessellation is not affine invariant. In other words, the triangulation is dependent upon the choice of the coordinate axes used to represent the vertices. In the same reason, Delahanty tetrahedrization does not have an affine iveariant transformation property. In this paper, we present a new type of tetrahedrization of spacial points sets which is unaffected by translations, scalings, shearings and rotations. An affine invariant tetrahedrization is discussed as a means of affine invariant 2 -D triangulation extended to three-dimensional tetrahedrization. A new associate norm between two points in 3-D space is defined. The visualization of the structure of tetrahedrization can discriminate between Delaunay tetrahedrization and affine invariant tetrahedrization.

  • PDF

Three-dimensional Model Generation for Active Shape Model Algorithm (능동모양모델 알고리듬을 위한 삼차원 모델생성 기법)

  • Lim, Seong-Jae;Jeong, Yong-Yeon;Ho, Yo-Sung
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.6 s.312
    • /
    • pp.28-35
    • /
    • 2006
  • Statistical models of shape variability based on active shape models (ASMs) have been successfully utilized to perform segmentation and recognition tasks in two-dimensional (2D) images. Three-dimensional (3D) model-based approaches are more promising than 2D approaches since they can bring in more realistic shape constraints for recognizing and delineating the object boundary. For 3D model-based approaches, however, building the 3D shape model from a training set of segmented instances of an object is a major challenge and currently it remains an open problem in building the 3D shape model, one essential step is to generate a point distribution model (PDM). Corresponding landmarks must be selected in all1 training shapes for generating PDM, and manual determination of landmark correspondences is very time-consuming, tedious, and error-prone. In this paper, we propose a novel automatic method for generating 3D statistical shape models. Given a set of training 3D shapes, we generate a 3D model by 1) building the mean shape fro]n the distance transform of the training shapes, 2) utilizing a tetrahedron method for automatically selecting landmarks on the mean shape, and 3) subsequently propagating these landmarks to each training shape via a distance labeling method. In this paper, we investigate the accuracy and compactness of the 3D model for the human liver built from 50 segmented individual CT data sets. The proposed method is very general without such assumptions and can be applied to other data sets.

Sequential 3D Mesh Coding using Wave Partitioning (파동분할 방식의 순차적 삼차원 메쉬 압축 부호화)

  • 김태완;안정환;임동근;호요성
    • Proceedings of the IEEK Conference
    • /
    • 2001.09a
    • /
    • pp.125-128
    • /
    • 2001
  • 본 논문은 파동분할(Wave partitioning) 방식을 이용한 순차적(Sequential) 메쉬 부호화 방식을 제안한다. 파동분할 방식은 호수에 물방울이 퍼져 나가는 자연 원리를 이용하여 초기 삼각형의 주위에 삼각형을 덧붙여 가면서 하나의 SPB(Small Processing Block)을 만들어내는 방식이다. 이 방식을 이용하여 하나의 모델을 서로 독립적인 SPB로 분할하고, 각각의 SPB 내에서 초기 삼각형을 중심으로 그것에 덧붙여진 삼각형에 의해 만들어진 원 또는 반원을 찾는다. 또한 그 원주를 따라 순차적으로 꼭지점을 구하면 각각의 꼭지점들은 일정한 패턴으로 늘어서게 되고, 이를 이용하여 연결성 정보 없이 부가 정보만 이용하여 모델을 순차적으로 무손실 부호화한다.

  • PDF