FlashSplat:优化解决二维到三维高斯拼接分割问题

Qiuhong Shen, Xingyi Yang, Xinchao Wang
{"title":"FlashSplat:优化解决二维到三维高斯拼接分割问题","authors":"Qiuhong Shen, Xingyi Yang, Xinchao Wang","doi":"arxiv-2409.08270","DOIUrl":null,"url":null,"abstract":"This study addresses the challenge of accurately segmenting 3D Gaussian\nSplatting from 2D masks. Conventional methods often rely on iterative gradient\ndescent to assign each Gaussian a unique label, leading to lengthy optimization\nand sub-optimal solutions. Instead, we propose a straightforward yet globally\noptimal solver for 3D-GS segmentation. The core insight of our method is that,\nwith a reconstructed 3D-GS scene, the rendering of the 2D masks is essentially\na linear function with respect to the labels of each Gaussian. As such, the\noptimal label assignment can be solved via linear programming in closed form.\nThis solution capitalizes on the alpha blending characteristic of the splatting\nprocess for single step optimization. By incorporating the background bias in\nour objective function, our method shows superior robustness in 3D segmentation\nagainst noises. Remarkably, our optimization completes within 30 seconds, about\n50$\\times$ faster than the best existing methods. Extensive experiments\ndemonstrate the efficiency and robustness of our method in segmenting various\nscenes, and its superior performance in downstream tasks such as object removal\nand inpainting. Demos and code will be available at\nhttps://github.com/florinshen/FlashSplat.","PeriodicalId":501480,"journal":{"name":"arXiv - CS - Multimedia","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"FlashSplat: 2D to 3D Gaussian Splatting Segmentation Solved Optimally\",\"authors\":\"Qiuhong Shen, Xingyi Yang, Xinchao Wang\",\"doi\":\"arxiv-2409.08270\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This study addresses the challenge of accurately segmenting 3D Gaussian\\nSplatting from 2D masks. Conventional methods often rely on iterative gradient\\ndescent to assign each Gaussian a unique label, leading to lengthy optimization\\nand sub-optimal solutions. Instead, we propose a straightforward yet globally\\noptimal solver for 3D-GS segmentation. The core insight of our method is that,\\nwith a reconstructed 3D-GS scene, the rendering of the 2D masks is essentially\\na linear function with respect to the labels of each Gaussian. As such, the\\noptimal label assignment can be solved via linear programming in closed form.\\nThis solution capitalizes on the alpha blending characteristic of the splatting\\nprocess for single step optimization. By incorporating the background bias in\\nour objective function, our method shows superior robustness in 3D segmentation\\nagainst noises. Remarkably, our optimization completes within 30 seconds, about\\n50$\\\\times$ faster than the best existing methods. Extensive experiments\\ndemonstrate the efficiency and robustness of our method in segmenting various\\nscenes, and its superior performance in downstream tasks such as object removal\\nand inpainting. Demos and code will be available at\\nhttps://github.com/florinshen/FlashSplat.\",\"PeriodicalId\":501480,\"journal\":{\"name\":\"arXiv - CS - Multimedia\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Multimedia\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.08270\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Multimedia","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.08270","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本研究解决了从二维掩膜中准确分割三维高斯拼接的难题。传统方法通常依赖迭代梯度下降来为每个高斯分配唯一的标签,从而导致冗长的优化和次优解决方案。相反,我们为 3D-GS 分割提出了一种直接但全局最优的求解方法。我们方法的核心观点是,在重建的 3D-GS 场景中,2D 掩膜的渲染基本上是与每个高斯的标签相关的线性函数。因此,最佳标签分配可以通过封闭形式的线性规划来解决。这种解决方案利用了拼接过程的阿尔法混合特性,实现了单步优化。通过将背景偏差纳入我们的目标函数,我们的方法在三维分割中表现出卓越的抗噪声鲁棒性。值得注意的是,我们的优化在 30 秒内完成,比现有最好的方法快约 50 倍。广泛的实验证明了我们的方法在分割各种场景时的效率和鲁棒性,以及在对象移除和内绘等下游任务中的卓越性能。演示和代码可在https://github.com/florinshen/FlashSplat。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
FlashSplat: 2D to 3D Gaussian Splatting Segmentation Solved Optimally
This study addresses the challenge of accurately segmenting 3D Gaussian Splatting from 2D masks. Conventional methods often rely on iterative gradient descent to assign each Gaussian a unique label, leading to lengthy optimization and sub-optimal solutions. Instead, we propose a straightforward yet globally optimal solver for 3D-GS segmentation. The core insight of our method is that, with a reconstructed 3D-GS scene, the rendering of the 2D masks is essentially a linear function with respect to the labels of each Gaussian. As such, the optimal label assignment can be solved via linear programming in closed form. This solution capitalizes on the alpha blending characteristic of the splatting process for single step optimization. By incorporating the background bias in our objective function, our method shows superior robustness in 3D segmentation against noises. Remarkably, our optimization completes within 30 seconds, about 50$\times$ faster than the best existing methods. Extensive experiments demonstrate the efficiency and robustness of our method in segmenting various scenes, and its superior performance in downstream tasks such as object removal and inpainting. Demos and code will be available at https://github.com/florinshen/FlashSplat.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信