Abstract: Methods and apparatus are provided for encoding and decoding binary sets using adaptive tree selection. In one exemplary encoding method embodiment, picture data is encoded for a block in a picture; in which one of a plurality of trees structures is selected to code a binary set of data for indicating coefficient significance for the block. In another exemplary encoding method embodiment, picture data is encoded for a block in a picture, in which one or more trees are used to encode a binary set of data for indicating significance for the block, the one or more trees each having a plurality of nodes, at least one of the nodes of the one or more trees being modified responsive to at least one parameter.

Abstract: Methods and apparatus are provided for encoding and decoding binary sets using adaptive tree selection. In one exemplary encoding method embodiment, picture data is encoded for a block in a picture; in which one of a plurality of trees structures is selected to code a binary set of data for indicating coefficient significance for the block. In another exemplary encoding method embodiment, picture data is encoded for a block in a picture, in which one or more trees are used to encode a binary set of data for indicating coefficient significance for the block, the one or more trees each having a plurality of nodes, at least one of the nodes of the one or more trees being modified responsive to at least one parameter.

Abstract: Methods for management of encoding complexity for image and video encoding, for example for algorithms belonging to the JPEG 2000 family of standards, where the encoding process targets a given compressed size (i.e. a total coded length) for the image or for each frame of a video sequence. Described are a set of methods for complexity constrained encoding of HTJ2K code-streams, involving collection of local or global statistics for each sub-band (not for each code-block), generation of forecasts for the statistics of sub-band samples that have not yet been produced by spatial transformation and quantization processes, and the use of this information to generate a global quantization parameter, from which the coarsest bit-plane to generate in each code-block can be deduced. Coded length estimates can be generated in a manner that enables latency and memory to be separately optimized against encoded image quality, while maintaining low computational complexity.

Abstract: An image is rendered on a display having a limited number of primary colors by (104) combining input data representing the color of a pixel to be rendered with error data to form modified input data, determining in a color space the simplex (208—typically a tetrahedron) enclosing the modified input data and the primary colors associated with the simplex, converting (210) the modified image data to barycentric coordinates based upon the primary colors associated with the simplex and (212) setting output data to the primary having the largest barycentric coordinate. calculating (214) the difference between the modified input data and the output data for the pixel, thus generating error data, applying (106) this error data to at least one later-rendered pixel, and applying the output data to the display and thus rendering the image on the display. Apparatus and computer-storage media for carrying out this process are also provided.

Abstract: A subblock-based coding of transform coefficient blocks of the enhancement layer is rendered more efficient. To this end, the subblock subdivision of the respective transform coefficient block is controlled on the basis of the base layer residual signal or the base layer signal. In particular, by exploiting the respective base layer hint, the subblocks may be made longer along a spatial frequency axis transverse to edge extensions observable from the base layer residual signal or the base layer signal.

Abstract: A method, system, and computer-program product for analysis and use of aggregated social media information are disclosed. The method includes creating a new geometric shape and determining whether the new geometric shape overlaps an existing geometric shape. The new geometric shape is created using new polytope information, the new polytope information describes a new polytope, and the new geometric shape corresponds to the new polytope. The existing geometric shape corresponds to an existing polytope.

Abstract: An approximate enumerative coding method (100, 200) and apparatus (300) employ a cardinality-approximating (C-A) lower bound in mapping a message M to a 2-dimensional (2-D) codeword array that satisfies a 2-D constraint. The method (100) includes encoding the message M as a codeword array X using an encoder apparatus. The encoding determines entries in a codeword array X using the C-A lower bound. The C-A lower bound is a function of several terms, namely a memory term k, a cardinality of a set of sequences satisfying a horizontal constraint, a columnar extension probability of the 2-D constraint, and a non-negative constant that is a function of the columnar extension probability. The apparatus (300) includes an encoder processor (310), memory (320) and a computer program (330) stored in the memory (320) and executed by the encoder processor (310).