In this paper, we propose a probabilistic approach to derive an approximate polyhedral description from range data. We first compare several least-squares-based methods for estimation of local normal vectors and select the most robust one based on a reasonable noise model of the range data. Second, we extract the stable planar regions from the range data by examining the distributions of the local normal vectors together with their spatial information in the 2D range image. Instead of segmenting the range data completely, we use only the geometries of the extracted stable planar regions to derive a polyhedral description of the range data. The curved surfaces in the range data are approximated by their extracted plane patches. With a probabilistic approach, the proposed method can be expected to be robust against the noise. Experimental results on real range data from different sources show the effectiveness of the proposed method.

The mobile computing system is a set of functions on a distributed environment organized to support mobile hosts. In this environment, mobile hosts should be able to move without any constraints and should remain connected to the network even while moving. Also, they should be able to get necessary information regardless of their current location and time. Distributed mutual exclusion methods for supporting distributed algorithms have hitherto been designed for networks only with static hosts. However, with the emergence of mobile computing environments, a new distributed mutual exclusion method needs to be developed for integrating mobile hosts with underlying distributed systems. In the sense, many issues that should be considered stem from three essential properties of mobile computing system such as wireless communication, portability, and mobility. Thus far, distributed mutual exclusion methods for mobile computing environments were designed based on a token ring structure, which has the drawback of requiring high costs in order to locate mobile hosts. In this paper, we propose not only a distributed mutual exclusion method that can reduce such costs by structuring the entire system as a tree-based logical structure but also recovery schemes that can be applied when a node failure occurs. Finally, we evaluate the operation costs for the mutual exclusion scheme and the recovery scheme.

The international telecommunication standards bodies such as ITU-T, ATM Forum, and IETF recommend the dual leaky bucket for the traffic specifications for VBR service. On the other hand, recent studies have demonstrated multiple time-scale burstiness in compressed video traffic. In order to fill this gap between the current standards and real traffic characteristics, we present a standard-compatible traffic parameter selection method based on the notion of a critical time scale (CTS). The defined algorithm is optimal in the sense that it minimizes the required amount of link capacity for a traffic flow under a maximum delay constraint. Simulation results with compressed video traces demonstrate the efficiency of the defined traffic parameter selection algorithm in resource allocation.

Transmission and distribution systems are investigated for application in future fiber optic super-broadband and super-multi-channel subscriber loops. Gradual upgrading is considered so that future systems can keep compatibility with existing systems. First, time frame and strategies for subscriber loop upgrade are overviewed and assumptions for evolution of broadband multimedia distribution systems are discussed. It is suggested that upgrading to super-high definition (SHD) quality multimedia is desirable. Next, some examples of extra-auxiliary picture (EAP) formats are discussed to show the possibility of improving upgradability and compatibility by using extra-channels. Then multiplexing and channel selecting systems are investigated for economical realization of super-multi-channel distribution and flexible channel selection, and hybrid multiplexing (HMUX) and a trans-selector (T-SEL) are proposed. Finally, the efficiencies of HMUX and T-SEL are discussed by using numerical examples. Although broadband down streams are mainly considered, other streams such as IP traffics can be accommodated in the distribution systems investigated in this paper.

Most of the image restoration filters proposed so far include parameters that control the restoration properties. For bringing out the optimal restoration performance, these parameters should be determined so as to minimize a certain error measure such as the mean squared error (MSE) between the restored image and original image. However, this is not generally possible since the unknown original image itself is required for evaluating MSE. In this paper, we derive an estimator of MSE called the subspace information criterion (SIC), and propose determining the parameter values so that SIC is minimized. For any linear filter, SIC gives an unbiased estimate of the expected MSE over the noise. Therefore, the proposed method is valid for any linear filter. Computer simulations with the moving-average filter demonstrate that SIC gives a very accurate estimate of MSE in various situations, and the proposed procedure actually gives the optimal parameter values that minimize MSE.

