• Korean Journal of Optics and Photonics
• /
• v.17 no.5
• /
• pp.401-411
• /
• 2006

We propose an optical encryption/decryption technique for a security system based on 2-step phase-shifting digital holography. Phase-shilling digital holography is used for recording phase and amplitude information on a CCD device. 2-step phase-shifting is implemented by moving the PZT mirror with phase step of 0 or ${\pi}/2$. The binary data and the key are expressed with random code and random phase patterns. The digital hologram is a Fourier transform hologram and is recorded on CCD with 256 gray level quantization. We remove the DC term of the digital hologram fur data reconstruction, which is essential to reconstruct the original binary input data/image. The error evaluation fer the decrypted binary data is analyzed. One of errors is a quantization error in detecting the hologram intensity on CCD, and the other is generated from decrypting the data with the incorrect key. The technique using 2-step phase-shifting holography is more efficient than a 4-step method because 2-step phase-shifting holography system uses less data than the 4-step method for data storage or transmission. The simulation shows that the proposed technique gives good results fur the optical encryption of binary information.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.1
• /
• pp.1-9
• /
• 2013

This paper propose a human action recognition method that uses bag-of-features (BoF) based on CS-LBP (center-symmetric local binary pattern) and a spatial pyramid in addition to the random forest classifier. To construct the BoF, an image divided into dense regular grids and extract from each patch. A code word which is a visual vocabulary, is formed by k-means clustering of a random subset of patches. For enhanced action discrimination, local BoF histogram from three subdivided levels of a spatial pyramid is estimated, and a weighted BoF histogram is generated by concatenating the local histograms. For action classification, a random forest, which is an ensemble of decision trees, is built to model the distribution of each action class. The random forest combined with the weighted BoF histogram is successfully applied to Standford Action 40 including various human action images, and its classification performance is better than that of other methods. Furthermore, the proposed method allows action recognition to be performed in near real-time.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2411-2414
• /
• 2003

In this paper, we present a digital image authentication using semi-fragile watermarking techniques. The algorithm is robust to innocuous manipulations while detecting malicious manipulations. Specifically, the proposed method is designed for the purpose of the real time authentication of an image frame captured from a digital camera due to its easy H/W implementation, security and visible verification. To achieve the semi-fragile characteristics that survive a certain amount of compression, we employ the invariant property of DCT coefficients' quantization proposed by Lin and Chang [1]. The binary watermark bits are generated by exclusive ORing the binary logo with pseudo random binary sequences. Then watermark bits are embedded into the LSBs of pre-quantized DCT coefficients in the medium frequency range. Verification is carried out easily due to visually recognizable pattern of the logo extracted by exclusive ORing the LSBs of the embedded DCT coefficient with pseudo random number seeded by a secret key. By the experiment results, this method is not only robust to JPEG compression but also it detects powerfully alterations of the original image, such as the tempering of images.

• The Korean Journal of Applied Statistics
• /
• v.27 no.1
• /
• pp.115-122
• /
• 2014

A test for randomness of the binary random sequence is proposed in this paper. The proposed test statistic is based on the mean length of runs distributed with truncated geometric distribution and asymptotically ${\chi}^2_2$-distributed when the size of the sequences is large. A small Monte Carlo simulation compared the size of the test with a significant level as well as evaluated the test power. We applied the proposed method to the sequence of yes or no numbers in Lotto 6/45 and concluded that the randomness of Lotto is retained.

• ETRI Journal
• /
• v.30 no.4
• /
• pp.495-505
• /
• 2008

This paper presents a parallel processing searcher structure for the initial synchronization of a direct sequence ultra-wideband (DS-UWB) system, which is suitable for the digital implementation of baseband functionalities with a 1.32 Gsample/s chip rate analog-to-digital converter. An initial timing acquisition algorithm and a data demodulation method are also studied. The proposed searcher effectively acquires initial symbol and frame timing during the preamble transmission period. A hardware efficient receiver structure using 24 parallel digital correlators for binary phase-shift keying DS-UWB transmission is presented. The proposed correlator structure operating at 55 MHz is shared for correlation operations in a searcher, a channel estimator, and the demodulator of a RAKE receiver. We also present a pseudo-random noise sequence generated with a primitive polynomial, $1+x^2+x^5$, for packet detection, automatic gain control, and initial timing acquisition. Simulation results show that the performance of the proposed parallel processing searcher employing the presented pseudo-random noise sequence outperforms that employing a preamble sequence in the IEEE 802.15.3a DS-UWB proposal.

