This paper deals with the problem of multiple object tracking with the condensation algorithm, applied to tracking of soccer players. To solve the problem of failures in tracking multiple players under overlapping, we introduce occlusion alarm probability, which attracts or repels particles based on their posterior distribution of previous time step. Real experiments showed a robust performance.

Whereas the autocorrelation is frequently used for pitch estimation, the resultant estimates usually suffer from inaccuracy. Instead of upsampling, we can improve the accuracy of the estimates by applying polynomial interpolation to the autocorrelation directly. For that purpose, four kernels, which are interpolating quadratic, quadratic-B spline, cubic-B spline, and cubic convolution kernels respectively, have been compared. Experiments show that the cubic B spline kernel shows the best performance, a little inferior to the computationally intensive upsampling procedure. The quadratic B spline kernel shows also reasonable performance with the merit of the further reduced computational complexities compared with the cubic B spline kernel.

Hierarchical Mobile IPv6 (HMIPv6) has been proposed to manage the mobility of Mobile Terminals (MTs) hierarchically to reduce packet losses during local handover. HMIPv6 uses a mobility manageable router in a domain visited by the MTs to manage the micromobility of the MTs. The router is called Mobility Anchor Point (MAP). As a hierarchical mobility management scheme based on HMIPv6, we have already proposed a multilevel hierarchical distributed IP mobility management scheme to manage the mobility of MTs in a decentralized manner using multiple MAPs. Our scheme manages the mobility of an MT using a MAP having a suitable management domain. This usage of MAPs aims to efficiently decentralize the load of mobility management. Our scheme estimates the movement speed of the MT and then estimates the mobility of the MT based on the estimated movement speed of the MT to achieve the objective. However, recent simulation results obtained with more realistic mobility model indicate that our scheme has two problems in estimating the mobility of MTs: One is that our current scheme misestimates the movement speed of an MT in some cases, and the other is that our current scheme does not notice the changes in the mobility of an MT when the MT decelerates and stays in the same access area for a long time. Thus, an enhanced mobility estimation method is proposed in this paper. The enhanced method has an ability to estimate the movement speed of MTs more correctly and an ability to urge decelerated MTs to degrade their MAP quickly. Finally, the performance of the proposed mobility estimation method is evaluated using simulation experiments. The simulation results show that the enhanced method allows our scheme to estimate the mobility of MTs more correctly and so achieve more efficient load sharing.

This paper proposes a method of improving demodulation performance for chaotic synchronization based multiplex communications systems. In a conventional system, the number of data demodulated correctly is limited because transmitted chaotic signals interfere with each other. The proposed system uses a generalized inverse of a matrix formed from chaotic signals at the transmitter. Since this completely cancels the interference between chaotic signals, demodulation performance is greatly improved. The proposed system has the following features: A simple correlation receiver suitable for small terminals can be used; The magnitude of the correlator output is constant for binary data transmission; Analog information data can also be transmitted. Two methods to reduce the peak-to-average power ratio of the transmitted signal are presented.

The purpose of this research is to show that the stress during the VDT task could be evaluated using the chaotic features for the focal accommodation system and the pupil area. The result of this experiment shows that the fractal dimension for the pupil area can be used to evaluate the stress during the VDT task. Moreover, it is shown that the chaotic property in the fixed target measurement is higher than that in the linear control and step control measurements. However, the first Lyapunov exponent hardly changed over time for all of three accommodation measurements.

Analytical derivation of bit error rates for multi-user coherent chaos-shift-keying (CSK) communication systems are presented in this paper. Nearly exact results are obtained by applying the central limit theorem of statistics to sums of independent variables. Based on χ2 distribution approximations, more viable but still very accurate results decrease complexity of the calculations. The χ2 approach is compared with the widely used Gaussian approximation approach to show its superiority in most cases. Bit error performance bounds for the multi-user CSK system from the approach are deduced as further contributions of this paper. The theoretical results obtained are entirely consistent with a range of simulations.

This paper deals with an on-line identification method based on a radial basis function (RBF) network model for continuous-time nonlinear systems. The nonlinear term of the objective system is represented by the RBF network. In order to track the time-varying system parameters and nonlinear term, the recursive least-squares (RLS) method is combined in a bootstrap manner with the genetic algorithm (GA). The centers of the RBF are coded into binary bit strings and searched by the GA, while the system parameters of the linear terms and the weighting parameters of the RBF are updated by the RLS method. Numerical experiments are carried out to demonstrate the effectiveness of the proposed method.

