Most of the traveller guidance services (TGS) are based on GPS technology and generally concerned with the position data mapping on the simplified 2D electronic map in order to provide macro level service facility such as drive direction notifications. Digital GIS based GPS entails in situ intuitive visualization. The visually enhanced TGS can improve the global and local awareness of unknown areas. In this paper, we propose a reliable new TGS system that provides 3D street as well as pin-pointed destination information in two stages of its interactive services; web-based and AR-based. The web server generates a guiding path on 2D digital map and displays 3D car-driving animation along the path. And, the AR-based service is embedded so that users can interactively obtain the detailed micro-level information of a specific section in the area with their fingertips. The implementation is based on autoformation of on-line GIS data structures from the available priori. For the verification, a 54 road network is selected as a test area. In the service demonstration, we show the effective awareness of street environments and the usefulness of this new TGS system.

In this paper, a novel projection-based method is presented to register partial 3D point clouds, acquired from a multi-view camera, for 3D reconstruction of an indoor scene. In general, conventional registration methods for partial 3D point clouds require a high computational complexity and much time for registration. Moreover, these methods are not robust for 3D point cloud which has a low precision. To overcome these drawbacks, a projection-based registration method is proposed. Firstly, depth images are refined based on both temporal and spatial properties. The former involves excluding 3D points with large variation, and the latter fills up holes referring to four neighboring 3D points, respectively. Secondly, 3D point clouds acquired from two views are projected onto the same image plane, and two-step integer mapping is applied to search for correspondences through the modified KLT. Then, fine registration is carried out by minimizing distance errors based on adaptive search range. Finally, we calculate a final color referring to the colors of corresponding points and reconstruct an indoor scene by applying the above procedure to consecutive scenes. The proposed method not only reduces computational complexity by searching for correspondences on a 2D image plane, but also enables effective registration even for 3D points which have a low precision. Furthermore, only a few color and depth images are needed to reconstruct an indoor scene. The generated model can be adopted for interaction with as well as navigation in a virtual environment.

In this paper, it is proved that there is a transformation between two types of nonlinear feedback shift register which can be regarded as implementation of the Bernoulli and tent maps with finite precision. This transformation can be interpreted as a sort of finite dimension version of topological conjugation between the Bernoulli and tent maps on continuous phase space. Several properties of periodic sequences generated from extended NFSRs are derived from the relation.

The present paper introduces a new construction of a class of binary sequence set having a zero-correlation zone (hereafter binary zcz sequence set). The cross-correlation function and the side-lobe of the auto-correlation function of the proposed sequence set is zero for the phase shifts within the zero-correlation zone. The present paper shows that such a construction generates a binary zcz sequence set by using a primitive linear recursion over GF(2), the finite field of integers modulo 2.

This paper presents a novel low-power register file based on adiabatic logic. The register file consists of a storage-cell array, address decoders, read/write control circuits, sense amplifiers, and read/write drivers. The storage-cell array is based on the conventional memory cell. All the circuits except the storage-cell array employ CPAL (complementary pass-transistor adiabatic logic) to recover the charge of large node capacitance on address decoders, bit-lines and word-lines in fully adiabatic manner. The minimization of energy consumption was investigated by choosing the optimal size of CPAL circuits for large load capacitance. The power consumption of the proposed adiabatic register file is significantly reduced because the energy transferred to the large capacitance buses is mostly recovered. The energy and functional simulations are performed using the net-list extracted from the layout. HSPICE simulation results indicate that the proposed register file attains energy savings of 65% to 85% as compared to the conventional CMOS implementation for clock rates ranging from 25 to 200 MHz.

Today, pedestrian navigation systems for mobile phones use 2-dimensional maps as a navigation media in general. But 3-dimensional maps or scenery images are easier to understand for users than 2-dimensional maps. To use 3-dimensional maps or scenery guidance, the measuring accuracy of user position is essential to understand guidance images. In this paper, we will present a pedestrian navigation system using real scenery photographs as a navigation media, and based on experiments we will report the evaluation result of influence of positioning accuracy on the understandability of navigation. It is shown that 3 meters or less error of positioning is tolerable for pedestrian navigation systems using scenery images.

We propose a unified view to deal with two formulations of image distortion and a method for estimating the distortion parameters for both of the formulations; So far the formulations have been developed separately. The proposed method is based on image registration and consists of nonlinear optimization to estimate parameters including view change and radial distortion. Experimental results demonstrate that our approach can deal with the two formulations simultaneously.

