Abstract
We propose an image file format that can be read in two ways, where two images are recorded in a single file as a bit sequence, and the forward reading the bit sequence makes one of the two images visible, or the backward reading makes another image visible. Such a way of looking at a binary data in two ways resembles that of an ambigram, which is a piece of calligraphy that can be read in two ways by rotating it or introducing other perspectives. The proposed ambigramic image file format is compared with the graphics interchange format (GIF) experimentally, and the results show the better quality of the ambigramic images than that of GIF images.
Highlights
We propose an image file format that can be read in for evaluating the quality of halftone images including two ways, where two images are recorded in a single file as a bit sequence, and the forward reading the bit sequence makes one of the two images visible, or the backward reading makes another image visible
Global Journal of Computer Science and Technology ( F ) Volume XXI Issue I Version I. Inspired by such successful ambigrams, in this paper we suggest an application of the idea of ambigram to an ambigramic interpretation of a bit sequence
The proposed ambigramic images are compared with the graphics interchange format (GIF) images [4], and the effectiveness of the proposed method is demonstrated in the experiments using natural images, where an image quality measure is used
Summary
Kyushu University Abstract- We propose an image file format that can be read in two ways, where two images are recorded in a single file as a bit sequence, and the forward reading the bit sequence makes one of the two images visible, or the backward reading makes another image visible. Our basic principle is to preserve more significant bits of the original image data in the resultant ambigramic image file Following this principle, we first extract four MSBs from both A and B as follows: Where k and l denote relative indices to access the neighboring pixels, and wk,l denotes error diffusion coefficients or error filter [5]. The resultant images can be corrupted by the replacement of the original four LSBs with others To alleviate such a quality deterioration in the images, we propose an error diffusion algorithm for generating better bit sequence, which improves the visual quality of the images. The proposed error diffusion procedure is a1+k,1+l ← a1+k,1+l + wk,leA1,1, summarized in Algorithm 1, where the function (7) ‘zeros_like’ returns an array of zeros being the same size as the argument array, A.shape is a property to get the array dimensions of A, and KLij denotes a set of the pair of the relative indices k and l satisfying 1 ≤ i + k ≤ m and 1 ≤ j + l ≤ n
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
