公开(公告)号：US20100020726A1

公开(公告)日：2010-01-28

申请号：US12179855

申请日：2008-07-25

申请人： Thomas P. Chu ,  Ramesh Nagarajan ,  Yung-Terng Wang

发明人： Thomas P. Chu ,  Ramesh Nagarajan ,  Yung-Terng Wang

IPC分类号： H04L12/28 ,  H04L12/56

CPC分类号： H04L12/462 ,  H04L45/02 ,  H04L45/122 ,  H04L45/48

摘要： In one embodiment, a method for setting up a flow-through mesh group (FTMG) for transmitting link-state packets (LSPs) in a network having a plurality of nodes interconnected by links. The FTMG is a combination of multiple spanning trees for the network through which LSPs are forwarded. FTMG set-up messages are received at ports of each node of the network from peer ports of linked nodes. FTMG set-up messages identify root nodes of the multiple spanning trees and the transmission modes of the peer ports. The FTMG set-up messages are used to determine (1) a root node for each spanning tree, (2) a root port on each node for each spanning tree, and (3) directionality of ports of the nodes. FTMG set-up messages are then used to determine the transmission mode of ports of the nodes and, subsequently, to update the spanning trees and transmission modes, as needed.

摘要翻译： 在一个实施例中，一种用于建立用于在具有通过链路互连的多个节点的网络中发送链路状态分组（LSP）的流通网状组（FTMG）的方法。 FTMG是通过LSP转发的网络的多个生成树的组合。 FTMG建立消息从链接节点的对端口接收到网络的每个节点的端口。 FTMG建立消息标识了多个生成树的根节点和对端口的传输模式。 FTMG建立消息用于确定（1）每个生成树的根节点，（2）每个生成树的每个节点上的根端口，以及（3）节点端口的方向性。 然后，FTMG建立消息用于确定节点的端口的传输模式，并且随后根据需要更新生成树和传输模式。

公开(公告)号：US07643408B2

公开(公告)日：2010-01-05

申请号：US10815123

申请日：2004-03-31

申请人： Gary W. Atkinson ,  Michael L. Craner ,  Ramesh Nagarajan

发明人： Gary W. Atkinson ,  Michael L. Craner ,  Ramesh Nagarajan

IPC分类号： H04L1/22

CPC分类号： H04L41/0668 ,  H04L41/0896 ,  H04L43/0811

摘要： A restoration path planner minimizes cost while meeting restoration-time constraints of a network by reducing the worst-case number of cross-connections that must be performed in a network in the event of a single element failure. The planner involves optimization that identifies primary and restoration path plans for demands within the network such that the worst-case number of cross-connections at any node within the network is minimal and/or bounded. Embodiments further constrain the cost of the path plan. In one embodiment, restoration time is bounded and cost is relaxed until a solution is found. In another embodiment, the restoration time bound is relaxed to a limit while path plans and their costs are stored. These plans can later be chosen amongst for the desired balance of cost and restoration time. At least one approach to minimization of network cost involves maximizing sharing within restoration path plans.

摘要翻译： 恢复路径规划器通过减少在单个元件发生故障时必须在网络中执行的最坏情况的交叉连接数来满足网络的恢复时间限制，从而最大限度地降低成本。 计划员涉及到优化，其识别网络内的需求的主要和恢复路径计划，使得网络内任何节点处的最坏情况数量的交叉连接最小和/或限制。 实施例进一步限制路径规划的成本。 在一个实施例中，恢复时间是有限的并且成本被放宽直到找到解决方案。 在另一个实施例中，将恢复时间限制放宽到极限，同时存储路径计划及其成本。 这些计划可以随后在所需的成本和恢复时间之间进行选择。 使网络成本最小化的至少一种方法涉及最大化恢复路径规划中的共享。

公开(公告)号：US07580569B2

公开(公告)日：2009-08-25

申请号：US11268147

申请日：2005-11-07

申请人： Francis K. Tse ,  Ramesh Nagarajan

发明人： Francis K. Tse ,  Ramesh Nagarajan

IPC分类号： G06K9/34

CPC分类号： H04N1/4092

