47 research outputs found
Robust image steganography method suited for prining = Robustna steganografska metoda prilagođena procesu tiska
U ovoj doktorskoj dizertaciji prezentirana je robustna steganografska metoda razvijena i
prilagođena za tisak. Osnovni cilj metode je pružanje zaštite od krivotvorenja ambalaže.
Zaštita ambalaže postiže se umetanjem više bitova informacije u sliku pri enkoderu, a potom
maskiranjem informacije kako bi ona bila nevidljiva ljudskom oku. Informacija se pri
dekoderu detektira pomoću infracrvene kamere. Preliminarna istraživanja pokazala su da u
relevantnoj literaturi nedostaje metoda razvijenih za domenu tiska. Razlog za takav
nedostatak jest činjenica da razvijanje steganografskih metoda za tisak zahtjeva veću količinu
resursa i materijala, u odnosu na razvijanje sličnih domena za digitalnu domenu. Također,
metode za tisak često zahtijevaju višu razinu kompleksnosti, budući da se tijekom
reprodukcije pojavljuju razni oblici procesiranja koji mogu kompromitirati informaciju u slici
[1]. Da bi se sačuvala skrivena informacija, metoda mora biti otporna na procesiranje koje se
događa tijekom reprodukcije.
Kako bi se postigla visoka razina otpornosti, informacija se može umetnuti unutar
frekvencijske domene slike [2], [3]. Frekvencijskoj domeni slike možemo pristupiti pomoću
matematičkih transformacija. Najčešće se koriste diskretna kosinusna transformacija (DCT),
diskretna wavelet transformacija (DWT) i diskretna Fourierova transformacija (DFT) [2], [4].
Korištenje svake od navedenih transformacija ima određene prednosti i nedostatke, ovisno o
kontekstu razvijanja metode [5]. Za metode prilagođene procesu tiska, diskretna Fourierova
transformacija je optimalan odabir, budući da metode bazirane na DFT-u pružaju otpornost
na geometrijske transformacije koje se događaju tijekom reprodukcije [5], [6].
U ovom istraživanju korištene su slike u cmyk prostoru boja. Svaka slika najprije je
podijeljena u blokove, a umetanje informacije vrši se za svaki blok pojedinačno. Pomoću
DFT-a, ???? kanal slikovnog bloka se transformira u frekvencijsku domenu, gdje se vrši
umetanje informacije. Akromatska zamjena koristi se za maskiranje vidljivih artefakata
nastalih prilikom umetanja informacije. Primjeri uspješnog korištenja akromatske zamjene za
maskiranje artefakata mogu se pronaći u [7] i [8]. Nakon umetanja informacije u svaki
slikovni blok, blokovi se ponovno spajaju u jednu, jedinstvenu sliku. Akromatska zamjena
tada mijenja vrijednosti c, m i y kanala slike, dok kanal k, u kojemu se nalazi umetnuta
informacija, ostaje nepromijenjen. Time nakon maskiranja akromatskom zamjenom označena
slika posjeduje ista vizualna svojstva kao i slika prije označavanja. U eksperimentalnom dijelu rada koristi se 1000 slika u cmyk prostoru boja. U digitalnom
okruženju provedeno je istraživanje otpornosti metode na slikovne napade specifične za
reprodukcijski proces - skaliranje, blur, šum, rotaciju i kompresiju. Također, provedeno je
istraživanje otpornosti metode na reprodukcijski proces, koristeći tiskane uzorke. Objektivna
metrika bit error rate (BER) korištena je za evaluaciju. Mogućnost optimizacije metode
testirala se procesiranjem slike (unsharp filter) i korištenjem error correction kodova (ECC).
Provedeno je istraživanje kvalitete slike nakon umetanja informacije. Za evaluaciju su
korištene objektivne metrike peak signal to noise ratio (PSNR) i structural similarity index
measure (SSIM). PSNR i SSIM su tzv. full-reference metrike. Drugim riječima, potrebne su i
neoznačena i označena slika istovremeno, kako bi se mogla utvrditi razina sličnosti između
slika [9], [10]. Subjektivna analiza provedena je na 36 ispitanika, koristeći ukupno 144
uzorka slika. Ispitanici su ocijenjivali vidljivost artefakata na skali od nula (nevidljivo) do tri
(vrlo vidljivo).
Rezultati pokazuju da metoda posjeduje visoku razinu otpornosti na reprodukcijski proces.
Također, metoda se uistinu optimizirala korištenjem unsharp filtera i ECC-a. Kvaliteta slike
ostaje visoka bez obzira na umetanje informacije, što su potvrdili rezultati eksperimenata s
objektivnim metrikama i subjektivna analiza
A secure image steganography based on JND model
Minimizing distortion produced by embedding process is very important to improve the security of hidden message and maintain the high visual quality of stego images. To achieve these objectives, an effective strategy is to perform pixel selection which is well-known as a channel selection rule. In this approach, a pixel associated with the smallest image degradation is chosen to carry secret bits. From these facts, in this paper, a new secure channel selection rule for digital images in spatial domain is designed and proposed. In this new approach, the modified matrix embedding method is utilized as data hiding method because it introduces more than one embedding change to be performed. This enables us to select a suitable pixel to embed message bits with less degradation yielded in a stego-image. In pixel selection of the proposed method, a just noticeable difference value and gradient value of a considering pixel are employed together. The experimental results (which were conducted on 10,000 uncompressed images) indicate that stego images of the proposed approach achieve a higher perceptual quality and security than those of the stego-images created by the previous approaches
Advances in Syndrome Coding based on Stochastic and Deterministic Matrices for Steganography
Steganographie ist die Kunst der vertraulichen Kommunikation. Anders als in der Kryptographie, wo der Austausch vertraulicher Daten für Dritte offensichtlich ist, werden die vertraulichen Daten in einem steganographischen System in andere, unauffällige Coverdaten (z.B. Bilder) eingebettet und so an den Empfänger übertragen.
Ziel eines steganographischen Algorithmus ist es, die Coverdaten nur geringfügig zu ändern, um deren statistische Merkmale zu erhalten, und möglichst in unauffälligen Teilen des Covers einzubetten. Um dieses Ziel zu erreichen, werden verschiedene Ansätze der so genannten minimum-embedding-impact Steganographie basierend auf Syndromkodierung vorgestellt. Es wird dabei zwischen Ansätzen basierend auf stochastischen und auf deterministischen Matrizen unterschieden. Anschließend werden die Algorithmen bewertet, um Vorteile der Anwendung von Syndromkodierung herauszustellen
New characterisations of the Nordstrom–Robinson codes
In his doctoral thesis, Snover proved that any binary code
is equivalent to the Nordstrom-Robinson code or the punctured
Nordstrom-Robinson code for or respectively. We
prove that these codes are also characterised as \emph{completely regular}
binary codes with or , and moreover, that they are
\emph{completely transitive}. Also, it is known that completely transitive
codes are necessarily completely regular, but whether the converse holds has up
to now been an open question. We answer this by proving that certain completely
regular codes are not completely transitive, namely, the (Punctured) Preparata
codes other than the (Punctured) Nordstrom-Robinson code
Algebraic Methods in Computational Complexity
From 11.10. to 16.10.2009, the Dagstuhl Seminar 09421 “Algebraic Methods in Computational Complexity “ was held in Schloss Dagstuhl-Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available
09421 Abstracts Collection -- Algebraic Methods in Computational Complexity
From 11.10. to 16.10.2009, the Dagstuhl Seminar 09421 ``Algebraic Methods in Computational Complexity \u27\u27 was held in Schloss Dagstuhl~--~Leibniz Center for Informatics.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
Efficient and Robust Video Steganography Algorithms for Secure Data Communication
Over the last two decades, the science of secretly embedding and communicating data has gained tremendous significance due to the technological advancement in communication and digital content. Steganography is the art of concealing secret data in a particular interactive media transporter such as text, audio, image, and video data in order to build a covert communication between authorized parties. Nowadays, video steganography techniques are important in many video-sharing and social networking applications such as Livestreaming, YouTube, Twitter, and Facebook because of noteworthy developments in advanced video over the Internet. The performance of any steganography method, ultimately, relies on the imperceptibility, hiding capacity, and robustness against attacks. Although many video steganography methods exist, several of them lack the preprocessing stages. In addition, less security, low embedding capacity, less imperceptibility, and less robustness against attacks are other issues that affect these algorithms. This dissertation investigates and analyzes cutting edge video steganography techniques in both compressed and raw domains. Moreover, it provides solutions for the aforementioned problems by proposing new and effective methods for digital video steganography. The key objectives of this research are to develop: 1) a highly secure video steganography algorithm based on error correcting codes (ECC); 2) an increased payload video steganography algorithm in the discrete wavelet domain based on ECC; 3) a novel video steganography algorithm based on Kanade-Lucas-Tomasi (KLT) tracking and ECC; 4) a robust video steganography algorithm in the wavelet domain based on KLT tracking and ECC; 5) a new video steganography algorithm based on the multiple object tracking (MOT) and ECC; and 6) a robust and secure video steganography algorithm in the discrete wavelet and discrete cosine transformations based on MOT and ECC. The experimental results from our research demonstrate that our proposed algorithms achieve higher embedding capacity as well as better imperceptibility of stego videos. Furthermore, the preprocessing stages increase the security and robustness of the proposed algorithms against attacks when compared to state-of-the-art steganographic methods