专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

21. 发明授权

US5999664A System for searching a corpus of document images by user specified document layout components 失效
标题翻译：用户通过用户指定的文档布局组件搜索文档图像的语料库的系统
公开(公告)号：US5999664A
公开(公告)日：1999-12-07
申请号：US971022
申请日：1997-11-14
申请人： James V. Mahoney , Jeanette L. Blomberg , Randall H. Trigg , Christian K. Shin
发明人： James V. Mahoney , Jeanette L. Blomberg , Randall H. Trigg , Christian K. Shin
IPC分类号： G06F17/30 , G06K9/20 , G06T1/00 , G06T7/40 , G06T11/60 , G06K9/54
CPC分类号： G06K9/00463 , G06F17/30256 , G06F17/30265 , G06K9/2054 , G06K2209/01
摘要： A document search system provides a user with a programming interface for dynamically specifying features of documents recorded in a corpus of documents. The programming interface operates at a high-level that is suitable for interactive user specification of layout components and structures of documents. In operation, a bitmap image of a document is analyzed by the document search system to identify layout objects such as text blocks or graphics. Subsequently, the document search system computes a set of attributes for each of the identified layout objects. The set of attributes which are identified are used to describe the layout structure of a page image of a document in terms of the spatial relations that layout objects have to frames of reference that are defined by other layout objects. After computing attributes for each layout object, a user can operate the programming interface to define unique document features. Each document feature is a routine defined by a sequence of selections operations which consume a first set of layout objects and produce a second set of layout objects. The second set of layout objects constitutes the feature in a page image of a document. Using the programming interface, a user flexibly defines a genre of document using the user-specified document features.
摘要翻译：文档搜索系统向用户提供用于动态地指定记录在文档语料库中的文档的特征的编程接口。编程接口在适用于布局组件和文档结构的交互式用户规范的高级操作。在操作中，由文档搜索系统分析文档的位图图像以识别诸如文本块或图形的布局对象。随后，文档搜索系统计算每个识别的布局对象的一组属性。所标识的属性集合用于描述文档的页面图像的布局结构，其方式是布局对象具有由其他布局对象定义的引用框架的空间关系。在计算每个布局对象的属性之后，用户可以操作编程接口来定义唯一的文档特征。每个文档特征是由消耗第一组布局对象并产生第二组布局对象的选择操作序列定义的例程。第二组布局对象构成文档的页面图像中的特征。使用编程界面，用户可以使用用户指定的文档功能灵活定义文档类型。

22. 发明授权

US5889886A Method and apparatus for detecting running text in an image 失效
标题翻译：用于检测图像中的运行文本的方法和装置
公开(公告)号：US5889886A
公开(公告)日：1999-03-30
申请号：US563479
申请日：1995-11-28
申请人： James V. Mahoney
发明人： James V. Mahoney
IPC分类号： G06K9/20 , G06K9/36
CPC分类号： G06K9/00456
摘要： The present invention is a method and apparatus for analyzing image data, and more particularly for analyzing image data representing images containing text to partition the image into running and non-running text regions therein. The present invention utilizes characteristics of running text regions to identify such regions and to subsequently group all non-running text regions into related groups.
摘要翻译：本发明是用于分析图像数据的方法和装置，更具体地说，用于分析表示包含文本的图像的图像数据，以将图像分割成其中的运行和不运行的文本区域。本发明利用运行文本区域的特征来识别这些区域并且随后将所有非运行的文本区域分组成相关组。

23. 发明授权

