نتایج جستجو برای: low order bits embedding
تعداد نتایج: 2071507 فیلتر نتایج به سال:
We present a new low-complexity method for modeling and coding the bitplanes of a wavelet-transformed image in a fully embedded fashion. The scheme uses a simple ordering model for embedding, based on the principle that coeecient bits that are likely to reduce the distortion the most should be described rst in the encoded bitstream. The ordering model is tied to a conditioning model in a way th...
We propose an MPEG-1 Layer III conforming audio codec for multiple generations (cascaded) compression without loss of perceptual quality. Previous research addressing this topic mainly focused on less complex coding schemes like MPEG-1 Layer II. In our paper, the techniques proposed in those approaches are extended to comply with Layer III's advanced features such as hybrid ltering, block switc...
Most of the watermarking algorithms can still be defeated by geometric distortions today. If the weakness against global distortions can almost be considered as solved, local geometric distortions such as the ones introduced by StirMark remain a major issue. In this paper, an original resynchronization method is presented as a potential countermeasure against such attacks. The basic idea consis...
So far, various components of image characteristics have been used for steganalysis, including the histogram characteristic function, adjacent colors distribution, and sample pair analysis. However, some certain steganography methods have been proposed that can thwart some analysis approaches through managing the embedding patterns. In this regard, the present paper is intended to introduce a n...
progressive image compression, Laplacian density, run-length coding, rate distortion We present a new low-complexity method for modeling and coding the bitplanes of a wavelet-transformed image in a fully embedded fashion. The scheme uses a simple ordering model for embedding, based on the principle that coefficient bits that are likely to reduce the distortion the most should be described first...
Most of the watermarking algorithms can still be defeated by geometric distortions today. If the weakness against global distortions can almost be considered as solved, local geometric distortions such as the ones introduced by StirMark remain a major issue. An original resynchronization method is consequently proposed in this report as a potential countermeasure against such attacks. The basic...
This paper proposes a novel least significant bit embedding algorithm for hiding encrypted messages in nonadjacent and random pixel locations in edges of images. It first encrypts the secret message, and detects edges in the coverimage. Message bits are then, embedded in the least significant bits and random locations of the edge pixels. It ensures that the eavedroppers will not have any suspic...
In this paper, a copyright protection method for digital image with 1/T rate forward error correction (FEC) is proposed. In the proposed method, the original image is lossless and the watermark is robust to malicious attacks including geometric attacks such as scaling, rotation, cropping, print-photocopy-scan, and scaling-cropping attacks and nongeometric attacks such as low-pass filtering, sha...
Many multimedia data hiding systems demand either multiple bits or multiple sets of data to be embedded. This paper examines the modulation and multiplexing techniques for accomplishing the task of extending the basic singlebit embedding to multiple-bit embedding. Amplitude modulo modulation, orthogonal/bi-orthogonal modulation, and TDMA or CDMA type modulation/multiplexing are discussed and co...
Digital watermarking is a direct embedding of additional information into the original content or host image, this study is overcome the problems existing in the classic LSB method by adapting the method to intermediate significant bits (ISB), which improve the robustness and maintain the quality of the image. Enhancing the proposed method has been done by repeating the watermark data certain n...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید