The fields in the junctions between straight and curved rectangular waveguides are analyzed by using the method of separating variables. This method was succeeded because the authors developed the method of numerical calculation of the cylindrical functions of complex order. As a result, we numerically calculate the reflection and transmission coefficients in the junctions in various situations, and we compare these results with the results by the perturbation method and with the results by Jui-Pang et al.

To investigate the feasibility of a compact FEA image sensor with a large number of pixels, a 128 96 pixel FEA image sensor with a 4-µm-thick HARP target was fabricated and tested for the first time. The experimental results showed that the prototype could stably operate as a highly sensitive image sensor having both sufficient resolution corresponding to the number of pixels and a wide dynamic range, which demonstrated its potential as a next-generation image sensor.

We propose a novel three-dimensional (3-D) display using only two 2-D images displayed at different depths. It is based on a new perceptual phenomenon induced by the human binocular visual system and enables an observer using no extra equipment to perceive an apparent 3-D image of continuous depth when the luminance is divided between the 2-D images according to the 3-D image depth. Our prototype direct-vision 3-D display using this mechanism can easily produce moving 3-D color images by using conventional 2-D color displays.

DS-CDMA provides a flexible support for the low-to-high bit rate of multimedia services upon a specific user's request. A simple capacity expression is derived for a power-controlled reverse link of orthogonal multi-code DS-CDMA with multiple connections. It is found that an orthogonal multi-code user having multiple connections is equivalent to a single connection user, but with a spreading factor reduced by a factor of the total number of parallel codes and a required signal energy per symbol-to-interference plus noise power spectrum density ratio which is the average taken over multiple connections. Furthermore, the use of antenna diversity is found equivalent to the use of higher spreading factor increased by a factor of the number of antennas.

To design a high-speed m-bit parallel inversion circuit over GF(2m), we study two variations for the repetition-operation of the numerical formula, AB2, in employing square-first and multiply-first type operations. From the proposed two variations, we propose four inversion architectures, adopting the multiplier and square in [10], as follows: simple duplication semi-systolic architecture for multiply-first inversion circuit (MFIC), m-bit parallel semi-systolic architecture for MFIC, simple duplication semi-systolic architecture for square-first inversion circuit (SFIC), and simplified m-bit parallel semi-systolic architecture for SFIC. Among them, performance of the simplified m-bit parallel semi-systolic architecture for SFIC is recommended for a high-speed applications to get a maximum throughput in the sense of small hardware-complexity, and low latency. When we implement the simplified 8-bit parallel semi-systolic architecture for SFIC over GF(28) by using 0.25 µm CMOS library, necessary are 2495 logic-gates and 1848 latches, and the latency is 56 and the estimated clock-rate is 580 MHz at 100% throughput.

Finite-state vector quantization (FSVQ) is a well-known block encoding technique for digital image compression at low bit rate application. In this paper, an improved feature map finite-state vector quantization (IFMFSVQ) algorithm using three-sided side-match prediction is proposed for image coding. The new three-sided side-match improves the prediction quality of input blocks. Precoded blocks are used to alleviate the error propagation of side-match. An edge threshold is used to classify the blocks into nonedge or edge blocks to improve bit rate performance. Furthermore, an adaptive method is also obtained. Experimental results reveal that the new IFMFSVQ reduces bit rate significantly maintaining the same subjective quality, as compared to the basic FMFSVQ method.

A novel adaptive technique based on a statistical model by estimating window size for unsupervised segmentation of a set of MR images is presented. The window size estimation is achieved in the image using a MDL for mixture estimation and segmentation, and allows the technique to well reflect local characteristics of the image.

This letter presents a new approximation algorithm suitable for Taylor series expansion. The algorithm can effectively reduce the approximation error by using only a small number of terms in series expansion. The proposed algorithm can be more easily implemented and has better performance than the conventional Euler approximation algorithm. Also, the approximation performance of the proposed algorithm is compared with direct approaches, such as least-squares and Chebyshev approximation algorithm to show the relative advantages of the proposed algorithm. This letter also presents an application example of the proposed approximation algorithm in carrier recovery of OFDM (Orthogonal Frequency Division Multiplexing) modem.

