Name
Abstract | ||
|---|---|---|
Suppose the information hider has a set of information hiding Schemes to be employed in the presence of a set of steganalysis detectors. Let the information hider have only an incomplete information about the steganalysis detectors. That is, suppose the probability of the jth steganalysis detector will be used is pj; .j =1, 2...,n, then the information hider only knows the ordering of these probabilities, say, p(1) >= p(2) >= ... >= p(n). Under this circumstance how can the information hider choose the optimal embedding strategy? This is the question addressed in this paper. Theoretical analysis and some numerical results are presented. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/ICIP.2004.1419510 | ICIP: 2004 INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, VOLS 1- 5 |
Keywords | Field | DocType |
information hiding,incomplete information,cryptography,probability,image classification | Embedding,Pattern recognition,Cryptography,Computer science,Information hiding,Image coding,Theoretical computer science,Artificial intelligence,Steganalysis,Contextual image classification,Detector,Complete information | Conference |
ISSN | Citations | PageRank |
1522-4880 | 3 | 0.73 |
References | Authors | |
5 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rajarathnam Chandramouli | 1 | 238 | 34.38 |