EUVIMEDEUVIMED entdecken
Crossref

Optimizing Non-Local Pixel Predictors for Reversible Data Hiding

Xiaocheng Hu, Weiming Zhang, Nenghai Yu

International Journal of Digital Crime and Forensics · 2014

DOI: 10.4018/ijdcf.2014070101 ↗

Kurz gefasst

Fachartikel in der Zeitschrift International Journal of Digital Crime and Forensics, 2014. Verfasst von Xiaocheng Hu und 2 weiteren Autor:innen. Die Arbeit nennt 25 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This paper presents a two-step clustering and optimizing pixel prediction method for reversible data hiding, which exploits self-similarities and group structural information of non-local image patches. Pixel predictors play an important role for current prediction-error expansion (PEE) based reversible data hiding schemes. Instead of using a fixed or a content- adaptive predictor for each pixel independently, the authors first employ pixel clustering according to the structural similarities of image patches, and then for all the pixels assigned to each cluster, an optimized pixel predictor is estimated from the group context. Experimental results demonstrate that the proposed method outperforms state-of-art counterparts such as the simple rhombus neighborhood, the median edge detector, and the gradient-adjusted predictor et al.

Zitieren

APA

Hu, X., Zhang, W., & Yu, N. (2014). Optimizing Non-Local Pixel Predictors for Reversible Data Hiding. International Journal of Digital Crime and Forensics. https://doi.org/10.4018/ijdcf.2014070101

Vancouver

Hu X, Zhang W, Yu N. Optimizing Non-Local Pixel Predictors for Reversible Data Hiding. International Journal of Digital Crime and Forensics. 2014. doi:10.4018/ijdcf.2014070101

BibTeX
@article{Hu2014,
  author = {Hu, Xiaocheng and Zhang, Weiming and Yu, Nenghai},
  title = {Optimizing Non-Local Pixel Predictors for Reversible Data Hiding},
  journal = {International Journal of Digital Crime and Forensics},
  year = {2014},
  doi = {10.4018/ijdcf.2014070101}
}
Kostenlos starten →