Table of Contents
Fetching ...

TreeSBA: Tree-Transformer for Self-Supervised Sequential Brick Assembly

Mengqi Guo, Chen Li, Yuyang Zhao, Gim Hee Lee

TL;DR

The paper tackles the SBA problem of assembling 3D objects from LEGO bricks using multi-view silhouettes. It introduces a BFS-based LEGO-Tree to represent sequential assembly and a class-agnostic Tree-Transformer that leverages tree-structure and global geometry embeddings to predict brick connections efficiently. To address limited action labels in real data, the approach uses synthetic pre-training with full supervision followed by self-supervised real-data fine-tuning via an action-to-silhouette projection, including probabilistic voxelization and silhouette loss. Experiments on RAD, MNIST-C, and ModelNet-C demonstrate state-of-the-art performance and strong generalization, even without real-action annotations, with notable gains in efficiency and a robust, category-agnostic framework.

Abstract

Inferring step-wise actions to assemble 3D objects with primitive bricks from images is a challenging task due to complex constraints and the vast number of possible combinations. Recent studies have demonstrated promising results on sequential LEGO brick assembly through the utilization of LEGO-Graph modeling to predict sequential actions. However, existing approaches are class-specific and require significant computational and 3D annotation resources. In this work, we first propose a computationally efficient breadth-first search (BFS) LEGO-Tree structure to model the sequential assembly actions by considering connections between consecutive layers. Based on the LEGO-Tree structure, we then design a class-agnostic tree-transformer framework to predict the sequential assembly actions from the input multi-view images. A major challenge of the sequential brick assembly task is that the step-wise action labels are costly and tedious to obtain in practice. We mitigate this problem by leveraging synthetic-to-real transfer learning. Specifically, our model is first pre-trained on synthetic data with full supervision from the available action labels. We then circumvent the requirement for action labels in the real data by proposing an action-to-silhouette projection that replaces action labels with input image silhouettes for self-supervision. Without any annotation on the real data, our model outperforms existing methods with 3D supervision by 7.8% and 11.3% in mIoU on the MNIST and ModelNet Construction datasets, respectively.

TreeSBA: Tree-Transformer for Self-Supervised Sequential Brick Assembly

TL;DR

The paper tackles the SBA problem of assembling 3D objects from LEGO bricks using multi-view silhouettes. It introduces a BFS-based LEGO-Tree to represent sequential assembly and a class-agnostic Tree-Transformer that leverages tree-structure and global geometry embeddings to predict brick connections efficiently. To address limited action labels in real data, the approach uses synthetic pre-training with full supervision followed by self-supervised real-data fine-tuning via an action-to-silhouette projection, including probabilistic voxelization and silhouette loss. Experiments on RAD, MNIST-C, and ModelNet-C demonstrate state-of-the-art performance and strong generalization, even without real-action annotations, with notable gains in efficiency and a robust, category-agnostic framework.

Abstract

Inferring step-wise actions to assemble 3D objects with primitive bricks from images is a challenging task due to complex constraints and the vast number of possible combinations. Recent studies have demonstrated promising results on sequential LEGO brick assembly through the utilization of LEGO-Graph modeling to predict sequential actions. However, existing approaches are class-specific and require significant computational and 3D annotation resources. In this work, we first propose a computationally efficient breadth-first search (BFS) LEGO-Tree structure to model the sequential assembly actions by considering connections between consecutive layers. Based on the LEGO-Tree structure, we then design a class-agnostic tree-transformer framework to predict the sequential assembly actions from the input multi-view images. A major challenge of the sequential brick assembly task is that the step-wise action labels are costly and tedious to obtain in practice. We mitigate this problem by leveraging synthetic-to-real transfer learning. Specifically, our model is first pre-trained on synthetic data with full supervision from the available action labels. We then circumvent the requirement for action labels in the real data by proposing an action-to-silhouette projection that replaces action labels with input image silhouettes for self-supervision. Without any annotation on the real data, our model outperforms existing methods with 3D supervision by 7.8% and 11.3% in mIoU on the MNIST and ModelNet Construction datasets, respectively.
Paper Structure (58 sections, 10 equations, 10 figures, 10 tables)

This paper contains 58 sections, 10 equations, 10 figures, 10 tables.

Figures (10)

  • Figure 1: Example of self-supervised SBA. The 3D object is assembled from LEGO bricks based on the predicted sequence of actions. Brick color is for better visualization.
  • Figure 2: Overview of our two-stage framework that consists of a pre-training stage and a self-training stage. In the pre-training stage, we use an image encoder to extract the image features, which are fed into a brick decoder to estimate the action sequence. The estimated actions are supervised with ground truth action labels. In the self-training stage, we use voxelization and projection modules to transfer action probabilities into pixel probabilities such that the model can be self-supervised with the input images.
  • Figure 3: Illustration of the LEGO-Tree model and action reordering data augmentation. Node number represents the index of action in the sequence and the index of brick in the tree. (a) shows a BFS LEGO-Tree (solid line) generated from a LEGO-Graph (dotted line). (b) is an action-reordering augmented sample of (a).
  • Figure 4: An example to illustrate the silhouette self-training with the input images $I$. Given the action probabilities $P^A=[p_0,p_1,p_2]$, a 4-step approach is used to compute the pixel probabilities $P^I=[p^I_0,p^I_1,p^I_2]$. Refer to Sec. \ref{['sec:self-training']} for more details.
  • Figure 5: Visual comparison of baselines, brick number, brick size.
  • ...and 5 more figures