Entropy-Guided Clustering Tackles Robust Fitting of Multiple Structures in Noisy Data

Computer vision systems face a deceptively simple question every time they look at the world: which points in the data actually belong to the same underlying structure? A self-driving car tracking lane markings, a drone stitching together aerial photographs, or a robot arm reconstructing a scene all depend on the ability to separate genuine geometric patterns from a swarm of misleading outliers. A new study published in Cluster Computing by Fei Chen, Disai Yang, Hanlin Guo, Minjian Wei, Jiaqi Chen, and Zhisheng Lv of Xiamen University of Technology addresses this problem head-on with a method called Information-theoretic Adaptive Clustering-based Fitting, or IACF. The work, published on 27 September 2026 as volume 29, article 802 of the journal, tackles one of the most stubborn weaknesses of modern model fitting: the reliance on fixed, hand-tuned thresholds that collapse when data becomes severely contaminated.

To understand why this matters, it helps to recall how geometric model fitting has evolved. Since Martin Fischler and Robert Bolles introduced the Random Sample Consensus paradigm, or RANSAC, in 1981, the standard approach has been to repeatedly sample small subsets of points, hypothesize a model such as a line, a plane, or a homography, and count how many points agree with it. When a scene contains only one structure and a moderate number of outliers, this strategy works remarkably well. But real scenes are rarely so cooperative. An image pair of a building contains dozens of planes at different depths; a point cloud of a street contains ground surfaces, vehicle bodies, and facades simultaneously. Multi-structure fitting requires the algorithm not only to find models but to segment the data, deciding which points belong to which model instance and which are simply noise.

In recent years, researchers have increasingly turned to density-based clustering algorithms to perform this segmentation. Methods such as DBSCAN, introduced by Ester and colleagues in 1996, group points based on how densely they pack together, and their robustness to noise made them attractive for fitting pipelines. However, as the authors of the new study point out in their abstract, these algorithms carry a critical limitation: they depend on a fixed threshold parameter, conventionally called MinPts, which specifies the minimum number of neighbors required for a point to be considered part of a dense region. This threshold often lacks adaptability to varying data characteristics. When input data is severely contaminated with outliers, determining suitable threshold values becomes genuinely difficult, and a poorly chosen value leads directly to suboptimal fitting results, with inlier structures fragmented or outliers absorbed into spurious clusters.

The core innovation of IACF is to let information theory decide the threshold automatically. Entropy, in the sense introduced by Claude Shannon, quantifies the disorder or uncertainty of a distribution. The researchers propose an entropy-based adaptive strategy that measures the disorder of local neighborhoods in the data and uses this measurement to dynamically determine an optimal clustering threshold, denoted MinPts*, for each specific dataset without any prior knowledge. In other words, instead of an engineer guessing how many neighbors should define a dense region, the algorithm inspects the statistical structure of the data itself and derives the answer. This is a meaningful shift: the parameter that most strongly controls density-based clustering behavior is no longer a fixed constant but a data-driven quantity that adapts to the contamination level and geometric complexity of each problem instance.

The method unfolds in three coordinated stages. First, the authors construct a reliable neighborhood graph by integrating motion and preference information. Preference analysis, a technique well established in the multi-model fitting literature through works such as T-linkage by Magri and Fusiello and accelerated hypothesis generation by Chin, Yu, and Suter, represents each data point by its pattern of agreement with a large set of sampled hypotheses. Points belonging to the same structure share similar preference vectors, so combining this preference signature with motion consistency information allows the graph-building step to prune invalid edges while preserving the potential local inlier structures that matter for fitting. This graph pruning is the first line of defense against outliers, removing connections that would otherwise let mismatched points contaminate each other’s neighborhoods.

Second, the entropy-based adaptive strategy operates on this graph, quantifying the disorder of local neighborhoods to set the optimal MinPts* threshold for the dataset at hand. Third, building on both components, the authors develop an Entropy-Adaptive Density-based Dominant Set Clustering algorithm, or EADSC. Dominant set clustering, formalized by Pavan and Pelillo in their influential work on pairwise clustering, is a graph-theoretic framework in which clusters emerge as dominant sets, subsets of vertices that are internally coherent with respect to their external environment. By making the dominant set search entropy-adaptive, EADSC can autonomously detect model-related subgraphs corresponding to individual model instances and accurately partition inliers from outliers, without the analyst supplying the number of structures in advance.

