The distributions of a spectral intensity of the breaking arc between silver contacts in DC 45-66 V/2.5-5.0 A circuits have been measured using a high-speed color video. As a result, a cathode brightening spot, which has a high spectral intensity, exists near the cathode surface. The cathode brightening spot expands with the increase of the contact gap, but its length expands until about 18µm. When the contact gap spreads over about 180 µm, a dark positive column appears and grows between the cathode brightening spot and the anode surface. The higher the interrupted current is, the larger the diameter of the cathode brightening spot will be. The maximum diameter of cathode brightening spot is 500 µm under these experiments.

A 14. 4-in. diagonal EL display with 640128 pixels has been developed in red/green multicolor structures by using a new phosphor layer consisting of Zn1-xMgxS:Mn and ZnS:Mn. The display is designed for 240 Hz-frame rate, enabling the luminance to be improved by a factor of two. In addition, the contrast ratio is strongly enhanced by optimizing the black background structure and color filters. Improved characteristics make it possible for the EL panel to meet the requirements for the public information display taking advantages of high-reliability, crisp image and wide-viewing angle. Furthermore, the possibility of full-color EL displays will be described on the basis of "color by white" approach.

This paper presents a variant of the "Third-Order Recursion (TOR)" method for bispectral estimation of transfer-function parameters of a non-minimum-phase all-poles system. The modification is based on the segmentation of system-output data into coupled records, instead of independent records. It consists of considering the available data at the left and the right of each record as not null and taking them as the data corresponding to the preceding and succeeding record respectively. The proposed variant can also be interpreted as a "Constrained Third-Order Mean (CTOM)" method with a new segmentation in overlap records. Simulation results show that this new segmentation procedure gives more precise system parameters than the TOR and CTOM methods, to be obtained. Finally, in order to justify the use of bispectral techniques, the influence of added white and colored Gaussian noise on the parameter estimation is also considered.

It is urgently required to protect copyrights of digital contents since the digital contents can be easily copied without degradation of quality. In this paper, we propose a new watermarking method which spreads an ID pattern with a random sequence and embeds it throughout the spatial domain of a color image. The random sequence is a key for extracting the ID pattern. As an ID pattern is spread throughout an image, we can extract the ID pattern from a part of the image, that is clipped image. We can also confirm authenticity by extracting the same ID pattern from several parts of an image. The proposed method is robust to disturbance by noise addition and image conversion such as brightness-contrast conversion and JPEG compression.

A method for reconstructing realistic 3D human faces from computer tomography images and color photographs is proposed in this paper. This can be linked easily with the underlying bone and soft tissue models. An iteration algorithm has been developed for automatically estimating the virtual camera parameters to match the projected 3D CT image with 2D color photographs using known point correspondence. An approach has been proposed to select landmarks using a mouse with minimum error. Six landmarks from each image have been selected for front face matching and five for each side face matching.

An efficient hybrid scheme has been developed for optimizing register allocation applicable to CISC and RISC processors, which is crucial for maximizing their execution speed. Graph-coloring at the function level is combined with a powerful local register assigner. This assigner uses accurate program flows and access patterns of variables, and optimizes a wider local range, called an extended basic-block (EBB), than other optimizing compilers. The EBB is a set of basic-blocks that constitute a tree-shaped control flow, which is suitable for the large nested branches that frequently appear in embedded system-control programs, such as those for telephone call processing. The coloring at the function level involves only the live-ranges of program variables that span EBBs. The interference graph is therefore very small even for large functions, so it can be constructed quickly. Instead of iterative live-range splitting or spilling, the unallocated live-ranges are optimized by the EBB-based register assigner, so neither load/store insertion nor code motion is needed. This facilitates generating reliable code and debug symbols. The information provided for the EBB-based assigner facilitates the priority-based heuristics, fine-grained interference checking, and deferred coloring, all of which increase the colorability. Using a thread-support package for CHILL as a sample program, performance measurement showed that local variables are successfully located in registers, and the reduction of static cycles is about 20-30%. Further improvements include using double registers and improving debuggability.

This paper proposes an object oriented face region detection and tracking method using range color information. Range segmentation of the objects are obtained from the complicated background using disparity histogram (DH). The facial regions among the range segmented objects are detected using skin-color transform technique that provides a facial region enhanced gray-level image. Computationally efficient matching pixel count (MPC) disparity measure is introduced to enhance the matching accuracy by removing the effect of the unexpected noise in the boundary region. Redundancy operations inherent in the area-based matching operation are removed to enhance the processing speed. For the skin-color transformation, the generalized facial color distribution (GFCD) is modeled by 2D Gaussian function in a normalized color space. Disparity difference histogram (DDH) concept from two consecutive frames is introduced to estimate the range information effectively. Detailed geometrical analysis provides exact variation of range information of moving object. The experimental results show that the proposed algorithm works well in various environments, at a rate of 1 frame per second with 512 480 resolution in general purpose workstation.

