Abstract: Methods, systems, and computer-readable mediums for managing forwarding equivalence class (FEC) hierarchies, including obtaining a forwarding equivalence class (FEC) hierarchy; making a first determination that a first hardware component supports a maximum levels of indirection (MLI) quantity; making a second determination that the FEC hierarchy has a hierarchy height; based on the first determination and the second determination, performing a comparison between the MLI quantity and the hierarchy height to obtain a comparison result; and based on the comparison result, performing a FEC hierarchy action set.

Abstract: The methods and systems provided can automatically determine an Arteriolar-to-Venular diameter Ratio, AVR, in blood vessels, such as retinal blood vessels and other blood vessels in vertebrates. The AVR is an important predictor of increases in the risk for stroke, cerebral atrophy, cognitive decline, and myocardial infarct.

Abstract: Aspects of the disclosure provide methods, apparatuses, and a non-transitory computer-readable medium for point cloud compression and decompression. In a method, syntax information of a point cloud in a quantized space is decoded from a coded bitstream. The syntax information includes dividing information and adaptive geometry quantization information for a bounding box of the point cloud. The bounding box of the point cloud is divided into a plurality of parts based on the dividing information. Quantization parameters for the parts in the bounding box are determined based on the adaptive geometry quantization information. Points in each of the parts in the bounding box of the point cloud are reconstructed based on the quantization parameter for the respective part in the bounding box.

Abstract: An information processing apparatus includes one or more processors configured to analyze content of a plurality of input images, extract one or more unit images from the plurality of input images based on the analysis and set a position of each of the one or more unit images adopted in a summary image based on an input music.

Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for processing data are provided. Compressed data is received and a requested operation for uncompressed data is performed on the compressed data by determining an intermediate location in a compression hierarchy of compression nodes and applying the requested operation to the data at that intermediate location.

Abstract: An apparatus and method for video encoding comprising one or more electronic devices configured to: receive input data associated with a coding unit (CU) of video data, determine a binary tree partitioning structure corresponding to a block partitioning process including a binary tree partitioning process for the CU, wherein the binary tree partitioning structure represents partitioning the CU into a plurality of transform units (TUs), and when the binary tree partitioning process decides to apply binary tree partition to one given CU, said one given CU is always split into two Tus, and apply an encoding process comprising transform process to the CU by applying the encoding process at a level corresponding to the TUs.

Abstract: A method, system and computer readable media are provided to generate short video notes (v-notes) from one or more videos. A series of inputs including playback commands from a user is received. By utilizing a machine learning system, the received inputs can be analyzed for video content to identify which portions are of importance. A customized v-note, smaller in size than the one or more videos, may be generated by aggregating the identified portions of video content from the one or more videos, wherein the v-note is customized to the user, based upon received inputs from the user.

Abstract: A method and apparatus of video coding using block partitioning process including a binary tree partitioning process are disclosed. The block partitioning structure corresponding to the block partitioning process for a block of video data is derived by parsing a first indicator associated with a current block and determining whether the binary tree partitioning process applies a binary tree partition to the current block based on a value of the first indicator. When it is determined that the binary tree partition is applied to the current block, the current block is always split into two primary sub-blocks with same size or two primary sub-blocks with different sizes. The block partitioning structure represents partitioning the block of video data into final sub-blocks. The block of video data is decoded based on the final sub-blocks decoded according to the block partitioning structure derived.

Abstract: The present disclosure provides a data accumulation device and method, and a digital signal processing device. The device comprises: an accumulation tree module for accumulating input data in the form of a binary tree structure and outputting accumulated result data; a register module including a plurality of groups of registers and used for registering intermediate data generated by the accumulation tree module during an accumulation process and the accumulated result data; and a control circuit for generating a data gating signal to control the accumulation tree module to filter the input data not required to be accumulated, and generating a flag signal to perform the following control: selecting a result obtained after adding one or more of intermediate data stored in the register to the accumulated result as output data, or directly selecting the accumulated result as output data. Thus, a plurality of groups of input data can be rapidly accumulated to a group of sums in a clock cycle.

Abstract: A method of video coding using block partitioning process including a binary tree partitioning process is disclosed. The block partitioning process is applied to a block of video data to partition the block into final sub-blocks. Coding process comprising prediction process, transform process or both for the block will be applied at the final sub-blocks level. The binary tree partitioning process can be applied to a given block when an associated indicator has a first value. In another embodiment, the quadtree partitioning process is applied to a block first. The quadtree leaf nodes are further partitioned using one or more stages of binary tree partitioning process. The quadtree partitioning process can be applied to a given block recursively to generate quadtree leaf nodes until a termination condition is met.

