In January 2005, an open evaluation of corpus-based text-to-speech synthesis systems using common speech datasets, named Blizzard Challenge 2005, was conducted. Nitech group participated in this challenge, entering an HMM-based speech synthesis system called Nitech-HTS 2005. This paper describes the technical details, building processes, and performance of our system. We first give an overview of the basic HMM-based speech synthesis system, and then describe new features integrated into Nitech-HTS 2005 such as STRAIGHT-based vocoding, HSMM-based acoustic modeling, and a speech parameter generation algorithm considering GV. Constructed Nitech-HTS 2005 voices can generate speech waveforms at 0.3RT (real-time ratio) on a 1.6 GHz Pentium 4 machine, and footprints of these voices are less than 2 Mbytes. Subjective listening tests showed that the naturalness and intelligibility of the Nitech-HTS 2005 voices were much better than expected.

In this paper, we propose a flexible gaze detection method using single PTZ (Pan-Tilt-Zoom) camera. In this method, a PTZ camera traces user's face and measures position of their viewing point, so they do not need to fix their head in front of camera. Furthermore, to realize accurate gaze detection, we employ elliptical iris template matching. To reduce calculation amount of iris template matching, we get rough gaze direction by simple method on ahead to decide ellipse shape. In this paper, we also adapt to variation of facial orientations, which will affect to detect viewing position and gaze direction. After several experiments, we examine accuracy of gaze detection and head tracking ability of this system.

We propose the extended Bezier spiral in this paper. The spiral is useful for both design purposes and improved aesthetics. This is because the spiral is one of the Bezier curves, which play an important role in interactive curve design, and because the assessment of the curve is based on the human reception of the curve. For the latter purpose we utilize the logarithmic distribution graph that quantifies the designers' preferences. This paper contributes the unification of the two different curve design objectives (the interactive operation and so called "eye pleasing" result generation); which have been independently investigated so far.

This paper presents a scalable FPGA/ASIC implementation architecture for high-speed parallel table-lookup-coding using multi-ported content addressable memory, aiming at facilitating effective table-lookup-coding solutions. The multi-ported CAM adopts a Flexible Multi-ported Content Addressable Memory (FMCAM) technology, which represents an effective parallel processing architecture and was previously reported in [1]. To achieve a high-speed parallel table-lookup-coding solution, FMCAM is improved by additional schemes for a single search mode and counting value setting mode, so that it permits fast parallel table-lookup-coding operations. Evaluation results for Huffman encoding within the JPEG application show that a synthesized semi-custom ASIC implementation of the proposed architecture can already reduce the required clock-cycle number by 93% in comparison to a conventional DSP. Furthermore, the performance per area unit, measured in MOPS/mm2, can be improved by a factor of 3.8 in comparison to parallel operated DSPs. Consequently, the proposed architecture is very suitable for FPGA/ASIC implementation, and is a promising solution for small area integrated realization of real-time table-lookup-coding applications.

We present the use of a Modified Generalized Hough Transform (MGHT) and deformable contours for image data retrieval where a given contour, gray-scale, or color template image can be detected in the target image, irrespective of its position, size, rotation, and smooth deformation transformations. Potential template positions are found in the target image using our novel modified Generalized Hough Transform method that takes measurements from the template features by extending a line from each edge contour point in its gradient direction to the other end of the object. The gradient difference is used to create a relationship with the orientation and length of this line segment. Potential matching positions in the target image are then searched by also extending a line from each target edge point to another end along the normal, then looking up the measurements data from the template image. Positions with high votes become candidate positions. Each candidate position is used to find a match by allowing the template to undergo a contour transformation. The deformed template contour is matched with the target by measuring the similarity in contour tangent direction and the smoothness of the matching vector. The deformation parameters are then updated via a Bayesian algorithm to find the best match. To avoid getting stuck in a local minimum solution, a novel coarse-and-fine model for contour matching is included. Results are presented for real images of several kinds including bin picking and fingerprint identification.

A semi-supervised classification method is presented. A robust unsupervised spectral mapping method is extended to a semi-supervised situation. Our proposed algorithm is derived by linearization of this nonlinear semi-supervised mapping method. Experiments using the proposed method for some public benchmark data reveal that our method outperforms a supervised algorithm using the linear discriminant analysis for the iris and wine data and is also more accurate than a semi-supervised algorithm of the logistic GRF for the ionosphere dataset.

In this paper, we propose a modified reproduction strategy of a Genetic Algorithm (GA) utilizing a Self-Organizing Map (SOM) with a novel updating rule of binary weight vectors based on a significance of elements of inputs. In this rule, an updating order of elements is decided by considering fitness values of individuals in a population. The SOM with the proposed updating rule can realize an effective reproduction.