US5522022A Analyzing an image showing a node-link structure 失效
标题翻译：分析显示节点链接结构的图像
公开(公告)号：US5522022A
公开(公告)日：1996-05-28
申请号：US157600
申请日：1993-11-24
申请人： Satyajit Rao , James V. Mahoney
发明人： Satyajit Rao , James V. Mahoney
IPC分类号： G06T7/60 , G06K9/00 , G06T5/00
CPC分类号： G06K9/00476
摘要： Input image data define an input image set that shows a node-link structure, such as a directed graph, an undirected graph, a tree, a flow chart, a circuit diagram, or a state-transition diagram. The input image set can include one image showing the node-link structure or two images, one showing graphical features that are a subset of the nodes and the other an image of an overlay with editing marks that include the links and another subset of the nodes. The input image data are used to obtain likely node-link data indicating parts of the input image set that satisfy a constraint on nodes and parts that satisfy a constraint on links. The likely node-link data are used to obtain constrained node-link data indicating subsets of the likely nodes and links that satisfy a constraint on node-link structures. The likely node-link data can include data defining a likely node image showing parts that meet a node criterion and data defining a likely link image showing parts that meet a link criterion. The constrained node-link data can be obtained by iteratively applying a link nearness criterion to the likely nodes and a node nearness criterion to the likely links until stability is reached. The constrained node-link data can be used to obtain output image data defining an output image that includes a precisely formed version of the node-link structure or an edited version of an input image. Or the constrained node-link data can be used to provide control signals to a system.
摘要翻译：输入图像数据定义了显示诸如有向图，无向图，树，流程图，电路图或状态转换图之类的节点链接结构的输入图像集。输入图像集可以包括示出节点链接结构或两个图像的一个图像，一个显示作为节点的子集的图形特征，另一个显示具有包括链接的编辑标记的覆盖图像和节点的另一个子集。输入图像数据用于获得指示输入图像集合的满足对链接的约束的节点和部分的约束的可能的节点链接数据。可能的节点链接数据用于获得指示可能节点和满足节点链路结构约束的链路的子集的受限节点链接数据。可能的节点链接数据可以包括定义可能的节点图像的数据，其显示满足节点标准的部分，以及定义可能的链接图像的数据，其显示满足链接标准的部分。可以通过对可能的节点迭代地应用链路接近度准则并获得对可能链路的节点接近度标准直到稳定性来获得约束的节点链路数据。受限节点链接数据可用于获得定义输出图像的输出图像数据，该输出图像数据包括精确形成的节点链接结构版本或输入图像的编辑版本。或者受限的节点链路数据可用于向系统提供控制信号。

24. 发明授权

US06562077B2 Sorting image segments into clusters based on a distance measurement 失效
标题翻译：基于距离测量将图像段排列成群集
公开(公告)号：US06562077B2
公开(公告)日：2003-05-13
申请号：US08970507
申请日：1997-11-14
申请人： Daniel G. Bobrow , James V. Mahoney , William J. Rucklidge
发明人： Daniel G. Bobrow , James V. Mahoney , William J. Rucklidge
IPC分类号： G06F700
CPC分类号： G06F17/30011 , G06K9/00463 , G06K9/00483
摘要： A programming interface of document search system enables a user to dynamically specifying features of documents recorded in a corpus of documents. The programming interface provides category and format flexibility for defining different genre of documents. The document search system initially segments document images into one or more layout objects. Each layout object identifies a structural element in a document such as text blocks, graphics, or halftones. Subsequently, the document search system computes a set of attributes for each of the identified layout objects. The set of attributes are used to describe the layout structure of a page image of a document in terms of the spatial relations that layout objects have to frames of reference that are defined by other layout objects. Using the set of attributes a user defines features of a document with the programming interface. After receiving a feature or attribute and a set of document images selected by a user, the system forms a set of image segments by identifying those layout objects in the set of document images that make up the selected feature or attribute. The system then sorts the set of image segments into meaningful groupings of objects which have similarities and/or recurring patterns. Subsequently, document images in the set of document images are ordered and displayed to a user in accordance with the meaningful groupings.
摘要翻译：文档搜索系统的编程界面使得用户能够动态地指定记录在文档语料库中的文档的特征。编程接口为定义不同类型的文档提供了类别和格式的灵活性。文档搜索系统最初将文档图像分割成一个或多个布局对象。每个布局对象标识文档中的结构元素，例如文本块，图形或半色调。随后，文档搜索系统计算每个识别的布局对象的一组属性。这些属性集用于描述文本的页面图像的布局结构，即布局对象必须具有由其他布局对象定义的引用框架的空间关系。使用该属性集，用户使用编程界面定义文档的特征。在接收到用户选择的特征或属性以及一组文档图像之后，系统通过识别构成所选特征或属性的文档图像集合中的那些布局对象来形成一组图像片段。然后，系统将该组图像段排序成具有相似性和/或重复模式的对象的有意义的分组。随后，根据有意义的分组，将一组文档图像中的文档图像排序并显示给用户。

25. 发明授权

