Fast feature identification for holographic tracking and characterization of colloidal particles

Abstract

A method and system for identification of holographic tracking and identification of features of an object. A holograph is created from scattering off the object, intensity gradients are established for a plurality of pixels in the holograms, the direction of the intensity gradient is determined and those directions analyzed to identify features of the object and enables tracking of the object. Machine learning devices can be trained to estimate particle properties from holographic information.

Description

FIELD OF THE INVENTION

The invention is directed to a method and system for identification of features by holographic tracking. More particularly the invention is directed to a method and system for time accelerating of features identification by holographic tracking.

BACKGROUND OF THE INVENTION

Holographic microscopy records information about the spatial distribution of illuminated objects through their influence on the phase and intensity distribution of the light they scatter. This information can be retrieved from a hologram, at least approximately, by reconstructing the three-dimensional light field responsible for the recorded intensity distribution. Alternatively, features of interest in a hologram can be interpreted with predictions of the theory of light scattering to obtain exceedingly precise measurements of a scattering object's three-dimensional position, size and refractive index. The availability of so much high-quality information about the properties and motions of individual colloidal particles has proved a boon for applications as varied as product quality assessment, microrheology, porosimetry, microrefractometry, and flow velocimetry, as well as for molecular binding assays, and as a tool for fundamental research in statistical physics and materials science.

However, fitting measured holograms to theoretical predictions requires an initial estimate for each scatterer's position. This can pose challenges for conventional image analysis algorithms because the hologram of a small object consists of alternating bright and dark fringes covering a substantial area in the field of view.

SUMMARY OF THE INVENTION

In order to overcome the disadvantages of the prior art to rapidly and accurately establish positions of the scatterer, such as a center of rotational symmetry, the method and system of the invention take advantage of the concept that intensity gradients in an image either point toward or away from a scatterer's center. Pixel data in a gradient image provides information about where the center of a feature of the scatterer lies in the two-dimensional image plane. A particular selected conventional voting algorithm makes use of that gradient information by allowing each pixel at location r to cast votes for pixels along its preferred direction, ϕ(r), the pixel votes being tallied in an accumulator array, with the pixels in the transformed image accumulating the most votes being candidates for scatterer center positions. These positions can then be located with sub-pixel accuracy using standard methods of feature identification or alternatively, each intersection between pixel votes can be completed directly as a set of simultaneous equations. To avoid the inefficiencies of discrete voting algorithms, the method and system of the invention is therefore based on a continuous transform of a scatterer's local field which eliminates the need for threshold selection and further reduces computational burden of localizing circular image features.

In another implementation, machine learning techniques can be used to analyze holograms of objects, such as colloidal spheres, yielding estimates for spheres' positions along the axial, or out-of-plane, direction and also for the individual spheres' characteristics. Holograms of colloidal dispersions encode comprehensive information about individual particles' three-dimensional positions, sizes and optical properties. Extracting that information typically is computationally intensive, and thus slow. Machine-learning techniques, such as neural networks and support vector machines (SVMs), can analyze holographic video microscopy data in real time on low-power computers. The resulting stream of precise particle-resolved tracking and characterization data provides unparalleled insights into the composition and dynamics of colloidal dispersions and enables applications ranging from basic research to process control and quality assurance.

These and other objects advantages and features of the invention, together with the organization and manner of operation thereof, will become apparent when taken in conjunction with the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1A illustrates a normalized hologram b(r) of an 0.8 micrometer radius polystyrene sphere in water; FIG. 1B illustrates magnitude |∇b (r)| of the gradient of the image of FIG. 1A; FIG. 1C illustrates the orientation, 2ϕ(r), of the gradients with the inset showing phase angle of the orientation alignment convolution kernel; FIG. 1D illustrates an orientation alignment transform of the image of FIG. 1A with the inset being a schematic representation of how three pixels contribute to the real part of the transform;

FIG. 2 illustrates feature identification in a multi-particle holograph showing a normalized hologram of 12 colloidal spheres, each being 3 micrometers in diameter processed by the orientation alignment transforms to coalesce concentric ring patterns into peaks with peak centers indicated by circular plotted over the original image (the scale bar indicates 10 micrometers); and