In this letter, we present an efficient stream authentication scheme that is an improvement of SAIDA. It is shown that under the same communication overhead its verification probability is higher than that of SAIDA. Moreover, its computation cost is lower than that of SAIDA.

We propose a robust edge detection method based on independent component analysis (ICA). It is known that most of the basis functions extracted from natural images by ICA are sparse and similar to localized and oriented receptive fields, and in the proposed edge detection method, a target image is first transformed by ICA basis functions and then the edges are detected or reconstructed with sparse components only. Furthermore, by applying a shrinkage algorithm to filter out the components of noise in the ICA domain, we can readily obtain the sparse components of the original image, resulting in a kind of robust edge detection even for a noisy image with a very low SN ratio. The efficiency of the proposed method is demonstrated by experiments with some natural images.

In this paper, we propose a set of broadcast streaming protocols designed for unidirectional radio channels. Considering the limited size and implementation overhead on a mobile terminal, the proposed protocol set is almost compliant with the current mobile streaming protocols, i.e. 3GPP PSS (Packet-switched Streaming Service), except for that the proposed protocols are designed to work on a unidirectional downlink channel. This protocol set enables flexible layout rendering by SMIL (Synchronized Multimedia Integration Language) in combination with SDP (Session Description Protocol), and reliable and synchronized static media (including still image and text) delivery by RTP (Real-time Transport Protocol) carousel. We present the prototype of this protocol set and measure its performance of video quality and waiting time for video presentation through a W-CDMA radio channel emulator and header compression nodes. From the experimental results, we show 1) trade-off between video quality and waiting time, 2) advantage and disadvantage of header compression, 3) effectiveness of synchronized transmission of SDP, SMIL, and I-frames of video objects, and 4) reliability of RTP-carousel. This protocol set is applicable to 3G MBMS (Multimedia Broadcast/Multicast Service) streaming service.

The next-generation IP-based mobile network must accommodate various kinds of wireless access technologies, including W-CDMA. Although the soft handover technique should be supported if W-CDMA is used, redundant paths will be created by the soft handover scheme employed by the 3rd generation mobile communication system. This paper proposes the Network Distributed Soft Handover (NDSHO) method, which achieves soft handover control in an IP network but without any redundant paths. NDSHO continuously optimizes all routing paths by relocating the data copy point dynamically during communication according to the movement of the mobile terminal. To achieve the proposed method, this paper introduces a copy point seamless relocation method and an optimal point selection method which takes advantage of OSPF. Furthermore, we show quantitatively that NDSHO makes more efficient use of system resources than the 3rd generation system.

This paper proposes the joint beamforming space-time block coding (JBSTBC) scheme for multi-input multi-output (MIMO) communication systems. To enhance the order of spatial diversity in presence of deteriorate fading correlations as well as inter-substream interferences, the proposed JBSTBC method employs joint eigen-beamforming technique together with the block-ordered layered detector (BOLD) for MIMO-STBC. In order to confirm the superiority of the proposed JBSTBC method, computer simulations are conducted in highly correlated fading situations while providing detailed mathematical derivations for clarifying functionality of the proposed scheme.

Along with expansion of utilization of mobile ad hoc networks, it is expected that the network size becomes large. However, design of current typical routing protocols supposes at most several hop routes between source and destination nodes. When messages are delivered along long hop routes in the networks, such routing protocols tend to degrade performance. Previously, we have proposed an autonomous clustering scheme for constructing and maintaining hierarchical structure in mobile ad hoc networks, which are adaptive to node movement. This paper proposes a class of hierarchical routing protocols Hi-TORA, Hi-DSR and Hi-AODV, all of which are based on the autonomous clustering scheme, compares them with their corresponding flat routing protocols TORA, DSR and AODV, respectively, and shows effectiveness of these hierarchical routing protocols by simulation experiments.