摘要： A method and system to convert an image described in a page description language to a contone image. The contone image is halftoned and encoded to generate image data including edge tag data and image data. A tagged state value of each pixel of image data within a predefined neighborhood of pixels is determined. The image data is filtered using a predetermined set of filter weighting values wherein each pixel of image data within the predefined neighborhood of pixels has an associated filter weighting value. A predetermined filtered image value is assigned to each pixel having a tagged state indicating an edge pixel. A summation of all filtered image values for the predefined neighborhood of pixels is assigned when the tagged state of the pixel is a non-edge pixel.

摘要翻译： 将页面描述语言中描述的图像转换为连字图像的方法和系统。 连续色调图像被半色调编码以产生包括边缘标签数据和图像数据的图像数据。 确定预定义像素邻域内的图像数据的每个像素的标记状态值。 使用预定的一组过滤器加权值来过滤图像数据，其中预定的像素邻域内的图像数据的每个像素具有相关联的滤波器权重值。 将预定的滤波图像值分配给具有指示边缘像素的带状态的每个像素。 当像素的标记状态是非边缘像素时，分配用于预定义像素邻域的所有滤波图像值的求和。

公开(公告)号：US20090195801A1

公开(公告)日：2009-08-06

申请号：US12026018

申请日：2008-02-05

申请人： Amal Zaka MALIK ,  Xing Li ,  Ramesh Nagarajan

发明人： Amal Zaka MALIK ,  Xing Li ,  Ramesh Nagarajan

IPC分类号： H04N1/50

CPC分类号： H04N1/6016 ,  H04N1/00002 ,  H04N1/00005 ,  H04N1/00068 ,  H04N1/00832 ,  H04N1/34 ,  H04N2201/0082

摘要： What is provided herein is a novel system and method for estimating the amount of color in a document. In one embodiment, a binary CMYK input image is received. Each of the CMYK plane is received at an offset from the previous plane, i.e., the 4 planes are not received simultaneously. Each plane is divided into M×N tiles. Pixel values of all four planes are examined separately and the number of on-pixels is counted for each plane. The number of on-pixel counts for each tile are aggregated for each plane. Total on-pixel counts are used to estimate the total number of white, black, color, and gray pixel counts. The total counts for all planes are used to estimate the amount of color. A document is determined to be color if the amount of color exceeds a predetermined threshold. A color billing strategy is determined based on the estimated color amount.

摘要翻译： 这里提供的是用于估计文档中的颜色量的新颖的系统和方法。 在一个实施例中，接收二进制CMYK输入图像。 每个CMYK平面在与前一个平面的偏移处被接收，即，4个平面不被同时接收。 每个飞机分为MxN瓦。 分别检查所有四个平面的像素值，并对每个平面计数像素数。 为每个平面聚合每个图块的像素数量数。 总像素数量用于估计白色，黑色，彩色和灰色像素数的总数。 所有飞机的总计数用于估计颜色的数量。 如果颜色量超过预定阈值，文档被确定为颜色。 基于估计的颜色量来确定颜色计费策略。

公开(公告)号：US20090161136A1

公开(公告)日：2009-06-25

申请号：US11961012

申请日：2007-12-20

申请人： Xing Li ,  Ramesh Nagarajan ,  Clara Cuciurean-Zapan ,  Francis Tse

发明人： Xing Li ,  Ramesh Nagarajan ,  Clara Cuciurean-Zapan ,  Francis Tse

IPC分类号： G06K1/00

CPC分类号： H04N1/33315 ,  H04N1/0083 ,  H04N1/3873 ,  H04N2201/0081 ,  H04N2201/0082 ,  H04N2201/0094

摘要： A method and apparatus for configuring an image path of an image processing apparatus is herein described. The image processing apparatus includes at least an input terminal or scanner for inputting or scanning document into image data and an output terminal or printer for printing documents. The method includes selecting one of a plurality of output modes using a selection device associated with the image processing apparatus. Based on the selected output mode, an image path among a plurality of image processing elements of the apparatus is selected among a plurality of image paths. Each image path corresponds to one of the plurality of output modes. After a document is scanned with the scanner into image data, the image data is processed with the processing elements in the selected image path, and output or printed based on the processed image data.

