Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
The Journal of Korean Institute of Communications and Information Sciences
Journal Basic Information
Journal DOI :
The Korean Institute of Communications and Information Sciences
Editor in Chief :
Kyung-Hi Chang / Song Chong / Jong-Taek Oh / Jae-Jin Lee / Myung-Sik Yoo
Volume & Issues
Volume 29, Issue 12C - Dec 2004
Volume 29, Issue 12B - Dec 2004
Volume 29, Issue 12A - Dec 2004
Volume 29, Issue 11C - Nov 2004
Volume 29, Issue 11B - Nov 2004
Volume 29, Issue 11A - Nov 2004
Volume 29, Issue 10C - Oct 2004
Volume 29, Issue 10B - Oct 2004
Volume 29, Issue 10A - Oct 2004
Volume 29, Issue 9C - Sep 2004
Volume 29, Issue 9B - Sep 2004
Volume 29, Issue 9A - Sep 2004
Volume 29, Issue 8C - Aug 2004
Volume 29, Issue 8B - Aug 2004
Volume 29, Issue 8A - Aug 2004
Volume 29, Issue 7C - Jul 2004
Volume 29, Issue 7B - Jul 2004
Volume 29, Issue 7A - Jul 2004
Volume 29, Issue 6C - Jun 2004
Volume 29, Issue 6B - Jun 2004
Volume 29, Issue 6A - Jun 2004
Volume 29, Issue 5C - May 2004
Volume 29, Issue 5B - May 2004
Volume 29, Issue 5A - May 2004
Volume 29, Issue 4C - Apr 2004
Volume 29, Issue 4B - Apr 2004
Volume 29, Issue 4A - Apr 2004
Volume 29, Issue 3C - Mar 2004
Volume 29, Issue 3B - Mar 2004
Volume 29, Issue 3A - Mar 2004
Volume 29, Issue 2C - Feb 2004
Volume 29, Issue 2B - Feb 2004
Volume 29, Issue 2A - Feb 2004
Volume 29, Issue 1C - Jan 2004
Volume 29, Issue 1B - Jan 2004
Volume 29, Issue 1A - Jan 2004
Selecting the target year
The Design of DWT Processor for RealTime Image Compression
Gu, Dae Seong ; Kim, Jong Bin ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 5C, 2004, Pages 10~654
Layered Nonlinear feed-forward Sequence Generator
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 5C, 2004, Pages 595~600
In this paper, we propose a new simple scheme of layered nonlinear feedforward logic (NLFFL) overlaid on a linear feedback shift resistor (LFSR) to generate pseudonoise sequences, which have good balance property and large linear complexity. This method guarantee noiselike statistics without any designed connection scheme e.g. Langford arrangement.
Adaptive CM Array Antenna employing RAKE Receiver in Asynchronous DS-CDMA systems
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 5C, 2004, Pages 601~610
In this paper, the performance of an adaptive array antenna using Constant Modulus Algorithm (CMA) based on the signal structure for the IMT-2000 3GPP specification reverse link of an asynchronous direct sequence code division multiple access (DS-CDMA) system are evaluated. In addition, the performance is compared with the array antenna using Least Mean Square (LMS) based on the training signal. The simulation parameters such as the number of multipath, mu10pa1h intensity profiles between path, spreading gain and multiuser etc., are considered in the Monte Carlo simulation. Simulation results demonstrate an adaptive array antenna using CMA may give more capacity gain than the amy antenna using LMS in the case of multipath fading channel.
Optimum Convolutional Error Correction Codes for FQPSK-B Signals
Park, Hyung-Chul ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 5C, 2004, Pages 611~617
The optimum convolutional error correction codes for recently standardized Feher-patented quadrature phase-shift keying (FQPSK-B) modulation are proposed. We utilize the continuous phase modulation characteristics of FQPSK-B signals for calculating the minimum Euclidean distance of convolutional coded FQPSK-B signal. It is shown that the Euclidean distance between two FQPSK-B signals is proportional to the Hamming distance between two binary data sequence. Utilizing this characteristic, we show that the convolutional codes with optimum free Hamming distance is the optimum convolutional codes for FQPSK-B signals.
Modular Neural Network Recognition System for Robot Endeffector Recognition
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 5C, 2004, Pages 618~626
In this paper, we describe a robot endeffector recognition system based on a Modular Neural Networks (MNN). The proposed recognition system can be used for vision system which track a given object using a sequence of images from a camera unit. The main objective to achieve with the designed MNN is to precisely recognize the given robot endeffector and to minimize the processing time. Since the robot endeffector can be viewed in many different shapes in 3- D space, a MNN structure, which contains a set of feedforwared neural networks, can be more attractive in recognizing the given object. Each single neural network learns the endeffector with a cluster of training patterns. The training MNN patterns for a neural network share the similar characteristics so that they can be easily trained. The trained UM is les s sensitive to noise and it shows the better performance in recognizing the endeffector. The recognition rate of MNN is enhanced by 14％ over the single neural network. A vision system with the MNN can precisely recognize the endeffector and place it at the center of a display for a remote operator.
Guassian pdfs Clustering Using a Divergence Measure-based Neural Network
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 5C, 2004, Pages 627~631
An efficient algorithm for clustering of GPDFs(Gaussian Probability Density Functions) in a speech recognition model is proposed in this paper. The proposed algorithm is based on CNN with the divergence as its distance measure and is applied to a speech recognition. The algorithm is compared with conventional Dk-means(Divergence-based k-means) algorithm in CDHMM(Continuous Density Hidden Markov Model). The results show that it can reduce about 31.3％ of GPDFs over Dk-means algorithm without suffering any recognition performance. When compared with the case that no clustering is employed and full GPDFs are used, the proposed algorithm can save about 61.8％ of GPDFs while preserving the recognition performance.
A New Intermediate View Reconstruction Scheme based-on Stereo Image Rectification Algorithm
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 5C, 2004, Pages 632~641
In this paper, a new intermediate view reconstruction method employing a stereo image rectification algorithm by which an uncalibrated input stereo image can be transformed into the calibrated one is suggested and its performance is analyzed. In the proposed method, feature point are extracted from the stereo image pair though detection of the corners and similarities between each pixel of the stereo image. And then, using these detected feature points, the moving vectors between stereo image and the epipolar line is extracted. Finally, the input stereo image is rectified by matching the extracted epipolar line between the stereo image in the horizontal direction and intermediate views are reconstructed by using these rectified stereo images. From some experiments on synthesis of the intermediate views by using three kinds of stereo image; a CCETT's stereo image of 'Man' and two stereo images of 'Face' ＆ 'Car' captured by real camera, it is analyzed that PSNRs of the intermediate views reconstructed from the calibrated image by using the proposed rectification algorithm are improved by 2.5㏈ for 'Man', 4.26㏈ for 'Pace' and 3.85㏈ for 'Car' than !hose of the uncalibrated ones. This good experimental result suggests a possibility of practical application of the unposed stereo image rectification algorithm-based intermediate view reconstruction view to the uncalibrated stereo images.
System Dynamics Approach to Demand and Supply of Information Security Manpower
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 5C, 2004, Pages 642~653
Information Security industry in Korea is growing rapidly but is confronted with many challenges in business environment. One of the worst hardships is the mismatch in the demand and supply of manpower. Thus the government is developing a manpower policy to relieve the situation. To suggest policy implications, this study analyzes the demand and supply of Information Security manpower in the systematic and behavioral point of views. Using System Dynamics approach we formulate a model to analyze the demand and supply of Information Security manpower. Finally we simulate the model and interpret the results.
Adaptive Data Hiding Techniques for Secure Communication of Images
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 5C, 2004, Pages 664~672
Widespread popularity of wireless data communication devices, coupled with the availability of higher bandwidths, has led to an increased user demand for content-rich media such as images and videos. Since such content often tends to be private, sensitive, or paid for, there exists a requirement for securing such communication. However, solutions that rely only on traditional compute-intensive security mechanisms are unsuitable for resource-constrained wireless and embedded devices. In this paper, we propose a selective partial image encryption scheme for image data hiding , which enables highly efficient secure communication of image data to and from resource constrained wireless devices. The encryption scheme is invoked during the image compression process, with the encryption being performed between the quantizer and the entropy coder stages. Three data selection schemes are proposed： subband selection, data bit selection and random selection. We show that these schemes make secure communication of images feasible for constrained embed-ded devices. In addition we demonstrate how these schemes can be dynamically configured to trade-off the amount of ded devices. In addition we demonstrate how these schemes can be dynamically configured to trade-off the amount of data hiding achieved with the computation requirements imposed on the wireless devices. Experiments conducted on over 500 test images reveal that, by using our techniques, the fraction of data to be encrypted with our scheme varies between 0.0244％ and 0.39％ of the original image size. The peak signal to noise ratios (PSNR) of the encrypted image were observed to vary between about 9.5㏈ to 7.5㏈. In addition, visual test indicate that our schemes are capable of providing a high degree of data hiding with much lower computational costs.
Improvement for Hearing Aids System Using Adaptive Beam-forming Algorithm
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 5C, 2004, Pages 673~682
The adaptive beam-forming is promising approach for noise reduction in hearing aids. This approach has come in the focus of interest only recently, because of the availability of new and powerful digital signal processors. The adaptation U using usually a Least Mean Squares algorithm, updates the weight vector. In this Paper, we propose a fast wavelet based adaptive algorithm using variable step size algorithm which varies adaptive constant by the change of signal environment. We compared the performance of the proposed algorithm with the known adaptive algorithm using computer simulation of multi channel adaptive bemformer in hearing aids. As the result the proposed algorithm is suitable for adaptive signal processing area using hearing aids and has advantages reducing computational complexity. And we show the beam-forming system using proposed algorithm converges stably in a sudden change of system environment.
A Temporal Error Concealment Technique Using The Adaptive Boundary Matching Algorithm
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 5C, 2004, Pages 683~691
To transmit MPEG-2 video on an errorneous channel, a number of error control techniques are needed. Especially, error concealment techniques which can be implemented on receivers independent of transmitters are essential to obtain good video quality. In this paper, prediction of motion vector and an adaptive boundary matching algorithm are presented for temporal error concealment. Before the complex BMA, we perform error concealment by a motion vector prediction using neighboring motion vectors. If the candidate of error concealment is not satisfied, search range and reliable boundary pixels are selected by the temporal activity or motion vectors and a damaged macroblock is concealed by applying an adaptive BMA. This error concealment technique reduces the complexity and maintains a PSNR gain of 0.3∼0.7㏈ compared to conventional BMA.
QRD-RLS Algorithm Implementation Using Double Rotation CORDIC
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 5C, 2004, Pages 692~699
In this paper we studied an implementation of QR decomposition-based RLS algorithm using modified Givens rotation method. Givens rotation can be obtained with a sequence of the CORDIC operations. In order to reduce the computing time of QR decomposition we restricted the number of iterations of the CORDIC operation per a Givens rotation and used double-rotation method to remove the square-root in the scaling factor.
Clustering of Incomplete Data Using Autoencoder and fuzzy c-Means Algorithm
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 5C, 2004, Pages 700~705
Clustering of incomplete data using the Autoencoder and the Fuzzy c-Means(PCM) is proposed in this paper. The Proposed algorithm, called Optimal Completion Autoencoder Fuzzy c-Means(OCAEFCM), utilizes the Autoencoder Neural Network (AENN) and the Gradiant-based FCM (GBFCM) for optimal completion of missing data and clustering of the reconstructed data. The proposed OCAEFCM is applied to the IRIS data and a data set from a financial institution to evaluate the performance. When compared with the existing Optimal Completion Strategy FCM (OCSFCM), the OCAEFCM shows 18％-20％ improvement of performance over OCSFCM.
Hybrid Watermarking Technique using DWT Subband Structure and Spatial Edge Information
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 5C, 2004, Pages 706~715
In this paper, to decide the watermark embedding positions and embed the watermark we use the subband tee structure which is presented in the wavelet domain and the edge information in the spatial domain. The significant frequency region is estimated by the subband searching from the higher frequency subband to the lower frequency subband. LH1 subband which has the higher frequency in tree structure of the wavelet domain is divided into 4
4 submatrices, and the threshold which is used in the watermark embedding is obtained by the blockmatrix which is consists by the average of 4
4 submatrices. Also the watermark embedding position, Keymap is generated by the blockmatrix for the energy distribution in the frequency domain and the edge information in the spatial domain. The watermark is embedded into the wavelet coefficients using the Keymap and the random sequence generated by LFSR(Linear feedback shift register). Finally after the inverse wavelet transform the watermark embedded image is obtained. the proposed watermarking algorithm showed PSNR over 2㏈ and had the higher results from 2％ to 8％ in the comparison with the previous research for the attack such as the JPEG compression and the general image processing just like blurring, sharpening and gaussian noise.
Implementation of Multiview Stereoscopic 3D Display System using Volume Holographic Lenticular Sheet
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 5C, 2004, Pages 716~725
In this paper, a new multiview stereoscopic 3D display system using a VHLS(volume holographic lenticular sheet) is suggested. The VHLS, which acts just like an optical direction modulator, can be implemented by recording the diffraction gratings corresponding each directional vector of the multiview stereoscopic images in the holographic recording material by using the angularly multiplexed recording property of the conventional volume hologram. Then, this fabricated VHLS is attached to the panel of a LCD spatial light modulator and used to diffract each of the multiview image loaded in a SLM to the corresponding spatial direction for making a 3D stereo view-zone. Accordingly, in this paper, the operational principle and characteristics of the VHLS are analyzed and an optimized 4-view VHLS is fabricated by using a commercial photopolymer. Then, a new VHLS-based 4-view stereoscopic 3D display system is implemented. Through some experimental results using a 4-view image synthesized with adaptive disparity estimation algorithm, it is suggested that implementation of a new VHLS-based multiview stereoscopic 3D display system can be possible.
Design of ECC Scalar Multiplier based on a new Finite Field Division Algorithm
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 5C, 2004, Pages 726~736
In this paper, we proposed a new scalar multiplier structure needed for an elliptic curve cryptosystem(ECC) over the standard basis in GF(2
). It consists of a bit-serial multiplier and a divider with control logics, and the divider consumes most of the processing time. To speed up the division processing, we developed a new division algorithm based on the extended Euclid algorithm. Dynamic data dependency of the Euclid algorithm has been transformed to static and fixed data flow by a localization technique, to make it independent of the input and field polynomial. Compared to other existing scalar multipliers, the new scalar multiplier requires smaller gate counts with improved processor performance. It has been synthesized using Samsung 0.18 um CMOS technology, and the maximum operating frequency is estimated 250 MHz. The resulting performance is 148 kbps, that is, it takes 1.1 msec to process a 163-bit data frame. We assure that this performance is enough to be used for digital signature, encryption/decryption, and key exchanges in real time environments.
Study on a Secure Authentication and Authorization Protocol based on Kerberos
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 5C, 2004, Pages 737~749
Kerberos authenticates clients using symmetric-key cryptography, and supposed to Oust other systems of the realm in distributed network environment. But, authentication and authorization are essential elements for the security. In this paper, we design an efficient and secure authentication/authorization mechanism by introducing the public/private-key and installing the proxy privilege server to Kerberos. In the proposed mechanism, to make a system more secure, the value of the session key is changed everytime using MAC(message authentication code) algorithm with the long-term key for user-authentication and a random number exchanged through the public key. Also, we reduce the number of keys by simplifying authentication steps. Proxy privilege server certifies privilege request of client and issues a privilege attribute certificate. Application server executes privilege request of client which is included a privilege attribute certificate. Also, a privilege attribute certificate is used in delegation. We design an efficient and secure authentication/authorization algorithm with Kerberos