|February 9th, 2012, 11:38 AM||#1|
Joined: Feb 2012
2D transformation, find outlying pairs of points and ommit
There are n matched pairs of points in 2D. How to identify outlying pairs of points according to Affine / Helmert transformation and ommit them from the transformtaion key. We do not exactly number of such outlying pairs.
I can not use Trimmed Least Squares method because there is an basic assumption that a k percentage of pairs is correct. But we do not have any information about the sample and do not know the k... In such a sample most of pairs need to be omitted (first extreme case ) or no bad pair ocurs (second extreme case).
So I tried iteratively reweightwed least squares transformation. Residuals for some points became larger, for some points smaller. Is there any algortihm using IRLS which is able to reliably detect such pairs?
Sorry for double post...
|August 10th, 2012, 11:59 PM||#2|
Joined: Aug 2012
Re: 2D transformation, find outlying pairs of points and omm
Can you briefly outline the transformation and its nature? Is it a linear transformation (i.e. you can use a matrix to calculate the result) or is it non-linear?
|find, ommit, outlying, pairs, points, transformation|
|Thread||Thread Starter||Forum||Replies||Last Post|
|find all pairs of (a,b)||Albert.Teng||Algebra||2||December 14th, 2013 08:52 AM|
|2D transformation, find outlying pairs of points and omit f||justik||Applied Math||0||February 9th, 2012 10:57 AM|
|Way to find variance between 2 currency pairs.||Slavo||Algebra||0||April 23rd, 2010 12:39 AM|
|find laplace transformation?||khyratmath123||Calculus||3||February 15th, 2010 07:22 PM|
|2D transformation, find outlying pairs of points and omit f||justik||Algebra||0||January 1st, 1970 12:00 AM|