• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.69-72
• /
• 2012

In the bandpass sampling(BPS), the sampling frequency is lower than the frequency of the RF(radio frequency) signal being sampled. In this method, the baseband spectrum directly appears by the sampling itself, so that it is not necessary to use any down converter, making the receiver's hardware simpler. The second-order BPS uses two identical BPS samplers operating with an offset timing to each other. By a processing with their two sampled signals, it can be possible to cancel the aliasing or interference component if any due to the bandpass sampling. The interpolant filter, which is to manipulate the phase characteristics of the sampled signal, affects the performance of the cancellation. In this paper, a multiband interpolant filter is introduced, with which multiple interference signals from multiple RF bands can be cancelled simultaneously. We suggest several phase characteristics for the interpolant filter and have evaluated their performances through computer simulations. It has been shown that the filter with a continuous phase function gives the better performance.

• Journal of KIISE:Software and Applications
• /
• v.28 no.11
• /
• pp.864-873
• /
• 2001

In this paper, a new approach to building a registration authority for issuing PKI-based certificates is presented to make the process of identifying an individual more secure and reliable by utilizing human iris recognition technology. The tasks of the proposed system associated with the manipulation of irises except for the general functions of registration authorities can be categorized into three modules, the acquisition of iris images, the registration of iris information, and the verification of users by means of iris patterns. The information among the three modules is safely exchanged through encryption and decryption with a symmetric cryptographic method. As a feature extraction method for a given iris image, a wavelet transform is applied to represent a feature vector with a small dimension of information obtained by subsampling an image corresponding to lower frequency bands successively without loss of information. Through the experiments on human iris recognition technology we proposed and applied to the registration authority, the potential of biometric technology in various applications is confirmed.

• Journal of Broadcast Engineering
• /
• v.15 no.4
• /
• pp.591-599
• /
• 2010

In this paper, we propose a disparity-adaptive filtering method to reduce view-aliasing and inter-perspective aliasing on auto-multiscopic 3D display. View aliasing by the subsampled multi-view images could happen if the resolution of an auto-multiscopic monitor is lower than that of the original multi-view images. Furthermore, multi-view images on auto-multiscopic monitor usually cause eye strain and fatigue because of inter-perspective aliasing by discontinuity that exists between viewpoints. The greater disparity value becomes, the stronger these types of aliasing could be. Thus, we design a lowpass filter whose cut-off frequency is determined adaptively to the number of intermediate reconstructed views and their disparity's strength. Though experimental results, we show that the proposed filtering algorithm could reduce the aliasing effect very efficiently by using DSCQS (double stimulus continuous quality scale method).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8B
• /
• pp.1506-1517
• /
• 1999

In this paper, we propose two fast block matching algorithm using the distribution of mean absolute difference (MAD) at the search region overlapped with neighbor blocks and pixel subsapmling. The proposed methods use the lower and upper bound of MAD at the overlapped search region which is calculated from the MAD of neighbor block at that search position and MAD between the current block and neighbor block. In the first algorithm, we can reduce the computational complexity by executing the block matching operation at the only necessary search points. That points are selected using the lower bound of MAD. In the second algorithm, we use the statictical distribution of actual MAD which exists between the lower bound and upper bound of MAD. By using the statistical distribution of actual MAD, we can significantly reduce the computational complexity for motion estimation. after striking space key 2 times.

• The KIPS Transactions:PartB
• /
• v.12B no.4 s.100
• /
• pp.379-386
• /
• 2005

This paper provides a rigorous theory for analysis of quantization effects and optimum filter bank design in quantized multidimensional subband filter banks. Even though subband filter design has been a hot topic for last decades, a few results have been reported on the subband filter with a quantizer. Each pdf-optimized quantizer is modeled by a nonlinear gain-plus-additive uncorrelated noise and embedded into the subband structure. Using polyphase decomposition of the analysis/synthesis filter banks, we derive the exact expression for the output mean square quantization error. Based on the minimization of the output mean square error, the technique for optimal filter design methodology is developed. Numerical design examples for optimum nonseparable paraunitary and biorthogonal filter banks are presented with a quincunx subsampling lattice. Through the simulation, $10\~20\;\%$ decreases in MSE have been observed compared with subband filter with no quantizers especially for low bit rate cases.

• Journal of Broadcast Engineering
• /
• v.23 no.2
• /
• pp.302-315
• /
• 2018

