paper-with-me

홈 › Papers

T-Linkage: A Continuous Relaxation of J-Linkage for Multi-Model Fitting

2014-06-01 · CVPR 2014 6 · Luca Magri, Andrea Fusiello

This paper presents an improvement of the J-linkage algorithm for fitting multiple instances of a model to noisy data corrupted by outliers. The binary preference analysis implemented by J-linkage is replaced by a continuous (soft, or fuzzy) generalization that proves to perform better than J-linkage on simulated data, and compares favorably with state of the art methods on public domain real datasets.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Fitting Multiple Heterogeneous Models by Multi-Class Cascaded T-Linkage

2019-06-01 · CVPR 2019 6 · Luca Magri, Andrea Fusiello

This paper addresses the problem of multiple models fitting in the general context where the sought structures can be described by a mixture of heterogeneous parametric models drawn from different classes. To this end, …

Model Selection

Spingarn's Method and Progressive Decoupling Beyond Elicitable Monotonicity

2025-04-01 · Brecht Evens, Puya Latafat, Panagiotis Patrinos

Spingarn's method of partial inverses and the progressive decoupling algorithm address inclusion problems involving the sum of an operator and the normal cone of a linear subspace, known as linkage problems. Despite thei…

Language Models Refine Mechanical Linkage Designs Through Symbolic Reflection and Modular Optimisation

2026-04-30 · João Pedro Gandarela, Thiago Rios, Stefan Menzel, André Freitas arxiv

Designing mechanical linkages involves combinatorial topology selection and continuous parameter fitting. We show that language models can systematically improve linkage designs through symbolic representations. Language…

Solving Multi-Structured Problems by Introducing Linkage Kernels into GOMEA

2022-03-11 · Arthur Guijt, Dirk Thierens, Tanja Alderliesten, Peter A. N. Bosman

Model-Based Evolutionary Algorithms (MBEAs) can be highly scalable by virtue of linkage (or variable interaction) learning. This requires, however, that the linkage model can capture the exploitable structure of a proble…

Evolutionary Algorithms

Improving Problem Identification via Automated Log Clustering using Dimensionality Reduction

2020-09-07 · Carl Martin Rosenberg, Leon Moonen

Goal: We consider the problem of automatically grouping logs of runs that failed for the same underlying reasons, so that they can be treated more effectively, and investigate the following questions: (1) Does an approac…

ClusteringDimensionality Reduction