The search functionality is under construction.

Author Search Result

[Author] Yin CHEN(11hit)

1-11hit
  • A Low-Complexity Interpolation Method for Deinterlacing

    Pei-Yin CHEN  Yao-Hsien LAI  

     
    LETTER-Image Processing and Video Processing

      Vol:
    E90-D No:2
      Page(s):
    606-608

    A direction-oriented spatial interpolation technique for image de-interlacing is presented in this letter. The experimental results demonstrate that our method achieves excellent performance in terms of both objective and subjective image quality. The proposed algorithm also has a very computationally simple structure, and proves to be a good candidate for low-cost hardware interpolator.

  • A Low-Cost CAVLC Encoder

    Pei-Yin CHEN  Yi-Ming LIN  

     
    LETTER-Electronic Circuits

      Vol:
    E89-C No:12
      Page(s):
    1950-1953

    In H.264, the context-based adaptive variable length coding (CAVLC) is used for lossless compression. Direct table-lookup implementation requires higher cost because it employs a larger memory to produce the encoded results. In this letter, we present a more efficient technique for CAVLC implementation. Compared with those previous CAVLC chips, our design requires the lowest hardware cost.

  • Throughput Capacity Study for MANETs with Erasure Coding and Packet Replication

    Bin YANG  Yin CHEN  Guilin CHEN  Xiaohong JIANG  

     
    PAPER-Network

      Vol:
    E98-B No:8
      Page(s):
    1537-1552

    Throughput capacity is of great importance for the design and performance optimization of mobile ad hoc networks (MANETs). We study the exact per node throughput capacity of MANETs under a general 2HR-(g, x, f) routing scheme which combines erasure coding and packet replication techniques. Under this scheme, a source node first encodes a group of g packets into x (x ≥ g) distinct coded packets, and then replicates each of the coded packets to at most f relay nodes which help to forward them to the destination node. All original packets can be recovered once the destination node receives any g distinct coded packets of the group. To study the throughput capacity, we first construct two absorbing Markov chain models to depict the complicated packet delivery process under the routing scheme. Based on these Markov models, an analytical expression of the throughput capacity is derived. Extensive simulation and numerical results are provided to verify the accuracy of theoretical results on throughput capacity and to illustrate how system parameters will affect the throughput capacity in MANETs. Interestingly, we find that the replication of coded packets can improve the throughput capacity when the parameter x is relatively small.

  • An Efficient VLSI Architecture of 1-D Lifting Discrete Wavelet Transform

    Pei-Yin CHEN  Shung-Chih CHEN  

     
    LETTER-Integrated Electronics

      Vol:
    E87-C No:11
      Page(s):
    2009-2014

    An efficient VLSI architecture for 1-D lifting DWT is proposed in this paper. To achieve higherhardware utilization and higher throughput, the computations of all resolution levels are folded to both the same high-pass and low-pass filters. Besides, the number of registers in the folded architecture is minimized by using the generalized lifetime analysis. Owing to its regular and flexible structure, the design can be extended easily into different resolution levels, and its area is independent of the length of the 1-D input sequence. Compared with other known architectures, our design requires the least computing time for 1-D lifting DWT.

  • VLSI Implementation for Fuzzy Membership-Function Generator

    Pei-Yin CHEN  

     
    LETTER-VLSI Systems

      Vol:
    E86-D No:6
      Page(s):
    1122-1125

    Correct and quick generation of a membership function is the key point when we implement a real-time fuzzy logic controller. In this Letter, we presented two efficient VLSI architectures, one to generate triangle-shaped and the other to generate trapezoid-shaped membership functions. Simulation results show that our designs require lower hardware cost but achieve faster working rate.

  • Constraint-Based Software Specifications and Verification Using UML

    Chin-Feng FAN  Chun-Yin CHENG  

     
    PAPER-Software Engineering

      Vol:
    E89-D No:6
      Page(s):
    1914-1922

    Constraint-based software specifications enable run-time monitoring to detect probable risk events and ensure the desired system behavior. SpecTRM-RL is a well-developed constraint-based specification method for computer-controlled systems. However, it is desirable to express constraints in familiar visual models. To provide better visualization and popularity, we developed methods to represent all the SpecTRM-RL constraint types in UML. We have also extended SpecTRM's constraints by adding relational and global constraints, and then expressed them in OCL. Safety verification of these specifications is also proposed. We developed a systematic way to construct fault trees for safety analysis based on UML diagrams. Due to the generality of UML as well as the defensive manner of constraints and fault tree analysis, our approach can be adapted for both general applications and safety-critical applications.

  • Parameters Estimation of Impulse Noise for Channel Coded Systems over Fading Channels

    Chun-Yin CHEN  Mao-Ching CHIU  

     
    PAPER-Wireless Communication Technologies

      Pubricized:
    2021/01/18
      Vol:
    E104-B No:7
      Page(s):
    903-912

    In this paper, we propose a robust parameters estimation algorithm for channel coded systems based on the low-density parity-check (LDPC) code over fading channels with impulse noise. The estimated parameters are then used to generate bit log-likelihood ratios (LLRs) for a soft-inputLDPC decoder. The expectation-maximization (EM) algorithm is used to estimate the parameters, including the channel gain and the parameters of the Bernoulli-Gaussian (B-G) impulse noise model. The parameters can be estimated accurately and the average number of iterations of the proposed algorithm is acceptable. Simulation results show that over a wide range of impulse noise power, the proposed algorithm approaches the optimal performance under different Rician channel factors and even under Middleton class-A (M-CA) impulse noise models.

  • Discriminative Dictionary Learning with Low-Rank Error Model for Robust Crater Recognition

    An LIU  Maoyin CHEN  Donghua ZHOU  

     
    LETTER-Image Recognition, Computer Vision

      Pubricized:
    2015/02/18
      Vol:
    E98-D No:5
      Page(s):
    1116-1119

    Robust crater recognition is a research focus on deep space exploration mission, and sparse representation methods can achieve desirable robustness and accuracy. Due to destruction and noise incurred by complex topography and varied illumination in planetary images, a robust crater recognition approach is proposed based on dictionary learning with a low-rank error correction model in a sparse representation framework. In this approach, all the training images are learned as a compact and discriminative dictionary. A low-rank error correction term is introduced into the dictionary learning to deal with gross error and corruption. Experimental results on crater images show that the proposed method achieves competitive performance in both recognition accuracy and efficiency.

  • A Bus Crowdedness Sensing System Using Deep-Learning Based Object Detection

    Wenhao HUANG  Akira TSUGE  Yin CHEN  Tadashi OKOSHI  Jin NAKAZAWA  

     
    PAPER

      Pubricized:
    2022/06/23
      Vol:
    E105-D No:10
      Page(s):
    1712-1720

    Crowdedness of buses is playing an increasingly important role in the disease control of COVID-19. The lack of a practical approach to sensing the crowdedness of buses is a major problem. This paper proposes a bus crowdedness sensing system which exploits deep learning-based object detection to count the numbers of passengers getting on and off a bus and thus estimate the crowdedness of buses in real time. In our prototype system, we combine YOLOv5s object detection model with Kalman Filter object tracking algorithm to implement a sensing algorithm running on a Jetson nano-based vehicular device mounted on a bus. By using the driving recorder video data taken from real bus, we experimentally evaluate the performance of the proposed sensing system to verify that our proposed system system improves counting accuracy and achieves real-time processing at the Jetson Nano platform.

  • VLSI Implementation of Lifting Discrete Wavelet Transform Using the 5/3 Filter

    Pei-Yin CHEN  

     
    PAPER-VLSI Systems

      Vol:
    E85-D No:12
      Page(s):
    1893-1897

    In this paper, a VLSI architecture for lifting-based discrete wavelet transform (LDWT) is presented. Our architecture folds the computations of all resolution levels into the same low-pass and high-pass units to achieve higher hardware utilization. Due to the regular and flexible structure of the design, its area is independent of the length of the 1-D input sequence, and its latency is independent of the number of resolution levels. For the computations of analysis process of N-sample 1-D 3-level LDWT, our design takes about N clock cycles and requires 2 multipliers, 4 adders, and 22 registers. It is fabricated with TSMC 0.35-µm cell library and has a die size of 1.21.2 mm2. The power dissipation of the chip is about 0.4 W at the clock rate of 80 MHz.

  • VLSI Architecture for 2-D 3-Level Lifting-Based Discrete Wavelet Transform

    Pei-Yin CHEN  

     
    LETTER-VLSI Design Technology and CAD

      Vol:
    E87-A No:1
      Page(s):
    275-279

    Discrete wavelet transform has been successfully used in many image processing applications. In this paper, we present an efficient VLSI architecture for 2-D 3-level lifting-based discrete wavelet transform using the (5, 3) filter. All three-level coefficients are computed interlacingly and periodically to achieve higher hardware utilization and better throughput. In comparison with other VLSI architectures, our architecture requires less size of storage and faster computation speed.