Abstract: The disclosed system and method provide a binary image generation method. Used, for example, in a digital reprographic system, the method is suitable for eliminating printing artifacts for high addressable binary digital output, such as digital copies, using an optimized ordered error diffusion method with dynamically computable quantization error and dynamic binary output calculation.

Abstract: Systems and methods are described that facilitate determining an original document format for a scanned document by analyzing a bitmap thereof. Text objects are extracted from the document, binarized, and segmented to identify text. Page orientation and text size are used to distinguish between a slideshow-type document, and a word processing or spreadsheet-type document. To further distinguish between the word processing and spreadsheet types, text column structure and count is analyzed.

Abstract: In one embodiment, an automatically maintained, distributed source tree (DST) network has a plurality of fully connected internal nodes. One or more internal nodes may be connected to one or more external nodes. A first internal node synchronizes its link-state database with another internal node by sending and receiving respective Reduced Sequence Number Packet-Data-Units (PDUs) (RSNPs). An RSNP includes summary information for link-state packets (LSPs) (1) originated by the first internal node, (2) received by the first internal node from the other internal node, and (3) received from and/or originated by external nodes. If an internal link fails, then the corresponding end-nodes may recover and maintain automatic DST operation by entering either relay-mode or switch-mode operation. In relay-mode operation, an end-node tunnels packets to the other end-node via an intermediary node. In switch-mode operation, an intermediary node is selected to forward packets from one end-node to the other end-node.

Abstract: 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.

Abstract: A revision control system (RCS) can maintain document revisions that contain markings. Markings are often hand written notes or drawings added to a physical document. The markings can be isolated from the original drawing and saved in the RCS as difference specifications. A physical document can be produced from a document specification. A person can add markings. A revised document specification can then be produced from the marked up version of the physical document. Finally, the revised document specification can be maintained by the RCS. As such, various document versions of the physical document, including those with hand markings, can be fetched from the RCS. A person can use the physical document to update existing revision and/or query older revisions without any manual steps.

Abstract: A restoration path planner that minimizes the worst-case number of cross-connections that must be performed in a network in the event of a single element failure involves a two-phase optimization. The first phase involves finding two node-disjoint paths for each service demand within a network such that the maximum link bandwidth in the network is minimized and the link bandwidths within the network are leveled. The second phase involves identifying the primary and restoration paths for each service demand within the network such that the worst-case number of cross-connections at any node within the network is minimized across all possible single-event failures. Embodiments also consider service demand-bundling that groups service demands with the same source-destination node pairs and routes them along identical primary and restoration paths, and banding, which consolidates multiple low-rate demands into a high-rate demand and consequently decreases cross-connections required in the event of a failure.

Abstract: A method of determining a quality output of a page based on a price input and examining content of a page. Examining content of a page includes detecting at least one object on the page and determining an approximate area of coverage of the at least one object on the page. The method also includes approximating a cost of printing the page based on the approximate area of coverage. The method also includes processing a user selected price for printing the page and comparing the user selected price to the approximated cost of printing the page. The method also includes generating the page based on the comparison between the user selected price and the approximated cost of printing the page.

Abstract: 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.

Abstract: A platform (e.g. game console) and application (e.g. game title) independent ecosystem for the creation, consumption and trade of user generated digital content permits any application operating on any platform to participate in a market driven economy for user generated digital objects (UGDOs). The trading system is independent of (i.e. external to) all participating applications. A metadata attribution method for UGDOs in combination with heterogeneous application support through well-defined interfaces facilitates unlimited participation. Attributed metadata may be understood and consumed across platforms and applications. Flexible UGDO rights enforcement techniques in combination with a flexible fair exchange service for those rights support all manner of UGDOs and commercial transactions therefore. Participating application may provide rights enforcement in some instances. The nature of enforcement may rest on the nature of UGDO content, rights in UGDOs or author preferences.