Highly non-linear electro-optical transfer function of the Perceptual Quantizer was approximated by a truncated Taylor series, resulting in a closed form solution for luma adjustment. This previous solution is fast and quite suitable for the hardware implementation of luma adjustment, but the approximation error becomes relatively large in the range of 600~3,900 cd/m2 linear light. In order to reduce such approximation error, we propose a new linear model, for which a correction is performed on the position and the slope of line based on the scope of approximation. In order to verify the approximation capability of the proposed linear model, a comparative study on the luma adjustment schemes was conducted using various high dynamic range test video sequences. Via the comparative study, we identified a significant performance enhancement over the previous fast luma adjustment scheme, where a 4.65dB of adjusted luma t-PSNR gain was obtained for a test sequence having a large portion of saturated color pixels.

• The Journal of the Korea Contents Association
• /
• v.8 no.2
• /
• pp.74-82
• /
• 2008

This paper investigates chrominance reconstruction methods that reconstruct subsampled chrominance information efficiently using the correlation between luminance and chrominance components in the decompression process of compressed images, and analyzes drawbacks involved in the adaptive-weighted 2-dimensional linear interpolation among the methods, which shows higher efficiency in the view of computational complexity than other methods. To improve the drawback that the spatial frequency distribution is not considered for the decompressed image and to support the application on a low-performance system in behalf of 2-dimensional linear interpolation, this paper proposes the multi-mode reconstruction method which uses three reconstruction methods having different computational complexity from each other according to the degree of edge response of luminance component. The performance evaluation on a development platform for embedded systems showed that the proposed reconstruction method supports the similar level of image quality for decompressed images while reducing the overall computation time for chrominance reconstruction in comparison with the 2-dimensional linear interpolation.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.3
• /
• pp.132-139
• /
• 2016

In the bandpass sampling(BPS), the sampling frequency for the analog-to-digital converter is lower than that of the signal to be sampled. Since the BPS operation results in the signal spectrum to be copied on the baseband, it is possible for the frequency down-converter to be conveniently omitted. The second-order BPS system is introduced in order to cancel the aliased interference components from the BPS output that may be generated by the BPS processing. In this paper, we introduce a design method for the optimal phase of the interpolant filter in the second-order BPS system which enables to maximally cancel the aliased components. Being mathematically derived, this method can always be applied independently to the spectral characteristics of the BPS input signal. The performance improvements by the suggested method has been measured statistically with various power spectra of the received signal, and it has been shown that the maximal amount of the improvements reaches up to 5~20 [dB] in comparison with the previous suboptimal algorithm.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.11
• /
• pp.102-111
• /
• 1999

In this paper, we propose a fast full search block matching algorithm using the search region subsampling and the difference of adjacent pixels in current block. In the proposed algorithm, we calculate the lower bound of mean absolute difference (MAD) at each search point using the MAD value of neighbor search point and the difference of adjacent pixels in current block. After that, we perform block matching process only at the search points that need block matching process using the lower bound of MAD at each search point. To calculate the lower bound of MAD at each search point, we need the MAD value of neighbor search point. Therefore, the search points are subsampled at the factor of 4 and the MAD value at the subsampled search points are calculated by the block matching process. And then, the lower bound of MAD at the rest search points are calculated using the MAD value of the neighbor subsampled search point and the difference of adjacent pixels in current block. Finally, we discard the search points that have the lower bound of MAD value exceed the reference MAD which is the minimum MAD value of the MAD values at the subsampled search points and we perform the block matching process only at the search points that need block matching process. By doing so, we can reduce the computation complexity drastically while the motion compensated error performance is kept the same as that of full search block matching algorithm (FSBMA). The experimental results show that the proposed method has a much lower computational complexity than that of FSBMA while the motion compensated error performance of the proposed method is kept same as that of FSBMA.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.2
• /
• pp.149-162
• /
• 2005

This paper suggest a way to detect a specific wanted figure in public places such as subway stations and banks by comparing color face images extracted from the real time CCTV with the face images of designated specific figures. Assuming that the characteristic of the surveillance camera allows the face information in screens to change arbitrarily and to contain information on numerous faces, the accurate detection of the face area was focused. To solve this problem, the normalization work using subsampling with $20{\times}20$ pixels on arbitrary face images, which is based on the Perceptron Neural Network model suggested by R. Rosenblatt, created the effect of recogning the whole face. The optimal linear filter and the histogram shaper technique were employed to minimize the outside interference such as lightings and light. The addition operation of the egg-shaped masks was added to the pre-treatment process to minimize unnecessary work. The images finished with the pre-treatment process were divided into three reception fields and the information on the specific location of eyes, nose, and mouths was determined through the neural network. Furthermore, the precision of results was improved by constructing the three single-set network system with different initial values in a row.