This paper presents a multi-resolution optical flow estimation method that is robust against large variation in the estimation parameter. For each level solution of the multi-grid estimation, a nonlinear iteration is proposed differently from the existing method, where the incremental displacement from the coarser level optical flow is calculated by linear iteration. The experimental results show that the proposed scheme has better error-performance in a much wider range of regularization parameters.

Identification of targets using sequential high range-resolution (HRR) radar signatures is studied. Classifiers are designed by using hidden Markov models (HMMs) to characterize the sequential information in multi-aspect HRR signatures. The higher-order moments together with the target dimension and the number of dominant wavefronts are used as features of the transient HRR waveforms. Classification results are presented for the ten-target MSTAR data set. The example results show that good classification performance and robustness are obtained, although the target features used here are very simple and compact compared with the complex HRR signatures.

An iterative method is proposed to solve integral equations (IEs) of the second kind with Picard-kernel in linear complexity, i.e.O(N). The particular IE considered describes the process of scattering of a plane wave incident on an inhomogeneous slab. The collocation method with triangle basis functions is used to derive a linear system of equations, which is solved for a test problem with the BiCGSTAB method. To reduce the number of iterations, an efficient preconditioning operator is introduced.

Novel high-frequency asymptotic solutions for the scattered fields by a dielectric circular cylinder with a radius of curvature sufficiently larger than the wavelength are presented in this paper. We shall derive the modified UTD (uniform Geometrical Theory of Diffraction) solution, which is applicable in the transition regions near the geometrical boundaries produced by the incident ray on the dielectric cylinder from the tangential direction. Also derived are the uniform geometrical ray solutions applicable near the geometrical boundaries and near the caustics produced by the ray family reflected on the internal concave boundary of the dielectric cylinder. The validity and the utility of the uniform solutions are confirmed by comparing with the exact solution obtained from the eigenfuction expansion.

In this paper, we propose a resolution enhancement method for estimating direction-of-arrival (DOA) of narrowband incoherent signals incident on a general array. The resolution of DOA algorithm is dependent on the aperture size of antenna array. But it is very impractical to increase the physical size of antenna array in real environment. We propose the method that improves resolution performance by virtually expanding the sensor spacing of original antenna array and then averaging the spatial spectrum of each virtual array which has a different aperture size. Superior resolution capabilities achieved with this method are shown by simulation results in comparison with the standard MUSIC for incoherent signals incident on a uniform circular array.

This paper proposed a watermarking algorithm for image, which assumed an image compression based on DWT (Discrete Wavelet Transform). To reduce the amount of computation, this algorithm selects the watermarking positions by a threshold table which is statistically established from computing the energy correlation of the corresponding wavelet coefficients. The proposed algorithm can operate in a real-time if the image compression process operates in a real-time because the watermarking process was designed to operate in parallel with the compression process. Also it improves the property of losing the watermak and reducing the compresson ratio by the quantization and Huffman coding steps. It was done by considering the sign of the coefficients and the change in the value for watermarking. Visually recognizable pattern such as a binary image were used as the watermark. The experimental results showed that the proposed algorithm satisfied the properties of robustness and imperceptibility that are the major conditions of watermarking.

We present a new method in multiresolution rendering of a complex object. Our method uses viewer-centered features including the silhouette in generating multiresolution model. Because the silhouette of an object depends on the position of the viewer, the silhouette has difficulties in real-time generation. We propose the AGSphere for real-time management of the silhouette. The AGSphere easily identifies silhouette parts and manages it in multiresolution manner. The primary applicable feature of the AGSphere is the silhouette from the viewer, but we can also use the AGSphere for other directional features like light silhouette. In this paper, we show experimental results for the silhouette either from the viewer or the light. The efficiency of the proposed method is compared with other methods. We also propose new texture map generation method to use with the multiresolution geometry. Generated texture map has valid mapping function for the multiresolution geometry minimizing texture distortions.

