Perl: the Markov chain saw | |
PerlMonks |
Re^2: Interesting problem fitting points to a template (algorithm?)by FoxtrotUniform (Prior) |
on Oct 05, 2004 at 22:06 UTC ( [id://396795]=note: print w/replies, xml ) | Need Help?? |
The points are puntures through the film by a physical template, so the distance between the true points should be very close to the measured distance for the template. But when the holes are made the film might be slightly rotated. What this means is that the scanned film x,y values are meaningless when comparing to the template x,y values. BUT the delta values (relative distances) between the points should closely correlate. You might have more luck with a rigid point correspondence algorithm, then. Edit: Oops, posted too soon. Provided that the deltas are pretty small, the Voronoi diagram solution should still work. If it does, it will probably be easier to implement and much quicker than a point-correspondence algorithm (most of the PC approaches I'm aware of start by building an affinity matrix between all of the feature points, then do an eigenvalue decomposition on that, so they're going to be pretty slow compared to a Voronoi-cell lookup). If you're looking for hella speed and have the resources to do it, you could probably do the Voronoi lookup fairly easily with programmable graphics hardware (read: consumer graphics cards no more than, say, two years old). Iterating through, say, a thousand possible rotations of the film onto the template should be a piece of cake; that's exactly the sort of thing that modern graphics cards are optimized for. If this sounds like something you have the resources to do, send me a /msg -- we're getting a bit off-topic here, but we're also getting closer to my area of research. --
In Section
Seekers of Perl Wisdom
|
|