• Journal of the Korean Society for Precision Engineering
• /
• v.32 no.9
• /
• pp.833-840
• /
• 2015

Inkjet technology is one of the commonly used technologies in the printed-electronics field. The primary issue regarding the usage of inkjet technology as a printed-electronics tool is the printing resolution; therefore, to print complicated patterns of precise dimensions, we developed software that can convert a CAD file into a bitmap image. Moreover, as a bitmap image is not comprised of physical dimensions, its resolution needs to be defined in terms of pixel distance to print a rasterized bitmap image. In this study, we investigated the effects of pixel distance and dot size on printing resolution; based on the experiment results, we concluded that the printed dot size should be used to determine the optimal pixel distance. Lastly, we also propose inkjet printing procedures for bitmap images.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2326-2345
• /
• 2016

For the compression of color images, a common bitmap usually is generated to replace the three individual bitmaps that originate from block truncation coding (BTC) of the R, G and B channels. However, common bitmaps generated by some traditional schemes are not the best possible because they do not consider the minimized distortion of the entire color image. In this paper, we propose a near-optimized common bitmap scheme for BTC using Binary Ant Colony Optimization (BACO), producing a BACO-BTC scheme. First, the color image is compressed by the BTC algorithm to get three individual bitmaps, and three pairs of quantization values for the R, G, and B channels. Second, a near-optimized common bitmap is generated with minimized distortion of the entire color image based on the idea of BACO. Finally, the color image is reconstructed easily by the corresponding quantization values according to the common bitmap. The experimental results confirmed that reconstructed image of the proposed scheme has better visual quality and less computational complexity than the referenced schemes.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.10
• /
• pp.135-141
• /
• 2012

To reduce frame memory size usage in LCD overdrive, block truncation coding (BTC) image compression is commonly used. For maximization of compression ratio, BTC image compression is need to compress bitmap or quantization data. In this paper, for high compression ratio, we propose CMBQ-BTC (CMBQ : compression method bitmap data and quantization data) algorithm. Experimental results show that proposed algorithm is efficient as compared with PSNR and compression ratio of the conventional BTC method.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.10 no.6
• /
• pp.95-101
• /
• 2011

Micro-abrasive jet machining(${\mu}AJM$) using mask is a fine machining technology which can carve a figure on a material. The mask should have holes exactly same as the required figure. Abrasive particles are jetted into the holes of the mask and it collide with the material. The collision break off small portion of the material. And the ${\mu}AJM$ nozzle should move all over the machining area. However, in general the carving shape is modeled as in a bitmap figure, because it often contains characters. And the mask model is also often modeled from the bitmap image. Therefore, the machining path of the ${\mu}AJM$ also efficient if it can be generated from the bitmap image. This paper suggest an algorithm which can generate ${\mu}AJM$ tool path directly from the bitmap image of the carving figure. And shows some test results and applications.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.165-168
• /
• 2001

It is possible to classify image data into two types according to the internal representation: one is bitmap, the other is vector. A bitmap image is represented by the two dimensional pixels whereas a vector image is represented by mathematical functions to draw vector objects such as line, rectangle and circle on the two or three dimensional space. So it is necessary for users to use a individual application program for each different image. In this paper, we present a method for designing and implementation of image editing tool based on combining of bitmap and vector image.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.2
• /
• pp.288-293
• /
• 2002

It is possible to classify image data into two types according to the internal representation: one is bitmap, the other is vector. A bitmap image is represented by the two dimensional pixels whereas a vector image is represented by mathematical functions to draw vector objects such as line, rectangle and circle on the two or three dimensional space. So it is necessary for users to use a individual application program for each different image. In this paper, we present a method for design and implementation of image editing tool based on combining of bitmap and vector image.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.435-440
• /
• 2009

The scalable vector graphics (SVG) standard has allowed the complex bitmap images to be represented by vector based graphics and provided some advantages over the raster based graphics in applications, for example, where scalability is required. This paper presents an algorithmto convert bitmap images into SVG format. The algorithm is an integration of pixel-level triangulation, data dependent triangulation, a new image mesh simplification algorithm, and a polygonization process. Both triangulation techniques enable the image quality (especially the edge features) to be preserved well in the reconstructed image and the simplification and polygonization procedures reduce the size of the SVG file. Experiments confirm the effectiveness of the proposed algorithm.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.1
• /
• pp.111-120
• /
• 2015

HDR(High dynamic range) imaging is a technique to represent a dynamic range of real world. Exposure fusion is a method to obtain a pseudo-HDR image and it directly fuses multi-exposure images instead of generating the true-HDR image. However, it results ghost artifacts while fusing the multi-exposure images with moving objects. To solve this drawback, temporal consistency assessment is proposed to remove moving objects. Firstly, multi-level threshold bitmap and brightness bitmap are proposed. In addition, hue-angle constancy map between multi-exposure images is proposed for compensating a bitmap. Then, two bitmaps are combined as a temporal weight map. Spatial domain image quality assessment is used to generate a spatial weight map. Finally, two weight maps are applied at each multi-exposure image and combined to get the pseudo-HDR image. In experiments, the proposed method reduces ghost artifacts more than previous methods. The quantitative ghost-free evaluation of the proposed method is also less than others.

• Proceedings of the IEEK Conference
• /
• 2003.11b
• /
• pp.157-160
• /
• 2003

Recently, several steganographic algorithms for two-color binary images have been proposed. In this paper, we propose a steganographic algorithm which embeds a secret message into bitmap images and palette-based images. To embed a message, the suggested algorithm divides a bitmap image into bit-plane images from LSB-plane to MSB-plane for each pixel, and considers each bit-plane image as a binary one. The algorithm splits each bit-plane image into m$\times$n blocks. and embeds a r-bit(r=[log$_2$(mn+1]-1) message into the block. And our schemes embed a message to every bit-plane from LSB to MSB to maximize the amount of embedded message and to minimize the degradation. The schemes change at most two pixels in each block. Therefore, the maximal color changes of the new algorithm are much smaller than other bit-plane embedding schemes' such as the substantial substitution schemes.

• Journal of the Korean Institute of Navigation
• /
• v.19 no.3
• /
• pp.21-28
• /
• 1995

Mathematical morphology skeleton image processing makes many partial skeleton image planes from an original binary image. And the original binary image can be reconstructed without any distortion by summing the first partial skeleton image plane and each dilated partial skeleton image planes using the same structuring element. Especially compression effects of Elias coding to the morphological globally minimal skeleton(GMS) image, is better than that of PCX and Huffman coding. And then this paper proposes mathematical morphological GMS image processing which can be applied to a binary image transmitting for facimile and big size(bigger than $64{\times}64$ size) bitmap fonts storing in a memory.