A multidimensional chaotic image encryption algorithm based on the region of interest
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Liu, Yang | - |
dc.contributor.author | Zhang, Jindong | - |
dc.contributor.author | Han, Dongqi | - |
dc.contributor.author | Wu, Peibin | - |
dc.contributor.author | Sun, Yiding | - |
dc.contributor.author | Moon, Young Shik | - |
dc.date.accessioned | 2021-06-22T09:23:02Z | - |
dc.date.available | 2021-06-22T09:23:02Z | - |
dc.date.issued | 2020-07 | - |
dc.identifier.issn | 1380-7501 | - |
dc.identifier.issn | 1573-7721 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/1908 | - |
dc.description.abstract | Most image encryption algorithms encrypt the whole image, but only part of the data is important in the image. In this paper, we propose a multidimensional chaotic image encryption algorithm based on the region of interest (ROI). The histogram of oriented gradients (HOG) feature extraction and support vector machine (SVM) are used to separate the region of interest from the whole image. Then, the region of interest pixels is messed up by using the improved Henon sequence, Joseph sequence and the region of interest pixels are diffused by using the unified chaotic sequence to hide the sensitive information in the image, so as to achieve the purpose of private protection. Furthermore, the improved logistic sequence is used to hide the edge information of the target image to achieve the tradeoff between the secrecy of information and the complexity of encryption. A series of analyses are carried out including key space analysis, key sensitivity analysis, statistical analysis, information entropy analysis, analysis of the fixed-point obscuration analysis, quality analysis and image decryption for our encryption algorithm. Through experiments and comparisons, the proposed algorithm has good performance in encrypting image and coping with various invasions. The image encryption algorithm based on ROI has a good performance of security, moreover through the main encryption of ROI can effectively shorten the encryption time, so as to achieve the compromise of security and computational complexity. | - |
dc.format.extent | 37 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Springer Nature | - |
dc.title | A multidimensional chaotic image encryption algorithm based on the region of interest | - |
dc.type | Article | - |
dc.publisher.location | 네델란드 | - |
dc.identifier.doi | 10.1007/s11042-020-08645-8 | - |
dc.identifier.scopusid | 2-s2.0-85080901154 | - |
dc.identifier.wosid | 000516363300001 | - |
dc.identifier.bibliographicCitation | Multimedia Tools and Applications, v.79, no.25-26, pp 17669 - 17705 | - |
dc.citation.title | Multimedia Tools and Applications | - |
dc.citation.volume | 79 | - |
dc.citation.number | 25-26 | - |
dc.citation.startPage | 17669 | - |
dc.citation.endPage | 17705 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Software Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.subject.keywordPlus | SCHEME | - |
dc.subject.keywordPlus | COMPRESSION | - |
dc.subject.keywordPlus | SYSTEM | - |
dc.subject.keywordPlus | MAP | - |
dc.subject.keywordPlus | PERMUTATION | - |
dc.subject.keywordAuthor | Chaos | - |
dc.subject.keywordAuthor | Histogram of oriented gradients | - |
dc.subject.keywordAuthor | Region of interest | - |
dc.subject.keywordAuthor | Support vector machine | - |
dc.subject.keywordAuthor | Henon sequence | - |
dc.subject.keywordAuthor | Unified chaotic sequence | - |
dc.identifier.url | https://link.springer.com/article/10.1007/s11042-020-08645-8 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.