### Abstract

The objective of this paper is to implement the Bit Plane Complexity Segmentation (BPCS) algorithm and provide a comparison in terms of effectiveness and hiding capacity with the least significant bits algorithm (LSB) using 4 bits. The BPCS algorithm was chosen due to the effective high hiding capacity promised. The four LSB algorithm was selected as it promised a similar capacity. The motivation for the work was to explicitly examine the hypothesis that the BPCS algorithm would out perform the four LSB algorithm using low order attacks. Effectiveness of the algorithms was measured by visual attacks and basic first order statistical attacks on the stego-images produced. The outcome of the research showed that whilst the hiding capacity of the two algorithms were comparable (both equating to roughly 50%), the four LSB algorithm at the maximum capacity was ineffective. This was due to the fact that a visual attack sufficed to realise there was something hidden. In contrast, the BPCS algorithm provided a much more effective method for obtaining a 50% capacity since visual attacks did not suffice for detection.

Original language | English |
---|---|

Title of host publication | Proceedings of the 2010 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2010 |

Editors | Trevor Martin, Azah Kamilah Muda, Ajith Abraham, Henri Prade, Anne Laurent, Dominique Laurent, Virginie Sans |

Place of Publication | Piscataway |

Publisher | IEEE |

Pages | 448-453 |

Number of pages | 6 |

ISBN (Print) | 9781424478958 |

DOIs | |

Publication status | Published - 13 Jan 2010 |

Externally published | Yes |

Event | 2010 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2010 - Cergy-Pontoise, France Duration: 7 Dec 2010 → 10 Dec 2010 |

### Conference

Conference | 2010 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2010 |
---|---|

Country | France |

City | Cergy-Pontoise |

Period | 7/12/10 → 10/12/10 |

### Keywords

- BPCS
- high capacity steganography
- visual attacks
- bit plane complexity segmentation
- least significant bits algorithm (LSB)

## Fingerprint Dive into the research topics of 'Comparison of high capacity steganography techniques'. Together they form a unique fingerprint.

## Cite this

*Proceedings of the 2010 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2010*(pp. 448-453). IEEE. https://doi.org/10.1109/SOCPAR.2010.5686507