• Title/Summary/Keyword: Grayscale image

Search Result 120, Processing Time 0.033 seconds

A Joint Transform Correlator Encryption System Based on Binary Encoding for Grayscale Images

  • Peng, Kaifei;Shen, Xueju;Huang, Fuyu;He, Xuan
    • Current Optics and Photonics
    • /
    • v.3 no.6
    • /
    • pp.548-554
    • /
    • 2019
  • A binary encoding method for grayscale images is proposed to address their unsatisfactory decryption results from joint transform correlator (JTC) encryption systems. The method converts the encryption and decryption of grayscale images into that of binary images, and effectively improves decrypted-image quality. In the simulation, we replaced unencoded grayscale images with their binary encoded counterparts in the JTC encryption and decryption processes, then adopted a median filter to suppress saturation noise while keeping other settings unchanged. Accordingly, decrypted-image quality was clearly enhanced as the correlation coefficient (CC) between a decrypted image and its original rose from 0.8237 to 0.9473 initially, and then further to 0.9937, following the above two steps respectively. Finally, optical experimental results confirmed that the proposed encryption system works correctly.

Character Segmentation in a Grayscale Image using the Standard Deviation (그레이스케일 영상에서 표준 편차를 이용한 문자 분할)

  • Jung, Min Chul
    • Journal of the Semiconductor & Display Technology
    • /
    • v.11 no.2
    • /
    • pp.27-31
    • /
    • 2012
  • This paper proposes a new method of character segmentation in a grayscale image using the standard deviation. Firstly, the proposed method scans vertically the region of interest in an image in order to calculate a standard deviation for each scan line. Characters' standard deviations are much bigger than the background's. Therefore, it is possible to segment characters vertically using the differentiation of those two types of standard deviations. Secondly, the method scans each vertically segmented image horizontally at this time, and then segments each image similarly. The proposed method is implemented using C language in an embedded Linux system for a high-speed real-time image processing. Experiments were conducted by using credit card images. The results show that the proposed algorithm is quite successful for most credit cards. However, the method fails in some credit cards with strong background patterns.

GRAYSCALE IMAGE COLORIZATION USING A CONVOLUTIONAL NEURAL NETWORK

  • JWA, MINJE;KANG, MYUNGJOO
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.25 no.2
    • /
    • pp.26-38
    • /
    • 2021
  • Image coloration refers to adding plausible colors to a grayscale image or video. Image coloration has been used in many modern fields, including restoring old photographs, as well as reducing the time spent painting cartoons. In this paper, a method is proposed for colorizing grayscale images using a convolutional neural network. We propose an encoder-decoder model, adapting FusionNet to our purpose. A proper loss function is defined instead of the MSE loss function to suit the purpose of coloring. The proposed model was verified using the ImageNet dataset. We quantitatively compared several colorization models with ours, using the peak signal-to-noise ratio (PSNR) metric. In addition, to qualitatively evaluate the results, our model was applied to images in the test dataset and compared to images applied to various other models. Finally, we applied our model to a selection of old black and white photographs.

Pseudo 480-Hz Driving Method for Digital Mode Grayscale Displays

  • Ryeom, Jeongduk
    • Journal of Electrical Engineering and Technology
    • /
    • v.8 no.6
    • /
    • pp.1462-1467
    • /
    • 2013
  • A pseudo 480-Hz drive method has been proposed to reduce the dynamic false contour noise that occurs on flat panel displays with displaying grayscale image in the digital mode, such as plasma display panels. The proposed method makes the image movements nearly continuous by rearranging the 8-bit image data displayed for 1 TV field into 8 subfields. The position of the image data rearranged in subfields has been optimized on the basis of the speed of the moving image by computer simulations for the dynamic false contour noise. It is verified that a significant reduction in the dynamic false contour noise is achieved with the proposed method as compared to the conventional noise reduction technologies. Moreover, to reduce the noise in digital mode displays, the proposed technology requires only 8 subfields. Therefore, there is no reduction in the brightness of the image.

IMPROVEMENT OF COLOR HALFTONING USING ERROR DIFFUSION METHOD

  • Takahashi, Yoshiaki;Tanaka, Ken-Ichi
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.516-519
    • /
    • 2009
  • In the printer and the facsimile communication, digital halftoning is extremely important technologies. Error diffusion method is applied easy for color image halftoning. But the problem in error diffusion method is that a quite unrelated color has been generated though it is necessary to express the area of the grayscale in the black and white when the image that there is an area of the grayscale on a part of the color image is processed. The halftoning was assumed to be a combinational optimization problem to solve this problem, and the method of using SA (Simulated Annealing) was proposed. However, new problem existed because the processing time was a great amount compared with error diffusion method. Then, we propose the new error diffusion method.

  • PDF

