The basic concept of information hiding embeds secret data into meaningful multimedia data so as to fool grabbers from perceiving the existence of secret data. Among all information hiding techniques, Mielikainen’s method has high embedding capacity (1 bpp) and few quantities of pixel modifications when embedding secret data. In this proposal, we propose two subjects that use XOR Function to link all pixels so as to further reduce the quantities of pixel modifications. In the first subject, Mielikainen’s method is modified and the XOR value of each pixel is related to its two neighboring pixels. Under the situation that the XOR value of a pixel is not compatible with the corresponding secret bit, we can modify not only the pixel itself but also one of its two neighboring pixels instead. According to this concept, our embedding algorithm is proposed to further reduce the quantities of pixel modifications. In the second subject, the XOR value of each pixel is related to a certain number of neighboring pixels. Owing to the increasing of the involved pixels for producing XOR value, the number of all possible situations becomes larger and the algorithm of the first subject is not suitable anymore. In this subject, Greedy algorithm is used to find pixels with great benefits and the pixels have high priority to be modified. It can be expected that the quantities of pixel modifications in the proposed method are fewer than those of Mielikainen’s method. The results of this project will effectively contribute to the area of information hiding.