• 한국소성가공학회:학술대회논문집
• /
• 한국소성가공학회 2003년도 춘계학술대회논문집
• /
• pp.331-334
• /
• 2003

In the finite element simulation of hot forging processes using hexahedron, remeshing of a flash is very difficult. The mesh compression method is a remeshing technique to construct an effective hexahedral mesh. However, because mesh is distorted during the compression procedure or the mesh compression method, mesh smoothing is necessary to improve the mesh Qualify. in this study, several geometric mesh smoothing techniques and a matrix norm optimization technique are applied and compared which is more adaptive to the mesh compression method.

• 소성∙가공
• /
• 제12권4호
• /
• pp.340-347
• /
• 2003

In the rigid-plastic finite element simulation of hot forging processes using hexahedral mesh, remeshing of a flash is important for design and control of the process to obtain desirable defect-free products. The mesh compression method is a remeshing technique which enables the construction of an effective hexahedral mesh in the flash. However, because the mesh is distorted during the compression procedure of the mesh compression method, when it is used in resuming the analysis, it causes discretization error and decreases the conversance rate. Therefore, mesh smoothing is necessary to improve the mesh quality. In this study, several geometric mesh smoothing techniques and optimization techniques are introduced and modified to improve mesh quality. Then, the most adaptive technique is recommended for the mesh compression method.

• ETRI Journal
• /
• 제39권1호
• /
• pp.1-12
• /
• 2017

In this paper, we present a new approach for the progressive compression of three-dimensional (3D) mesh geometry using redundant frame dictionaries and sparse approximation techniques. We construct the proposed frames from redundant linear combinations of the eigenvectors of a combinatorial mesh Laplacian matrix. We achieve a sparse synthesis of the mesh geometry by selecting atoms from a frame using matching pursuit. Experimental results show that the resulting rate-distortion performance compares favorably with other progressive mesh compression algorithms in the same category, even when a very simple, sub-optimal encoding strategy is used for the transmitted data. The proposed frames also have the desirable property of being able to be applied directly to a manifold mesh having arbitrary topology and connectivity types; thus, no initial remeshing is required and the original mesh connectivity is preserved.

• ETRI Journal
• /
• 제32권1호
• /
• pp.163-165
• /
• 2010

A trend in 3D mesh compression is codec design with low computational complexity which preserves the input vertex and face order. However, this added information increases the complexity. We present a fast 3D mesh compression method that compresses the redundant shared vertex information between neighboring faces using simple first-order differential coding followed by fast entropy coding with a fixed length prefix. Our algorithm is feasible for low complexity designs and maintains the order, which is now part of the MPEG-4 scalable complexity 3D mesh compression standard. The proposed algorithm is 30 times faster than MPEG-4 3D mesh coding extension.

• Journal of Computing Science and Engineering
• /
• 제4권3호
• /
• pp.207-224
• /
• 2010

This paper presents a compression scheme for mesh geometry, which is suitable for mobile graphics. The main focus is to enable real-time decoding of compressed vertex positions while providing reasonable compression ratios. Our scheme is based on local quantization of vertex positions with mesh partitioning. To prevent visual seams along the partitioning boundaries, we constrain the locally quantized cells of all mesh partitions to have the same size and aligned local axes. We propose a mesh partitioning algorithm to minimize the size of locally quantized cells, which relates to the distortion of a restored mesh. Vertex coordinates are stored in main memory and transmitted to graphics hardware for rendering in the quantized form, saving memory space and system bus bandwidth. Decoding operation is combined with model geometry transformation, and the only overhead to restore vertex positions is one matrix multiplication for each mesh partition. In our experiments, a 32-bit floating point vertex coordinate is quantized into an 8-bit integer, which is the smallest data size supported in a mobile graphics library. With this setting, the distortions of the restored meshes are comparable to 11-bit global quantization of vertex coordinates. We also apply the proposed approach to compression of vertex attributes, such as vertex normals and texture coordinates, and show that gains similar to vertex geometry can be obtained through local quantization with mesh partitioning.

• 한국콘텐츠학회논문지
• /
• 제9권5호
• /
• pp.76-83
• /
• 2009