Abstract: Embodiments herein provide methods and systems for copying and printing completed template documents. For example, one method provides information regarding a document template sheet. The document template sheet comprises a media sheet having template markings thereon. The method scans a completed document to produce a scanned image. The completed document comprises a second media sheet having the template markings and additional markings. The method processes the scanned image to separate data relating to the additional markings from data relating to the template markings. Then the method can print/copy only the additional markings on blanks of the document template sheets. This avoids reprinting/recopying the template upon itself and saves resources because only the additional markings need to be processed through the temporary storage and printing engine.

Abstract: The presently disclosed embodiments are directed to methods and systems for improving the performance of an image processor color to color tile transformation by caching color tiles most recently calculated. A page of a print job is received. One or more color tiles based on colors found in a previous print job are pre-calculated and stored in a memory. A color present in the page is read. The color is compared to one or more pre-calculated color tiles. If the color does not match a pre-calculated color tile, a new color tile for the color is calculated, a pre-calculated color tile is removed from the memory, the new color tile is added to the memory, and the new color tile is used to print the page. If the color does match a pre-calculated color tile stored in the memory, the pre-calculated color tile is used to print the page.

Abstract: A technique for improving optical cross-connections comprises placing a switch in front of a number of processing units. So configured, the units are no longer dedicated to a specific link or signal. When necessary, a unit is connected/disconnected to one or more optical links by the switch to carry out any number of processing functions, such as regeneration, Raman pumping, dispersion equalization/compensation or performance monitoring. Because the units are no longer dedicated to specific links the cost of the cross-connections and the network it is a part of can be reduced.

Abstract: The image data processing system and method disclosed, processes intermediate compressed binary data representing images scanned for copy or exporting, thereby enabling storage of the copy or export file to a common memory storage device. According to an exemplary embodiment, the image data processing system comprises a binary lossless decompress module, a binary to contone restoration module, and an export processing module, the export processing module processing multiple bit image data for exporting to an image data receiving device.

Abstract: A method and system for identifying and, optionally, managing protection resource sharing opportunities, such as within a large-scale wavelength-division multiplexing (WDM) mesh network.

Abstract: A system and method of billing for printing service costs is provided to examine content of a page and apply a cost function to approximate the cost of printing the page. Examining the page may include detecting an object in the page, determining a type of the detected object, and determining an approximate area of coverage of the detected object within the page. A usage profile of each type of detected object that is printed is calculated and stored. The cost function uses the detected object, the approximate area of coverage, and a weight value associated with the type of detected object to approximate the cost of the page. When costs are calculated over a period of time, the weight value of each type of detected object may be adjusted based on the usage profile for each type of detected object.

Abstract: A shared mesh data network (SMDN) for path-based recovery at the packet level. In one implementation, a first link in the network is part of two or more different protection paths, where each protection path corresponds to a different primary path. A network manager determines how much protection bandwidth to reserve on the first link for the two or more protection paths in such a way that the protection bandwidth reserved on the first link is shared between the protection paths of the two or more primary paths. As such, the amount of protection bandwidth reserved on the first link can be less than the sum of the bandwidths of the two or more primary paths. The SMDN provides efficient sharing of protection capacity. Implementations of the SMDN are appropriate to multiprotocol label-switched (MPLS) optical networks.

Abstract: 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.

Abstract: 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.

Abstract: An input scanner, such as used in a digital copier, accepts original documents on sheets of any number of possible sizes within a single job. The video output of the scanner is applied to an algorithm to determine the length, along a process direction, of useful image data on each sheet. From such a determination, a size of output copy sheets can be automatically selected, or the image can be automatically changed in size in subsequent processing. A prescan of the original documents is not required.

Abstract: The image data processing system and method disclosed, processes intermediate compressed binary data representing images scanned for copy or exporting, thereby enabling storage of the copy or export file to a common memory storage device. According to an exemplary embodiment, the image data processing system comprises a binary lossless decompress module, a binary to contone restoration module, and an export processing module, the export processing module processing multiple bit image data for exporting to an image data receiving device.