Conventional authentication methods, proposed mainly for gray-scale and color images, are not appropriate for palette images, which usually contain simple contents with a limited number of colors. In this paper, a new approach is proposed to verify the integrity of palette images and to locate tampered regions without re-quantization and re-indexing processes. The proposed approach is based on a combined use of both the fragile watermarking and the digital signature approaches, taking the advantages of both approaches and avoiding their drawbacks. To protect a block of an image, authentication signals are first generated according to a secret key. Based on an embeddability property defined in the study, the pixels of each block are classified as embeddable or non-embeddable. Only the former ones are used to embed the authentication signals. A corresponding digital signature is generated as well to compensate the possibly limited embedding capacity of the embeddable pixels that are insufficient in number. To authenticate a block, the recovered authentication signals, yielded from the extracted watermark and the received digital signature, are compared with the one generated according to the correct secret key, to prove the block's legitimacy. The effectiveness and the security of the proposed method are analyzed and tested with a variety of palette images. The results indicate that the proposed method can offer high authentication accuracy as well as maintain a good tradeoff between the authentication signal portability and the resulting image quality.

For an additive white Gaussian noise (AWGN) channel, a performance evaluation of parallel concatenated turbo trellis-coded modulation (turbo TCM) using bit-interleavers is reported. By obtaining weight distribution, the performance is evaluated by using a union bound method. Comparison between the result of evaluated performance and simulation results is shown, and the usefulness of the evaluated performance is shown. An optimum code and an optimum mapping are sought. The result of the optimum code with the optimum mapping is a new interleaver size N dependency which is proportional to N-3. It is better than the interleaver size dependency for Benedetto code with the natural mapping which is proportional to N-1. The reasons why these dependencies can happen are also discussed.

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.

The issues of comparing the similarity or dissimilarity (distance) between structures have been studied. Especially, several distances between trees and their efficient algorithms have been proposed. However, all of the tree distances are defined based on mapping between vertices only, and they are helpless to compare the tree structures whose vertices and edges hold information. In this paper, we will propose a mapping between rooted and unordered trees based on vertex translation and edge translation, and then define a distance based on proposed mapping, and develop an efficient algorithm for computing proposed distance. Proposed distance can be used to compare the similarity or distance between two natural language sentences.

We present a speaker adaptation method that makes it possible to determine articulatory parameters from an unknown speaker's speech spectrum using an HMM (Hidden Markov Model)-based speech production model. The model consists of HMMs of articulatory parameters for each phoneme and an articulatory-to-acoustic mapping that transforms the articulatory parameters into a speech spectrum for each HMM state. The model is statistically constructed by using actual articulatory-acoustic data. In the adaptation method, geometrical differences in the vocal tract as well as the articulatory behavior in the reference model are statistically adjusted to an unknown speaker. First, the articulatory parameters are estimated from an unknown speaker's speech spectrum using the reference model. Secondly, the articulatory-to-acoustic mapping is adjusted by maximizing the output probability of the acoustic parameters for the estimated articulatory parameters of the unknown speaker. With the adaptation method, the RMS error between the estimated articulatory parameters and the observed ones is 1.65 mm. The improvement rate over the speaker independent model is 56.1 %.

This letter evaluates the peak-to-average power ratio (PAR) performance in a space-time block coded (STBC) multicode CDMA (MC-CDMA) system using a selected mapping (SLM) approach. The ordinary method is to apply the SLM scheme for each transmit antenna individually, while the investigated SLM-based STBC MC-CDMA system selects the transmitted sequence with the lowest average PAR over all transmit antennas concurrently. SLM-based STBC MC-CDMA system retrieves the side information very accurately at the expense of a slight degradation of the PAR performance, which can improve the overall detection performance of the STBC MC-CDMA system in the presence of erroneous side information compared to the ordinary SLM approach.

