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.
T-Linkage : a continuous relaxation of J-Linkage for multi-model fitting / L. Magri, A. Fusiello - In: Computer Vision and Pattern Recognition (CVPR), 2014 IEEE Conference on : 23-28 June 2014[s.l] : IEEE, 2014. - ISBN 978-1-4799-5118-5. - pp. 3954-3961 (( convegno International Conference on Computer Vision and Pattern Recognition tenutosi a Columbus nel 2014 [10.1109/CVPR.2014.505].
T-Linkage : a continuous relaxation of J-Linkage for multi-model fitting
L. MagriPrimo
;
2014
Abstract
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.
| File | Dimensione | Formato | |
|---|---|---|---|
|
tlnkg_rev.pdf
accesso riservato
Tipologia:
Publisher's version/PDF
Dimensione
3.57 MB
Formato
Adobe PDF
|
3.57 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
