Lizeth Joseline Fuentes Perez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Lizeth Joseline Fuentes Perez has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Luciano Arnaldo Romero Calla
University of Zürich
6 shared publications - Renato Pajarola
University of Zurich, Zurich, Switzerland
4 shared publications - Anselmo Antunes Montenegro
Universidade Federal Fluminense
3 shared publications - Cristian Lopez
Universidad La Salle
3 shared publications - Claudio Mura
Visualization and MultiMedia Lab University of Zurich Switzerland
2 shared publications Luis Valente
2 shared publications
Latest Publications
- Open Access
- 12 January 2024
- Published by Wiley in Computer Graphics Forum
- Vol. 43 (1)
PPSurf: Combining Patches and Point Convolutions for Detailed Surface Reconstruction
3D surface reconstruction from point clouds is a key step in areas such as content creation, archaeology, digital cultural heritage and engineering. Current approaches either try to optimize a non‐data‐driven surface representation to fit the points, or learn a data‐driven prior over the distribution of commonly occurring surfaces and how they correlate with potentially noisy point clouds. Data‐driven methods enable robust handling of noise and typically either focus on a global or a local prior, which trade‐off between robustness to noise on the global end and surface detail preservation on the local end. We propose PPSurf as a method that combines a global prior based on point convolutions and a local prior based on processing local point cloud patches. We show that this approach is robust to noise while recovering surface details more accurately than the current state‐of‐the‐art. Our source code, pre‐trained model and dataset are available at https://github.com/cg‐tuwien/ppsurf.
- 12 January 2024
- Published by Wiley in Computer Graphics Forum
- Vol. 43 (1)
Open AccessPPSurf: Combining Patches and Point Convolutions for Detailed Surface Reconstruction
3D surface reconstruction from point clouds is a key step in areas such as content creation, archaeology, digital cultural heritage and engineering. Current approaches either try to optimize a non‐data‐driven surface representation to fit the points, or learn a data‐driven prior over the distribution of commonly occurring surfaces and how they correlate with potentially noisy point clouds. Data‐driven methods enable robust handling of noise and typically either focus on a global or a local prior, which trade‐off between robustness to noise on the global end and surface detail preservation on the local end. We propose PPSurf as a method that combines a global prior based on point convolutions and a local prior based on processing local point cloud patches. We show that this approach is robust to noise while recovering surface details more accurately than the current state‐of‐the‐art. Our source code, pre‐trained model and dataset are available at https://github.com/cg‐tuwien/ppsurf.
- Open Access
- 23 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-2
Automatic Architectural Floorplan Reconstruction
- 23 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-2
Open AccessAutomatic Architectural Floorplan Reconstruction
- Open Access
A Robust Feature-aware Sparse Mesh Representation
The sparse representation of signals defined on Euclidean domains has been successfully applied in signal processing. Bringing the power of sparse representations to non-regular domains is still a challenge, but promising approaches have started emerging recently. In this paper, we investigate the problem of sparsely representing discrete surfaces and propose a new representation that is capable of providing tools for solving different geometry processing problems. The sparse discrete surface representation is obtained by combining innovative approaches into an integrated method. First, to deal with irregular mesh domains, we devised a new way to subdivide discrete meshes into a set of patches using a feature-aware seed sampling. Second, we achieve good surface approximation with over-fitting control by combining the power of a continuous global dictionary representation with a modified Orthogonal Marching Pursuit. The discrete surface approximation results produced were able to preserve the shape features while being robust to over-fitting. Our results show that the method is quite promising for applications like surface re-sampling and mesh compression.
Open AccessA Robust Feature-aware Sparse Mesh Representation
The sparse representation of signals defined on Euclidean domains has been successfully applied in signal processing. Bringing the power of sparse representations to non-regular domains is still a challenge, but promising approaches have started emerging recently. In this paper, we investigate the problem of sparsely representing discrete surfaces and propose a new representation that is capable of providing tools for solving different geometry processing problems. The sparse discrete surface representation is obtained by combining innovative approaches into an integrated method. First, to deal with irregular mesh domains, we devised a new way to subdivide discrete meshes into a set of patches using a feature-aware seed sampling. Second, we achieve good surface approximation with over-fitting control by combining the power of a continuous global dictionary representation with a modified Orthogonal Marching Pursuit. The discrete surface approximation results produced were able to preserve the shape features while being robust to over-fitting. Our results show that the method is quite promising for applications like surface re-sampling and mesh compression.
- 1 May 2020
- Published by Wiley in Computer Graphics Forum
- Vol. 39 (2) , 667-699
State‐of‐the‐art in Automatic 3D Reconstruction of Structured Indoor Environments
Creating high‐level structured 3D models of real‐world indoor scenes from captured data is a fundamental task which has important applications in many fields. Given the complexity and variability of interior environments and the need to cope with noisy and partial captured data, many open research problems remain, despite the substantial progress made in the past decade. In this survey, we provide an up‐to‐date integrative view of the field, bridging complementary views coming from computer graphics and computer vision. After providing a characterization of input sources, we define the structure of output models and the priors exploited to bridge the gap between imperfect sources and desired output. We then identify and discuss the main components of a structured reconstruction pipeline, and review how they are combined in scalable solutions working at the building level. We finally point out relevant research issues and analyze research trends.
- 1 May 2020
- Published by Wiley in Computer Graphics Forum
- Vol. 39 (2) , 667-699
State‐of‐the‐art in Automatic 3D Reconstruction of Structured Indoor Environments
Creating high‐level structured 3D models of real‐world indoor scenes from captured data is a fundamental task which has important applications in many fields. Given the complexity and variability of interior environments and the need to cope with noisy and partial captured data, many open research problems remain, despite the substantial progress made in the past decade. In this survey, we provide an up‐to‐date integrative view of the field, bridging complementary views coming from computer graphics and computer vision. After providing a characterization of input sources, we define the structure of output models and the priors exploited to bridge the gap between imperfect sources and desired output. We then identify and discuss the main components of a structured reconstruction pipeline, and review how they are combined in scalable solutions working at the building level. We finally point out relevant research issues and analyze research trends.
- Open Access
A minimalistic approach for fast computation of geodesic distances on triangular meshes
The computation of geodesic distances is an important research topic in Geometry Processing and 3D Shape Analysis as it is a basic component of many methods used in these areas. In this work, we present a minimalistic parallel algorithm based on front propagation to compute approximate geodesic distances on meshes. Our method is practical and simple to implement and does not require any heavy pre-processing. The convergence of our algorithm depends on the number of discrete level sets around the source points from which distance information propagates. To appropriately implement our method on GPUs taking into account memory coalescence problems, we take advantage of a graph representation based on a breadth-first search traversal that works harmoniously with our parallel front propagation approach. We report experiments that show how our method scales with the size of the problem. We compare the mean error and processing time obtained by our method with such measures computed using other methods. Our method produces results in competitive times with almost the same accuracy, especially for large meshes. We also demonstrate its use for solving two classical geometry processing problems: the regular sampling problem and the Voronoi tessellation on meshes.
Open AccessA minimalistic approach for fast computation of geodesic distances on triangular meshes
The computation of geodesic distances is an important research topic in Geometry Processing and 3D Shape Analysis as it is a basic component of many methods used in these areas. In this work, we present a minimalistic parallel algorithm based on front propagation to compute approximate geodesic distances on meshes. Our method is practical and simple to implement and does not require any heavy pre-processing. The convergence of our algorithm depends on the number of discrete level sets around the source points from which distance information propagates. To appropriately implement our method on GPUs taking into account memory coalescence problems, we take advantage of a graph representation based on a breadth-first search traversal that works harmoniously with our parallel front propagation approach. We report experiments that show how our method scales with the size of the problem. We compare the mean error and processing time obtained by our method with such measures computed using other methods. Our method produces results in competitive times with almost the same accuracy, especially for large meshes. We also demonstrate its use for solving two classical geometry processing problems: the regular sampling problem and the Voronoi tessellation on meshes.
- 19 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 24-32
Dynamic Game Difficulty Balancing in Real Time Using Evolutionary Fuzzy Cognitive Maps
Players may cease from playing a chosen gamesooner than expected for many reasons. One of the mostimportant is related to the way game designers and developerscalibrate game challenge levels. In practice, players havedifferent skill levels and may find usual predetermined difficultlevels as too easy or too hard, becoming frustrated or bored. The result may be decreased motivation to keep on playingthe game, which means reduced engagement. An approachto mitigate this issue is dynamic game difficulty balancing(DGB), which is a process that adjusts gameplay parametersin real-time according to the current player skill level. Inthis paper we propose a real-time solution to DGB usingEvolutionary Fuzzy Cognitive Maps, for dynamically balancinga game difficulty, helping to provide a well balanced level ofchallenge to the player. Evolutionary Fuzzy Cognitive Maps arebased on concepts that represent context game variables andare related by fuzzy and probabilistic causal relationships thatcan be updated in real time. We discuss several simulationexperiments that use our solution in a runner type game tocreate more engaging and dynamic game experiences.
- 19 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 24-32
Dynamic Game Difficulty Balancing in Real Time Using Evolutionary Fuzzy Cognitive Maps
Players may cease from playing a chosen gamesooner than expected for many reasons. One of the mostimportant is related to the way game designers and developerscalibrate game challenge levels. In practice, players havedifferent skill levels and may find usual predetermined difficultlevels as too easy or too hard, becoming frustrated or bored. The result may be decreased motivation to keep on playingthe game, which means reduced engagement. An approachto mitigate this issue is dynamic game difficulty balancing(DGB), which is a process that adjusts gameplay parametersin real-time according to the current player skill level. Inthis paper we propose a real-time solution to DGB usingEvolutionary Fuzzy Cognitive Maps, for dynamically balancinga game difficulty, helping to provide a well balanced level ofchallenge to the player. Evolutionary Fuzzy Cognitive Maps arebased on concepts that represent context game variables andare related by fuzzy and probabilistic causal relationships thatcan be updated in real time. We discuss several simulationexperiments that use our solution in a runner type game tocreate more engaging and dynamic game experiences.
- Open Access
- 18 November 2016
- Published by Sociedade Brasileira de Computação in Journal on Interactive Systems
- Vol. 7 (1)
Dynamic game difficulty balancing in real time using Evolutionary Fuzzy Cognitive Maps with automatic calibration
Fuzzy Cognitive Maps (FCM) is a paradigm used to represent knowledge in a simple and concise way, expressing the grade of relation that exists between concepts and causal relationships. Due to its flexibility, FCM has been successfully applied in numerous applications in diverse research fields, such as, robotics, medical diagnosis, decision problems in information technology, games, and so forth. However, one critical drawback is the determination of the weights in the representation graph, which is generally done by an expert. The present paper proposes a semi-automated method for calibrating the weights in a solution for the problem of dynamic game difficulty balancing (DGB) using Evolutionary Fuzzy Cognitive Maps (E-FCM). The proposed algorithm adjusts the weights in real time, ensuring an equilibrium between the values generated according to the expert’s contribution (based on a static analysis) and the changes produced in the values of the concepts by the calibration process during the simulation (a dynamic analysis).
- 18 November 2016
- Published by Sociedade Brasileira de Computação in Journal on Interactive Systems
- Vol. 7 (1)
Open AccessDynamic game difficulty balancing in real time using Evolutionary Fuzzy Cognitive Maps with automatic calibration
Fuzzy Cognitive Maps (FCM) is a paradigm used to represent knowledge in a simple and concise way, expressing the grade of relation that exists between concepts and causal relationships. Due to its flexibility, FCM has been successfully applied in numerous applications in diverse research fields, such as, robotics, medical diagnosis, decision problems in information technology, games, and so forth. However, one critical drawback is the determination of the weights in the representation graph, which is generally done by an expert. The present paper proposes a semi-automated method for calibrating the weights in a solution for the problem of dynamic game difficulty balancing (DGB) using Evolutionary Fuzzy Cognitive Maps (E-FCM). The proposed algorithm adjusts the weights in real time, ensuring an equilibrium between the values generated according to the expert’s contribution (based on a static analysis) and the changes produced in the values of the concepts by the calibration process during the simulation (a dynamic analysis).
- 1 October 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Efficient approach for interest points detection in non-rigid shapes
Due to the increasing amount of data and the reduction of costs in 3D data acquisition devices, there has been a growing interest, in developing efficient and robust feature extraction algorithms for 3D shapes, invariants to isometric, topological and noise changes, among others. One of the key tasks for feature extraction in 3D shapes is the interest points detection; where interest points are salient structures, which can be used, instead of the whole object. In this research, we present a new approach to detect interest points in 3D shapes by analyzing the triangles that compose the mesh which represent the shape, in different way to other algorithms more complex such as Harris 3D or HKS. Our results and experiments of repeatability, confirm that our algorithm is stable and robust, in addition, the computational complexity is O(n log n), where n represents the number of faces of the mesh.
- 1 October 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Efficient approach for interest points detection in non-rigid shapes
Due to the increasing amount of data and the reduction of costs in 3D data acquisition devices, there has been a growing interest, in developing efficient and robust feature extraction algorithms for 3D shapes, invariants to isometric, topological and noise changes, among others. One of the key tasks for feature extraction in 3D shapes is the interest points detection; where interest points are salient structures, which can be used, instead of the whole object. In this research, we present a new approach to detect interest points in 3D shapes by analyzing the triangles that compose the mesh which represent the shape, in different way to other algorithms more complex such as Harris 3D or HKS. Our results and experiments of repeatability, confirm that our algorithm is stable and robust, in addition, the computational complexity is O(n log n), where n represents the number of faces of the mesh.
- Open Access
- 14 February 2014
- Published by Foundation of Computer Science in International Journal of Computer Applications
- Vol. 88 (17) , 1-4
Parallelization of the Algorithm K-means Applied in Image Segmentation
- 14 February 2014
- Published by Foundation of Computer Science in International Journal of Computer Applications
- Vol. 88 (17) , 1-4
Open AccessParallelization of the Algorithm K-means Applied in Image Segmentation
- 1 October 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
A novel approach for image feature extraction using HSV model color and niters wavelets
Due to the advancement of computing and the power of the new hardware, more economical, it is now feasible to have thousands of images which can be analyzed to allow classification for its shape and/or color. Furthermore, techniques and efficiency of the classification depends on the characteristics to be obtained of images in order to compare and classify them according to their similarity. Some images, such as model cars, planes and boats, can be discriminated by their shape. However, other images such as butterfly species where the shape is similar, the color plays an important role in the discrimination task. In this research we propose a novel approach to extract distinctive features of images by combining the HSV color model and wavelets filters. Furthermore, we investigate the best combination of features color and form. Experiments have shown improved performance by combining the HSV color model with Gabor wavelets.
- 1 October 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
A novel approach for image feature extraction using HSV model color and niters wavelets
Due to the advancement of computing and the power of the new hardware, more economical, it is now feasible to have thousands of images which can be analyzed to allow classification for its shape and/or color. Furthermore, techniques and efficiency of the classification depends on the characteristics to be obtained of images in order to compare and classify them according to their similarity. Some images, such as model cars, planes and boats, can be discriminated by their shape. However, other images such as butterfly species where the shape is similar, the color plays an important role in the discrimination task. In this research we propose a novel approach to extract distinctive features of images by combining the HSV color model and wavelets filters. Furthermore, we investigate the best combination of features color and form. Experiments have shown improved performance by combining the HSV color model with Gabor wavelets.