In this letter, our proposed approach exploits the use of original and simplest Cellular Neural Network (CNN) for 2D Doubly Complementary (DC) Infinite Impulse Response (IIR) filter banks design. The properties of feedback and feedforward templates are studied for this purpose. Through some examples it is shown how generalizations of these templates can be used for DC IIR filter banks design. We modify Lagrangian function which is used for optimizing a low-pass filter design considering the constraint for stability of CNN. The brief conclusions with design examples that illustrate the proposed method and an image enhancement and restoration applications of designed filter banks are presented.

Using the great one-time password concept, the widely utilized one-way authentication scheme S/Key provides well protection against replay attacks. In this paper, S/key is enhanced to secure transactions in a critical environment. The proposed scheme is free from any of server spoofing attacks, preplay attacks, and off-line dictionary attacks. A session key here is also established to provide confidentiality. Moreover, simplicity and efficiency are taken into consideration from the user's point of view. A smart card is applied to simplify the user login process and only the hash function is used to keep its efficiency. Therefore, the scheme proposed hereinafter is able to build a safer shield for sensitive transactions like on-line banking or on-line trading in bonds and securities.

An efficient algorithm is proposed for finding all dc solutions of piecewise-linear (PWL) circuits. This algorithm is based on a powerful test (termed the LP test) for nonexistence of a solution to a system of PWL equations in a given region using the dual simplex method. The proposed algorithm also uses a special technique that decreases the number of regions on which the LP test is performed. By numerical examples, it is shown that the proposed algorithm could find all solutions of large scale problems, including those where the number of variables is 500 and the number of linear regions is 10500, in practical computation time.

In this paper, we clarify the properties of the contract net protocol based on its formal specification. To specify the contract net protocol, we propose a formal specification method for an agent system. In this method, agents are modeled as communicating finite state machines. To deal with the behavior of agents and its time passage explicitly, we incorporate the concept of time into the communicating finite state machine. The contract net protocol is specified based on the specification method proposed in this paper. From the specification, we analyze the possibility about agent deadlock and its avoidance solution.

Interoperability between different systems is becoming a more important issue for open distributed systems. In this paper, we investigate what kind of framework we need for constructing open distributed systems. Firstly, we enumerate the features and functions which the framework should have. We then evaluate a proposed multi-agent framework, Bee-gent, by using a typical example of open distributed systems. Lastly, we show clearly what is required for such a framework.

A number of mobile hosts might be densely staying in an area caused by traffic congestions. The greater part of the mobile hosts will require commonly useful data, such as traffic information, parking information and other driving related information in such environment. Simultaneous data transmission broadcasts using a common link are regarded as a suitable means to distribute this location-dependent information. However, there is no guarantee that mobile hosts can finish receiving the information completely within a limited time. In this paper, we propose a data retransmission method for communications between a base station and mobile hosts and a data recovery processing method for use between base stations. The data retransmission method called "TOA" (The Order of Arrival) schedules retransmission data specified in the first NACK request received after retransmission processing. We have proposed "Advanced" Join system in which a base station makes consolidated join requests to a multicast group on behalf of mobile hosts. Applying the TOA method to resending in the Advanced Join system, data-receiving efficiency is higher than with the simple Advanced Join system and the absolute number of completed mobile host data reception is higher. Using the TOA method, even with the base station disposition rate of 50% the number of completed reception is higher than with the Advanced Join system at 80%. The proposed reliable multicasting system to the DSRC-based ITS network can realize an efficient base station arrangement in the ITS network infrastructure and contribute to the deployment of a superior ITS.

Various niching methods have been developed to maintain the population diversity. The feature of these methods is to prevent the proliferation of similar individuals in the niche (subpopulation) based on the similarity measure. This paper demonstrates that they are effective to avoid premature convergence in a case where only one global optimum in multimodal functions is searched. The performance of major niching methods in such a case is investigated and compared by experiments using seven benchmark functions. The niching methods tested in this paper are deterministic crowding, probabilistic crowding, restricted tournament selection, clearing procedure and diversity-control-oriented genetic algorithm (DCGA). According to the experiment, each method shows a fairly good global-optimum-searching capability. However, no method can completely avoid premature convergence in all functions. In addition, no method shows a better searching capability than the other methods in all functions.

