Abstract:
Depth information may be encoded into pixels of visual imaging data according to steganographic techniques. The depth information may be captured simultaneously with the visual imaging data, and one or more representative pixels may be identified within a region or sector of the visual imaging data according to a pixel traversal strategy. The depth information corresponding to the region or sector may be encoded into one or more least significant bits of the representative pixels, and a modified set of imaging data including the visual imaging data with the depth information encoded into the representative pixels may be stored in a data store and used for any relevant purpose.
Abstract:
A method for using void pantographs (12) involves generating a test sheet (10) including multiple void pantographs (12, TP), where each of the multiple void pantographs (12, TP) includes a pantograph foreground (14) and a pantograph background (16). The test sheet (10) is printed, and from the printed test sheet (10), at least one of the multiple void pantographs (12, TP) having a covert or semi- covert pantograph foreground (14) and background (16) is identified. The printed test sheet (10) is scanned, and from the scanned test sheet (10), at least one of the multiple void pantographs (12, TP) having an overt pantograph foreground (14) is identified. A workflow is developed for the at least one of the multiple void pantographs (12, TP) having both i) the covert or semi-covert pantograph foreground (14) and background (16) after printing, and ii) the overt pantograph foreground (14) after scanning.
Abstract:
A method is provided for enabling identification of portions of a printed document from among a plurality of other portions which comprises the steps of: (i) providing a plurality of portions comprised in the printed document; (ii) selecting a first portion associated with the printed document; (iii) carrying out a comparative analysis between the first portion and at least one other portion selected from among the plurality of portions; (iv) based on the analysis results, determining a similarity factor for the selected first portion; and (v) if the similarity factor of the first portion is lower than a pre-defined value, allowing the association of one or more identification marks within that first portion.
Abstract:
A framework is provided for reducing the number of locations modified when hiding data, such as a digital watermark, in binary data. The framework complements data hiding techniques, such as digital watermarking techniques. After determining potential embedding locations according to an underlying technique, a data structure is created with values associated with those locations. A parity calculation is performed on the values in the data structure. The calculated parity is compared with hidden data to determine locations for modifications. Manipulations are then performed to reduce the total number of modifications needed to represent the hidden data. Modifications are made to the binary data according to the underlying technique. During decoding of the hidden data, the same locations can be determined, the same data structure can be created with the modified values, and a parity calculation is then performed to decode the hidden data.
Abstract:
Briefly, in accordance with one embodiment, a server may parse content into one or more segments, and process the segments to identify where in the content one or more watermarks may be added. The segments may then be concatenated into processed content that includes watermarking instructions. The processed content may be transmitted to a client for rendering. In some embodiments, the watermarking may be applied dynamically at a server prior to or concurrently with transmission to the client. If the client encounters an instruction to add a watermark, the client may render a watermark based at least in part on client information and/or information capable of identifying the client's user. The watermark may be placed at locations in the content so that the content is discernible by a user, while also being placed within a context of the content so as not to distract from the content experience.
Abstract:
The present invention provides methods and apparatus for embedding an identifying pattern of visible speckles into the digitized image of each page of a document. A speckle is a cluster of black or white pixels. Speckles are printed as black speckles on the white paper, or conversely, as areas of missing black removed from the black text characters, called white speckles. The collective pattern of all embedded black and white speckles on a single document page is called a specklemark. A specklemark can survive contrast manipulations on photocopiers and binary rasterization done by fax scanning prior to data transmission. The random pattern of the black and white speckles visible in the digitized image of a document page can be detected automatically, and by systematically matching the detected pattern with those known to have been embedded into marked copies of a document page, a specific document copy can be identified. Methods for composing, embedding and detecting specklemarks are the subject of this patent.
Abstract:
A method for embeding and detecting the hiding codes, wherein, the method for embeding the hiding codes comprising: a type of format deformation being looked as one channel, selecting at least one of the channels to represent the hiding codes which is to be embeded into a document, each type of format distortion includes N-level distortions, wherein N is a positive integer greater than or equal to 2,and the number N of the different format deformations can be same or different; Determining the hiding code sequence for the hiding code with respect to each type of the format deformation, the code length after being converted is M, wherein the M is a positive integer; K words which are require to be format deformed are selected from said document including words, wherein K is positive integer and K=M; These selected K words are format deformed based on the determined code sequence. Hiding information according to the present invention is easy to be operated and handiness. With respect to the electronic document which mostly including words, high anti-jamming can be obtained with said method for embeding and detecting the hiding codes, and said method has good tolerance with respect to various common jam methods.