Abstract: A system and method for diagnosing retina disease is disclosed. The method comprises capturing a plurality of images of the vascular network within the retina, such as through the use of optical coherence tomography (OCT). This plurality of images are then processed to determine the location and diameter of each vessel in the three-dimensional vascular network in the retina. The vascular network is then divided into a plurality of equal unit volumes. The vessel density, vascular volume density and other metrics can then be determined for each unit volume. This information can then be used to identify retina disease. The information can be parsed and presented in a variety of ways.

Abstract: An annotation support system (10) comprising at least one display device (20). A context extraction module (24, 36) determines a context of a current medical image from a current image study. A matching module (26, 38) compares the context of the current medical image to contexts of prior medical images from prior image studies. A display module (28, 40) displays at least one of context relevant annotations and context relevant medical images from the prior image studies which match the context of the current medical study.

Abstract: Image cropping suggestion using multiple saliency maps is described. In one or more implementations, component scores, indicative of visual characteristics established for visually-pleasing croppings, are computed for candidate image croppings using multiple different saliency maps. The visual characteristics on which a candidate image cropping is scored may be indicative of its composition quality, an extent to which it preserves content appearing in the scene, and a simplicity of its boundary. Based on the component scores, the croppings may be ranked with regard to each of the visual characteristics. The rankings may be used to cluster the candidate croppings into groups of similar croppings, such that croppings in a group are different by less than a threshold amount and croppings in different groups are different by at least the threshold amount. Based on the clustering, croppings may then be chosen, e.g., to present them to a user for selection.

Abstract: A method of decoding, composing and rendering a scene. First information is obtained, the first information including a part of a MPEG-4 BIFS scene description stream and at least one coded MPEG-4 media stream. The first information is decoded by invoking a BIFS scene decoder and one or more specific media decoders that are required by the scene. Second information is obtained, the second information including a second part of a BIFS scene description stream that contains a reference to an external application. The second information is decoded by invoking the BIFS scene decoder and an external application decoder. An integrated scene is composed, the integrated scene including one or more decoded MPEG-4 media objects and one or more external application objects specified in the decoded scene descriptions streams. The composed integrated scene is rendered on a display.

Abstract: Certain embodiments involve generating summarized versions of video content based on memorability of the video content. For example, a video summarization system accesses segments of an input video. The video summarization system identifies memorability scores for the respective segments. The video summarization system selects a subset of segments from the segments based on each computed memorability score in the subset having a threshold memorability score. The video summarization system generates visual summary content from the subset of the segments.

Abstract: Implementations generally relate to data-charge phase data compression. In one implementation, a method includes computing prediction values for image data, where the image data is data-charge phase data, where the computing of prediction values is based on inter-block prediction, and where an additional bit-budget is assigned to a first block of the image data. The method also includes computing residual data based on the prediction values. The method also includes quantizing the residual data. The method also includes entropy encoding the quantized residual data. The method also includes refining an inverse quantized residual data based on one or more of the residual data and a number of left-over bit-budget after entropy encoding.

Abstract: A system and method for a live streaming platform that can redundantly process input streams in parallel ingestion pipelines is disclosed herein. Ingested input streams in the parallel pipelines can be segmented using a segmentation function that creates identical segments in each of the streams in the pipelines. If errors occur, or there are disruptions in one or more of the input streams or pipelines, the live streaming platform can ensure that segments are identifiable and different parts of the pipelines can join a main stream at different points in time without disruption.

Abstract: A system and method for compressing data. The system and method employ a static compression dictionary, or look-up table, containing a predetermined number of uncompressed data values and corresponding compressed code values for replacing uncompressed data values with their corresponding compressed code values to reduce data storage requirements. The system and method further employ a dynamic compression dictionary, to which uncompressed data values and corresponding compressed code values are added as required to compress uncompressed data values not contained within the static compression dictionary.

Abstract: The disclosure relates to a system and a method for hardware encoding and decoding according to the Limpel Ziv STAC (LZS) and Deflate protocols based upon a configuration bit.

Abstract: Various embodiments provide lossless compression of an enumeration space for genetic founder lines. In one embodiment, an input comprising a set of genetic founder lines and a maximum number of generations G is obtained. A set of genetic crossing templates of a height h is generated. A determination is made if at least a first genetic crossing template in the set of genetic crossing templates is redundant with respect to a second genetic crossing template in the set of genetic crossing templates. Based on the at least first genetic crossing template being redundant is redundant with respect to the second genetic crossing template, the at least first genetic crossing template is removed from the set of genetic crossing templates. This process of removing the at least first genetic crossing template from the set of genetic crossing templates the redundant creates an updated set of genetic crossing templates.

