-
1.发明授权Method for document comparison and classification using document image layout 有权使用文档图像布局进行文档比较和分类的方法公开(公告)号：US06542635B1
公开(公告)日：2003-04-01
申请号：US09391713
申请日：1999-09-08
IPC分类号： G06K934
CPC分类号： G06K9/00463
摘要： Document type comparison and classification using layout classification is accomplished by first segmenting a document page into blocks of text and white space. A grid of rows and columns, forming bins, is created on the page to intersect the blocks. Layout information is identified using a unique fixed length interval vector, to represent each row on the segmented document. By computing the Manhattan distance between interval vectors of all rows of two document pages and performing a warping function to determine the row to row correspondence, two documents may be compared by their layout. Furthermore, interval vectors may be grouped into N clusters with a cluster center, defined as the median of the interval vectors of the cluster, replacing each interval vector in its cluster. Using Hidden Markov Models, documents can be compared to document type models comprising rows represented by cluster centers and identified as belonging to one or more document types. In addition, documents stored in a database may be retrieved, deleted, or otherwise managed by type, using their corresponding vector sets without requiring expensive OCR of the document. Furthermore, based on the classification, it is a simple matter to locate which blocks of data contain certain information. Where only that information is desired, it is not necessary to perform OCR on the entire document. Rather OCR may be limited to those blocks where the particular information is expected based on the document type.
摘要翻译： 使用布局分类的文档类型比较和分类是通过首先将文档页面分割成文本和空白块来实现的。 在页面上创建行和列的网格，形成仓，以与块相交。 使用唯一的固定长度间隔向量来标识布局信息，以表示分段文档上的每一行。 通过计算两个文档页面的所有行的间隔向量之间的曼哈顿距离并执行扭曲函数来确定行到行对应关系，可以通过它们的布局来比较两个文档。 此外，间隔向量可以被分组为具有簇中心的N个簇，定义为簇的间隔向量的中值，代替其簇中的每个区间向量。 使用隐马尔可夫模型，可以将文档与包含由集群中心表示的行的文档类型模型进行比较，并将其标识为属于一个或多个文档类型。 此外，存储在数据库中的文档可以通过类型来检索，删除或以其他方式管理，使用其对应的向量集而不需要文档的昂贵的OCR。 此外，基于分类，确定哪些数据块包含某些信息是一件简单的事情。 在只需要该信息的情况下，不需要在整个文档上执行OCR。 相反，OCR可以限于基于文档类型预期特定信息的那些块。
-
公开(公告)号：US06408093B1
公开(公告)日：2002-06-18
申请号：US09391712
申请日：1999-09-08
IPC分类号： G06K968
CPC分类号： G06K9/64 , G06K9/6217 , Y10S707/99935 , Y10S707/99936
摘要： A method for comparing a ranking scheme for an object, such as a document image, with a known standard, or ideal ranking scheme for a comparative assessment of the performance and reliability of the two ranking schemes, is taught. The same set of objects are processed and ranked by both ranking schemes. The ranking scheme being tested is examined for all subject objects ranked lower than its ranking by the ideal ranking scheme. The test ranking scheme is charged for each swapped object which it ranked higher than the subject object, which the ideal ranking scheme ranked lower.
摘要翻译： 教导了用于比较诸如文档图像的对象与已知标准的排名方案或用于比较评估两个排名方案的性能和可靠性的理想排名方案的方法。 相同的对象集由两个排名方案进行处理和排名。 通过理想的排名方案，对所有被评估的排名方案进行排序，对所有排名低于排名的对象进行检查。 对于排名高于主题对象的每个交换对象，测试排名方案是收费的，理想排名方案排名较低。
-
3.发明授权Method and apparatus for verifying static signatures using dynamic information 失效使用动态信息验证静态签名的方法和装置
公开(公告)号：US5930380A
公开(公告)日：1999-07-27
申请号：US798981
申请日：1997-02-11
CPC分类号： G06K9/00154
摘要： In a process of signature verification, an off-line test signature is compared to one or more on-line reference signatures. Dynamic data obtained from the reference signature or signatures may be used to improve the thinning of the test signature. Such data may also be used for segmenting the test signature and sequencing the resulting strokes. In some embodiments, the invention includes evaluating a dynamic error, based at least in part on such sequencing of the test signature. In some further embodiments, the invention includes producing a rendering of at least one on-line reference signature as a two-dimensional image, and evaluating a static error based, at least in part, on shape-matching between the rendered image and the test signature.
摘要翻译： 在签名验证过程中，将离线测试签名与一个或多个在线参考签名进行比较。 从参考签名或签名获得的动态数据可用于改进测试签名的变薄。 这样的数据也可以用于分割测试签名并对得到的笔划进行排序。 在一些实施例中，本发明包括至少部分地基于测试签名的顺序来评估动态错误。 在一些另外的实施例中，本发明包括产生作为二维图像的至少一个在线参考签名的渲染，以及至少部分地基于渲染图像与测试之间的形状匹配来评估静态误差 签名。
-
4.发明授权Method and apparatus for scheduling data packet transmission over a multihop wireless backhaul network 有权用于通过多跳无线回程网络调度数据分组传输的方法和装置公开(公告)号：US07366178B2
公开(公告)日：2008-04-29
申请号：US11225516
申请日：2005-09-13
IPC分类号： H04J1/02
CPC分类号： H04W72/0446 , H04W84/22
摘要： A method and apparatus for scheduling the transmission of data packets over a multihop wireless backhaul network in which delay guarantees through the network may be advantageously ensured. Illustratively, a novel packet scheduling scheme is provided which is advantageously based on an existing scheduling policy for wireline networks and for which a delay guarantee (based on the delay characteristics of the existing scheduling policy) can be advantageously ensured. In one embodiment, an even-odd link activation framework is defined for a given multihop wireless backhaul network, and an associated scheduling policy based on an arbitrary existing scheduling policy for wireline networks is derived and adopted. In such a case, the derived scheduling policy, when applied to the given multihop wireless backhaul network, advantageously ensures a worst-case delay guarantee of approximately twice that of the existing scheduling policy for wireline networks.
摘要翻译： 可以有利地确保通过多跳无线回程网络调度数据分组的传输的方法和装置，其中通过网络的延迟保证。 示例性地，提供了一种新颖的分组调度方案，其有利地基于用于有线网络的现有调度策略，并且可以有利地确保延迟保证（基于现有调度策略的延迟特性）。 在一个实施例中，为给定的多跳无线回程网络定义偶数链路激活框架，并且导出并采用基于用于有线网络的任意现有调度策略的相关调度策略。 在这种情况下，当应用于给定的多跳无线回程网络时，派生的调度策略有利地确保了用于有线网络的现有调度策略的最差情况延迟保证的两倍。
-
5.发明授权System and method for processing and managing electronic copies of handwritten notes 失效用于处理和管理手写笔记电子副本的系统和方法
公开(公告)号：US5838819A
公开(公告)日：1998-11-17
申请号：US557872
申请日：1995-11-14
CPC分类号： G06F1/1611 , G06F1/1616 , G06F1/1626 , G06F1/1698 , G06F17/24 , G06F2200/1632
摘要： A system and method for processing and managing electronic copies of handwritten notes are provided. The system includes a processor for processing the handwritten notes to generate the electronic copies, with each electronic copy associated with a respective identifier corresponding to at least one set of the respective handwritten notes, in which the identifiers facilitate the management of the electronic copies. The system includes an electronic notepad and can also include devices operatively connected to the electronic notepad for operating with the electronic notepad to receive, manage, merge, and/or display the electronic copies from the electronic notepad.
摘要翻译： 提供了一种用于处理和管理手写笔记的电子副本的系统和方法。 该系统包括用于处理手写笔记以产生电子副本的处理器，每个电子副本与相应于相应手写笔记的至少一组的相应标识符相关联，其中标识符有助于电子副本的管理。 该系统包括电子记事本，并且还可以包括可操作地连接到电子记事本的设备，用于与电子记事本一起操作以从电子记事本接收，管理，合并和/或显示电子副本。
-
6.发明授权Method and apparatus for grooming traffic demands according to mileage based tariffs 有权根据里程价格计算交通需求的方法和装置公开(公告)号：US07486682B2
公开(公告)日：2009-02-03
申请号：US10903546
申请日：2004-07-30
IPC分类号： H04L12/28
CPC分类号： H04L41/0896 , H04L45/12 , H04L45/56 , H04L69/14
摘要： A method and apparatus for grooming traffic demands according to mileage based tariffs. An Integer Linear Program (ILP) that captures the traffic grooming problem is defined, and such a linear program can in principle be solved by conventional linear program application systems which are fully familiar to those of ordinary skill in the art. However, the time required to solve such an ILP is fairly large, even for the moderately sized networks we are interested in. That is, there are many possible routes to consider, and hence many integer variables in the ILP. Therefore, further in accordance with the principles of the present invention, the ILP is advantageously run on the Delaunay Triangulation of the network rather than on the completely connected network graph.
摘要翻译： 一种根据里程价格调整交通需求的方法和装置。 定义了捕获流量梳理问题的整数线性规划（ILP），原则上可以通过本领域普通技术人员所熟悉的常规线性程序应用系统来解决这种线性程序。 然而，解决这样的ILP所需的时间相当大，即使对于我们感兴趣的中等规模的网络也是如此。也就是说，有许多可能的路线要考虑，因此ILP中有许多整数变量。 因此，进一步根据本发明的原理，ILP有利地运行在网络的Delaunay Triangulation上，而不是完全连接的网络图上。
-
公开(公告)号：US07194207B2
公开(公告)日：2007-03-20
申请号：US09779315
申请日：2001-02-08
IPC分类号： H04J10/00
CPC分类号： H04Q11/0062 , H04Q2011/0011 , H04Q2011/0064
摘要： The present invention provides a wide-sense, non-blocking WDM cross-connect that utilizes a relatively small number of wavelength interchangers. The cross-connect of the present invention comprises first, second and third fabrics and one or more wavelength interchangers that interconnect the first and second fabrics. Demands that require a change in wavelength are routed through the first fabric, through one or more of the wavelength interchangers, and through the second fabric. Demands that do not require a change in wavelength are only routed through the third fabric. A routing algorithm is utilized to ensure that any sequence of connection requests and withdrawals can be routed without disturbing any currently routed requests.
摘要翻译： 本发明提供了利用相对较少数量的波长交换器的广义无阻塞WDM交叉连接。 本发明的交叉连接包括第一和第三织物以及互连第一和第二织物的一个或多个波长互换器。 需要波长变化的要求通过第一种织物，通过一个或多个波长交换器和第二织物布线。 不需要波长变化的要求只能通过第三层布线。 使用路由算法来确保可以路由任何连接请求和提取序列，而不会干扰任何当前路由的请求。
-
8.发明授权Strictly non-blocking wavelength division multiplexed (WDM) cross-connect device for use in a heterogeneous network 有权用于异构网络的严格无阻塞波分复用（WDM）交叉连接设备公开(公告)号：US06487332B1
公开(公告)日：2002-11-26
申请号：US09471925
申请日：1999-12-23
IPC分类号： G02B626
CPC分类号： H04Q11/0005 , H04Q2011/0011 , H04Q2011/0024
摘要： The present invention provides a strictly non-blocking WDM cross-connect that utilizes a relatively small number of wavelength interchangers. In accordance with one embodiment, the WDM cross-connect utilizes n1k1 wavelength interchangers, where n1 is an integer equal to the number of wavelengths carried on an input optical fiber associated with the WDM cross-connect and k1 is the total number of input optical fibers to the WDM cross-connect. Each of the wavelength interchangers is connected to exactly one input port of the fabric and each input port of the fabric is connected to exactly one wavelength interchanger. The input optical fibers of the WDM cross-connect are connected to k1 optical switches of the cross-connect that separate out the n1 wavelengths onto n1 optical fibers, which are input to respective wavelength interchangers. Therefore, each wavelength interchanger receives exactly n1 optical fibers. The fabric has output ports that are connected to k2 output optical fibers, where k2 is an integer equal to the number of output optical fibers that are connected to the output ports of the fabric. In accordance with another embodiment of the present invention, the WDM cross-connect comprises two fabrics and one or more wavelength interchangers that interconnect the fabrics. The cross-connect in accordance with this embodiment can be rendered strictly non-blocking by utilizing a number of wavelength interchangers equal to (k1+k2)−1, where k1 and k2 correspond to the number of input and output optical fibers, respectively, of the WDM cross-connect. In accordance with both of these embodiments, the number of input and output optical fibers of the strictly non-blocking WDM cross-connect can be unequal.
摘要翻译： 本发明提供了一种使用相对较少数量的波长交换器的严格无阻塞WDM交叉连接。 根据一个实施例，WDM交叉连接利用n1k1波长互换器，其中n1是等于与WDM交叉连接相关联的输入光纤上承载的波长数的整数，k1是输入光纤的总数 到WDM交叉连接。 每个波长交换器连接到织物的正好一个输入端口，并且该结构的每个输入端口连接到正好一个波长交换器。 WDM交叉连接的输入光纤连接到交叉连接的k1个光开关，将n1波长分离到n1个光纤上，这些光纤被输入到各个波长交换器。 因此，每个波长交换器精确地接收n1个光纤。 织物具有连接到k2输出光纤的输出端口，其中k2是等于连接到织物的输出端口的输出光纤的数量的整数。 根据本发明的另一个实施例，WDM交叉连接包括两个织物和互连织物的一个或多个波长互换器。 通过利用等于（k1 + k2）-1的多个波长交换器，可以将根据本实施例的交叉连接严格地不阻塞，其中k1和k2分别对应于输入和输出光纤的数量， 的WDM交叉连接。 根据这两个实施例，严格无阻塞WDM交叉连接的输入和输出光纤的数量可以是不相等的。
-
9.发明授权公开(公告)号：US07720382B2
公开(公告)日：2010-05-18
申请号：US10826151
申请日：2004-04-16
IPC分类号： H04J14/00
CPC分类号： H04Q11/0062 , H04J3/0647 , H04L7/0075 , H04Q2011/0033
摘要： A system and method are disclosed for time-domain wavelength interleaved networking that reduce the need for complex time-slot scheduling and reduce the routing complexity. Substantially all communications in the time-domain wavelength interleaved network pass through a hub node. In addition, interior nodes in the time-domain wavelength interleaved network will forward substantially all communications received from the hub node that are destined for another node on all branches outward from the hub node. The central hub node can impose a timing reference. Thus, the transmission and reception of a message can be synchronized such that a message sent in a time-slot k by a node Ni will be received by a node Nj in the time-slot k. Further, the hub node can recover from a link failure by shifting transmission times of all nodes that are separated from the hub node by the failed link.
摘要翻译： 公开了一种用于时域波长交织网络的系统和方法，其减少对复杂时隙调度的需要并降低路由复杂度。 时域波长交织网络中的所有通信基本上通过集线器节点。 此外，时域波长交织网络中的内部节点将基本上转发从集线器节点接收到的所有从集线器节点向外的所有分支上的另一个节点的通信。 中心枢纽节点可以施加定时参考。 因此，可以同步消息的发送和接收，使得节点Ni在时隙k中发送的消息将在时隙k中由节点Nj接收。 此外，集线器节点可以通过将故障链路与集线器节点分离的所有节点的传输时间进行转移，从链路故障中恢复。
-
10.发明授权Method and apparatus for exchanging routing information within an autonomous system in a packet-based data network 有权用于在基于分组的数据网络中的自治系统内交换路由信息的方法和装置公开(公告)号：US07180864B2
公开(公告)日：2007-02-20
申请号：US10085568
申请日：2002-02-27
申请人： Anindya Basu , Chih-Hao Luke Ong , April Patricia Rasala , Frederick Bruce Sheperd , Gordon Thomas Wilfong
发明人： Anindya Basu , Chih-Hao Luke Ong , April Patricia Rasala , Frederick Bruce Sheperd , Gordon Thomas Wilfong
IPC分类号： H04L12/26
摘要： A method for exchanging routing information between I-BGP routers within an autonomous system (AS) advantageously enables a solution to both persistent route oscillation problems and transient route oscillation problems which may occur when using I-BGP in a given AS. Conventional I-BGP protocol techniques are extended by enabling I-BGP speakers (e.g., routers) to communicate a set of possible best paths to a given destination, rather than communicating only a single best path, to each of their I-BGP peers within the given AS. Specifically, a plurality of possible best paths to a destination are communicated (where there are in fact more than one) from an I-BGP speaker in a given AS to its I-BGP peers (within the given AS), for each neighboring AS that provides any such paths (i.e., routes to the destination).
摘要翻译： 在自治系统（AS）内的I-BGP路由器之间交换路由信息的方法有利地能够解决在给定AS中使用I-BGP时可能出现的持久路由振荡问题和瞬时路由振荡问题。 通过使I-BGP扬声器（例如，路由器）能够将一组可能的最佳路径传达给给定目的地而不是仅传达单个最佳路径，来扩展I / 给定的AS。 具体地，对于每个相邻的AS，向给定的AS中的I-BGP对等体（在给定的AS内）传送到目的地的多条可能的最佳路径（其中实际上不止一个）从给定AS中的I-BGP演讲者 它提供任何这样的路径（即，到达目的地的路由）。
-
-
-
-
-
-
-
-
-
搜索结果
20 条记录 (耗时 0.031 秒)