This paper proposes a dual port color palette SRAM using a single bit line cell. Since the single bit line cell consists of fewer bit lines and transistors than standard dual port cells, it is able to reduce the area. However, the cell has had a problem in writing a high level. The port swap architecture solves the problem without any special mechanism such as a boot strap. In the architecture, each of two bit lines is assigned to the read/write MPU port and the read only pixel port, respectively. When writing a low level, the MPU port uses pre-assigned bit line. On the other hand, when writing a high level, the MPU port uses the bit line assigned to the pixel port by a swap operation. During the swapping, the pixel port continues the read operation by using the bit line assigned to the MPU port. A color palette using this architecture is fabricated with a 0. 5 µm CMOS process technology. The memory cell size reduces by up to 43% compared with standard dual port cells. The color palette is able to supply the pixel data at 300 MHz at the supply voltage of 3.3 V. This speed is enough to support the practical highest resolution monitors in the world.

Multicolor light emitting diodes (LEDs) which emit red (R), green (G) and blue (B) light have been realized by stacking a two-color emission part on a single-color emission part. The former part consists of two emissive layers of red and blue light, which can be selected by changing the polarity of applied field. The latter part consists of a single-color emission part which emits green light. The emission from the diode in the whole visible spectral range can be modulated by the combination of applying various voltages to the two-color and to the single-color emission parts, separately.

In this paper, a new traffic sign detection algorithm and a symbol recognition algorithm are proposed. For a traffic sign detection, a dominant color transform is introduced, which serves as a tool of highlighting a dominant primary color, while discarding the other two primary colors. For a symbol recognition, the curvilinear shape distribution on a circle centered on the centroid of the symbol, called a circular pattern vector, is used as a spatial feature of the symbol. The circular pattern vector is invariant to scaling, translation, and rotation. As simulation results, the effectiveness of traffic sign detection and recognition algorithms are confirmed.

In order to investigate the nonlinearity and color responses of visual evoked potentials (VEPs), which have been useful in objectively detecting human color vision characteristics, a nonlinear system identification method was applied to VEPs elicited by isoluminant color stimuli, and the relationship between color stimuli and VEPs was examined. VEPs of normal subjects elicited by chromatically modulated stimuli were measured, and their binary kernels were estimated. Results showed that a system with chromatically modulated stimuli and VEP responses can be expressed by binary kernels up to the second order and that first- and second-order binary kernels depended on the color of the stimulus. The characteristics of second-order kernels reflected the difference between two chromatic channels. Opponent-color responses were included in first-order binary kernels, suggesting that they could be used as an index to test human color vision.

The construction of fault-tolerant processor arrays with interconnections of cube-connected cycles (CCCs) by using an advanced spare-connection scheme for k-out-of-n redundancies called "generalized additional bypass linking" is described. The connection scheme uses bypass links with wired OR connections to spare processing elements (PEs) without external switches, and can reconfigure complete arrays by tolerating faulty portions in these PEs and links. The spare connections are designed as a node-coloring problem of a CCC graph with a minimum distance of 3: the chromatic numbers corresponding to the number of spare PE connections were evaluated theoretically. The proposed scheme can be used for constructing various k-out-of-n configurations capable of quick broadcasting by using spare circuits, and is superior to conventional schemes in terms of extra PE connections and reconfiguration control. In particular, it allows construction of optimal r-fault-tolerant configurations that provide r spare PEs and r extra connections per PE for CCCs with 4x PEs (x: integer) in each cycle.

A neural network of massively interconnected digital neurons is presented for the total coloring problem in this paper. Given a graph G (V, E), the goal of this NP-complete problem is to find a color assignment on the vertices in V and the edges in E with the minimum number of colors such that no adjacent or incident pair of elements in V and E receives the same color. A graph coloring is a basic combinatorial optimization problem for a variety of practical applications. The neural network consists of (N+M) L neurons for the N-vertex-M-edge-L-color problem. Using digital neurons of binary outputs and range-limited non-negative integer inputs with a set of integer parameters, our digital neural network is greatly suitable for the implementation on digital circuits. The performance is evaluated through simulations in random graphs with the lower bounds on the number of colors. With a help of heuristic methods, the digital neural network of up to 530, 656 neurons always finds a solution in the NP-complete problem within a constant number of iteration steps on the synchronous parallel computation.