US5563991A Using an image showing a perimeter relationship representation to obtain data indicating a relationship among distinctions 失效
标题翻译：使用显示周界关系表示的图像来获取指示区别之间的关系的数据
公开(公告)号：US5563991A
公开(公告)日：1996-10-08
申请号：US157790
申请日：1993-11-24
申请人： James V. Mahoney
发明人： James V. Mahoney
IPC分类号： G06T7/00 , G06T7/60
CPC分类号： G06K9/00476 , G06K9/468 , G06T7/602
摘要： Input image data define an input image that shows a perimeter relationship representation, such as a Venn diagram or statechart. The representation includes a perimeters feature that satisfies a constraint on perimeters. The constraint can include a perimeter size criterion that distinguishes perimeters from labels. Or the constraint can include an enclosing perimeter criterion requiring a connected component within each perimeter and a perimeter label criterion requiring a label for each perimeter. The constraint can also include an empty perimeter criterion to distinguish empty perimeters from labels. The input image data are used to obtain perimeters data indicating parts of the input image that satisfy the constraint. The perimeters data are used to obtain relationship data indicating a relationship between distinctions represented by the perimeters. The relationship data can be used to obtain output image data defining an output image that includes precisely formed version of the representation or another graphical representation of the relationship, such as a table. The table can include a set label at the head of each row and an element label at the head of each column, with a bullet in a space in a row and column if the row's set includes the column's element.
摘要翻译：输入图像数据定义显示周边关系表示的输入图像，例如维恩图或状态图。该表示包括满足周长约束的周长特征。约束可以包括区分周长与标签的周长尺寸标准。或者约束可以包括需要在每个周边内连接的组件的周边边界标准，以及需要每个周边的标签的周边标签标准。约束还可以包括用于区分空白周界和标签的空的周长标准。输入图像数据用于获得指示满足约束的输入图像的部分的周长数据。使用周长数据来获得表示由周边表示的区别之间的关系的关系数据。关系数据可用于获得定义输出图像的输出图像数据，所述输出图像数据包括精确形成的表示版本或关系的另一图形表示，诸如表格。该表可以在每行的头部包含一个集合标签，并在每列的头部包含一个元素标签，如果该行的列包含该列的元素，则该行的列中的空格中将包含一个项目符号。

26. 发明授权

US5537491A Analyzing an image or other data to obtain a stable number of groups 失效
标题翻译：分析图像或其他数据以获得稳定数量的组
公开(公告)号：US5537491A
公开(公告)日：1996-07-16
申请号：US158053
申请日：1993-11-24
申请人： James V. Mahoney , Satyajit Rao
发明人： James V. Mahoney , Satyajit Rao
IPC分类号： G06T7/60 , G06K9/34 , G06K9/68
CPC分类号： G06K9/342 , G06K2209/01
摘要： To group items in an array, gap data are obtained indicating gaps between items. The gap data are used to obtain threshold data, which are then used to obtain grouping data. The gaps could, for example, be distances between items in a two-dimensional array or differences between values at which items occur in a one-dimensional array. The threshold data indicate a threshold. The threshold would produce a number of groups of the items that is stable across a range of thresholds, and the range of thresholds meets a criterion for largeness of a range. The criterion can require, for example, that the range be larger than the stable range of thresholds of any other number in a set of numbers of groups. The threshold can be obtained iteratively by applying a candidate threshold for each iteration. The candidate thresholds can be incremented, and the iterations can be counted to find a number of groups meeting the criterion. Or the candidate thresholds can be increased by differences between gaps, and a running sum of threshold ranges can be used to find a number of groups meeting the criterion. The threshold can also be obtained directly by finding the largest difference between gap extents and obtaining a threshold within the largest difference. Many types of grouping can be performed, including spatial clustering, segmentation of partially bounded regions, segmentation by local width, and global and local similarity grouping.
摘要翻译：要对数组中的项目进行分组，获得指示项目间差距的间隙数据。间隙数据用于获得阈值数据，然后用于获得分组数据。间隙可以例如是二维阵列中的项之间的距离或在一维阵列中出现项的值之间的差异。阈值数据表示阈值。阈值将产生在一定范围的阈值下稳定的多个组，并且阈值的范围满足范围的大小的标准。该标准可以要求例如，该范围大于一组组中的任何其他数量的阈值的稳定范围。可以通过对每次迭代应用候选阈值来迭代地获得阈值。可以增加候选阈值，并且可以对迭代进行计数以找到符合标准的多个组。或者可以通过间隙之间的差异来增加候选阈值，并且可以使用阈值范围的运行总和来找到满足该标准的多个组。也可以通过找到间隙范围内的最大差异并获得最大差异内的阈值直接获得阈值。可以执行许多类型的分组，包括空间聚类，部分有界区域的分割，局部宽度的分割以及全局和局部相似性分组。

27. 发明授权

