Image processing in transform domain has many advantages but it could be suffered from local effects such as a blocking artifact. In this paper, an image processing is performed by weighting coefficients in the compressed domain, i.e., filtering coefficients are appropriately selected according to the processing. Since we find the appropriate factors according to global image enhancement, blocking artifacts are reduced between inter-blocks. Experimental results show that the proposed technique has the advantages of simple computation and easy implementation.

In this paper, we treat visual secret sharing scheme (VSSS) for color images. We first evaluate the brightness of the decrypted color image under certain conditions on the mixture of colors. We obtain a general formula for the construction of VSSS using mixture of colors. We second propose an iterative algorithm for constructing VSSS in a practical situation. If we use the iterative construction, we have only to solve partial differential equations with small n even if n is actually large, where n denotes the number of participants. This iterative construction has never discussed in the both cases under the original images are black-white images and color images. Finally, we propose the way to embed a color image on each share for the case that the original image is color.

In this paper, four coupled chaotic circuits generating four-phase quasi-synchronization of chaos are proposed. By tuning the coupling parameter, chaotic wandering over the phase states characterized by the four-phase synchronization occurs. In order to analyze chaotic wandering, dependent variables corresponding to phases of solutions in subcircuits are introduced. Combining the variables with hysteresis decision of the phase states enables statistical analysis of chaotic wandering.

Technique of Measuring 3-D velocity vector components is important for the correct diagnosis of the blood flow pattern and quantitative assessment of intratumor perfusion. However, present equipment based on ultrasonic Doppler can not provide us true 3-D velocity. To overcome the problem, we previously proposed a new method of 3-D velocity vector measurement. The method uses 2-D array probe and enable us to obtain three components of velocity vector with real time by integrating the Doppler phase shift on the each element with the relative small single aperture compared with conventional method. Basic performance of the method has been evaluated by computer simulation. In this paper, to evaluate the feasibility of the proposed method, experimental investigation using a simple ring array probe and a phantom were carried out. Three components of velocity vector for different velocity magnitude and flow direction were measured. Experimental results validated its ability of measuring 3-D velocity and its feasibility.

We summarize recent studies on performance improvement in the correlation-based continuous-wave technique for optical fiber distributed strain measurement using Brillouin scattering, that had been proposed previously. The correlation-based technique enables the spatial resolution of 1 cm, which is difficult for conventional sensing techniques using Brillouin scattering to achieve. Though the correlation-based technique left a problem with measurement range, we have proposed methods to overcome it with keeping high spatial resolution. In addition, we verified usefulness of the technique for smart materials by measuring strain distribution along surface of a ring structure.

This paper proposes a new method to recover the sign of local Gaussian curvature from multiple (more than three) shading images. The information required to recover the sign of Gaussian curvature is obtained by applying Principal Components Analysis (PCA) to the normalized irradiance measurements. The sign of the Gaussian curvature is recovered based on the relative orientation of measurements obtained on a local five point test pattern to those in the 2-D subspace called the eigen plane. Using multiple shading images gives a more accurate and robust result and minimizes the effect of shadows by allowing a larger area of the visible surface to be analyzed compared to methods using only three shading images. Furthermore, it allows the method to be applied to specular surfaces. Since PCA removes linear correlation among images, the method can produce results of high quality even when the light source directions are not widely dispersed.

Footprint assembly was proposed to reduce the blurriness of texture mapped image by mipmapping. Even though it can improve the quality of texture mapped image, there are yet blurring due to the limitation of it's filter kernel. This paper proposes a novel texture filtering, called adaptive footprint assembly (AFA), to overcome the limitation of footprint assembly. The proposed method greatly improves the quality of texture mapped images.

This paper describes the adaptability of communication software through a biologically-inspired policy coordination. Many research efforts have developed adaptable systems that allow various users or applications to meet their specific requirements by configuring different design and optimization policies. Navigating through many policies manually, however, is tedious and error-prone. Developers face the significant manual and ad-hoc work of engineering an system. In contrast, we propose to provide autonomous adaptability in communication endsystem with OpenWebServer/iNexus, which is both a web server and an object-oriented framework to tailer various web services and applications. The OpenWebServer's modular architecture allows to abstract and maintain a wide range of aspects in a HTTP server, and reconfigure the system by adding, deleting, changing, or replacing their policies. iNexus is a tool for automated policy-based management of OpenWebServer. Its design is inspired by the natural immune system, particularly immune network, a truly autonomous decentralized system. iNexus inspects the current system condition of OpenWebServer periodically, measures the delivered quality of service, and selects suitable set of policies to reconfigure the system dynamically by relaxing constraints between them. The policy coordination process is performed through decentralized interactions among policies without a single point of control, as the natural immune system does. This paper discusses communication software can evolve continuously in the piecemeal way with biological concepts and mechanisms, adapting itself to ever-changing environment.