Abstract: Data compression using a combination, of content independent data compression and content dependent data compression. In one aspect, a method for compressing data comprises: determining whether or not a parameter or attribute of data within a data block is identified for the data block wherein the determining is not based solely on a descriptor that is indicative of the parameter or attribute of the data within the data block; and compressing the data block with at least one encoder associated with the parameter or attribute of the data within the data block to provide a compressed data block.

Abstract: Embodiments of the present invention disclose a data decoding method and apparatus, relate to the field of wireless communications, and can improve a resource utilization rate in a decoding process, thereby improving decoding efficiency. The method of the present invention includes: dividing a to-be-decoded data transport block into N code blocks, where N is an integer greater than or equal to 2; and decoding the N code blocks in parallel according to a reverse direction of encoding. The present invention is applicable to data decoding.

Abstract: The transmission of broadcast data, such as financial data and news feeds, is accelerated over a communication channel using data compression and decompression to provide secure transmission and transparent multiplication of communication bandwidth, as well as reduce the latency. Broadcast data may include packets having fields. Encoders associated with particular fields may be selected to compress those particular fields.

Abstract: Methods and devices for creating, compressing and searching a binary tree are provided by the present disclosure, which relates to the field of traffic classification. Binary tree compression includes: determining a number of a compression layer or a number of an intermediate node, compressing a binary tree according to the number of the compression layer or the number of the intermediate node to form at least one compression node, and creating a bitmap of the compression node. Therefore, the depth of the decision tree is reduced, the search speed is increased, rule expansion is avoided, and rule replication is reduced.

Abstract: The transmission of broadcast data, such as financial data and news feeds, is accelerated over a communication channel using data compression and decompression to provide secure transmission and transparent multiplication of communication bandwidth, as well as reduce the latency. Broadcast data may include packets having fields. Encoders associated with particular fields may be selected to compress those particular fields.

Abstract: A platform is proposed for automated analysis of retinal images, for obtaining from them information characterizing retinal blood vessels which may be useful in forming a diagnosis of a medical condition. A first aspect of the invention proposes that a plurality of characteristics of the retina are extracted, in order to provide data which is useful for enabling an evaluation of cardiovascular risk prediction, or even diagnosis of a cardiovascular condition. A second aspect uses fractal analysis of retinal images to provide vascular disease risk prediction, such as, but not limited to, diabetes and hypertension.

Abstract: A system and method of accelerating dynamic Huffman decompaction within the inflate algorithm. To improve the performance of a decompression engine during the inflate/decompression process, Huffman trees decompacted a priori are used thus eliminating the requirement of decompacting the DHT for each input stream. The Huffman tree in the input stream is matched prior to decompaction. If a match is found, the stored decompacted Huffman tree is used which reduces the required decompression time.

Abstract: In certain embodiments, a computer system and process for use in a trading system are provided that allow trading entities to compress trade records while simplifying the reconciliation process. Advantageously, compressed trade records are processed by a custodian firm, while uncompressed reconciliation data are processed by a central counterparty. In some embodiments, a computer system and process are provided that allows trading entities to compress trade records across markets. Advantageously, compression across markets provides a larger pool of eligible trade records for compression, increasing the number of compressible trades, and thus reducing fees paid by the trading firm and the amount of data transmitted.

Abstract: Systems and methods for providing fast and efficient data compression using a combination of content independent data compression and content dependent data compression. In one aspect, a method for compressing data comprises the steps of: analyzing a data block of an input data stream to identify a data type of the data block, the input data stream comprising a plurality of disparate data types; performing content dependent data compression on the data block, if the data type of the data block is identified; performing content independent data compression on the data block, if the data type of the data block is not identified.

Abstract: A path planning apparatus of a robot smoothes a motion path while satisfying a constraint. In a configuration space where a manipulator of a robot performs a task, a Rapidly-exploring Random Tree (RRT) path which extends from a start point and reaches a goal point may be smoothed while satisfying a constraint to generate a stable motion path. Accordingly, path planning performance is improved and an optimal path satisfying a kinematic constraint may be rapidly obtained.

Abstract: A packet processor includes a memory and a programmable compute pipeline. The memory stores microcode that specifies respective sets for the packet types, and the respective set for each type specifies elementary operations for each stage except an initial stage of the programmable compute pipeline. The programmable compute pipeline includes a sequence of stages beginning with the initial stage. The initial stage includes an operation selector that selects the respective set for the type of each packet. Each stage except the initial stage includes elementary components that are programmable to concurrently perform each of multiple combinations of elementary operations. The elementary components concurrently perform a selected one of the combinations for each packet. The selected combination includes the elementary operations specified for the stage in the respective set that the operation selector selects for the packet's type.