• Journal of the Optical Society of Korea
• /
• v.9 no.3
• /
• pp.103-106
• /
• 2005

Recently, polymethyl methacrylate based plastic optical fibers (POFs) have attracted considerable attention as a potential medium for local area network (LAN) and home network applications. Since the POFs have very low optical loss at around 650mm, in particular, it becomes quite important to develop GHz transmitters operating at this wavelength for high bit rate optical transmission applications of the POFs. In this paper, we present generation of ${\geq}1.5 Gbps$ pseudo-random binary sequence optical signals by using a gain switched InGaA1P Fabry-Perot semiconductor laser with a high frequency filter, operating at 650mm, and the application of these signals to bandwidth measurement of POFs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2A
• /
• pp.164-169
• /
• 2009

This paper presents a fast and accurate ranging algorithm for the WiBro system. The proposed algorithm detects a received ranging code and estimates its propagation delay using the correlation characteristics of the PRBS (Pseudo Random Binary Sequence) and the circular shift property of the discrete Fourier transform operator. The proposed ranging algorithm was applied to array antenna systems to show how it could improve the ranging performance of an array antenna system compared to a conventional base station system, which uses only a single antenna.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.1358-1360
• /
• 2015

본 논문에서는 MB-LBP(Multi-scale Block Local Binary Patterns)와 공간피라미드를 이용하여 생성된 특징을 랜덤 포레스트(Random Forest) 분류기에 적용하여 영상내의 표지판 속도를 인식하는 알고리즘을 제안한다. 입력 영상에서 표지판 영역은 다양한 위치와 크기를 가지며 주위 배경이 후보 영역에 포함되므로 먼저 입력 영상에 원형 Hough Transform을 적용하여 원형의 표지판 후보 영역만을 검출한다. 그 후 영상의 화질을 향상시키기 위해 히스토그램 평활화와 모폴로지 연산을 적용하여 표지판의 숫자 영역과 배경 영역의 대비를 높이도록 한다. 표지판의 크기 변화에 강건한 시스템의 구현을 위해 후보 영역에서 LBP(Local Binary Patterns)보다 우수한 성능을 보이는 MB-LBP를 적용하고, 다양한 크기의 속도 표지판을 인식하기 위해 공간 피라미드를 사용하여 지역적 특징과 전역적 특징 모두를 추출하였다. 추출된 특징은 랜덤 포레스트(Random Forest)를 이용하여 각 9개의 속도 표지판으로 분류, 각 속도별 클래스에 대한 인식 성능을 측정하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1240-1243
• /
• 2003

In this paper, an encryption method to share a secret binary image is proposed. It divides the image to be encrypted into an arbitrary number of images and encrypts them using XOR process with different binary random images which was prepared by the means of the XOR process, too. Each encrypted slice image can be distributed to the authenticated ones. However, we transfer the encrypted images to the binary phase masks to strengthen the security power, that means phase masks can not be copied with general light-intensity sensitive tools such as CCDs or cameras. For decryption, we used the Mach-Zehnder interferometer in which linearly polarized two light beams in orthogonal direction, respectively. The experimental result proved the efficiency of the proposed method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2497-2517
• /
• 2020

For compressed sensing (CS) applications, it is significant to construct deterministic measurement matrices with good practical features, including good sensing performance, low memory cost, low computational complexity and easy hardware implementation. In this paper, a deterministic construction method of bipolar measurement matrices is presented based on binary sequence family (BSF). This method is of interest to be applied for sparse signal restore and image block CS. Coherence is an important tool to describe and compare the performance of various sensing matrices. Lower coherence implies higher reconstruction accuracy. The coherence of proposed measurement matrices is analyzed and derived to be smaller than the corresponding Gaussian and Bernoulli random matrices. Simulation experiments show that the proposed matrices outperform the corresponding Gaussian, Bernoulli, binary and chaotic bipolar matrices in reconstruction accuracy. Meanwhile, the proposed matrices can reduce the reconstruction time compared with their Gaussian counterpart. Moreover, the proposed matrices are very efficient for sensing performance, memory, complexity and hardware realization, which is beneficial to practical CS.