In the field of speech recognition, many researchers have proposed speech recognition methods using auditory information like acoustic signal or visual information like shape and motion of lips. Auditory information has valid features for speech recognition, but it is difficult to accomplish speech recognition in noisy environment. On the other side, visual information has advantage to accomplish speech recognition in noisy environment, but it is difficult to extract effective features for speech recognition. Thus, in case of using either auditory information or visual information, it is difficult to accomplish speech recognition perfectly. In this paper, we propose a method to fuse auditory information and visual information in order to realize more accurate speech recognition. The proposed method consists of two processes: (1) two probabilities for auditory information and visual information are calculated by HMM, (2) these probabilities are fused by using linear combination. We have performed speech recognition experiments of isolated words, whose auditory information (22.05kHz sampling, 8-bit quantization) and visual information (30-frame/s sampling, 24-bit quantization) are captured with multi-media personal computer, and have confirmed the validity of the proposed method.

We describe the implementation of an iterative method with the goal of gaining a long vector length. The strategy for vectorization by means of multipoint stencils used for discretization of the partial differential equations is discussed. Numerical experiments show that the strategy that requires certain restrictions on the number of grid points in the x and y directions improves the performance on the vector supercomputer.

To improve the demodulated signal-to-noise ratio, SNR, for colored noise environments, we present a new direct-sequence spread-spectrum receiver system, whose construction is based on the concept of Shaped M-sequence Demodulation (SMD). This receiver has the function for shaping the local dispreading-code waveform. This method can modify the frequency transfer function from a received input to the damp-integrated output according to the power spectrum of colored noise added in the transmission process. SMD performs the combined function of a whitening filter and a matched filter, which can be used to implement an optimum receiver. For the case when the additive colored-noise power spectrum is known and the transmission channel is non-band-limited, a design theory is derived that provides the maximum SNR by choosing the best dispreading-code sequence corresponding to a given signature spreading-code sequence. The noise power component produced in the receiver damp-integrated-output is anayzed by introducing the auto-correlation matrix of the additive noise. The SNR performance of systems, one using non-optimized codes and the other using optimized codes, is examined and compared for various noise models. It is verified by analysis and computer simulation that, compared to a conventional system using non-optimized codes, remarkable SNR improvements can be achieved due to the whitening effect acquired without producing inter-symbol interference. In contrast, if a transversal whitening filter is front-ended, it produces inter-frame interference, degrading the SNR performance. The band-limiting effect of the transmission channel is also analyzed, and we confirmed that the codes optimized for the non-band-limited channel can be applied to the band-limited channel with little degradation of SNR. SMD is inherently tolerant of fast-changing noise such as fading, due to its frame-by-frame operation. Considering this function as a general demodulation scheme, it may be called "Local Code Filtering."

In this paper partial response signalling and trellis coded modulation are considered together to improve bandwidth efficiency and error performance for M-QAM and denoted as Modified/Quadrature Partial Response-Trellis Coded Modulation (M/QPR-TCM) and two new non-catastrophic schemes M/6QPR-TCM and M/9QPR-TCM are introduced for 4QAM. In colored noise with correlation coefficient less than zero, the proposed schemes perform better than in AWGN case. Another interesting result is that when the combined system is used on a Rician fading channel, the bit error probability upper bounds of the proposed systems are better than their counterparts the 4QAM-TCM systems with 2 and 4 states, respectively, for SNR values greater than a threshold, which have the best error performance in the literature.

We investigated perceptual color assimilation of a strip (test field) displayed on a CRT close to a green or red strip (inducing field) with a dark background. The maximal distance to induce assimilation was about 7 for a red inducing field, and 24 for a blue one. The intensity of assimilation was almost inversely proportional to the width of test field.

Many combinatorial problems can be efficiently solved for partial k-trees (graphs of treewidth bounded by k). The edge-coloring problem is one of the well-known combinatorial problems for which no NC algorithms have been obtained for partial k-trees. This paper gives an optimal and first NC parallel algorithm to find an edge-coloring of any given partial k-tree with bounded degrees using a minimum number of colors. In the paper k is assumed to be bounded.

A method for painting a sequence of monochromatic images is proposed. In this method, a color model, whose base components are hue, saturation and intensity, is used to keep the lightness of images unchanged before and after painting. Two successive frames in the monochromatic image sequence and a colored image of the first frame which is interactively painted, are analyzed in order to paint the next monochromatic frame. The painting process is composed of two phases, that is, an automatic coloring phase and an interactive retouching phase. In the automatic coloring phase, hierarchical image segmentation and region matching procedures are performed, and the two attributes of hue and saturation are mapped from the painted image of the first frame to the next image. In the retouching phase, using an interactive paint system based on the color model, users can modify the chromatic components of pixels whose colors were not mapped correctly. Several experiments show that our method is very effective in reducing tedious painting.