최근 공동 연결 관계와 연속적인 정점 위치들의 움직임으로 이루어진 메쉬들의 모임, 즉 메쉬 시퀀스를 압축하는 연구가 활발하게 이루어지고 있다. 본 논문은 Khodakovsky 등이 제시한 준균일 메쉬 압축방법에 기반한 메쉬 시퀀스의 압축 알고리즘을 제시하고자 한다. 준균일 메쉬 시퀀스로의 메쉬 재구성을 이용한 메쉬 시퀀스 압축 알고리즘은 크게 두 부분으로 이루어진다. 첫 번째 부분은 주어진 비균일 메쉬 시퀀스로부터 준균일 메쉬 시퀀스를 생성하는 것이다. 준균일 메쉬를 생성하기 위해 본 논문에서는 MAPS 알고리즘을 사용하였다. 하지만 단일 메쉬에 대해 적용이 가능한 MAPS 알고리즘을 메쉬 시퀀스에 그대로 적용할 수 없다. 따라서 주어진 애니메이션에서의 정점 움직임을 고려하여 유사한 움직임을 가지는 영역별로 분할하고, 이 분할 정보과 정점의 움직임을 고려할 수 있도록 MAPS 알고리즘을 확장하였다. 두 번째 단계에서는 웨이블릿 변형과 메쉬 분할 정보를 이용해 준균일 메쉬를 압축하였다. 각 분할 영역의 변환 정보를 고려해 분할 영역 내 정점의 위치를 예측하고, 참조 프레임과의 차이값을 압축함으로써 효율적으로 준균일 메쉬 시퀀스를 압축하였다.

• 방송공학회논문지
• /
• 제13권1호
• /
• pp.109-118
• /
• 2008

텍스처 영상 압축은 JPEG과 같은 영상 압축 표준을 사용한다. 일반 텍스처 영상에는 JPEG으로도 좋은 압축 성능을 내지만 패치 텍스처 영상은 이러한 영상 압축 기술로 압축했을 때 좋은 압축 성능을 보이지 못하였다. 이를 보완하고 압축 성능을 높이기 위해 기존의 패치 텍스처 영상에 주변 화소간에 색차를 줄이기 위한 전처리 기술을 소개하고, 제안된 기술과 JPEG 압축을 순서대로 적용하였을 때 압축 성능이 23%에서 45%까지 향상됨을 보이고자 한다.

• 한국CDE학회논문집
• /
• 제12권2호
• /
• pp.109-117
• /
• 2007

Three-dimensional mesh models have been widely used in various applications such as simulations, animations, and e-catalogs. In such applications the normal vectors of mesh models are used mainly for shading and take up the major portion of data size and transmission time paper over networks. Therefore a variety of techniques have been developed to compress them efficiently. In this paper, we propose the MOEC (Modified Octree Encoding Compression) algorithm, which allow multi lever compression ratios for 3D mesh models. In the algorithm, a modified octree has nodes representing their own positions and supporting a depth of the tree so that the normal vectors are compressed up to levels where the shading is visually indistinguishable. This approach provides efficient in compressing normals with multi-level ratios, without additional encoding when changing in compression ratio is required.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 춘계학술대회논문집C
• /
• pp.492-497
• /
• 2001

In the finite element analysis of metal forming processes using general Lagrangian formulation, element nodes in the mesh move and elements are distorted as the material is deformed. The excessive degeneracy of mesh interrupts finite element analysis and thus increases the error of plastic deformation energy. In this study, a remeshing scheme using so-called mesh compression method is proposed to effectively analyze the flash which is generated usually in hot forging processes. In order to verify the effectiveness of the method, several examples are tested in two-dimensional and three-dimensional problems.

• 소성∙가공
• /
• 제11권2호
• /
• pp.179-186
• /
• 2002

In the finite element analysis of metal forming Processes using general Lagrangian formulation, element nodes in the mesh move and elements are distorted as the material is deformed. The excessive degeneracy of mesh interrupts finite element analysis and thus increases the error of plastic deformation energy, In this study, a remeshing scheme using so-called mesh compression method is proposed to effectively analyze the flash which is generated usually in hot forging processes. In order to verify the effectiveness of the method, several examples are tested in two-dimensional and three-dimensional problems.