SLIDE 1 AFusionofMaximumLikelihood andStructuralSteganalysis
AndrewKer
- InformationHidingWorkshop,StMalo
12June2007
SLIDE 2 AFusionofMaximumLikelihood andStructuralSteganalysis
Outline
- Maximumlikelihood&structuralsteganalysis
- Newstructuralanalysis% likelihoodfunction
- Maximization
- Experimentalresults
- Conclusions&furtherwork
SLIDE 3 SteganalysisofLSBReplacement
Replacementoflow*orderbitsisparticularlyinsecuresteganographybecause
MaximumLikelihoodSteganalysis !"#"$ % &'$ ( )'&
- Foundedonsoundstatisticalprinciples,
- Requiresknowledge/estimationofcoversourcePMF/transitionmatrix/etc,
- Inaccurateestimatorinpractice.
Dabeeretal,*+++, -,2004. Hoganetal.-*+"*.,+*,2005. Draperetal.*/0&,2005. Sullivanetal.*+++, *,2006.
SLIDE 4 SteganalysisofLSBReplacement
Replacementoflow*orderbitsisparticularlyinsecuresteganographybecause
StructuralSteganalysis !""$ % 1$ ( 2'
- Dubiousstatisticalrigour,
- Requireslessknowledgeaboutcovers,
- Highlysensitiveinpractice.
Dumitrescuetal,*+++, -,2003. Luetal.*/0&,2004. Ker,*/0&,2005. Ker,*+++, *,2007.
SLIDE 5 SteganalysisofLSBReplacement
Replacementoflow*orderbitsisparticularlyinsecuresteganographybecause
StructuralSteganalysis !""$ % 1$ ( 2'
- Dubiousstatisticalrigour,
- Requireslessknowledgeaboutcovers,
- Highlysensitiveinpractice.
CanwemergethestatisticalrigourofMLdetection withthesensitivefeaturesfoundinstructuralsteganalysis?
SLIDE 6 TraceSubsets
Everypair ofadjacentsamplesisclassifiedaccordingtotheirvalues: forexample, Itisalsousefultowritei.e.pairs
- wouldbeclassified
- wouldbeclassified
SLIDE 7
TraceSubsets
Everypair ofadjacentsamplesisclassifiedaccordingtotheirvalues:
EmbeddingProcess
Suppposeacoverofsize. Uncorrelatedpayloadofsize embeddedbyreplacingLSBsofapseudo' random selectionofvalues,so LSBflipsareindependentwithprobability'''*
SLIDE 8
Coverobject Stegoobject flipneither: probability LSBflipsareindependentwithprobability'''*
SLIDE 9
Coverobject Stegoobject flipboth: probability LSBflipsareindependentwithprobability'''*
SLIDE 10
Coverobject Stegoobject LSBflipsareindependentwithprobability'''*
SLIDE 11
Coverobject Stegoobject
SLIDE 12 Toestimate
innaturalimages;
- 2. Consideronlyodd;
- 3. Assume
Coverobject Stegoobject
SLIDE 13 NewStructuralAnalysis
- Recallthat.Supposethepartitionisrandom.
i.e.,imaginethatacoverobjectisderivedfroma“pre*cover”,inwhich arefixed,withpairsmovingindependentlyatrandom: Thismodelisvalidatedintheliterature,exceptfor
A.Ker,2+2#3$IEEETrans.InformationForensicsand Security2(2):140*148,2007.
“Pre'cover” Coverobject
SLIDE 14
“Pre'cover” Coverobject Stegoobject
SLIDE 15
“Pre'cover” Coverobject Stegoobject
SLIDE 16
“Pre'cover” Coverobject Stegoobject
SLIDE 17
Stegoobject “Pre'cover”
SLIDE 18
# # Vectorofprobabilities Stegoobject “Pre'cover”
SLIDE 19
# # Vectorofprobabilities Vectorofprobabilities Vectorofprobabilities Vectorofprobabilities Vectorofprobabilities Stegoobject “Pre'cover”
SLIDE 20 LikelihoodFunction
Giventhesizesofthetracesubsetsinthepre*cover
- ,and,thedistributionof
- isasumofmultinomials:
well*approximatedby Thelog*likelihoodofanobservation
where isthelengthofthevector
SLIDE 21
Σ
SLIDE 22 MaximumLikelihood
Estimator:find (and
SLIDE 23 MaximumLikelihood
Estimator:find (and
Difficulties:
- Noanalyticalmaximum(can’tevendifferentiate!)
)
512dimensionalmaximizationproblem eachlikelihoodevaluationinvolvesaquadraticformoflength1020
)!-4 24 44 33
SLIDE 24
ExperimentalResults
Experimentsconductedon3000never*compressedgrayscalebitmapimages, size0.3Mpixels. ComparedStructural/MLestimatorswithstandardstructuralestimatorsby (asestimatesfor).
SLIDE 25 ExperimentalResults
SamplePairsAnalysis(SPA)1
- 1S. Dumitrescu. 25.IEEETransactionsonSignal
Processing51(7):1995–2007.2003.
2P.Lu !5.6th InformationHidingWorkshop,
SpringerLNCS3200:116–127.2004
LeastSquaresSPA2 MLPairs
SLIDE 26 ExperimentalResults
SamplePairsAnalysis(SPA)1 LeastSquaresSPA2 MLPairs
For1Mpixelimages,benchmarks: ‒ SPAandLeastSquaresSPA:21images/sec ‒ MLPairs:0.4images/sec
SLIDE 27 WideningtheApplication
Otherstructuralsteganalyses,e.g.
- ofLSBreplacementintripletsofpixels1
- ofreplacementoftwo*leastsignificantbits2(“2LSB”)
canreceivethesametreatment. &6$
1A.Ker.!&5.7th InformationHiding
Workshop,SpringerLNCS3727:296–311.2005.
2A.Ker.+,5.IEEETrans.InformationForensicsandSecurity
2(1):46–54.2007.
SLIDE 28 ExperimentalResults(2LSB)
WSfor2LSB1
1X.Yu.+'5.IEEEInternationalConferenceonImage
Processing,vol.2:1102–1105.2005
2A.Ker.+,5.IEEETrans.InformationForensicsandSecurity
2(1):46–54.2007.
LeastSquaresfor2LSB2 MLPairsfor2LSB
SLIDE 29 NewStructuralAnalysis
- Recallthat.Supposethepartitionisrandom.
i.e.,imaginethatacoverobjectisderivedfroma“pre*cover”,inwhich arefixed,withpairsmovingindependentlyatrandom: Thismodelisvalidatedintheliterature,exceptfor “Pre'cover” Coverobject
SLIDE 30 Conclusions
- Itispossibletoproduceastatistically*rigorouslikelihoodanalysisofthe
structureofbitreplacement. ,
- EstimationviatheML/structuralcombinationisusuallymoreaccuratethan
MLorstructuralsteganalysisalone…
- Sometimesthemaximizationiscomputationallyinfeasible.
,1&7 – #8 – '8
- Needtorefinethecovermodeltoimproveperformanceonlargepayloads.
,1&
SLIDE 31
End