editorinchief@ijsreat.com +91 9840521421 Scholarly Open Access, Peer-reviewed, Refereed Journal e-ISSN 2583-1240 Since 2021
  1. Home
  2. Archives
  3. 2023
  4. Vol. 3 Issue 4
  5. Article
Research Article

Wavelets-Based Optimal Bandwidth Steganography for Images

  • Paper ID 88
  • Volume 3, Issue 4
  • Pages 18-21
  • Published Online: July-August 2023
  • 5 Views
Open Access Peer Reviewed

Authors

  • Bismin Chacko1
  • Dinla Koonkaran2
  • Raveena Raveendran3

1,2Asst. Prof, Dept. of ECE, KMCT College Of Engineering, Kerala, India. 3Professor, Dept. of ECE, KMCT College Of Engineering, Kerala, India.

Article Information

DOI
No DOI
Published Online
July-August 2023
Pages
18-21
Article Type
Research Article
Check for updates
No DOI available for cross-reference

Abstract

View PDF

Information concealing strategies play taken significant part with the quick development of concentrated move of mixed media content and mystery interchanges. Steganography is the specialty of concealing data in manners that forestall discovery. The wavelet change has acquired far reaching acknowledgment in picture handling. Discrete Wavelet Change plays out a multi-goal investigation and space recurrence confinement. The proposed Steganography calculation deals with the haar and daubechies wavelet change coefficients of the first picture to implant the mystery picture. Here discrete wavelet changes is utilized to change the both unique picture and mystery picture. So discrete wavelet changes permits wonderful implanting of the secret message and recreation. When contrasted with the current change space information concealing strategies [1] this plan can give an effective ability to information stowing away without forfeiting the first picture quality. Keywords: Discrete Wavelet changes, Touch Plane Intricacy division, Limit

APC from ₹1200 + 18% GST

Peer-reviewed open access₹1200 Indian (₹1400 with DOI)$80 USD internationalpaid after acceptance Peer-reviewed open access₹1200 Indian$80 USD international ₹1200 Indian · $80 intl

  • CrossRef DOI
  • ISSN 2583-1240
  • Open Access
  • Peer Reviewed
  • Plagiarism Checked
  • Google Scholar
Submit Paper