摘要翻译： 这里描述用于配置图像处理装置的图像路径的方法和装置。 图像处理装置至少包括用于将文档输入或扫描成图像数据的输入端子或扫描器以及用于打印文档的输出端子或打印机。 该方法包括使用与图像处理装置相关联的选择装置来选择多个输出模式之一。 基于选择的输出模式，在多个图像路径中选择装置的多个图像处理元件中的图像路径。 每个图像路径对应于多个输出模式之一。 在用扫描仪将文档扫描成图像数据之后，利用所选择的图像路径中的处理元素处理图像数据，并且基于处理的图像数据输出或打印。

公开(公告)号：US20090109454A1

公开(公告)日：2009-04-30

申请号：US11931087

申请日：2007-10-31

申请人： Ramesh Nagarajan ,  Andrew Joseph Zipprich ,  Robert Eero Nuuja

发明人： Ramesh Nagarajan ,  Andrew Joseph Zipprich ,  Robert Eero Nuuja

IPC分类号： H04N1/46

CPC分类号： H04N1/56 ,  H04N1/6072

摘要： A system and method for selectively printing color content of a page with a reduced color gamut. The system includes a detection module, a printing mode module, and a conversion module. The detection module is configured to detect a color object in the page and the printing mode module exists in at least one mode. The conversion module can selectively convert the detected color object to a converted reduced-colorant object in accordance with the existence of the at least one mode of the printing mode module.

摘要翻译： 一种用于选择性地打印具有降低的色域的页面的颜色内容的系统和方法。 该系统包括检测模块，打印模式模块和转换模块。 检测模块被配置为检测页面中的颜色对象，并且打印模式模块以至少一种模式存在。 根据印刷模式模块的至少一种模式的存在，转换模块可以选择性地将检测到的彩色对象转换成转换的着色剂对象。

公开(公告)号：US20090092317A1

公开(公告)日：2009-04-09

申请号：US11866913

申请日：2007-10-03

申请人： Ramesh Nagarajan ,  Matthew John Nolepa

发明人： Ramesh Nagarajan ,  Matthew John Nolepa

IPC分类号： G06K9/34

CPC分类号： G06K9/2063 ,  G06K2209/01

摘要： A method for associating text with image data of documents is herein described. The method includes receiving image data of a document with manually marked text and recognizing the manually marked text. The image data is then annotated (e.g., tagged) using the manually marked text and the image data of the document is stored. When manually marked text is recognized, recognized text may be generated for annotating the image data of the document and used to populate a field associated with the image data. The field may be a name of the document or a subject line of an e-mail message, for example. A method including identifying the location of manually marked text in a first scanned document to automatically identify and annotate text in a corresponding location in a second scanned document is also disclosed.

摘要翻译： 这里描述用于将文本与文档的图像数据相关联的方法。 该方法包括用手动标记的文本接收文档的图像数据并识别手动标记的文本。 然后使用手动标记的文本对图像数据进行注释（例如，标记），并存储文档的图像数据。 当识别到手动标记的文本时，可以生成识别的文本以注释文档的图像数据并用于填充与图像数据相关联的字段。 例如，该字段可以是电子邮件消息的文档的名称或主题行。 还公开了一种方法，其包括在第一扫描文档中识别手动标记的文本的位置以自动识别和注释第二扫描文档中相应位置中的文本。

公开(公告)号：US07421147B2

公开(公告)日：2008-09-02

申请号：US11196144

申请日：2005-08-02

申请人： Ramesh Nagarajan ,  Chia-Hao Lee ,  Francis Kapo Tse

发明人： Ramesh Nagarajan ,  Chia-Hao Lee ,  Francis Kapo Tse

IPC分类号： G06K9/36 ,  G06K9/46

CPC分类号： G06T5/009 ,  G06T2207/20081

摘要： Training sets consisting of pairs of input images and desired images can be used to produce maps intended for future use in transforming input images into final images. The maps, however, often have improper elements based on incomplete or noisy data. The noisy data and incomplete can be identified via statistics derived from the training set. The map can output a code value instead of a substitution for an improper element. An additional stage of image transformation can identify improper pixels having the code value and replace the code value with an analytic value that is more appropriate.

