Research in Motion Corporation

Slipstream Data Inc.

Blackberry Corporation

Bicdroid Inc.

Other

The Directv Group, Inc.

Multicom Technologies Inc.

Bicroid

Brian Lamb

Guixing Wu

En-hui Yang

Longji Wang

Xiang Yu

Dake He

Ajit Singh

Jin Meng

Haiquan Wang

David Sze

Salmaan Syed Ahmed

Gergely Ferenc Korodi

Jianfen Zeng

Gaelle Christine Martin-Cocher

Jing Wang

Jinwen Zan

Steven Chan

David P Sze

Nguyen Nguyen

Xun Shi

Chang Sun

Da-ke He

Hongtao Zhang

Tomas Szuchewycz

Brian David Randolph Lamb

An access control system includes a processor configured to provide a trusted execution environment isolated from a rich execution environment. A rich OS operates in the rich execution environment while a trusted OS operates in the trusted execution environment. A plurality of protected data files are stored in non-volatile memory. When a process requests access to a protected data file, the computer system can permit the requesting process to access the requested data file only if a validated application token is present that corresponds to the requesting process. An application token is generated for the associated application by: detecting initiation of a first process associated with the associated application; determining that a valid user code is available within the trusted execution environment; and generating the application token using the valid user code upon determining that the valid user code is available within the trusted execution environment.

Personalized and cryptographically secure access control in operating systems

An access control system includes a processor configured to provide a trusted execution environment isolated from a rich execution environment. A rich OS operates in the rich execution environment while a trusted OS operates in the trusted execution environment. An access monitoring module operates within the kernel of the rich OS and a trusted application operates in the trusted OS. The access monitoring module intercepts file requests directed at the file systems of the rich OS, and forwards the file requests to the trusted application. The trusted application then evaluates whether the file request is permitted and provides the access monitoring module with a response. The access monitoring module forwards the request to the file system only if the trusted application approves the request.

Personalized and cryptographically secure access control in trusted execution environment

The described embodiments relate to method and products for organizing a plurality of images. Specifically, the methods and products can automatically organize a plurality of images into a plurality of groups of images using allocation criteria. The allocation criteria for each image include a similarity distance between that image and at least one other image that measures how similar those images are. Each image can be allocated to at least one similar image group based on the similarity distance. The methods and products can also be used to visualize and display representative images for each of the groups of images.

Display, visualization, and management of images based on content analytics

Systems, methods and computer program products for determining perceptual similarity between independent images are described. The described systems, methods and computer program products use a similarity distance to determine the perceptual similarity between a first image having a first arrangement of pixels and a second image having a second arrangement of pixels. A processor can determine a first image array corresponding to the first arrangement of pixels and a second image array corresponding of the second arrangement of pixels. The processor can generate a first pixel group set based on the first image array and a second pixel group set based on the second image array. A plurality of pixel group pairs can be generated, and each pixel group pair can be associated with a corresponding pixel group pair distortion. The similarity distance between the first image and the second image can be determined based on the plurality of pixel group pair distortions.

Methods and systems for determining a perceptual similarity between images

Methods and devices for encoding a sparse signal x to generate a compressed encoded signal. The methods employ directionless grammar-based dimension coding. Using labelled subsets and the finding of disjoint repeated subsets in order to build a directionless grammar, the non-zero positions of the sparse signal are encoded in a directionless grammar-based dimension encoder. Element values are encoded in a conditional non-zero encoder. The coding process facilitates random access.

Methods and devices for sparse data compression through dimension coding

The described embodiments relate to methods, systems, and products for providing verification code recovery and remote authentication for a plurality of devices configured for electronic communication with a server. Specifically, in the methods, systems, and products, the user entrusts information about the user's verification code to the service provider, and only with cooperation between the user and the service provider can a lost verification code be recovered. The service provider can further authenticate the user before cooperating in the recovery process by way of a time-sensitive authentication sequence that involves the user device.

Methods, systems and computer program product for providing verification code recovery and remote authentication

