1 resultado para on-ramp queue estimation
em Digital Peer Publishing
Filtro por publicador
- KUPS-Datenbank - Universität zu Köln - Kölner UniversitätsPublikationsServer (1)
- Aberdeen University (1)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (2)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (1)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- Aquatic Commons (20)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (15)
- Aston University Research Archive (8)
- Biblioteca Digital - Universidad Icesi - Colombia (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (2)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (6)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (20)
- Bulgarian Digital Mathematics Library at IMI-BAS (9)
- CaltechTHESIS (6)
- Cambridge University Engineering Department Publications Database (115)
- CentAUR: Central Archive University of Reading - UK (22)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (23)
- Coffee Science - Universidade Federal de Lavras (1)
- Collection Of Biostatistics Research Archive (5)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (2)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- Dalarna University College Electronic Archive (1)
- Digital Commons - Michigan Tech (1)
- Digital Commons at Florida International University (6)
- Digital Peer Publishing (1)
- DigitalCommons@The Texas Medical Center (2)
- DigitalCommons@University of Nebraska - Lincoln (1)
- Diposit Digital de la UB - Universidade de Barcelona (1)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (1)
- DRUM (Digital Repository at the University of Maryland) (1)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (11)
- Helda - Digital Repository of University of Helsinki (25)
- Indian Institute of Science - Bangalore - Índia (227)
- Instituto Politécnico do Porto, Portugal (3)
- National Center for Biotechnology Information - NCBI (1)
- Nottingham eTheses (1)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (2)
- Publishing Network for Geoscientific & Environmental Data (3)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (28)
- Queensland University of Technology - ePrints Archive (289)
- Repositório Alice (Acesso Livre à Informação Científica da Embrapa / Repository Open Access to Scientific Information from Embrapa) (1)
- Repositório Científico da Universidade de Évora - Portugal (2)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (7)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (15)
- Repositorio Institucional Universidad de Medellín (1)
- Research Open Access Repository of the University of East London. (1)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (1)
- SAPIENTIA - Universidade do Algarve - Portugal (1)
- Universidad de Alicante (3)
- Universidad del Rosario, Colombia (2)
- Universidad Politécnica de Madrid (21)
- Universidade Complutense de Madrid (2)
- Universidade Federal do Rio Grande do Norte (UFRN) (1)
- Universitat de Girona, Spain (2)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Montréal, Canada (3)
- Université Laval Mémoires et thèses électroniques (1)
- University of Michigan (11)
- University of Queensland eSpace - Australia (10)
- WestminsterResearch - UK (1)
Resumo:
We consider the problem of approximating the 3D scan of a real object through an affine combination of examples. Common approaches depend either on the explicit estimation of point-to-point correspondences or on 2-dimensional projections of the target mesh; both present drawbacks. We follow an approach similar to [IF03] by representing the target via an implicit function, whose values at the vertices of the approximation are used to define a robust cost function. The problem is approached in two steps, by approximating first a coarse implicit representation of the whole target, and then finer, local ones; the local approximations are then merged together with a Poisson-based method. We report the results of applying our method on a subset of 3D scans from the Face Recognition Grand Challenge v.1.0.