In this paper, we introduce the following m-layered hard constrained convex feasibility problem HCF(m): Find a point u m, where 0:=H (a real Hilbert space), i: = arg min gi(i-1) and gi(u):=wi,jd 2(u,Ci,j) are defined for (i) nonempty closed convex sets Ci,jH and (ii) weights wi,j > 0 satisfying wi,j=1 (i {1,,m}, j {1,,Mi}. This problem is regarded as a natural extension of the standard convex feasibility problem: find a point u Ci, where Ci H (i {1,, M}) are closed convex sets. Unlike the standard problem, HCF(m) can handle the inconsistent case; i.e., i,j Ci,j = , which unfortunately arises in many signal processing, estimation and design problems. As an application of the hybrid steepest descent method for the asymptotically shrinking nonexpansive mapping, we present an algorithm, based on the use of the metric projections onto Ci,j, which generates a sequence (un) satisfying limn d(un,3) = 0 (for M1 = 1) when at least one of C1,1 or C2,j's is bounded and H is finite dimensional. An application of the proposed algorithm to the pulse shaping problem is given to demonstrate the great flexibility of the method.

In texture mapping, anisotropic filtering methods, which require more texels, have been proposed for high-quality images. Memory bandwidth, however, is still limited by a bottleneck in the texture-filtering hardware. In this paper, we propose anisotropic texture filtering based on edge function. In generating the weight that plays a key role in filtering texels loaded from memory, the edge function gives accurate contribution of texels to the pixel intensity. The quality of images is superior to other methods. For images of the same quality, our method requires less than half the texels of other methods. In other words, the improvement in performance is more than twice that of other methods.

We propose a simple and novel technique for mapping vector spatial fields using electro-optic (EO) sampling. Our technique utilizes a sandwich-like EO crystal in which a dielectric mirror is inserted into the EO crystal. Three-dimensional field measurements at several given heights above a two-dimensional RF resonant structure were successfully demonstrated. Field scanning at any height is possible if the sandwich-like EO crystal is appropriately constructed.

A mathematical theory is proposed based on the concept of functional analysis, suitable for operation of network systems extraordinarily complicated and diversified on large scales, through connected-block structures. Fundamental conditions for existence and evaluation of system behaviors of such network systems are obtained in a form of fixed point theorem for system of nonlinear mappings.

In this letter, a simple peak-to-average power ratio (PAPR) reduction scheme by using a cyclic-shifted sequence mapping is addressed in OFDM-CDMA systems. The PAPR reduction approach is very simple because of no additional complexity and no side information. Also, this simple approach can be easily combined with a modified selective mapping (SLM) approach, which outperforms the original SLM approach at the expense of one additional side information, guaranteeing approximately same transmitter complexity.

In many cryptographic applications, a large-order finite field is used as a definition field, and accordingly, many researches on a fast implementation of such a large-order extension field are reported. This paper proposes a definition field Fpm with its characteristic p a pseudo Mersenne number, the modular polynomial f(x) an irreducible all-one polynomial (AOP), and using a suitable basis. In this paper, we refer to this extension field as an all-one polynomial field (AOPF) and to its basis as pseudo polynomial basis (PPB). Among basic arithmetic operations in AOPF, a multiplication between non-zero elements and an inversion of a non-zero element are especially time-consuming. As a fast realization of the former, we propose cyclic vector multiplication algorithm (CVMA), which can be used for possible extension degree m and exploit a symmetric structure of multiplicands in order to reduce the number of operations. Accordingly, CVMA attains a 50% reduction of the number of scalar multiplications as compared to the usually adopted vector multiplication procedure. For fast realization of inversion, we use the Itoh-Tsujii algorithm (ITA) accompanied with Frobenius mapping (FM). Since this paper adopts the PPB, FM can be performed without any calculations. In addition to this feature, ITA over AOPF can be composed with self reciprocal vectors, and by using CVMA this fact can also save computation cost for inversion.

Probabilistic encryption becomes more and more important since its ability to against chosen-ciphertext attack. Applications like online voting schemes and one-show credentials are based on probabilistic encryption. Research on good probabilistic encryptions are on going, while many good deterministic encryption schemes are already well implemented and available in many systems. To convert any deterministic encryption scheme into a probabilistic encryption scheme, a randomized media is needed to apply on the message and carry the message over as an randomized input. In this paper, nonlinear codes obtained by certain mapping from linear error-correcting codes are considered to serve as such carrying media. Binary nonlinear codes obtained by Gray mapping from 4-linear codes are discussed as example for a such scheme.

Let us introduce n ( 2) nonlinear mappings fi (i = 1,2,,n) defined on complete linear metric spaces (Xi-1,ρ) (i = 1,2,,n), respectively, and let fi: Xi-1 Xi be completely continuous on bounded convex closed subsets Xi-1,(i = 1,2,,n 0), such that fi() . Moreover, let us introduce n fuzzy-set-valued nonlinear mappings Fi: Xi-1 Xi {a family of all non-empty closed compact fuzzy subsets of Xi}. Here, we have a fixed point theorem on the recurrent system of β-level fuzzy-set-valued mapping equations: xi Fiβ(xi-1,fi(xi-1)), (i = 1,2,,n 0), where the fuzzy set Fi is characterized by a membership function µFi(xi): Xi [0,1], and the β-level set Fiβ of the fuzzy set Fi is defined as Fiβ {ξi Xi | µFi(ξi) β}, for any constant β (0,1]. This theorem can be applied immediately to discussion for characteristics of ring nonlinear network systems disturbed by undesirable uncertain fluctuations and to fine estimation of available behaviors of those disturbed systems. In this paper, its mathematical situation and proof are discussed, in detail.

A mathematical theory is proposed, based on the concept of functional analysis, suitable for operation of network systems extraordinarily complicated and diversified on large scales, through connected-block structures. Fundamental conditions for existence and evaluation of system behaviors of such network systems are obtained in a form of fixed point theorem for system of nonlinear mappings.

In this paper, we describe our study on a novel high-frequency magnetic field probe based both on the BiRIG rotation magnetization (RM) phenomenon and the third-generation optical probing scheme. First, we explain our experimental investigation on RF sensitivity and frequency response of the RM-based Faraday effect in a commercially available Bi-substituted rare-earth iron garnet plate. Second, we report on the implementation of fiber-optic magneto-optic (MO) probe heads with bandwidths of 10 GHz or broader, which have been brought about by careful arrangement of the magnetization axis of a single-domain crystal and the highly sensitive fiber-edge optical probing scheme. Third, we describe a few RF magnetic field distribution measurements carried out successfully over GHz-band microstrip line circuits. The results of the study imply the substantial potential of the present MO probe head for the RF current visualization.

In this paper, to enhance the power efficiency a new simple space-time coding scheme is devised with application to the OFDM based Wireless LAN system. The basic idea is from the receiver's point of view and is referred to as Virtual Constellation Mapping (VCM). We designed a new combination of the channel coding (Turbo Code) along with multiple transmit antennas (Two antennas) to achieve transmit diversity and space division multiplexing transmission. Computer simulation results showed that with the same transmission data rate, our proposed scheme can achieve better bit error rate (BER) compared with the conventional space-time trellis coded OFDM scheme in high Doppler fading channels.

Construction of large-scale virtual environment is gaining more attentions for its applications in virtual mall, virtual sightseeing, tele-presence, etc. This paper presents a framework for building a realistic virtual environment from geometry-based approach. We propose an algorithm to construct a realistic 3-D model from multi-view range data and multi-view texture images. The proposed method tries to adopt the result of region segmentation of range images in some phases of the modeling process. It is shown that the relations obtained from region segmentation are quite effective in improving the result of registration as well as mesh merging.

A mapping circuit in order to have a wider input dynamic range is proposed. MOSFET's connecting between power supply lines are employed to construct the mapping circuit. SPICE simulation is shown to evaluate the proposed circuits. With the proposed mapping circuit, two-MOSFET subtractor has a rail-to-rail input voltage. As an application, an OTA consisting of subtractors is realized by employing the proposed mapping circuits to have a rail-to-rail input voltage range.

Let us introduce n ( 2) mappings fi (i=1,2,,n) defined on complete linear metric spaces (Xi-1, ρ) (i=1,2,,n), respectively, and let fi:Xi-1 Xi be completely continuous on bounded convex closed subsets Xi-1(0) Xi-1, (i=1,2,,n 0), such that fi(Xi-1(0)) Xi(0). Moreover, let us introduce n set-valued mappings Fi : Xi-1 Xi (Xi)(the family of all non-empty closed compact subsets of Xi), (i=1,2,,n 0). Here, we have a fixed point theorem on the successively recurrent system of set-valued mapping equations: xi Fi(xi-1, fi(xi-1)), (i=1,2,,n 0). This theorem can be applied immediately to analysis of the availability of system of circular networks of channels undergone by uncertain fluctuations and to evaluation of the tolerability of behaviors of those systems. In this paper, mathematical situation and detailed proof are discussed, about this theorem.