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

Keyword Search Result

[Keyword] Al(20498hit)

2001-2020hit(20498hit)

  • A General Perfect Cyclic Interference Alignment by Propagation Delay for Arbitrary X Channels with Two Receivers Open Access

    Conggai LI  Feng LIU  Shuchao JIANG  Yanli XU  

     
    LETTER-Digital Signal Processing

      Vol:
    E102-A No:11
      Page(s):
    1580-1585

    Interference alignment (IA) in temporal domain is important in the case of single-antenna vehicle communications. In this paper, perfect cyclic IA based on propagation delay is extended to the K×2 X channels with two receivers and arbitrary transmitters K≥2, which achieves the maximal multiplexing gain by obtaining the theoretical degree of freedom of 2K/(K+1). We deduce the alignment and separability conditions, and propose a general scheme which is flexible in setting the index of time-slot for IA at the receiver side. Furthermore, the feasibility of the proposed scheme in the two-/three- Euclidean space is analyzed and demonstrated.

  • Prediction-Based Scale Adaptive Correlation Filter Tracker

    Zuopeng ZHAO  Hongda ZHANG  Yi LIU  Nana ZHOU  Han ZHENG  Shanyi SUN  Xiaoman LI  Sili XIA  

     
    LETTER-Image Recognition, Computer Vision

      Pubricized:
    2019/07/30
      Vol:
    E102-D No:11
      Page(s):
    2267-2271

    Although correlation filter-based trackers have demonstrated excellent performance for visual object tracking, there remain several challenges to be addressed. In this work, we propose a novel tracker based on the correlation filter framework. Traditional trackers face difficulty in accurately adapting to changes in the scale of the target when the target moves quickly. To address this, we suggest a scale adaptive scheme based on prediction scales. We also incorporate a speed-based adaptive model update method to further improve overall tracking performance. Experiments with samples from the OTB100 and KITTI datasets demonstrate that our method outperforms existing state-of-the-art tracking algorithms in fast motion scenes.

  • Accelerating Stochastic Simulations on GPUs Using OpenCL

    Pilsung KANG  

     
    LETTER-Fundamentals of Information Systems

      Pubricized:
    2019/07/23
      Vol:
    E102-D No:11
      Page(s):
    2253-2256

    Since first introduced in 2008 with the 1.0 specification, OpenCL has steadily evolved over the decade to increase its support for heterogeneous parallel systems. In this paper, we accelerate stochastic simulation of biochemical reaction networks on modern GPUs (graphics processing units) by means of the OpenCL programming language. In implementing the OpenCL version of the stochastic simulation algorithm, we carefully apply its data-parallel execution model to optimize the performance provided by the underlying hardware parallelism of the modern GPUs. To evaluate our OpenCL implementation of the stochastic simulation algorithm, we perform a comparative analysis in terms of the performance using the CPU-based cluster implementation and the NVidia CUDA implementation. In addition to the initial report on the performance of OpenCL on GPUs, we also discuss applicability and programmability of OpenCL in the context of GPU-based scientific computing.

  • An Exact Algorithm for the Arrow Placement Problem in Directed Graph Drawings

    Naoto KIDO  Sumio MASUDA  Kazuaki YAMAGUCHI  

     
    PAPER-Algorithms and Data Structures

      Vol:
    E102-A No:11
      Page(s):
    1481-1489

    We consider the problem of placing arrows, which indicate the direction of each edge in directed graph drawings, without making them overlap other arrows, vertices and edges as much as possible. The following two methods have been proposed for this problem. One is an exact algorithm for the case in which the position of each arrow is restricted to some discrete points. The other is a heuristic algorithm for the case in which the arrow is allowed to move continuously on each edge. In this paper, we assume that the arrow positions are not restricted to discrete points and propose an exact algorithm for the problem of finding an arrow placement such that (a) the weighted sum of the numbers of overlaps with edges, vertices and other arrows is minimized and (b) the sum of the distances between the arrows and their edges' terminal vertices is minimized as a secondary objective. The proposed method solves this problem by reducing it to a mixed integer linear programming problem. Since this is an exponential time algorithm, we add a simple procedure as preprocessing to reduce the running time. Experimental results show that the proposed method can find a better arrow placement than the previous methods and the procedure for reducing the running time is effective.

  • Emergence of an Onion-Like Network in Surface Growth and Its Strong Robustness

    Yukio HAYASHI  Yuki TANAKA  

     
    LETTER-Graphs and Networks

      Vol:
    E102-A No:10
      Page(s):
    1393-1396

    We numerically investigate that optimal robust onion-like networks can emerge even with the constraint of surface growth in supposing a spatially embedded transportation or communication system. To be onion-like, moderately long links are necessary in the attachment through intermediations inspired from a social organization theory.

  • Cross-Domain Deep Feature Combination for Bird Species Classification with Audio-Visual Data

    Naranchimeg BOLD  Chao ZHANG  Takuya AKASHI  

     
    PAPER-Multimedia Pattern Processing

      Pubricized:
    2019/06/27
      Vol:
    E102-D No:10
      Page(s):
    2033-2042

    In recent decade, many state-of-the-art algorithms on image classification as well as audio classification have achieved noticeable successes with the development of deep convolutional neural network (CNN). However, most of the works only exploit single type of training data. In this paper, we present a study on classifying bird species by exploiting the combination of both visual (images) and audio (sounds) data using CNN, which has been sparsely treated so far. Specifically, we propose CNN-based multimodal learning models in three types of fusion strategies (early, middle, late) to settle the issues of combining training data cross domains. The advantage of our proposed method lies on the fact that we can utilize CNN not only to extract features from image and audio data (spectrogram) but also to combine the features across modalities. In the experiment, we train and evaluate the network structure on a comprehensive CUB-200-2011 standard data set combing our originally collected audio data set with respect to the data species. We observe that a model which utilizes the combination of both data outperforms models trained with only an either type of data. We also show that transfer learning can significantly increase the classification performance.

  • ORRIS: Throughput Optimization for Backscatter Link on Physical and MAC Layers

    Jumin ZHAO  Yanxia LI  Dengao LI  Hao WU  Biaokai ZHU  

     
    PAPER-Multimedia Systems for Communications

      Pubricized:
    2019/04/05
      Vol:
    E102-B No:10
      Page(s):
    2082-2090

    Unlike Radio Frequency Identification (RFID), emerging Computational RFID (CRFID) integrates the RF front-end and MCU with multiple sensors. CRFIDs need to transmit data within the interrogator range, so when the tags moved rapidly or the contact duration with interrogator is limited, the sensor data collected by CRFID must be transferred to interrogator quickly. In this paper, we focus on throughput optimization for backscatter link, take physical and medium access control (MAC) layers both into consideration, put forward our scheme called ORRIS. On physical layer, we propose Cluster Gather Degree (CGD) indicator, which is the clustering degree of signal in IQ domain. Then CGD is regarded as the criterion to adaptively adjust the rate encoding mode and link frequency, accordingly achieve adaptive rate transmission. On MAC layer, based on the idea of asynchronous transfer, we utilize the the number of clusters in IQ domain to select the optimal Q value as much as possible. So that achieve burst transmission or bulk data transmission. Experiments and analyses on the static and mobile scenarios show that our proposal has significantly better mean throughput than BLINK or CARA, which demonstrate the effectiveness of our scheme.

  • Experimental Study on a Retrodirective System Utilizing Harmonic Reradiation from Rectenna Open Access

    Tomohiko MITANI  Shogo KAWASHIMA  Naoki SHINOHARA  

     
    PAPER

      Vol:
    E102-C No:10
      Page(s):
    666-672

    A retrodirective system utilizing harmonic reradiation from a rectenna is developed and verified for long-range wireless power transfer applications, such as low-power or battery-less devices and lightweight aerial vehicles. The second harmonic generated by the rectifying circuit is used instead of a pilot signal, and thus an oscillator for creating the pilot signal is not required. The proposed retrodirective system consists of a 2.45 GHz transmitter with a two-element phased array antenna, a 4.9 GHz direction-of-arrival (DoA) estimation system, a phase control system, and a rectenna. The rectenna, consisting of a half-wave dipole antenna, receives microwave power from the 2.45 GHz transmitter and reradiates the harmonic toward the 4.9 GHz DoA estimation system. The rectenna characteristics and experimental demonstrations of the proposed retrodirective system are described. From measurement results, the dc output power pattern for the developed retrodirective system is in good agreement with that obtained using manual beam steering. The measured DoA estimation errors are within the range of -2.4° to 4.8°.

  • New Asymptotically Optimal Optical Orthogonal Signature Pattern Codes from Cyclic Codes

    Lin-Zhi SHEN  

     
    LETTER-Coding Theory

      Vol:
    E102-A No:10
      Page(s):
    1416-1419

    Optical orthogonal signature pattern codes (OOSPCs) have attracted great attention due to their important application in the spatial code-division multiple-access network for image transmission. In this paper, we give a construction for OOSPCs based on cyclic codes over Fp. Applying this construction with the Reed-Solomon codes and the generalized Berlekamp-Justesen codes, we obtain two classes of asymptotically optimal OOSPCs.

  • A Micro-Code-Based IME Engine for HEVC and Its Hardware Implementation

    Leilei HUANG  Yibo FAN  Chenhao GU  Xiaoyang ZENG  

     
    PAPER-Integrated Electronics

      Vol:
    E102-C No:10
      Page(s):
    756-765

    High Efficiency Video Coding (HEVC) standard is now becoming one of the most widespread video coding standards in the world. As a successor of H.264 standard, it aims to provide a much superior encoding performance. To fulfill this goal, several new notations along with the corresponding computation processes are introduced by this standard. Among those computation processes, the integer motion estimation (IME) is one of bottlenecks due to the complex partitions of the inter prediction units (PU) and the large search window commonly adopted. Many algorithms have been proposed to address this issue and usually put emphasis on a large search window and great computation amount. However, the coding efforts should be related to the scenes. To be more specific, for relatively static videos, a small search window along with a simple search scheme should be adopted to reduce the time cost and power consumption. In view of this, a micro-code-based IME engine is proposed in this paper, which could be applied with search schemes of different complexity. To test the performance, three different search schemes based on this engine are designed and evaluated under HEVC test model (HM) 16.9, achieving a B-D rate increase of 0.55/-0.07/-0.14%. Compared with our previous work, the hardware implementation is optimized to reduce 64.2% of the SRAMs bits and 32.8% of the logic gate count. The final design could support 4K×2K @139/85/37fps videos @500MHz.

  • Fair Deployment of an Unmanned Aerial Vehicle Base Station for Maximal Coverage

    Yancheng CHEN  Ning LI  Xijian ZHONG  Yan GUO  

     
    PAPER

      Pubricized:
    2019/04/26
      Vol:
    E102-B No:10
      Page(s):
    2014-2020

    Unmanned aerial vehicle mounted base stations (UAV-BSs) can provide wireless cellular service to ground users in a variety of scenarios. The efficient deployment of such UAV-BSs while optimizing the coverage area is one of the key challenges. We investigate the deployment of UAV-BS to maximize the coverage of ground users, and further analyzes the impact of the deployment of UAV-BS on the fairness of ground users. In this paper, we first calculated the location of the UAV-BS according to the QoS requirements of the ground users, and then the fairness of ground users is taken into account by calculating three different fairness indexes. The performance of two genetic algorithms, namely Standard Genetic Algorithm (SGA) and Multi-Population Genetic Algorithm (MPGA) are compared to solve the optimization problem of UAV-BS deployment. The simulations are presented showing that the performance of the two algorithms, and the fairness performance of the ground users is also given.

  • Analysis of Relevant Quality Metrics and Physical Parameters in Softness Perception and Assessment System

    Zhiyu SHAO  Juan WU  Qiangqiang OUYANG  

     
    PAPER-Rehabilitation Engineering and Assistive Technology

      Pubricized:
    2019/06/11
      Vol:
    E102-D No:10
      Page(s):
    2013-2024

    Many quality metrics have been proposed for the compliance perception to assess haptic device performance and perceived results. Perceived compliance may be influenced by factors such as object properties, experimental conditions and human perceptual habits. In this paper, analysis of softness perception was conducted to find out relevant quality metrics dominating in the compliance perception system and their correlation with perception results, by expressing these metrics by basic physical parameters that characterizing these factors. Based on three psychophysical experiments, just noticeable differences (JNDs) for perceived softness of combination of different stiffness coefficients and damping levels rendered by haptic devices were analyzed. Interaction data during the interaction process were recorded and analyzed. Preliminary experimental results show that the discrimination ability of softness perception changes with the ratio of damping to stiffness when subjects exploring at their habitual speed. Analysis results indicate that quality metrics of Rate-hardness, Extended Rate-hardness and ratio of damping to stiffness have high correlation for perceived results. Further analysis results show that parameters that reflecting object properties (stiffness, damping), experimental conditions (force bandwidth) and human perceptual habits (initial speed, maximum force change rate) lead to the change of these quality metrics, which then bring different perceptual feeling and finally result in the change of discrimination ability. Findings in this paper may provide a better understanding of softness perception and useful guidance in improvement of haptic and teleoperation devices.

  • Low-Profile and Small Monocone Antenna Composed of a Circular Plate and Three Oblique Short Elements

    Kazuya MATSUBAYASHI  Naobumi MICHISHITA  Hisashi MORISHITA  

     
    PAPER

      Vol:
    E102-C No:10
      Page(s):
    740-747

    A monocone antenna is a type of monopole antenna with wideband characteristics. In this paper, a low-profile and small monocone antenna is proposed, by loading a circular plate and three oblique short elements. The characteristics of the proposed antenna are analyzed via simulation. Consequently, a low-profile and small monocone antenna can be obtained while maintaining the wideband characteristics. The relative bandwidth of the proposed antenna (voltage standing wave ratio (VSWR) ≤ 2) is greater than 158.9%. The frequency band of digital terrestrial television broadcasting and the mobile communication systems (from 470 to 3600MHz) in Japan can be completely covered with VSWR ≤ 2. In addition, the radiation patterns of the proposed antenna are omni-directional. The proposed antenna is prototyped, and the validity of the simulation is verified through measurement.

  • Class-F GaN HEMT Amplifiers Using Compact CRLH Harmonic Tuning Stubs Designed Based on Negative Order Resonance Modes

    Shinichi TANAKA  Sota KOIZUMI  Ryo ISHIKAWA  Kazuhiko HONJO  

     
    PAPER

      Vol:
    E102-C No:10
      Page(s):
    691-698

    Extremely compact harmonic tuning circuits for class-F amplifiers are realized using composite right-/left-handed (CRLH) transmission line stubs. The proposed circuits take up only a small fraction of the amplifier circuit area and yet are capable of treating four harmonics up to the 5th with a single stub or double stub configuration. This has become possible by using the negative order resonance modes of the CRLH TL, allowing for flexible and simultaneous control of many harmonics by engineering the dispersion relation of the stub line. The CRLH harmonic tuning stubs for 2-GHz amplifiers were realized using surface mounting chip capacitors, whereas the stub for 4-GHz amplifiers was fabricated based fully on microstrip-line technology. The fabricated 2-GHz and 4-GHz GaN HEMT class-F amplifiers exhibited peak drain efficiency and peak PAE of more than 83% and 74%, respectively.

  • Block Level TLB Coalescing for Buddy Memory Allocator Open Access

    Jae Young HUR  

     
    LETTER-Computer System

      Pubricized:
    2019/07/17
      Vol:
    E102-D No:10
      Page(s):
    2043-2046

    Conventional TLB (Translation Lookaside Buffer) coalescing schemes do not fully exploit the contiguity that a memory allocator provides. The conventional schemes accordingly have certain performance overheads due to page table walks. To address this issue, we propose an efficient scheme, called block contiguity translation (BCT), that accommodates the block size information in a page table considering the Buddy algorithm. By fully exploiting the block-level contiguity, we can reduce the page table walks as certain physical memory is allocated in the contiguous way. Additionally, we present unified per-level page sizes to simplify the design and better utilize the contiguity information. Considering the state-of-the-art schemes as references, the comparative analysis and the performance simulations are conducted. Experiments indicate that the proposed scheme can improve the memory system performance with moderate hardware overheads.

  • Vector Quantization of High-Dimensional Speech Spectra Using Deep Neural Network

    JianFeng WU  HuiBin QIN  YongZhu HUA  LiHuan SHAO  Ji HU  ShengYing YANG  

     
    LETTER-Artificial Intelligence, Data Mining

      Pubricized:
    2019/07/02
      Vol:
    E102-D No:10
      Page(s):
    2047-2050

    This paper proposes a deep neural network (DNN) based framework to address the problem of vector quantization (VQ) for high-dimensional data. The main challenge of applying DNN to VQ is how to reduce the binary coding error of the auto-encoder when the distribution of the coding units is far from binary. To address this problem, three fine-tuning methods have been adopted: 1) adding Gaussian noise to the input of the coding layer, 2) forcing the output of the coding layer to be binary, 3) adding a non-binary penalty term to the loss function. These fine-tuning methods have been extensively evaluated on quantizing speech magnitude spectra. The results demonstrated that each of the methods is useful for improving the coding performance. When implemented for quantizing 968-dimensional speech spectra using only 18-bit, the DNN-based VQ framework achieved an averaged PESQ of about 2.09, which is far beyond the capability of conventional VQ methods.

  • Multi Model-Based Distillation for Sound Event Detection Open Access

    Yingwei FU  Kele XU  Haibo MI  Qiuqiang KONG  Dezhi WANG  Huaimin WANG  Tie HONG  

     
    LETTER-Artificial Intelligence, Data Mining

      Pubricized:
    2019/07/08
      Vol:
    E102-D No:10
      Page(s):
    2055-2058

    Sound event detection is intended to identify the sound events in audio recordings, which has widespread applications in real life. Recently, convolutional recurrent neural network (CRNN) models have achieved state-of-the-art performance in this task due to their capabilities in learning the representative features. However, the CRNN models are of high complexities with millions of parameters to be trained, which limits their usage for the mobile and embedded devices with limited computation resource. Model distillation is effective to distill the knowledge of a complex model to a smaller one, which can be deployed on the devices with limited computational power. In this letter, we propose a novel multi model-based distillation approach for sound event detection by making use of the knowledge from models of multiple teachers which are complementary in detecting sound events. Extensive experimental results demonstrated that our approach achieves a compression ratio about 50 times. In addition, better performance is obtained for the sound event detection task.

  • A Deep Learning Approach to Writer Identification Using Inertial Sensor Data of Air-Handwriting

    Yanfang DING  Yang XUE  

     
    LETTER-Pattern Recognition

      Pubricized:
    2019/07/18
      Vol:
    E102-D No:10
      Page(s):
    2059-2063

    To the best of our knowledge, there are a few researches on air-handwriting character-level writer identification only employing acceleration and angular velocity data. In this paper, we propose a deep learning approach to writer identification only using inertial sensor data of air-handwriting. In particular, we separate different representations of degree of freedom (DoF) of air-handwriting to extract local dependency and interrelationship in different CNNs separately. Experiments on a public dataset achieve an average good performance without any extra hand-designed feature extractions.

  • Channel-Alignment Based Non-Orthogonal Multiple Access Techniques

    Changyong SHIN  Se-Hyoung CHO  

     
    LETTER-Communication Theory and Signals

      Vol:
    E102-A No:10
      Page(s):
    1431-1437

    This letter presents a non-orthogonal multiple access (NOMA) technique for a two-cell multiple-input multiple-output (MIMO) system that exploits the alignments of inter-cell interference channels and signal channels within a cluster in a cell. The proposed technique finds combiner vectors for users that align the inter-cell interference channels and the signal channels simultaneously. This technique utilizes the aligned interference and signal channels to obtain precoder matrices for base stations through which each data stream modulated by NOMA can be transmitted to the intended cluster without interference. In addition, we derive the sufficient condition for transmit and receive antenna configurations in the MIMO NOMA systems to eliminate inter-cell interference and inter-cluster interference simultaneously. Because the proposed technique effectively suppresses the inter-cell interference, it achieves a higher degree of freedom than the existing techniques relying on an avoidance of inter-cell interference, thereby obtaining a better sum rate performance in high SNR regions. Furthermore, we present the hybrid MIMO NOMA technique, which combines the MIMO NOMA technique exploiting channel alignment with the existing techniques boosting the received signal powers. Using the benefits from these techniques, the proposed hybrid technique achieves a good performance within all SNR regions. The simulation results successfully demonstrate the effectiveness of the proposed techniques on the sum rate performance.

  • Hybridizing Dragonfly Algorithm with Differential Evolution for Global Optimization Open Access

    MeiJun DUAN  HongYu YANG  Bo YANG  XiPing WU  HaiJun LIANG  

     
    PAPER-Fundamentals of Information Systems

      Pubricized:
    2019/07/17
      Vol:
    E102-D No:10
      Page(s):
    1891-1901

    Due to its simplicity and efficiency, differential evolution (DE) has gained the interest of researchers from various fields for solving global optimization problems. However, it is prone to premature convergence at local minima. To overcome this drawback, a novel hybrid dragonfly algorithm with differential evolution (Hybrid DA-DE) for solving global optimization problems is proposed. Firstly, a novel mutation operator is introduced based on the dragonfly algorithm (DA). Secondly, the scaling factor (F) is adjusted in a self-adaptive and individual-dependent way without extra parameters. The proposed algorithm combines the exploitation capability of DE and exploration capability of DA to achieve optimal global solutions. The effectiveness of this algorithm is evaluated using 30 classical benchmark functions with sixteen state-of-the-art meta-heuristic algorithms. A series of experimental results show that Hybrid DA-DE outperforms other algorithms significantly. Meanwhile, Hybrid DA-DE has the best adaptability to high-dimensional problems.

2001-2020hit(20498hit)