Iterative decoding is a key feature of turbo code and each decoding results in additional power consumption of the decoder and decoding delay. In this letter, we propose an effective stop criterion based on the Gaussian assumption at the decoder output. Simulation results show that the proposed method can dynamically stop the iterative process with a negligible degradation of the error performance.

The Tropical Rainfall Measuring Mission (TRMM) is a United States-Japan joint project to measure rainfall from space. The first spaceborne rain radar is aboard the TRMM satellite. Rain/no-rain discrimination for the TRMM provides useful information for on-line data processing, storage, and post-processing analysis. In this paper, rain/no-rain discrimination for the TRMM has been validated through simulation and theory for the no-rain condition and by comparison with the ground-based radar data for rain conditions.

The number of studies on adaptive antennas has greately increased in resent years in Japan. Most of these studies have sought to enhance the capacity and suppress multipath signals in wireless mobile communications. Adaptive antennas are expected to play an important role in future mobile radio systems. In this paper, we review the history and trends of adaptive antenna studies in Japan. We describe typical adaptive processing algorithms and contributions by Japanese researchers. We then introduce some applications of adaptive antennas for mobile communications. Furthermore, we discuss multi-dimensional signal processing, which is an extended version of the adaptive antenna.

Linear discriminant analysis (LDA) is a basic tool of pattern recognition, and it is used in extensive fields, e.g. face identification. However, LDA is poor at adaptability since it is a batch type algorithm. To overcome this, new algorithms of online LDA are proposed in the present paper. In face identification task, it is experimentally shown that the new algorithms are about two times faster than the previously proposed algorithm in terms of the number of required examples, while the previous algorithm attains better final performance than the new algorithms after sufficient steps of learning. The meaning of new algorithms are also discussed theoretically, and they are suggested to be corresponding to combination of PCA and Mahalanobis distance.

Sequence estimation (SE) of narrow-band digital FM signals, such as CPFSK and GMSK, with non-coherent limiter/discriminator (L/D) and integrate and dump (I&D) detection is investigated in detail using both analysis and simulation. The BER is studied from approximate upper and lower bounds obtained through Chernoff bounding techniques and minimum error event path probability along with a Gaussian noise assumption for high SNR. Various IF filters and the dependence of the error probability upon modulation index are considered. The results show an optimum modulation index around h 0.55, and clearly demonstrate the effectiveness and limitations of sequence estimation.

This paper describes a new optical label switching technique; wavelength and pilot tone frequency are combined to form labels that are used to control transport network routing. This technique is very attractive for achieving simple nodes that offer extremely rapid forwarding. Experimental results on the discrimination of optical labels and all-optical label conversion are also presented.

In this paper, a novel approach is proposed to identify the detailed typeface of Gothic characters in document images. The identification is performed by evaluating two types of typeface models, named the Gs-pattern and the Gd-pattern according to the principle of MDL. The typeface models are generated from the observed character image by using morphology and are viewed as approximating expressions of the observed character. Consequently, this method is unique in that it is free from both character recognition and dictionary lookup.

Many methods have been proposed to detect intrusions; for example, the pattern matching method on known intrusion patterns and the statistical approach to detecting deviation from normal activities. We investigated a new method for detecting intrusions based on the number of system calls during a user's network activity on a host machine. This method attempts to separate intrusions from normal activities by using discriminant analysis, a kind of multivariate analysis. We can detect intrusions by analyzing only 11 system calls occurring on a host machine by discriminant analysis with the Mahalanobis' distance, and can also tell whether an unknown sample is an intrusion. Our approach is a lightweight intrusion detection method, given that it requires only 11 system calls for analysis. Moreover, our approach does not require user profiles or a user activity database in order to detect intrusions. This paper explains our new method for the separation of intrusions and normal behavior by discriminant analysis, and describes the classification method by which to identify an unknown behavior.

This paper describes a new optical label switching technique; wavelength and pilot tone frequency are combined to form labels that are used to control transport network routing. This technique is very attractive for achieving simple nodes that offer extremely rapid forwarding. Experimental results on the discrimination of optical labels and all-optical label conversion are also presented.

