In this paper, an improved lower bound on the burst-error correcting capability of th ecyclic product code is presented and through the analysis of this new bound clustered cyclic product (CCP abbr.)code is proposed. The CCP code, to improve the burst-error correcting capability, combines the idea of clustering and the transmission method of cyclic product code. That is, a cluster which is defined in this paper as a group of consecutive code symbols is employed as a new transmission unit to the code array transmission of cyclic product code. the burst-error correcting capability of the CCP code is improved without a loss in the random-error correcting capability and performance comparison in the digital video camera records (DVCR) system shows the superiority of the proposed CCP code over conventional product codes.

It is a recent trend that mobile communications and PCS are intergrated into the broadband network. Broadband mutlimedia traffic will be transported over the integrated network. In this paper, we propose a connection re-routing method for fast inter-switch hadoffs and dynamic resurce reservation scheme, which is based on the proposed re-routing method, for the ATM-based personal communications network. To reduce the delay for re-routing method, for the ATM-based personal communications network. To reduce the delay for re-routing, the proposed re-routing method is to reserve VPI/VCIs for possible inter-swich handoff calls in advance. Our reservation scheme is to statistically reserve the fixed resources for possible inter-switch handoff calls, according to the QoS of the handoff calls. The simmulation reslts show that our proposed scheme satisfies the required QoS of handoff calls and keep the dropping probability of handoff calls lower than other schemes.

This paper proposes an elliptical world-modeling mehtrod in order to secure the safety of the mobile robot from the unreliability of ultrasonic sensors and to estimate the lateral orientation of the detected objects. This method is advnatageous because the total amount of data that the robot utilizes is reduced when historical and new data are clusterd during each sensing period and also because the objects in the environment can be almost exactly recognized. This paper also proposes a new local path planning algorithm which is divided into four different situations and gudies the robot through the safe local path using dat acollected in elliptical form. This algorithm can help the AMR navigate by allowing it to sum up the virtual vector forces made form the ellipses in order to select a safe subgoal. This local path plannin gmehtod using the elliptical world model has been proved by several navigation experiments.

In this paper, a video coding method in wavelet transformed multi-resolution image using variable block sized motion estimation and multi-codebook is proposed. In the propoed method, the accuracy of motion estimation is increased by using variable block matching algorithm based on edge type of blocks which estimation is increased by using variable block matching algoritm based on edge type of blocks which is classified accoridng to the magnitude of wavelet coefficients in vertical subband and horizontal subband of the highest layer. Also, we increased the flexibility of bit allocation and decreased vector quantization error for motion compensated error transmission by using importance of each subband. Some experimental results confirm that he proposed mothod has fine reconstructed images without blocking effect at low bit rate, and especially reconstructs edges well to which human eyes are sensitive.

In this paper, we quantize the image data to simplify the systolic array architecture for block matching algorithm. As the number of bits for pixel data to be processed is reduced by quantization, one can simplify the hardware of systolic array. Especially, if the bit serial input is used, one can even more simplify the structure of processing element. First, we analize the effect of quantization to a block matching. then we show the structure of quantizer and processing element when bit serial input is used. The simulation results applied to standard images have shown that the proposed block matching method has less prediction error than the conventional high speed algorithm.

To reconstruct the complete 3-D shape of an object, seveal range images form different viewpoints should be merged into a single model. The process of extraction of the transformation parameters between multiple range views is calle dregistration. In this paper, we propose a new algorithm to find the transformation parameters between multiple range views. Th eproposed algorithm consists of two step: initial estimation and iteratively update the transformation. To guess the initial transformation, we modify the principal axes by considering the projection effect, due to the difference fo viewpoints. Then, the following process is iterated: in order to extract the exact transformation parameters between the range views: For every point of the common region, find the nearest point among the neighborhood of the current corresponding point whose correspondency is defined by the reverse calibration of the range finder. Then, update the transformation to satisfy the new correspondencies. In order to evaluate the performance the proposed registration algorithm, some experiments are performed on real range data, acquired by space encoding range finder. The experimental results show that the proposed initial estimation accelerate the following iterative registration step.