This paper proposes a new multi-task synchronization scheme for packet mode orthogonal frequency division multiplexing (OFDM) signals in multi-input multi-output (MIMO) transmission systems; it targets high-rate wireless LANs that offer over 100 Mbit/s. In addition, this paper introduces a packet format for MIMO-OFDM signals that ensures backward compatibility with IEEE 802.11a. The proposed synchronization scheme has simple open-loop construction and consists of automatic frequency control (AFC), symbol timing detection, MIMO channel estimation, and phase tracking. AFC and symbol timing detection are carried out in the time-domain. After OFDM demodulation, the proposed scheme performs MIMO channel estimation and phase tracking in the frequency-domain. Considering all of the above synchronization tasks, we evaluate the packet error rate (PER) performance using the IEEE 802.11 TGn-defined channel model-D and model-E. In channel model-D with the RMS delay spread = 50 ns, the proposed scheme shows superior performance; it suppress the required Eb/N0 degradation to within 0.4 dB with 1000 byte packets compared to the performance achieved if only MIMO channel estimation is considered. Moreover, in channel model-E with the RMS delay spread = 100 ns, it is found that the proposed scheme degrades the required Eb/N0 only by approximately 1.5 dB compared to the MIMO channel estimation only case, even if the packet length is 1000 bytes with 64QAM and coding-rate = 7/8.

We have proposed a diffusion-type flow control mechanism to achieve the extremely time-sensitive flow control required for high-speed networks. In this mechanism, each node in a network manages its local traffic flow only on the basis of the local information directly available to it, by using predetermined rules. In this way, the implementation of decision-making at each node can lead to optimal performance for the whole network. Our previous studies concentrated on the flow control for a single flow. In this paper, we propose a diffusion-type flow control mechanism for multiple flows. The proposed scheme enables a network to quickly recover from a state of congestion and to achieve fairness among flows.

This paper proposes novel calculuses of linearizing attack that can be applied to higher order differential attack. Higher order differential attack is a powerful and versatile attack on block ciphers. It can be roughly summarized as follows: (1) Derive an attack equation to estimate the key by using the higher order differential properties of the target cipher, (2) Determine the key by solving an attack equation. Linearizing attack is an effective method of solving attack equations. It linearizes an attack equation and determines the key by solving a system of linearized equations using approaches such as the Gauss-Jordan method. We enhance the derivation algorithm of the coefficient matrix for linearizing attack to reduce computational cost (fast calculus 1). Furthermore, we eliminate most of the unknown variables in the linearized equations by making the coefficient column vectors 0 (fast calculus 2). We apply these algorithms to an attack of the five-round variant of KASUMI and show that the attack complexity is equivalent to 228.9 chosen plaintexts and 231.2 KASUMI encryptions.

A Non-Uniform Discrete Multitone (DMT) transceiver employing an octave spaced quadrature mirror filter (QMF) bank, can be used to overcome the problem of channel noise enhancement in the zero-forcing (ZF) equalization technique. In this letter, performance of the Non-Uniform DMT system is analyzed. A study of the crosstalk between sub-channels due to non-ideal filter banks is also presented. Crosstalk analysis is based upon the bit error rate (BER) performance versus the QMF order in a standadard ADSL channel. Performance comparison of the Non-Uniform DMT transceiver and a conventional DMT system is given, and it is shown that the Non-Uniform DMT transceiver displays slight improvement over the conventional DMT system for the filters of higher order.

We consider the bandwidth optimization problem in a Generalized Processor Sharing (GPS) server to minimize the total bandwidth such that QoS requirements for each class queue are satisfied. Our previous optimization algorithm [6] requires rather long optimization time to solve the problem. We propose a new optimization algorithm based on weight vector adjustment. Numerical results show that the required time to find the optimal resource in GPS servers is significantly reduced, compared to the previous algorithm.

The UWB (ultra-wideband) pulse radar is a promising candidate as an environment measurement method for rescue robots. Radar imaging to locate a nearby target is known as an ill-posed inverse problem, on which various studies have been done. However, conventional algorithms require long computational time, which makes it difficult to apply them to real-time operations of robots. We have proposed a fast radar imaging algorithm, the SEABED algorithm, for UWB pulse radars. This algorithm is based on a reversible transform, BST (Boundary Scattering Transform), between the target shape and the observed data. This transform enables us to estimate target shapes quickly and accurately in a noiseless environment. However, in a noisy environment the image estimated by the SEABED algorithm is degraded because BST utilizes differential operations. We have also proposed an image stabilization method, which utilizes the upper bound of the smoothness of received data. This method can be applied only to convex objects, not to concave ones. In this paper, we propose a fractional BST, which is obtained by expanding the conventional BST, and an image stabilization method by using the fractional BST. We show that the estimated image can be stabilized regardless of the shape of target.

