Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
This paper introduces a kind of method based on chaos and fast curvelet transform. At first, the watermark is done the scrambling by the Arnold transform. Then the digital wartermarking is done the chaos encryption by the chebyshev chaos sequences. At last, the watermarking image that has been done the chaos processing is embedded into the intermediate frequency coefficient of image that has been...
This paper presents a speech information-hiding scheme that is integrated with the CELP (Coded Exited Linear Prediction) speech coding method. The G.729 codec (CS-ACELP) is used to test the efficiency of this scheme. The index-constrained method is applied for the secret information embedding. The selected bits of first-stage and residual vector indices during the Predictive Two-stage Vector Quantization...
This paper proposes a scheme to hide some extra confidential data in transparencies during secret image encryption in visual cryptography. The secret image is multitoned into several levels first. An extended non-expansion visual secret sharing model is employed, i.e. size of transparencies is equal to that of the secret image. Thus less time and space are needed for transparencies transmission and...
This paper proposes a scheme to hide multiple watermarks in transparencies of visual cryptography. On one hand, the main properties of the traditional visual cryptography are still maintained. On the other hand, not only the encrypted image can be visible when stacking the transparencies, but also two extra watermarks can be extracted with simple computations. The scheme can be applied to hide some...
With halftone images widely used in books, magazines, printer outputs, and fax documents, it is desirable to embed data in halftone images for copyright protection, content authentication and tamper detection. This paper proposes a novel watermarking method for error diffused halftone images based on the binary pseudo-wavelet transform. We employ the binary pseudo-wavelet coefficients' distribution...
This paper proposes two transparency authentication schemes used in visual cryptography, which are based on watermarking techniques. In the first scheme, a secret image can be perceptible when stacking two transparencies. In addition, another watermark image is visible when shifting one transparency to an appropriate position and stacking it with the other transparency. In the second scheme, both...
This paper proposes a scheme to hide two watermarks in visual secret sharing of a gray level image. One watermark is embedded during secret image halftoning, and the other watermark is hidden during the halftone image encryption. A non-expansion visual secret sharing model is used to encrypt the halftone image. In data extraction, only exclusive-OR operation is needed. Experimental results show the...
This paper proposes a reversible data hiding scheme for 3D point cloud model. The method exploits the high correlation among neighboring vertices to embed data. It starts with creating a set of 8-neighbor vertices clusters with randomly selected seed vertices. Then an 8-point integer DCT is performed on these clusters and an efficient highest frequency coefficient modification technique in the integer...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.