Apple Inc.

Cisco Technology, Inc.

Facebook, Inc.

Paul S Chang

Ali Sazegari

Lars M Lindberg

Hsi-Jung Wu

Thomas Pun

Hyeonkuk Jeong

Sharat C Prasad

Eric Bainville

Hiroshi Suzuki

Edward Young Zhang

Chien Fang

Chio Fai Aglaia Kong

Thomas A Hamilton

Senthil Somasundaram

Jun Qian

Guangmin He

Topraj Gurung

Joshua James Ketellapper

Disclosed are techniques for pre-processing layered images prior to compression and distribution. According to some embodiments, a technique can include accessing at least two images of a layered image: (i) a background image, and (ii) one or more layer images. Next, a flattened image is generated based on the at least two images. Next, respective one or more delta layer images are generated for the one or more layer images by: for at least one pixel of each layer image having (i) an alpha sub-pixel set to fully opaque, and (ii) a first color property equivalent to a second color property of a corresponding pixel within the flattened image: setting bits of the first color property of the pixel to the same value (e.g., zero (0) or one (1)). Finally, the one or more delta layer images are compressed and provided to a destination computing device.

Layered image compression

Disclosed herein are techniques for performing lossless compression of single-channel images (e.g., grayscale images). A first technique involves pre-processing an isolated (i.e., one) single-channel image for compression. In particular, the first technique involves calculating predicted pixel intensity values (within the single-channel image) based on neighboring pixel intensity values (also within the single-channel image). Bit values of the error margins of the predicted pixel intensity values are separated into two different byte streams according to a particular ordering, whereupon the byte streams are separately compressed (e.g., using a Lempel-Ziv-Welch (LZW)-based compressor) and joined together to produce a compressed single-channel image. A second technique involves pre-processing a group of single-channel images into one single-channel image for compression. In particular, the second technique involves interleaving pixel intensity values of the single-channel images to produce an interleaved single-channel image, and subsequently compressing the interleaved single-channel image (e.g., using an LZW-based compressor).

Lossless compression techniques for single-channel images

A hybrid compression method for compressing images is provided. The method identifies a first set of image components to be compressed by a lossy compression format and a second set of image components to be compressed by a lossless compression format. The method then encodes the first set of image components according to the lossy compression format and encodes the second set of image components according to the lossless compression format. The method then generates a compressed structure that includes the lossy-compressed first set of image components and the lossless-compressed second set of image components.

Compression of image assets

This application relates to an optimization for a technique for filtering an input signal according to a convolution kernel that is stored in a floating point format. A method for filtering the input signal includes: receiving a set of filter coefficients that define the convolution kernel; determining an order for a plurality of floating point operations configured to generate an element of an output signal; and filtering the input signal by the convolution kernel to generate the output signal. Each floating point operation corresponds with a particular filter coefficient, and the order for the plurality of floating point operations is determined based on a magnitude of the particular filter coefficient associated with each floating point operation. The filtering is performed by executing the plurality of floating point operations according to the order. The data path can be a half-precision floating point data path implemented on a processor.

Low precision convolution operations

A method for decoding a compressed video data sequence containing one or more coded pixel blocks. The compressed video sequence is buffered. Prediction information for each of the coded pixel blocks is reviewed. One or more groups of coded pixel blocks are formed based on the reviewed prediction information such that the coded pixel blocks within a given group have similar prediction dependencies and/or at least do not depend on a reconstructed pixel within a group of received pixel blocks to enable parallel decoding. The formed groups are scheduled for processing and subsequently decoded to produce a decoded video data sequence.

Region-based processing of predicted pixels

Disclosed are techniques for pre-processing an image for compression, e.g., one that includes a plurality of pixels, where each pixel is composed of sub-pixels that include at least an alpha sub-pixel. First, the alpha sub-pixels are separated into a first data stream. Next, invertible transformations are applied to the remaining sub-pixels to produce transformed sub-pixels. Next, for each row of the pixels: (i) identifying a predictive function that yields a smallest prediction differential total for the row, (ii) providing an identifier of the predictive function to a second data stream, and (iii) converting the transformed sub-pixels of the pixels in the row into prediction differentials based on the predictive function. Additionally, the prediction differentials for each of the pixels are encoded into first and second bytes that are provided to third and fourth data streams, respectively. In turn, the various data streams are compressed into a compressed image.

Techniques for compressing multiple-channel images

A user of a user device with a first account with an online service selects a contact to invite to join the online service. A server receives the selected contact to invite from the user device, and in response to receiving the selected contact, generates a second account for the selected contact. The second account includes a plurality of fields, one or more of which are populated with contact information of the selected contact. A link to the second account is generated and provided in an invitation for the selected contact to activate the second account with the online service.

Methods and systems for assisting in creation of a new account of an online service

A charging circuit and method for charging a power storage device in a power over Ethernet environment are necessary to prevent unnecessary power consumption. Power sourcing equipment continuously supplies power to a connected device after determining that the device is compatible. In order to prevent supply of power after a power storage device attains full charge, a charging circuit may include an interface for supplying electric power; a sensing circuit including a switch in series with a resistor; and a voltage detection circuit. The voltage detection circuit may communicate with the sensing circuit and may output a first signal that turns the switch OFF when the voltage of the power storage device is greater than or equal to a first voltage and may output a second signal that turns the switch ON when the voltage of the power storage device is less than or equal to a second voltage.

Apparatus and method for controlling a charging circuit in a power over ethernet device

A method for decoding a compressed video data sequence containing one or more coded pixel blocks The compressed video sequence is buffered. Prediction information for each of the coded pixel blocks is reviewed. One or more groups of coded pixel blocks are formed based on the reviewed prediction information such that the coded pixel blocks within a given group have similar prediction dependencies and/or at least do not depend on a reconstructed pixel within a group of received pixel blocks to enable parallel decoding. The formed groups are scheduled for processing and subsequently decoded to produce a decoded video data sequence.

Systems, methods, and other embodiments associated with programmable application specific integrated circuit (ASIC) fault injection are described. One example ASIC includes a serializer de-serializer (SERDES). The example ASIC may also include logics to process data in the ASIC. At least one of the logics either receives data from the SERDES and/or provides data to the SERDES. The example ASIC may also include an embedded fault injection logic (EFIL) to control injection of a fault to a path (e.g., data, control) associated with at least one of the logics. The example ASIC may also include an embedded set of multiplexers (ESOMs) controlled by the EFIL. The ESOMs are controllable by the EFIL to inject a fault signal to the data path.

Fault injection

Some embodiments present a method of performing a variable shift operation. This method can be used by a microprocessor that does not allow variable shift operation for certain operand sizes. The method simulates a shift instruction that shifts an operand by a shift count. The method identifies a first shift command and a second shift command. The method computes a mask value. The mask value depends on whether the shift count is less than half of the operand size or greater than or equal to half of the operand size. The method uses the mask value to cause one of the first shift command and the second shift command to produce no shift. In some embodiments, the method allows for the shift count to be specified in bytes or in bits.

Growing community of inventors

San Jose, CA, United States of America

Paul S Chang