Learning based 2D Irregular Shape Packing

• URL: http://arxiv.org/abs/2309.10329v1
• Date: Tue, 19 Sep 2023 05:21:52 GMT
• Title: Learning based 2D Irregular Shape Packing
• Authors: Zeshi Yang, Zherong Pan, Manyi Li, Kui Wu, Xifeng Gao
• Abstract summary: 2D irregular shape packing is a necessary step to arrange UV patches of a 3D model within a texture atlas for memory-efficient appearance rendering in computer graphics. We introduce a learning-assisted 2D irregular shape packing method that achieves a high packing quality with minimal requirements from the input. In order to efficiently deal with large problem instances with hundreds of patches, we train deep neural policies to predict nearly rectangular patch subsets.
• Score: 29.044043493942013
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 2D irregular shape packing is a necessary step to arrange UV patches of a 3D model within a texture atlas for memory-efficient appearance rendering in computer graphics. Being a joint, combinatorial decision-making problem involving all patch positions and orientations, this problem has well-known NP-hard complexity. Prior solutions either assume a heuristic packing order or modify the upstream mesh cut and UV mapping to simplify the problem, which either limits the packing ratio or incurs robustness or generality issues. Instead, we introduce a learning-assisted 2D irregular shape packing method that achieves a high packing quality with minimal requirements from the input. Our method iteratively selects and groups subsets of UV patches into near-rectangular super patches, essentially reducing the problem to bin-packing, based on which a joint optimization is employed to further improve the packing ratio. In order to efficiently deal with large problem instances with hundreds of patches, we train deep neural policies to predict nearly rectangular patch subsets and determine their relative poses, leading to linear time scaling with the number of patches. We demonstrate the effectiveness of our method on three datasets for UV packing, where our method achieves a higher packing ratio over several widely used baselines with competitive computational speed.

Related papers

• Volumetric Surfaces: Representing Fuzzy Geometries with Multiple Meshes [59.17785932398617]
  High-quality real-time view synthesis methods are based on volume rendering, splatting, or surface rendering. We present a novel representation for real-time view where the number of sampling locations is small and bounded. We show that our method can represent challenging fuzzy objects while achieving higher frame rates than volume-based and splatting-based methods on low-end and mobile devices.
  arXiv  Detail & Related papers  (2024-09-04T07:18:26Z)
• GFPack++: Improving 2D Irregular Packing by Learning Gradient Field with Attention [29.836816853278886]
  2D irregular packing is a classic optimization problem with various applications, such as material utilization and texture atlas generation. Conventional numerical methods suffer from slow convergence and high computational cost. Existing learning-based methods, such as the score-based diffusion model, also have limitations, such as no rotation support, frequent collisions, and poor adaptability to arbitrary boundaries, and slow inferring. We propose GFPack++, an attention-based gradient field learning approach that addresses this challenge.
  arXiv  Detail & Related papers  (2024-06-09T06:44:08Z)
• Coverage Axis++: Efficient Inner Point Selection for 3D Shape Skeletonization [49.47444127373479]
  Coverage Axis++ is a novel and efficient approach to 3D shape skeletonization. It offers a high-accuracy approximation of the Medial Axis Transform (MAT)
  arXiv  Detail & Related papers  (2024-01-23T18:07:07Z)
• Differentiable Registration of Images and LiDAR Point Clouds with VoxelPoint-to-Pixel Matching [58.10418136917358]
  Cross-modality registration between 2D images from cameras and 3D point clouds from LiDARs is a crucial task in computer vision and robotic training. Previous methods estimate 2D-3D correspondences by matching point and pixel patterns learned by neural networks. We learn a structured cross-modality matching solver to represent 3D features via a different latent pixel space.
  arXiv  Detail & Related papers  (2023-12-07T05:46:10Z)
• Towards Nonlinear-Motion-Aware and Occlusion-Robust Rolling Shutter Correction [54.00007868515432]
  Existing methods face challenges in estimating the accurate correction field due to the uniform velocity assumption. We propose a geometry-based Quadratic Rolling Shutter (QRS) motion solver, which precisely estimates the high-order correction field of individual pixels. Our method surpasses the state-of-the-art by +4.98, +0.77, and +4.33 of PSNR on Carla-RS, Fastec-RS, and BS-RSC datasets, respectively.
  arXiv  Detail & Related papers  (2023-03-31T15:09:18Z)
• Online 3D Bin Packing Reinforcement Learning Solution with Buffer [1.8060107352742993]
  We present a new reinforcement learning framework for a 3D-BPP solution for improving performance. We implement a model-based RL method adapted from the popular algorithm AlphaGo. Our adaptation is capable of working in single-player and score based environments.
  arXiv  Detail & Related papers  (2022-08-15T11:28:20Z)
• IDEA-Net: Dynamic 3D Point Cloud Interpolation via Deep Embedding Alignment [58.8330387551499]
  We formulate the problem as estimation of point-wise trajectories (i.e., smooth curves) We propose IDEA-Net, an end-to-end deep learning framework, which disentangles the problem under the assistance of the explicitly learned temporal consistency. We demonstrate the effectiveness of our method on various point cloud sequences and observe large improvement over state-of-the-art methods both quantitatively and visually.
  arXiv  Detail & Related papers  (2022-03-22T10:14:08Z)
• One model Packs Thousands of Items with Recurrent Conditional Query Learning [8.821298331302563]
  We propose a Recurrent Conditional Query Learning (RCQL) method to solve both 2D and 3D packing problems. RCQL reduces the average bin gap ratio by 1.83% in offline 2D 40-box cases and 7.84% in 3D cases compared with state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-11-12T14:00:30Z)
• Fast and Accurate Normal Estimation for Point Cloud via Patch Stitching [12.559091712749279]
  We present an effective normal estimation method adopting multi-patch stitching for an unstructured point cloud. Our method achieves SOTA results with the advantage of lower computational costs and higher robustness to noise over most of the existing approaches.
  arXiv  Detail & Related papers  (2021-03-30T04:30:35Z)
• Displacement-Invariant Cost Computation for Efficient Stereo Matching [122.94051630000934]
  Deep learning methods have dominated stereo matching leaderboards by yielding unprecedented disparity accuracy. But their inference time is typically slow, on the order of seconds for a pair of 540p images. We propose a emphdisplacement-invariant cost module to compute the matching costs without needing a 4D feature volume.
  arXiv  Detail & Related papers  (2020-12-01T23:58:16Z)
• PnP-Net: A hybrid Perspective-n-Point Network [2.66512000865131]
  We consider the robust Perspective-n-Point problem using a hybrid approach that combines deep learning with model based algorithms. We demonstrate both synthetic parameters and real world data with low computational requirements.
  arXiv  Detail & Related papers  (2020-03-10T10:43:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.