FIG. 3A illustrates a trajectory of a colloidal sphere obtained by analyzing a holographic video with the orientation alignment transform (note the “color coded” trajectory of the colloidal sphere over a time of 9.1 m; FIG. 3B illustrates the mean-squared displacement along {circumflex over (x)} and ŷ computed from the trajectory in FIG. 3A together with linear fits to Eqn. 8 hereinafter and plotted as dashed curves.

FIG. 4 is a schematic representation of machine-learning analysis of colloidal holograms. A hologram (inset) is averaged over angles to obtain a radial intensity profile b(r). This is fed into the input of a trained machine learning system such as a support vector regression system, which then yields estimates for the particle's radius a_p, its refractive index n_p and its axial distance from the focal plane z_p.

FIG. 5 shows estimated particle radius a_p, refractive index, n_p trajectory z_p(t) of a nominally 1.59 μm diameter polystyrene sphere diffusing and sedimenting in water. Superimposed lines show the mean radius, mean refractive index, and linear trend in axial position computed from the data

FIG. 6 illustrates mean squared displacement Δz_p(t) as a function of lag time τ, together with a fit to Eq. (15).

FIG. 7 illustrates a computer implemented system and method of one embodiment.

FIG. 8. Colloidal characterization by holographic microscopy and machine learning. Colloidal spheres flowing down a microfluidic sample scatter light from a collimated laser beam to form an in-line hologram. Features in the beam are identified, and their radial profiles presented to support vector machines (SVMs) that compare them with a library of training data to estimate each spheres' radius a_p and refractive index n_p. The scatter plot shows results for 2,500 spheres drawn at random from a mixture of four different types of spheres. Each point is colored by the local density of data points, ρ(a_p, n_p).

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

Machine learning techniques can be used to analyze holograms of objects, such as colloidal spheres, yielding estimates for spheres' positions and characteristics. This estimates can provide information about the objects that are precise enough for real-world applications, and performing rapidly enough for real-time operation.

One implementation relates to the use of FIG. 1A shows a typical hologram of a colloidal polystyrene sphere in water. This hologram was recorded with an in-line holographic video microscope using a collimated linearly polarized laser for illumination (Coherent Cube, vacuum wavelength λ=447 nm). Light scattered by the sphere interferes with the rest of the beam in the focal plane of a microscope objective (Nikon Plan Apo, 100× oil immersion, numerical aperture 1.4). The objective, in combination with a tube lens, relays the interference pattern to a video camera such as, (NEC TI-324A II) with an effective magnification of 135 nm/pixel. The intensity distribution recorded by the video camera is normalized by a background image to suppress spurious interference fringes due to imperfections in the illumination and the optical train. FIG. 1A shows a 480×480 pixel region of the normalized intensity, b(r).

The sphere's hologram features concentric bright and dark circular fringes all centered on a point in the focal plane that coincides with the sphere's center. This center could be identified by performing a circular Hough transform, which additionally would identify the radii of all the rings. Hough transforms, however, have a computational complexity of O{N⁴} in the number N of pixels on the side of each N×N image, and thus are prohibitively costly. Variants of Hough transforms that identify centers but not radii can achieve a computational complexity of O{N³ log N}.

More efficient searches for centers of rotational symmetry take advantage of the observation that gradients in the intensity of images such as FIG. 1A either point toward or away from the centers. FIG. 1B shows the magnitude, |∇b(r)|², of the image's gradient. Each pixel in the gradient image, ∇b(r), is associated with a direction,

$\begin{array}{cc}\varphi \left(r\right)={\tan }^{-1}\left(\frac{{\partial }_{y}b\left(r\right)}{{\partial }_{x}b\left(r\right)}\right)& \left(1\right)\end{array}$ relative to the image's {circumflex over (x)} axis. FIG. 1C shows ϕ(r) for the image in FIG. 1A. Each pixel therefore offers information that the center of a feature might lie somewhere along direction ϕ(r) relative to its position r. Voting algorithms make use of this information by allowing each pixel to cast votes for pixels along its preferred direction, the votes of all pixels being tallied in an accumulator array. Hough transforms operate on a similar principle, but also incorporate distance information. Pixels in the transformed image that accumulate the most votes in then are candidates for center positions, and may be located with sub-pixel accuracy using standard methods of particle tracking. Alternatively, each intersection between pixels' votes can be computed directly as the solution of a set of simultaneous equations. Voting algorithms typically identify the centers of features such as the example in FIG. 1A to within 1/10 pixel. Efficient implementations have a computational complexity of O{N³}. Achieving this efficiency, however, relies on judiciously distinguishing pixels that might contribute to circles from pixels in the background. An alternative to discrete voting algorithms based on a continuous transform of the local orientation field eliminates the need for threshold selection and further reduces the computational burden of localizing circular features in an image. The spatially varying orientation of gradients in b(r) may be described with the two-fold orientational order parameterψ(r)=|∇b(r)|²e^2iϕ(r).  (2)

The factor of 2 in the exponent accounts for the bidirectional nature of orientation information obtained from gradients, as can be seen in FIG. 1C. Weighting the order parameter by |∇b(r)|² ensures that pixels in regions with stronger gradients contribute more to the estimate for the local orientation. To identify symmetry-ordained coincidences in the orientation field, ϕ(r) is convolved with the two-fold symmetric transformation kernel,

$\begin{array}{cc}K\left(r\right)=\frac{1}{r}{e}^{-2i\theta },& \left(3\right)\end{array}$ to obtain the orientation alignment transformΨ(r)=∫K(r−r′)ψ(r′)d²r′.  (4)

The phase of K(r) complements the phase of ψ(r), as can be seen in the inset to FIG. 1C. The integrand of Eq. (4) therefore is real-valued and non-negative along the line r′-r that is oriented along θ=ϕ(r′), and is complex-valued along other directions. Real-valued contributions directed along gradients of b(r) accumulate at points r in Ψ(r) that are centers of symmetry of the gradient field, as illustrated schematically in the inset to FIG. 1D. Complex-valued contributions, by contrast, tend to cancel out. Centers of symmetry in b(r) therefore are transformed into centers of brightness in B(r)=|Ψ(r)|², as can be seen in FIG. 1D. The centroid of the peak then can be identified and located. Circular features at larger radius from a center of symmetry subtend more pixels in b(r) and thus would tend to have more influence over the position of the center of brightness in B(r). The factor of 1/r in Eq. (3) ensures that all of the interference fringes comprising the hologram of a sphere contribute with equal weight to estimate for the centroid. The resulting separation of scales accounts for the successful identification and location of twelve colloidal spheres in the hologram reproduced in FIG. 2. Despite interference between the spheres' scattering patterns and uncorrected motion artifacts in the hologram, each sphere's contribution to the hologram is resolved into a single peak by the orientation alignment transform. The orientation alignment transform in Eqs. (3) and (4) is a form of the Fourier-Mellin transform, which is used to detect geometrically invariant features in images. It can be computed efficiently using the Fourier convolution theorem,Ψ(k)=K(k)ψ(k)  (5)where ψ(k) is the Fourier transform of ψ(r), and where

$\begin{array}{cc}K\left(k\right)y\left(k\right)=K\left(k\right)\psi \left(k\right)=\frac{1}{k}{e}^{-2i\theta }& \left(6\right)\end{array}$ is the Fourier transform of K(r). The orientation alignment transform therefore can be calculated by performing a fast Fourier transform (FFT) on Ψ(r), multiplying by a precomputed kernel, K(k), and then performing an inverse FFT. Computing the gradient image by convolution with a Savitzky-Golay filter reduces sensitivity to noise in b(r) and can be performed in O{N²} operations. The transform's overall computational complexity is set by the O{N² log N} cost of the forward and inverse FFT, and so is more efficient than voting algorithms. Rather than requiring sequential analysis of above-threshold pixels, moreover, the orientation alignment transform lends itself to implementation on parallel processors. One implementation in the IDL programming language achieves real-time performance (30 frames/s) for identifying and locating multiple particles in images such as FIG. 2.

Applying the same analysis to each snapshot in a holographic video sequence yields a time-resolved trajectory for each sphere in the field of view. FIG. 3A shows the in-plane trajectory of the sphere from FIGS. 1A-1D obtained in this way from 16,500 consecutive video frames. Each frame, moreover, yields two measurements of the particle's position because the even and odd scan lines are recorded separately. Given the recording rate of 29.97 frames/s the time interval between interleaved video fields is At=16.68 ms. The camera's exposure time, 0.1 ms, is fast enough that the sphere will not have diffused appreciably during image acquisition. The 33,000 position measurements plotted in FIG. 3A record the particle's Brownian motion over more than 9 min.

Assuming that the sphere diffuses freely without significant hydrodynamic coupling to surrounding surfaces, the mean-squared displacement,Δr_j²(τ)=[r_j(t+τ)−r_j(t)]  (2)should satisfy the Einstein-Smoluchowski equationΔr_j²(τ)=2D_jτ+2∈_j²  (8)where r_j(t) is the sphere's position along one of the Cartesian coordinates with r₀(t)=x(t) and r_j(t)=y(t), where D_j, is the diffusion coefficient along that direction, and where ε_j is the error in the associated position measurement. Analyzing measured trajectories with Eq. (8) therefore provides a method to measure the precision with which a particle's position can be measured.

The data in FIG. 3B show the mean-squared displacements along the x and y direction computed from the trajectories in FIG. 3A using Eq. (7). Error bars in FIG. 3B reflect statistical uncertainties in the computed values. Although results along the two directions appear to agree with each other to within these uncertainties, least-squares fits to the Einstein-Smoluchowski prediction in Eq. (8) yield slightly different values for the particle's diffusion coefficient: D_x=0.292±0.002 μm²/s and D_y=0.281±0.002 μm²/s. This discrepancy may be attributed to blurring along the y direction that arises when the even and odd scan lines are extracted from each interlaced video frame. The resulting loss of spatial resolution along ŷ tends to suppress the apparent diffusivity along that direction. This artifact may be avoided by using a progressive scan camera. The larger of the measured diffusion coefficients is consistent with the Stokes-Einstein prediction

$D=\frac{k_{B}T}{6\mathrm{\pi \eta }{a}_p}=0.296\pm 0.002{\mathrm{\mu m}}^2\text{/}s$ for a sphere of radius a_p=0.805±0.001 μm diffusing through water with viscosity η=0.912±0.005 mPa s at absolute temperature T=297.1±0.2 K.

Fits to Eq. (8) also yield estimates for errors in the particle's position of ∈_x=8 nm and ∈_y=9 nm, or roughly 0.06 pixel in each direction. This performance is comparable to the precision obtained with voting algorithms. Because of its speed advantage, the orientation alignment transform in conjunction with centroid-locating algorithms should be immediately useful for in-plane particle tracking applications. In applications requiring greater precision, three-dimensional tracking, or simultaneous tracking and characterization, the orientation alignment transform can provide a fast and reliable starting point for more detailed analysis. The orientation alignment transform performs well for identifying features composed of large numbers of closely spaced concentric fringes. It does not fare so well with simple disk-like features whose few alignment coincidences occur at comparatively large ranges. Such images are better analyzed with Hough transforms, voting algorithms, or related morphological methods. The orientation alignment transform, by contrast, is better suited to holographic images whose rich gradient structure creates a particular computational burden for conventional methods.

Holograms of colloidal spheres obtained with holographic video microscope can be interpreted with predictions of the Lorenz-Mie theory of light scattering to track each particle in three dimensions, and to measure its size and refractive index. State-of-the-art implementations can locate a sphere and resolve its radius both to within a few nanometers, and can determine its refractive index to within a part per thousand. The cost of this powerful technique is the computational burden of fitting each hologram pixel-by-pixel to theoretical predictions. Here, techniques of machine learning are demonstrated that can reduce the processing time by a factor of a thousand, yielding real-time performance.

One implementation to fast holographic characterization, depicted schematically in FIG. 8, employs the support vector machine (SVM) algorithm to compare experimental measurements with pre-computed predictions of the Lorenz-Mie theory. Whereas nonlinear fitting typically requires more than a second on a 1 Gflop computer, a trained SVM can estimate the size, refractive index or axial position of a micrometer-scale sphere in under a millisecond.

The in-line holographic microscope used for these studies illuminates the sample with a linearly polarized collimated laser beam (Coherent Cube, 20 mW) at a vacuum wavelength of λ=447 nm. The fluence of the 3 mm-diameter beam is comparable to that of a conventional microscope illuminator. Optical forces and light-induced heating therefore are negligible. Light scattered by a sphere propagates to the focal plane of a custom-built video microscope where it interferes with the undiffracted portion of the original beam. The microscope magnifies this interference pattern onto the detector of a greyscale video camera, which records its intensity with a system magnification of 135 nm/pixel. Each snapshot in the video stream constitutes a hologram of the particles in the channel.

The electric field of the incident beam at position r in the focal plane may be modeled as a plane wave with spatial dependence E₀(r)=u₀(r)e^iϕ0(r)e^ikz {circumflex over (x)}, where k=2 πnm/λ is the wavenumber in a medium of refractive index nm, and where u0(r) and ϕ0(r) account for small variations in the beam's amplitude and phase profiles, respectively.

A particle located at r_p relative to the center of the focal plan²e scatters the incident illumination, E₀ (r_p), to the focal plane as E_s(r)=E₀ (r_p)f_s(k(r−r_p)|a_p,n_p), where f_s(kr|a_p,n_p) is the Lorenz-Mie scattering function that describes how a sphere of radius a_p and refractive index n_p scatters an {circumflex over (x)}-polarized plane wave. The measured intensity then may be modeled as I₀(r)=|E₀(r)+E_s(r)|². Normalizing the recorded hologram by I₀(r)=|E₀(r)|²=u₀²(r) suppresses spurious structure in the illumination and yields a functional form for the normalized hologram

$\begin{array}{cc}b\left(r\right)=\frac{I\left(r\right)}{I_0\left(r\right)}\approx {\hat{x}+e^{i{\mathrm{kz}}_p}{f}_s\left(k\left(r-r_p\right)❘a_p,n_p\right)}^2,& \left(9\right)\end{array}$ that can be calculated with standard software packages.

A sphere's position (xp, yp) in the plane of a hologram can be identified by first coalescing ring-like features into centers of brightness with standard particle-tracking algorithms. This procedure typically yields xp and yp to within a tenth of a pixel, or better than 20 nm in each coordinate.

Fully interpreting the hologram with Eq. (9) additionally requires estimates for a_p, n_p and the axial position, z_p. Given reasonable starting values, a typical fit to the normalized hologram of a 1.5 μm-diameter silica sphere in water yields x_p and yp to within 1 nm, z_p to within 3 nm, a_p to within 1 nm, and n_p to within one part per thousand. Unfortunately, general and reliable methods for estimating the unknown parameters have not been available. Previously described approaches based on ad hoc comparisons with Rayleigh scattering or circular diffraction do not yield independent estimates for the refractive index, and often fail to yield z_p and a_p with the accuracy needed for a full nonlinear fit to converge. In such cases, an exhaustive search of the space of initial parameters still can yield good results, but at the expense of time and substantial computational effort. Each fit such a series can require as many as a hundred evaluations of Eq. (9).

In one embodiment, rather than resorting to computationally expensive searches or model-based approximation schemes, instead parameter estimation is treated as a regression problem that is solved with machine learning techniques. Although support vector embodiments are described herein as an exemplary embodiment, it should be appreciated that other regression machine learning schemes may be used, such as decision tree learning, relevance vector machines, artificial neural networks, inductive logic programming, and Bayesian based learning schemes. In one particular embodiment, a neural network approach is used to provide a nonlinear statistical model.

One example of a support vector embodiment is show as a process indicated schematically in FIG. 4. The radial profile b(r) of a particle's normalized hologram is computed by averaging b(r) over angles around (x_p, y_p). This trace, consisting of 100 floating point values digitized at 1-pixel intervals, is presented to each of three support vector machines that have been trained to estimate a_p and n_p, respectively. A similar approach could be implemented with a neural network using a series of interconnected nodes.

Previous implementations of Lorenz-Mie microscopy fit Eq. (9) to measured holograms using ap, np and rp as adjustable parameters. These fits are exquisitely sensitive to errors in the particle's in-plane position, and so must be performed over the entire two-dimensional intensity distribution. Instead, Eq. (9) is used in one implementation to train support vector machines, which then are able to estimate ap, np and zp from a hologram's one-dimensional radial profile. These profiles are obtained from measured holograms by averaging around centers of rotational symmetry with single-pixel resolution, yielding 100-point data vectors. The associated reduction in dimensionality accounts in part for the implementation's computational efficiency.

The described SVMs are implemented with scikit-learn, an open-source machine learning soft-ware package that builds upon the libsvm library of Support Vector Machine algorithms. Each SVM computes one output parameter from an input vector consisting of a radial profile, b(r), that has been digitized into 100 single-pixel bins. Characterizing and tracking a colloidal particle therefore requires three SVMs, one for each of ap, np and zp. FIG. 8 schematically represents this process for estimating ap and np.

An SVM computes its output by comparing b(r) with sets of training data, bn(r), that are obtained from Eq. (9) over a range of values of ap, np and zp. Each training set constitutes one support vector in the space spanned by these parameters. To facilitate these comparisons, construct SVMs with radial basis functions k_n(b)=exp(−γ∫|b_n(r)−b(r)|²dr) that quantify the similarity of the experimental input with the n-th support vector. The sensitivity of this comparison is set by γ, with larger values favoring more precise results at the cost of requiring more support vectors to span the parameter space. Given a value of γ, the training process determines a set of weights ωn and an offset s0 such that the weighted sum, sfit(b)=Σn ωnkn(b)+s0, constitutes an estimate for the parameter, s. In general, errors in sfit(b) depend smoothly on γ. The optimal value for the present application is found to fall in the range 0.1≤γ≤10.

In addition to the choice of parameters used to construct the support vectors, the SVM's training is governed by two constants that are selected before training begins. The first, typically denoted as C, is a regularization term that determines the relative importance of precision in parameter estimation versus variance in predicted results. For C»1, particular emphasis is placed on correctly predicting the parameters underlying each training set at the cost of assigning large weights to each support vector. Training with large values of C promises precise results, but carries the risk that the SVM might perform erratically when presented with novel data. The second parameter, γ, sets the scale at which discrepancies between data and support vectors will be tolerated by the radial basis functions. The nth support vector characterized by the training profile b_n(r) is assigned a weightw_n(b(r))=exp(−γ∫|b_n(r)−b(r)|²dr),  [10]when presented with the experimental profile b(r). Training with a smaller value of γ thus allows each training set to cover a wider range of parameters and thus reduces the number of training sets required to cover the intended range of parameters comprehensively.

In one embodiment, to prevent overfitting, the weights ωn are constrained to have magnitudes less than a maximum value that typically is denoted by C. Larger values of C improve an SVM's ability to recognize its training data, but render it less able to smoothly interpolate between its support vectors when presented with novel or noisy inputs. Some candidate support vectors may be assigned small weighting factors in optimizing sfit(b) over a corpus of training data; these are automatically eliminated from the SVM. Values of γ and C thus determine which support vectors are included in the SVM, and their relative importance for computing the output. Because this process is nonlinear, optimal values of γ and C are obtained by exhaustive search. Statistically indistinguishable results are obtained in the present application for values of γ and C that vary from their optimal values by ten percent. SVMs were trained with a 5,000-member training set whose parameters were evenly distributed over a volume in the three-dimensional space spanned by 13.5 μm≤zp≤75 μm, 0.4 μm≤ap≤1.75 μm, and 1.4≤np≤1.8 at a resolution of 1.35 μm in zp, 0.1 μm in ap and 0.1 in np. Values for C and γ ranging from 10⁻³ to 10⁵ were selected for testing. Training time increases dramatically with the number of training sets, and with the values of C and γ. Once trained, however, each SVM can estimate its parameter extremely rapidly, for example, in under a millisecond.

The quality of a trained SVM can be assessed by presenting it with novel cross-validation data. Optimal values for C and γ minimize differences between estimated parameters and the inputs. Using a 500-member cross-validation set, best performance was obtained for estimating zp with C=100 and γ=1, best performance for np with C=10 and γ=0.5, and best performance for ap with C=10 and γ=0.6.

Sampling the entire parameter space accessible to holographic characterization with resolution comparable to the precision realized with nonlinear fits would require more than 10¹⁰ training sets. If, however, the system of interest is characterized by a more modest range of parameters, then results from an initial SVM analysis can be used to generate a comparatively small set of training data spanning the relevant range. This specialized training proceeds rapidly and yields substantial improvements in precision.

The data plotted in FIG. 1 are SVM estimates for the radii and refractive indexes of 2,500 colloidal spheres flowing down a microfluidic channel formed by bonding the edges of a glass microscope cover slip to the surface of a glass microscope slide. The peak flow speed of 1 mm/s transports a sphere across the field of view in no fewer than two video frames, ensuring that every particle in the flow has a chance to be analyzed. Anisotropic blurring due to a sphere's 100 nm motion during the camera's 0.1 ms exposure time suppresses contrast along the direction of motion, but does not appreciably influence the azimuthal average, b(r). Spurious results arising when multiple spheres' interference patterns overlap contribute outliers to the observed distribution of particle sizes and refractive indexes. Such artifacts are minimized by diluting the sample until no more than three particles are present in any frame.

The sample was prepared by dispersing roughly equal proportions of four types of colloidal spheres in water: 1 μm-diameter and 2 μm-diameter spheres made of polystyrene and silica. This four-component mixture was flowed through the observation volume during a 12 min interval, and analyzed particle-by-particle. Each data point in FIG. 1 corresponds to an individual sphere, and is colored by the local density of measurements.

SVM-mediated holographic characterization clearly identifies the four populations of particles without any a priori assumptions, and provides estimates for their relative abundances. Characterizing multicomponent dispersions is a unique capability of holographic particle analysis, and can be performed with SVMs as fast as particles' holograms can be acquired.

Neither the instrument nor the analytical technique requires extensive calibration. The wavelength of the laser and the effective magnification can be calibrated once and used for all samples. The refractive index of the medium is the only free parameter, and often can be obtained separately. These parameters are used to train the SVMs in advance, after which they can be used to analyze arbitrary samples dispersed in the medium.

Experiments

Tracking a single colloidal sphere as it sediments and diffuses provides insights into the precision and accuracy of SVM-mediated holographic characterization. The data in FIG. 2 were obtained with a 1.59 μm-diameter polystyrene sphere (Duke Scientific, catalog 4016A) diffusing as it sedimented through deionized water near the midplane of a 120 μm-deep channel. FIG. 2(a) shows the time-resolved trajectory, zp(t), obtained from a sequence of 4,500 video frames recorded at 29.97 frames/s using iterative SVM training.

Because polystyrene is roughly 5 percent more dense than water, the sphere sediments more than 10 μm over the course of the experiment. The insets to FIG. 2(a) show how markedly the hologram's appearance changes from the beginning of the trajectory to the end. Despite these changes, the SVMs' estimates for the radius and refractive index plotted in FIG. 2(b) remain clustered around the mean values ap=0.79±0.02 μm and np=1.600±0.006.

Uncertainties in estimated parameters are computed as standard deviations of the distribution of results plotted in FIG. 2(b). These should be interpreted with care because errors in SVM estimates need not be independent or normally distributed. Data points in FIG. 2(b) cluster around different values as the particle descends, which suggests that different support vectors dominate the estimates for ap and np when the sphere is at different axial positions. Systematic errors in the individual parameters therefore may vary with changes in any of the parameters' values. Even so, the averages of the SVM estimates are consistent with the manufacturer's specifications, and differ only slightly from those obtained with a full Lorenz-Mie analysis of the same data set, which yields ap=0.805±0.001 μm and np=1.5730±0.0006. Nonlinear fitting offers ten times better precision and accuracy. SVM analysis is a thousand times faster.

The mean sedimentation speed, vp=66±1 nm/s, estimated from the slope of zp(t) is some-what smaller than the value measured with fits to the Lorenz-Mie theory of 75±1 nm/s. This discrepancy further suggests that the SVM estimate for a parameter's value may depend on the value itself. As described above with regard to Equations 7 and 8, if it is assumed that errors in zp are normally distributed with a root-mean-square value ∈_z, then the diffusing particle's mean-squared displacement should evolve over time interval τ asΔz_p²(τ)≡[z_p(t+τ)−z_p(t)]=2Dτ+ν_p²τ²+2∈_z²,  (11)

where D=kBT/(6πηap) is the Stokes-Einstein value for the particle's diffusion coefficient. The data in FIG. 2(c) yield D=0.319±0.004 μm²/s, which is slightly larger than the value of 0.292±0.004 μm²/s obtained with the full Lorenz-Mie analysis. The best-fit tracking error, εz=107±2 nm, exceeds the Lorenz-Mie bound by an order of magnitude.

The results presented here are typical of the performance of SVMs for characterizing and tracking colloidal spheres. The speed and precision of SVM characterization is ideal for monitoring, feedback control and quality assurance in any industrial process involving colloidal spheres. Being able to resolve multimodal distributions by quickly amassing single-particle measurements avoids ambiguities inherent in population-averaging methods such as dynamic light scattering. Extracting the refractive index as well as the size offers insights into sample composition that otherwise would not be available. SVM-accelerated tracking can be used for real-time three-dimensional particle-image velocimetry. For applications such as microrefractometry, the medium's refractive index, n_m, can be estimated instead of the particle's.

This combination of capabilities enables new applications. For example, the distribution of properties in colloidal mixtures could serve as fingerprints for complex fluid systems, with the sizes, refractive indexes and relative abundances encoding information that can be accessed with SVM-mediated holographic characterization. Thus, in one implementation colloidal fingerprinting includes adding a mixture of colloidal particles to a product, where the different types of particles differ in their radii and refractive indexes. Those properties are selected from distinct and distinguishable classes. As an example, the four-part mixture of large and small spheres made of silica and polystyrene described above. The presence or absence of different classes of spheres (e.g. large silica) can be used to embed information in the product. That information can be read out using the described holographic characterization techniques, including fast analysis with machine learning techniques (e.g. SVRs). Encoded information might include the date on which the product was created, the manufacturing location, the processing history, and so on. The colloidal “fingerprint” can be added to the product at the time of manufacturing without changing the other desirable properties of the product. This fingerprint then can be read-out at a later time by our method. No other single method would be able to distinguish all the properties of the dispersed particles at once, and thus no other method would be able to “read” the fingerprint. In one particular implementation, the fingerprinting could be used as an anti-counterfeiting measure. Further, the colloidal mixtures could be selected to have properties that vary over time such as due to breakdown of a compound to further provide a key for the fingerprint or act as another variable in the fingerprint.

Such applications can be realized with comparatively simple instruments conveying image data to low-power computers. Although training SVMs can be computationally intensive, the data comprising a set of trained SVMs occupies less than 100 Mbyte. Pre-computed SVMs therefore can be archived and rapidly retrieved when needed. This approach lends itself to implementation on embedded computers for integration into low-cost analytical instruments.

Other machine-learning techniques also might be effective for analyzing holograms of colloidal particles. Artificial neural networks, for instance, can be trained in the same manner as the present SVM implementation to interpret radial profiles of experimental holograms. SVMs have the advantage that their training process proceeds deterministically, and therefore tends to be faster. Once successfully trained, however, artificial neural networks are generally more computationally efficient. Regardless of implementation, the present results demonstrate that machine-learning methods facilitate fast and precise measurements of colloidal properties.

FIG. 7 shows an exemplary block diagram of a system 100 for both this first embodiment and for a second embodiment described hereinafter. For example, an exemplary procedure in accordance with these embodiments can be performed by a processing arrangement 110 and/or a computing arrangement 110. Such processing/computing arrangement 110 can be, e.g., entirely or a part of, or include, but not limited to, a computer/processor that can include, e.g., one or more microprocessors, and use instructions stored on a computer-accessible medium (e.g., RAM, ROM, hard drive, or other storage device).

As shown in FIG. 7, e.g., a computer-accessible medium 120 (e.g., as described herein, a storage device such as a hard disk, floppy disk, memory stick, CD-ROM, RAM, ROM, etc., or a collection thereof) can be provided (e.g., in communication with the processing arrangement 110). The computer-accessible medium 120 may be a non-transitory computer-accessible medium. The computer-accessible medium 120 can contain executable instructions 130 thereon. In addition or alternatively, a storage arrangement 140 can be provided separately from the computer-accessible medium 120, which can provide the instructions to the processing arrangement 110 so as to configure the processing arrangement to execute certain exemplary procedures, processes and methods, as described herein, for example. The system 100 includes a computer with a non-transitory computer-accessible medium containing executable instructions therein to analyze features of an object, wherein when at least one hardware computing arrangement 110 executes the instructions, the hardware computing arrangement 110 performs a method comprising the steps thereof, receiving hologram data of the object; containing information on direction of intensity gradients for the hologram data and analyzing the hologram data to determine the direction of the intensity gradients, thereby enabling the identification of features of the object.

The foregoing description of illustrative embodiments has been presented for purposes of illustration and of description. It is not intended to be exhaustive or limiting with respect to the precise form disclosed, and modifications and variations are possible in light of the above teachings or may be acquired from practice of the disclosed embodiments. It is intended that the scope of the invention be defined by the claims appended hereto and their equivalents.

Claims

1. A method of feature identification in holographic tracking and identification for features of a spherical object, comprising the steps of: inputting a collimated laser beam;scattering the collimated laser beam from the object to generate a scattered beam;recording a hologram characteristic of the interference between the scattering beam and the input beam;determining, using an orientational alignment transform, from the recorded hologram an estimate of a two-dimensional position of the spherical object; anddetermining, using the two-dimensional position of the spherical object and a machine learning algorithm an estimate of an axial position of the object and a size of the spherical object and a refractive index of the spherical object.

2. The method of claim 1, wherein determining, using the orientational alignment transform, from the recorded hologram an estimate of a two-dimensional position of the spherical object further comprises: establishing intensity gradients for pixels in the hologram;determining direction for the intensity gradients for each of the pixels; andanalyzing the direction of the intensity gradients to identify centers of rotational symmetry.

3. The method of claim 2, further comprising transforming each of the center of rotational symmetry into a centers of brightness.

4. The method of claim 2, wherein determining the object's position in a plane of the hologram comprises coalescing ring-like features into centers of brightness with a circular Hough transform and then locating the centers of brightness.

5. The method of claim 1, wherein further comprising: applying Lorenz-Mie solution to the recorded scattering; anddetermining the estimate of the axial position as well as object size and refractive index from the application of the Lorenz-Mie solution to the recorded scattering.

6. The method of claim 5, wherein the determination of the axial position, object size and refractive index is obtained with a machine learning algorithm, and wherein determining the estimate comprises comparing the hologram to a set of learned models in the machine learning algorithm.

7. The method in claim 6, wherein the machine learning algorithm consists of a support vector machine.

8. The method of claim 7, wherein the machine learning device is a neural network and determining the estimate comprises comparing the hologram to a set of learned models in the neural network.

9. A method of feature identification in holographic tracking and identification for features of an object, comprising the steps of: inputting a collimated laser beam;scattering the collimated laser beam from the object to generate a scattered beam;recording a hologram characteristic of the scattering beam;establishing intensity gradients with an orientational alignment transform for a plurality of pixels in the hologram;determining direction for the intensity gradients for each of the pixels; andanalyzing the direction of the intensity gradients to identify features of the object.

10. The method as defined in claim 9 wherein the direction of the intensity gradients is associated with a direction analysis,

11. The method as defined in claim 10 wherein the direction of the intensity gradients derived from ϕ(r) is determined by applying the step of performing a voting analysis.

12. The method as defined in claim 11 wherein the voting analysis comprises the step of establishing votes for each of the pixels along a preferred direction with votes tallied.

13. The method as defined in claim 12 wherein the votes tallied are evaluated to determine most votes, thereby establishing candidates for a center position of the object.

14. The method as defined in claim 12 wherein the votes tallied for each of the pixels are calculated directly as a solution of a set of simultaneous equations.

15. The method as defined in claim 12 further including the step of identifying the pixels having background intensity contributions, thereby removing those pixels from the voting analysis.

16. The method as defined in claim 11 wherein the ϕ(r) is determined by the step of applying a continuous transform of local orientation field.

17. The method as defined in claim 16 wherein the continuous transform of the local orientation field includes determining a gradient image using a two-fold orientation order parameter, Ψ(r)=|∇b(r)|2e2iϕ(r),wherein the factor of 2 multiplying ϕ(r) accounts for the bidirectionality of orientation information obtained from the intensity gradients.