In this paper, we propose a new fragile watermarking scheme that can be used to verify three-dimensional (3-D) polygonal models by detecting unauthorized alterations. In order to generate a binary watermark sequence, we combine a binary random sequence generated by the user key with a binary logo sequence using the bit-wise exclusive OR operation. The binary watermark sequence is embedded into 3-D triangle strips by perturbing their vertex coordinates. The proposed watermarking scheme can identify specific locations that have been changed. Changes of the vertex coordinates in the watermarked 3-D model are reflected in the extracted watermark image, which indicates the attacked area. Experimental results demonstrate that we can detect various modifications of the watermarked 3-D model: translation, rotation, scaling, randomization of points, polygon simplification, geometry compression, and local deformation.

With the explosive growth of the Internet system, demands for broadband communication networks have rapidly increased to provide high quality network services. For this purpose, the IEEE 802.6 MAC standard protocol defines the distributed-queue dual bus (DQDB) for metropolitan area networks (MANs). The isochronous channel reuse problem (ICRP) has been studied for efficient use of DQDB by finding proper channel assignments to incoming connection requests. In this paper, we first define the generalized isochronous channel reuse problem (GICRP) as a generalization of ICRP, to afford demands of simultaneously satisfying plural connection requests such as for multicast applications, where certain sets of connection requests must be assigned channels simultaneously. We prove the NP-completeness of its decision problem. Then, we propose a minimum dead space (MDS) algorithm as a heuristic approach to GICRP. The extensive simulation results show that with shorter computation time, our MDS algorithm can always find better channel assignments reducing the waiting time for packet transmissions than the best existing algorithm for conventional ICRP.

Unlike most of the previous work for smart antennas that covered each area individually (antenna-array design, signal processing and communications algorithms and network throughput), this paper may be considered as a review of comprehensive effort on smart antennas that examines and integrates antenna array design, the development of signal processing algorithms (for angle of arrival estimation and adaptive beamforming), strategies for combating fading, and the impact on the network throughput. In particular, this study considers problems dealing with the impact of the antenna design on the network throughput. In addition, fading channels and tradeoffs between diversity combining and adaptive beamforming are examined as well as channel coding to improve the system performance.

This paper presents a simplified maximum likelihood detection (MLD) scheme for multiple-input and multiple-output spatial division multiplexing (MIMO-SDM) systems. In the scheme, ordered successive detection (OSD) is applied to multiple symbol candidates retained in the preceding stage to limit the number of symbol vector candidates. Accordingly, the subsequent MLD searches for the most likely signal vector among the limited symbol-vector candidates. Simulation results demonstrated that the proposed scheme provides the bit error rate performance close to that achieved by MLD while reducing the computational complexity.

An RF front-end using a six-port circuit is a promising technology for realization of a compact software defined radio (SDR) receiver. Such a receiver, called a six-port direct conversion receiver (DCR), consists of analog circuit and digital signal processing components. The six-port DCR itself outputs four different linear combinations of received and local signals. The output powers are measured at each port, and the received signal is recovered by solving a set of linear equations. This receiver can easily cover a wide frequency band unlike the conventional DCR since it does not require the precise orthogonality that the conventional one does. In this paper, we propose a novel calibration method for a six-port system that includes nonlinear circuits such as diode detectors. We demonstrated the demodulation performance of a six-port DCR by computer simulation and experiments at 1.9, 2.45, and 5.85 GHz.

An empirical formula of resonant frequency of bow-tie microstrip antennas is presented, which is based on the cavity model of microstrip patch antennas. A procedure to design a bow-tie antenna using genetic algorithm (GA) in which we take the formula as a fitness function is also given. An optimized bow-tie antenna by genetic algorithm was constructed and measured. Numerical and experimental results are used to validate the formula and GA. The results are in good agreement.

In this article we propose a new framework to support QoS and 4G enabled mobility management. The key feature of this framework is twofold; the Policy based Handover control, and the adaptive handover mechanisms. On one hand, the adaptive handover mechanism will allow the selection of different handover schemes based on the user service level specification in order to differentiate the handover quality provided for the required service level, thus optimizing the network resources usage and providing the agreed service level to users. On the other hand, the proposed handover control mechanism considers resource availability and other constraints during the handover decision in order to provide support for QoS aware mobility on the contrary of the classical naïve mobility management that considers only signal strength fading. This decision mechanism will provide mainly the interaction between the mobility and QoS management frameworks but also a 4G handover control. In addition, the QoS aware handover will provide the knowledge necessary to achieve a proactive handover's procedures control.