US5305395A Exhaustive hierarchical near neighbor operations on an image 失效
标题翻译：对图像进行彻底分层近邻操作
公开(公告)号：US5305395A
公开(公告)日：1994-04-19
申请号：US535438
申请日：1990-06-08
申请人： James V. Mahoney , David T. Clemens
发明人： James V. Mahoney , David T. Clemens
IPC分类号： G06T1/60 , G06T5/20 , G06K9/00
CPC分类号： G06K9/4638 , G06T5/20
摘要： Near neighbor data is produced hierarchically for each pixel of an image. Each pixel's near neighbor data indicates the presence of an approximate near neighbor pixel in each of four quadrants with respect to the pixel, and can also indicate distance and orientation to the near neighbor pixel. The near neighbor data can be produced by parallel processing units, with each processing unit producing, for a respective pixel, a near neighbor data item at every level of the hierarchy. Each near neighbor data item can indicate the presence of an approximate near neighbor in a respective region of the image. A near neighbor data item for a higher level region can be produced by selecting between near neighbor pixels indicated by near neighbor data items for subregions at the next lower level, by choosing the near neighbor pixel that is nearer. The quadrants can be asymmetric so that each pixel is not included in any of its four quadrants and so that the quadrants do not overlap. To provide accurate near neighbor data for a black pixel, the near neighbor data can be shifted to the black pixel from the adjacent pixels, each at the origin of one of its quadrants. Offsets in the near neighbor data can also be adjusted accordingly. Each processing unit can store a bit vector such that the bit vectors together indicate the paths between neighbor pixels and owner pixels, to facilitate subsequent communication between owners and neighbors. Each bit of the bit vector can indicate, for each level of the hierarchy, which of the processing unit's children is on the path at the next lower level. A path defined in this manner can be followed to shift focus from a current focus pixel to one of its near neighbors.
摘要翻译：对于图像的每个像素分层地产生近邻数据。每个像素的近邻数据指示相对于像素在四个象限中的每一个中存在近似近似像素，并且还可以指示近邻像素的距离和取向。近邻数据可以由并行处理单元产生，每个处理单元为各个像素生成层次结构的每一级的近邻数据项。每个近邻数据项可以指示在图像的相应区域中存在近似近邻。通过选择更接近的近邻像素，可以通过在下一较低级别的子区域中通过近邻数据项指示的近邻像素之间进行选择来产生较高级别区域的近邻数据项。象限可以是不对称的，使得每个像素不包括在其四个象限中的任何一个中，并且使得象限不重叠。为了为黑色像素提供准确的近邻数据，近邻数据可以从相邻像素移动到黑色像素，每个在其象限中的一个的原点。近邻数据中的偏移也可以相应调整。每个处理单元可以存储位向量，使得位向量一起指示相邻像素和所有者像素之间的路径，以便于所有者和邻居之间的后续通信。位向量的每个位可以针对层级的每个级别指示哪个处理单元的子进程位于下一级的路径上。可以遵循以这种方式定义的路径，以将焦点从当前焦点像素移动到其近邻中的一个。

28. 发明授权

US5255354A Comparison of image shapes based on near neighbor data 失效
标题翻译：基于近邻数据的图像形状比较
公开(公告)号：US5255354A
公开(公告)日：1993-10-19
申请号：US535091
申请日：1990-06-08
申请人： James V. Mahoney
发明人： James V. Mahoney
IPC分类号： G06T5/20 , G06T7/00 , G06F15/62
CPC分类号： G06T5/20 , G06K9/4638 , G06T7/0067
摘要： Shapes are compared by obtaining a measure of dissimilarity based on near neighbor data. First, an image of one shape is analyzed to obtain, for each pixel position, a distance to the nearest pixel that meets a criterion, such as a black pixel. Then, a sum of distances is obtained by totalling the distances of the pixel positions at which an image of another shape meets the criterion. The sum indicates dissimilarity. The near neighbor distances and sum can be obtained by hierarchical operations.
摘要翻译：通过基于近邻数据获得不相似度的度量来比较形状。首先，分析一种形状的图像，以针对每个像素位置获得满足诸如黑色像素的标准的最近像素的距离。然后，通过对另一形状的图像满足标准的像素位置的距离进行合计来获得距离之和。总和表示不相似。近邻距离和和可以通过分层操作获得。

29. 发明授权

US5231676A Hierarchical operations on border attribute data for image regions 失效
标题翻译：用于图像区域的边界属性数据的分层操作
公开(公告)号：US5231676A
公开(公告)日：1993-07-27
申请号：US535213
申请日：1990-06-08
申请人： James V. Mahoney
发明人： James V. Mahoney
IPC分类号： G06T7/00 , G06K9/48
CPC分类号： G06K9/4638
摘要： A hierarchy of border attribute data items is produced from a body of data such as the pixel values of an image. Each border attribute data item indicates an attribute of a border of an analysis region of the image. The starting border attribute data items, at the lowest level of the hierarchy, are produced by operation on the pixel values. Each border attribute data item at a higher level in the hierarchy is produced by operating on a respective set of data items from the next lower level. The border attribute data items can indicate, for example, the number of black pixels in each border or the number of edge pixels in each border. Or the border attribute data items could include boolean values indicating whether any of the pixels in a border is a black pixel with a neighboring black pixel outside the border. For rectangular regions in a binary hierarchy, values for two borders can be added or logically combined at a first level and one of the values for the same two borders can be selected at the next higher level; one of the values for the other two borders can be selected at the first level and the values for those two borders can be added or logically combined at the next higher level.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式