National Instruments Corporation

Darren R Schmidt

Dinesh R Nair

Lothar Wenzel

Ram Rajagopal

Satish V Kumar

Matthew S Fisher

Kevin M Crotty

Siming Lin

James C Nagle

Michael D Cerna

Bin Wang

Kevin L Schultz

Nicolas F Vazquez

Aljosa Vrancic

Yong Rao

Subramanian Ramamoorthy

Adam L Bordelon

James M Lewis

Kyle P Gupton

Qing Ruan

Benjamin R Weidman

Naxiong Zhang

Nicolas Vazqúez

Somashekaracharya G Bhaskaracharya

Performing sequencing of a polynucleotide. A first image of microparticles that are distributed in a random fashion on a substrate may be received. Each of the microparticles may include a plurality of similar oligonucleotides of the polynucleotide. A second image of the microparticles may be received. A plurality of first subportions of the first image may be determined. Each subportion may include a respective plurality of microparticles distributed in a random fashion. The second image may be analyzed to identify a plurality of second subportions in the second image. Each of the plurality of second subportions may correspond to a respective one of the plurality of first subportions. A plurality of the microparticles may be matched from the first and second images based on said analyzing. At least a portion of the sequence of nucleotides of the polynucleotide may be determined based on said matching.

Identifying randomly distributed microparticles in images to sequence a polynucleotide

A system and method for rearranging algebraic expressions occurring in program code based on a scheme of ranking operands. The system scans program code to identify an algebraic expression specified by the program code. The expression includes binary operations, scalar operands and at least one array operand. The system operates on the algebraic expression to obtain a final expression by: computing a rank for each of the operands; and performing algebraic transformations on selected subexpressions of the algebraic expression so that in the final expression operands are combined in the order of their rank. The ranking scheme may be designed to force scalars to be combined before arrays, and/or, to force constants to be combined first, loop invariants second, and variants last. In some embodiments, the ranking scheme is a vector ranking scheme including two or more components (such as invariance rank, dimensional rank and data-size rank).

Rearrangement of algebraic expressions based on operand ranking schemes

System and method for approximating a system. A multi-parameter representation of a family of systems is stored. An embedding of the family into an abstract geometrical continuous space with a metric and defined by the parameters is determined. Coordinates of the space specify values for the parameters of systems of the family. The space includes a grid of points representing respective discrete approximations of the systems. A first point corresponding to a desired instance of a system is determined. The first point's coordinates specify values for the parameters of the instance. The space is sampled using a mapping of a well-distributed point set from a Euclidean space of the parameters to the abstract space. A nearest discrete point to the first point is determined which specifies values for parameters for an optimal discrete approximation of the desired instance, which are useable to implement the discrete approximation of the desired instance.

Approximating a system using an abstract geometrical space

System and method for performing time-bounded execution of a program. A timed program execution process is initiated, and a timeout process is initiated. A timeout condition is configured in the timeout process at a first priority level, and a rollback state determined for the program. Execution of the program is initiated in the timed program execution process at a second priority level below the first priority level. During execution of the program, the timeout process determines if the timeout condition has occurred, and if so, the timeout process restores the execution of the program to the rollback state, and the timed program execution process resumes execution of the program from the rollback state with the timeout condition. The program exits in the timed program execution process in response to the timeout condition, and the timeout event disabled. The timeout process is terminated, and the timed program execution process is terminated.

Time-bounded program execution

A system and method for selecting a best match of a received input signal from a set of candidate signals, wherein two or more of the candidate signals are uncorrelated. In a preprocessing phase a signal transform (UST) is determined from the candidate signals. The UST converts each candidate signal to a generalized frequency domain. The UST is applied at a generalized frequency to each candidate signal to calculate corresponding generalized frequency component values (GFCVs) for each candidate signal. At runtime, the input signal of interest is received, and the UST is applied at the generalized frequency to the input signal of interest to calculate a corresponding GFCV. The best match is determined between the GFCV of the input signal of interest and the GFCVs of each of the set of candidate signals. Finally, information indicating the best match candidate signal from the set of candidate signals is output.

System and method for signal matching and characterization

System and method for determining the presence of an object of interest in a target data set. Portions of a target data set may be located that match an object of interest, e.g., in a template data set, with respect to various information, e.g., edge or boundary information. The invention includes improved methods for mapping point sets or curves to new point sets or curves for curve matching. The method determines the presence of an object of interest in a target data set despite of or using various types of topological transformations of the object of interest in the target data set. One or more mapping operators are determined based on template curves and/or example target curves. Pattern matching is performed on one or more target data sets using the mapping operator(s) to generate pattern matching results, and the pattern matching results output.

Pattern matching system utilizing discrete curve matching with a mapping operator

System and method for determining the presence of an object of interest in a target image. Regions of a target image may be located that match an object of interest, e.g., in a template image, with respect to various information, e.g., luminance, color and/or other types of boundary information. The invention includes improved methods for mapping point sequences (e.g., pixel sequences) or curves to new point sets or curves for curve matching. The method determines the presence of an object of interest in a target image despite of or using various types of topological transformations of the object of interest in the target image. One or more mapping operators are determined based on template curves and/or example target curves. Pattern matching is performed on one or more target images using the mapping operator(s) to generate pattern matching results, and the pattern matching results output.

Image pattern matching utilizing discrete curve matching with a mapping operator

