会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Locating regions in a target image using color match, luminance pattern match and hill-climbing techniques
    • 使用颜色匹配,亮度图案匹配和爬山技术来定位目标图像中的区域
    • US07039229B2
    • 2006-05-02
    • US10005548
    • 2001-10-26
    • Siming LinDinesh NairDarren R. Schmidt
    • Siming LinDinesh NairDarren R. Schmidt
    • G09K9/00
    • G06K9/6293G06K9/3241G06K9/4652
    • 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.
    • 一种用于在与颜色和图案信息相匹配的模板图像中定位目标图像中的区域的系统和方法。 模板图像的特征在于图案和颜色。 使用来自模板图像的颜色表征的颜色信息进行首次搜索,以优选地通过爬山技术来找到匹配候选位置。 对于每个颜色匹配候选位置,在靠近该位置的区域上执行亮度图案匹配搜索(可选地使用爬山技术),产生最终匹配区域。 对于每个最终匹配区域,可以使用来自每个图案的内部的像素样本来计算色调平面图案匹配分数。 可以针对每个最终匹配区域计算最终颜色匹配分数。 从亮度模式匹配,颜色匹配和可能的色调模式匹配,分数以及得分和总和输出计算最终得分。
    • 4. 发明授权
    • Generating a curve matching mapping operator by analyzing objects of interest and background information
    • 通过分析感兴趣的对象和背景信息来生成曲线匹配映射运算符
    • US07136505B2
    • 2006-11-14
    • US10264059
    • 2002-10-03
    • Lothar WenzelRam RajagopalSatish V. KumarDarren R. SchmidtKevin M. CrottyMatthew S. FisherDinesh Nair
    • Lothar WenzelRam RajagopalSatish V. KumarDarren R. SchmidtKevin M. CrottyMatthew S. FisherDinesh Nair
    • G06K9/00
    • G06K9/6204G06K9/48
    • 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.
    • 用于确定在模式匹配应用中使用的映射运算符的系统和方法,其中所述映射运算符增强各个感兴趣对象和背景对象(例如,不感兴趣的对象)之间的差异。 接收关于感兴趣的对象的信息和在所获取的目标数据集中可能与感兴趣的对象一起出现的对象的第一和第二信息。 使用第一信息和第二信息确定映射运算符,通过确定表征感兴趣对象的模板离散曲线,确定表征背景对象的一个​​或多个目标离散曲线,以及生成增强映射模板离散化之间的差异的映射运算符 曲线和映射的目标离散曲线。 操作者被存储在存储器中,并可操作以在模式匹配应用中使用以定位所获取的目标数据集或图像中的感兴趣对象的实例。
    • 8. 发明申请
    • Rearrangement of Algebraic Expressions Based on Operand Ranking Schemes
    • 基于操作数排序方案的代数表达式重排
    • US20130024848A1
    • 2013-01-24
    • US13189275
    • 2011-07-22
    • Somashekaracharya G. BhaskaracharyaDarren R. SchmidtAdam L. Bordelon
    • Somashekaracharya G. BhaskaracharyaDarren R. SchmidtAdam L. Bordelon
    • G06F9/45
    • G06F8/443
    • 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).
    • 一种基于排序操作数方案来重新排列程序代码中出现的代数表达式的系统和方法。 系统扫描程序代码以识别由程序代码指定的代数表达式。 该表达式包括二进制操作,标量操作数和至少一个数组操作数。 系统通过代数表达式来获得最终表达式:计算每个操作数的等级; 并在代数表达式的选定子表达式上执行代数变换,使得在最终表达式操作数中以其等级的顺序组合。 排序方案可以被设计成强制在数组之前组合标量,和/或强制常数被组合起来,循环不变量第二,变量最后。 在一些实施例中,排序方案是包括两个或更多个组件(诸如不变性秩,维度等级和数据大小等级)的向量排序方案。