An important parameter in evaluating data hiding methods is hiding capacity [3] [11] [12], [16] i.e. the amount of data that a certain algorithm can "hide" until reaching allowable distortion limits. One fun...
详细信息
ISBN:
(纸本)0769515061;076951507X
An important parameter in evaluating data hiding methods is hiding capacity [3] [11] [12], [16] i.e. the amount of data that a certain algorithm can "hide" until reaching allowable distortion limits. One fundamental difference between watermarking [4] [5] [7] [8] [9] [13] [14] [17] [18] [19] [20] [21] [22] [23] and generic data hiding resides exactly in the main applicability and descriptions of the two domains. Data hiding aims at enabling Alice and Bob to exchange messages [1] [6] [15] in a manner as resilient and stealthy as possible, through a medium controlled by evil Mallory. On the other hand, digital watermarking is deployed by Alice to prove ownership over a piece of data, to Jared the Judge, usually in the case when Tim the Thief(1) benefits from using/selling that very same piece of data (or maliciously modified versions of it). In the digital framework, watermarking algorithms that make use of information hiding techniques have been developed and hiding capacity was naturally use as a metric in evaluating their power to hide information. Whereas the maximal amount of information that a certain algorithm can "hide" (while keeping the data within allowable distortion bounds) is certainly related to the ability to assert ownership in court, it is not directly measuring its "power of persuasion " (i.e. how convinced will Jared the Judge and the Jury be when presenting the algorithm and applying it on an object in dispute), in part also because it doesn't consider directly the existence and power of watermarking attacks. In this paper we show why, due to its particularities, watermarking requires a different metric, more closely related to its ultimate purpose, claiming ownership in a court of law. We define one suitable metric (watermarking power) and show how it relates to derivates of hiding capacity. We prove that there are cases where considering hiding capacity is sub-optimal as a metric in evaluating watermarking methods whereas the metric of watermark
This paper studies the statistical properties and distributed properties of the coefficients after the image is decomposed at different scales by using the wavelet transform. The different quantization and coding sche...
详细信息
ISBN:
(纸本)9781467351379
This paper studies the statistical properties and distributed properties of the coefficients after the image is decomposed at different scales by using the wavelet transform. The different quantization and coding scheme for each subimage are carried out in accordance with its statistical properties and distributed properties of the coefficients. The wavelet coefficients in low frequency subimages are compressed by using Differential Pulse Code Modulation (DPCM). The wavelet coefficients in high frequency subimages are compressed and vector quantized by using Kohonen neural network on Self-Organizing Feature Mapping (SOFM) algorithm. In addition, an improved SOFM algorithm is used in vector quantization in order to shorten the encoding and decoding time. Using these compression techniques, we can obtain rather satisfactory compression ratio as well as shorten the encoding and decoding time while achieving superior reconstructed images.
The supply chain management strategy of the agile virtual enterprise is presented. The important role of the dynamic alliance in the agile information system running is discussed. The design and realization technology...
详细信息
ISBN:
(纸本)9781424421077
The supply chain management strategy of the agile virtual enterprise is presented. The important role of the dynamic alliance in the agile information system running is discussed. The design and realization technology of the logistics information platform using ASP technology to support the agile supply chain of the dynamic alliance are studied. The work principles of web database technology and the logistics information platform of the dynamic alliance are introduced.
Based on WiFi and WiMAX, with TMS320DM6437 as the main processor and the use of highly efficient video coding standard - H.264 compression algorithm, wireless intelligent video monitoring system is realized. In the th...
详细信息
A blind Cepstrum transform-Discrete wavelet trans. form (CT-DWT) composite audio watermarking based on BCH coding is proposed. It takes the advantages of error correcting, coding and cepstrum transform to lower the bi...
详细信息
ISBN:
(纸本)9780769535135
A blind Cepstrum transform-Discrete wavelet trans. form (CT-DWT) composite audio watermarking based on BCH coding is proposed. It takes the advantages of error correcting, coding and cepstrum transform to lower the bit error rate (BER) of the extracted watermark. Experimental results show that the watermark embedded with our proposed watermarking scheme. is robust and invisible. Moreover the performance of the BCH-coding scheme is superior to non BCH-coding scheme.
Although a software developer is capable of creating excellent software without the necessity for competitive coding. Having their hands in it may increase the project's efficiency and scalability. For every devel...
详细信息
An error-resilient image coding and fixed-length packetization scheme is presented to prevent packet loss from packet-switched networks. A wavelet coder based on set partition in hierarchy trees (SPIHT) algorithm enco...
详细信息
ISBN:
(纸本)9780780395930
An error-resilient image coding and fixed-length packetization scheme is presented to prevent packet loss from packet-switched networks. A wavelet coder based on set partition in hierarchy trees (SPIHT) algorithm encodes the wavelet coefficients into an embedded bitstream, along with markers generated to record the order of bits within the bitstream. A fixed-length packetization scheme based on the error-resilient entropy code (EREC) is proposed to pack the encoded bitstream into fixed-length packets which can be transmitted over the physical packet-switched network. Any lost packets only have minor effects on other received packets. Computer simulations show that our proposed method provides both excellent compression performance with fast speed and graceful degradation under various packet erasure rates (PER).
Anonymous authentication is an important feature for trusted computing. Firstly, this paper describes two kinds of authentication model Trusted computing Group (TCG) proposed TTP model and DAA model, and then analyses...
详细信息
ISBN:
(纸本)9781424455379
Anonymous authentication is an important feature for trusted computing. Firstly, this paper describes two kinds of authentication model Trusted computing Group (TCG) proposed TTP model and DAA model, and then analyses their advantages and disadvantages. Secondly, the paper proposes an improved solution based on the elliptic curve algorithm (ECC) in the base of the original DAA model. Finally, the paper detailed analysis the performance of the improved solution.
A fast image coding method based on dictionary is introduced firstly. This method gets more image information by fewer characters and can increase the coding efficiency. It improves the matching progress by the domina...
详细信息
ISBN:
(纸本)9781479924455;9781479924448
A fast image coding method based on dictionary is introduced firstly. This method gets more image information by fewer characters and can increase the coding efficiency. It improves the matching progress by the domination blocks which are generated with fixed dictionary. The advantage of this method is that different images can be generated with the same fixed dictionary set. The results of experiments show that this fast image coding method uses less time than other image coding methods under the requirement of high quality of decoding images.
Distance computing in robotics appears in the treatment of most of problems. In this article we propose a distance computing algorithm between any environment point and any shape obstacle boundary. The algorithm prese...
详细信息
ISBN:
(纸本)0780321294
Distance computing in robotics appears in the treatment of most of problems. In this article we propose a distance computing algorithm between any environment point and any shape obstacle boundary. The algorithm presented is fast and not obstacle shape dependent.
暂无评论