Finding corresponding edges is considered being the most difficult part of edge-based stereo matching algorithms. Usually, correspondence for a feature point in the first image is obtained by searching in a predefined region of the second image, based on epipolar line and maximum disparity. Reduction of search region can increase performances of the matching process, in the context of execution time and accuracy. Traditionally, hierarchical multiresolution techniques, as the fastest methods are used to decrease the search space and therefore increase the processing speed. Considering maximum of directional derivative of disparity in real scenes, we formulated some relations between maximum search space in the second images with respect to relative displacement of connected edges (as the feature points), in successive scan lines of the first images. Then we proposed a new matching strategy to reduce the search space for edge-based stereo matching algorithms. Afterward, we developed some fast stereo matching algorithms based on the proposed matching strategy and the hierarchical multiresolution techniques. The proposed algorithms have two stages: feature extraction and feature matching. We applied these new algorithms on some stereo images and compared their results with those of some hierarchical multiresolution ones. The execution times of our proposed methods are decreased between 30% to 55%, in the feature matching stage. Moreover, the execution time of the overall algorithms (including the feature extraction and the feature matching) is decreased between 15% to 40% in real scenes. Meanwhile in some cases, the accuracy is increased too. Theoretical investigation and experimental results show that our algorithms have a very good performance with real complex scenes, therefore these new algorithms are very suitable for fast edge-based stereo applications in real scenes like robotic applications.

This paper discusses encoding of vehicular position information using predictive algorithms in inter-vehicle communications (IVC) from the viewpoints of source coding and noisy channels. Two vehicular driving models are assumed; one is the 15-mode as a suburban rapid transit driving pattern, the other is called calming mode as a street-driving pattern. Three types of schemes are compared; a pulse code modulation (PCM) scheme, a predictive coding (PC) scheme, and the variable interval prediction (VIP) scheme that is proposed here. This paper assumes that precise position information is got from a positioning system, and that all the transmitters and receivers have common predictors. Performance comparisons of the three types of schemes are carried out both of noiseless and noisy channels. Results show that the VIP scheme is superior to any other scheme.

This paper presents an active vision system for on-line traffic sign recognition. The system is composed of two cameras, one is equipped with a wide-angle lens and the other with a telephoto lens, and a PC with an image processing board. The system first detects candidates for traffic signs in the wide-angle image using color, intensity, and shape information. For each candidate, the telephoto-camera is directed to its predicted position to capture the candidate in a larger size in the image. The recognition algorithm is designed by intensively using built-in functions of an off-the-shelf image processing board to realize both easy implementation and fast recognition. The results of on-road experiments show the feasibility of the system.

This paper presents a method of extracting car license plates captured from the arbitrary directions by using symmetry features. The generalized symmetry transform (GST) produces continuous features of symmetry between two points by combining locality constraint and reflectional symmetry, but its time complexity of GST is increased by the second power of the radius of a searching window. To achieve considerable reduction of this time complexity, we propose a scan line based GST (SLGST) which calculates the symmetry between a pair of edge pixels along the scan lines. Instead of calculating the global symmetry of a license plate, we assign the symmetry contribution acquired from SLGST to the corner point estimated from two edge points and their gradient orientations. The right angle tuned SLGST (RATSLGST) is newly proposed to detect the right angle corners more effectively. Image normalization by image warping is adopted to make such segmentation of license plate and later identification much easier. We also adopt the verifier that evaluates a candidate license plate to enhance extraction rate. Our experiments show that the proposed method for extracting perspectively distorted license plates is fairly reliable.

Automatic traffic surveillance based on visual tracking techniques has been desired for many years. This paper proposes a basic highway surveillance system using an HMM-based segmentation method. The presented system meets the essential requirement of ITS: real-time running. Its another advantage is robustness to the shadows of moving objects, which have been recognized as one of main obstacles to robust car tracking. At present, using the system we can estimate velocity of vehicles with high accuracy. For acquiring metric information in the real world, the system does not require a precise calibration but only needs four point correspondences between the image plane and ground plane.