Abstract: A method or system for generating a packet processor inputs a first specification describing the packet processor, generates a parsing tree and generates a second specification describing a programmable compute pipeline. The parsing tree is generated from the actions of the first specification. The parsing tree has multiple levels and each level specifies one or more concurrent sets of elementary operations. The parsing tree also specifies for each level a respective bound on the elementary operations in the concurrent sets of the level. The programmable compute pipeline includes multiple stages for implementing the actions. Each stage corresponds to one of the levels of the parsing tree and includes one or more elementary components, with a number of the elementary components equaling or exceeding the respective bound for the level. The elementary components in the stage are programmable to concurrently perform combinations that include each concurrent set for the level.

Abstract: In embodiments of compression match enumeration, a suffix array can be generated that is representative of data sequences stored in a memory buffer. The suffix array can then be converted into a trie structure that overwrites the suffix array in the memory buffer as the trie structure is generated in-place of the suffix array. The trie structure includes nodes that each represent one or more suffixes of the suffix array, where each consecutive suffix is either grouped with an existing node in the trie structure or added as a new node of the trie structure. Data sequence matches can then be enumerated as determined from the trie structure.

Abstract: A configuration management system that uses a data compression method to compress entries in a data set. An entry is selected as a prefix value and prefix compression of the data set is performed. The entry to serve as the prefix value is quickly selected using an iterative approach. In each iteration, subgroups of entries are formed from groups formed in prior iterations based on the values of characters at successive positions in the entries. The approach is readily implemented using data structures represented as lists.

Abstract: A method for storing node information of a Huffman tree. The method creates an index of each node in the Huffman tree using a breadth first search (BFS) algorithm. The method further reads each node of the Huffman tree beginning from a root node according to a sequence of the index of each node, and stores node information of each node into an array of the Huffman tree.

Abstract: A signal decoder, a method of detecting an RF signal at a MIMO receiver and a MIMO receiver are disclosed herein. In one embodiment, the signal decoder includes: (1) a tree pruner configured to reduce a number of nodes of an MLD tree to expand based on modulation properties of the transmitted radio signals and SE enumeration of at least a portion of the MLD tree and (2) a vector sorter configured to sort multiple rows of child nodes of the MLD tree in parallel.

Abstract: An information processing apparatus comprises a readout unit adapted to read out, from a storage unit, correspondence information that includes a document structure of a structured document and a first code for encoding the document structure; a verification unit adapted to verify whether grammar of a portion included in a structured document for processing is valid, based on the document structure included in the correspondence information; and an encoding unit adapted to encode the structured document using the first code, in relation to a portion whose grammar is verified as being valid by the verification unit.

Abstract: Methods and apparatus are provided for reusing tree structures to encode and decode binary sets. The method encodes a binary set of data using a tree structure, wherein said encoding step encodes a portion of the binary set using a portion of the tree structure and encodes another portion of the binary set by reusing at least some of the portion of the tree structure used to encode the portion of the binary set.

Abstract: Methods and devices for creating, compressing and searching a binary tree are provided by the present disclosure, which relates to t he field of traffic classification. Binary tree compression includes: determining a number of a compression layer or a number of an intermediate node, compressing a binary tree according to the number of the compression layer or the number of the intermediate node to form at least one compression node, and creating a bitmap of the compression node. Therefore, the depth of the decision tree is reduced, the search speed is increased, rule expansion is avoided, and rule replication is reduced.

Abstract: Reference grid information is supplied from a tiling unit to an order control unit. The order control unit generates three control signals on the basis of the reference grid information and outputs them. The first control signal is a signal for controlling the execution order of a vertical low-pass filter and a vertical high-pass filter. The second control signal is a signal for controlling the execution order of a horizontal low-pass filter and a horizontal high-pass filter. The third control signal is a signal for controlling the execution order of a horizontal low-pass filter and a horizontal high-pass filter.

Abstract: A data redundancy elimination system. In particular implementations, a method includes accessing a data block; dividing the data block into a plurality of data chunks; computing chunk signatures for the plurality of data chunks; identifying a plurality of anchor chunks in the plurality of data chunks; accessing a second memory to identify one or more matching chunk signatures; reading one or more signature blocks corresponding to the matching chunk signatures from a first memory into the signature block search space of the second memory; and matching one or more computed chunk signatures to chunk signatures of the one or more signature blocks in the signature block search space.

