A Holistic Method for Superquadric Fitting Using Unsupervised Clustering Analysis

• URL: http://arxiv.org/abs/2605.16779v1
• Date: Sat, 16 May 2026 03:20:33 GMT
• Title: A Holistic Method for Superquadric Fitting Using Unsupervised Clustering Analysis
• Abstract summary: We present a novel method for fitting superquadrics to point clouds under the contamination of noise and outliers.<n>Our method redefines the problem from a new unsupervised clustering perspective.<n>We provide a theoretical certificate of convergence analysis and demonstrate that the clustering-inspired fitting method can escape local minima.
• Score: 10.759776164959208
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: This work presents a novel method for fitting superquadrics to point clouds under the contamination of noise and outliers, which has many applications for shape modeling across diverse fields. Unlike prior approaches that either exclusively focus on fitting rigid or deformable superquadrics, or suffer from robustness and numerical instability issues, our method redefines the problem from a new unsupervised clustering perspective, enabling the holistic fitting of both rigid and deformable superquadrics within a unified framework. Central to our approach is a stable optimization function inspired by unsupervised clustering analysis, where we formulate the point cloud data and samples from the potential parametric surface as clustering members and centroids, respectively. Then, the clustering process with dynamic updates to centroid locations serves as a direct proxy for optimizing superquadric parameters, establishing a principled link between geometric fitting and clustering dynamics. We further derive the relationship between pairwise computations of clustering centroids and clustering members to orthogonal distances, effectively eliminating the need for the time-consuming surface sampling process. Moreover, our formulation provides closed-form analytical solutions for both the fuzzy membership degree vector and the covariance matrix, ensuring efficient iteration optimization and enabling more effective handling of geometric deformations. In addition, we provide a theoretical certificate of convergence analysis and demonstrate that the clustering-inspired fitting method can escape local minima by inherently increasing the convexity of the objective function. The implementation is publicly available at https://github.com/zikai1/SuperquadricFitting.

Related papers

• Fitting Unknown Number of Hyperplanes with Manifold Optimization [57.48093263119306]
  Fitting unknown number of linearplanes to data is a fundamental yet challenging problem in machine learning.<n>Existing approaches often struggle with optimum optima or lack geometric consistency.
  arXiv  Detail & Related papers  (2026-05-27T14:02:20Z)
• When Fireflies Cluster; Enhancing Automatic Clustering via Centroid-Guided Firefly Optimization [2.929391519312015]
  This work presents a novel variant of the Firefly Algorithm (FA) for data clustering.<n>It addresses limitations of traditional methods like K-Means that struggle with non-uniform cluster shapes, densities, and the need for pre-defining the number of clusters.<n>Experiments show improved clustering quality and reduced intra-cluster path distances compared to K-Means.
  arXiv  Detail & Related papers  (2026-05-18T14:22:13Z)
• A Mean Curvature Approach to Boundary Detection: Geometric Insights for Unsupervised Learning [52.452902154360565]
  We introduce Mean Curvature Boundary Points (MCBP), a novel geometric framework grounded in Geometric Machine Learning.<n>MCBP explicitly models the intrinsic curvature of the data manifold and computes pointwise mean curvature without requiring principled manifold parametrization.<n>Experiments on synthetic and real-world datasets demonstrate that MCBP consistently improves clustering performance.
  arXiv  Detail & Related papers  (2026-05-05T20:19:09Z)
• Convex Clustering Redefined: Robust Learning with the Median of Means Estimator [22.614296433333106]
  We introduce a robust approach that integrates convex clustering with the Median of Means (MoM) estimator.<n>Our method enhances both performance and efficiency, especially on large-scale datasets.
  arXiv  Detail & Related papers  (2025-11-12T21:16:53Z)
• Constrained Centroid Clustering: A Novel Approach for Compact and Structured Partitioning [0.0]
  Constrained Centroid Clustering (CCC) is a method that extends classical centroid-based clustering.<n>CCC achieves more compact clusters by reducing radial spread while preserving angular structure.<n>The proposed approach is suitable for applications requiring structured clustering with spread control, including sensor networks, collaborative robotics, and interpretable pattern analysis.
  arXiv  Detail & Related papers  (2025-08-18T09:30:54Z)
• The Why and How of Convex Clustering [2.7753972220005116]
  This survey reviews a clustering method based on solving a convex optimization problem.<n>We highlight important algorithms and discuss how their computational costs scale with the problem size.
  arXiv  Detail & Related papers  (2025-07-11T23:38:15Z)
• Self-supervised Latent Space Optimization with Nebula Variational Coding [87.20343320266215]
  This paper proposes a variational inference model which leads to a clustered embedding.<n>We introduce additional variables in the latent space, called textbfnebula anchors, that guide the latent variables to form clusters during training.<n>Since each latent feature can be labeled with the closest anchor, we also propose to apply metric learning in a self-supervised way to make the separation between clusters more explicit.
  arXiv  Detail & Related papers  (2025-06-02T08:13:32Z)
• Self-Supervised Graph Embedding Clustering [70.36328717683297]
  K-means one-step dimensionality reduction clustering method has made some progress in addressing the curse of dimensionality in clustering tasks. We propose a unified framework that integrates manifold learning with K-means, resulting in the self-supervised graph embedding framework.
  arXiv  Detail & Related papers  (2024-09-24T08:59:51Z)
• Correspondence-Free Non-Rigid Point Set Registration Using Unsupervised Clustering Analysis [28.18800845199871]
  We present a novel non-rigid point set registration method inspired by unsupervised clustering analysis. Our method achieves high accuracy results across various scenarios and surpasses competitors by a significant margin.
  arXiv  Detail & Related papers  (2024-06-27T01:16:44Z)
• Fuzzy K-Means Clustering without Cluster Centroids [21.256564324236333]
  Fuzzy K-Means clustering is a critical technique in unsupervised data analysis. This paper proposes a novel Fuzzy textitK-Means clustering algorithm that entirely eliminates the reliance on cluster centroids.
  arXiv  Detail & Related papers  (2024-04-07T12:25:03Z)
• Gradient Based Clustering [72.15857783681658]
  We propose a general approach for distance based clustering, using the gradient of the cost function that measures clustering quality. The approach is an iterative two step procedure (alternating between cluster assignment and cluster center updates) and is applicable to a wide range of functions.
  arXiv  Detail & Related papers  (2022-02-01T19:31:15Z)
• Clustering Ensemble Meets Low-rank Tensor Approximation [50.21581880045667]
  This paper explores the problem of clustering ensemble, which aims to combine multiple base clusterings to produce better performance than that of the individual one. We propose a novel low-rank tensor approximation-based method to solve the problem from a global perspective. Experimental results over 7 benchmark data sets show that the proposed model achieves a breakthrough in clustering performance, compared with 12 state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-12-16T13:01:37Z)

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.