The invention provides a method and apparatus for detecting a gradual transition picture in a bitstream. The method comprises: accessing a bitstream including encoded pictures; and determining a gradual transition picture in the bitstream using information from the bitstream without decoding the bitstream to derive pixel information.

The disclosure relates to a method of processing a sequence of image frames to reduce its length. One implementation may involve extracting coefficients (e.g., Discrete Cosine Transform coefficients) from components of individual frames, and comparing the resulting coefficients for sequential frames to identify frames having the least change from a prior frame. Also, scene change values for each frame may be calculated and placed in a sorted list to facilitate identification of frames for removal. Frame removal may be conducted in rounds, where a group of pictures (GOP) may only have one frame removed for any given round.

The disclosure relates to a method of processing a sequence of image frames to reduce its length. One implementation may involve extracting coefficients (e.g., Discrete Cosine Transform coefficients) from components of individual frames, and comparing the resulting coefficients for sequential frames to identify frames having the least change from a prior frame. Also, scene change values for each frame may be calculated and placed in a sorted list to facilitate identification of frames for removal. Frame removal may be conducted in rounds, where a group of pictures (GOP) may only have one frame removed for any given round.

A device for decoding video data receives the video data, determines a scaling parameter for a block of the video data; and scales the block in a video decoding loop using the scaling parameter to increase a dynamic range for luminance values of the block. A device for encoding video data partitions the video data into blocks; determines a scaling parameter for a block of the video data; and scales the block in a video encoding loop using the scaling parameter to decrease a dynamic range for luminance values of the block.

Methods and apparatus for coding video information having a plurality of video samples are disclosed. Video samples are partitioned into groups for transmission within a single clock cycle, wherein the samples are associated with a bit length B, and a group having a group size K. The sample group is mapped to a code number and coded to form a vector-based code comprising a first portion identifying a type of look-up-table used to performing the mapping, and a second portion representing the samples of the group. The look-up-table may be constructed based upon occurrence probabilities of different sample groups. In addition, different types of look-up-tables may be used for different B and K values.

Methods and apparatus for coding video information having a plurality of video samples are disclosed. Video samples are partitioned into groups for transmission within a single clock cycle, wherein the samples are associated with a bit length B, and a group having a group size K. The sample group is mapped to a code number and coded to form a vector-based code comprising a first portion identifying a type of look-up-table used to performing the mapping, and a second portion representing the samples of the group. The look-up-table may be constructed based upon occurrence probabilities of different sample groups. In addition, different types of look-up-tables may be used for different B and K values.

An apparatus for image coding includes a processor to: execute a determining process that includes, when a specific entry included in a first palette for use in coding a first block in a coding-target image is not an entry candidate for a second palette for use in coding a second block to be coded after the first block, determining an entry to be included in the second palette based on a first index indicating a code amount to be generated when the specific entry is to be included in the second palette and a second index indicating a code amount to be generated when the specific entry is not to be included in the second palette; execute a generating process that includes generating the second palette including the entry determined in the determining process; and execute a palette coding process that includes coding the second block by the second palette.

A method and apparatus for encoding and decoding depth lookup table (DLT) using a constrained table value range are disclosed. For a decoder, a constrained table value range from a minimum table value to a maximum table value of the DLT is decoded from the coded DLT information. Bit map values for depth values in a depth range from (the minimum table value+1) to (the maximum table value−1) are then decoded. The bit map values indicate whether the depth values are in the DLT respectively. The DLT for the current depth map can be reconstructed based on the constrained table value range and the bit map values for the depth values in the depth range. For an encoder, a constrained table value range from a minimum table value to a maximum table value of the DLT is determined and encoded the DLT into coded DLT information.

A method and apparatus for encoding and decoding depth lookup table (DLT) using a constrained table value range are disclosed. For a decoder, a constrained table value range from a minimum table value to a maximum table value of the DLT is decoded from the coded DLT information. Bit map values for depth values in a depth range from (the minimum table value+1) to (the maximum table value−1) are then decoded. The bit map values indicate whether the depth values are in the DLT respectively. The DLT for the current depth map can be reconstructed based on the constrained table value range and the bit map values for the depth values in the depth range. For an encoder, a constrained table value range from a minimum table value to a maximum table value of the DLT is determined and encoded the DLT into coded DLT information.

In some embodiments, techniques for computer security comprise receiving an email message; determining a sender of the email message; determining whether the sender of the email message is trusted, wherein determining whether the sender of the email message is trusted includes determining whether the sender of the email message is associated with a whitelist; retrieving domain-related information by performing a DNS query on a domain associated with the sender; based at least in part on the domain-related information, determining whether the sender of the email message is verified; determining whether the sender is both trusted and verified; and when it is determined that the sender is both trusted and verified, treating the email message as trustworthy, wherein treating the email message as trustworthy includes bypassing a classifier.