<XML><RECORDS><RECORD><REFERENCE_TYPE>3</REFERENCE_TYPE><REFNUM>9373</REFNUM><AUTHORS><AUTHOR>English,R.</AUTHOR></AUTHORS><YEAR>2010</YEAR><TITLE>Comparison of high capacity steganography techniques</TITLE><PLACE_PUBLISHED>Soft Computing and Pattern Recognition (SoCPaR), 2010 International Conference of</PLACE_PUBLISHED><PUBLISHER>IEEE</PUBLISHER><PAGES>448-453</PAGES><ISBN>978-1-4244-7897-2</ISBN><LABEL>English:2010:9373</LABEL><KEYWORDS><KEYWORD>steganography</KEYWORD></KEYWORDS<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.</ABSTRACT></RECORD></RECORDS></XML>