Reversible Data Hiding
Reversible Data Hiding
- 주제(키워드) reversible data hiding
- 발행기관 고려대학교 정보보호대학원
- 지도교수 김형중
- 발행년도 2019
- 학위수여년월 2019. 2
- 학위구분 박사
- 학과 정보보호대학원 정보보호학과
- 원문페이지 101 p
- 실제URI http://www.dcollection.net/handler/korea/000000083493
- UCI I804:11009-000000083493
- DOI 10.23186/korea.000000083493.11009.0000822
- 본문언어 영어
- 제출원본 000045978847
초록/요약
Reversible data hiding (RDH) is a well known field in multimedia applications, because it allows embedding data in the image so that the reconstruction of the original image from the embedded image, also known as watermarked image, is possible. This way, the relevant image and the information is kept under one file making it convenient. Digital contents management, data hiding for military and medical uses are one of the few usages. RDH is also useful in automatic image enhancement (AIE). AIE techniques enhance the images so that average users can enjoy high quality images without needing to worry about enhancement. However, since users may not always appreciate the enhancement or want the copy of the original image, the original image must be kept or the enhancement must be reversible: RDH technique which also enhances is a perfect candidate for AIE, as original image is recoverable from the enhanced image. Using RDH in this way provides file size reduction feature, when compared to storing both the original and the enhanced image.
more목차
1 Introduction 1
2 Skewed Histogram shifting 2
2.1 Introduction 2
2.2 Related work 3
2.2.1 Related Work on Sorting and Prediction 5
2.3 Proposed method 6
2.3.1 Embedding 8
2.3.2 Extraction and Recovery 9
2.3.3 Proposed pairs of extreme predictors 9
2.3.4 Local complexity functions 11
2.3.5 Encoder and Decoder 13
2.4 Experimental result 17
2.4.1 USC-SIPI database 19
2.4.2 Kodak database 21
2.4.3 Boss database 21
2.5 Analysis of the Extreme Predictors 22
2.5.1 Pixel classification 24
2.5.2 Analysis of skipped pixels 25
2.5.3 Analysis of twice embedded pixels and Eq. (2.9) 25
2.6 Conclusion 27
3 RDHABPCE 28
3.1 Introduction 28
3.2 Related Work 31
3.3 Proposed Method: RDHABPCE 34
3.3.1 Applying Unidirectional Histogram shifting 34
3.3.2 Generating the location map 37
3.3.3 Proposed adaptive bin selection for BP 38
3.3.4 Extraction and recovery 43
3.3.5 Side information required for reversibility 44
3.3.6 Proposed stop condition for embedding 46
3.4 Comparison and analysis 47
3.4.1 BP analysis 48
3.4.2 Standard deviation reduction analysis 51
3.4.3 Visual analysis 52
3.4.4 Extended experiments for contrast reducing effect 60
3.4.5 Effect of the number of repetitions 64
3.4.6 Information loss due to embedding 67
3.4.7 Storage requirement 70
3.4.8 Extension to color images 70
3.5 Metadata protection against image analytics 71
3.5.1 Access control 72
3.5.2 Extension: Image protection for advertisement 73
3,5,3 Attacks 73
3.6 Computational Complexity 75
3.6.1 Encryption 76
3.6.2 Histogram shifting 76
3.7 Conclusion 76
4 Conclusion 77
