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

Keyword Search Result

[Keyword] CL(2832hit)

261-280hit(2832hit)

  • Online Signature Verification Using Single-Template Matching Through Locally and Globally Weighted Dynamic Time Warping

    Manabu OKAWA  

     
    PAPER-Image Recognition, Computer Vision

      Pubricized:
    2020/09/01
      Vol:
    E103-D No:12
      Page(s):
    2701-2708

    In this paper, we propose a novel single-template strategy based on a mean template set and locally/globally weighted dynamic time warping (LG-DTW) to improve the performance of online signature verification. Specifically, in the enrollment phase, we implement a time series averaging method, Euclidean barycenter-based DTW barycenter averaging, to obtain a mean template set considering intra-user variability among reference samples. Then, we acquire a local weighting estimate considering a local stability sequence that is obtained analyzing multiple matching points of an optimal match between the mean template and reference sets. Thereafter, we derive a global weighting estimate based on the variable importance estimated by gradient boosting. Finally, in the verification phase, we apply both local and global weighting methods to acquire a discriminative LG-DTW distance between the mean template set and a query sample. Experimental results obtained on the public SVC2004 Task2 and MCYT-100 signature datasets confirm the effectiveness of the proposed method for online signature verification.

  • Generative Adversarial Network Using Weighted Loss Map and Regional Fusion Training for LDR-to-HDR Image Conversion

    Sung-Woon JUNG  Hyuk-Ju KWON  Dong-Min SON  Sung-Hak LEE  

     
    LETTER-Image Processing and Video Processing

      Pubricized:
    2020/08/18
      Vol:
    E103-D No:11
      Page(s):
    2398-2402

    High dynamic range (HDR) imaging refers to digital image processing that modifies the range of color and contrast to enhance image visibility. To create an HDR image, two or more images that include various information are needed. In order to convert low dynamic range (LDR) images to HDR images, we consider the possibility of using a generative adversarial network (GAN) as an appropriate deep neural network. Deep learning requires a great deal of data in order to build a module, but once the module is created, it is convenient to use. In this paper, we propose a weight map for local luminance based on learning to reconstruct locally tone-mapped images.

  • FF-Control Point Insertion (FF-CPI) to Overcome the Degradation of Fault Detection under Multi-Cycle Test for POST

    Hanan T. Al-AWADHI  Tomoki AONO  Senling WANG  Yoshinobu HIGAMI  Hiroshi TAKAHASHI  Hiroyuki IWATA  Yoichi MAEDA  Jun MATSUSHIMA  

     
    PAPER-Dependable Computing

      Pubricized:
    2020/08/20
      Vol:
    E103-D No:11
      Page(s):
    2289-2301

    Multi-cycle Test looks promising a way to reduce the test application time of POST (Power-on Self-Test) for achieving a targeted high fault coverage specified by ISO26262 for testing automotive devices. In this paper, we first analyze the mechanism of Stuck-at Fault Detection Degradation problem in multi-cycle test. Based on the result of our analysis we propose a novel solution named FF-Control Point Insertion technique (FF-CPI) to achieve the reduction of scan-in patterns by multi-cycle test. The FF-CPI technique modifies the captured values of scan Flip-Flops (FFs) during capture operation by directly reversing the value of partial FFs or loading random vectors. The FF-CPI technique enhances the number of detectable stuck-at faults under the capture patterns. The experimental results of ISCAS89 and ITC99 benchmarks validated the effectiveness of FF-CPI technique in scan-in pattern reduction for POST.

  • Citation Count Prediction Based on Neural Hawkes Model

    Lisha LIU  Dongjin YU  Dongjing WANG  Fumiyo FUKUMOTO  

     
    PAPER-Biocybernetics, Neurocomputing

      Pubricized:
    2020/08/03
      Vol:
    E103-D No:11
      Page(s):
    2379-2388

    With the rapid development of scientific research, the number of publications, such as scientific papers and patents, has grown rapidly. It becomes increasingly important to identify those with high quality and great impact from such a large volume of publications. Citation count is one of the well-known indicators of the future impact of the publications. However, how to interpret a large number of uncertain factors of publications as relevant features and utilize them to capture the impact of publications over time is still a challenging problem. This paper presents an approach that effectively leverages a variety of factors with a neural-based citation prediction model. Specifically, the proposed model is based on the Neural Hawkes Process (NHP) with the continuous-time Long Short-Term Memory (cLSTM), which can capture the aging effect and the phenomenon of sleeping beauty more effectively from publication covariates as well as citation counts. The experimental results on two datasets show that the proposed approach outperforms the state-of-the-art baselines. In addition, the contribution of covariates to performance improvement is also verified.

  • Structural Analysis of Nonbinary Cyclic and Quasi-Cyclic LDPC Codes with α-Multiplied Parity-Check Matrices

    Haiyang LIU  Hao ZHANG  Lianrong MA  Lingjun KONG  

     
    LETTER-Coding Theory

      Pubricized:
    2020/05/12
      Vol:
    E103-A No:11
      Page(s):
    1299-1303

    In this letter, the structural analysis of nonbinary cyclic and quasi-cyclic (QC) low-density parity-check (LDPC) codes with α-multiplied parity-check matrices (PCMs) is concerned. Using analytical methods, several structural parameters of nonbinary cyclic and QC LDPC codes with α-multiplied PCMs are determined. In particular, some classes of nonbinary LDPC codes constructed from finite fields and finite geometries are shown to have good minimum and stopping distances properties, which may explain to some extent their wonderful decoding performances.

  • A New Polynomial-Time Solvable Graph Class for the Minimum Biclique Edge Cover Problem

    Hideaki OTSUKI  

     
    PAPER-optimization

      Vol:
    E103-A No:10
      Page(s):
    1202-1205

    The minimum biclique edge cover problem (MBECP) is NP-hard for general graphs. It is known that if we restrict an input graph to the bipartite domino-free class, MBECP can be solved within polynomial-time of input graph size. We show a new polynomial-time solvable graph class for MBECP that is characterized by three forbidden graphs, a domino, a gem and K4. This graph class allows that an input graph is non-bipartite, and includes the bipartite domino-free graph class properly.

  • Single Stage Vehicle Logo Detector Based on Multi-Scale Prediction

    Junxing ZHANG  Shuo YANG  Chunjuan BO  Huimin LU  

     
    PAPER-Pattern Recognition

      Pubricized:
    2020/07/14
      Vol:
    E103-D No:10
      Page(s):
    2188-2198

    Vehicle logo detection technology is one of the research directions in the application of intelligent transportation systems. It is an important extension of detection technology based on license plates and motorcycle types. A vehicle logo is characterized by uniqueness, conspicuousness, and diversity. Therefore, thorough research is important in theory and application. Although there are some related works for object detection, most of them cannot achieve real-time detection for different scenes. Meanwhile, some real-time detection methods of single-stage have performed poorly in the object detection of small sizes. In order to solve the problem that the training samples are scarce, our work in this paper is improved by constructing the data of a vehicle logo (VLD-45-S), multi-stage pre-training, multi-scale prediction, feature fusion between deeper with shallow layer, dimension clustering of the bounding box, and multi-scale detection training. On the basis of keeping speed, this article improves the detection precision of the vehicle logo. The generalization of the detection model and anti-interference capability in real scenes are optimized by data enrichment. Experimental results show that the accuracy and speed of the detection algorithm are improved for the object of small sizes.

  • Maximum Positioning Error Estimation Method for Detecting User Positions with Unmanned Aerial Vehicle based on Doppler Shifts Open Access

    Hiroyasu ISHIKAWA  Yuki HORIKAWA  Hideyuki SHINONAGA  

     
    PAPER

      Pubricized:
    2020/05/08
      Vol:
    E103-B No:10
      Page(s):
    1069-1077

    In the typical unmanned aircraft system (UAS), several unmanned aerial vehicles (UAVs) traveling at a velocity of 40-100km/h and with altitudes of 150-1,000m will be used to cover a wide service area. Therefore, Doppler shifts occur in the carrier frequencies of the transmitted and received signals due to changes in the line-of-sight velocity between the UAVs and the terrestrial terminal. By observing multiple Doppler shift values for different UAVs or observing a single UAV at different local times, it is possible to detect the user position on the ground. We conducted computer simulations for evaluating user position detection accuracy and Doppler shift distribution in several flight models. Further, a positioning accuracy index (PAI), which can be used as an index for position detection accuracy, was proposed as the absolute value of cosine of the inner product between two gradient vectors formed by Doppler shifts to evaluate the relationship between the location of UAVs and the position of the user. In this study, a maximum positioning error estimation method related to the PAI is proposed to approximate the position detection accuracy. Further, computer simulations assuming a single UAV flying on the curved routes such as sinusoidal routes with different cycles are conducted to clarify the effectiveness of the flight route in the aspects of positioning accuracy and latency by comparing with the conventional straight line fight model using the PAI and the proposed maximum positioning error estimation method.

  • A 0.6-V Adaptive Voltage Swing Serial Link Transmitter Using Near Threshold Body Bias Control and Jitter Estimation

    Yoshihide KOMATSU  Akinori SHINMYO  Mayuko FUJITA  Tsuyoshi HIRAKI  Kouichi FUKUDA  Noriyuki MIURA  Makoto NAGATA  

     
    PAPER-Electronic Circuits

      Pubricized:
    2020/04/09
      Vol:
    E103-C No:10
      Page(s):
    497-504

    With increasing technology scaling and the use of lower voltages, more research interest is being shown in variability-tolerant analog front end design. In this paper, we describe an adaptive amplitude control transmitter that is operated using differential signaling to reduce the temperature variability effect. It enables low power, low voltage operation by synergy between adaptive amplitude control and Vth temperature variation control. It is suitable for high-speed interface applications, particularly cable interfaces. By installing an aggressor circuit to estimate transmitter jitter and changing its frequency and activation rate, we were able to analyze the effects of the interface block on the input buffer and thence on the entire system. We also report a detailed estimation of the receiver clock-data recovery (CDR) operation for transmitter jitter estimation. These investigations provide suggestions for widening the eye opening of the transmitter.

  • Codeword Set Selection for the Error-Correcting 4b/10b Line Code with Maximum Clique Enumeration Open Access

    Masayuki TAKEDA  Nobuyuki YAMASAKI  

     
    PAPER-communication

      Vol:
    E103-A No:10
      Page(s):
    1227-1233

    This paper addresses the problem of finding, evaluating, and selecting the best set of codewords for the 4b/10b line code, a dependable line code with forward error correction (FEC) designed for real-time communication. Based on the results of our scheme [1], we formulate codeword search as an instance of the maximum clique problem, and enumerate all candidate codeword sets via maximum clique enumeration as proposed by Eblen et al. [2]. We then measure each set in terms of resistance to bit errors caused by noise and present a canonical set of codewords for the 4b/10b line code. Additionally, we show that maximum clique enumeration is #P-hard.

  • Non-Closure Properties of Multi-Inkdot Nondeterministic Turing Machines with Sublogarithmic Space

    Tsunehiro YOSHINAGA  Makoto SAKAMOTO  

     
    LETTER-complexity theory

      Vol:
    E103-A No:10
      Page(s):
    1234-1236

    This paper investigates the closure properties of multi-inkdot nondeterministic Turing machines with sublogarithmic space. We show that the class of sets accepted by the Turing machines is not closed under concatenation with regular set, Kleene closure, length-preserving homomorphism, and intersection.

  • Wireless-Powered Filter-and-Forward Relaying in Frequency-Selective Channels

    Junta FURUKAWA  Teruyuki MIYAJIMA  Yoshiki SUGITANI  

     
    PAPER-Communication Theory and Signals

      Vol:
    E103-A No:9
      Page(s):
    1095-1102

    In this paper, we propose a filter-and-forward relay scheme with energy harvesting for single-carrier transmission in frequency-selective channels. The relay node harvests energy from both the source node transmit signal and its own transmit signal by self-energy recycling. The signal received by the relay node is filtered to suppress the inter-symbol interference and then forwarded to the destination node using the harvested energy. We consider a filter design method based on the signal-to-interference-plus-noise power ratio maximization, subject to a constraint that limits the relay transmit power. In addition, we provide a golden-section search based algorithm to optimize the power splitting ratio of the power splitting protocol. The simulation results show that filtering and self-energy recycling of the proposed scheme are effective in improving performance. It is also shown that the proposed scheme is useful even when only partial channel state information is available.

  • Top-N Recommendation Using Low-Rank Matrix Completion and Spectral Clustering

    Qian WANG  Qingmei ZHOU  Wei ZHAO  Xuangou WU  Xun SHAO  

     
    PAPER-Internet

      Pubricized:
    2020/03/16
      Vol:
    E103-B No:9
      Page(s):
    951-959

    In the age of big data, recommendation systems provide users with fast access to interesting information, resulting to a significant commercial value. However, the extreme sparseness of user assessment data is one of the key factors that lead to the poor performance of recommendation algorithms. To address this problem, we propose a spectral clustering recommendation scheme with low-rank matrix completion and spectral clustering. Our scheme exploits spectral clustering to achieve the division of a similar user group. Meanwhile, the low-rank matrix completion is used to effectively predict un-rated items in the sub-matrix of the spectral clustering. With the real dataset experiment, the results show that our proposed scheme can effectively improve the prediction accuracy of un-rated items.

  • Cost-Efficient Recycled FPGA Detection through Statistical Performance Characterization Framework

    Foisal AHMED  Michihiro SHINTANI  Michiko INOUE  

     
    PAPER

      Vol:
    E103-A No:9
      Page(s):
    1045-1053

    Analyzing aging-induced delay degradations of ring oscillators (ROs) is an effective way to detect recycled field-programmable gate arrays (FPGAs). However, it requires a large number of RO measurements for all FPGAs before shipping, which increases the measurement costs. We propose a cost-efficient recycled FPGA detection method using a statistical performance characterization technique called virtual probe (VP) based on compressed sensing. The VP technique enables the accurate prediction of the spatial process variation of RO frequencies on a die by using a very small number of sample RO measurements. Using the predicted frequency variation as a supervisor, the machine-learning model classifies target FPGAs as either recycled or fresh. Through experiments conducted using 50 commercial FPGAs, we demonstrate that the proposed method achieves 90% cost reduction for RO measurements while preserving the detection accuracy. Furthermore, a one-class support vector machine algorithm was used to classify target FPGAs with around 94% detection accuracy.

  • The Expected Distance of Shortest Path-Based In-Trees along Spanning Root Mobility on Grid Graph

    Yoshihiro KANEKO  

     
    PAPER

      Vol:
    E103-A No:9
      Page(s):
    1071-1077

    The paper deals with the shortest path-based in-trees on a grid graph. There a root is supposed to move among all vertices. As such a spanning mobility pattern, root trajectories based on a Hamilton path or cycle are discussed. Along such a trajectory, each vertex randomly selects the next hop on the shortest path to the root. Under those assumptions, this paper shows that a root trajectory termed an S-path provides the minimum expected symmetric difference. Numerical experiments show that another trajectory termed a Right-cycle also provides the minimum result.

  • A Coil Design and Control Method of Independent Active Shielding System for Leakage Magnetic Field Reduction of Wireless UAV Charger Open Access

    Jedok KIM  Jangyong AHN  Sungryul HUH  Kibeom KIM  Seungyoung AHN  

     
    INVITED PAPER

      Pubricized:
    2020/06/26
      Vol:
    E103-B No:9
      Page(s):
    889-898

    This paper proposes a single coil active shielding method of wireless unmanned aerial vehicle charger for leakage magnetic field reduction. A proposed shielding system eliminates the leakage magnetic field generated from the transmitting and receiving coils by generating the cancelling magnetic field. In order to enhance shielding effectiveness and preserve power transfer efficiency, shielding coil design parameters including radius and turns will analyze. Based on the analysis of coil design, shielding effectiveness and power transfer efficiency will estimate. In addition, shielding current control method corresponding to leakage magnetic field strength and phase will describe. A proposed shielding system has verified by simulations and experiments in terms of the total shielding effectiveness and power transfer efficiency measurements. The simulation and experimental results show that a proposed active shielding system has achieved 68.85% of average leakage magnetic field reduction with 1.92% of power transfer efficiency degradation. The shielding effectiveness and power transfer efficiency variation by coil design has been experimentally verified.

  • Complexity-Reduced Adaptive PAPR Reduction Method Using Null Space in MIMO Channel for MIMO-OFDM Signals Open Access

    Taku SUZUKI  Mikihito SUZUKI  Yoshihisa KISHIYAMA  Kenichi HIGUCHI  

     
    PAPER-Wireless Communication Technologies

      Pubricized:
    2020/03/23
      Vol:
    E103-B No:9
      Page(s):
    1019-1029

    This paper proposes a computational complexity-reduced algorithm for an adaptive peak-to-average power ratio (PAPR) reduction method previously developed by members of our research group that uses the null space in a multiple-input multiple-output (MIMO) channel for MIMO-orthogonal frequency division multiplexing (OFDM) signals. The proposed algorithm is an extension of the peak cancellation (PC) signal-based method that has been mainly investigated for per-antenna PAPR reduction. This method adds the PC signal, which is designed so that the out-of-band radiation is removed/reduced, directly to the time-domain transmission signal at each antenna. The proposed method, referred to as PCCNC (PC with channel-null constraint), performs vector-level signal processing in the PC signal generation so that the PC signal is transmitted only to the null space in the MIMO channel. We investigate three methods to control the beamforming (BF) vector in the PC signal, which is a key factor in determining the achievable PAPR performance of the algorithm. Computer simulation results show that the proposed PCCNC achieves approximately the same throughput-vs.-PAPR performance as the previous method while dramatically reducing the required computational cost.

  • Spectrum Sensing with Selection Diversity Combining in Cognitive Radio

    Shusuke NARIEDA  Hiromichi OGASAWARA  Hiroshi NARUSE  

     
    PAPER-Communication Theory and Signals

      Vol:
    E103-A No:8
      Page(s):
    978-986

    This paper presents a novel spectrum sensing technique based on selection diversity combining in cognitive radio networks. In general, a selection diversity combining scheme requires a period to select an optimal element, and spectrum sensing requires a period to detect a target signal. We consider that both these periods are required for the spectrum sensing based on selection diversity combining. However, conventional techniques do not consider both the periods. Furthermore, spending a large amount of time in selection and signal detection increases their accuracy. Because the required period for spectrum sensing based on selection diversity combining is the summation of both the periods, their lengths should be considered while developing selection diversity combining based spectrum sensing for a constant period. In reference to this, we discuss the spectrum sensing technique based on selection diversity combining. Numerical examples are shown to validate the effectiveness of the presented design techniques.

  • Clustering for Interference Alignment with Cache-Enabled Base Stations under Limited Backhaul Links

    Junyao RAN  Youhua FU  Hairong WANG  Chen LIU  

     
    PAPER-Wireless Communication Technologies

      Pubricized:
    2019/12/25
      Vol:
    E103-B No:7
      Page(s):
    796-803

    We propose to use clustered interference alignment for the situation where the backhaul link capacity is limited and the base station is cache-enabled given MIMO interference channels, when the number of Tx-Rx pairs exceeds the feasibility constraint of interference alignment. We optimize clustering with the soft cluster size constraint algorithm by adding a cluster size balancing process. In addition, the CSI overhead is quantified as a system performance indicator along with the average throughput. Simulation results show that cluster size balancing algorithm generates clusters that are more balanced as well as attaining higher long-term throughput than the soft cluster size constraint algorithm. The long-term throughput is further improved under high SNR by reallocating the capacity of the backhaul links based on the clustering results.

  • Millimeter-Wave Radio Channel Characterization Using Multi-Dimensional Sub-Grid CLEAN Algorithm

    Minseok KIM  Tatsuki IWATA  Shigenobu SASAKI  Jun-ichi TAKADA  

     
    PAPER-Antennas and Propagation

      Pubricized:
    2020/01/10
      Vol:
    E103-B No:7
      Page(s):
    767-779

    In radio channel measurements and modeling, directional scanning via highly directive antennas is the most popular method to obtain angular channel characteristics to develop and evaluate advanced wireless systems for high frequency band use. However, it is often insufficient for ray-/cluster-level characterizations because the angular resolution of the measured data is limited by the angular sampling interval over a given scanning angle range and antenna half power beamwidth. This study proposes the sub-grid CLEAN algorithm, a novel technique for high-resolution multipath component (MPC) extraction from the multi-dimensional power image, so called double-directional angular delay power spectrum. This technique can successfully extract the MPCs by using the multi-dimensional power image. Simulation and measurements showed that the proposed technique could extract MPCs for ray-/cluster-level characterizations and channel modeling. Further, applying the proposed method to the data captured at 58.5GHz in an atrium entrance hall environment which is an indoor hotspot access scenario in the fifth generation mobile system, the multipath clusters and corresponding scattering processes were identified.

261-280hit(2832hit)