Earticle

현재 위치 Home

A Block-wise-based Fragile Watermarking Hybrid Approach using Rough Sets and Exponential Particle Swarm Optimization

첫 페이지 보기
  • 발행기관
    보안공학연구지원센터(IJFGCN) 바로가기
  • 간행물
    International Journal of Future Generation Communication and Networking 바로가기
  • 통권
    Vol.4 No.4 (2011.12)바로가기
  • 페이지
    pp.77-88
  • 저자
    Lamiaa M. El Bakrawy, Neveen I. Ghali, Tai-hoon Kim, Aboul ella Hassanien
  • 언어
    영어(ENG)
  • URL
    https://www.earticle.net/Article/A167032

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

원문정보

초록

영어
In this paper, we propose a fragile watermarking hybrid approach using rough set kmeans
and exponential particle swarm optimization (EPSO) systems. It is based on a
block-wise dependency mechanism which can detect any alterations made to the protected
image. Initially, the input image is divided into blocks with equal size in order to improve
image tamper localization precision. Then feature sequence is generated by applying rough
k-means and EPSO clustering to create the relationship between all image blocks and cluster
all of them since EPSO is used to optimize the parameters of rough k-means. Both feature
sequence and generated secret key are used to construct the authentication data. Each
resultant 8-bit authentication data is embedded into the eight least significant bits (LSBs)
of the corresponding image block. We gives experimental results which show the feasibility
of using these optimization algorithms for the fragile watermarking and demonstrate the
accuracy of the proposed approach. The performance comparison of the approach was also
realized. The performance of a fragile watermarking approach has been improved in this
paper by using exponential particle swarm optimization (EPSO) to optimize the rough kmean
parameters. The proposed approach can embed watermark without causing noticeable
visual artifacts, and does not only achieve superior tamper detection in images accurately,
it also recovers tampered regions effectively. In addition, the results show that the proposed
approach can effectively thwart different attacks, such as the cut-and paste attack and collage
attack, while sustaining superior tamper detection and localization accuracy.

목차

Abstract
 1 Introduction
 2 Preliminaries: Rough Sets and Particle Swarm Optimization
  2.1 Rough sets
  2.2 Particle swarm optimization
 3 Some improvement
  3.1 Adaptation of K-means to rough set theory
  3.2 Exponential particle swarm optimization
 4 A Block wise-based fragile watermarking approach
  4.1 Rough K-means and exponential particle swarm algorithm
  4.2 Watermark embedding procedure
  4.3 Tamper detection phase
 5 Experimental results and analysis
  5.1 Performance evaluation
  5.2 Performance comparisons and analysis
 6 Conclusions
 References

저자

  • Lamiaa M. El Bakrawy [ Al-Azhar University, Faculty of Science, Cairo, Egypt ]
  • Neveen I. Ghali [ Al-Azhar University, Faculty of Science, Cairo, Egypt ]
  • Tai-hoon Kim [ Hannam University, Korea ]
  • Aboul ella Hassanien [ Cairo University, Faculty of Computers and Information, Cairo, Egypt ]

참고문헌

자료제공 : 네이버학술정보

간행물 정보

발행기관

  • 발행기관명
    보안공학연구지원센터(IJFGCN) [Science & Engineering Research Support Center, Republic of Korea(IJFGCN)]
  • 설립연도
    2006
  • 분야
    공학>컴퓨터학
  • 소개
    1. 보안공학에 대한 각종 조사 및 연구 2. 보안공학에 대한 응용기술 연구 및 발표 3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최 4. 보안공학 기술의 상호 협조 및 정보교환 5. 보안공학에 관한 표준화 사업 및 규격의 제정 6. 보안공학에 관한 산학연 협동의 증진 7. 국제적 학술 교류 및 기술 협력 8. 보안공학에 관한 논문지 발간 9. 기타 본 회 목적 달성에 필요한 사업

간행물

  • 간행물명
    International Journal of Future Generation Communication and Networking
  • 간기
    격월간
  • pISSN
    2233-7857
  • 수록기간
    2008~2016
  • 십진분류
    KDC 505 DDC 605

이 권호 내 다른 논문 / International Journal of Future Generation Communication and Networking Vol.4 No.4

    피인용수 : 0(자료제공 : 네이버학술정보)

    함께 이용한 논문 이 논문을 다운로드한 분들이 이용한 다른 논문입니다.

      페이지 저장