Novel dual-band bandpass filter (BPF) with quasi-elliptic function response by using the meander coupled step-impedance resonators (SIRs) is presented. By tuning the appropriate impedance ratio (K) and physical length of SIRs, the BPF has good dual-band performance at 2.4 and 5.2 GHz with high selectivity, due to the transmission zeros appeared in two passband edges. Measured results of the proposed BPF have a good agreement with the electromagnetic (EM) simulated results.

We have fabricated a polymer solid-state microstructure for optical application by two-photon-induced polymerization technique. The photopolymerization resin contains conventional laser-dye and dendrimer. A dendrimer can encapsulate the laser-dyes, limiting cluster formation and intermolecular energy transfer, and promising a high level of optical gain. The effect can be extended to prepare an optically active microstructure using the two-photon-induced polymerization technique. We fabricated a polymeric microcavity, which consisted of < 400 nm-linewidth strips arranged in layer-by-layer structure. The periodic variation in the refractive index gave rise to Bragg reflection. A laser emission was measured in the microcavity under optical excitation. The spectral linewidth was about 0.1 nm above the lasing threshold. We investigate both the material functions in the molecular scale and controlling the device structure for desired applications such as a polymer distributed feedback structure.

In this Letter, we propose a new adaptive step-size widely linear constant modulus algorithm (CMA) in DS-CDMA systems especially for time-varying interference environments. The widely linear estimation enables CMA to produce better output signal to interference plus noise ratio (SINR) and the adaptive step-size tackles the time-varying interference environment effectively. The simulations confirm that the proposed algorithm shows better performance in a DS-CDMA system employing a BPSK modulation than other algorithms without use of widely linear processing.

In this paper, we present a modified genetic algorithm for solving combinatorial optimization problems. The modified genetic algorithm in which crossover and mutation are performed conditionally instead of probabilistically has higher global and local search ability and is more easily applied to a problem than the conventional genetic algorithms. Three optimization problems are used to test the performances of the modified genetic algorithm. Experimental studies show that the modified genetic algorithm produces better results over the conventional one and other methods.

This paper presents moment method analysis of a plane wave generator in an oversized rectangular waveguide; its finite size is taken into account. Power divisions of the series of coupling windows and eigenmode excitation coefficients in the oversized waveguide are quantitatively evaluated by the analysis. In order to have a better understanding of array design, the relation between these mode coefficients and the radiation patterns is discussed. Control of the mode coefficients in the oversized waveguide is directly related to the far-field radiation pattern synthesis. These calculated results are verified by measurements in the 61.25 GHz band.

Concurrency is one of the most important issues in system-level design. Interleaving among parallel processes can cause an extremely large number of different behaviors, making design and verification difficult tasks. In this work, we propose a synchronization verification method for system-level designs described in the SpecC language. Instead of modeling the design with timed FSMs and using a model checker for timed automata (such as UPPAAL or KRONOS), we formulate the timing constraints with equalities/inequalities that can be solved by integer linear programming (ILP) tools. Verification is conducted in two steps. First, similar to other software model checkers, we compute the reachability of an error state in the absence of timing constraints. Then, if a path to an error state exists, its feasibility is checked by using the ILP solver to evaluate the timing constraints along the path. This approach can drastically increase the sizes of the designs that can be verified. Abstraction and abstraction refinement techniques based on the Counterexample-Guided Abstraction Refinement (CEGAR) paradigm are applied.

Frequency-domain equalization (FDE) based on the minimum mean square error (MMSE) criterion can replace the conventional rake combining while offering significantly improved bit error rate (BER) performance for the downlink DS-CDMA in a frequency-selective fading channel. However, the presence of residual inter-chip-inference (ICI) after FDE produces orthogonality distortion among the spreading codes and the BER performance degrades as the level of multiplexing increases. In this paper, we propose a joint MMSE frequency-domain equalization (FDE) and ICI cancellation to improve the BER performance of the DS-CDMA downlink. In the proposed scheme, the residual ICI replica in the frequency-domain is generated and subtracted from each frequency component of the received signal after MMSE-FDE. The MMSE weight at each iteration is derived taking into account the residual ICI. The effect of the proposed ICI cancellation scheme is confirmed by computer simulation.