• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.6
• /
• pp.1010-1015
• /
• 2008

The choice of RFID system is recently progressing(being) rapidly at various field. For the sake of RFID system popularization, However, We should solve privacy invasion to gain the pirated information of RFID tag. There is the safest M Ohkubos's skill among preexistent studying to solve these problems. But, this skill has a problem that demands a immense calculation capability caused an increase in tag number when we discriminate tags. So, This paper proposes the way of transplant to Grid environment for keeping Privacy Protection up and reducing the Tag Identification Time. And, We propose the Tag Identification Process Model to apply Even Division Algorithm to separate SP with same site in each node. If the proposed model works in Grid environment at once, it would reduce the time to identify tags to 1/k.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.11
• /
• pp.1507-1518
• /
• 2020

High-quality images have a lot of information, so sensitive data is stored by encryption for private company, military etc. Encrypted images can only be decrypted with a secret key, but the original data cannot be retained when attacked by the Shear attack and Noise pollution attack techniques that overwrite some pixel data with arbitrary values. Important data is the more necessary a countermeasure for the recovery method against attack. In this paper, we propose a random number generator PingPong256 and a shuffling method that rearranges pixels to resist Shear attack and Noise pollution attack techniques so that image and video encryption can be performed more quickly. Next, the proposed PingPong256 was examined with SP800-22, tested for immunity to various noises, and verified whether the image to which the shuffling method was applied satisfies the Anti-shear attack and the Anti-noise pollution attack.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.82-90
• /
• 2010

In this paper, A new stereo matching method based on reliability space is proposed to acquire 3D information from 2D image. In conventional stereo matching methods, speed is sacrificed to achieve high accuracy. To increase the matching speed while maintaining a high accuracy, this paper proposes this stereo matching method. It first makes the disparity space image for comparing all of the pixels on the stereo images. Then it produce reliability space through analyzing this value. and, By comparing the reliability space according to disparity, it makes disparity map. Moreover, the parts that make regional boundary errors are corrected by classifying the boundary of each region with the reference to color edge. The performance of the proposed stereo matching method is verified by various experiments. As a result, calculation cost is reduced by 30.6%, while the image quality of proposed method has similar performance with the existing method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.5
• /
• pp.102-108
• /
• 2011

Support vector machines are well known for their outstanding performance in pattern recognition fields. One example of their applications is music/speech classification for a standardized codec such as 3GPP2 selectable mode vocoder. In this paper, we propose a novel scheme that improves the speech/music classification of support vector machines based on the second-order conditional maximum a priori. While conventional support vector machine optimization techniques apply during training phase, the proposed technique can be adopted in classification phase. In this regard, the proposed approach can be developed and employed in parallel with conventional optimizations, resulting in synergistic boost in classification performance. According to experimental results, the proposed algorithm shows its compatibility and potential for improving the performance of support vector machines.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.114-123
• /
• 2003

The current paper proposes a new vertex selection scheme for polygon-based contour coding. To efficiently characterize the shape of an object, we incorporate the curvature information in addition to the conventional maximum distance criterion in vertex selection process. The proposed method consists of "two-step procedure." At first, contour pixels of high curvature value are selected as key vortices based on the curvature scale space (CSS), thereby dividing an overall contour into several contour-segments. Each segment is considered as an open contour whose end points are two consecutive key vortices and is processed independently. In the second step, vertices for each contour segment are selected using progressive vertex selection (PVS) method in order to obtain minimum number of vertices under the given maximum distance criterion ( $D_{max}$$^{*}$). Furthermore, the obtained vortices are adjusted using the dynamic programming (DP) technique to optimal positions in the error area sense. Experimental results are presented to compare the approximation performances of the proposed and conventional methods.imation performances of the proposed and conventional methods.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.2
• /
• pp.32-40
• /
• 2011

Reversible data hiding, which can recover the original image without any distortion after the extraction of the hidden data, has drawn considerable attention in recent years. However, underflow and overflow problems have occurred occasionally in the embedded image. To overcome these problems, we propose a new reversible data hiding algorithm which embeds a compressed location map used to identify these underflow and overflow points. In addition, the proposed algorithm allows for multilevel data hiding to increase the hiding capacity. The simulation results demonstrate that the proposed algorithm generates good performances in the PSNR, the embedding capacity, and the size of side information.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.4
• /
• pp.59-66
• /
• 2011

In this paper, we propose a face detection method based on color constancy and geometrical analysis. With the problem about the various colors of skin under scene illuminant, a color constancy method is applied to input images and geometrical analysis is used to detect face regions. At first, the candidates of face or hair are extracted from the image that a color constancy method is applied to, and are classified by some geometrical criterions. And then, face candidates which have some intersectional regions whose total is over a certain size, with hair candidates are selected as faces. Caltech Face DB was used to compare the performance of our method. Also, performance about scene illuminant was evaluated by images which have some illumination effects. The experiment results show that the proposed face detection method was applicable to various facial images because of high true-positive and low false-negative ration.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.4
• /
• pp.85-94
• /
• 2012

Lane marking detection is essential to both ITS and DAS systems. The objective of this paper is to provide more robust technique for lane marking detection than traditional techniques by using scale-space technique. Variable thresholding that is based on the local statistics may be very effective for detecting such objects as lane markings that have prominent intensities. However, such techniques that only rely on local statistics have limitations containing irrelevant areas as well. We reduce the candidate areas by combining the variable thresholding result with cost-efficient horizontal 1D LoG filtered scale space. Through experiments using practical images, we could achieve significant improvement over the techniques based not only on the variable thresholding but also on the Hough transform that is another very popular technique for this purpose.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.1
• /
• pp.175-182
• /
• 2010

In this paper, we propose a robust speech reinforcement technique to enhance the intelligibility of the degraded speech signal under the ambient noise environments based on soft decision scheme incorporating a speech absence probability (SAP) with speech reinforcement gains. Since the ambient noise significantly decreases the intelligibility of the speech signal, the speech reinforcement approach to amplify the estimated clean speech signal from the background noise environments for improving the intelligibility and clarity of the corrupted speech signal was proposed. In order to estimate the robust reinforcement gain rather than the conventional speech reinforcement method between speech active periods and nonspeech periods or transient intervals, we propose the speech reinforcement algorithm based on soft decision applying the SAP to the estimation of speech reinforcement gains. The performances of the proposed algorithm are evaluated by the Comparison Category Rating (CCR) of the measurement for subjective determination of transmission quality in ITU-T P.800 under various ambient noise environments and show better performances compared with the conventional method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.4
• /
• pp.59-70
• /
• 2008

In this paper, we proposed image processing technique for automatic real-time fire and smoke detection in tunnel environment. To avoid the large scale of damage of fire occurred in variety environments, it is purposeful to propose many studies to minimize and to discover the incident as fast as possible. But we need new specific algorithm because tunnel environment is quite different and it is difficult to apply previous fire detection algorithm to tunnel environment. Therefore, in this paper, we proposed specific algorithm which can be applied in tunnel environment. To minimize false detection in tunnel we used color and motion information. And it is possible to detect exact position in early stage with detection, test, verification procedures. In addition, by comparing properties of each algorithm throughout experiment, we have proved the validity and efficiency of proposed algorithm.