Itcc 2000.pdf
نویسندگان
چکیده
A method of data embedding based on the convolution of message data with a random phase carrier is presented. The theory behind this method is reviewed and it is shown that the technique can be used to hide both pictorial and non-pictorial data. The details of the procedures used for carrier design, message template optimization, message extraction optimization, block synchronization, and rotation and scale correction are discussed. Finally, the algorithm’s benchmark results using Stirmark are presented.
منابع مشابه
Segmentation of Brazilian Bank Check Logos without a Priori Knowledge
This paper presents a method to locate and extract Brazilian bank check logos automatically by employing mathematical morphology. The objective is to minimize the number of heuristic parameters to obtain the most precise possible segmentation in every situation, thereby allowing this approach to be reused in other applications. Trials and results are presented.
متن کاملOctMesh - Interactive Mesh Browsing over the Internet
This paper proposes OctMesh, an interactive mesh browsing scheme over the Internet. In OctMesh, a largescale mesh is encoded into one bit-stream, which is organized with respect to spatial locality and resolution. When the mesh is viewed over the Internet, by examining the user’s viewpoint, the compressed mesh with desired locality and resolution is streamed to the client. OctMesh enables large...
متن کاملSimple Collusion-Secure Fingerprinting Schemes for Images
This paper describes a robust watermarking algorithm and a collusion-secure fingerprinting scheme based on it. Watermarking robustness is obtained by using the JPEG algorithm to decide mark location and magnitude; the proposed algorithm supports multiple marking. The properties of dual binary Hamming codes are exploited to obtain a fingerprinting scheme secure against collusion of two buyers. T...
متن کاملWatermarking applications and their properties
We describe a number of applications of digital watermarking and the examine the common properties of robustness, tamper resistance, fidelity, computational cost and false positive rate. We observe that these properties vary greatly depending on the application. Consequently, we conclude that evaluation of a watermarking algorithm is difficult without first indicating the context in which it is to
متن کاملDynamic Bandwidth Allocation for VBR Video Traffic Based on Scene Change Identification
To guarantee quality of service (QoS), the requirements of video transmission, such as delay and cell loss rate (CLR), are very stringent. These constraints are diicult to meet if high network utilization is desired. In this paper, dynamic band-width allocation algorithms, in which scene change identiication is incorporated, are proposed to improve the bandwidth utilization. The bandwidth alloc...
متن کامل