Bit Plane Complexity Segmentation (BPCS)

Authors

  • Firamawati Hia Fakultas Ilmu Komputer, Prodi Teknik Informatika, Universitas Katolik Santo Thomas Medan
  • Fortina Lumban Gaol Fakultas Ilmu Komputer, Prodi Teknik Informatika, Universitas Katolik Santo Thomas Medan
  • Muhammad Rizqy Aditya Pratama Fakultas Ilmu Komputer, Prodi Teknik Informatika, Universitas Katolik Santo Thomas Medan

Keywords:

BPCS, Echo Hiding, visual complexity, digital image

Abstract

Bit Plane Complexity Segmentation (BPCS) is a steganographic method that utilizes the visual complexity characteristics of digital images to embed secret information. This method works by dividing an image into several bit-planes, then measuring the level of complexity of each bit-plane block. Blocks with high complexity are considered similar to noise, making them suitable as a medium for data embedding without causing significant visual changes to the original image. The main advantage of BPCS lies in its large data embedding capacity and high level of security, as the hidden information is difficult to detect through visual observation or simple analysis. Therefore, BPCS becomes an effective solution for securing digital data, particularly in applications such as copyright protection, confidential communication, and information security.

Downloads

Published

2026-04-21

How to Cite

Firamawati Hia, Fortina Lumban Gaol, & Muhammad Rizqy Aditya Pratama. (2026). Bit Plane Complexity Segmentation (BPCS). BIOS: Jurnal Informatika Dan Sains, 4(01), 36–42. Retrieved from https://seaninstitute.or.id/bersinar/index.php/bios/article/view/253