摘要翻译： 可以使用由输入图像和所需图像组成的训练集，以产生未来用于将输入图像转换成最终图像的地图。 然而，地图通常根据不完整或嘈杂的数据而有不正确的元素。 可以通过来自训练集的统计来识别嘈杂的数据和不完整的数据。 地图可以输出一个代码值，而不是替换不正确的元素。 图像变换的附加阶段可以识别具有代码值的不正确像素，并用更合适的分析值替换代码值。

公开(公告)号：US20080159144A1

公开(公告)日：2008-07-03

申请号：US11617876

申请日：2006-12-29

申请人： Ramesh Nagarajan ,  Shyam P. Parekh ,  Kiran M. Rege

发明人： Ramesh Nagarajan ,  Shyam P. Parekh ,  Kiran M. Rege

IPC分类号： G08C15/00

CPC分类号： H04W40/30 ,  H04L45/124 ,  H04L45/3065 ,  H04W40/24

摘要： The present invention provides a method and apparatus for routing a data flow from a source node to a destination node in a mobile ad-hoc network (MANET). The present invention performs this function by first determining desired service requirements for an individual data flow to be forwarded to a destination node. Next, the present invention broadcasts an advertisement for each of the links in the MANET by the corresponding origination nodes, the advertisement including a value indicating the current performance level of the link. After broadcasting the advertisements, routing tables are composed at each of the nodes based upon the advertisements. Each routing table is constructed taking into account the advertised links and their corresponding values. After composing the routing tables, packets are forwarded toward their respective destinations by utilizing the routing tables in such a manner that the desired service requirements are satisfied.

摘要翻译： 本发明提供一种用于将数据流从源节点路由到移动自组织网络（MANET）中的目的地节点的方法和装置。 本发明通过首先确定要转发到目的地节点的单个数据流的期望业务需求来执行该功能。 接下来，本发明通过相应的发起节点广播MANET中的每个链路的广告，该广告包括指示链接的当前性能水平的值。 在广播广告之后，基于广告在每个节点上组成路由表。 每个路由表的构建考虑到所通告的链接及其对应的值。 在组合路由表之后，通过利用路由表将分组转发到它们各自的目的地，使得满足期望的业务需求。

公开(公告)号：US07342873B1

公开(公告)日：2008-03-11

申请号：US09587892

申请日：2000-06-06

申请人： Ramesh Nagarajan

发明人： Ramesh Nagarajan

IPC分类号： H04L12/26

CPC分类号： H04Q11/0062 ,  H04J3/085 ,  H04J2203/0032 ,  H04J2203/0053 ,  H04J2203/006 ,  H04J2203/0098 ,  H04Q11/0478 ,  H04Q2011/0073 ,  H04Q2011/0083 ,  H04Q2011/0092

摘要： Traffic demands are routed between network elements so as to provide improved protection against network failures. A given traffic demand is routed from a first network element to a second network element, where the second network element is preferably either one of a set of dual-homed elements, or coupled to a dual-homed element, and may also be an element of a ring-type transport or a mesh-type transport. The second network element processes the traffic demand such that a copy of a signal associated with the demand is (i) retained at the second network element, while the signal is routed to at least one additional network element, or (ii) routed to at least one additional network element, while the signal is routed to at least one network element other than the additional network element. For example, in a multidrop connection implemented in accordance with the invention, a copy of the signal is “dropped” at the second network element and one or more additional network elements. In a multicast connection implemented in accordance with the invention, one or more copies of the signal are multicast from the second network element to multiple additional network elements.

摘要翻译： 业务需求在网元之间进行路由，以提供改进的网络故障保护。 给定的业务需求从第一网络元件路由到第二网络元件，其中第二网络元件优选地是一组双归属元件中的一个或耦合到双归属元件，并且还可以是元件 的环型运输或网状运输。 第二网络元件处理业务需求，使得与该需求相关联的信号的副本（i）保留在第二网络元件处，同时信号被路由到至少一个附加网元，或者（ii）被路由到 至少一个额外的网络元件，而信号被路由到除了附加网络元件之外的至少一个网络元件。 例如，在根据本发明实现的多点连接中，信号的副本在第二网络元件和一个或多个附加网络元件被“丢弃”。 在根据本发明实现的多播连接中，信号的一个或多个副本从第二网络元件多播到多个附加网络元件。