Cookies
Usamos cookies para melhorar nosso site e a sua experiência. Ao continuar a navegar no site, você aceita a nossa política de cookies. Ver mais
Fechar
  • Menu
Sobre

Sobre

Luís Paulo Peixoto dos Santos é actualmente Professor Auxiliar do Departamento de Informática, Universidade do Minho e investigador do CSIG, INESC-TEC. A sua área de investigação é a Iluminação Global, com especial ênfase no desempenho dos algortimos e o recurso à Computação Paralela Heterogénea (CPU + GPU + Knights Landing) para diminuir o tempo de convergência para soluções perceptualmente correctas. Publicou algumas dezenas de artigos nos mais prestigiados fóruns internacionais (conferências e revistas) desta área do cohecimento, sendo tambem autor de um livro em Bayesian Monte Carlo Rendering. Integra a Comissão de Programa de várias conferências internacionais, tendo presidido a algumas destas comissões e organizado 6 conferências em Portugal.

Foi Vice-Director do Departamento de Informática, Vice-Director da Licenciatura em Engenharia Informática, bem como do Mestrado em Engenhraia Informática. Foi Director do Programa Doutoral em Engenharia Informática. Integrou a Comissão designada por iniciativa reitoral para coordenar a instalação da Unidade Operacional em Governação Electrónica da Universidade das Nações Unidas em Portugal, especificamente no Campus de Couros da Universidade do Minho, Guimarães, integrando actualmente o corpo directivo da unidade EGOV-UM que assegura o interface entre as duas instituições.  

É Editor Associado da revista Computers & Graphics e Presidente da Direcção do Grupo Português de Computação Gráfica (secção portuguesa da Eurographics) para o biénio 2017-2018.

Tópicos
de interesse
Detalhes

Detalhes

  • Nome

    Luís Paulo Santos
  • Cluster

    Informática
  • Cargo

    Investigador Afiliado
  • Desde

    01 janeiro 2017
Publicações

2013

clOpenCL - Supporting Distributed Heterogeneous Computing in HPC Clusters

Autores
Alves, A; Rufino, J; Pina, A; Santos, LP;

Publicação
EURO-PAR 2012: PARALLEL PROCESSING WORKSHOPS

Abstract
Clusters that combine heterogeneous compute device architectures, coupled with novel programming models, have created a true alternative to traditional (homogeneous) cluster computing, allowing to leverage the performance of parallel applications. In this paper we introduce clOpenCL, a platform that supports the simple deployment and efficient running of OpenCL-based parallel applications that may span several cluster nodes, expanding the original single-node OpenCL model. clOpenCL is deployed through user level services, thus allowing OpenCL applications from different users to share the same cluster nodes and their compute devices. Data exchanges between distributed clOpenCL components rely on Open-MX, a high-performance communication library. We also present extensive experimental data and key conditions that must be addressed when exploiting clOpenCL with real applications.

2013

Interactive high fidelity visualization of complex materials on the GPU

Autores
Silva, N; Santos, LP;

Publicação
COMPUTERS & GRAPHICS-UK

Abstract
High fidelity interactive rendering is of major importance for footwear designers, since it allows experimenting with virtual prototypes of new products, rather than producing expensive physical mock-ups. This requires capturing the appearance of complex materials using image based approaches, such as the Bidirectional Texture Function (BTF), to allow subsequent interactive visualization, while still maintaining the capability to edit the materials' appearance. However, interactive global illumination rendering of compressed editable BTFs with ordinary computing resources remains to be demonstrated. In this paper we demonstrate interactive global illumination by using a GPU ray tracing engine and the Sparse Parametric Mixture Model representation of BTFs, which is particularly well suited for BTF editing. We propose a rendering pipeline and data layout which allow for interactive frame rates and provide a scalability analysis with respect to the scene's complexity. We also include soft shadows from area light sources and approximate global illumination with ambient occlusion by resorting to progressive refinement, which quickly converges to a high quality image while maintaining interactive frame rates by limiting the number of rays shot per frame. Acceptable performance is also demonstrated under dynamic settings, including camera movements, changing lighting conditions and dynamic geometry.

2013

A Spherical Gaussian Framework for Bayesian Monte Carlo Rendering of Glossy Surfaces

Autores
Marques, R; Bouville, C; Ribardiere, M; Santos, LP; Bouatouch, K;

Publicação
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS

Abstract
The Monte Carlo method has proved to be very powerful to cope with global illumination problems but it remains costly in terms of sampling operations. In various applications, previous work has shown that Bayesian Monte Carlo can significantly outperform importance sampling Monte Carlo thanks to a more effective use of the prior knowledge and of the information brought by the samples set. These good results have been confirmed in the context of global illumination but strictly limited to the perfect diffuse case. Our main goal in this paper is to propose a more general Bayesian Monte Carlo solution that allows dealing with nondiffuse BRDFs thanks to a spherical Gaussian-based framework. We also propose a fast hyperparameters determination method that avoids learning the hyperparameters for each BRDF. These contributions represent two major steps toward generalizing Bayesian Monte Carlo for global illumination rendering. We show that we achieve substantial quality improvements over importance sampling at comparable computational cost.

2013

Spherical fibonacci point sets for illumination integrals

Autores
Marques, R; Bouville, C; Ribardiere, M; Santos, LP; Bouatouch, K;

Publicação
Computer Graphics Forum

Abstract
Quasi-Monte Carlo (QMC) methods exhibit a faster convergence rate than that of classic Monte Carlo methods. This feature has made QMC prevalent in image synthesis, where it is frequently used for approximating the value of spherical integrals (e.g. illumination integral). The common approach for generating QMC sampling patterns for spherical integration is to resort to unit square low-discrepancy sequences and map them to the hemisphere. However such an approach is suboptimal as these sequences do not account for the spherical topology and their discrepancy properties on the unit square are impaired by the spherical projection. In this paper we present a strategy for producing high-quality QMC sampling patterns for spherical integration by resorting to spherical Fibonacci point sets. We show that these patterns, when applied to illumination integrals, are very simple to generate and consistently outperform existing approaches, both in terms of root mean square error (RMSE) and image quality. Furthermore, only a single pattern is required to produce an image, thanks to a scrambling scheme performed directly in the spherical domain. Quasi-Monte Carlo (QMC) methods exhibit a faster convergence rate than that of classic Monte Carlo methods. This feature has made QMC prevalent in image synthesis, where it is frequently used for approximating the value of spherical integrals (e.g. illumination integral). The common approach for generating QMC sampling patterns for spherical integration is to resort to unit square low-discrepancy sequences and map them to the hemisphere. However such an approach is suboptimal as these sequences do not account for the spherical topology and their discrepancy properties on the unit square are impaired by the spherical projection. © 2013 The Authors Computer Graphics Forum © 2013 The Eurographics Association and John Wiley & Sons Ltd.

Teses
supervisionadas

2016

0

Autor
Rosária Maria Afonso Rodrigues de Melo

Instituição
UP-FCNA