Abstract: This technique prevents errors from being gradually accumulated on the decoding side, while maintaining high scalability, even when transformation to subbands as a plurality of frequency components is used for moving image coding. The image data of one input frame is decomposed into a plurality of subbands having different frequency components by a discrete wavelet transformation unit. A lower bitplane coding unit codes, for each bitplane, predetermined lower bits of each coefficient data of a subband LL and the coefficient data of subbands other than the subband LL. The data of the upper bits of the subband LL is stored in a frame memory. A motion vector detection unit detects a predicted value and motion vector on the basis of the decoded data of the subband LL in a preceding frame. A subtracter obtains the difference between the detected predicted value and the current frame.

Abstract: The transmission of broadcast data, such as financial data and news feeds, is accelerated over a communication channel using data compression and decompression to provide secure transmission and transparent multiplication of communication bandwidth, as well as reduce latency. Broadcast data may include packets having fields. Encoders associated with particular fields may be selected to compress those particular fields.

Abstract: A method and system for quantizing a vector corresponding to an input signal is described. The vector has a plurality of components corresponding to an N-dimensional space. In one aspect, the method and system include recursively dividing the space into equal spaces having one dimension less than a previous recursion until end spaces are formed. Each end space is two-dimensional. The method and system also include asynchronously comparing the components in each end space to determine a sub-space of a particular end space having a closest match to the vector. In another aspect, the method and system include providing tree(s) including a plurality of nodes and asynchronously traversing the tree(s) to determine a closest match to the vector. The nodes correspond to ANDs of comparisons between the components. Each comparison determines whether a first component is greater than a second component.

Abstract: Systems and methods for providing fast and efficient data compression using a combination of content independent data compression and content dependent data compression. In one aspect, a method for compressing data comprises the steps of: analyzing a data block of an input data stream to identify a data type of the block, the input data stream comprising a plurality of disparate data type; performing content dependent data compression on the data block, if the data type of the data block is identified; performing content independent data compression on the data block, if the data type of the data block is not identified.

Abstract: Devices using communication protocols encode, decode, process and display protocol data units (PDUS) using PDU specific procedures. This invention discloses a generic method to encode, decode, process and display the PDUS. A generic codec library provides generic encode, decode, process and display procedures. These generic procedures understand the PDU specific formats using the coding rules of the PDUS. The coding rules for PDUS are generated by a compiler tool from PDU definitions. Compiler parses PDU definitions specified in formal notation and generates the coding rules. These coding rules contain the information about PDU fields including names of the fields, types of the fields and size of the fields. This generic method supports mandatory fields, optional fields and variable length fields. This generic library in addition to encode, decode, display also process the PDUS to validate against the expected values for specified fields.

Abstract: A decoder for decoding a message using an arbitrary-side growing (ASG) Huffman tree including a plurality of codewords and symbols includes a database, a processing module, and a bit pattern matching module. The database stores a plurality of parameters corresponding to the ASG Huffman tree divided into several sub-trees according to a Hashemian cut operation and a bits-pattern-Xor (BPX) operation. The plurality of parameters include a bit pattern of a sub-tree of the ASG Huffman tree divided according to the BPX operation and a code length of the bit pattern. The processing module receives a bit stream corresponding to the ASG Huffman tree from an encoder. The bit pattern matching module selects bits from the bit stream according to the code length of the bit pattern and decodes the selected bits into a symbol in the ASG Huffman tree by comparing the selected bits with the bit pattern.

Abstract: An apparatus for varying a length of a flame scanner assembly for monitoring a flame includes a mounting shaft which connects to a fiber optic cable assembly; and a spool assembly having a first end and a second opposite end. The first end connects to a detector head assembly and the second end is configured to connect to a guide pipe. The second end of the spool assembly receives one end of the mounting shaft and a length of the flame scanner assembly is adjusted via telescopic interconnection between the second end of the spool assembly and the one end of the mounting shaft such that longitudinal displacement therebetween may be varied by slidable displacement of the mounting shaft relative to the spool assembly.

Abstract: A system and method for tree matching are provided. The method for tree matching includes: acquiring tree-like structures representing a physical object or model; extracting a path from a first tree-like structure and a path from a second tree-like structure; comparing the paths of the first and second tree-like structures by computing a similarity measurement for the paths; and determining if the paths match based on the similarity measurement.

Abstract: Information associated with data which was previously transmitted to a client terminal (201 or 202) is recorded as a history. When a transmission request of data of logical units in tiles required to obtain a desired image is received from the client terminal (201), the type of progression order used in the client terminal (201) is discriminated with reference to the history. The transmission order of the data of the logical units in the tiles to be transmitted to the client terminal (201) is determined in accordance with the discrimination order, and the data of the logical units in the tiles are transmitted to the client terminal (201) in accordance with the determined transmission order.