"Mark _T" <x@no.email> wrote in message news:1169439007094-466510@exchange.ni.com...
Hello Jack, There are a couple of ways to do this kind of processing but the way I would suggest is to perform a simple "find geometric shape" function and search for circles. This will return an array of circles that have been found. You can then index the array for whichever circle has the largest radius, or to be more precise, has the closest value to the expected circle radius. You then need to only subtract the radius from the returned circle's center point's x coordinate to find the left side of the bead.. I have attached a very simple example VI that does this. I hope this helps. Thanks and have a great day. Regards,Mark TApplications EngineerNational Instruments
FindCircle2.vi:
http://forums.ni.com/attachments/ni/170/225177/1/FindCircle2.vi
Mark,
This is a lot easier, but I'm pretty sure it's not as fast (in execution, it is faster to make).
Regards,
Wiebe.