• Title/Summary/Keyword: 3-D mesh sequences

Search Result 5, Processing Time 0.025 seconds

Depth Compression for Multi-View Sequences Using 3-D Mesh Representation (3-D 메쉬 모델을 이용한 다시점 영상의 깊이 정보 압축)

  • Jung, Il-Lyong;Kim, Chang-Su
    • Proceedings of the IEEK Conference
    • /
    • 2007.07a
    • /
    • pp.203-204
    • /
    • 2007
  • In this work, we propose a compression algorithm for depth images, which are obtained from multi-view sequences. The proposed algorithm represents a depth image using a 3-D regular triangular mesh and predictively encodes the mesh vertices using a linear prediction scheme. The prediction errors are encoded with a arithmetic coder. Simulation results demonstrate that the proposed algorithm provides better performances than the JPEG2000 lossless coder.

  • PDF

A Blind Watermarking for 3-D Mesh Sequence Using Temporal Wavelet Transform of Vertex Norms (꼭지점 좌표 벡터 크기값의 시간축 웨이블릿 변환을 이용한 3차원 메쉬 시퀀스의 블라인드 워터마킹)

  • Kim, Min-Su;Cho, Jae-Won;Prost, Remy;Jung, Ho-Youl
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.3C
    • /
    • pp.256-268
    • /
    • 2007
  • In this paper, we present a watermarking method for 3-D mesh sequences. The main idea is to transform vertex norm with the identical connectivity index along temporal axis using wavelet transform and modify the distribution of wavelet coefficients in temporally high (or middle) frequency frames according to watermark bit to be embedded. All vertices are divided into groups, namely bin, using the distribution of coefficients in low frequency frames. As the vertices with the identical connectivity index over whole frames belong to one bin, their wavelet coefficients are also assigned into the same bin. Then, the watermark is embedded into the wavelet coefficients of vertex norm. Due to the use of the distribution, our method can retrieve the hidden watermark without any information about original mesh sequences in the process of watermark detection. Through simulations, we show that the proposed is flirty robust against various attacks that are probably concerned in copyright protection of 3-D mesh sequences.

SNR Scalable Coding of 3-D Mesh Sequences Based on Singular Value Decomposition (특이값 분해에 기반한 3차원 메쉬 동영상의 SNR 계층 부호화)

  • Heu, Jun-Hee;Kim, Chang-Su;Lee, Sang-Uk
    • Journal of Broadcast Engineering
    • /
    • v.13 no.3
    • /
    • pp.289-298
    • /
    • 2008
  • We propose an SNR-scalable coding algorithm for three-dimensional mesh sequences based on singular value decomposition (SVD). SVD achieves a coding gain by representing a mesh sequence with a small number of basis vectors and singular values. First, we introduce a bit plane coding scheme and derive a quantitative relationship between each bit plane and the reconstructed image quality. Using the relationship, we develop a rate-distortion (RD) optimized coding algorithm. Moreover, we propose prediction techniques to exploit the spatio-temporal correlations in real mesh sequences. Simulation results demonstrate that the proposed algorithm provides significantly better RD performance than conventional SVD coders.

Animated Mesh Compression with Semi-regular Remeshing (준균일 메쉬 재구성를 이용한 메쉬 시퀀스 압축 기법)

  • Ahn, Min-Su
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.5
    • /
    • pp.76-83
    • /
    • 2009
  • This paper presents a compression method for animated meshes or mesh sequences which have a shared connectivity and geometry streams. Our approach is based on static semi-regular mesh compression algorithm introduced by Khodakovky et al. Our encoding algorithm consists of two stages. First, the proposed technique creates a semi-regular mesh sequence from an input irregular mesh sequence. For semi-regular remeshing of irregular mesh sequences, this paper adapts the MAPS algorithm. However, MAPS cannot directly be performed to the input irregular mesh sequence. Thus, the proposed remesh algorithm revises the MAPS remesher using the clustering information, which classify coherent parts during the animation. The second stage uses wavelet transformation and clustering information to compress geometries of mesh sequences efficiently. The proposed compression algorithm predicts the vertex trajectories using the clustering information and the cluster transformation during the animation and compress the difference other frames from the reference frame in order to reduce the range of 3D position values.

Decomposition-Based Simplification of Machined Part in Solid Model (볼륨분해를 이용한 절삭가공부품 솔리드 모델의 단순화)

  • Woo, Yonn-Hwan
    • Korean Journal of Computational Design and Engineering
    • /
    • v.12 no.2
    • /
    • pp.101-108
    • /
    • 2007
  • As 3D solid modeling has been widely used in designing products, solid models of the products are directly used in various applications such as engineering analysis and process planing. However, the fully-detailed solid models may not be necessary in some application. For example, it is often more efficient to use simplified model of part of engineering analysis. Generation of mesh for the complex original model requires a quite amount of time, and the consequence of finite element analysis may not be desirable due to small and detailed geometry in the model. In this paper, a method to simplify solid models of machined part is presented. This method decomposes the delta volume of machined part, and uses the decomposed volumes to simplify the solid model. Since this method directly recognizes the features to be removed from the final model, it is independent of not only design features of specific CAD system, but also designer's design practice of design sequences.