This paper proposes a time alignment control (TAC) for reducing an influence of multiple access interference (MAI) due to propagation delays (PDs) in uplink transmission from multiple mobile stations (MSs) to an access point (AP) for an orthogonal frequency division multiple access (OFDMA) based mobile communication system. In addition, this paper presents our evaluation of the proposed TAC as applied to dynamic parameter control orthogonal frequency and time division multiple access (DPC-OF/TDMA) which has been suggested for use in new generation mobile communication system. This paper also proposes several formats for an activation slot (ACTS) in which the GIs are lengthened in order to avoid the MAI because the TAC cannot be performed yet in an initial registration of the MSs. Computer simulation elucidates that lengthening the GIs of data symbols in the ACTS adequately to compensate a maximum delay improves the transmission performance of the ACTS at the initial registration without PDs compensation. The simulation also elucidates that the proposed TAC is performed to reduce the influence of the MAI effectively and that updating the estimates of the PDs every certain period is needed to compensate the PDs accurately under high-mobility environment.

Differential power analysis (DPA) might break implementations of elliptic curve cryptosystem (ECC) on memory constraint devices. Goubin proposed a variant of DPA using a point (0,y), which is not randomized in Jacobian coordinates or in an isomorphic class. This point often exists in standardized elliptic curves, and we have to care this attack. In this paper, we propose zero-value register attack as an extension of Goubin's attack. Note that even if a point has no zero-value coordinate, auxiliary registers might take zero value. We investigate these zero-value registers that cannot be randomized by the above randomization. Indeed, we have found several points P = (x,y) which cause the zero-value registers, e.g., (1) 3x2 + a = 0,(2) 5x4 + 2ax2 - 4bx + a2 = 0,(3) P is y-coordinate self-collision point, etc. We demonstrate the elliptic curves recommended in SECG that have these points. Interestingly, some conditions required for zero-value register attack depend on explicit implementation of addition formulae -- in order to resist this type of attacks, we have to care how to implement the addition formulae. Finally, we note that Goubin's attack and the proposed attack assume that a base point P can be chosen by attackers and a secret scalar d is fixed, so that they are not applicable to ECDSA.

A moment matrix analysis (MMA) method can derive macroscopic statistical properties such as moments, response time, and power spectra of non-linear equations without solving the equations. MMA expands a non-linear equation into simultaneous linear equations of moments, and reduces it to a linear equation of their coefficient matrix and a moment vector. We can analyze the statistical properties from the eigenvalues and eigenvectors of the coefficient matrix. This paper presents (1) a systematic procedure to linearize non-linear equations and (2) an expansion of the previous work of MMA to derive the statistical properties of various non-linear equations. The statistical properties of the logistic map were evaluated by using MMA and computer simulation, and it is shown that the proposed systematic procedure was effective and that MMA could accurately approximate the statistical properties of the logistic map even though such a map had strong non-linearity.

Based on Radon transform, a novel method for registering a periodic (self-referencing) watermark is presented. Although the periodic watermark is widely used as a countermeasure for affine transformation, there is no known efficient method to register it. Experimental results show that the proposed method is effective for registering the watermark from an image that had undergone both affine transformations and severe lossy compression.

There have been many researches on providing mobility under mobile/wireless environment. However, previous researches had several problems as disruption and unnecessary traffic. Disruption happens when messages are exchanged between nodes as registration is made after handoff, and unnecessary traffic occurs because of the use of Random-walk model, in which the probability for MN to move to the neighboring cells is equal. In order to solve these problems, this study proposes a technique and algorithm for composing Directional Shadow Registration Region (DSRR) that provides seamless mobility. The core of DSRR is to prevent disruption and unnecessary traffic by shadow registration at neighboring cells with a high probability of handoff (AAAF). We are introduced a cell division scheme and decided minimal DSRR. DSRR can sensed the optimal time for handoff through Regional Cell Division and applied Direction Vector (DV) obtained through Directional Cell Sectoring. According to the result of the experiment, the proposed DSRR processes message exchange between nodes within the intra-domain, the frequency of disruptions decreased significantly compared to that in previous researches held in inter-domain environment. In addition, traffic that occurs at every handoff happened twice in DSRR compared to n (the number of neighboring cells) times in previous researches.

For network computing on desktop machines, fast execution of Java bytecode programs is essential because these machines are expected to run substantial application programs written in Java. We believe higher Java performance can be achieved by exploiting instruction-level parallelism (ILP) in the context of Java JIT compilation. This paper introduces VLaTTe, a Java JIT compiler for VLIW machines that performs efficient scheduling while doing fast register allocation. It is an extended version of our previous JIT compiler for RISC machines called LaTTe whose translation overhead is low (i.e., consistently taking one or two seconds for SPECJVM98 benchmarks) due to its fast register allocation. VLaTTe adds the scheduling capability onto the same framework of register allocation, with a constraint for precise in-order exception handling which guarantees the same Java exception behavior with the original bytecode program. Our experimental results on the SPECJVM98 benchmarks show that VLaTTe achieves a geometric mean of useful IPC 1.7 (2-ALU), 2.1 (4-ALU), and 2.3 (8-ALU), while the scheduling/allocation overhead is 3.6 times longer than LaTTe's on average, which appears to be reasonable.