The experimental evaluation reported in the paper covers several challenging datasets, and the authors state that the proposed IACF method outperforms several state-of-the-art fitting methods in terms of both fitting accuracy and computational efficiency. That dual improvement is notable because robustness and speed are usually in tension in this field. Methods that achieve high accuracy on heavily contaminated data, such as hypergraph optimization approaches, energy minimization and mode-seeking frameworks, and residual-based consensus techniques, often pay a steep computational price, while faster methods sacrifice accuracy when outlier ratios climb. An adaptive threshold that correctly identifies inlier structure on the first pass reduces wasted hypothesis sampling, which is where much of the computational cost of fitting pipelines accumulates.

The context in which this work appears is a field under growing pressure from real-world deployment. The reference list of the paper traces the trajectory of the problem: from RANSAC and its many guided-sampling descendants, through preference-analysis methods and hypergraph formulations, to recent deterministic fitting approaches such as latent semantic consensus and spatial clustering guided two-view fitting, and graph-based techniques for mismatch removal. Applications cited in the surrounding literature range from multimodal image matching and feature matching with large numbers of outliers, to instantaneous frequency estimation of multi-component signals with multi-sensor consensus, to 3D point cloud map merging for large-scale environments and defect detection in printed-circuit boards. Each of these tasks shares the same mathematical skeleton: data generated by multiple geometric models plus noise, and an algorithm that must recover the models without knowing in advance how many there are or how badly the data is corrupted.

What makes the entropy angle particularly compelling is its generality. The authors connect their contribution to a broader line of research on autonomous clustering, including recent work by Yang and Lin on clustering by fast find of mass and distance peaks and toward autonomous distributed clustering. The shared ambition across these efforts is to remove human tuning from the clustering loop, letting statistical measures of structure determine algorithmic parameters. In the IACF framework, entropy serves as a universal yardstick of neighborhood disorder: a well-organized inlier neighborhood has low entropy, while a neighborhood polluted by outliers exhibits high disorder. By searching for the threshold that best separates these regimes, the algorithm effectively asks the data how much contamination it contains and adjusts its density criteria accordingly. This is precisely the kind of self-configuration that matters for systems operating in uncontrolled environments, where the outlier ratio can swing dramatically between frames or between scenes.

The practical implications extend across the computer vision stack. Robust multi-structure fitting sits upstream of fundamental estimation tasks: fundamental matrix and homography estimation in two-view geometry, motion segmentation in video, plane detection in point clouds, and registration of 3D scans. Improving the accuracy and speed of the fitting stage propagates improvements into every downstream application, from augmented reality anchoring to industrial inspection. The authors have made the datasets used in the study publicly available through the Adelaide RMF benchmark repository and a project page, and state that the custom code is available from the corresponding author upon reasonable request, which should make the method straightforward for other groups to evaluate against their own pipelines.

Funded by the Natural Science Fund of Fujian Province, the Natural Science Foundation of Xiamen, the National Natural Science Foundation of China, and several Xiamen municipal science and technology programs, the research reflects a sustained investment in the geometric foundations of machine perception. Whether entropy-adaptive thresholds will become a standard component of future fitting pipelines remains to be seen, but the study makes a clear case that the era of fixed MinPts values in density-based fitting may be drawing to a close. As vision systems are asked to operate in ever messier environments, algorithms that measure the disorder of their own inputs and adapt on the fly offer a persuasive path toward fitting that is both more accurate and more efficient, no matter how many structures the world throws at them.

Subject of Research: Information-theoretic adaptive density clustering for robust multi-structure geometric model fitting in computer vision

Article Title: Information-theoretic adaptive clustering for robust multi-structure model fitting

Article References: Information-theoretic adaptive clustering for robust multi-structure model fitting. (n.d.). https://doi.org/10.1007/s10586-026-06563-2

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06563-2

Keywords: model fitting, density-based clustering, information entropy, adaptive threshold, dominant sets, RANSAC, computer vision, outlier removal, preference analysis, multi-model fitting, neighborhood graph, Cluster Computing