1 resultado para Axial compression
em Digital Peer Publishing
Filtro por publicador
- Aberdeen University (3)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (4)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (2)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (8)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (1)
- Archimer: Archive de l'Institut francais de recherche pour l'exploitation de la mer (2)
- Archive of European Integration (2)
- Aston University Research Archive (53)
- Biblioteca de Teses e Dissertações da USP (3)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (16)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (161)
- Biblioteca Virtual del Sistema Sanitario Público de Andalucía (BV-SSPA), Junta de Andalucía. Consejería de Salud y Bienestar Social, Spain (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (79)
- Brock University, Canada (2)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (10)
- CaltechTHESIS (1)
- CentAUR: Central Archive University of Reading - UK (11)
- CiencIPCA - Instituto Politécnico do Cávado e do Ave, Portugal (5)
- Cochin University of Science & Technology (CUSAT), India (9)
- Consorci de Serveis Universitaris de Catalunya (CSUC), Spain (8)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- Department of Computer Science E-Repository - King's College London, Strand, London (3)
- Digital Commons - Michigan Tech (2)
- Digital Commons at Florida International University (4)
- Digital Peer Publishing (1)
- DigitalCommons - The University of Maine Research (1)
- DigitalCommons@The Texas Medical Center (2)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (25)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (2)
- FUNDAJ - Fundação Joaquim Nabuco (1)
- Gallica, Bibliotheque Numerique - Bibliothèque nationale de France (French National Library) (BnF), France (8)
- Institute of Public Health in Ireland, Ireland (2)
- Institutional Repository of Leibniz University Hannover (1)
- INSTITUTO DE PESQUISAS ENERGÉTICAS E NUCLEARES (IPEN) - Repositório Digital da Produção Técnico Científica - BibliotecaTerezine Arantes Ferra (1)
- Instituto Gulbenkian de Ciência (3)
- Instituto Politécnico de Bragança (1)
- Instituto Politécnico de Leiria (2)
- Instituto Politécnico do Porto, Portugal (9)
- Iowa Publications Online (IPO) - State Library, State of Iowa (Iowa), United States (3)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (2)
- Martin Luther Universitat Halle Wittenberg, Germany (2)
- National Center for Biotechnology Information - NCBI (4)
- Nottingham eTheses (3)
- Publishing Network for Geoscientific & Environmental Data (34)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (2)
- ReCiL - Repositório Científico Lusófona - Grupo Lusófona, Portugal (1)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (29)
- Repositório da Produção Científica e Intelectual da Unicamp (22)
- Repositório da Universidade Federal do Espírito Santo (UFES), Brazil (5)
- Repositório digital da Fundação Getúlio Vargas - FGV (1)
- Repositório do Centro Hospitalar de Lisboa Central, EPE - Centro Hospitalar de Lisboa Central, EPE, Portugal (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional da Universidade Estadual de São Paulo - UNESP (3)
- Repositorio Institucional de la Universidad de El Salvador (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (83)
- Repositorio Institucional UNISALLE - Colombia (1)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (2)
- Savoirs UdeS : plateforme de diffusion de la production intellectuelle de l’Université de Sherbrooke - Canada (4)
- School of Medicine, Washington University, United States (2)
- Scielo Saúde Pública - SP (24)
- Universidad Autónoma de Nuevo León, Mexico (3)
- Universidad de Alicante (5)
- Universidad Politécnica de Madrid (28)
- Universidade de Lisboa - Repositório Aberto (1)
- Universidade do Minho (6)
- Universidade Federal do Pará (8)
- Universidade Federal do Rio Grande do Norte (UFRN) (3)
- Universitat de Girona, Spain (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Lausanne, Switzerland (49)
- Université de Montréal, Canada (2)
- University of Connecticut - USA (3)
- University of Michigan (25)
- University of Queensland eSpace - Australia (102)
- University of Washington (2)
- WestminsterResearch - UK (1)
Resumo:
This paper proposes a new compression algorithm for dynamic 3d meshes. In such a sequence of meshes, neighboring vertices have a strong tendency to behave similarly and the degree of dependencies between their locations in two successive frames is very large which can be efficiently exploited using a combination of Predictive and DCT coders (PDCT). Our strategy gathers mesh vertices of similar motions into clusters, establish a local coordinate frame (LCF) for each cluster and encodes frame by frame and each cluster separately. The vertices of each cluster have small variation over a time relative to the LCF. Therefore, the location of each new vertex is well predicted from its location in the previous frame relative to the LCF of its cluster. The difference between the original and the predicted local coordinates are then transformed into frequency domain using DCT. The resulting DCT coefficients are quantized and compressed with entropy coding. The original sequence of meshes can be reconstructed from only a few non-zero DCT coefficients without significant loss in visual quality. Experimental results show that our strategy outperforms or comes close to other coders.