My Math Forum 2D transformation, find outlying pairs of points and ommit

 Computer Science Computer Science Forum

 February 9th, 2012, 11:38 AM #1 Newbie   Joined: Feb 2012 Posts: 2 Thanks: 0 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 11th, 2012, 12:59 AM #2 Senior Member   Joined: Aug 2012 Posts: 229 Thanks: 3 Re: 2D transformation, find outlying pairs of points and omm Hey justik. 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?

 Tags find, ommit, outlying, pairs, points, transformation

 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post Albert.Teng Algebra 2 December 14th, 2013 08:52 AM justik Applied Math 0 February 9th, 2012 10:57 AM Slavo Algebra 0 April 23rd, 2010 01:39 AM khyratmath123 Calculus 3 February 15th, 2010 07:22 PM justik Algebra 0 December 31st, 1969 04:00 PM

 Contact - Home - Forums - Cryptocurrency Forum - Top