The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] projection(144hit)

81-100hit(144hit)

  • Proposal of Two-Dimensional Self-Matching Receiver Using Chaotic Spatial Synchronization for Free Space Optics Communication System and Its Application to Image Transmission and Code Division Multiplexing

    Shinya TAKEDA  Takeshi HIGASHINO  Katsutoshi TSUKAMOTO  Shozo KOMAKI  

     
    PAPER

      Vol:
    E90-C No:2
      Page(s):
    389-396

    This paper proposes a two-dimensional self-matching receiver for Free Space Optics (FSO) communication system using chaotic spatial synchronization. This system is able to obtain the information of two-dimensional code from received pattern. This paper considers that proposed system is applied to two applications. The first application is image transmission. This paper shows that applying proposed system to image transmission enables to restore the desired image, which doesn't require strict alignment of receiver, and evaluates transmission optical power. The second application is Code Division Multiplexing (CDM). This paper shows that applying proposed system to CDM system enables to demodulate desired digital signals regardless of the uncertainty of received position. Moreover, the required transmission optical power and bit error rate performance are obtained by computer simulation.

  • Inpainting Highlights Using Color Line Projection

    Joung Wook PARK  Kwan Heng LEE  

     
    PAPER

      Vol:
    E90-D No:1
      Page(s):
    250-257

    In this paper we propose a novel method to inpaint highlights and to remove the specularity in the image with specular objects by the color line projection. Color line projection is the method that a color with a surface reflection component is projected near the diffuse color line by following the direction of the specular color line. We use two captured images using different exposure time so that the clue of the original color in a highlight area is searched from two images since the color at the highlight region is distorted and saturated to the illumination color. In the first step of the proposed procedure, the region corresponding to the highlight is generated and the clue of the original highlight color is acquired. In the next step, the color line is generated by the restricted region growing method around the highlight region, and the color line is divided into the diffuse color line and the specular color line. In the final step, pixels near the specular color line are projected onto near the diffuse color line by the color line projection, in which the modified random function is applied to realistically inpaint the highlight. One of advantages in our method is to find the highlight region and the clue of the original color of the highlight with ease. It also efficiently estimates the surface reflection component which is utilized to remove specularity and to inpaint the highlight. The proposed method performs the highlight inpainting and the specular removal simultaneously once the color line is generated. In addition, color line projection with the modified random function can make the result more realistic. We show experimental results from the real images and make a synthesis of the real image and the image modified by the proposed method.

  • Semi-Supervised Classification with Spectral Subspace Projection of Data

    Weiwei DU  Kiichi URAHAMA  

     
    LETTER-Pattern Recognition

      Vol:
    E90-D No:1
      Page(s):
    374-377

    A semi-supervised classification method is presented. A robust unsupervised spectral mapping method is extended to a semi-supervised situation. Our proposed algorithm is derived by linearization of this nonlinear semi-supervised mapping method. Experiments using the proposed method for some public benchmark data reveal that our method outperforms a supervised algorithm using the linear discriminant analysis for the iris and wine data and is also more accurate than a semi-supervised algorithm of the logistic GRF for the ionosphere dataset.

  • LSI Design Flow for Shot Reduction of Character Projection Electron Beam Direct Writing Using Combined Cell Stencil

    Taisuke KAZAMA  Makoto IKEDA  Kunihiro ASADA  

     
    PAPER-Physical Design

      Vol:
    E89-A No:12
      Page(s):
    3546-3550

    We propose a shot reduction technique of character projection (CP) Electron Beam Direct Writing (EBDW) using combined cell stencil (CCS) or the advanced process technology. CP EBDW is expected both to reduce mask costs and to realize quick turn around time. One of major issue of the conventional CP EBDW, however, is a throughput of lithography. The throughput is determined by numbers of shots, which are proportional to numbers of cell instances in LSIs. The conventional shot reduction techniques focus on optimization of cell stencil extraction, without any modifications on designed LSI mask patterns. The proposed technique employs the proposed combined cell stencil, with proposed modified design flow, for further shot reduction. We demonstrate 22.4% shot reduction within 4.3% area increase for a microprocessor and 28.6% shot reduction for IWLS benchmarks compared with the conventional technique.

  • Projection Based Adaptive Window Size Selection for Efficient Motion Estimation in H.264/AVC

    Anand PAUL  Jhing-Fa WANG  Jia-Ching WANG  An-Chao TSAI  Jang-Ting CHEN  

     
    PAPER

      Vol:
    E89-A No:11
      Page(s):
    2970-2976

    This paper introduces a block based motion estimation algorithm based on projection with adaptive window size selection. The blocks cannot match well if their corresponding 1D projection does not match well, with this as foundation 2D block matching problem is translated to a simpler 1D matching, which eliminates majority of potential pixel participation. This projection method is combined with adaptive window size selection in which, appropriate search window for each block is determined on the basis of motion vectors and prediction errors obtained for the previous block, which makes this novel method several times faster than exhaustive search with negligible performance degradation. Encoding QCIF size video by the proposed method results in reduction of computational complexity of motion estimation by roughly 45% and over all encoding by 23%, while maintaining image/video quality.

  • Space-Time Invariants for Recognizing 3D Motions from Arbitrary Viewpoints under Perspective Projection

    Ying PIAO  Kazutaka HAYAKAWA  Jun SATO  

     
    PAPER-Image Recognition, Computer Vision

      Vol:
    E89-D No:7
      Page(s):
    2268-2274

    Extracting visual motion is very important for understanding dynamic actions and for extracting dynamic events from video sequences. Recently, it was shown that some invariants on motions can be extracted from sequential images and applied for recognizing motions from images viewed from arbitrary viewpoints. Unfortunately, these space-time invariants were limited for planar motions viewed from affine cameras. In this paper, we propose a method for computing space-time invariants on non-planar motions viewed from two perspective cameras. The extracted invariants are applied for distinguishing 3D motions from video sequences viewed from arbitrary viewpoints.

  • Subband Adaptive Filtering with Maximal Decimation Using an Affine Projection Algorithm

    Hun CHOI  Sung-Hwan HAN  Hyeon-Deok BAE  

     
    PAPER-Fundamental Theories for Communications

      Vol:
    E89-B No:5
      Page(s):
    1477-1485

    Affine projection algorithms perform well for acoustic echo cancellation and adaptive equalization. Although these algorithms typically provide fast convergence, they are unduly complex when updating the weights of the associated adaptive filter. In this paper, we propose a new subband affine projection (SAP) algorithm and a facile method for its implementation. The SAP algorithm is derived by combining the affine projection algorithm and the subband adaptive structure with the maximal decimation. In the proposed SAP algorithm, the derived weight-updating formula for the subband adaptive filter has a simple form as compared with the normalized least mean square (NLMS) algorithm. The algorithm gives improved convergence and reduced computational complexity. The efficiency of the proposed algorithm for a colored input signal is evaluated experimentally.

  • Cell Library Development Methodology for Throughput Enhancement of Character Projection Equipment

    Makoto SUGIHARA  Taiga TAKATA  Kenta NAKAMURA  Ryoichi INANAMI  Hiroaki HAYASHI  Katsumi KISHIMOTO  Tetsuya HASEBE  Yukihiro KAWANO  Yusuke MATSUNAGA  Kazuaki MURAKAMI  Katsuya OKUMURA  

     
    PAPER-CAD

      Vol:
    E89-C No:3
      Page(s):
    377-383

    We propose a cell library development methodology for throughput enhancement of character projection equipment. First, an ILP (Integer Linear Programming)-based cell selection is proposed for the equipment for which both of the CP (Character Projection) and VSB (Variable Shaped Beam) methods are available, in order to minimize the number of electron beam (EB) shots, that is, time to fabricate chips. Secondly, the influence of cell directions on area and delay time of chips is examined. The examination helps to reduce the number of EB shots with a little deterioration of area and delay time because unnecessary directions of cells can be removed. Finally, a case study is shown in which the numbers of EB shots are shown for several cases.

  • Registration of Partial 3D Point Clouds Acquired from a Multi-view Camera for Indoor Scene Reconstruction

    Sehwan KIM  Woontack WOO  

     
    PAPER

      Vol:
    E89-D No:1
      Page(s):
    62-72

    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.

  • Optimal Sampling Operator for Signal Restoration in the Presence of Signal Space and Observation Space Noises

    Aqeel SYED  Hidemitsu OGAWA  

     
    PAPER-Image Processing and Video Processing

      Vol:
    E88-D No:12
      Page(s):
    2828-2838

    The partial projection filter (PTPF) for a given observation operator provides an optimal signal restoration in the presence of both the signal space and observation space noises. However, restoration error by the filter still depends on the observation operator which consists of measurement and sampling processes. In this paper, we determine a sampling operator which minimizes the restoration error by the PTPF. We see that under some assumptions about noise statistics, the restoration error by the PTPF is divided into two terms corresponding to the error arising from the signal space noise and that from the observation space noise. It has been found that although the restoration error due to the signal space noise is independent of the sampling operator, the restoration error arising from the observation space noise can arbitrarily be decreased by increasing the number of sample points in the proposed sampling operator. An illustrative example of optimal sampling in the trigonometric polynomial space is also given.

  • Perturbation Approach for Order Selections of Two-Sided Oblique Projection-Based Interconnect Reductions

    Chia-Chi CHU  Ming-Hong LAI  Wu-Shiung FENG  

     
    LETTER

      Vol:
    E88-A No:12
      Page(s):
    3573-3576

    An order selection scheme for two-sided oblique projection-based interconnect reduction will be investigated. It will provide a guideline for terminating the conventional nonsymmetric Pade via Lanczos (PVL) iteration process. By exploring the relationship of the system Grammians of the original network and those of the reduced network, it can be shown that the system matrix of the reduced-order system generated by the two-sided oblique projection can also be expressed as those of the original interconnect model with some additive perturbations. The perturbation matrix only involves bi-orthogonal vectors at the previous step of the nonsymmetric Lanczos algorithm. This perturbation matrix will provide the stopping criteria in the order selection scheme and achieve the desired accuracy of the approximate transfer function.

  • A Fast Algorithm for the Sound Projection Using Multiple Sources

    Yuan WEN  Woon-Seng GAN  Jun YANG  

     
    LETTER

      Vol:
    E88-A No:7
      Page(s):
    1765-1766

    An algorithm for the sound projection using multiple sources is presented. The source strength vector is obtained by using a fast estimation approach instead of the conventional eigenvalue decomposition (EVD) method. The computation load is therefore greatly reduced, which makes the algorithm more efficient in practical applications.

  • Immersive Multi-Projector Display on Hybrid Screens with Human-Scale Haptic Interface

    Seungzoo JEONG  Naoki HASHIMOTO  Makoto SATO  

     
    PAPER

      Vol:
    E88-D No:5
      Page(s):
    888-893

    Many immersive displays developed in previous researches are strongly influenced by the design concept of the CAVE, which is the origin of the immersive displays. In the view of human-scale interactive system for virtual environment (VE), the existing immersive systems are not enough to use the potential of a human sense further extent. The displays require more complicated structure for flexible extension, and are more restrictive to user's movement. Therefore we propose a novel multi-projector display for immersive VE with haptic interface for more flexible and dynamic interaction. The display part of our system named "D-vision" has a hybrid curved screen which consist of compound prototype with flat and curve screen. This renders images seamlessly in real time, and generates high-quality stereovision by PC cluster and two-pass technology. Furthermore a human-scale string-based haptic device will integrate with the D-vision for more interactive and immersive VE. In this paper, we show an overview of the D-vision and technologies used for the human-scale haptic interface.

  • Block Adaptive Beamforming via Parallel Projection Method

    Wen-Hsien FANG  Hsien-Sen HUNG  Chun-Sem LU  Ping-Chi CHU  

     
    PAPER-Antennas and Propagation

      Vol:
    E88-B No:3
      Page(s):
    1227-1233

    This paper addresses a simple, and yet effective approach to the design of block adaptive beamformers via parallel projection method (PPM), which is an extension of the classic projection onto convex set (POCS) method to inconsistent sets scenarios. The proposed approach begins with the construction of the convex constraint sets which the weight vector of the adaptive beamformer lies in. The convex sets are judiciously chosen to force the weights to possess some desirable properties or to meet some prescribed rules. Based on the minimum variance criterion and a fixed gain at the look direction, two constraint sets including the minimum variance constraint set and the gain constraint set are considered. For every input block of data, the weights of the proposed beamformer can then be determined by iteratively projecting the weight vector onto these convex sets until it converges. Furnished simulations show that the proposed beamformer provides superior performance compared with previous works in various scenarios but yet in general with lower computational overhead.

  • An Iterative Hyperplane Projection Based Affine Projection Algorithm for Fast Converging Space-Time Adaptive Decision-Directed Equalizer

    Won-Cheol LEE  Chul RYU  Jin-Ho PARK  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E87-B No:12
      Page(s):
    3673-3681

    This paper introduces an efficient affine projection algorithm (APA) using iterative hyperplane projection. The inherent effectiveness against the rank deficient problem has led APA to be the preferred algorithm to be employed for various applications over other variety of fast converging adaptation algorithms. However, the amount of complexity of the conventional APA could not be negligible because of the accomplishment of sample matrix inversion (SMI). Another issue is that the "shifting invariance property," which is typically exploited for single channel case, does not hold ground for space-time decision-directed equalizer (STDE) application deployed in single-input-multi-output (SIMO) systems. Therefore, fast adaptation schemes, such as fast traversal filter based APA (FTF-APA), becomes impossible to utilize. The motivation of this paper deliberates on finding an effective algorithm on the basis of APA, which yields low complexity while sustaining fast convergence as well as excellent tracking ability. The performance of the proposed method is evaluated under wireless SIMO channel in respect to bit error rate (BER) behavior and computational complexity, and upon completion, the validity is confirmed. The performance of the proposed method is evaluated under wireless SIMO channel in respect to bit error rate (BER) behavior and computational complexity, and upon completion, the validity is confirmed.

  • Characterization and Implementation of Partial Projection Filter in the Presence of Signal Space Noise

    Aqeel SYED  Hidemitsu OGAWA  

     
    PAPER-Image Processing and Video Processing

      Vol:
    E87-D No:12
      Page(s):
    2837-2844

    The partial projection filter gives optimal signal restoration in the presence of both the signal space and the observation space noises. In this paper, the filter has been characterized from the point of view of its signal restoration and noise suppression capabilities. The filter is shown to suppress the noise component in the restored signal while retaining the signal component, thus maximizing the signal-to-noise ratio. Further, a digital implementation of the filter is presented in matrix form in contrast to its original operator based derivation, for practical applications.

  • A High Presence Shared Space Communication System Using 2D Background and 3D Avatar

    Kyohei YOSHIKAWA  Takashi MACHIDA  Kiyoshi KIYOKAWA  Haruo TAKEMURA  

     
    INVITED PAPER

      Vol:
    E87-D No:12
      Page(s):
    2532-2539

    Displaying a 3D geometric model of a user in real time is an advantage for a telecommunication system because depth information is useful for nonverbal communication such as finger-pointing and gesturing that contain 3D information. However, the range image acquired by a rangefinder suffers from errors due to image noises and distortions in depth measurement. On the other hand, a 2D image is free from such errors. In this paper, we propose a new method for a shared space communication system that combines the advantages of both 2D and 3D representations. A user is represented as a 3D geometric model in order to exchange nonverbal communication cues. A background is displayed as a 2D image to give the user adequate information about the environment of the remote site. Additionally, a high-resolution texture taken by a video camera is projected onto the 3D geometric model of the user. This is done because the low resolution of the image acquired by the rangefinder makes it difficult to exchange facial expressions. Furthermore, to fill in the data occluded by the user, old pixel values are used for the user area in the 2D background image. We have constructed a prototype of a high presence shared space communication system based on our method. Through a number of experiments, we have found that our method is more effective for telecommunication than a method with only a 2D or 3D representation.

  • Partial Projection Filter for Signal Restoration in the Presence of Signal Space Noise

    Aqeel SYED  Hidemitsu OGAWA  

     
    PAPER-Image Processing and Video Processing

      Vol:
    E87-D No:12
      Page(s):
    2828-2836

    The problem of signal restoration in the presence of observation space noise has been tackled extensively. However, restoration of degraded signals in the presence of signal space noise leads to considerable complexity because it becomes difficult to distinguish between the original signal and the noise. In this paper, a partial projection filter has been devised for the restoration of signals degraded by both the signal space and the observation space noises. A closed form of the proposed filter has been derived and its performance has been verified experimentally.

  • Designing Filters by Successive Projection Using Multiple Extreme Frequency Points Based on Fritz John's Theorem

    Yasunori SUGITA  Naoyuki AIKAWA  

     
    PAPER-Filter Design

      Vol:
    E87-A No:8
      Page(s):
    2029-2036

    In this paper, we propose a design method of filters by successive projection (SP) method using multiple extreme frequency points based on Fritz John's theorem. In conventional SP method, only one extreme frequency point at which the deviation from the given specification is maximized is used in the update of the filter coefficients. Therefore, enormous amount of iteration numbers are necessary for research the solution which satisfies the given specification. In the proposed method, the updating coefficient using multiple extreme frequency points is possible by Fritz John's theorem. As a result, the solution converges less iteration number than the conventional SP method.

  • Elliptic vs. Rectangular Blending for Multi-Projection Displays

    Tsuyoshi MINAKAWA  Masami YAMASAKI  

     
    PAPER-Image Processing and Video Processing

      Vol:
    E87-D No:6
      Page(s):
    1517-1526

    We compared two edge-blending methods for multi-projection displays, elliptic and rectangular blending, by simulating three common situations: (1) an inaccurately estimated calibration parameter, (2) a worn projector lamp, and (3) a shifted viewpoint. We used a two-level-of-detail display including a high-gain rear-projection screen in the simulation to demonstrate an extreme case. The comparisons showed how strongly inaccurate elements affect a composite besides affecting the appearance itself. A subjective assessment was also carried out to obtain the evaluations of actual users. The simulation results showed that in many cases elliptic blending is more effective than rectangular blending.

81-100hit(144hit)