@article{MTMT:34630512,
title = {Guided Exploration of Industrial Sensor Data},
url = {https://m2.mtmt.hu/api/publication/34630512},
author = {Langer, Tristan and Meyes, Richard and Meisen, Tobias},
doi = {10.1111/cgf.15003},
journal-iso = {COMPUT GRAPH FORUM},
journal = {COMPUTER GRAPHICS FORUM},
unique-id = {34630512},
issn = {0167-7055},
keywords = {Time series; Sensor data; GUIDANCE; Exploratory data analysis; Visual analytics; Analytic Provenance},
year = {2024},
eissn = {1467-8659},
orcid-numbers = {Meisen, Tobias/0000-0002-1969-559X}
}
@article{MTMT:34649721,
title = {State of the Art in Efficient Translucent Material Rendering with BSSRDF},
url = {https://m2.mtmt.hu/api/publication/34649721},
author = {Liang, Shiyu and Gao, Yang and Hu, Chonghao and Zhou, Peng and Hao, Aimin and Wang, Lili and Qin, Hong},
doi = {10.1111/cgf.14998},
journal-iso = {COMPUT GRAPH FORUM},
journal = {COMPUTER GRAPHICS FORUM},
unique-id = {34649721},
issn = {0167-7055},
keywords = {real-time rendering; rendering; Subsurface scattering; Translucent materials; reflectance & shading models},
year = {2023},
eissn = {1467-8659},
orcid-numbers = {Gao, Yang/0000-0002-9149-3554}
}
@article{MTMT:34613062,
title = {Formation-Aware Planning and Navigation with Corridor Shortest Path Maps},
url = {https://m2.mtmt.hu/api/publication/34613062},
author = {Sharma, Ritesh and Weiss, Tomer and Kallmann, Marcelo},
doi = {10.1111/cgf.14995},
journal-iso = {COMPUT GRAPH FORUM},
journal = {COMPUTER GRAPHICS FORUM},
unique-id = {34613062},
issn = {0167-7055},
abstract = {The need to plan motions for agents with variable shape constraints such as under different formations appears in several virtual and real-world applications of autonomous agents. In this work, we focus on planning and execution of formation-aware paths for a group of agents traversing a cluttered environment. The proposed planning framework addresses the trade-off between being able to enforce a preferable formation when traversing the corridors of the environment, versus accepting to switch to alternative formations requiring less clearance in order to utilize narrower corridors that can lead to a shorter overall path to the final destination. At the planning stage, this trade-off is addressed with a multi-layer graph annotated with per-layer navigation costs and formation transition costs, where each layer represents one formation together with its specific clearance requirement. At the navigation stage, we introduce Corridor Shortest Path Maps (CSPMs), which produce a vector field for guiding agents along the solution corridor, ensuring unobstructed in-formation navigation in cluttered environments, as well as group motion along lengthwise-optimal paths in the solution corridor. We also present examples of how our multi-layer planning framework can be applied to other types of multi-modal planning problems.This work addresses multi-formation path planning and navigation in cluttered environments. A new multi-layer graph construction and search methodology is proposed for computing global solutions considering formation preferences and required clearances. At the navigation level we introduce Corridor Shortest Path Maps for achieving unobstructed in-formation group navigation.image},
keywords = {Group formation; Multi-agent navigation; global path planning; multi-modal planning},
year = {2023},
eissn = {1467-8659},
orcid-numbers = {Sharma, Ritesh/0000-0003-1160-3918}
}
@article{MTMT:33924428,
title = {Visual Parameter Space Exploration in Time and Space},
url = {https://m2.mtmt.hu/api/publication/33924428},
author = {Piccolotto, Nikolaus and Boegl, Markus and Miksch, Silvia},
doi = {10.1111/cgf.14785},
journal-iso = {COMPUT GRAPH FORUM},
journal = {COMPUTER GRAPHICS FORUM},
unique-id = {33924428},
issn = {0167-7055},
abstract = {Computational models, such as simulations, are central to a wide range of fields in science and industry. Those models take input parameters and produce some output. To fully exploit their utility, relations between parameters and outputs must be understood. These include, for example, which parameter setting produces the best result (optimization) or which ranges of parameter settings produce a wide variety of results (sensitivity). Such tasks are often difficult to achieve for various reasons, for example, the size of the parameter space, and supported with visual analytics. In this paper, we survey visual parameter space exploration (VPSE) systems involving spatial and temporal data. We focus on interactive visualizations and user interfaces. Through thematic analysis of the surveyed papers, we identify common workflow steps and approaches to support them. We also identify topics for future work that will help enable VPSE on a greater variety of computational models.},
keywords = {VISUALIZATION; Visual analytics; parameter space analysis},
year = {2023},
eissn = {1467-8659},
orcid-numbers = {Piccolotto, Nikolaus/0000-0001-6876-6502; Miksch, Silvia/0000-0003-4427-5703}
}
@article{MTMT:33840548,
title = {Break and Splice: A Statistical Method for Non-Rigid Point Cloud Registration},
url = {https://m2.mtmt.hu/api/publication/33840548},
author = {Gao, Qinghong and Zhao, Yan and Xi, Long and Tang, Wen and Wan, Tao Ruan},
doi = {10.1111/cgf.14788},
journal-iso = {COMPUT GRAPH FORUM},
journal = {COMPUTER GRAPHICS FORUM},
unique-id = {33840548},
issn = {0167-7055},
abstract = {3D object matching and registration on point clouds are widely used in computer vision. However, most existing point cloud registration methods have limitations in handling non-rigid point sets or topology changes (e.g. connections and separations). As a result, critical characteristics such as large inter-frame motions of the point clouds may not be accurately captured. This paper proposes a statistical algorithm for non-rigid point sets registration, addressing the challenge of handling topology changes without the need to estimate correspondence. The algorithm uses a novel Break and Splice framework to treat the non-rigid registration challenges as a reproduction process and a Dirichlet Process Gaussian Mixture Model (DPGMM) to cluster a pair of point sets. Labels are assigned to the source point set with an iterative classification procedure, and the source is registered to the target with the same labels using the Bayesian Coherent Point Drift (BCPD) method. The results demonstrate that the proposed approach achieves lower registration errors and efficiently registers point sets undergoing topology changes and large inter-frame motions. The proposed approach is evaluated on several data sets using various qualitative and quantitative metrics. The results demonstrate that the Break and Splice framework outperforms state-of-the-art methods, achieving an average error reduction of about 60% and a registration time reduction of about 57.8%.},
keywords = {Computer vision; point cloud; Gaussian Mixture Model; non-rigid registration; Topology changes},
year = {2023},
eissn = {1467-8659}
}
@article{MTMT:34581560,
title = {An Efficient Self-supporting Infill Structure for Computational Fabrication},
url = {https://m2.mtmt.hu/api/publication/34581560},
author = {Wang, Shengfa and Liu, Zheng and Hu, Jiangbei and Lei, Na and Luo, Zhongxuan},
doi = {10.1111/cgf.14953},
journal-iso = {COMPUT GRAPH FORUM},
journal = {COMPUTER GRAPHICS FORUM},
volume = {42},
unique-id = {34581560},
issn = {0167-7055},
abstract = {Efficiently optimizing the internal structure of 3D printing models is a critical focus in the field of industrial manufacturing, particularly when designing self-supporting structures that offer high stiffness and lightweight characteristics. To tackle this challenge, this research introduces a novel approach featuring a self-supporting polyhedral structure and an efficient optimization algorithm. Specifically, the internal space of the model is filled with a combination of self-supporting octahedrons and tetrahedrons, strategically arranged to maximize structural integrity. Our algorithm optimizes the wall thickness of the polyhedron elements to satisfy specific stiffness requirements, while ensuring efficient alignment of the filled structures in finite element calculations. Our approach results in a considerable decrease in optimization time. The optimization process is stable, converges rapidly, and consistently delivers effective results. Through a series of experiments, we have demonstrated the effectiveness and efficiency of our method in achieving the desired design objectives.},
keywords = {CCS Concepts; center dot Computing methodologies -> Modeling and simulation; Model development and analysis; center dot Applied computing -> Computer-aided design},
year = {2023},
eissn = {1467-8659},
orcid-numbers = {Hu, Jiangbei/0000-0002-6774-6267}
}
@article{MTMT:33801137,
title = {A Drone Video Clip Dataset and its Applications in Automated Cinematography},
url = {https://m2.mtmt.hu/api/publication/33801137},
author = {Ashtari, Amirsaman and Jung, Raehyuk and Li, Mingxiao and Noh, Junyong},
doi = {10.1111/cgf.14668},
journal-iso = {COMPUT GRAPH FORUM},
journal = {COMPUTER GRAPHICS FORUM},
volume = {41},
unique-id = {33801137},
issn = {0167-7055},
year = {2023},
eissn = {1467-8659},
pages = {189-203},
orcid-numbers = {Ashtari, Amirsaman/0000-0001-5352-7306; Jung, Raehyuk/0000-0001-5689-5390; Li, Mingxiao/0000-0002-7055-0281; Noh, Junyong/0000-0003-1925-3326}
}
@article{MTMT:33712917,
title = {Joint Hand and Object Pose Estimation from a Single RGB Image using High‐level 2D Constraints},
url = {https://m2.mtmt.hu/api/publication/33712917},
author = {Song, H.‐X. and Mu, T.‐J. and Martin, R. R.},
doi = {10.1111/cgf.14685},
journal-iso = {COMPUT GRAPH FORUM},
journal = {COMPUTER GRAPHICS FORUM},
volume = {41},
unique-id = {33712917},
issn = {0167-7055},
year = {2023},
eissn = {1467-8659},
pages = {383-394},
orcid-numbers = {Song, H.‐X./0000-0002-9507-2474; Mu, T.‐J./0000-0002-9197-346X; Martin, R. R./0000-0002-8495-8536}
}
@article{MTMT:34364172,
title = {3D Keypoint Estimation Using Implicit Representation Learning},
url = {https://m2.mtmt.hu/api/publication/34364172},
author = {Zhu, Xiangyu and Du, Dong and Huang, Haibin and Ma, Chongyang and Han, Xiaoguang},
doi = {10.1111/cgf.14917},
journal-iso = {COMPUT GRAPH FORUM},
journal = {COMPUTER GRAPHICS FORUM},
volume = {42},
unique-id = {34364172},
issn = {0167-7055},
abstract = {In this paper, we tackle the challenging problem of 3D keypoint estimation of general objects using a novel implicit representation. Previous works have demonstrated promising results for keypoint prediction through direct coordinate regression or heatmap-based inference. However, these methods are commonly studied for specific subjects, such as human bodies and faces, which possess fixed keypoint structures. They also suffer in several practical scenarios where explicit or complete geometry is not given, including images and partial point clouds. Inspired by the recent success of advanced implicit representation in reconstruction tasks, we explore the idea of using an implicit field to represent keypoints. Specifically, our key idea is employing spheres to represent 3D keypoints, thereby enabling the learnability of the corresponding signed distance field. Explicit key-points can be extracted subsequently by our algorithm based on the Hough transform. Quantitative and qualitative evaluations also show the superiority of our representation in terms of prediction accuracy.},
keywords = {shape analysis; Computing methodologies; Shape representations},
year = {2023},
eissn = {1467-8659},
orcid-numbers = {Du, Dong/0000-0001-5481-389X; Ma, Chongyang/0000-0002-8243-9513; Han, Xiaoguang/0000-0003-0162-3296}
}
@article{MTMT:34263772,
title = {Graph-Based Synthesis for Skin Micro Wrinkles},
url = {https://m2.mtmt.hu/api/publication/34263772},
author = {Weiss, S. and Moulin, J. and Chandran, P. and Zoss, G. and Gotardo, P. and Bradley, D.},
doi = {10.1111/cgf.14904},
journal-iso = {COMPUT GRAPH FORUM},
journal = {COMPUTER GRAPHICS FORUM},
volume = {42},
unique-id = {34263772},
issn = {0167-7055},
abstract = {We present a novel graph-based simulation approach for generating micro wrinkle geometry on human skin, which can easily scale up to the micro-meter range and millions of wrinkles. The simulation first samples pores on the skin and treats them as nodes in a graph. These nodes are then connected and the resulting edges become candidate wrinkles. An iterative optimization inspired by pedestrian trail formation is then used to assign weights to those edges, i.e., to carve out the wrinkles. Finally, we convert the graph to a detailed skin displacement map using novel shape functions implemented in graphics shaders. Our simulation and displacement map creation steps expose fine controls over the appearance at real-time framerates suitable for interactive exploration and design. We demonstrate the effectiveness of the generated wrinkles by enhancing state-of-art 3D reconstructions of real human subjects with simulated micro wrinkles, and furthermore propose an artist-driven design flow for adding micro wrinkles to fictional characters.},
year = {2023},
eissn = {1467-8659}
}