Multi-instance robust fitting for non-classical geometric models

Zongliang Zhang, Shuxiang Li, Xingwang Huang, Zongyue Wang
2/5/2026
cs.CV

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Most existing robust fitting methods are designed for classical models, such as lines, circles, and planes. In contrast, fewer methods have been developed to robustly handle non-classical models, such as spiral curves, procedural character models, and free-form surfaces. Furthermore, existing methods primarily focus on reconstructing a single instance of a non-classical model. This paper aims to reconstruct multiple instances of non-classical models from noisy data. We formulate this multi-instance fitting task as an optimization problem, which comprises an estimator and an optimizer. Specifically, we propose a novel estimator based on the model-to-data error, capable of handling outliers without a predefined error threshold. Since the proposed estimator is non-differentiable with respect to the model parameters, we employ a meta-heuristic algorithm as the optimizer to seek the global optimum. The effectiveness of our method are demonstrated through experimental results on various non-classical models. The code is available at https://github.com/zhangzongliang/fitting.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{zhang2026multiinstance,
  title  = {Multi-instance robust fitting for non-classical geometric models},
  author = {Zongliang Zhang and Shuxiang Li and Xingwang Huang and Zongyue Wang},
  year   = {2026},
  eprint = {2602.05602},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2602.05602v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2602.05602.svg)](https://codeofpaper.com/paper/2602.05602)

Discussion