This paper proposes a new algorithm for recognizing polyhedral objects using a single 2-D image. It is base don a new representation scheme having two level hierarchey. In the lower level, geometrical features of each primitive surface are represented using their signatures and the variation of signature due to rotation is represented suing the rotation map. In the higher level, topological features are represented in the inter-surface description table(SDT). Based on the proposed representaton scheme, loer level database searched to find a matching primitive surface. The srotation map determines the degree of rotation as well as the matchness. If all surfaces in a test object find their matching primitive surfaces, its structural information is compared with the SDTs of object models. If primitive surfaces of a test object equal to tha tof certain model and satisfy inter-surfaces relationship in SDT, a test object is recognized as the model.

Markov random field models have extensively used in applications such as image segmentation and image restoration. In this paper, we consider the relation between the stationarity of parameters and the synthesized images for gauss-markov rnadom field which has the most popularly used among many MRF models. GMRF model, which is both wide-sense Markov and strict-sense markov, has AR representations and is also a kind of gibbs distribution. Therefore, we may approach in aspect of both AR models and gibbs models. We show the relation between the stationarity of parameters and the images which are synthesized by two approaching methods and derive the stationary regions of parameters in 1st order and isotropic 2nd order case.

This paper presents a linear shift-invariant system euqivalent to morphological dilation for a memoryless uniform source in the sense of the power spectral density function, and comares it with dialtion. This equivalent LSI system is found through spectral decomposition and, for dilation and with windwo size L, it is shown to be a finite impulse response filter composed of L-1 delays, L multipliers and three adders. Th ecoefficients of the equivalent systems are tabulated. The comparisons of dilation and its equivalent LSI system show that probability density functions of the output sequences of the two systems are quite different. In particular, the probability density functon from dilation of an independent and identically distributed uniform source over the unit interval (0, 1) shows heavy probability in around 1, while that from the equivalent LSI system shows probability concentration around themean vlaue and symmetricity about it. This difference is due to the fact that dilation is a non-linear process while the equivalent system is linear and shift-ivariant. In the case that dikation is fabored over LSI filters in subjective perforance tests, one of the factors can be traced to this difference in the probability distribution.

The WCHF-FSJTC (wavelet circular harmonic function frequency selective joint transform correlator) using th wavelet transformed CHF as the reference image in FSJTC is proposed for rotation invariant pattern recognition. Since the wavelet transform has the property of feature extraction, the proposed system can have the better DC (discrimination cpability) and the higher SNR(signal to noise ratio) compared with the conventional CHF-CJTC(circular harmonic function conventional joint transform correlator). And since the structure of the proposed system is FSJTC which can eliminate auto-correlation and cross-correlation between input images, it can eliminate false alarm caused by the overlapping among correlation peaks. The used wavelet functio is the morlet function, which is proper for the reference image used in this paper. the optimal dialation parameter and oscillation frequency of the wavelet function are also achieved with varying the parameters of the wavelet function. The computer simulation shows that the proposed system has the best performance when the dilation parameter is 0.8 and the oscillation frequency is 0.48.

In this paper, three-phase PWM AC to DC boost converter that operates with unity power factor and sinusodial input line currents is presented. The current control of this converter is based on the space vector PWM strategy with fixed switching frequency and the line currents track to reference currents within one sampling time interval. By using this control strategy low ripples in the outut current and the voltage as well as fast dynamic response are achieved with small dc link cpacitance employed.

The clamp mode (CM) forward zero voltage switching multi resonant converter (ZVS-MPC) with self-driven synchronous rectifier is studied. The loss at the synchronous rectification stage of the converter is analyzed using MOSFET piecewise linear model and is compared with the loss at the conventional schottky diode rectification stage of th econverter. From the results of the analysis, it is known that the use fo MOSFETs as a synchronous rectifier reduces the loss at the rectification stage overthe whole load range comparing the use of schottky diodes as a conventional rectifier in the converter. In order to verify the validit of the analysis, we have built a 33W(3.3V/10A) CM forward ZVS-MRC with self-driven synchronous rectifier, in which switching frequency is 1MHz, and tested. FRom the experimental results, it is known that the synchronous rectification achieved about 1W improvement in the loss at the rectification stage and about 3% in the efficiency at the converter as compared with the conventional schottky diode rectification.