We present a method for estimating activities of multiple, interacting objects detected by a video surveillance system. The activities are described in a stochastic context because our method is concerned with humans and uses noisy features detected from video. To monitor activities in this context, we introduce the concept of an attribute set for each blob, consisting of object type, action, and interaction. Using probabilistic relations introduced by a specific Markov model of these attribute sets, the activity descriptions are estimated from surveillance video.

In this paper, genetic algorithms is employed to determine the shape of a conducting cylinder buried in a half-space. Assume that a conducting cylinder of unknown shape is buried in one half-space and scatters the field incident from another half-space where the scattered filed is measured. Based on the boundary condition and the measured scattered field, a set of nonlinear integral equations is derived and the imaging problem is reformulated into an optimization problem. The genetic algorithm is then employed to find out the nearly global extreme solution of the object function such that the shape of the conducting scatterer can be suitably reconstructed. In our study, even when the initial guess is far away from the exact one, the genetic algorithm can avoid the local extremes and converge to a reasonably good solution. In such cases, the gradient-based methods often get stuck in local extremes. Numerical results are presented and good reconstruction is obtained both with and without the additive Gaussian noise.

Tree canopies contain various scattering elements such as leaves, branches and trunks, which contribute to complex backscattering, depending on frequency and polarization. In this paper, we propose to use the polarimetric correlation coefficient for classifying trees, forests, and vegetations. The polarimetric correlation coefficient can be derived by the elements of Sinclair scattering matrix. Since the scattering matrix can be defined in any polarization basis, we examined the coefficient in the linear HV, circular LR, and optimum polarization bases. First, the change of correlation coefficient inside trees along the range direction is examined using small trees in a laboratory. The wider the range, the better the index. The coefficient defined in the LR polarization basis showed the largest change within tree canopy, which also contribute to retrieve scattering mechanism. Second, this index for discrimination is applied to polarimetric SAR data sets (San Francisco and Briatia area) acquired by AIRSAR and SIR-C/X-SAR. It is shown that polarimetric correlation coefficient in the LR basis best serves to distinguish tree types.

Reactive sputtering of a metallic target in DC planar magnetron discharge shows a drastic mode transition between metallic and oxide modes. To describe the experimental results quantitatively, a new reactive sputtering model including the secondary electron emission coefficient of a target has been developed. The model is based on a simple reactive gas balance model proposed by Berg et al., and can quantitatively describe experimental results such as the oxygen flow rate dependence of deposition rate and discharge, observed for MgO sputter-deposition.

In this letter, blind adaptive H multiuser detection is developed by employing a generalized sidelobe canceler (GSC) with and without subweight partition scheme. It is shown that the adaptive H algorithm with subweight approach has the advantages of fast convergence speed, insensitivity of dynamic estimate error, and suitability for arbitrary ambient noise over the conventional H and the RLS-based adaptive algorithms.

This work provides a generalization of structural logic optimization methods to general boolean networks. This generalization is based on a functional description of the nodes in the network. Therefore, this approach is no longer restricted to networks that consist of simple gates. Within this framework, we present necessary and sufficient conditions to identify all the possible functional expansions of a node that allow to eliminate a wire elsewhere in the network. These conditions are also given for the case of multiple variable expansion, providing an incremental mechanism to perform functional transformations involving any number of variables that can be applied in a very efficient manner. On the other hand, we will show in this paper that relevant simplifications can be obtained when this framework is applied to the particular case of AND-OR-NOT networks, resulting in important savings in the computational effort. When compared to previous approaches, the experimental results show an important reduction in the number of computations required.

