Microsoft Technology Licensing, LLC

M Kivanc Mihcak

Ramarathnam R Venkatesan

Mariusz Hieronim Jakubowski

Mustafa Kesal

Gary Keith Starkweather

Kamal Jain

Yuqun Chen

S Serdar Kozat

Described herein is an implementation that produces a new representation of a digital good (such as an image) in a new defined representation domain. In particular, the representations in this new domain are based upon matrix invariances. In some implementations, the matrix invariances may, for example, heavily use singular value decomposition (SVD).

Digital goods representation based upon matrix invariances

Described herein is a technology for facilitating the recognition of the content of digital signals. This abstract itself is not intended to limit the scope of this patent. The scope of the present invention is pointed out in the appending claims.

Recognizer of content of digital signals

Described herein is a technology for facilitating the watermarking of digital signals. This abstract itself is not intended to limit the scope of this patent. The scope of the present invention is pointed out in the appending claims.

Digital signal watermaker

An implementation of a technology is described herein for deriving robust non-local characteristics and quantizing such characteristics for blind watermarking of a digital good.

Derivation and quantization of robust non-local characteristics for blind watermarking

An implementation of a technology is described herein for deriving robust non-local characteristics and quantizing such characteristics for blind watermarking of a digital good. This technology finds the proper balance between minimizing the probability of false alarms (i.e., detecting a non-existent watermark) and the probability of misses (i.e., failing to detect an existing watermark). The technology, described herein, performs quantization index modulation (QIM) based upon non-local characteristics of the digital good. Non-local characteristics may include statistics (e.g., averages, median) of a group of individual parts (e.g., pixels) of a digital good. This abstract itself is not intended to limit the scope of this patent. The scope of the present invention is pointed out in the appending claims.

Systems and methods are described that apply a watermark to data, such as data representing an image. In one implementation, the complexity of the image is measured. A quantization step size is calculated, based in part on the measured complexity of the image. A watermark or message is embedded into the image using the quantization step sizes derived for each coefficient of interest. In a further implementation, a mark decoding system is configured to extract the embedded message from the image data.

Input complexity adaptive quantization watermarking

Systems, methods, and data structures permit data to be protected with complex keys and allow users to access the protected data using only a simple user id and password.

Password-based key management

Exemplary methods for estimating an orientation angle and a translation values for scanned images are disclosed. The methods described herein may be embodied as logic instructions on a computer-readable medium. In one exemplary implementation meaningful image information is removed from a scanned image, resulting in a transformed image that comprises alternating, parallel lines disposed at an orientation angle relative to an orthogonal axis. The orientation angle may be determined using geometric techniques or statistical correlation techniques, and statistical correlation techniques may be implemented to determine translation values.

Estimating orientation angle and translation values of a scanned image

An implementation of a technology is described herein for recognizing the perceptual similarity of the content of digital goods. At least one implementation, described herein, introduces a new hashing technique. More particularly, this hashing technique produces hash values for digital goods that are proximally near each other, when the digital goods contain perceptually similar content. In other words, if the content of digital goods are perceptually similar, then their hash values are, likewise, similar. The hash values are proximally near each other. This is unlike conventional hashing techniques where the hash values of goods with perceptually similar content are far apart with high probability in some distance sense (e.g., Hamming). This abstract itself is not intended to limit the scope of this patent. The scope of the present invention is pointed out in the appending claims.

Robust recognizer of perceptually similar content

Exemplary methods for performing a statistical analysis of scanned images are disclosed. The methods described herein may be embodied as logic instructions on a computer-readable medium. In one exemplary implementation a correlation value is determined between a scanned image included in a digital file and an original digital image, and a signal is generated indicating whether the correlation value exceeds a threshold.

Correlative assessment between scanned and original digital images

Methods and systems for quantization and data embedding are described. In at least some embodiments, a transform is applied on an image that is to be watermarked and statistics associated with the image are computed. The computed statistics are quantized using a symmetric lattice, and a watermark is computed using the lattice quantized statistics. The watermark is then inserted into the image.

Growing community of inventors

Redmond, WA, United States of America

M Kivanc Mihcak