• Journal of Broadcast Engineering
• /
• v.9 no.1
• /
• pp.64-73
• /
• 2004

A robust watermarking algorithm is proposed for 3D mesh models. Watermark is inserted into the 2D image which is extracted from the target 3D model. Each Pixel value of the extracted 2D image represents a distance from the predefined reference points to the face of the given 3D model. This extracted image is defined as “range image” in this paper. Watermark is embedded into the range image. Then, watermarked 3D mesh is obtained by modifying vertices using the watermarked range Image. In extraction procedure, the original model is needed. After registration between the original and the watermarked models, two range images are extracted from each 3D model. From these images. embedded watermark is extracted. Experimental results show that the proposed algorithm is robust against the attacks such as rotation, translation, uniform scaling, mesh simplification, AWGN and quantization of vertex coordinates.

• The Journal of the Korea Contents Association
• /
• v.3 no.4
• /
• pp.69-76
• /
• 2003

Recently, in computer graphics, researches on 3D animations have been very active. one of the important research areas in 3D animation is animation of human being. The creation and animation of 3D facial models has depended on animators' manual work frame by frame. Thus, it needs many efforts and time as well as various hardwares and softwares. In this paper, we implements a way to generation 3D human face model easily and quickly just with the front face images. Then, we suggests a methodology for mesh data simplification of 3D generic model.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.2 s.308
• /
• pp.81-92
• /
• 2006

This paper proposes a robustness watermarking for 3D mesh model based on projection onto convex sets (POCS). After designing the convex sets for robustness and invisibility among some requirements for watermarking system, a 3D-mesh model is projected alternatively onto two constraints convex sets until the convergence condition is satisfied. The robustness convex set are designed for embedding the watermark into the distance distribution of the vertices to robust against the attacks, such as mesh simplification, cropping, rotation, translation, scaling, and vertex randomization. The invisibility convex set are designed for the embedded watermark to be invisible. The decision values and index that the watermark was embedded with are used to extract the watermark without the original model. Experimental results verify that the watermarked mesh model has invisibility and robustness against the attacks, such as translation, scaling, mesh simplification, cropping, and vertex randomization.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2017.05a
• /
• pp.984-990
• /
• 2017

Mesh screen modeling and liquid propellant discharge simulation of surface tension tank were performed using commercial CFD software Flow-3d. $350{\times}2600$, $400{\times}3000$ and $510{\times}3600$ DTW mesh screen were modeled using macroscopic porous media model. Porosity, capillary pressure, and drag coefficient were assigned for each mesh screen model, and bubble point simulations were performed. The mesh screen model was validated with the experimental data. Based on the screen modeling, liquid propellant discharge simulation from PMD tank was performed. NTO was assigned as the liquid propellant, and void was set to flow into the tank inlet to achieve an initial volume flow rate of liquid propellant in $3{\times}10^{-3}g$ acceleration condition. The intial flow pressure drop through the mesh screen was approximately 270 Pa, and the pressure drop increased with time. Liquid propellant discharge was sustained until the flow pressure drop reached approximately 630 Pa, which was near the estimated bubble point value of the screen model.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.5
• /
• pp.51-58
• /
• 2004

In this paper, a mesh simplification algorithm is proposed which considers the conservation of the volume of a 3D model. In General, most of mesh simplification algorithm use a distance metric. The distance metric is very efficient to measure geometric error, but it causes volume changes between the original model and the simplified model. In this paper a mesh simplification algorithm which conserves the volume of the original model is suggested. A new vertex resulting from an edge contraction, takes a position which conserves the volume of the 3D model using the proposed algorithm. Although the new algorithm needs more time than the QEM algorithm, it is shown that it conserves the original volumn of the 3D model during the simplification.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.137-142
• /
• 2004

In this paper, we propose a new scheme for geometry coding of three-dimensional (3-D) mesh models using a fixed spectral basis. In order to code the mesh geometry information, we generate a fixed spectral basis using the dual graph derived from the 3-D mesh topology. After we partition a 3-D mesh model into several independent sub-meshes to reduce coding complexity, the mesh geometry information is projected onto the generated orthonormal bases which are the eigenvectors of the Laplacian matrix of the 3-D mesh. Finally, spectral coefficients are coded by a quantizer and a variable length coder. The proposed scheme can not only overcome difficulty of generating a fixed spectral basis, but also reduce coding complexity. Moreover, we can provide an efficient multi-resolution representation of 3-D meshes.

• 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.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.304-306
• /
• 2004

With the developing of current multimedia broadcasting, user will be provided for lots of various content through the various channel and media. Content provider and consumer want the various service using content with the better quality which is fit to users' preference. For transmitting this content in the limited transmission channel capacity, it needs to transmit the highly compressed content. The content of 3D mesh model-based on MPEG-4 enables the various content service that provides the lower size and the resonable quality, and Personalize(Targeting) service just provide the contents that user more wants and likes. This paper presents the study on the targeting service using compression of 3D mesh model-based on MPEG-4 and the adaptation of Embedded Graphic application program using it.

• 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.

• Journal of IKEEE
• /
• v.23 no.4
• /
• pp.1250-1256
• /
• 2019

Although one can easily generate real-world 3D mesh data using a 3D printer or a depth camera, the generated data inevitably includes unnecessary noise. Therefore, mesh denoising is essential to obtain intact 3D mesh data. However, conventional mathematical denoising methods require preprocessing and often eliminate some important features of the 3D mesh. To address this problem, this paper proposes a deep learning based 3D mesh denoising method. Specifically, we propose a convolution-based autoencoder model consisting of an encoder and a decoder. The convolution operation applied to the mesh data performs denoising considering the relationship between each vertex constituting the mesh data and the surrounding vertices. When the convolution is completed, a sampling operation is performed to improve the learning speed. Experimental results show that the proposed autoencoder model produces faster and higher quality denoised data than the conventional methods.