簡易檢索 / 詳目顯示

研究生: Dwi Riyono
Dwi Riyono
論文名稱: Study and Improvement on Image Security and Retrieval
Study and Improvement on Image Security and Retrieval
指導教授: 郭景明
Jing-Ming Guo
口試委員: Jar-Ferr Yang
Jar-Ferr Yang
Chung-Nan Lee
Chung-Nan Lee
Heri Prasetyo
Heri Prasetyo
Prof. Jian-Jiun Ding
Jian-Jiun Ding
Jing-Ming Guo
Jing-Ming Guo
學位類別: 博士
Doctor
系所名稱: 電資學院 - 電機工程系
Department of Electrical Engineering
論文出版年: 2019
畢業學年度: 107
語文別: 英文
論文頁數: 213
中文關鍵詞: beta chaoticimage encryptionsecret sharinghyperchaosimage watermarkingpermutationimage retrievalbitmap featurebit probability
外文關鍵詞: beta chaotic, image encryption, secret sharing, hyperchaos, image watermarking, permutation, image retrieval, bitmap feature, bit probability
相關次數: 點閱:210下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • In this dissertation, we conduct three researches : 1) improved beta chaotic image encryption for multiple secret sharing, 2) hyperchaos permutation on false-positive-free SVD-based image watermarking, and 3) a novel image descriptor based on dot-diffused block truncation coding with bit probability.
    The first part is related to image encryption. The proposed image encryption is further extended and applied for the (n,n)-MSS task. Some ideas have been delivered to solve the problem in former existing scheme on dealing with odd number of secret images. In the (n,n)-MSS, the proposed method utilizes an additional random image, k image encryption, and two different masking coefficients to overcome the aforementioned problem. Experimental results validate the usability and effectiveness of the proposed method in the image encryption as well in (n,n)-MSS system. Thus, the proposed method can be regarded as very competitive candidate in the image encryption and secret sharing applications.
    For the second part, some extensive experiments on image watermark scheme have been reported. It investigates the effect of hyperchaos permutation on FPF SVD-based image watermarking scheme. The watermark image is firstly scrambled using the hyperchaos permutation before being embedded into the host image. The proposed method yields a good result in the image watermarking scheme.
    The third part presents a novel image descriptor based on DDBTC with bit probability. Specifically, the image feature descriptor is formed by combining the color feature directly derived from a DDBTC encoded data stream with bit probability and bitmap feature derived from the corresponding bitmap image. The color feature effectively captures the image brightness and color distribution, and the bitmap feature characterizes the image content. To demonstrate its viability as an image descriptor, its application to image retrieval and classification are considered. Results confirm the superiority of the proposed image descriptors in terms of the image retrieval and classification tasks for both natural and textural image databases, for both color and grayscale images.


    In this dissertation, we conduct three researches : 1) improved beta chaotic image encryption for multiple secret sharing, 2) hyperchaos permutation on false-positive-free SVD-based image watermarking, and 3) a novel image descriptor based on dot-diffused block truncation coding with bit probability.
    The first part is related to image encryption. The proposed image encryption is further extended and applied for the (n,n)-MSS task. Some ideas have been delivered to solve the problem in former existing scheme on dealing with odd number of secret images. In the (n,n)-MSS, the proposed method utilizes an additional random image, k image encryption, and two different masking coefficients to overcome the aforementioned problem. Experimental results validate the usability and effectiveness of the proposed method in the image encryption as well in (n,n)-MSS system. Thus, the proposed method can be regarded as very competitive candidate in the image encryption and secret sharing applications.
    For the second part, some extensive experiments on image watermark scheme have been reported. It investigates the effect of hyperchaos permutation on FPF SVD-based image watermarking scheme. The watermark image is firstly scrambled using the hyperchaos permutation before being embedded into the host image. The proposed method yields a good result in the image watermarking scheme.
    The third part presents a novel image descriptor based on DDBTC with bit probability. Specifically, the image feature descriptor is formed by combining the color feature directly derived from a DDBTC encoded data stream with bit probability and bitmap feature derived from the corresponding bitmap image. The color feature effectively captures the image brightness and color distribution, and the bitmap feature characterizes the image content. To demonstrate its viability as an image descriptor, its application to image retrieval and classification are considered. Results confirm the superiority of the proposed image descriptors in terms of the image retrieval and classification tasks for both natural and textural image databases, for both color and grayscale images.

    Contents Chapter 1. Introduction……………………………………………………………......1 1.1. Motivation…………………………………………………………………………………....1 1.2. Contribution………………………………………………………………………………..…2 1.3. Organization……………………………………………………………………………..…...4 Chapter 2. Image Encryption for Multiple Secret Sharing........................................6 2.1. Proposed Image Encryption……………………………………………………………..…..17 2.1.1. Proposed Image Confusion using Beta Chaotic Map……………………………......18 2.1.2. Proposed Image Diffusion using Beta Chaotic Maps……………………………….20 2.1.3. Bitwise Exclusive-OR on Encrypted Image…………………………………………21 2.2. Proposed Multiple Secret Sharing…………………………………………………………..26 2.2.1. Proposed Method with Additional Random Image………………………………….28 2.2.2. Proposed Method with k Image Encryption………………………………………....32 2.2.3. Proposed Method with Two Masking Coefficients………………………………….37 2.3. Experimental Results……………………………………………………..…………………43 2.3.1. Performance of Improved Beta Chaotic Image Encryption…………………………44 2.3.2. Effect of Additional Random Image for the Proposed Method………………..........49 2.3.3. Effect of k Image Encryption for the Proposed Method…………………………….53 2.3.4. Effect of Two Different Masking Coefficients for the Proposed Method……………57 2.3.5. Performance Comparisons Against Former Schemes……………………………….73 2.3.6. Effect of Image Stacking…………………………………………………………….82 2.4. Summary……………………………………………………………………………………….84 Chapter 3. Hyperchaos on SVD-Based Image Watermarking………..…………..85 3.1. Hyperchaos Image Permutation……………………………………………………………..87 3.1.1. Hyperchaos Maps…………………………………………………….……………..87 3.1.2. Hyperchaos Image Scrambling……………………………………..……………….91 3.2. Proposed Image Watermarking…………………………………………………….………..97 3.2.1. Singular Value Decomposition………………………………………………….......98 3.2.2. Watermark Embedding………………………………………………………….......99 3.2.3. Watermark Extraction……………………………………………………………...103 3.2.4. Dealing with Color Image………………………………………………………….105 3.2.5. Similarity Measurement…………………………………………………………....107 3.3. Analysis………………………………………………………………………………...….108 3.3.1. False-Positive-Problem…………………………………………………………….108 3.3.2. Embedding Singular Values………………………………………………………..113 3.3.3. Embedding Principal Components…………………………………………………118 3.3.4. Quality of Watermarked Image………………………………………………….....124 3.3.5. Connection to Peak-Signal-to-Noise-Ratio………………………………………...127 3.4. Experimental Results………………………………………………………………………130 3.4.1. Imperceptibility Test……………………………………………………………….132 3.4.2. Robustness Test…………………………………………………………………….134 3.4.3. Performance Evaluation…………………………………………………………....141 3.4.4. Performance on Color Image……………………………………………………....145 3.5. Summary………………………………………………………………………………………150 Chapter 4. Descriptor Image Retrieval DDBTC with Bit Probability..……...…151 4.1. Literature review…………………………………………………………………………..153 4.1.1. DDBTC Image Color Quantizer and Bitmap Image………………………………154 4.1.2. Bit Probability……………………………………………………………………..159 4.2. Proposed image Descriptor………………………………………………………………..160 4.2.1. Color Feature (CF)………………………………………………………………...160 4.2.2. Bitmap Feature (BF)………………………………………………………………165 4.2.3. Histogram Binning………………………………………………………………...167 4.3. Image Retrieval and Classification using DDBTC with Bit Probability………………….168 4.3.1. Image Retrieval…………………………………………………………………..168 4.3.2. Image Classification……………………………………………………………...171 4.4. Experiment Results ……………………………………………………………………….171 4.4.1. Experimental Setup………………………………………………………………..173 4.4.2. Image Retrieval Application………………………………………………………177 4.4.3. Image Classification Application…………………………………………………183 4.4.4. Efficiency Analysis……………………………………………………………….186 4.5. Summary…………………………………………………………………………….……187 Chapter 5. Conclusion…………………………………………………………..188 5.1. Future work………………………………………………………………...189 References………………………………………………………………………...190 List of Figures Fig. 2.1. Schematic diagram of the former MSS scheme (a) encoder, and (b) decoder………………………………………………………………………………………………..8 Fig. 2.2. A set of secret images: (a) Baboon, I_1, (b) Lake, I_2, (c) Peppers, I_3, and (d) Barbara, I_4……………………………………………………………………………………………..…..….11 Fig. 2.3. Results of the former MSS scheme with n=3: (a-c) a set of shared images, and (d-f) a set of recovered images………………………………………………………………………...……….14 Fig. 2.4. Illustration of image confusion and diffusion process……………………………….……..18 Fig. 2.5. Result of XOR operations with random image R_1~U(0,50), R_2~U(0,100), and R_3~U(0,255): (a) shuffled image S{I_1 }, (b) I_1⊕R_1, (c) I_1⊕R_2, (d) I_1⊕R_3, (e) S{I_1 }⊕R_2, and (f) S{I_1 }⊕R_3…………………………………………………………………………...…………..25 Fig. 2.6. Schematic diagram of proposed multiple secret sharing over several color images on: (a) encoder, and (b) decoder sides, respetively…………………………………….……………………27 Fig. 2.7. Schematic diagram of the proposed MSS method with additional random image for: (a) encoder, and (b) decoder side………………………………………………………..………………28 Fig. 2.8. Illustration diagram of the proposed MSS method with k image encryption: (a) encoder, and (b) decoder side…………………………………………………………….………………………..34 Fig. 2.9. Process diagram of the proposed MSS method with two different masking coefficients: (a) encoder, and (b) decoder side………………………………………………………………………..38 Fig. 2.10. Examples of proposed image encryption on Babbon image using: (a) only confussion, (b) only diffusion, and (c) combining confussion and diffusion process. The decryption results of images (a-c) using (d-f) correct keys, and (g-i) incorrect keys………………………………………………45 Fig. 2.11. Results of the proposed method with additional random image while n=4: (a-d) a set of shared images {S_1,S_2,S_3,S_4 }, (e-h) a set of recovered secret images {I ̃_1,I ̃_2,I ̃_3,I ̃_4 } using correct chaotic keys, (i-l) a set of recovered secret images {I ̃_1,I ̃_2,I ̃_3,I ̃_4 } using incorrect chaotic keys, (m-n) recovered secret images {I ̃_1,I ̃_2 } using correct keys while n-1 shared images are available, and (o-p) a set of recovered secret images {I ̃_1,I ̃_2 } using correct keys while n-2 shared images are available….....…50 Fig. 2.12. Results of the proposed method with additional random image while n=3: (a-c) shared images {S_1,S_2,S_3 }, (d-f) recovered secret images {I ̃_1,I ̃_2,I ̃_3 } using correct keys, (g-i) recovered secret images {I ̃_1,I ̃_2,I ̃_3 } using incorrect keys, (j-k) recovered secret images {I ̃_1,I ̃_2 } using correct keys while n-1 shared images available, and (l) recovered secret image I ̃_1 using correct key while n-2 shared images available……………………………………………………………………………..52 Fig. 2.13. Results of the proposed method with k=2 image encryption while n=4: (a-d) shared images {S_1,1,S_1,2,S_2,1,S_2,2 }, (e-h) recovered secret images {I ̃_1,1,I ̃_1,2,I ̃_2,1,I ̃_2,2 } using correct chaotic keys, (i-l) recovered secret images {I ̃_1,1,I ̃_1,2,I ̃_2,1,I ̃_2,2 } using incorrect chaotic keys, (m-n) recovered secret images {I ̃_1,1,I ̃_1,2 } using correct keys while nk-1 shared images are available, and (o-p) recovered secret images {I ̃_1,1,I ̃_1,2 } using correct keys while nk-2 shared images are available…54 Fig. 2.14. Results of the proposed method while n=3 and k=2: (a-c) shared images {S_1,1,S_2,1,S_3,1 }, (d-f) recovered images {I ̃_1,1,I ̃_2,1,I ̃_3,1 } using correct chaotic keys, (g-i) recovered images {I ̃_1,1,I ̃_2,1,I ̃_3,1 } using incorrect chaotic keys, and (j-l) recovered image I ̃_1,1 while nk-1, nk-2, and nk-3 shared images, respectively, are available using correct chaotic keys………..56 Fig. 2.15. Results of the proposed method using two masking coefficients while n=4: (a-d) shared images {I_1,I_2,I_3,I_4 }, (e-h) recovered secret images {I ̃_1,I ̃_2,I ̃_3,I ̃_4 } using correct keys, (i-l) recovered secret images {I ̃_1,I ̃_2,I ̃_3,I ̃_4 } using incorrect keys, (m-n) recovered secret images {I ̃_1,I ̃_2 } using correct keys while n-1 shared images are available, (o-p) recovered secret image I ̃_1 using correct keys while n-2 and n-3 shared images are available, respectively………………………………….65 Fig. 2.16. Results of the proposed method using two masking coefficients while n=3: (a-c) shared images {S_1,S_2,S_3 }, (d-f) recovered secret images {I ̃_1,I ̃_2,I ̃_3 } using correct keys, (g-i) recovered secret images {I ̃_1,I ̃_2,I ̃_3 } using incorrect keys, (j-k) recovered secret images {I ̃_1,I ̃_2 } using correct keys while n-1 shared images are available, and (l) recovered secret image I ̃_1 using correct key while n-2 shared images are available……………………………………………………………...…………..72 Fig. 2.17. Overlying two shared images: (a-b) S_1⊕S_2 and S_2⊕S_3, respectively, using the former scheme [22]. (c-d) S_1⊕S_2 and S_2⊕S_3, respectively, using the proposed method with two different masking coefficients………………………………………………………………………………...83 Fig. 3.1. Example of generated hyperchaos numbers over various types. The first and second lines are with hyperchaos type 1 and 3, respectively. The left and right column are X_n and Y_n, respectively………………………………………………………………………………………….89 Fig. 3.2. Example of hyperchaos image permutation: (a) generated hyperchaos random numbers X_n, (b) sorted hyperchaos numbers, (c) plain image, and (d) scrambled image………………………………………………………………………………..………………93 Fig. 3.3. Example of hyperchaos permutation on plain image (a) using several hyperchaos keys: (b) k=1, (c) k=2, and (d) k=3…………………………………………………………………….94 Fig. 3.4. Comparison between hyperchaos permutation and Arnold transformation over: (first line) grayscale, and (second line) color image. The histogram of each image is given at the bottom-left part. The first to the third columns are the results of Arnold transformation after one, three, and five rounds processing. The last column is the result of hyperchaos image scrambling……..…………………97 Fig. 3.5. Schematic diagram of proposed method for grayscale image: (a) watermark embedding, and (b) watermark extraction………………………………………………………………………100 Fig. 3.6. Schematic diagram of proposed method for color image: (a) watermark embedding, and (b) watermark extraction……..……………………………………………………………………….106 Fig. 3.7. Schematic diagram of FPP watermark embedding on: (a) real owner, and (b) counterfeit attacker side. Watermark extraction on: (c) real owner watermarked image, and (d) arbitrary image, using counterfeit side information…………………………………………………………………110 Fig. 3.8. Test for false positive problem: (a) watermark image W, (b) counterfeit watermark image W_c, (c) watermarked image A_w, (d) counterfeit watermarked image A_wc, (e, g) extracted watermark images W^* from watermarked image A_w and A_wc, respectively, with side information from watermark image W, i.e U_w and V_w, and (f, h) extracted watermark images W_c^* from watermarked image A_w and A_wc, respectively, with side information from watermark W_c, i.e. U_wc and V_wc………………………………………………………………………….…………………....…112 Fig. 3.9. Image sets: (a) Baboon, (b) Lake, (c) Peppers, and (d) Barbara…………………………115 Fig. 3.10. Effect of changing singular value matrix Σ of Lena image using singular value of images given Fig. 3.9……………………………………………………………………………………....117 Fig. 3.11. Effect of principal components UΣ of Lena image using singular value of images given Fig. 3.9……………………………………………………………………………………………….....121 Fig. 3.12. Comparison of MSE values between theoretical and real computation over various scaling factors on: (a-b) DCT, and (c-d) SVD approaches………………………………………………….127 Fig. 3.13. Comparison of PSNR scores over various scaling factors on: (a-b) DCT, and (c-d) SVD approaches……………………………………………..…………………………………………..129 Fig. 3.14. Imperceptibility Test: (a) host image, (b) watermark image, (c) scrambled watermark image, (d) watermarked image, (e) extracted watermark image in scrambled version, (f) descrambled extracted watermark image with correct key k=1, (g-i) descrambled extracted watermark image with wrong key k=2, k=3, and k=4, respectively…….……………………………………...131 Fig. 3.15. Performance comparison of proposed method in terms of MSE score over: (a) negative, and (b) positive scaling factor………………………………….…………………………………..133 Fig. 3.16. Performance comparison of proposed method in terms of PSNR score over: (a) negative, and (b) positive scaling factor……………………………………………………………………………………………….134 Fig. 3.17. Effect of different scaling factors over various hyperchaos permutation types…………………………………………………………………………………………….….135 Fig. 3.18. Robustness test of watermarked images under several attacks: (a) JPEG compression Q=80, (b) Gaussian noise 0.001, (c) multiplicative uniform noise 0.005, (d) additive uniform noise 0.005, (e) salt and pepper noise 0.01, (f) mean filter, (g) gamma correction, (h) image sharpening, (i) image rescaling 512×512→256×256→512×512, (j) image croping, (k) median filter 3×3, and (l) speckle noise 0.001………………………………………………………………………………...137 Fig. 3.19. Extracted watermark images under several attacks…….……………………………….139 Fig. 3.20. Robustness Test against False-Positive-Free issue: (a) watermark image 1, (b) watermark image 2, (c) watermarked image 1, (d) watermarked image 2, (e-f) extracted watermark 1 and 2 using correct keys, (g) extracted watermark 1 using wrong key from watermark 2, and (h) extracted watermark 2 using wrong key from watermark 1……………….…………………………………140 Fig. 3.21. Imperceptibility test on color image: (a) host image, (b) watermark image, (c) scrambled watermark image, (d) watermarked image, (e) scrambled extracted watermark image, (f) descrambled extracted watermark image using correct chaotic keys, and (g-i) descrambled extracted watermark image using incorrect hyperchaos keys…………………………………………………………….146 Fig. 3.22. Robustness attacks on color image: (a-l) watermarked images under some geometric manipulation and distortion as similarly given in Fig. 3.17……………………….……………….148 Fig. 3.23. Extracted watermark images from attacked watermarked images of Fig. 3.21………….149 Fig.4.1. Error diffusion on image block corner……………………………………………………158 Fig. 4.2. Schematic diagram of CF Construction………………………………………………….161 Fig. 4.3. Illustration of CF Bit-probability, (a) Max and Min Quantizer, (b) Max and Min Quantizer converted into binary……………………………………………………………………………...163 Fig. 4.4. Schematic diagram of BF Construction…………………………………………………165 Fig. 4.5. Illustration of BF Bit-Probability………………………………………………………..166 Fig. 4.6. The flowchart of DDBTC with Bit Probability…………………………………….……172 Fig. 4.7. Image retrieval result from image database Alot-4000……………………………….…178 Fig. 4.8. Image retrieval result from image database Brodatz-640……………………………….178 Fig. 4.9. Image retrieval result from image database Brodatz-1856……………………………...179 Fig. 4.10. Image retrieval result from image database Brodatz-416……………………….……..179 Fig. 4.11. Image retrieval result from image database Stex-7616………………………….……..180 Fig. 4.12. Image retrieval result from image database Vistex-640………………………….…….180 Fig. 4.13. Image retrieval result from image Corel-1000 database……………………………….184 List of Tables Table 1.1. Dissertation organization…………………………………………………………………5 Table 2.1. Similarity of Adjacent Pixels in Terms of Correlation Coefficient……………………...47 Table 2.2. Performance Comparisons Between the Proposed Image Encryption and Former Schemes in Terms of Average Information Entropy…………………………………………………….…….48 Table 2.3. Performance Comparisons Between the Proposed Image Encryption and Former Schemes in Terms of Differential Attacks……………………………………………………………..………48 Table 2.4. Performance Evaluation of the Proposed Method in Terms of Similarity Between the Secret and Recovered Images…………………………………………………………………….……......73 Table 2.5. Performance Evaluation of the Proposed Method in Terms of Differential Attacks……………………………………………………………………..……………..…………74 Table 2.6. Performance Comparisons Between the Proposed method and Former Schemes in Terms of Quantitative Results over Secret and Shared Images…………………………………….………..76 Table 2.7. Performance Comparisons Between the Proposed method and Former Schemes in Terms of Quantitative Results over Shared Images…………………………………………….…………..79 Table 2.8. Comparison between the Proposed Method and Former Schemes……………………….81 Table 3.1. Hyperchaos Discrete Nonlinear Dynamic Systems………………………………...……90 Table 3.2. Effect of changing singular value matrix Σ in terms of MSE and PSNR values………………………………………………………………………………………………117 Table 3.3. Effect of changing principal components UΣ in terms of MSE and PSNR scores………………………………………………………………………………………………122 Table 3.4. Performance Evaluation of Different Hyperchaos Permutations on FPF-SVD Image Watermarking……………………………………………………………………………………...142 Table 3.5. Performance Comparison between the Proposed Method and Former SVD-Based Image Watermarking Schemes in Terms of Algorithm Aspects…………………………….………….....143 Table 4.1. Class Matrix and The Corresponding Diffused Matrix Used In Our Experiments….…156 Table 4.2. Summary of Image Database Used in Experiment……………………….…………….173 Table 4.3. Image Retrieval Performance in Terms of ARR for Brodatz-1856 and Vistex-640 image databases…………………………………………………………………………………….…….174 Table 4.4. Image Retrieval Performance in Terms of ARR under Brodatz-416 and Brodatz-640 image databases………………………………………………………………………………………….160 Table 4.5. Image Retrieval Performance in Terms of ARR under ALOT image database…….…162 Table 4.6. Image Retrieval Performance in Terms of ARR under Stex-7616 image database…...163 Table 4.7. Image Retrieval Performance in Terms of APR under Brodatz-1856 image database..182 Table 4.8. Image Retrieval Performance in Terms of APR under Vistex-640 image database…...182 Table 4.9. Image Retrieval Performance in Terms of APR under Alot-4000 image database……182 Table 4.10. Image Retrieval Performance in Terms of APR under Brodatz-416 image database..182 Table 4.11. Image Retrieval Performance in Terms of APR under Brodatz-640 image database.183 Table 4.12. Image Retrieval Performance in Terms of APR under Stex-7616 image database….183 Table 4.13. Image classification performance under Vistex 864, USPTex, and Outex TC-00013 image databases…………………………………………………………………………………………171 Table 4.14. Image classification performance under KTH-TIPS image databases……….………...185 Table 4.15. Image classification performance under KTH-TIPS 2A image databases……………..185 Table 4.16. The retrieving time a similar image the computation complexity compared to the former scheme of the 640 image brodatz……………………………………………………….……….....186

    References

    [1] J.M. Guo, H. Prasetyo, and N.J. Wang, "Effective image retrieval system using dot-diffused block truncation coding features," IEEE Transactions on Multimedia, vol. 17, pp. 1576-1590, 2015.
    [2] R. Zahmoul, R. Ejbali, and M. Zaied, "Image encryption based on new Beta chaotic maps," Optics and Lasers in Engineering, vol. 96, pp. 39-49, 2017.
    [3] H. Zhu, C. Zhao, and X. Zhang, "A novel image encryption–compression scheme using hyper-chaos and Chinese remainder theorem," Signal Processing: Image Communication, vol. 28, pp. 670-680, 2013.
    [4] Z. Hua, Y. Zhou, C.M. Pun, and C. P. Chen, "2D Sine Logistic modulation map for image encryption," Information Sciences, vol. 297, pp. 80-94, 2015.
    [5] Y. Wu, Y. Zhou, G. Saveriades, S. Agaian, J. P. Noonan, and P. Natarajan, "Local Shannon entropy measure with statistical tests for image randomness," Information Sciences, vol. 222, pp. 323-342, 2013.
    [6] Y. Wu, J. P. Noonan, and S. Agaian, "A wheel-switch chaotic system for image encryption," in System Science and Engineering (ICSSE), 2011 International Conference on, 2011, pp. 23-27.
    [7] X. Liao, S. Lai, and Q. Zhou, "A novel image encryption algorithm based on self-adaptive wave transmission," Signal Processing, vol. 90, pp. 2714-2722, 2010.
    [8] Y. Zhou, Z. Hua, C.M. Pun, and C. P. Chen, "Cascade chaotic system with applications," IEEE transactions on cybernetics, vol. 45, pp. 2001-2012, 2015.
    [9] Z. Hua and Y. Zhou, "Image encryption using 2D Logistic-adjusted-Sine map," Information Sciences, vol. 339, pp. 237-253, 2016.
    [10] Y. Zhou, L. Bao, and C. P. Chen, "Image encryption using a new parametric switching chaotic system," Signal processing, vol. 93, pp. 3039-3052, 2013.
    [11] R. Lan, J. He, S. Wang, T. Gu, and X. Luo, "Integrated chaotic systems for image encryption," Signal Processing, vol. 147, pp. 133-145, 2018.
    [12] X. Wu, J. Weng, and W. Yan, "Adopting secret sharing for reversible data hiding in encrypted images," Signal Processing, vol. 143, pp. 269-281, 2018.
    [13] Z.L. Liu and C.M. Pun, "Reversible data-hiding in encrypted images by redundant space transfer," Information Sciences, vol. 433, pp. 188-203, 2018.
    [14] F. Khelifi, "On the security of a stream cipher in reversible data hiding schemes operating in the encrypted domain," Signal Processing, vol. 143, pp. 336-345, 2018.
    [15] J.M. Guo and H. Prasetyo, "False-positive-free SVD-based image watermarking," Journal of Visual Communication and Image Representation, vol. 25, pp. 1149-1163, 2014.
    [16] B. Harjito and H. Prasetyo, "False-positive-free GSVD-based image watermarking for copyright protection," in Electronics and Smart Devices (ISESD), International Symposium on, 2016, pp. 143-147.
    [17] T.H. Chen and C.S. Wu, "Efficient multi-secret image sharing based on Boolean operations," Signal Processing, vol. 91, pp. 90-97, 2011.
    [18] C.C. Chen and W.J. Wu, "A secure Boolean-based multi-secret image sharing scheme," Journal of Systems and Software, vol. 92, pp. 107-114, 2014.
    [19] C.N. Yang, C.H. Chen, and S.R. Cai, "Enhanced Boolean-based multi secret image sharing scheme," Journal of Systems and software, vol. 116, pp. 22-34, 2016.
    [20] J.B. Feng, H.C. Wu, C.S. Tsai, and Y.P. Chu, "A new multi-secret images sharing scheme using Largrange’s interpolation," Journal of Systems and Software, vol. 76, pp. 327-339, 2005.
    [21] C. Guo, H. Zhang, Q. Song, and M. Li, "A multi-threshold secret image sharing scheme based on the generalized Chinese reminder theorem," Multimedia Tools and Applications, vol. 75, pp. 11577-11594, 2016.
    [22] M. Deshmukh, N. Nain, and M. Ahmed, "A novel approach for sharing multiple color images by employing Chinese Remainder Theorem," Journal of Visual Communication and Image Representation, vol. 49, pp. 291-302, 2017.
    [23] S. Rastegar, F. Namazi, K. Yaghmaie, and A. Aliabadian, "Hybrid watermarking algorithm based on singular value decomposition and radon transform," AEU-International Journal of Electronics and Communications, vol. 65, pp. 658-663, 2011.
    [24] G. Bhatnagar, "A new facet in robust digital watermarking framework," AEU-International Journal of Electronics and Communications, vol. 66, pp. 275-285, 2012.
    [25] G. Bhatnagar and Q. J. Wu, "Biometrics inspired watermarking based on a fractional dual tree complex wavelet transform," Future Generation Computer Systems, vol. 29, pp. 182-195, 2013.
    [26] C. Song, S. Sudirman, and M. Merabti, "A robust region-adaptive dual image watermarking technique," Journal of Visual Communication and Image Representation, vol. 23, pp. 549-568, 2012.
    [27] G. Bhatnagar, Q. J. Wu, and B. Raman, "A new robust adjustable logo watermarking scheme," computers & security, vol. 31, pp. 40-58, 2012.
    [28] G. Bhatnagar, B. Raman, and Q. J. Wu, "Robust watermarking using fractional wavelet packet transform," IET Image Processing, vol. 6, pp. 386-397, 2012.
    [29] E. Yen and L.H. Lin, "Rubik’s cube watermark technology for grayscale images," Expert Systems with Applications, vol. 37, pp. 4033-4039, 2010.
    [30] J.M. Guo and H. Prasetyo, "Security analyses of the watermarking scheme based on redundant discrete wavelet transform and singular value decomposition," AEU-International Journal of Electronics and Communications, vol. 68, pp. 816-834, 2014.
    [31] W. El-Shafai, E.S. M. El-Rabaie, M. El-Halawany, and F. E. A. El-Samie, "Efficient multi-level security for robust 3D color-plus-depth HEVC," Multimedia Tools and Applications, pp. 1-27, 2018.
    [32] P. Vaidya and C. M. PVSSR, "A robust semi-blind watermarking for color images based on multiple decompositions," Multimedia Tools and Applications, vol. 76, pp. 25623-25656, 2017.
    [33] A. Zear, A. K. Singh, and P. Kumar, "A proposed secure multiple watermarking technique based on DWT, DCT and SVD for application in medicine," Multimedia Tools and Applications, vol. 77, pp. 4863-4882, 2018.
    [34] G. Bhatnagar and Q. J. Wu, "A new robust and efficient multiple watermarking scheme," Multimedia Tools and Applications, vol. 74, pp. 8421-8444, 2015.
    [35] P. Singh, B. Raman, and P. P. Roy, "A multimodal biometric watermarking system for digital images in redundant discrete wavelet transform," Multimedia Tools and Applications, vol. 76, pp. 3871-3897, 2017.
    [36] S. P. alias Sathya and S. Ramakrishnan, "Fibonacci Based Key Frame Selection and Scrambling for Video Watermarking in DWT–SVD Domain," Wireless Personal Communications, pp. 1-21.
    [37] S. P. Singh and G. Bhatnagar, "A new robust watermarking system in integer DCT domain," Journal of Visual Communication and Image Representation, vol. 53, pp. 86-101, 2018.
    [38] P. Singh and B. Raman, "Reversible data hiding based on Shamir’s secret sharing for color images over cloud," Information Sciences, vol. 422, pp. 77-97, 2018.
    [39] P. Singh, B. Raman, and M. Misra, "A secure image sharing scheme based on SVD and Fractional Fourier Transform," Signal Processing: Image Communication, vol. 57, pp. 46-59, 2017.
    [40] M. Mardanpour and M. A. Z. Chahooki, "Robust transparent image watermarking with Shearlet transform and bidiagonal singular value decomposition," AEU-International Journal of Electronics and Communications, vol. 70, pp. 790-798, 2016.
    [41] J.M. Guo, H. Prasetyo, and K. Wong, "Halftoning-based block truncation coding image restoration," Journal of Visual Communication and Image Representation, vol. 35, pp. 193-197, 2016.
    [42] J.M. Guo, H. Prasetyo, M. E. Farfoura, and H. Lee, "Vehicle Verification Using Features From Curvelet Transform and Generalized Gaussian Distribution Modeling," IEEE Transactions. Intelligent Transportation Systems, vol. 16, pp. 1989-1998, 2015.
    [43] J.M. Guo, H. Prasetyo, and J.H. Chen, "Content-based image retrieval using error diffusion block truncation coding features," IEEE Transactions on Circuits and Systems for Video Technology, vol. 25, pp. 466-481, 2015.
    [44] B. S. Manjunath and W.Y. Ma, "Texture features for browsing and retrieval of image data," IEEE Transactions on pattern analysis and machine intelligence, vol. 18, pp. 837-842, 1996.
    [45] M. Kokare, P. K. Biswas, and B. N. Chatterji, "Texture image retrieval using new rotated complex wavelet filters," IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), vol. 35, pp. 1168-1178, 2005.
    [46] T. Ojala, M. Pietikäinen, and D. Harwood, "A comparative study of texture measures with classification based on featured distributions," Pattern recognition, vol. 29, pp. 51-59, 1996.
    [47] X. Tan and B. Triggs, "Enhanced local texture feature sets for face recognition under difficult lighting conditions," IEEE transactions on image processing, vol. 19, pp. 1635-1650, 2010.
    [48] Z. Guo, L. Zhang, and D. Zhang, "Rotation invariant texture classification using LBP variance (LBPV) with global matching," Pattern recognition, vol. 43, pp. 706-719, 2010.
    [49] M. Subrahmanyam, R. Maheshwari, and R. Balasubramanian, "Local maximum edge binary patterns: a new descriptor for image retrieval and object tracking," Signal Processing, vol. 92, pp. 1467-1479, 2012.
    [50] B. Zhang, Y. Gao, S. Zhao, and J. Liu, "Local derivative pattern versus local binary pattern: face recognition with high-order local pattern descriptor," IEEE transactions on image processing, vol. 19, pp. 533-544, 2010.
    [51] S. Murala, R. Maheshwari, and R. Balasubramanian, "Local tetra patterns: a new feature descriptor for content-based image retrieval," IEEE Transactions on Image Processing, vol. 21, pp. 2874-2886, 2012.
    [52] M. Subrahmanyam, Q. J. Wu, R. Maheshwari, and R. Balasubramanian, "Modified color motif co-occurrence matrix for image indexing and retrieval," Computers & Electrical Engineering, vol. 39, pp. 762-774, 2013.
    [53] R. Kwitt and A. Uhl, "Lightweight probabilistic texture retrieval," IEEE Transactions on Image Processing, vol. 19, pp. 241-253, 2010.
    [54] R. Kwitt and A. Uhl, "Image similarity measurement by Kullback-Leibler divergences between complex wavelet subband statistics for texture retrieval," in Image Processing, 2008. ICIP 2008. 15th IEEE International Conference on, 2008, pp. 933-936.
    [55] N.E. Lasmar and Y. Berthoumieu, "Gaussian copula multivariate modeling for texture image retrieval using wavelet transforms," IEEE Transactions on Image Processing, vol. 23, pp. 2246-2261, 2014.
    [56] A. Porebski, N. Vandenbroucke, and L. Macaire, "Haralick feature extraction from LBP images for color texture classification," in Image Processing Theory, Tools and Applications, 2008. IPTA 2008. First Workshops On, 2008, pp. 1-8.
    [57] G.H. Liu, Z.Y. Li, L. Zhang, and Y. Xu, "Image retrieval based on micro-structure descriptor," Pattern Recognition, vol. 44, pp. 2123-2133, 2011.
    [58] F. Bianconi, A. Fernández, E. González, D. Caride, and A. Calviño, "Rotation-invariant colour texture classification through multilayer CCR," Pattern Recognition Letters, vol. 30, pp. 765-773, 2009.
    [59] G. Paschos and M. Petrou, "Histogram ratio features for color texture classification," Pattern Recognition Letters, vol. 24, pp. 309-314, 2003.
    [60] M. A. Hoang, J.M. Geusebroek, and A. W. Smeulders, "Color texture measurement and segmentation," Signal processing, vol. 85, pp. 265-275, 2005.
    [61] M. A. Hoang and J.-M. Geusebroek, "Measurement of color texture," in Workshop on Texture Analysis in Machine Vision, 2002, pp. 73-76.
    [62] J. J. d. M. S. Junior, P. C. Cortez, and A. R. Backes, "Color texture classification using shortest paths in graphs," IEEE Transactions on Image Processing, vol. 23, pp. 3751-3761, 2014.
    [63] B. J. Campana and E. J. Keogh, "A compression‐based distance measure for texture," Statistical Analysis and Data Mining: The ASA Data Science Journal, vol. 3, pp. 381-398, 2010.
    [64] T. Guha and R. K. Ward, "Image similarity using sparse representation and compression distance," IEEE Transactions on Multimedia, vol. 16, pp. 980-987, 2014.
    [65] D. G. Lowe, "Distinctive image features from scale-invariant keypoints," International journal of computer vision, vol. 60, pp. 91-110, 2004.
    [66] T. Ojala, K. Valkealahti, E. Oja, and M. Pietikäinen, "Texture discrimination with multidimensional distributions of signed gray-level differences," Pattern Recognition, vol. 34, pp. 727-739, 2001.
    [67] J. Chen, S. Shan, C. He, G. Zhao, M. Pietikainen, X. Chen, et al., "WLD: A robust local image descriptor," IEEE transactions on pattern analysis and machine intelligence, vol. 32, pp. 1705-1720, 2010.
    [68] A. Satpathy, X. Jiang, and H.L. Eng, "LBP-based edge-texture features for object recognition," IEEE Transactions on Image Processing, vol. 23, pp. 1953-1964, 2014.
    [69] X. Wang and Z. Wang, "A novel method for image retrieval based on structure elements’ descriptor," Journal of Visual Communication and Image Representation, vol. 24, pp. 63-74, 2013.
    [70] W. Xing Yuan, L. Fan Ping, and W. Shu Guo, "Fractal image compression based on spatial correlation and hybrid genetic algorithm," Journal of Visual Communication and Image Representation, vol. 20, pp. 505-510, 2009.
    [71] D. Cerra and M. Datcu, "A fast compression-based similarity measure with applications to content-based image retrieval," Journal of Visual Communication and Image Representation, vol. 23, pp. 293-302, 2012.
    [72] P. Liu, J.M. Guo, C.-Y. Wu, and D. Cai, "Fusion of deep learning and compressed domain features for content-based image retrieval," IEEE Transactions on Image Processing, vol. 26, pp. 5706-5717, 2017.
    [73] E. Hoque, O. Hoeber, G. Strong, and M. Gong, "Combining conceptual query expansion and visual search results exploration for Web image retrieval," Journal of Ambient Intelligence and Humanized Computing, vol. 4, pp. 389-400, 2013.
    [74] N.V. Nguyen, A. Boucher, J.-M. Ogier, and S. Tabbone, "Cluster-based relevance feedback for CBIR: a combination of query point movement and query expansion," Journal of ambient intelligence and humanized computing, vol. 3, pp. 281-292, 2012.
    [75] P. Fränti and T. Kaukoranta, "Binary vector quantizer design using soft centroids," Signal Processing: Image Communication, vol. 14, pp. 677-681, 1999.
    [76] G. J. Burghouts and J.M. Geusebroek, "Material-specific adaptation of color invariant features," Pattern Recognition Letters, vol. 30, pp. 306-313, 2009.
    [77] "SIPI-USC Brodatz texture image database," online available on http:// http://sipi.usc.edu/database/database.php?volume=textures.
    [78] "Salzburg Texture (Stex) image database," online available on http://www.wavelab.at/sources/STex/.
    [79] "Outex texture image database," online available on http://www.outex.oulu.fi/index.php?page=outex_home
    [80] K. Sharifi and A. Leon Garcia, "Estimation of shape parameter for generalized Gaussian distributions in subband decompositions of video," IEEE Transactions on Circuits and Systems for Video Technology, vol. 5, pp. 52-56, 1995.
    [81] M. N. Do and M. Vetterli, "Wavelet-based texture retrieval using generalized Gaussian density and Kullback-Leibler distance," IEEE transactions on image processing, vol. 11, pp. 146-158, 2002.
    [82] M. H. Pi, C.S. Tong, S.K. Choy, and H. Zhang, "A fast and effective model for wavelet subband histograms and its application in texture image retrieval," IEEE transactions on image processing, vol. 15, pp. 3078-3088, 2006.

    QR CODE