The legal firing sequence problem of Petri nets (LFS) is one of fundamental problems in the analysis of Petri nets, because it appears as a subproblem of various basic problems. Since LFS is shown to be NP-hard, various heuristics has been proposed to solve the problem of practical size in a reasonable time. In this paper, we propose a new algorithm for this problem. It is based on the partial order verification technique, and reduces redundant branches in the search tree. Moreover, the proposed algorithm can be combined with various types of heuristics.

An advanced spare-connection scheme for K-out-of-N redundancy is proposed for constructing fault-tolerant ring- or toroidal mesh-connected processing-node arrays able to enhance emulation of binary hypercubes by using bypass networks. With this scheme, a component redundancy configuration for a base array with a fixed number of primary nodes, such as that for 8-node ring or 32-node toroidal mesh, can be constructed by using bypass links with a segmented bus structure to selectively connect the primary nodes to a spare node in parallel. These bypass links are allocated to the primary nodes by graph-node coloring with a minimum inter-node distance of three in order to use the bypass links as the hypercube connections as well as to attain strong fault tolerance for reconfiguring the base array with the primary network topology. An extended redundancy configuration for a large fault-tolerant array can be constructed by connecting the component configurations by using external switches of a hub type provided at the bus nodes of the bypass links. This configuration has a network topology of the parallel star-connections of sub-hypercubes whose diameter is smaller than that of the regular hypercube.

In an optical fiber ring topology network such as FDDI (Fiber Distributed Data Interface) rings and SONET (Synchronous Optical Network) rings, the number of consecutively bypassed failed stations is limited by the optical power loss constraint. In recent years, this situation was represented as a consecutive k-out-of-n:F system and the two-terminal reliability was presented in the literature, but K-terminal reliability has not been presented. In this paper, we obtain K-terminal reliability expressions for dual-counter rotating networks (DR's) that use both self-heal and station-bypass switches in which all components (stations, links and bypass switches) can fail. The results are useful in evaluating the reliabilities of FDDI ring networks parametrically and making reliability comparisons. This method can be used to obtain a closed-form reliability expression in a more general ring-network such as 'ring of trees. '

In this paper, we propose a new clock tree synthesis method for semi-synchronous circuits. A clock tree obtained by the proposed method is a multi-level multi-way clock tree such that a clock-input timing of each register is a multiple of a predefined unit delay and the wire length from a clock buffer to an element driven by it is bounded. The clock trees are constructed for several practical circuits. The size of constructed clock tree is comparable to a zero skew clock tree. In order to assure the practical quality of the clock trees, they are examined under the five delay conditions, which cover various environmental and manufacturing conditions. As a result, they are proved stable under each condition and improve the clock speed up to 17.3% against the zero skew clock trees.

Using a point matching method, we have numerically analyzed resonance frequencies and unloaded Q factor of whispering gallery modes in a millimeter wave region that are well known as an intrinsic mode of a dielectric disk resonator. We express field distributions of the resonance modes by a summation of spherical waves. Tangential electromagnetic fields inside the disk are matched to those outside the disk at appropriate matching points on a boundary. As the result, a 4N 4N (N; number of matching points) determinant is derived as an eigenvalue equation of the disk resonator. Since elements of the determinant are complex numbers, a complex angular frequency is introduced to make a value of the determinant zero. For a location of the matching points, we also introduce a new technique which is derived from a field expression of the whispering gallery modes. Since an azimuthal angle dependence of the field distributions with a resonance mode number m is presented by the associated Legendre function Pnm(cos θ), we define abscissas θi of the matching points as solutions of Pm+2N-1m (cos θ) = 0. Considering the field symmetry, we also modify the eigenvalue equation to a new eigenvalue equation which is expressed (4N - 2) (4N - 2) determinant. From the results of our numerical analysis, we can find that the resonance frequencies and unloaded Q factor well converge for number of matching points N. A comparison of numerical results and experimental ones, in a millimeter wave band (50 - 100 GHz), shows a good agreement with each other. It is found that our analysis is effective for practical use in the same wave band.

A periodic approach introduced previously is applied to the TM wave scattering from a finite periodic surface. A mathematical relation is proposed to estimate the scattering amplitude from the diffraction amplitude for the periodic surface, where the periodic surface is defined as a superposition of surface profiles generated by displacing the finite periodic surface by every integer multiple of the period . From numerical examples, it is concluded that the scattering cross section for the finite periodic surface can be well estimated from the diffraction amplitude for a sufficiently large .