00000ctmaa22000003a 4500 UP-1685675941123940357 Buklod 20160908103616.0 aa rb |||1 u| ta 160908s xx d r |||| u| (iLib)UPTAC-00018460479 UPVTC eng LG 993.5 2016 C66 T36 Tan, Edrian Jay Z. author. Steganography using Optimal Least Significant Bit with greedy algorithm Edrian Jay Z. Tan; John D. Ultra, adviser. 2016. [8], 47 leaves illustrations. Undergraduate thesis (B.S. Computer Science) -- University of the Philippines, Tacloban. In steganography, the robustness of the stego object is an important criterion in evaluating a technique. Maintaining this property gets harder as the size of the secret message increases, making the stego object less robust and susceptible to attacks from third parties. Numerous ways to increase the imperceptibility and security of the stego object have been studied. In this paper, the Optimal Least Significant Bit (OLSB) technique was used to embed secret messages into a digital image. A greedy algorithm was used to find the optimal substitution vector for a specific embedding of a secret message to a cover image. The greedy algorithm was compared to an implementation of an improved Bat algorithm and showed satisfactory results based on the quality of the output substitution vectors and its average running time. Steganography. Optimal Least Significant Bit (OLSB). Greedy algorithm. Ultra, John D. adviser. FI UP UPTAC UPTAC LG 993.5 2016 C66 T36 Thesis