Abstract
Implicit field representations are a cornerstone of modern 3D shape generation, yet existing methods like IM-NET often suffer from high computational costs and structural artifacts such as "holes" in reconstructed meshes. We introduce HyperCube, a compact hypernetwork-based architecture designed to address these limitations. By extending the model to use interval arithmetic (HyperCube-Interval), we enable the classification of entire 3D volumes (voxels) simultaneously. This approach ensures structural integrity and significantly reduces training time and memory overhead. Our evaluations on the ShapeNet dataset demonstrate that HyperCube achieves competitive reconstruction quality while being substantially more efficient than previous state-of-the-art methods.
Introduction
Generating high-quality 3D shapes typically involves learning implicit fields—functions that determine whether a point in space lies inside or outside an object's boundary. While models like IM-NET have proven effective at creating smooth surfaces, they face three primary challenges: high training complexity, a requirement for global dataset knowledge that hinders scaling, and sampling artifacts. The latter often manifests as disconnected "empty spaces" or holes near object boundaries because the model only processes individual points sampled within voxels.
HyperCube addresses these issues by leveraging a hypernetwork paradigm to generate weights for a compact target network on the fly, decoupling model size from dataset complexity.
Methodology
The HyperCube architecture is proposed in two primary configurations:
- Standard HyperCube: An input feature vector representing a voxel is passed to a hypernetwork ($H_\phi$), which outputs the weights ($\theta$) for a small target network ($T_\theta$). This target network then performs the occupancy classification.
- HyperCube-Interval: This advanced version replaces the standard Multi-Layer Perceptron (MLP) in the target network with an IntervalNet. By employing interval arithmetic, the model processes a continuous 3D interval (the entire voxel) rather than discrete points.
To optimize the interval-based model, we utilize a "worst-case accuracy" loss function. This ensures that the entire volume of a voxel is correctly classified, effectively regularizing the classification boundary and preventing the formation of disconnected fragments.
Experimental Results
We evaluated HyperCube using the ShapeNet dataset across five categories: Plane, Car, Chair, Rifle, and Table.
Efficiency and Scalability
A key advantage of the HyperCube architecture is its efficiency. As shown in our performance benchmarks, HyperCube maintains a significantly lower memory footprint and faster training time compared to IM-NET across various batch sizes.
Reconstruction Quality
HyperCube-Interval consistently produces cleaner meshes with fewer connected components—meaning the resulting models are solid objects rather than fragmented clouds. Quantitatively, HyperCube achieved a Mean Squared Error (MSE) of 4.37 in the "Car" category, outperforming IM-NET's 4.99. In generative tasks, the interval-based approach showed superior Intersection over Union (IoU) metrics, particularly for complex geometries like airplanes.
Conclusion
HyperCube represents a significant step forward in efficient 3D shape representation. By combining hypernetworks with interval arithmetic, we provide a solution that is not only faster and lighter than existing methods but also more robust against common reconstruction artifacts. Future work will explore scaling IntervalNet to higher-resolution voxel grids and further refining the integration of these "plausible" 3D models into real-time applications like gaming and virtual reality.
Summary updated