• Journal of Korea Society of Industrial Information Systems
• /
• v.13 no.3
• /
• pp.110-116
• /
• 2008

In this paper, we proposed an improvement technique of image encryption using binary phase computer generated hologram(BPCGH) and multi exclusive-OR(XOR) operations. For the encryption process, a BPCGH that reconstructs the original image is designed, using an iterative algorithm, and the resulting hologram is regarded as the image to be encrypted. The BPCGH is encrypted through the exclusive-OR operation with the random generated phase key image. Then the encrypted image is divided into several slide images using XOR operations. So, the performance of encryption for the image is improved. For the decryption process, we cascade the encrypted slide images and phase key image and interfere with reference wave. Then decrypted hologram image is transformed into phase information. Finally, the original image is recovered by an inverse Fourier transformation of the phase information. If the slide images are changed, we can get various decrypted BPCGH images. In the proposed security system, without a random generated key image, the original image can not be recovered. And we recover another hologram pattern according to the slide images, so it can be used in the differentiated authorization system.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.636-639
• /
• 1988

This paper suggests the operation performing the noise elimination of binary image. The image is read by the scanner. And operand is selected according to the size of input image. Through the Dilation and Erosion, elementary vector operation with selected operand, the noise of input image is eliminated.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.6
• /
• pp.567-572
• /
• 2019

In this paper, we propose an algorithm to perform convolution, pooling, and ReLU operations in CNN using binary image and binary kernel. It decomposes 256 gray-scale images into 8 bit planes and uses a binary kernel consisting of -1 and 1. The convolution operation of binary image and binary kernel is performed by addition and subtraction. Logically, it is a binary operation algorithm using the XNOR and comparator. ReLU and pooling operations are performed by using XNOR and OR logic operations, respectively. Through the experiments to verify the usefulness of the proposed algorithm, We confirm that the CNN operation can be performed by converting it to binary logic operation. It is an algorithm that can implement deep running even in a system with weak computing power. It can be applied to a variety of embedded systems such as smart phones, intelligent CCTV, IoT system, and autonomous car.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4C
• /
• pp.363-370
• /
• 2009

Image interpolation addresses the problem of generating a high-resolution image from its low-resolution version. Classical linear interpolation algorithms are simple and popular, but they produce interpolated image with blurred edges and annoying artifacts, Thus, many edge-based interpolation algorithms have been proposed to improve the subjective quality of the interpolated image, especially around edges on the image. In this paper, we propose a new interpolation algorithm which uses edges extracted from binary image. The proposed algorithm is applied to the image after interpolating using 6-Tap FIR filter. The values of interpolation pixels on edges extracted from binary image are modified using neighborhood pixels on the same edge. Experimental results for various images show that the proposed method provides better performance than existing methods.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.25-28
• /
• 2001

A theory of binary wavelets has been recently proposed by using two-band perfect reconstruction filter banks over binary field . Binary wavelet transform (BWT) of binary images can be used as an alternative to the real-valued wavelet transform of binary images in image processing applications such as compression, edge detection, and recognition. The BWT, however, requires large amount of computations since its operation is accomplished by matrix multiplication. In this paper, a fast BWT algorithm which utilizes filtering operation instead or matrix multiplication is presented . It is shown that the proposed algorithm can significantly reduce the computational complexity of the BWT. For the decomposition and reconstruction or an N ${\times}$ N image, the proposed algorithm requires only 2LN$^2$ multiplications and 2(L-1)N$^2$addtions when the filter length is L, while the BWT needs 2N$^3$multiplications and 2N(N-1)$^2$additions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.3
• /
• pp.576-586
• /
• 1996

Original binary image can be reconstructed by morphological bymorphological skeleton(MS) image. And then, the information of MS image points can be applied to a pattern recognition andimage communication. But if we apply MS to a pattern recognition and image communication, there are two problems. That is to say, binary MS processing times is long and skeleton points of MS are high redundancy. And then, to solve these problems, this paper proposes DGMS. After simulating by the proposed method to $256{\times}256$ binary image which is GIRL, we reduce processing time and skeleton points about 1.5~6.5% comparing with the result of GMS method.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.2027-2040
• /
• 1998

In this paper, we present efficient reconfigurable mesh algorithms for transforming between a binary image and its corresponding boundary code. These algorithms use $n\timesn\timesn$ processors when the size of the binary image is $n\timesn$. Recent published results show that these transformations can be done in O(1) time using $O(n^4)$ processors. The number of processors used by these algorithms is very large compared to the number of pixels in the image. Here, we present fast transformation algorithms which use $n^3 processors only. the transformation from a houndary code to a binary image takes O(1) time, and the converse transformation takes O(log n) time.

• Proceedings of the IEEK Conference
• /
• 2002.06b
• /
• pp.83-86
• /
• 2002

We suggest binary image decryption system using two-wavc mixing in Photorefractive crystal. Compared with a conventional method, this method can make optical alignment easily, and brighten the encrypted image even if a small input signal, by index grating of photorefractive crystal. Also it can reconstruct the encrypted image by only reference beam in real time.

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.207-210
• /
• 2002

We suggest binary image decryption system using two-wave mixing in photorefractive crystal. Compared with a conventional method, this method can make optical alignment easily, and brighten the encrypted image even if a small input signal, by index grating of photorefractive crystal. Also it can reconstruct the encrypted image by only reference beam in real time.

• 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.