EP1869642A1 - Verfahren und vorrichtung zum kodieren/dekodieren von dreidimensionalen netzinformationen - Google Patents

Verfahren und vorrichtung zum kodieren/dekodieren von dreidimensionalen netzinformationen

Info

Publication number
EP1869642A1
EP1869642A1 EP06747358A EP06747358A EP1869642A1 EP 1869642 A1 EP1869642 A1 EP 1869642A1 EP 06747358 A EP06747358 A EP 06747358A EP 06747358 A EP06747358 A EP 06747358A EP 1869642 A1 EP1869642 A1 EP 1869642A1
Authority
EP
European Patent Office
Prior art keywords
order information
element order
information
encoding
dimensional mesh
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP06747358A
Other languages
English (en)
French (fr)
Other versions
EP1869642A4 (de
Inventor
Eun Young Chang
Nam Ho Hur
Soo In Lee
Euee Seon Jang
Dai Yong Kim
Byeong Wook Min
Sun Young Lee
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Electronics and Telecommunications Research Institute ETRI
Industry University Cooperation Foundation IUCF HYU
Industry University Cooperation Foundation of Sogang University
Original Assignee
Electronics and Telecommunications Research Institute ETRI
Industry University Cooperation Foundation IUCF HYU
Industry University Cooperation Foundation of Sogang University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from KR20060031078A external-priority patent/KR100747489B1/ko
Application filed by Electronics and Telecommunications Research Institute ETRI, Industry University Cooperation Foundation IUCF HYU, Industry University Cooperation Foundation of Sogang University filed Critical Electronics and Telecommunications Research Institute ETRI
Publication of EP1869642A1 publication Critical patent/EP1869642A1/de
Publication of EP1869642A4 publication Critical patent/EP1869642A4/de
Withdrawn legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T9/00Image coding
    • G06T9/001Model-based coding, e.g. wire frame
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/46Embedding additional information in the video signal during the compression process
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/70Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by syntax aspects related to video coding, e.g. related to compression standards

Definitions

  • the present invention relates to encoding/decoding three-dimensional
  • dimensional model includes geometric information, inter-vertex connectivity
  • property information such as color, normal, and texture
  • the geometric information includes information about three
  • the connectivity information is represented by an index list in which three or more vertices form one polygon.
  • mesh model is represented by approximately ten thousand vertices having only
  • MPEG-4 Moving Picture Expert Group
  • SNHC Synthetic and Natural
  • Hybrid Coding improves transmission efficiency by encoding/decoding three-
  • IFS IndexedFaceSet
  • VRML Virtual Reality Modeling Language
  • FIGS. Ia and Ib respectively illustrate conceptual configurations of
  • encoding device 110 includes a topological surgery module 111 for
  • the 3DMC decoding device 120 includes an entropy decoding
  • encoding device 110 includes, as a primary characteristic, a topological
  • a simple polygonal graph e.g., a triangle tree (TT) having a binary tree
  • the present invention is directed to implementation of a method
  • the present invention is also directed to implementation of a method
  • bit rate by encoding element order information while sequentially
  • One aspect of the present invention provides a method for encoding
  • the method includes the steps of
  • bit-stream calculating order information of at least one element in an original model contained in the three-dimensional mesh information; encoding the
  • the element order information in the original model may be at least
  • order information may be calculated in an IFS unit or a CC unit.
  • the step of encoding the element order information may include the
  • Another aspect of the present invention provides a method for
  • the method includes the steps of:
  • Still another aspect of the present invention provides a method for
  • the method includes the
  • Yet another aspect of the present invention provides a method for
  • the method includes the steps of extracting element order
  • Yet another aspect of the present invention provides an apparatus for
  • the apparatus includes
  • bit-stream means for calculating order information of at least one element in
  • information encoding means for encoding the element order information; and means for generating packets of the encoded bit-stream, wherein the element
  • Yet another aspect of the present invention provides an apparatus for
  • the apparatus includes
  • FIGS. Ia and Ib respectively illustrate conceptual configurations of
  • FIG. 2a and 2b are schematic block diagrams illustrating a 3DMC
  • FIG. 3 is a flowchart illustrating a process of encoding three-
  • FIG. 4 is a flowchart illustrating a process of decoding three-
  • FIG. 5 is a flowchart illustrating a process of encoding element order
  • FIG. 6 is a flowchart illustrating a process of decoding element order
  • FIGS. 7a and 7b illustrate an exemplary structure of a 3DMC packet
  • FIG. 8 illustrates a CC structure on IFS of a horse model
  • FIGS. 9a, 9b and 9c illustrate an example of a header portion of
  • FIG. 2a and 2b are schematic block diagrams illustrating a 3DMC
  • FIGS. 2a and 2b are exemplary embodiments of the present invention.
  • the three-dimensional mesh information encoding device 210 includes a
  • topological surgery module 211 a geometric information encoding module
  • the encoding device 210 is characterized by
  • the element order encoding module 216 for separately encoding element order
  • decoding module 225 for decoding encoded element order information, and a
  • rearranging module 227 for rearranging reconstructed three-dimensional
  • decoding module (225 of FIG. 2b) is vertex order information. However, the
  • present invention is not limited to the vertex order information.
  • present invention is not limited to the vertex order information.
  • face order information may be encoded/decoded
  • both the vertex order information and the face order information are both the vertex order information and the face order information
  • the rearranging module 227 may perform a post-process
  • FIG. 3 is a flowchart illustrating a process of encoding three-
  • the three-dimensional mesh information is
  • VG vertex graph
  • TT triangle tree
  • order information of vertices may be calculated.
  • face order information may be calculated.
  • both vertex and face order information are included in both vertex and face order information.
  • step S330 the calculated element order information is encoded.
  • the element order information is
  • step S340 packets for the three-dimensional mesh information bit-
  • the element order information is
  • Steps S310 to S340 are not necessarily performed in the above-
  • FIG. 4 is a flowchart illustrating a process of decoding a three-
  • the three-dimensional mesh information packets are of the present invention.
  • step S410 are decoded in step S410.
  • the decoding performed here is known in the art
  • step S420 a determination is made as to whether the element order
  • a prescribed area e.g.,
  • step S420 If it is determined in step S420 that the element order information is
  • the element order information is extracted in
  • step S430 and the extracted element order information is decoded in step S440.
  • step S450 a reconstructed model is rearranged in the same order as the
  • step S440, and the decoding step S450 may be performed prior to the 3DMC
  • the present invention is further characterized by
  • codewords allocated to the element order information such as a vertex order
  • the codewords allocated upon encoding the vertex order information in an IFS unit according to the present invention are the codewords allocated upon encoding the vertex order information in an IFS unit according to the present invention.
  • codeword values are not necessarily allocated in the ascending order, but may be allocated using several methods including a
  • the last order information may be encoded with "0" and transmitted
  • FIG. 5 is a flowchart illustrating a process of encoding element order
  • step 510b to 560b encoding the face order information
  • the vertex order information, the face order information, or both the vertex and face order information may be
  • nV denotes a total number of vertices constituting
  • step 510a If the total vertex number nV is 6, the bpvi
  • Coding_Vertices nV - 2 (bpvM)
  • the present invention is not limited to such a calculating scheme.
  • Coding_Vertices value may be determined as 7> vmA ⁇
  • the total vertex number nV is then decremented by the encoded
  • step 540a vertex number, CodingJVertices (step 540a), and a determination is made as to
  • step 550a whether a total number of remaining vertices, nV, is one (step 550a).
  • steps 510b to 560b will be omitted.
  • FIG. 6 is a flowchart illustrating a process of decoding element order
  • Equation 2 bpvi ' '
  • Decoding Vertices is then calculated by Equation 3 (step 620a):
  • DecodingJVertices may be contained in the encoded vertex
  • vertex number nV is decremented by the decoded vertex number
  • steps 610b to 660b decode an nF number of face order
  • FIG. 7a shows an example in which element order information is
  • element order information may be calculated in a connected
  • FIG. 7b shows an example in which element order
  • VO and FO respectively include order information of the vertices
  • a 2-bit "vertex_face_order_flag" flag may be
  • the element order information may be inserted
  • an element order information value calculated in the IFS unit may be simply
  • calculated in the IFS unit may be converted to an element order information
  • the use of the IFS unit allows the
  • the second CC is
  • the third CC is composed of 300 vertices having order information values from 300 to 599
  • the third CC is composed of 300 vertices having order information values
  • the order information having values of 600 to 899 can be
  • CC composition on the IFS may have several structures.
  • each CC may be not sequentially connected.
  • a CC composition of a horse model is shown in FIG. 8.
  • the IFS is composed of three CCs,
  • the first CC is composed of 10,811 vertices having values from 0 to
  • the second CC is composed of 162 vertices having values from 3,200
  • the third CC is composed of 162 vertices having values from
  • the problem may be solved by providing the offset value to each
  • the horse model allows the offset values to be provided
  • CC #1 ⁇ 0, 1, 2,..., 3199, 3524, 3525, ..., 11134 ⁇
  • the CC unit is the same as the process of encoding the vertex order
  • vertex order information is set as ' ' (where, nC-V is a total number of vertices constituting the i-th CC).
  • nCiF number of face order information is also the same as the process of
  • vertex order information is set as ' 2 ' (where, nC t V is a total
  • initial value of the allocated codeword bit number (bit per vertices information: bpvi) of the face order information is set as ' 2 2 '
  • TiC 1 F is a total number of vertices constituting the i-th CC.
  • a corresponding offset value in the header information may be
  • FIGS. 9a, 9b and 9c illustrate one example of the structure of a header
  • the header information includes a
  • header structure is illustrative, and representation
  • the present invention described above may be provided as a
  • computer-readable medium may be a floppy disk, a hard disk, a CD ROM, a
  • flash memory card a PROM, a RAM, a ROM, or a magnetic tape.
  • PROM programmable read-only memory
  • RAM random access memory
  • ROM read-only memory
  • magnetic tape a magnetic tape
  • the computer program may be written in any programming language.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
EP06747358A 2005-04-13 2006-04-13 Verfahren und vorrichtung zum kodieren/dekodieren von dreidimensionalen netzinformationen Withdrawn EP1869642A4 (de)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
KR20050030853 2005-04-13
KR20050096261 2005-10-12
KR20060031078A KR100747489B1 (ko) 2005-04-13 2006-04-05 3차원 메쉬 정보의 부호화/복호화 방법 및 장치
PCT/KR2006/001363 WO2006110002A1 (en) 2005-04-13 2006-04-13 Method and apparatus for encoding/decoding 3d mesh information

Publications (2)

Publication Number Publication Date
EP1869642A1 true EP1869642A1 (de) 2007-12-26
EP1869642A4 EP1869642A4 (de) 2011-06-29

Family

ID=37087243

Family Applications (1)

Application Number Title Priority Date Filing Date
EP06747358A Withdrawn EP1869642A4 (de) 2005-04-13 2006-04-13 Verfahren und vorrichtung zum kodieren/dekodieren von dreidimensionalen netzinformationen

Country Status (2)

Country Link
EP (1) EP1869642A4 (de)
WO (1) WO2006110002A1 (de)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP5232799B2 (ja) * 2007-01-11 2013-07-10 韓國電子通信研究院 スティチング情報を含む3dメッシュ情報を符号化/復号する方法及び装置
EP2147557B1 (de) * 2007-04-18 2012-04-18 Gottfried Wilhelm Leibniz Universität Hannover Skalierbare komprimierung zeitkonsistenter 3d-netzwerksequenzen
US8044830B2 (en) * 2007-09-20 2011-10-25 Lg Electronics Inc. Method and an apparatus for processing a signal
WO2009128617A2 (en) * 2008-04-18 2009-10-22 Electronics And Telecommunications Research Institute Apparatus and method for low-complexity three-dimensional mesh compression
WO2013067629A1 (fr) * 2011-11-10 2013-05-16 Parallel Geometry Inc. Méthode et système pour coder de l'information
US9633473B2 (en) 2012-02-09 2017-04-25 Thomson Licensing Efficient compression of 3D models based on octree decomposition

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1998041023A1 (en) * 1997-03-11 1998-09-17 Sharp Kabushiki Kaisha Methods of coding the order information for multiple-layer vertices
WO2003007246A1 (en) * 2001-07-09 2003-01-23 Superscape Group Plc Mesh compression

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100294926B1 (ko) * 1998-08-29 2001-07-12 윤종용 점진적인 삼차원 메쉬 정보의 부호화/복호화 방법 및 장치
KR100513732B1 (ko) * 2002-12-05 2005-09-08 삼성전자주식회사 3차원 객체 데이터 부호화 및 복호화 방법 및 장치

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1998041023A1 (en) * 1997-03-11 1998-09-17 Sharp Kabushiki Kaisha Methods of coding the order information for multiple-layer vertices
WO2003007246A1 (en) * 2001-07-09 2003-01-23 Superscape Group Plc Mesh compression

Non-Patent Citations (6)

* Cited by examiner, † Cited by third party
Title
David Salomon: "Data compression : The Complete Reference - Chapter 2 Statistical methods" In: "Data compression : The Complete Reference - Chapter 2 Statistical methods", 1 January 1997 (1997-01-01), Springer-Verlag, XP055046023, ISBN: 978-0-38-798280-9 pages 21-100, * the whole document * *
EUEE S JANG ET AL: "Technical Issues in 3D mesh compression", ITU STUDY GROUP 16 - VIDEO CODING EXPERTS GROUP -ISO/IEC MPEG & ITU-T VCEG(ISO/IEC JTC1/SC29/WG11 AND ITU-T SG16 Q6), XX, XX, no. M11623, 13 January 2005 (2005-01-13), XP030040368, *
EUN-YOUNG CHANG ET AL: "3DMC extension for efficient animation support", ITU STUDY GROUP 16 - VIDEO CODING EXPERTS GROUP -ISO/IEC MPEG & ITU-T VCEG(ISO/IEC JTC1/SC29/WG11 AND ITU-T SG16 Q6), XX, XX, no. M11938, 29 April 2005 (2005-04-29), XP030040646, *
EUN-YOUNG CHANG ET AL: "CE Results on 3DMC Revision for AFX amd. 2", ITU STUDY GROUP 16 - VIDEO CODING EXPERTS GROUP -ISO/IEC MPEG & ITU-T VCEG(ISO/IEC JTC1/SC29/WG11 AND ITU-T SG16 Q6), XX, XX, no. M12553, 12 October 2005 (2005-10-12), XP030041223, *
GABRIEL TAUBIN ET AL: "Geometric Compression through Topological Surgery", ITU STUDY GROUP 16 - VIDEO CODING EXPERTS GROUP -ISO/IEC MPEG & ITU-T VCEG(ISO/IEC JTC1/SC29/WG11 AND ITU-T SG16 Q6), XX, XX, no. M3059, 23 January 1998 (1998-01-23), XP030032332, *
See also references of WO2006110002A1 *

Also Published As

Publication number Publication date
WO2006110002A1 (en) 2006-10-19
EP1869642A4 (de) 2011-06-29

Similar Documents

Publication Publication Date Title
US8131094B2 (en) Method and apparatus for encoding/decoding 3D mesh information
KR100294927B1 (ko) 점진적인 삼차원 메쉬 정보의 부호화 방법 및 그 장치
Taubin et al. Geometric compression through topological surgery
JP5232799B2 (ja) スティチング情報を含む3dメッシュ情報を符号化/復号する方法及び装置
EP2697985B1 (de) Verfahren und vorrichtung zur codierung eines mesh-modells, codiertes mesh-modell sowie verfahren zur decodierung eines mesh-modells
JP5033261B2 (ja) 共有頂点情報を用いた低複雑度3次元メッシュ圧縮装置及び方法
KR100927601B1 (ko) 3차원 메쉬 정보의 부호화/복호화 방법 및 장치
US11348260B2 (en) Methods and devices for encoding and reconstructing a point cloud
US8462149B2 (en) Method and apparatus for real time 3D mesh compression, based on quanitzation
US20090080516A1 (en) Method of encoding and decoding texture coordinates in three-dimensional mesh information for effective texture mapping
KR101268508B1 (ko) 스티칭 정보를 포함하는 3차원 메쉬 정보부호화/복호화 방법 및 장치
WO2006110002A1 (en) Method and apparatus for encoding/decoding 3d mesh information
JP2000194843A (ja) エラ―回復性を有する漸進的三次元メッシュ情報の符号化/復号化方法
KR20060087647A (ko) 3차원 삼각 메쉬의 연결 정보 데이터 단순 압축및 해제의 기술.
KR20060088136A (ko) 3차원 사각 메쉬의 연결 정보 데이터 단순 압축및 해제의 기술.
WO2006075895A1 (en) Method of encoding and decoding texture coordinates in three-dimensional mesh information for effective texture mapping
KR100294923B1 (ko) 손실 탄력성을 갖는 점진적 삼차원 메쉬 정보의 부호화/복호화방법
WO2023047119A1 (en) Point cloud data frames compression
KR20090110776A (ko) 저복잡도 3차원 메쉬 압축 장치 및 방법
CN106412599A (zh) 动态图像预测解码方法、动态图像预测解码装置
KR101086772B1 (ko) 양자화 기법에 기반한 3차원 메쉬 압축 장치 및 방법
Park et al. Topological surgery encoding improvements based on adaptive bit allocation and DFSVQ
KR20240073054A (ko) 포인트 클라우드 데이터 프레임 압축
Isenburg et al. Graph coding and connectivity compression
CN116894015A (zh) 一种面向输电运检场景的vrml文件二进制压缩编码方法

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20070921

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR

DAX Request for extension of the european patent (deleted)
A4 Supplementary search report drawn up and despatched

Effective date: 20110531

RIC1 Information provided on ipc code assigned before grant

Ipc: G06T 9/20 20060101AFI20061103BHEP

Ipc: G06T 17/20 20060101ALI20110525BHEP

Ipc: H04N 7/26 20060101ALI20110525BHEP

Ipc: H03M 7/00 20060101ALI20110525BHEP

17Q First examination report despatched

Effective date: 20121212

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20130423