The described embodiments relate to encryption methods and computer program products. An encryption application is used to determine a keystore seed with a seed bit set having seed bits in an ordered sequence. A plurality of key derivation sets are determined and a selected key derivation set is selected randomly. A key bit sequence is generated from the seed bit set using the selected key derivation set. An encryption key is generated using the key bit sequence, and corresponding keying information is determined from the selected key derivation set such that the latter is also derivable from the former. The keying information discloses zero information about the encryption key absent knowledge of the keystore seed. Plaintext data is encrypted using the encryption key to generate ciphertext data, and the keying information is stored with the ciphertext data. The encryption key may then be deleted.

Methods and computer program products for encryption key generation and management

The described embodiments relate to methods, systems, and products for providing data protection and encryption on a plurality of devices configured for electronic communication with a server. Specifically, the methods, systems, and products can automatically and securely synchronize a user's file encryption/decryption keys across a plurality of devices, authenticating the user on each device before receiving and processing information from the server necessary to recreate the user's file encryption/decryption keys.

Methods, systems and computer program product for providing encryption on a plurality of devices

Encoding and decoding methods are presented that used offset-based adaptive reconstruction levels. The offset data is inserted in the bitstream with the encoded video data. The offset data may be differential data and may be an index to an array of offset values from which the differential offset is calculated by the decoder. The offset to an adaptive reconstruction level may be adjusted for each slice. The offsets may be specific to a particular level/index and data type. In some cases, offsets may only be sent for a subset of the levels. Higher levels may apply no offset, may apply an average offset, or may apply the offset used for the highest level having a level-specific offset.

Methods and devices for data compression using offset-based adaptive reconstruction levels

To better handle the flat tail phenomenon commonly seen in transform coefficients such as DCT coefficients, a system and method having a model dubbed a transparent composite model (TCM) are described. Given a sequence of transform coefficients, a TCM first separates the tail of the sequence from the main body of the sequence. A first distribution such as a uniform, truncated Laplacian, or truncated geometric distribution can be used to model transform coefficients in the flat tail while at least one parametric distribution (e.g. truncated Laplacian, generalized Gaussian (GG), and geometric distributions) can be used to model data in the main body. A plurality of boundary values can be used to bound a plurality of distribution models. The plurality of boundary values and other parameters of the TCM can be estimated via maximum likelihood (ML) estimation or greedy estimation.

System and method having transparent composite model for transform coefficients

A method of encoding video data using soft decision quantization makes use of iterative encoding to provide the ability to optimize encoding across different functional elements in a hybrid video encoder. Iterative encoding is used to allow quantization step size, motion prediction and quantization levels to be optimized despite their interrelated nature.

Soft decision and iterative video coding for MPEG and H.264

A method, system and computer software product for improving rate-distortion performance while remaining faithful to JPEG/MPEG syntax, involving joint optimization of Huffman tables, quantization step sizes and quantized coefficients of a JPEG/MPEG encoder. This involves finding the optimal coefficient indices in the form of (run, size) pairs. By employing an interative process including this search for optimal coefficient indices, joint improvement of run-length coding, Huffman coding and quantization table selection may be achieved. Additionally, the compression of quantized DC coefficients may also be improved using a trellis-structure.

Method, system and computer program product for optimization of data compression with iterative cost function

A computer-implemented method for generating side information for grammar-based data compression systems, such as YK compression systems, is described. An admissible grammar (G) for an input sequence (A(S)) having a finite set of terminal symbols is obtained. A graph representation of the admissible grammar (G) is then constructed. An edge having a lowest weight (expansion frequency), or one not possessing the shortest distance and or shortest expanded sequence length, is then pruned from the graph representation to generate a pruned graph representation. A pruned grammar (G') is then derived by removing the occurrence corresponding to the pruned edge from the grammar G and the starting variable (S) of the pruned grammar (Gi) is then expanded to generate the side information.

Method and apparatus for pruning side information including directed edges not possessing shortest expanded length for grammar-based compression

Methods and devices for encoding and decoding that involve sorting bins according to their respective estimated probabilities to form subsequences, each subsequence having an associated estimated probability. Subsequences are encoded to form codewords. Ordered sets of phrases of known length are then formed from the codewords. Each first of the phrases in a set contains at least part of one codeword. The first phrase has an associated estimated probability and the probability estimates associated with each of the other phrases in the set are determined based upon the probability estimate associated with the first phrase, which permits the phrases to be decoded in parallel.

Growing community of inventors

Waterloo, Canada

En-hui Yang