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

Keyword Search Result

[Keyword] AME(1195hit)

321-340hit(1195hit)

  • Utilizing Attributed Graph Representation in Object Detection and Tracking for Indoor Range Sensor Surveillance Cameras

    Houari SABIRIN  Hiroshi SANKOH  Sei NAITO  

     
    PAPER-Image Recognition, Computer Vision

      Pubricized:
    2015/09/10
      Vol:
    E98-D No:12
      Page(s):
    2299-2307

    The problem of identifying moving objects in a video recording produced by a range sensor camera is due to the limited information available for classifying different objects. On the other hand, the infrared signal from a range sensor camera is more robust for extreme luminance intensity when the monitored area has light conditions that are too bright or too dark. This paper proposes a method of detection and tracking moving objects in image sequences captured by stationary range sensor cameras. Here, the depth information is utilized to correctly identify each of detected objects. Firstly, camera calibration and background subtraction are performed to separate the background from the moving objects. Next, a 2D projection mapping is performed to obtain the location and contour of the objects in the 2D plane. Based on this information, graph matching is performed based on features extracted from the 2D data, namely object position, size and the behavior of the objects. By observing the changes in the number of objects and the objects' position relative to each other, similarity matching is performed to track the objects in the temporal domain. Experimental results show that by using similarity matching, object identification can be correctly achieved even during occlusion.

  • Energy Aware Forwarding in Content Centric Based Multihop Wireless Ad Hoc Networks

    Rana Asif REHMAN  Byung-Seo KIM  

     
    LETTER-Mobile Information Network and Personal Communications

      Vol:
    E98-A No:12
      Page(s):
    2738-2742

    Content centric networking (CCN) is a newly proposed futuristic Internet paradigm in which communication depends on the decoupling of content names from their locations. In CCN-based multihop wireless ad hoc networks, the participating nodes show dynamic topology, intermittent connectivity, channels fluctuation, and severe constraints such as limited battery power. In the case of traffic congestion, the affected nodes die early owing to the shortage of battery power. Consequently, all pending request entries are also destroyed, which further degrades the network performance as well as the node working lifetime. In this study, we have proposed a novel energy aware transmission scheme in which the forwarding mechanism is based on a node's residual energy. The proposed scheme is evaluated using official ndnSIM. This scheme enhances performance in terms of content retrieval time and total Interest transmission in the network.

  • F0 Parameterization of Glottalized Tones in HMM-Based Speech Synthesis for Hanoi Vietnamese

    Duy Khanh NINH  Yoichi YAMASHITA  

     
    PAPER-Speech and Hearing

      Pubricized:
    2015/09/07
      Vol:
    E98-D No:12
      Page(s):
    2280-2289

    A conventional HMM-based speech synthesis system for Hanoi Vietnamese often suffers from hoarse quality due to incomplete F0 parameterization of glottalized tones. Since estimating F0 from glottalized waveform is rather problematic for usual F0 extractors, we propose a pitch marking algorithm where pitch marks are propagated from regular regions of a speech signal to glottalized ones, from which complete F0 contours for the glottalized tones are derived. The proposed F0 parameterization scheme was confirmed to significantly reduce the hoarseness whilst slightly improving the tone naturalness of synthetic speech by both objective and listening tests. The pitch marking algorithm works as a refinement step based on the results of an F0 extractor. Therefore, the proposed scheme can be combined with any F0 extractor.

  • Scan-Based Side-Channel Attack on the Camellia Block Cipher Using Scan Signatures

    Huiqian JIANG  Mika FUJISHIRO  Hirokazu KODERA  Masao YANAGISAWA  Nozomu TOGAWA  

     
    PAPER-Logic Synthesis, Test and Verification

      Vol:
    E98-A No:12
      Page(s):
    2547-2555

    Camellia is a block cipher jointly developed by Mitsubishi and NTT of Japan. It is designed suitable for both software and hardware implementations. One of the design-for-test techniques using scan chains is called scan-path test, in which testers can observe and control the registers inside the LSI chip directly in order to check if the LSI chip correctly operates or not. Recently, a scan-based side-channel attack is reported which retrieves the secret information from the cryptosystem using scan chains. In this paper, we propose a scan-based attack method on the Camellia cipher using scan signatures. Our proposed method is based on the equivalent transformation of the Camellia algorithm and the possible key candidate reduction in order to retrieve the secret key. Experimental results show that our proposed method sucessfully retrieved its 128-bit secret key using 960 plaintexts even if the scan chain includes the Camellia cipher and other circuits and also sucessfully retrieves its secret key on the SASEBO-GII board, which is a side-channel attack standard evaluation board.

  • Sarsa Learning Based Route Guidance System with Global and Local Parameter Strategy

    Feng WEN  Xingqiao WANG  

     
    PAPER-Intelligent Transport System

      Vol:
    E98-A No:12
      Page(s):
    2686-2693

    Route guidance system is one of the essential components of a vehicle navigation system in ITS. In this paper, a centrally determined route guidance system is established to solve congestion problems. The Sarsa learning method is used to guide vehicles, and global and local parameter strategy is proposed to adjust the vehicle guidance by considering the whole traffic system and local traffic environment, respectively. The proposed method can save the average driving time and relieve traffic congestion. The evaluation was done using two cases on different road networks. The experimental results show the efficiency and effectiveness of the proposed algorithm.

  • Fast Image Denoising Algorithm by Estimating Noise Parameters

    Tuan-Anh NGUYEN  Min-Cheol HONG  

     
    PAPER-Image

      Vol:
    E98-A No:12
      Page(s):
    2694-2700

    This paper introduces a fast image denoising algorithm by estimating noise parameters without prior information about the noise. Under the assumption that additive noise has a Gaussian distribution, the noise parameters were estimated from an observed degraded image, and were used to define the constraints of a noise detection process that was coupled with a Markov random field (MRF). In addition, an adaptive modified weighted Gaussian filter with variable window sizes defined by the constraints on noise detection was used to control the degree of smoothness of the reconstructed image. Experimental results demonstrate the capability of the proposed algorithm.

  • Parameterization of High-Dimensional Perfect Sequences over a Composition Algebra over R

    Takao MAEDA  Yodai WATANABE  Takafumi HAYASHI  

     
    PAPER-Sequence

      Vol:
    E98-A No:12
      Page(s):
    2439-2445

    To analyze the structure of a set of high-dimensional perfect sequences over a composition algebra over R, we developed the theory of Fourier transforms of the set of such sequences. We define the discrete cosine transform and the discrete sine transform, and we show that there exists a relationship between these transforms and a convolution of sequences. By applying this property to a set of perfect sequences, we obtain a parameterization theorem. Using this theorem, we show the equivalence between the left perfectness and right perfectness of sequences. For sequences of real numbers, we obtain the parameterization without restrictions on the parameters.

  • Beyond 110 GHz InP-HEMT Based Mixer Module Using Flip-Chip Assembly for Precise Spectrum Analysis

    Shoichi SHIBA  Masaru SATO  Hiroshi MATSUMURA  Yoichi KAWANO  Tsuyoshi TAKAHASHI  Toshihide SUZUKI  Yasuhiro NAKASHA  Taisuke IWAI  Naoki HARA  

     
    PAPER

      Vol:
    E98-C No:12
      Page(s):
    1112-1119

    A wide-bandwidth fundamental mixer operating at a frequency above 110GHz for precise spectrum analysis was developed using the InP HEMT technology. A single-ended resistive mixer was adopted for the mixer circuit. An IF amplifier and LO buffer amplifier were also developed and integrated into the mixer chip. As for packaging into a metal block module, a flip-chip bonding technique was introduced. Compared to face-up mounting with wire connections, flip-chip bonding exhibited good frequency flatness in signal loss. The mixer module with a built-in IF amplifier achieved a conversion gain of 5dB at an RF frequency of 135GHz and a 3-dB bandwidth of 35GHz. The mixer module with an LO buffer amplifier operated well even at an LO power of -20dBm.

  • Modeling and Testing of Network Protocols with Parallel State Machines

    Xia YIN  Jiangyuan YAO  Zhiliang WANG  Xingang SHI  Jun BI  Jianping WU  

     
    PAPER-Network

      Pubricized:
    2015/09/15
      Vol:
    E98-D No:12
      Page(s):
    2091-2104

    The researches on model-based testing mainly focus on the models with single component, such as FSM and EFSM. For the network protocols which have multiple components communicating with messages, CFSM is a widely accepted solution. But in some network protocols, parallel and data-shared components maybe exist in the same network entity. It is infeasible to precisely specify such protocol by existing models. In this paper we present a new model, Parallel Parameterized Extended Finite State Machine (PaP-EFSM). A protocol system can be modeled with a group of PaP-EFSMs. The PaP-EFSMs work in parallel and they can read external variables form each other. We present a 2-stage test generation approach for our new models. Firstly, we generate test sequences for internal variables of each machine. They may be non-executable due to external variables. Secondly, we process the external variables. We make the sequences for internal variables executable and generate more test sequences for external variables. For validation, we apply this method to the conformance testing of real-life protocols. The devices from different vendors are tested and implementation faults are exposed.

  • Improvement in Method Verb Recommendation Technique Using Association Rule Mining

    Yuki KASHIWABARA  Takashi ISHIO  Katsuro INOUE  

     
    LETTER-Software Engineering

      Pubricized:
    2015/08/13
      Vol:
    E98-D No:11
      Page(s):
    1982-1985

    In a previous study, we proposed a technique to recommend candidate verbs for a method name so that developers can consistently use various verbs. In this study, we improve the rule extraction technique proposed in this previous study. Moreover, we confirm that the rank of each correct verb recommended by the new technique is higher than that by the previous technique.

  • Facilitating Incentive-Compatible Access Probability Selection in Wireless Random Access Networks

    Bo GU  Cheng ZHANG  Kyoko YAMORI  Zhenyu ZHOU  Song LIU  Yoshiaki TANAKA  

     
    PAPER-Network

      Vol:
    E98-B No:11
      Page(s):
    2280-2290

    This paper studies the impact of integrating pricing with connection admission control (CAC) on the congestion management practices in contention-based wireless random access networks. Notably, when the network is free of charge, each self-interested user tries to occupy the channel as much as possible, resulting in the inefficient utilization of network resources. Pricing is therefore adopted as incentive mechanism to encourage users to choose their access probabilities considering the real-time network congestion level. A Stackelberg leader-follower game is formulated to analyze the competitive interaction between the service provider and the users. In particular, each user chooses the access probability that optimizes its payoff, while the self-interested service provider decides whether to admit or to reject the user's connection request in order to optimize its revenue. The stability of the Stackelberg leader-follower game in terms of convergence to the Nash equilibrium is established. The proposed CAC scheme is completely distributed and can be implemented by individual access points using only local information. Compared to the existing schemes, the proposed scheme achieves higher revenue gain, higher user payoff, and higher QoS performance.

  • Unsupervised Weight Parameter Estimation for Exponential Mixture Distribution Based on Symmetric Kullback-Leibler Divergence

    Masato UCHIDA  

     
    LETTER-Information Theory

      Vol:
    E98-A No:11
      Page(s):
    2349-2353

    When there are multiple component predictors, it is promising to integrate them into one predictor for advanced reasoning. If each component predictor is given as a stochastic model in the form of probability distribution, an exponential mixture of the component probability distributions provides a good way to integrate them. However, weight parameters used in the exponential mixture model are difficult to estimate if there is no training samples for performance evaluation. As a suboptimal way to solve this problem, weight parameters may be estimated so that the exponential mixture model should be a balance point that is defined as an equilibrium point with respect to the distance from/to all component probability distributions. In this paper, we propose a weight parameter estimation method that represents this concept using a symmetric Kullback-Leibler divergence and generalize this method.

  • Software Reliability Assessment via Non-Parametric Maximum Likelihood Estimation

    Yasuhiro SAITO  Tadashi DOHI  

     
    PAPER

      Vol:
    E98-A No:10
      Page(s):
    2042-2050

    In this paper we consider two non-parametric estimation methods for software reliability assessment without specifying the fault-detection time distribution, where the underlying stochastic process to describe software fault-counts in the system testing is given by a non-homogeneous Poisson process. The resulting data-driven methodologies can give the useful probabilistic information on the software reliability assessment under the incomplete knowledge on fault-detection time distribution. Throughout examples with real software fault data, it is shown that the proposed methods provide more accurate estimation results than the common parametric approach.

  • Speeding Up and Performance Evaluation of a Fully Automatic Radial Distortion Compensation Algorithm for Driving Assistance Cameras

    Yuta KANUKI  Naoya OHTA  

     
    LETTER-Image Recognition, Computer Vision

      Pubricized:
    2015/07/03
      Vol:
    E98-D No:10
      Page(s):
    1892-1895

    Recently, cameras are equipped on cars in order to assist their drivers. These cameras often have a severe radial distortion because of their wide view angle, and sometimes it is necessary to compensate it in a fully automatic way in the field. We have proposed such a method, which uses the entropy of the histogram of oriented gradient (HOG) to evaluate the goodness of the compensation. Its performance was satisfactory, but the computational burden was too heavy to be executed by drive assistance devices. In this report, we discuss a method to speed up the algorithm, and obtain a new light algorithm feasible for such devices. We also show more comprehensive performance evaluation results then those in the previous reports.

  • Minimum Length of a Signal for Fundamental Frequency Estimation and Its Application

    Takahiro MURAKAMI  Hiroyuki YAMAGISHI  Yoshihisa ISHIDA  

     
    PAPER-Digital Signal Processing

      Vol:
    E98-A No:9
      Page(s):
    1914-1923

    The theoretically minimum length of a signal for fundamental frequency estimation in a noisy environment is discussed. Assuming that the noise is additive white Gaussian, it is known that a Cramér-Rao lower bound (CRLB) is given by the length and other parameters of the signal. In this paper, we define the minimum length as the length whose CRLB is less than or equal to the specific variance for any parameters of the signal. The specific variance is allowable variance of the estimate within an application of fundamental frequency estimation. By reformulating the CRLB with respect to the initial phase of the signal, the algorithms for determining the minimum length are proposed. In addition, we develop the methods of deciding the specific variance for general fundamental frequency estimation and pitch estimation. Simulation results in terms of both the fundamental frequency estimation and the pitch estimation show the validity of our approach.

  • Mode and Frame Detection Algorithm for DAB OFDM Receiver

    Won-Jae SHIN  Ki-Won KWON  Yong-Je WOO  Hyoungsoo LIM  Hyoung-Kyu SONG  Young-Hwan YOU  

     
    LETTER-Mobile Information Network and Personal Communications

      Vol:
    E98-A No:9
      Page(s):
    1995-1997

    In this letter, a robust algorithm for jointly finding an estimate of the start of the frame and transmission mode is proposed in a digital audio broadcasting (DAB) system. In doing so, the use of differential-correlation based joint detection is proposed, which considers not only the height of correlation peak but also its plateau. We show via simulations that the proposed detection algorithm is capable of robustly detecting the start of a frame and its mode against the variation of signal-to-noise ratio, providing a performance advantage over the conventional algorithm.

  • A Realization of Signal-Model-Based SAR Imaging via Atomic Decomposition

    Yesheng GAO  Hui SHENG  Kaizhi WANG  Xingzhao LIU  

     
    PAPER-Digital Signal Processing

      Vol:
    E98-A No:9
      Page(s):
    1906-1913

    A signal-model-based SAR image formation algorithm is proposed in this paper. A model is used to describe the received signal, and each scatterer can be characterized by a set of its parameters. Two parameter estimation methods via atomic decomposition are presented: (1) applying 1-D matching pursuit to azimuthal projection data; (2) applying 2-D matching pursuit to raw data. The estimated parameters are mapped to form a SAR image, and the mapping procedure can be implemented under application guidelines. This algorithm requires no prior information about the relative motion between the platform and the target. The Cramer-Rao bounds of parameter estimation are derived, and the root mean square errors of the estimates are close to the bounds. Experimental results are given to validate the algorithm and indicate its potential applications.

  • Motion of Break Arcs Occurring between Silver Electrical Contacts with Copper Arc Runners

    Haruki MIYAGAWA  Junya SEKIKAWA  

     
    BRIEF PAPER

      Vol:
    E98-C No:9
      Page(s):
    919-922

    Copper arc runners are fixed on silver electrical contacts. Break arcs are generated between the contacts in a DC resistive circuit. Circuit current when contacts are closed is 10A. Supply voltage is changed from 200V to 450V. The following results are shown. Cathode spots stay on the cathode surface but anode spots run on the runner when the supply voltage is 250V and over. In cases of the supply voltage is greater than 250V, the break arcs run on the runner when the arcs are successfully extinguished, and stays on the runner in cases of the failure of arc extinction. The arc lengths just before arc extinction with or without the runners are also investigated. The arc lengths are the same with or without the runners for each supply voltage.

  • A Comprehensive Survey of Potential Game Approaches to Wireless Networks Open Access

    Koji YAMAMOTO  

     
    INVITED SURVEY PAPER

      Vol:
    E98-B No:9
      Page(s):
    1804-1823

    Potential games form a class of non-cooperative games where the convergent of unilateral improvement dynamics is guaranteed in many practical cases. The potential game approach has been applied to a wide range of wireless network problems, particularly to a variety of channel assignment problems. In this paper, the properties of potential games are introduced, and games in wireless networks that have been proven to be potential games are comprehensively discussed.

  • Dosimetry and Verification for 6-GHz Whole-Body Non-Constraint Exposure of Rats Using Reverberation Chamber

    Jingjing SHI  Jerdvisanop CHAKAROTHAI  Jianqing WANG  Kanako WAKE  Soichi WATANABE  Osamu FUJIWARA  

     
    PAPER

      Vol:
    E98-B No:7
      Page(s):
    1164-1172

    With the rapid increase of various uses of wireless communications in modern life, the high microwave and millimeter wave frequency bands are attracting much attention. However, the existing databases on above 6GHz radio-frequency (RF) electromagnetic (EM) field exposure of biological bodies are obviously insufficient. An in-vivo research project on local and whole-body exposure of rats to RF-EM fields above 6GHz was started in Japan in 2013. This study aims to perform a dosimetric design for the whole-body-average specific absorption rates (WBA-SARs) of unconstrained rats exposed to 6GHz RF-EM fields in a reverberation chamber (RC). The required input power into the RC is clarified using a two-step evaluation method in order to achieve a target exposure level in rats. The two-step method, which incorporates the finite-difference time-domain (FDTD) numerical solutions with electric field measurements in an RC exposure system, is used as an evaluation method to determine the whole-body exposure level in the rats. In order to verify the validity of the two-step method, we use S-parameter measurements inside the RC to experimentally derive the WBA-SARs with rat-equivalent phantoms and then compare those with the FDTD-calculated ones. It was shown that the difference between the two-step method and the S-parameter measurements is within 1.63dB, which reveals the validity and usefulness of the two-step technique.

321-340hit(1195hit)