In order to perform the registration of virtual objects in vision-based augmented reality systems, the estimation of the relation between the real and virtual worlds is needed. This paper presents a three-point vision-based registration method for video see-through augmented reality systems using binocular cameras. The proposed registration method is based on a combination of monocular and stereoscopic registration methods. A correction method that performs an optimization of the registration by correcting the 2D positions in the images of the marker feature points is proposed. Also, an extraction strategy based on color information is put forward to allow the system to be robust to fast user's motion. In addition, a quantification method is used in order to evaluate the stability of the produced registration. Timing and stability results are presented. The proposed registration method is proven to be more stable than the standard stereoscopic registration method and to be independent of the distance. Even when the user moves quickly, our developed system succeeds in producing stable three-point based registration. Therefore, our proposed methods can be considered as interesting alternatives to produce the registration in binocular augmented reality systems when only three points are available.

In this paper, we examine the computational Diffie-Hellman problem and decisional Diffie-Hellman problem in 3-rd order linear feedback shift register and show that the shift register based Diffie-Hellman problems are equivalent to the Diffie-Hellman problems over prime subgroup of GF(p3e) respectively. This result will be useful in constructing new cryptographic primitives based on the hardness of the shift register based Diffie-Hellman problems.

This paper proposes a hardware/software cosynthesis algorithm for processors with heterogeneous registers. Given a CDFG corresponding to an application program and a timing constraint, the algorithm generates a processor configuration minimizing area of the processor and an assembly code on the processor. First, the algorithm configures a datapath which can execute several DFG nodes with data dependency at one cycle. The datapath can execute the application program at the least number of cycles. The branch and bound algorithm is applied and all the number of functional units and memory banks are tried. For an assumed number of functional units and memory banks, an appropriate number of heterogeneous registers and connections to functional units and registers are explored. The experimental results show effectiveness and efficiency of the algorithm.

In the past decade, significant effort has been made toward increasing the accuracy and robustness of three-dimensional scanning methods. In this paper, we present a new prototype vision system named 3D Model Studio, which has been built to reconstruct a complete 3D model in as less as a few minutes. New schemes for a probe calibration and a 3D data merging (axis consolidation) are employed. We also propose a new semi-automatic contour registration method to generate accurate contour model from 3D data points, along with a contour triangulation based surface reconstruction. Experimental result shows that our system works well for reconstructing a complete 3D surface model of a human body.

In the design of a set-associative cache, maintaining low average access time and reducing the average energy dissipation are important issues. In this paper, we propose a set-associative cache that can provide the flexibility to configure its associativity according to different program behaviors, which means that the proposed cache scheme can be configured from n-way set-associative cache to direct-mapped cache. Besides, the proposed cache scheme also can disable all tag-subarrays and only enable a desired data-subarray when adjacent memory references are within the same block as the previous access. By this scheme, the power consumption can be saved when an n-way set-associative cache configures the cache with lower associativity (less than n) due to only enabling fewer subarrays of the tag memory and data memory, and when the tag checking is eliminated for the intra-block access due to disabling all subarrays of the tag memory. However, the performance is still maintained to the same as the conventional set-associative cache or the direct-mapped cache.

In generating Frequency-Hopping (FH) sequences for Frequency Hopping Spread Spectrum Multiple Access (FH-SSMA) applications, binary maximal-length sequences (m-sequences) over GF(2m) have been preferred because of their characteristics of good Hamming correlation property, long period capability and high speed generation in association with simple hardware implementation based on Feedback Shift Registers (FSR). In practice, however, one difficulty of applying such sequences into the FH-SSMA communication systems with a wide bandwidth such as Military Satellite Communication (MilSatCom) is that the number of hopping frequency slots available may be far from a power of 2 in proportion to the spreading bandwidth. In that case, we can not make good use of the spreading bandwidth. In this paper, we propose a construction of some favorable FH sequences which deals effectively with the above difficulty using FSR and some nonlinear logic by introducing a re-mapping method. We show that the resulting sequences satisfy the (almost) uniform symbol distribution in one period and preserve a reasonably good Hamming correlation property so that they are appropriate for FH-SSMA applications.

This paper presents a high-accuracy image registration technique using a Phase-Only Correlation (POC) function. Conventional techniques of phase-based image registration employ heuristic methods in estimating the location of the correlation peak, which corresponds to image displacement. This paper proposes a technique to improve registration performance by fitting the closed-form analytical model of the correlation peak to actual two-dimensional numerical data. This method can also be extended to a spectrum weighting POC technique, where we modify cross-phase spectrum with some weighting functions to enhance registration accuracy. The proposed method makes possible to estimate image displacements with 1/100-pixel accuracy.