A processor obtains pieces of coded data, which are included in a bitstream and generated by coding tiles, and tile boundary independence information, which indicates whether each boundary between the tiles is a first or second boundary. Image data of a first tile is generated by decoding a first code string included in first coded data with reference to decoding information of a decoded tile when the tile boundary independence information indicates the first boundary, and by decoding the first code string without referring to the decoding information when the tile boundary independence information indicates the second boundary. A bit string is added after the first code string to make a bit length of first coded data a multiple of a predetermined N bits, with N being an integer greater than or equal to 2.

Aspects of the present invention include a method of encoding a media file. The method includes acts of receiving a video stream depicting at least one object being drawn on a drawing surface, detecting, in the video stream, at least one path representing the at least one object, storing a plurality of coordinate sets representing the at least one path, identifying a subset of the plurality of coordinate sets that represents the at least one path to a degree of accuracy exceeding a defined threshold, and storing the subset of the plurality of coordinate sets in a text file format.

Residual vectors are compressed in a lossless compression scheme suitable for cloud DVR video content applications. Thus, a cloud DVR service provider can take many copies of the same file stored in the cloud and save storage space by compressing those copies while still maintaining their status as distinct copies, one per user. Vector quantization is used for compressing already-compressed video streams (e.g., MPEG streams). As vector quantization is a lossy compression scheme, the residual vector has to be stored to regenerate the original video stream at the decoding (playback) node. Entropy coding schemes like Arithmetic or Huffman coding can be used to compress the residual vectors. Additional strategies can be implemented to further optimize this residual compression. In some embodiments, the techniques operate to provide a 25-50% improvement in compression. Storage space is thus more efficiently used and video transmission may be faster in some cases.

A non-transitory recording medium including a program is provided. The program causes a processor to divide a picture into tiles. The tiles are coded to generate pieces of coded data, each of which corresponds to a different one of the tiles. In this regard, a first tile of the tiles is coded with reference to coding information of an already-coded tile neighboring the first tile when a boundary between the first tile and the already-coded tile is a first boundary. The first tile is coded without reference to the coding information of the already-coded tile when the boundary between the first tile and the already-coded tile is a second boundary. A bitstream including the pieces of coded data is generated. The bitstream includes tile boundary independence information which indicates whether each boundary between the tiles is one of the first boundary and the second boundary.

A method for encoding an input point on an n-dimensional sphere by encoding n-1 spherical coordinates of said input point. The method includes sequential scalar quantization of the n-1 spherical coordinates in order to obtain at most 2.sup.n-2 candidates at the end of the sequential scalar quantization of the n-1 coordinates, and subsequently selecting the best candidate which minimizes a distance between the input point and the at most 2.sup.n-2 candidates, and determining the separate quantization indices resulting from the sequential scalar quantization of the spherical coordinates of the best candidate and sequentially encoding the separate quantization indices of the best candidate. A corresponding decoding method, an encoding device and a decoding device are also provided.

Disclosed herein is a method for piecewise linear scaling of a geometry atlas, the method including generating min-max normalized depth values and generating geometry atlases by scaling the depth values so as to correspond to the gradients of multiple linear intervals.

A transaction card construction and computer-implemented methods for a transaction card are described. The transaction card has vector formatted visible information lasered onto its surface. In some embodiments, systems and methods are disclosed for enabling the sourcing of visible information using a scalable vector format. The systems and methods may receive a request to add a first plurality of visible information to a transaction card and capture an image of the first plurality of visible information. The systems and methods may also map the image to a bounding box and convert the mapped image into vector format. In addition, the systems and methods may provide the converted image to a laser machine.

Residual vectors are compressed in a lossless compression scheme suitable for cloud DVR video content applications. Thus, a cloud DVR service provider can take many copies of the same file stored in the cloud and save storage space by compressing those copies while still maintaining their status as distinct copies, one per user. Vector quantization is used for compressing already-compressed video streams (e.g., MPEG streams). As vector quantization is a lossy compression scheme, the residual vector has to be stored to regenerate the original video stream at the decoding (playback) node. Entropy coding schemes like Arithmetic or Huffman coding can be used to compress the residual vectors. Additional strategies can be implemented to further optimize this residual compression. In some embodiments, the techniques operate to provide a 25-50% improvement in compression. Storage space is thus more efficiently used and video transmission may be faster in some cases.

An image coding apparatus divides a picture into tiles. The tiles are coded to generate pieces of coded data, each of which corresponds to a different one of the tiles. In this regard, a first tile of the tiles is coded with reference to coding information of an already-coded tile neighboring the first tile when a boundary between the first tile and the already-coded tile is a first boundary. The first tile is coded without reference to the coding information of the already-coded tile when the boundary between the first tile and the already-coded tile is a second boundary. A bitstream including the pieces of coded data is generated. The bitstream includes tile boundary independence information which indicates whether each boundary between the tiles is one of the first boundary and the second boundary.

A processor obtains pieces of coded data, which are included in a bitstream and generated by coding tiles, and tile boundary independence information, which indicates whether each boundary between the tiles is a first or second boundary. Image data of a first tile is generated by decoding a first code string included in first coded data with reference to decoding information of a decoded tile when the tile boundary independence information indicates the first boundary, and by decoding the first code string without referring to the decoding information when the tile boundary independence information indicates the second boundary. A bit string is added after the first code string to make a bit length of first coded data a multiple of a predetermined N bits, with N being an integer greater than or equal to 2.