首页 > 最新文献

Computers & Graphics-Uk最新文献

英文 中文
Foreword to the special section on Spanish Computer Graphics Conference 2024 2024 年西班牙计算机图形大会特别部分前言
IF 2.5 4区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-07-06 DOI: 10.1016/j.cag.2024.103995
Ana Serrano, Gustavo Patow, Julio Marco
{"title":"Foreword to the special section on Spanish Computer Graphics Conference 2024","authors":"Ana Serrano, Gustavo Patow, Julio Marco","doi":"10.1016/j.cag.2024.103995","DOIUrl":"10.1016/j.cag.2024.103995","url":null,"abstract":"","PeriodicalId":50628,"journal":{"name":"Computers & Graphics-Uk","volume":"123 ","pages":"Article 103995"},"PeriodicalIF":2.5,"publicationDate":"2024-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141710884","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Dynamics simulation-based packing of irregular 3D objects 基于动力学模拟的不规则三维物体包装
IF 2.5 4区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-07-06 DOI: 10.1016/j.cag.2024.103996
Qiubing Zhuang , Zhonggui Chen , Keyu He , Juan Cao , Wenping Wang

The 3D packing problem has a wide range of applications. However, the complex geometry of irregular objects leads to a sharp increase in the number of placement combinations, making it a challenging problem. In this paper, we propose a packing pipeline based on rigid body dynamics simulation to deal with two types of 3D packing problems. One is the variant bin packing problem, which involves placing more objects into a container of given dimensions to maximize space utilization. The other is the open dimension problem, where the goal is to minimize the container that can accommodate all objects. We first use heuristic placement strategies and a fast collision detection algorithm to efficiently obtain initial packing results. Then, we simulate the shaking of the container according to the dynamic principle. Combined with the vacant space filling operation, shaking the container drives the movement of objects in the container to make the arrangement of objects more compact. For the open dimension packing, the container height is optimized by adjusting the constraints of simulation in the basic pipeline. Experimental results show that our method has advantages over existing methods in both speed and packing density.

三维包装问题应用广泛。然而,不规则物体的复杂几何形状导致摆放组合的数量急剧增加,使其成为一个具有挑战性的问题。在本文中,我们提出了一种基于刚体动力学模拟的包装流水线,用于处理两类三维包装问题。一种是变体箱包装问题,即在给定尺寸的容器中放置更多物品,以最大限度地利用空间。另一种是开放尺寸问题,目标是最小化可容纳所有物体的容器。我们首先使用启发式摆放策略和快速碰撞检测算法,高效地获得初始包装结果。然后,我们根据动态原理模拟容器的晃动。结合空位填充操作,容器的晃动会带动容器内物体的移动,从而使物体的排列更加紧凑。对于开放尺寸的包装,通过调整基本流水线中的模拟约束条件来优化容器高度。实验结果表明,与现有方法相比,我们的方法在速度和包装密度方面都具有优势。
{"title":"Dynamics simulation-based packing of irregular 3D objects","authors":"Qiubing Zhuang ,&nbsp;Zhonggui Chen ,&nbsp;Keyu He ,&nbsp;Juan Cao ,&nbsp;Wenping Wang","doi":"10.1016/j.cag.2024.103996","DOIUrl":"10.1016/j.cag.2024.103996","url":null,"abstract":"<div><p>The 3D packing problem has a wide range of applications. However, the complex geometry of irregular objects leads to a sharp increase in the number of placement combinations, making it a challenging problem. In this paper, we propose a packing pipeline based on rigid body dynamics simulation to deal with two types of 3D packing problems. One is the variant bin packing problem, which involves placing more objects into a container of given dimensions to maximize space utilization. The other is the open dimension problem, where the goal is to minimize the container that can accommodate all objects. We first use heuristic placement strategies and a fast collision detection algorithm to efficiently obtain initial packing results. Then, we simulate the shaking of the container according to the dynamic principle. Combined with the vacant space filling operation, shaking the container drives the movement of objects in the container to make the arrangement of objects more compact. For the open dimension packing, the container height is optimized by adjusting the constraints of simulation in the basic pipeline. Experimental results show that our method has advantages over existing methods in both speed and packing density.</p></div>","PeriodicalId":50628,"journal":{"name":"Computers & Graphics-Uk","volume":"123 ","pages":"Article 103996"},"PeriodicalIF":2.5,"publicationDate":"2024-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141709975","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Fine-tuning 3D foundation models for geometric object retrieval 微调用于几何物体检索的 3D 基础模型
IF 2.5 4区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-07-03 DOI: 10.1016/j.cag.2024.103993
Jarne Van den Herrewegen , Tom Tourwé , Maks Ovsjanikov , Francis wyffels

Foundation models, such as ULIP-2 (Xue et al., 2023) recently projected forward the field of 3D deep learning. These models are trained with significantly more data and show superior representation learning capacity in many downstream tasks like 3D shape classification and few-shot part segmentation.

A particular characteristic of the recent 3D foundation models is that they are typically multi-modal, and involve image (2D) as well as caption (text) branches. This leads to an intricate interplay that benefits all modalities. At the same time, the nature of the 3D encoders alone, involved in these foundation models is not well-understood. Specifically, there is little analysis on the utility of both pre-trained 3D features provided by these models, or their capacity to adapt to new downstream 3D data. Furthermore, existing studies typically focus on label-oriented downstream tasks, such as shape classification, and ignore other critical applications, such as 3D content-based object retrieval.

In this paper, we fill this gap and show, for the first time, how 3D foundation models can be leveraged for strong 3D-to-3D retrieval performance on seven different datasets, on par with state-of-the-art view-based architectures. We evaluate both the pre-trained foundation models, as well as their fine-tuned versions using downstream data. We compare supervised fine-tuning using classification labels against two self-supervised label-free fine-tuning methods. Importantly, we introduce and describe a methodology for fine-tuning, as we found this to be crucial to make transfer learning from 3D foundation models work in a stable manner.

最近,ULIP-2(Xue 等人,2023 年)等基础模型推动了三维深度学习领域的发展。这些模型在训练时使用了大量数据,并在许多下游任务(如三维形状分类和少镜头部件分割)中表现出卓越的表征学习能力。最近的三维基础模型的一个特点是它们通常是多模态的,涉及图像(二维)和标题(文本)分支。这就导致了错综复杂的相互作用,使所有模式都能从中受益。与此同时,人们对这些基础模型所涉及的三维编码器本身的性质还不甚了解。具体来说,对于这些模型所提供的预训练三维特征的效用,或其适应新的下游三维数据的能力,几乎没有分析。在本文中,我们填补了这一空白,并首次展示了如何利用三维基础模型在七个不同的数据集上实现强大的三维到三维检索性能,与最先进的基于视图的架构不相上下。我们使用下游数据对预训练基础模型及其微调版本进行了评估。我们将使用分类标签的监督微调与两种自监督无标签微调方法进行了比较。重要的是,我们引入并描述了一种微调方法,因为我们发现这对于从三维基础模型中稳定地进行迁移学习至关重要。
{"title":"Fine-tuning 3D foundation models for geometric object retrieval","authors":"Jarne Van den Herrewegen ,&nbsp;Tom Tourwé ,&nbsp;Maks Ovsjanikov ,&nbsp;Francis wyffels","doi":"10.1016/j.cag.2024.103993","DOIUrl":"https://doi.org/10.1016/j.cag.2024.103993","url":null,"abstract":"<div><p>Foundation models, such as ULIP-2 (Xue et al., 2023) recently projected forward the field of 3D deep learning. These models are trained with significantly more data and show superior representation learning capacity in many downstream tasks like 3D shape classification and few-shot part segmentation.</p><p>A particular characteristic of the recent 3D foundation models is that they are typically <em>multi-modal</em>, and involve image (2D) as well as caption (text) branches. This leads to an intricate interplay that benefits all modalities. At the same time, the nature of the <em>3D</em> encoders alone, involved in these foundation models is not well-understood. Specifically, there is little analysis on the utility of both pre-trained 3D features provided by these models, or their capacity to adapt to new downstream 3D data. Furthermore, existing studies typically focus on label-oriented downstream tasks, such as shape classification, and ignore other critical applications, such as 3D content-based object retrieval.</p><p>In this paper, we fill this gap and show, for the first time, how 3D foundation models can be leveraged for strong 3D-to-3D retrieval performance on seven different datasets, on par with state-of-the-art view-based architectures. We evaluate both the pre-trained foundation models, as well as their fine-tuned versions using downstream data. We compare supervised fine-tuning using classification labels against two self-supervised label-free fine-tuning methods. Importantly, we introduce and describe a methodology for fine-tuning, as we found this to be crucial to make transfer learning from 3D foundation models work in a stable manner.</p></div>","PeriodicalId":50628,"journal":{"name":"Computers & Graphics-Uk","volume":"122 ","pages":"Article 103993"},"PeriodicalIF":2.5,"publicationDate":"2024-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0097849324001286/pdfft?md5=9cb01c40df89ca64e783dcd0f63e3f33&pid=1-s2.0-S0097849324001286-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141592876","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Wall-bounded flow simulation on vortex dynamics 涡流动力学的壁面流模拟
IF 2.5 4区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-07-01 DOI: 10.1016/j.cag.2024.103990
Rui Tao , Xianku Zhang , Hongxiang Ren , Xiao Yang , Yi Zhou

Vortical flow animation has attracted considerable attention within the realm of computer graphics. Given that boundaries are the source of vorticity, we introduce a novel approach for the wall-bounded flow simulation in the vortex dynamics framework. We enhance the traditional Lagrangian vortex particle method in terms of boundary treatment and viscosity computation for boundary layer to furnish support for the simulation of the vortex shedding phenomenon behind the moving solids. We extend the boundary treatment strategy based on the idea of vortex generation with a reasonable placement algorithm for the generated vortex element to better satisfy the impermeability of solids. Furthermore, we modify the particle strength exchange method at solid boundaries to capture momentum transfer of moving solids. We demonstrate the efficacy of our approach by simulating a series of wall-bounded flows, such as the wake behind a delta wing and the vortex shedding behind the rotating sphere.

涡流动画在计算机图形学领域引起了广泛关注。鉴于边界是涡度的来源,我们引入了一种在涡动力学框架下模拟壁面边界流的新方法。我们在边界处理和边界层粘度计算方面改进了传统的拉格朗日涡旋粒子法,为模拟运动固体后面的涡流脱落现象提供了支持。我们扩展了基于涡旋生成思想的边界处理策略,并为生成的涡旋元素提供了合理的放置算法,以更好地满足固体的不渗透性。此外,我们还修改了固体边界的粒子强度交换方法,以捕捉运动固体的动量传递。我们通过模拟一系列壁界流动,如三角翼后的尾流和旋转球体后的涡流脱落,证明了我们方法的有效性。
{"title":"Wall-bounded flow simulation on vortex dynamics","authors":"Rui Tao ,&nbsp;Xianku Zhang ,&nbsp;Hongxiang Ren ,&nbsp;Xiao Yang ,&nbsp;Yi Zhou","doi":"10.1016/j.cag.2024.103990","DOIUrl":"https://doi.org/10.1016/j.cag.2024.103990","url":null,"abstract":"<div><p>Vortical flow animation has attracted considerable attention within the realm of computer graphics. Given that boundaries are the source of vorticity, we introduce a novel approach for the wall-bounded flow simulation in the vortex dynamics framework. We enhance the traditional Lagrangian vortex particle method in terms of boundary treatment and viscosity computation for boundary layer to furnish support for the simulation of the vortex shedding phenomenon behind the moving solids. We extend the boundary treatment strategy based on the idea of vortex generation with a reasonable placement algorithm for the generated vortex element to better satisfy the impermeability of solids. Furthermore, we modify the particle strength exchange method at solid boundaries to capture momentum transfer of moving solids. We demonstrate the efficacy of our approach by simulating a series of wall-bounded flows, such as the wake behind a delta wing and the vortex shedding behind the rotating sphere.</p></div>","PeriodicalId":50628,"journal":{"name":"Computers & Graphics-Uk","volume":"122 ","pages":"Article 103990"},"PeriodicalIF":2.5,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141543198","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Towards multi-view consistency in neural ray fields using parametric medial surfaces 利用参数中轴曲面实现神经射线场的多视角一致性
IF 2.5 4区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-06-28 DOI: 10.1016/j.cag.2024.103991
Peder Bergebakken Sundt, Theoharis Theoharis

Deep learning methods are revolutionizing the solutions to visual computing problems, such as shape retrieval and generative shape modeling, but require novel shape representations that are both fast and differentiable. Neural ray fields and their improved rendering performance are promising in this regard, but struggle with a reduced fidelity and multi-view consistency when compared to the more studied coordinate-based methods which, however, are slower in training and evaluation. We propose PMARF, an improved ray field which explicitly models the skeleton of the target shape as a set of (0-thickness) parametric medial surfaces. This formulation reduces by construction the degrees-of-freedom available in the reconstruction domain, improving multi-view consistency even from sparse training views. This in turn improves fidelity while facilitating a reduction in the network size.

深度学习方法正在彻底改变视觉计算问题的解决方案,例如形状检索和生成形状建模,但这需要既快速又可微分的新型形状表示法。神经射线场及其改进的渲染性能在这方面大有可为,但与研究较多的基于坐标的方法相比,神经射线场的保真度和多视角一致性较低,而且训练和评估速度较慢。我们提出的 PMARF 是一种改进的射线场,它将目标形状的骨架明确建模为一组(0 厚度)参数中轴曲面。这种方法通过构造减少了重建域中可用的自由度,即使从稀疏的训练视图中也能改善多视图一致性。这反过来又提高了保真度,同时有利于缩小网络规模。
{"title":"Towards multi-view consistency in neural ray fields using parametric medial surfaces","authors":"Peder Bergebakken Sundt,&nbsp;Theoharis Theoharis","doi":"10.1016/j.cag.2024.103991","DOIUrl":"10.1016/j.cag.2024.103991","url":null,"abstract":"<div><p>Deep learning methods are revolutionizing the solutions to visual computing problems, such as shape retrieval and generative shape modeling, but require novel shape representations that are both fast and differentiable. Neural ray fields and their improved rendering performance are promising in this regard, but struggle with a reduced fidelity and multi-view consistency when compared to the more studied coordinate-based methods which, however, are slower in training and evaluation. We propose PMARF, an improved ray field which explicitly models the skeleton of the target shape as a set of (0-thickness) parametric medial surfaces. This formulation reduces by construction the degrees-of-freedom available in the reconstruction domain, improving multi-view consistency even from sparse training views. This in turn improves fidelity while facilitating a reduction in the network size.</p></div>","PeriodicalId":50628,"journal":{"name":"Computers & Graphics-Uk","volume":"123 ","pages":"Article 103991"},"PeriodicalIF":2.5,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0097849324001262/pdfft?md5=ae7ee888d75c89ab09e33803aeb2e531&pid=1-s2.0-S0097849324001262-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141637685","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Topic modelling for spatial insights: Uncovering space use from movement data 主题建模,空间洞察:从移动数据中发现空间使用情况
IF 2.5 4区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-06-28 DOI: 10.1016/j.cag.2024.103989
Gennady Andrienko , Natalia Andrienko , Dirk Hecker

We present a novel approach to understanding space use by moving entities based on repeated patterns of place visits and transitions. Our approach represents trajectories as text documents consisting of sequences of place visits or transitions and applies topic modelling to the corpus of these documents. The resulting topics represent combinations of places or transitions, respectively, that repeatedly co-occur in trips. Visualisation of the results in the spatial context reveals the regions of place connectivity through movements and the major channels used to traverse the space. This enables understanding of the use of space as a medium for movement. We compare the possibilities provided by topic modelling to alternative approaches exploiting a numeric measure of pairwise connectedness. We have extensively explored the potential of utilising topic modelling by applying our approach to multiple real-world movement data sets with different data collection procedures and varying spatial and temporal properties: GPS road traffic of cars, unconstrained movement on a football pitch, and episodic movement data reflecting social media posting events. The approach successfully demonstrated the ability to uncover meaningful patterns and interesting insights. We thoroughly discuss different aspects of the approach and share the knowledge and experience we have gained with people who might be potentially interested in analysing movement data by means of topic modelling methods.

我们提出了一种基于重复的地点访问和转换模式来理解移动实体使用空间的新方法。我们的方法将轨迹表示为由地点访问或转换序列组成的文本文档,并对这些文档的语料库应用主题建模。由此产生的主题分别代表在旅行中重复出现的地点或转换的组合。在空间背景下对结果进行可视化,可以通过移动和穿越空间的主要通道揭示地点连接区域。这有助于理解空间作为运动媒介的使用。我们将主题建模提供的可能性与利用成对连通性的数字测量方法进行了比较。通过将我们的方法应用于具有不同数据收集程序和不同时空属性的多个真实世界运动数据集,我们广泛地探索了利用主题建模的潜力:这些数据集包括:汽车的 GPS 道路交通数据、足球场上的无约束运动数据以及反映社交媒体发布事件的偶发运动数据。该方法成功展示了发现有意义的模式和有趣见解的能力。我们深入讨论了该方法的各个方面,并与可能对通过主题建模方法分析运动数据感兴趣的人分享了我们获得的知识和经验。
{"title":"Topic modelling for spatial insights: Uncovering space use from movement data","authors":"Gennady Andrienko ,&nbsp;Natalia Andrienko ,&nbsp;Dirk Hecker","doi":"10.1016/j.cag.2024.103989","DOIUrl":"https://doi.org/10.1016/j.cag.2024.103989","url":null,"abstract":"<div><p>We present a novel approach to understanding space use by moving entities based on repeated patterns of place visits and transitions. Our approach represents trajectories as text documents consisting of sequences of place visits or transitions and applies topic modelling to the corpus of these documents. The resulting topics represent combinations of places or transitions, respectively, that repeatedly co-occur in trips. Visualisation of the results in the spatial context reveals the regions of place connectivity through movements and the major channels used to traverse the space. This enables understanding of the use of space as a medium for movement. We compare the possibilities provided by topic modelling to alternative approaches exploiting a numeric measure of pairwise connectedness. We have extensively explored the potential of utilising topic modelling by applying our approach to multiple real-world movement data sets with different data collection procedures and varying spatial and temporal properties: GPS road traffic of cars, unconstrained movement on a football pitch, and episodic movement data reflecting social media posting events. The approach successfully demonstrated the ability to uncover meaningful patterns and interesting insights. We thoroughly discuss different aspects of the approach and share the knowledge and experience we have gained with people who might be potentially interested in analysing movement data by means of topic modelling methods.</p></div>","PeriodicalId":50628,"journal":{"name":"Computers & Graphics-Uk","volume":"122 ","pages":"Article 103989"},"PeriodicalIF":2.5,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0097849324001249/pdfft?md5=ee1686b8eaee02c4296da70e08390e4b&pid=1-s2.0-S0097849324001249-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141592875","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the shape description of general solids using Morse theory 用莫尔斯理论描述一般固体的形状
IF 2.5 4区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-06-28 DOI: 10.1016/j.cag.2024.103994
Juan Pareja-Corcho , Diego Montoya-Zapata , Aitor Moreno , Carlos Cadavid , Jorge Posada , Ketzare Arenas-Tobon , Oscar Ruiz-Salguero

The automatic shape description of solids is a problem of interest in manufacturing engineering, amongst other related areas. This description can be either geometrical or topological in nature and can be applied to either surfaces or solids (embedded manifolds). Topological descriptions are specially interesting for the problem of shape comparison and retrieval, where one wants to know if a given shape resembles some other known shape. Some popular topological descriptions use Morse theory to study the topology of manifolds and encode their shape characteristics. A Morse function f is defined on the manifold and the manifold’s shape is indirectly studied by studying the behavior of the critical points of f. This family of methods is well defined for surfaces but does not consider the case of solids. In this paper we address the topological description of solids using Morse theory. Our methodology considers three cases: solids without internal boundaries, solids with internal boundaries and thin-walled solids. We present an algorithm to identify topological changes on these solids using the principle of shape decomposition by Morse handles. The presented algorithm deals with Morse functions that produce parallel planar level sets. Future endeavors should consider other candidate functions.

固体的自动形状描述是制造工程及其他相关领域的一个重要问题。这种描述可以是几何性质的,也可以是拓扑性质的,既可以应用于表面,也可以应用于实体(嵌入流形)。拓扑描述对于形状比较和检索问题特别有趣,因为人们想知道一个给定的形状是否与其他已知形状相似。一些流行的拓扑描述使用莫尔斯理论来研究流形的拓扑结构,并对其形状特征进行编码。莫尔斯函数 f 定义在流形上,通过研究 f 的临界点的行为间接研究流形的形状。在本文中,我们将利用莫尔斯理论对固体进行拓扑描述。我们的方法考虑了三种情况:无内部边界的固体、有内部边界的固体和薄壁固体。我们提出了一种算法,利用莫尔斯手柄的形状分解原理来识别这些固体的拓扑变化。所提出的算法适用于产生平行平面水平集的莫尔斯函数。未来的工作应考虑其他候选函数。
{"title":"On the shape description of general solids using Morse theory","authors":"Juan Pareja-Corcho ,&nbsp;Diego Montoya-Zapata ,&nbsp;Aitor Moreno ,&nbsp;Carlos Cadavid ,&nbsp;Jorge Posada ,&nbsp;Ketzare Arenas-Tobon ,&nbsp;Oscar Ruiz-Salguero","doi":"10.1016/j.cag.2024.103994","DOIUrl":"https://doi.org/10.1016/j.cag.2024.103994","url":null,"abstract":"<div><p>The automatic shape description of solids is a problem of interest in manufacturing engineering, amongst other related areas. This description can be either geometrical or topological in nature and can be applied to either surfaces or solids (embedded manifolds). Topological descriptions are specially interesting for the problem of shape comparison and retrieval, where one wants to know if a given shape resembles some other known shape. Some popular topological descriptions use Morse theory to study the topology of manifolds and encode their shape characteristics. A Morse function <span><math><mi>f</mi></math></span> is defined on the manifold and the manifold’s shape is indirectly studied by studying the behavior of the critical points of <span><math><mi>f</mi></math></span>. This family of methods is well defined for surfaces but does not consider the case of solids. In this paper we address the topological description of solids using Morse theory. Our methodology considers three cases: solids without internal boundaries, solids with internal boundaries and thin-walled solids. We present an algorithm to identify topological changes on these solids using the principle of shape decomposition by Morse handles. The presented algorithm deals with Morse functions that produce parallel planar level sets. Future endeavors should consider other candidate functions.</p></div>","PeriodicalId":50628,"journal":{"name":"Computers & Graphics-Uk","volume":"122 ","pages":"Article 103994"},"PeriodicalIF":2.5,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141543195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Interactive tools for explaining multidimensional projections for high-dimensional tabular data 解释高维表格数据多维投影的互动工具
IF 2.5 4区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-06-28 DOI: 10.1016/j.cag.2024.103987
Julian Thijssen, Zonglin Tian, Alexandru Telea

We present a set of interactive visual analysis techniques aiming at explaining data patterns in multidimensional projections. Our novel techniques include a global value-based encoding that highlights point groups having outlier values in any dimension as well as several local tools that provide details on the statistics of all dimensions for a user-selected projection area. Our techniques generically apply to any projection algorithm and scale computationally well to hundreds of thousands of points and hundreds of dimensions. We describe a user study that shows that our visual tools can be quickly learned and applied by users to obtain non-trivial insights in real-world multidimensional datasets. We also show how our techniques can help understanding a real-world dataset containing quantitative, ordinal, and categorical attributes.

我们提出了一套交互式可视分析技术,旨在解释多维投影中的数据模式。我们的新技术包括一种基于值的全局编码,可突出显示在任何维度上具有离群值的点群,以及几种局部工具,可为用户选择的投影区域提供所有维度的详细统计信息。我们的技术一般适用于任何投影算法,并能很好地扩展到数十万个点和数百个维度。我们描述了一项用户研究,该研究表明,用户可以快速学会并应用我们的可视化工具,从而在现实世界的多维数据集中获得非同一般的见解。我们还展示了我们的技术如何帮助理解现实世界中包含定量、序数和分类属性的数据集。
{"title":"Interactive tools for explaining multidimensional projections for high-dimensional tabular data","authors":"Julian Thijssen,&nbsp;Zonglin Tian,&nbsp;Alexandru Telea","doi":"10.1016/j.cag.2024.103987","DOIUrl":"https://doi.org/10.1016/j.cag.2024.103987","url":null,"abstract":"<div><p>We present a set of interactive visual analysis techniques aiming at explaining data patterns in multidimensional projections. Our novel techniques include a global value-based encoding that highlights point groups having outlier values in any dimension as well as several local tools that provide details on the statistics of all dimensions for a user-selected projection area. Our techniques generically apply to any projection algorithm and scale computationally well to hundreds of thousands of points and hundreds of dimensions. We describe a user study that shows that our visual tools can be quickly learned and applied by users to obtain non-trivial insights in real-world multidimensional datasets. We also show how our techniques can help understanding a real-world dataset containing quantitative, ordinal, and categorical attributes.</p></div>","PeriodicalId":50628,"journal":{"name":"Computers & Graphics-Uk","volume":"122 ","pages":"Article 103987"},"PeriodicalIF":2.5,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0097849324001225/pdfft?md5=bc29f3eeeac8ab279efad0c0b08c66dc&pid=1-s2.0-S0097849324001225-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141543197","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
TDG-Diff: Advancing customized text-to-image synthesis with two-stage diffusion guidance TDG-Diff:利用两级扩散引导推进定制文本到图像的合成
IF 2.5 4区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-06-28 DOI: 10.1016/j.cag.2024.103986
Hong Lin, Qi Chen, Chun Liu, Jingsong Hu

Recently, there has been widespread attention and significant progress in customized text-to-image synthesis based on diffusion models. However, reconstructing multiple concepts in the same scene remains highly challenging. Therefore, we propose a novel framework called TDG-Diff, which employs a two-stage diffusion guidance to achieve customized image synthesis with multiple concepts. TDG-Diff focuses on improving the sampling process of the diffusion model. Specifically, TDG-Diff subdivides the sampling process into two key stages: attribute separation and appearance refinement, introducing spatial constraints and concept representations for sampling guidance. In the attribute separation stage, TDG-Diff introduces a novel attention modulation method. This method effectively separates the attributes of different concepts based on spatial constraint information, reducing the risk of entanglement between attributes of different concepts. In the appearance refinement stage, TDG-Diff proposes a fusion sampling approach, which combines global text descriptions and concept representations to optimize and enhance the model’s ability to capture and represent fine-grained details of concepts. Extensive qualitative and quantitative results demonstrate the effectiveness of TDG-Diff in customized text-to-image synthesis.

最近,基于扩散模型的定制化文本到图像合成受到广泛关注,并取得了重大进展。然而,在同一场景中重建多个概念仍然极具挑战性。因此,我们提出了一种名为 TDG-Diff 的新框架,它采用两阶段扩散引导来实现多概念的定制图像合成。TDG-Diff 专注于改进扩散模型的采样过程。具体来说,TDG-Diff 将采样过程细分为两个关键阶段:属性分离和外观细化,并引入空间约束和概念表示来进行采样指导。在属性分离阶段,TDG-Diff 引入了一种新颖的注意力调制方法。这种方法根据空间约束信息有效地分离了不同概念的属性,降低了不同概念属性之间纠缠的风险。在外观细化阶段,TDG-Diff 提出了一种融合采样方法,该方法结合了全局文本描述和概念表征,优化并增强了模型捕捉和表征概念细粒度细节的能力。广泛的定性和定量结果证明了 TDG-Diff 在定制文本到图像合成中的有效性。
{"title":"TDG-Diff: Advancing customized text-to-image synthesis with two-stage diffusion guidance","authors":"Hong Lin,&nbsp;Qi Chen,&nbsp;Chun Liu,&nbsp;Jingsong Hu","doi":"10.1016/j.cag.2024.103986","DOIUrl":"https://doi.org/10.1016/j.cag.2024.103986","url":null,"abstract":"<div><p>Recently, there has been widespread attention and significant progress in customized text-to-image synthesis based on diffusion models. However, reconstructing multiple concepts in the same scene remains highly challenging. Therefore, we propose a novel framework called TDG-Diff, which employs a two-stage diffusion guidance to achieve customized image synthesis with multiple concepts. TDG-Diff focuses on improving the sampling process of the diffusion model. Specifically, TDG-Diff subdivides the sampling process into two key stages: attribute separation and appearance refinement, introducing spatial constraints and concept representations for sampling guidance. In the attribute separation stage, TDG-Diff introduces a novel attention modulation method. This method effectively separates the attributes of different concepts based on spatial constraint information, reducing the risk of entanglement between attributes of different concepts. In the appearance refinement stage, TDG-Diff proposes a fusion sampling approach, which combines global text descriptions and concept representations to optimize and enhance the model’s ability to capture and represent fine-grained details of concepts. Extensive qualitative and quantitative results demonstrate the effectiveness of TDG-Diff in customized text-to-image synthesis.</p></div>","PeriodicalId":50628,"journal":{"name":"Computers & Graphics-Uk","volume":"122 ","pages":"Article 103986"},"PeriodicalIF":2.5,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141543199","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
AnaConDaR: Anatomically-Constrained Data-Adaptive Facial Retargeting AnaConDaR:解剖学约束的数据自适应面部重定位
IF 2.5 4区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-06-27 DOI: 10.1016/j.cag.2024.103988
Nicolas Wagner , Ulrich Schwanecke , Mario Botsch

Offline facial retargeting, i.e., transferring facial expressions from a source to a target character, is a common production task that still regularly leads to considerable algorithmic challenges. This task can be roughly dissected into the transfer of sequential facial animations and non-sequential blendshape personalization. Both problems are typically solved by data-driven methods that require an extensive corpus of costly target examples. Other than that, geometrically motivated approaches do not require intensive data collection but cannot account for character-specific deformations and are known to cause manifold visual artifacts.

We present AnaConDaR, a novel method for offline facial retargeting, as a hybrid of data-driven and geometry-driven methods that incorporates anatomical constraints through a physics-based simulation. As a result, our approach combines the advantages of both paradigms while balancing out the respective disadvantages. In contrast to other recent concepts, AnaConDaR achieves substantially individualized results even when only a handful of target examples are available. At the same time, we do not make the common assumption that for each target example a matching source expression must be known. Instead, AnaConDaR establishes correspondences between the source and the target character by a data-driven embedding of the target examples in the source domain. We evaluate our offline facial retargeting algorithm visually, quantitatively, and in two user studies.

离线面部重定向,即把面部表情从源角色转移到目标角色,是一项常见的制作任务,但在算法上仍经常面临相当大的挑战。这项任务可大致分为顺序面部动画转移和非顺序混合形状个性化。这两个问题通常都是由数据驱动的方法来解决的,需要大量代价高昂的目标示例。我们提出的 AnaConDaR 是一种用于离线面部重定向的新方法,它是数据驱动和几何驱动方法的混合体,通过基于物理的模拟将解剖学约束纳入其中。因此,我们的方法结合了两种范例的优点,同时平衡了各自的缺点。与其他最新概念相比,即使只有少量目标示例,AnaConDaR 也能获得非常个性化的结果。与此同时,我们并没有采用常见的假设,即必须知道每个目标示例的匹配源表达式。相反,AnaConDaR 通过将目标示例嵌入源域的数据驱动,建立了源字符和目标字符之间的对应关系。我们在两项用户研究中对离线面部重定位算法进行了直观、定量的评估。
{"title":"AnaConDaR: Anatomically-Constrained Data-Adaptive Facial Retargeting","authors":"Nicolas Wagner ,&nbsp;Ulrich Schwanecke ,&nbsp;Mario Botsch","doi":"10.1016/j.cag.2024.103988","DOIUrl":"https://doi.org/10.1016/j.cag.2024.103988","url":null,"abstract":"<div><p>Offline facial retargeting, i.e., transferring facial expressions from a source to a target character, is a common production task that still regularly leads to considerable algorithmic challenges. This task can be roughly dissected into the transfer of sequential facial animations and non-sequential blendshape personalization. Both problems are typically solved by data-driven methods that require an extensive corpus of costly target examples. Other than that, geometrically motivated approaches do not require intensive data collection but cannot account for character-specific deformations and are known to cause manifold visual artifacts.</p><p>We present AnaConDaR, a novel method for offline facial retargeting, as a hybrid of data-driven and geometry-driven methods that incorporates anatomical constraints through a physics-based simulation. As a result, our approach combines the advantages of both paradigms while balancing out the respective disadvantages. In contrast to other recent concepts, AnaConDaR achieves substantially individualized results even when only a handful of target examples are available. At the same time, we do not make the common assumption that for each target example a matching source expression must be known. Instead, AnaConDaR establishes correspondences between the source and the target character by a data-driven embedding of the target examples in the source domain. We evaluate our offline facial retargeting algorithm visually, quantitatively, and in two user studies.</p></div>","PeriodicalId":50628,"journal":{"name":"Computers & Graphics-Uk","volume":"122 ","pages":"Article 103988"},"PeriodicalIF":2.5,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0097849324001237/pdfft?md5=832061b3ec358e11c3e9bfb879ea3d28&pid=1-s2.0-S0097849324001237-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141543194","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Computers & Graphics-Uk
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1