Character Matching Using a Hausdorff Distance (Hausdorff 거리를 이용한 문자 매칭)

  • Kim, Kyeongtaek;Kyung, Ji Hun
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.38 no.2
    • /
    • pp.56-62
    • /
    • 2015
  • The Hausdorff distance is commonly used as a similarity measure between two-dimensional binary images. Since the document images may be contaminated by a variety of noise sources during transmission, scanning or conversion to digital form, the measure should be robust to the noise. Original Hausdorff distance has been known to be sensitive to outliers. Transforming the given image to grayscale image is one of methods to deal with the noises. In this paper, we propose a Hausdorff distance applied to grayscale images. The proposed method is tested with synthetic images with various levels of noises and compared with other methods to show its robustness.

Colorization-based Coding By Using Watershed Segmentation For Optimization

  • Wang, Ping;Lee, Byung-Gook
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2012.05a
    • /
    • pp.40-42
    • /
    • 2012
  • Colorization is a method using computer to add color to a black and white image automatically. The input is a grayscale image and some representative pixels (RPs). The RPs contain the color information for the image, and it indicates each region's color information. Colorization-based coding is a novel way for lossy image compression, it decodes a color image to get grayscale image and extracts RPs from the image. Because RPs decides the region's color and we also want small data size for image compression, form this viewpoint the paper proposes a way to get better and fewer RPs based on watershed segmentation. According to the segmentation result we also improve the original chrominance blending colorization method to save decode time and get better reconstruct image.

  • PDF

A New Morphological Algorithm for Reconstruction of a Binary Image from its Grayscale Skeleton (그레이 스케일 골격선 영상으로부터 새로운 형태론적 이진영상의 복원)

  • 김주경;김한균;정기현;나상신;최태영
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.2
    • /
    • pp.111-117
    • /
    • 1996
  • In tis paper, a new morphological algorihtm for binary image reconstruction from graayscale skeleton is proposed. In the proposed algorithm, grayscale morphological dilation is utilizedm instead of binary morphological operatons for the conventional methods. The algorithm is proven mathematically and verified by computer simulation results.

  • PDF

A Cross-Platform Malware Variant Classification based on Image Representation

  • Naeem, Hamad;Guo, Bing;Ullah, Farhan;Naeem, Muhammad Rashid
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.7
    • /
    • pp.3756-3777
    • /
    • 2019
  • Recent internet development is helping malware researchers to generate malicious code variants through automated tools. Due to this reason, the number of malicious variants is increasing day by day. Consequently, the performance improvement in malware analysis is the critical requirement to stop the rapid expansion of malware. The existing research proved that the similarities among malware variants could be used for detection and family classification. In this paper, a Cross-Platform Malware Variant Classification System (CP-MVCS) proposed that converted malware binary into a grayscale image. Further, malicious features extracted from the grayscale image through Combined SIFT-GIST Malware (CSGM) description. Later, these features used to identify the relevant family of malware variant. CP-MVCS reduced computational time and improved classification accuracy by using CSGM feature description along machine learning classification. The experiment performed on four publically available datasets of Windows OS and Android OS. The experimental results showed that the computation time and malware classification accuracy of CP-MVCS was higher than traditional methods. The evaluation also showed that CP-MVCS was not only differentiated families of malware variants but also identified both malware and benign samples in mix fashion efficiently.

An Efficient Bit-Level Lossless Grayscale Image Compression Based on Adaptive Source Mapping

  • Al-Dmour, Ayman;Abuhelaleh, Mohammed;Musa, Ahmed;Al-Shalabi, Hasan
    • Journal of Information Processing Systems
    • /
    • v.12 no.2
    • /
    • pp.322-331
    • /
    • 2016
  • Image compression is an essential technique for saving time and storage space for the gigantic amount of data generated by images. This paper introduces an adaptive source-mapping scheme that greatly improves bit-level lossless grayscale image compression. In the proposed mapping scheme, the frequency of occurrence of each symbol in the original image is computed. According to their corresponding frequencies, these symbols are sorted in descending order. Based on this order, each symbol is replaced by an 8-bit weighted fixed-length code. This replacement will generate an equivalent binary source with an increased length of successive identical symbols (0s or 1s). Different experiments using Lempel-Ziv lossless image compression algorithms have been conducted on the generated binary source. Results show that the newly proposed mapping scheme achieves some dramatic improvements in regards to compression ratios.