This paper describes an all-digital DLL (Delay Locked Loop) circuit with a high phase resolution. The proposed architecture is based on three-stage phase tuning blocks for coarse, fine and ultra fine phase control. Each block has a phase detector, a phase selection block and a delay line, respectively. It was simulated in a 0.35 µm CMOS technology under 3.3 V power supply. The simulation result shows the maximum phase error can be reduced to 13-42 ps with the operating range of 250 MHz to 800 MHz.

We propose Max-Plus Linear (MPL) systems with selective parameters that can describe a certain class of Timed Petri nets (TPN). In this class, selector and joint places are incorporated with Single-Input and Single-Output Timed Event Graph (SISO TEG) subnets. We confirm that the proposed controller effectively works taking into account practical constraints through a numerical example.

This paper deals with distributed procedures, caused by negation as failure through a network, where general logic programs are distributed so that they communicate with each other in terms of negation as failure inquiries and responses, but not in terms of derivations of SLD resolutions. The common variables as channels in share for distributed programs are not treated, but negation as failure validated in the whole network is the object for communications of distributed programs. We can define the semantics for the distributed programs in a network. At the same time, we have distributed proof procedures for distributed programs, by means of negation as failure to be implemented through the network, where the soundness of the procedure is guaranteed by the defined semantics.

The objective of this research is to compare the performance of the Matrix Pencil Method (MPM) and well known root-MUSIC algorithm for high resolution DOA estimation. Performance of each technique in terms of the probability of resolution and SNR in the presence of noise is investigated. Simulation results show that the MPM has a superior resolution to the root-MUSIC algorithm.

In this paper, a novel Wold decomposition algorithm is proposed to address the issue of deterministic component extraction for texture images. This algorithm exploits the wavelet-based singularity detection theory to process both harmonic a nd evanescent features from frequency domain. This exploitation is based on the 2D Lebesgue decomposition theory. When applying multiresolution analysis techniq ue to the power spectrum density (PSD) of a regular homogeneous random field, its indeterministic component will be effectively smoothed, and its deterministic component will remain dominant at coarse scale. By means of propagating these positions to the finest scale, the deterministic component can be properly extracted. From experiment, the proposed algorithm can obtain results that satisfactorily ensure its robustness and efficiency.

Finding DC operating points of transistor circuits is an important and difficult task. The Newton-Raphson method adopted in SPICE-like simulators often fails to converge to a solution. To overcome this convergence problem, homotopy methods have been studied from various viewpoints. For efficiency of globally convergent homotopy methods, it is important to give an appropriate initial solution as a starting point. However, there are few studies concerning such initial solution algorithms. In this paper, initial solution problems in homotopy methods are discussed, and an effective initial solution algorithm is proposed for globally convergent homotopy methods, which finds DC operating points of transistor circuits efficiently. Numerical examples using practical transistor circuits show the effectiveness of the proposed algorithm.

Although watermarking techniques have been extensively developed for natural videos, little progress is made in the area of graphics animation. Following the former successful MPEG-1 and MPEG-2 coding standards that provide efficient representations of natural videos, the emerging MPEG-4 standard incorporates new coding tools for 2D mesh animation. Graphics animation information is crucial for many applications and may need proper protection. In this paper, we develop a watermarking technique suitable for MPEG-4 2D mesh animation. The proposed method is based on the multiresolution analysis of 2D dynamic mesh. We perform wavelet transform on the temporal sequence of the node points to extract the significant spectral components of mesh movement, which we term the "feature motions. " A binary watermark invisibly resides in the feature motions based on the spread-spectrum principle. Before watermark detection, a spatial-domain least-squares registration technique is used to restore the possibly geometrically distorted mesh data. Each watermark bit is then detected by hard decision with cryptographically secure keys. We have tested the proposed method with a variety of attacks, including affine transformations, temporal smoothing, spectral enhancement and attenuation, additive random noise, and a combination of the above. Experimental results show that the proposed watermarks can withstand the aforementioned attacks.

