Efficient Binary Data Hiding Technique in Boundary Points

Data hiding is now becoming most important research area now a day. One efficient binary data hiding technique into a digital image has been proposed in this study. The proposed work focuses on the learning of different edge detection and data hiding techniques and analysis of their relative performances. Work focuses on finding the boundary edges of size of the length of the data to be hided. Sobel, Prewitt, Roberts and Canny edge detection techniques have been used to hide data. Comparison results show Prewitt is a better technique for finding the edges of particular size. Binary data of different size have been hided in edges points to generate the image with hided data. Original data is also extracted from the image with similar approach of hiding. The proposed technique hides data with minimum number of change of bits of the original image (As an example: Twenty bits of data can hide by changing of four bits only). Therefore the proposed approach is most efficient and useful for hiding information.