MonteFloor: Extending MCTS for Reconstructing Accurate Large-Scale Floor Plans

被引:18
作者
Stekovic, Sinisa [1 ]
Rad, Mahdi [1 ]
Fraundorfer, Friedrich [1 ]
Lepetit, Vincent [1 ,2 ]
机构
[1] Graz Univ Technol, Inst Comp Graph & Vis, Graz, Austria
[2] Univ Paris Est, Ecole Ponts ParisTech, Paris, France
来源
2021 IEEE/CVF INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV 2021) | 2021年
关键词
D O I
10.1109/ICCV48922.2021.01573
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We propose a novel method for reconstructing floor plans from noisy 3D point clouds. Our main contribution is a principled approach that relies on the Monte Carlo Tree Search (MCTS) algorithm to maximize a suitable objective function efficiently despite the complexity of the problem. Like previous work, we first project the input point cloud to a top view to create a density map and extract room proposals from it. Our method selects and optimizes the polygonal shapes of these room proposals jointly to fit the density map and outputs an accurate vectorized floor map even for large complex scenes. To do this, we adapt MCTS, an algorithm originally designed to learn to play games, to select the room proposals by maximizing an objective function combining the fitness with the density map as predicted by a deep network and regularizing terms on the room shapes. We also introduce a refinement step to MCTS that adjusts the shape of the room proposals. For this step, we propose a novel differentiable method for rendering the polygonal shapes of these proposals. We evaluate our method on the recent and challenging Structured3D and Floor-SP datasets and show a significant improvement over the state-of-theart, without imposing any hard constraints nor assumptions on the floor plan configurations.
引用
收藏
页码:16014 / 16023
页数:10
相关论文
共 50 条
[41]   An Eulerian perturbation approach to large-scale structures: extending the adhesion approximation [J].
Menci, N .
MONTHLY NOTICES OF THE ROYAL ASTRONOMICAL SOCIETY, 2002, 330 (04) :907-919
[42]   Extending Small Gain and Passivity Theory For Large-Scale System Interconnections [J].
Griggs, Wynita M. ;
Sajja, S. Shravan K. ;
Anderson, Brian D. O. ;
Shorten, Robert N. .
2012 AMERICAN CONTROL CONFERENCE (ACC), 2012, :6376-6381
[43]   DynamoGraph: extending the Pregel paradigm for large-scale temporal graph processing [J].
Steinbauer, Matthias ;
Anderst-Kotsis, Gabriele .
INTERNATIONAL JOURNAL OF GRID AND UTILITY COMPUTING, 2016, 7 (02) :141-151
[44]   Does jackknife scale really matter for accurate large-scale structure covariances? [J].
Favole, Ginevra ;
Granett, Benjamin R. ;
Lafaurie, Javier Silva ;
Sapone, Domenico .
MONTHLY NOTICES OF THE ROYAL ASTRONOMICAL SOCIETY, 2021, 505 (04) :5833-5845
[45]   An accurate and efficient method for large-scale SSR genotyping and applications [J].
Li, Lun ;
Fang, Zhiwei ;
Zhou, Junfei ;
Chen, Hong ;
Hu, Zhangfeng ;
Gao, Lifen ;
Chen, Lihong ;
Ren, Sheng ;
Ma, Hongyu ;
Lu, Long ;
Zhang, Weixiong ;
Peng, Hai .
NUCLEIC ACIDS RESEARCH, 2017, 45 (10)
[46]   Accurate Application Progress Analysis for Large-Scale Parallel Debugging [J].
Mitra, Subrata ;
Laguna, Ignacio ;
Ahn, Dong H. ;
Bagchi, Saurabh ;
Schulz, Martin ;
Gamblin, Todd .
ACM SIGPLAN NOTICES, 2014, 49 (06) :193-203
[47]   An accurate approach of large-scale IP traffic matrix estimation [J].
Jiang, Dingde ;
Chen, Jun ;
He, Linbo .
IEICE TRANSACTIONS ON COMMUNICATIONS, 2007, E90B (12) :3673-3676
[48]   iSwift: Fast and Accurate Impact Identification for Large-scale CDNs [J].
Sun, Jiyan ;
Lin, Tao ;
Liu, Yinlong ;
Wang, Xin ;
Jiang, Bo ;
Geng, Liru ;
Jing, Pengkun ;
Dai, Liang .
2022 IEEE/ACM 30TH INTERNATIONAL SYMPOSIUM ON QUALITY OF SERVICE (IWQOS), 2022,
[49]   Large-scale tucker Tensor factorization for sparse and accurate decomposition [J].
Jun-Gi Jang ;
Moonjeong Park ;
Jongwuk Lee ;
Lee Sael .
The Journal of Supercomputing, 2022, 78 :17992-18022
[50]   Accurate Counting Bloom Filters for Large-Scale Data Processing [J].
Li, Wei ;
Huang, Kun ;
Zhang, Dafang ;
Qin, Zheng .
MATHEMATICAL PROBLEMS IN ENGINEERING, 2013, 2013