This paper presents an imaging technique using the MUSIC algorithm to localize cylindrical reflectors in cross-borehole radar arrangements. Tomographic measurement, in which a transmitting and a receiving antenna are individually moved in separate boreholes, can be considered as a combination of a transmitting and a receiving array. A decorrelation technique with the transmitting array, which has been proposed for imaging point reflectors, is applied for imaging cylindrical reflectors using the MUSIC algorithm. Simulated and experimental results are shown to verify the validity of this algorithm for cylindrical targets. We analyze the evaluation error caused by the increase in the radius of the cylinder.

In this paper, we focus on how to correct address mapping violation, in which an attacker rewrites the address mapping table of a victim to perform a Man-in-the-Middle (MITM) attack. We propose a technique for preventing MITM attacks in which a malicious user intercepts and possibly alters the data transmitted between two hosts. MITM attack is hard for legitimate users to notice during their normal communication, because each user believes they are communicating directly. Address mapping violation can occur because of vulnerability of address resolution protocols, Address Resolution Protocol (ARP) in IPv4 and Neighbor Discovery (ND) protocol in IPv6. Accordingly, a good method to prevent MITM attack by address mapping violation is essential for both current and future communications, i.e. wireless networks with roaming users and an interconnected world. Hence, our proposal mainly aims to have high usability in future applications such as embedded devices.

In this paper, we propose a DOA (Direction Of Arrival) estimation method of speech signal using three microphones. The angular resolution of the method is almost uniform with respect to DOA. Our previous DOA estimation method using the frequency-domain array data for a pair of microphones achieves high precision estimation. However, its resolution degrades as the propagating direction being apart from the array broadside. In the method presented here, we utilize three microphones located at vertices of equilateral triangle and integrate the frequency-domain array data for three pairs of microphones. For the estimation scheme, the subspace analysis for the integrated frequency array data is proposed. Through both computer simulations and experiments in a real acoustical environment, we show the efficiency of the proposed method.

Conventional vector quantization (VQ) encoding method by full search (FS) is very heavy computationally but it can reach the best PSNR. In order to speed up the encoding process, many fast search methods have been developed. Base on the concept of multi-resolutions, the FS equivalent fast search methods using mean-type pyramid data structure have been proposed already in. In this Letter, an enhanced sum pyramid data structure is suggested to improve search efficiency further, which benefits from (1) exact computing in integer form, (2) one more 2-dimensional new resolution and (3) an optimal pair selecting way for constructing the new resolution. Experimental results show that a lot of codewords can be rejected efficiently by using this added new resolution that features lower dimensions and earlier difference check order.

Range resolution for radar is determined by bandwidth. One of the various super-resolution techniques for improving resolution is bandwidth extrapolation (BWE). In this technique, a linear prediction model is fitted to the data, and the model is used to extrapolate the bandwidth. In this paper, we extend BWE, and propose a new algorithm that we call polarimetric bandwidth extrapolation (PBWE) applicable to polarimetric radar data. We show through numerical simulations that utilization of fully polarimetric information allows PBWE to improve the resolution beyond the conventional BWE method. Some results of a physical simulation experiment using a W-band polarimetric FMCW radar and corner reflectors are shown to confirm the advantage of PBWE.

This paper examines the properties of the greatest subsolution for linear equations in the max-plus algebra. The greatest subsolution is a relaxed solution of the linear equations, and gives a unified and reasonable solution whether there exists a strict solution or not. Accordingly, it forms part of a key algorithm for deriving a control law in the field of controller design, and some effective controllers based on the greatest subsolution have been proposed. However, there remain several issues to be discussed regarding the properties of the greatest subsolution. Hence, the main focus of this paper is on the following fundamental properties: 1) Formulation as an optimization problem, 2) Uniqueness of the greatest subsolution, 3) Necessary and sufficient condition for the correspondence of the greatest subsolution with the strict solution. These results could provide flexibility of the controller design based on the greatest subsolution, and facilitate the performance evaluation of the controller. Finally, the uniqueness of the strict solution of the linear equations is examined, and it is confirmed through illustrative examples.