System and method for determining a mapping operator for use in a pattern matching application, where the mapping operator enhances differences between respective objects of interest and background objects, e.g., objects not of interest. First and second information is received regarding an object of interest and objects that may appear with the object of interest in an acquired target data set, respectively. The mapping operator is determined using the first information and the second information by determining a template discrete curve characterizing the object of interest, determining one or more target discrete curves characterizing the background objects, and generating a mapping operator that enhances differences between the mapped template discrete curve and the mapped target discrete curves. The operator is stored in a memory and is operable to be used in a pattern matching application to locate instances of the object of interest in acquired target data sets or images.

Generating a curve matching mapping operator by analyzing objects of interest and background information

System and method for determining the presence of an object of interest in a target image. Regions of a target image may be located that match an object of interest, e.g., in a template image, with respect to various information, e.g., luminance, color and/or other types of boundary information. The invention includes improved methods for mapping point sets or curves to new point sets or curves for curve matching. The method determines the presence of an object of interest in a target image despite of or using various types of topological transformations of the object of interest in the target image. A plurality of mapping operators are determined based on template curves and/or example target curves, e.g., background object curves. Pattern matching is performed on one or more target images using the mapping operators to generate pattern matching results, and the pattern matching results output.

Pattern matching utilizing discrete curve matching with multiple mapping operators

System and method for re-sampling discrete curves, thereby efficiently characterizing point sets or curves in a space. The method may also provide improved means for mapping point sets or curves to new point sets or curves for curve matching. A weight vector or function is determined based on a plurality of discrete curves, e.g., from one or more template data sets or images. The weight function enhances differences between weighted discrete curves. A set of orthonormal polynomials is determined based on the computed weight function, where the set of orthonormal polynomials comprises a set of orthogonal eigenfunctions of a Sturm-Liouville differential equation. Values for a plurality of zeros for one of the set of orthonormal polynomials is determined that comprise resampling points for the plurality of discrete curves. Each of the plurality of discrete curves is resampled based on the determined values of the plurality of zeros.

Efficient re-sampling of discrete curves

A system and method for measuring the similarity of multiple-color images and for locating regions of a target image having color information that matches, at least to a degree, the color information of a template image. A color characterization method operates to characterize the colors of an image and to measure the similarity between multiple-color images. For each image pixel, the method determines a color category or bin for the respective pixel based on HSI values of the respective pixel, wherein the color category is one of a plurality of possible color categories in HSI color space. In various embodiments, the weight of the pixel may be fractionally distributed across a plurality of color categories, e.g., as determined by applying fuzzy pixel classification with a fuzzy membership function. The percentage of pixels assigned to each category is then determined. The percentage of pixels in each color category is then used as a color feature vector to represent the color information of the color image. A quantitative measurement of the color similarity between color images is then computed based on the distance between their color feature vectors. Once the color information of a template image has been characterized, a target image may be searched in order to locate regions within the target image having matching color information. In one embodiment, a coarse-to-fine heuristic may be utilized, in which multiple search stages of decreasing granularity are performed. A first-stage search may operate to identify a list of candidate match regions based on the city-block distance of the color feature vector computed using a sub-sampling scheme. These candidate match regions may then be examined in further detail in order to determine final matches.

System and method for color characterization using fuzzy pixel classification with application in color matching and color match location

A system and method for locating regions in a target image matching a template image with respect to color and pattern information. The template image is characterized with regard to pattern and color. A first-pass search is made using color information from the color characterization of the template image to find color match candidate locations preferably via a hill-climbing technique. For each color match candidate location, a luminance pattern matching search is performed, optionally using a hill-climbing technique, on a region proximal to the location, producing final match regions. For each final match region a hue plane pattern match score may be calculated using pixel samples from the interior of each pattern. A final color match score may be calculated for each final match region. A final score is calculated from luminance pattern match, color match, and possibly hue pattern match, scores, and the scores and sum output.

Locating regions in a target image using color match, luminance pattern match and hill-climbing techniques

A system and method for performing a curve fit on a plurality of data points. In an initial phase, a subset Pof the plurality of points which represents an optimal curve is determined. This phase is based on a statistical model which dictates that after trying at most Nrandom curves, each connecting a randomly selected two or more points from the input set, one of the curves will pass within a specified radius of the subset Pof the input points. The subset Pmay then be used in the second phase of the method, where a refined curve fit is made by iteratively culling outliers from the subset Pwith respect to a succession of optimal curves fit to the modified subset Pat each iteration. The refined curve fit generates a refined curve, which may be output along with a final culled subset Kof P.

System and method for performing edge detection in an image

A system and method for locating regions in a target image that match a template image with respect to color and pattern information. The method may comprise performing a first-pass search using color information obtained in a color characterization analysis of the template image in order to find a plurality of color match candidate locations. For each color match candidate location, a region proximal to the location may then be searched in detail, based on pattern information obtained in a pattern analysis of the template image.

System and method for locating color and pattern match regions in a target image

A system and method for selecting a best match of a received input signal from a set of candidate signals, wherein two or more of the candidate signals are uncorrelated. In a preprocessing phase a unified signal transform (UST) is determined from the candidate signals. The UST converts each candidate signal to a generalized frequency domain. The UST is applied at a generalized frequency to each candidate signal to calculate corresponding generalized frequency component values (GFCVs) for each candidate signal. At runtime, the input signal of interest is received, and the UST is applied at the generalized frequency to the input signal of interest to calculate a corresponding GFCV. The best match is determined between the GFCV of the input signal of interest and the GFCVs of each of the set of candidate signals. Finally, information indicating the best match candidate signal from the set of candidate signals is output.

Growing community of inventors

Cedar Park, TX, United States of America

Darren R Schmidt