Mass measurement system for the measurement of mass of substances placed in randomly vibrating circumstances has been developed. Mass measurement range was defined from 0 g to 400 g for the primary model with the measurement error of approximately 3% when randomly directional vibration of 6 m/sec2 acceleration was applied to the system.

The performance of a twisted-pair channel under ADSL environment is assumed to be dominated by far end crosstalk (FEXT) and additive white Gaussian noise (AWGN). In this paper, we study the channel capacity of the copper twisted pair and the optimum input power spectral density distribution at this channel capacity in the presence of ADSL environment. The channel capacity under different loop length and different input power will also be given. The simulation results show that the distribution of the optimum input power spectral density in the presence of AWGN and FEXT is not uniform. This is different from the situation where AWGN is the only interference, where the input power distribution is approximately uniform.

In this paper, we describe statistical properties of timing jitter of symbol timing recovery circuit for carrierless amplitude/phase modulation (CAP)-based very high-rate digital subscriber line (VDSL) system. Analytical expressions of the timing jitter for envelope-based timing recovery system, such as squarer-based timing recovery (S-TR) and absolute-value-based timing recovery (A-TR) schemes, are derived in the presence of additive white Gaussian noise (AWGN) or far-end crosstalk (FEXT). In particular, the analytical and simulation results of the timing jitter performance are presented and compared for a 51.84 Mb/s 16-CAP VDSL system. The A-TR system implemented digitally meets the DAVIC's VDSL system requirement, which specifies the maximum peak-to-peak jitter value of 1.5 nsec and the acquisition time of 20 msec.

This paper provides a normalized Iterative Feedback Tuning (IFT) method that assures the boundedness of the gradient vector estimate (ρ) and the Hessian matrix estimate without the assumption that the internal signals are bounded. The proposed method uses the unbiased Gauss-Newton direction by the addition of the 4-th experiment. We also present blended control criteria and a PID-like controller as new design choices. In examples, the normalized IFT method results in a good convergence although the internal signal or the measurement noise variance is large.

A speaker adaptation technique that maximizes the observation probability of an input speech is proposed. It is applied to semi-continuous hidden Markov model (SCHMM) speech recognizers. The proposed algorithm adapts the mean µ and the covariance Σ iteratively by the gradient search technique so that the features of the adaptation speech data could achieve maximum observation probabilities. The mixture coefficients and the state transition probabilities are adapted by the model interpolation scheme. The main advantage of this scheme is that the means and the variances, which are common to all states in SCHMM, are adapted independently from the other parameters of SCHMM. It allows fast and precise adaptation especially when there is a large acoustic mismatch between the reference model and a new speaker. Also, it is possible that this scheme could be adopted to other areas which use codebook. The proposed adaptation algorithm was evaluated by a male speaker-dependent, a female speaker-dependent, and a speaker-independent recognizers. The experimental results on the isolated word recognition showed that the proposed adaptation algorithm achieved 46.03% average enhancement in the male speaker-dependent recognizer, 52.18% in the female speaker-dependent recognizer, and 9.84% in the speaker-independent recognizer.

A broadcast distribution system (BDS) is a system for the distribution of digital contents over broadcast channel where the data supplier broadcasts the contents in encrypted form and gives each subscriber a decoder containing a secret decryption key. A traitor is a subscriber who offers the information which allows to decrypt the broadcast. When a pirate decoder is captured, if at least one traitor can be identified from it, a BDS is said to be traitor-tracing. If the data supplier can prevent subscribers from obtaining the contents without recalling their decoders, a BDS is said to be subscriber-excluding. In this paper, we propose an efficient BDS which is both subscriber-excluding and traitor-tracing. We use similar mathematics to a threshold cryptosystem. In the proposed BDS, the maximum number of excluded subscribers reaches the maximum number of traitors in a coalition for which at least one traitor can be identified. We prove that the proposed BDS is secure against ciphertext-only attack if and only if ElGamal cryptosystem is secure against the attack and the discrete logarithm problem is hard. The proposed BDS is the first one which satisfies all the following features: Both subscriber-excluding and traitor-tracing, identifying all the traitors, black box tracing and public key system.