• Title/Summary/Keyword: bitmap images

Search Result 35, Processing Time 0.022 seconds

Using CAD-Converted Bitmap Images for Inkjet Printing (캐드로부터 변환된 비트맵 이미지를 사용한 잉크젯 프린팅)

  • Kim, Hyung Seok;Kwon, Kye-Si
    • 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.

A Common Bitmap Block Truncation Coding for Color Images Based on Binary Ant Colony Optimization

  • Li, Zhihong;Jin, Qiang;Chang, Chin-Chen;Liu, Li;Wang, Anhong
    • 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.

CONVERTING BITMAP IMAGES INTO SCALABLE VECTOR GRAPHICS

  • Zhou, Hailing;Zheng, Jianmin;Seah, Hock Soon
    • 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.

  • PDF

High Quality perceptual Steganographic Techiques (지각적으로 고화질을 보장하는 심층암층기술)

  • 장기식;정창호;이상진;양일우
    • 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.

  • PDF

Forensics Aided Steganalysis of Heterogeneous Bitmap Images with Different Compression History

  • Hou, Xiaodan;Zhang, Tao;Xiong, Gang;Wan, Baoji
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.8
    • /
    • pp.1926-1945
    • /
    • 2012
  • In this paper, two practical forensics aided steganalyzers (FA-steganalyzer) for heterogeneous bitmap images are constructed, which can properly handle steganalysis problems for mixed image sources consisting of raw uncompressed images and JPEG decompressed images with different quality factors. The first FA-steganalyzer consists of a JPEG decompressed image identifier followed by two corresponding steganalyzers, one of which is used to deal with uncompressed images and the other is used for mixed JPEG decompressed images with different quality factors. In the second FA-steganalyzer scheme, we further estimate the quality factors for JPEG decompressed images, and then steganalyzers trained on the corresponding quality factors are used. Extensive experimental results show that the proposed two FA-steganalyzers outperform the existing steganalyzer that is trained on a mixed dataset. Additionally, in our proposed FA-steganalyzer scheme, we can select the steganalysis methods specially designed for raw uncompressed images and JPEG decompressed images respectively, which can achieve much more reliable detection accuracy than adopting the identical steganalysis method regardless of the type of cover source.

Ghost-free High Dynamic Range Imaging Based on Brightness Bitmap and Hue-angle Constancy (밝기 비트맵과 색도 일관성을 이용한 무 잔상 High Dynamic Range 영상 생성)

  • Yuan, Xi;Ha, Ho-Gun;Lee, Cheol-Hee;Ha, Yeong-Ho
    • 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.

A Study on the Elementary Computer Science Teaching and Learning the Principle of Saving Bitmap Images by Considering Characteristics of Elementary School (초등학생의 특성을 고려한 비트맵이미지 저장원리 수업을 통한 초등정보과학의 교수학습에 관한 연구)

  • Lee, Mi-Young;Gu, Jung-Mo;Han, Byoung-Rae
    • Journal of The Korean Association of Information Education
    • /
    • v.12 no.4
    • /
    • pp.405-415
    • /
    • 2008
  • In the existing curriculum of the Elementary Computer Education, it is hard to improve the CPS(Creative Problem Solving) skill and logical thought since the 7th national curriculum emphasizes application programs and CAI softwares. To complement this drawback, it is required to teach the principal of the computer science but there is not many researches for what problems of teaching computer science exist and what the response of students are. Thus, we carried out a research to know whether the students of elementary school can understand principal of computer science in the field of subject matter education. We found that the students can learn the principle of Saving Bitmap Image if the class level is adjusted properly.

  • PDF

Development of Inkjet Printing System for Printed Electronics (전자 인쇄를 위한 잉크젯 프린팅 시스템 개발)

  • Kwon, Kye-Si;Go, Jung-Kook;Kim, Jin-Won
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.34 no.10
    • /
    • pp.1537-1541
    • /
    • 2010
  • An inkjet printing system for printed electronics was developed. In this study, a printing algorithm was mainly discussed. In order to print a pattern image at a target location, we developed a hardware and software algorithm for determining the distances between a substrate camera and the selected nozzles. We implemented a vector-printing algorithm where AutoCAD dxf file was used for XY motion control and for printing. We also developed printing method using bitmap images. The technical issues in using CAD drawings and bitmap images were discussed.

Data Hiding Based on EMD for Ordered Block Truncation Coding (ODBTC를 위한 EMD 기법에 기반한 데이터 은닉)

  • Kim, Cheon-Shik;Jo, Min-Ho;Hong, You-Sik;Park, Hyun-Sook
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.6
    • /
    • pp.27-34
    • /
    • 2009
  • Block truncation coding (BTC) is a simple and efficient image compression technique. However, it yields images of unacceptable quality and significant blocking effects are seen when the block size is increasing. Ordered dither block truncation coding (ODBTC) was proposed to solve above problem maintaining the same compression capability. In this paper, we propose a data hiding method which can be applied to halftone images. EMD was developed by Zhang and Wang [6] for data hiding in the grayscale image. Therefore, EMD is not proper for bitmap images. In this paper, we show that EMD can be used to apply bitmap halftone image. In our experiments, we prove that our method is efficient in a halftone image.

A study for efficient image use in the mobile contents development (모바일 컨텐츠 제작을 위한 효율적인 이미지 활용에 대한 연구)

  • Kim, Jeong-Hoon
    • Journal of Korea Game Society
    • /
    • v.5 no.1
    • /
    • pp.53-60
    • /
    • 2005
  • To produce deep, entertaining mobile content, a large number of images must be included. But because of the limits on runtime memory for mobile phones, images cannot be used as easily in a mobile environment as they are in a computer. Therefore in this paper, I propose several different methods for efficiently using images in a mobile environment. The various methods I propose for using images are: Creating images using compression/decompression and rotation/symmetry Creating images of several different colors by changing the palette index of a bitmap Creating images through image combination Creating background images by using tile maps Creating new images through effects.

  • PDF