Machine vision for adaptive laser beam steering
First Claim
1. A method for steering a laser beam of an active optical triangulation-based three-dimensional sensor by information extracted from an intensity image of a scene previewed by a video camera through laser beam deflection, comprising the steps of:
- generating an equation of a nominal laser spot path, at a datum plane;
generating an equation of a desired path;
generating an equation of a laser plane;
generating coordinates of a laser point source;
projecting all said coordinates onto a global three-space coordinate system;
locating intersections of said spot path and said desired path with the said laser plane;
computing a subtended angle of said intersections on said laser plane when viewed from a laser source point; and
deflecting the laser beam through said computed subtended angle.
7 Assignments
0 Petitions
Accused Products
Abstract
An arrangement for steering the laser beam, in an active optical triangulation method based on three-dimensional sensors, along paths which are sensitive to the context of the scene of interest, and alleviating the need to undergo a search path by the sensor. A conventional video camera is used to preview the scene of interest and the resultant intensity image is processed to locate the desired path based on the scene context. The sensory system is modeled to enable determination of the instantaneous angular deflections of the laser beam along with the translation of the laser source that can shift the nominal or actual data acquisition path to the desired data acquisition path.
-
Citations
8 Claims
-
1. A method for steering a laser beam of an active optical triangulation-based three-dimensional sensor by information extracted from an intensity image of a scene previewed by a video camera through laser beam deflection, comprising the steps of:
- generating an equation of a nominal laser spot path, at a datum plane;
generating an equation of a desired path;
generating an equation of a laser plane;
generating coordinates of a laser point source;
projecting all said coordinates onto a global three-space coordinate system;
locating intersections of said spot path and said desired path with the said laser plane;
computing a subtended angle of said intersections on said laser plane when viewed from a laser source point; and
deflecting the laser beam through said computed subtended angle. - View Dependent Claims (2, 3, 4, 5, 6)
- generating an equation of a nominal laser spot path, at a datum plane;
-
7. A method for translating a laser point source in an active optical triangulation-based three-dimensional sensor guided by information extracted from an intensity image of a scene previewed by a two-dimensional sensor through three-dimensional sensor translation, comprising the steps of:
- generating an equation of a nominal laser spot path at a datum plane;
generating an equation of a desired path;
projecting an equation of said spot path and said desired path onto said datum plane;
intersecting said spot path and said desired path at a point of intersection and at an angle between the paths;
deriving coordinates of said intersection point and said angle between the paths;
computing sensor translation at any point on the said projected nominal laser spot path and distance from said point of intersection, said translation being the product of said distance and tangent of said angle; and
translating the three-dimensional sensor through said computed sensor translation.
- generating an equation of a nominal laser spot path at a datum plane;
-
8. A method for segmentation of lead toe points and subsequent extraction of a lead toe line from a binarized image of a quad flat pack device comprising the steps of:
- forming a lateral projection vector of said binarized image;
finding a maximum element value in the said projection vector and clipping all elements of the said vector at a predetermined fraction of the said maximum;
run-length coding said clipped projection vector so that each run signifies a sequence of non-zero elements;
generating an objective function for each run based on a product of each run-length by a weighing function representing cumulative sum of the points supported by that run of the projection vector;
locating the run exhibiting said maximum objective function and proceeding along ascending or descending row numbers, dependent on orientation of the device, to locate the next run number, and if the next run number is non-existent the run with maximum objective function is retained instead;
locating a maximum value of said projection vector within bounds of the retained run number, and arriving thereby at a datum row number for subsequent formation of a vertical projection vector;
forming a vertical projection vector for a part of an image that extends to either side of the datum row number by a predetermined extent, elements of said vertical projection vector being run-length encoded so that each run signifies a consecutive sequence of non-zero elements;
computing an objective function for each run as a product of run length and a weighing factor derived from cumulative sum of the projection vector within bounds of the run;
finding a mode of the objective functions and suppressing runs exhibiting objective functions deviating by more than a predetermined value from said mode;
initiating a search at columns passing through a center of surviving runs in an ascending or descending row number direction dependent on orientation of the device for sustained transition from 1 to 0 in the binarized image for obtaining a resulting point set corresponding to lead toe points subjected to fast Hough transform yielding a longest subset of colinear points supporting the lead toe line;
fitting said colinear points to a line using a least square method; and
designating a lead toe line in the location of said fitted line.
- forming a lateral projection vector of said binarized image;
Specification