• 제목/요약/키워드: BING algorithm

검색결과 41건 처리시간 0.037초

Fast Extraction of Pedestrian Candidate Windows Based on BING Algorithm

  • Zeng, Jiexian;Fang, Qi;Wu, Zhe;Fu, Xiang;Leng, Lu
    • Journal of Multimedia Information System
    • /
    • 제6권1호
    • /
    • pp.1-6
    • /
    • 2019
  • In the field of industrial applications, the real-time performance of the target detection problem is very important. The most serious time consumption in the pedestrian detection process is the extraction phase of the candidate window. To accelerate the speed, in this paper, a fast extraction of pedestrian candidate window based on the BING (Binarized Normed Gradients) algorithm replaces the traditional sliding window scanning. The BING features are extracted with the positive and negative samples and input into the two-stage SVM (Support Vector Machine) classifier for training. The obtained BING template may include a pedestrian candidate window. The trained template is loaded during detection, and the extracted candidate windows are input into the classifier. The experimental results show that the proposed method can extract fewer candidate window and has a higher recall rate with more rapid speed than the traditional sliding window detection method, so the method improves the detection speed while maintaining the detection accuracy. In addition, the real-time requirement is satisfied.

Efficient Mixed Topology Configuration Algorithm for Optical Carrier Ethernet

  • 리빙빙;양원혁;김영천
    • 한국통신학회논문지
    • /
    • 제36권9B호
    • /
    • pp.1039-1048
    • /
    • 2011
  • Carrier Ethernet, which extend The algorithm based on constructing the mixed topology and performing link stretching, MT/s, has been proposed for designing cost-efficient Carrier Ethernet in optical network with multi-line-rate. However, the MT/s algorithm has high blocking ratio because the wavelength capacity is fully allocated without considering the load balance of network. In this paper, we propose an efficient mixed topology configuration (EMTC) algorithm by modifying MT/s algorithm. In order to reduce blocking ratio, we adapt a threshold for each link to restrict the link utilization so that traffic load can be distributed over whole network. We also apply the EMTC algorithm into optical hybrid switched network to evaluate the availability of our algorithm for different applications. The performance of the EMTC algorithm is compared with that of MT/s algorithm through OPNET simulation. The simulation results show that our algorithm achieve lower blocking ratio than the MT/s algorithm. Moreover, in hybrid switched network, our algorithm performs better than MT/s algorithm in terms of packet loss ratio and end-to-end delay.

A New Iterative LT Decoding Algorithm for Binary and Nonbinary Galois Fields

  • Mao, Yuexin;Huang, Jie;Wang, Bing;Huang, Jianzhong;Zhou, Wei;Zhou, Shengli
    • Journal of Communications and Networks
    • /
    • 제15권4호
    • /
    • pp.411-421
    • /
    • 2013
  • Digital fountain codes are record-breaking codes for erasure channels. They have many potential applications in both wired and wireless communications. Most existing digital fountain codes operate over binary fields using an iterative belief-propagation (BP) decoding algorithm. In this paper, we propose a new iterative decoding algorithm for both binary and nonbinary fields. The basic form of our proposed algorithm considers both degree-1 and degree-2 check nodes (instead of only degree-1 check nodes as in the original BP decoding scheme), and has linear complexity. Extensive simulation demonstrates that it outperforms the original BP decoding scheme, especially for a small number of source packets. The enhanced form of the proposed algorithm combines the basic form of the algorithm and a guess-based algorithm to further improve the decoding performance. Simulation results demonstrate that it can provide better decoding performance than the guess-based algorithm with fewer guesses, and can achieve decoding performance close to that of the maximum likelihood decoder at a much lower decoding complexity. Last, we show that our nonbinary scheme has the potential to outperform the binary scheme when choosing suitable degree distributions, and furthermore it is insensitive to the size of the Galois field.

Research on the Energy Hole Problem Based on Non-uniform Node Distribution for Wireless Sensor Networks

  • Liu, Tang;Peng, Jian;Wang, Xiao-Fen;Yang, Jin;Guo, Bing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권9호
    • /
    • pp.2017-2036
    • /
    • 2012
  • Based on the current solutions to the problem of energy hole, this paper proposed a nonuniform node distribution clustering algorithm, NNDC. Firstly, we divide the network into rings, and then have an analysis and calculation on nodes' energy consumption in each ring of the network when clustering algorithm is applied to collect data. We also put forward a scheme of nonuniform node distribution on the basis of the proportion of nodes' energy consumption in each ring, and change nodes' active/hibernating states under density control mechanism when network coverage is guaranteed. Simulation shows NNDC algorithm can satisfyingly balance nodes' energy consumption and effectively avoid the problem of energy hole.

Twofish 암호알고리즘의 처리속도 향상을 위한 MDS 성능개선에 관한 연구 (A Study on the MDS performance improvement for Twofish cryptographic algorithm speed-up)

  • 이선근;김환용
    • 대한전자공학회논문지SD
    • /
    • 제42권10호
    • /
    • pp.35-38
    • /
    • 2005
  • 본 논문은 Rijndael 암호알고리즘에 비하여 알고리즘 자체가 간결하며 구현의 용이성이 좋지만 처리속도가 느린 단점을 가진 Twofish 암호알고리즘의 속도를 향상시키기 위하여 MDS 블록을 새롭게 설계하였다. 설계된 MDS 블록은 Twofish 암호 시스템의 critical path를 점유하게 되는 블록으로서 처리과정중의 병목현상으로 인한 속도저하의 문제점이 존재하였다. 이러한 MDS 블록에서 연산자로 사용되는 곱셈연산을 LUT 연산과 modulo-2 연산을 사용하여 MDS 자체에 대한 속도저하 및 병목현상을 제거하였다. 이러한 결과로 새롭게 설계된 MDS 블록을 포함하는 Twofish 암호시스템은 기존 Twofish 암호시스템에 비하여 $10\%$정도 처리속도의 향상을 가져옴을 확인하였다.

Pattern Recognition of Monitored Waveforms from Power Supplies Feeding High-Speed Rail Systems

  • Gu, Wei;Zhang, Shuai;Yuan, Xiaodong;Chen, Bing;Bai, Jingjing
    • Journal of Electrical Engineering and Technology
    • /
    • 제11권1호
    • /
    • pp.55-64
    • /
    • 2016
  • The development of high-speed rail (HSR) has had a major impact on the power supply grid. Based on the monitored waveforms of HSR, a pattern recognition approach is proposed for the first time in this paper to identify the operating conditions. To reduce the data dimensions for monitored waveforms, the principal component analysis (PCA) algorithm was used to extract the characteristics and their waveforms from the monitored waveforms data. The dynamic time wrapping (DTW) algorithm was then used to identify the operating conditions of the HSR. Cases studies show that the proposed approach is effective and feasible, and that it is possible to identify the real-time operating conditions based on the monitored waveforms.

미지의 비선형 시스템 제어를 위한 DNU와 GA알고리즘 적용에 관한 연구 (Dynamic Neural Units and Genetic Algorithms With Applications to the Control of Unknown Nonlinear Systems)

  • ;;조현섭;전정채
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2002년도 하계학술대회 논문집 D
    • /
    • pp.2486-2489
    • /
    • 2002
  • Pool of the central nervous system. In this thesis, we present a genetic DNU-control scheme for unknown nonlinear systems. Our method is different from those using supervised learning algorithms, such as the backpropagation (BP) algorithm, that needs training information in each step. The contributions of this thesis are the new approach to constructing neural network architecture and its training.

  • PDF

[ $H_2$ ]-optimal Control with Regional Pole Assignment via State Feedback

  • Wang Guo-Sheng;Liang Bing;Duan Guang-Ren
    • International Journal of Control, Automation, and Systems
    • /
    • 제4권5호
    • /
    • pp.653-659
    • /
    • 2006
  • The design of $H_2$-optimal control with regional pole assignment via state feedback in linear time-invariant systems is investigated. The aim is to find a state feedback controller such that the closed-loop system has the desired eigenvalues lying in some desired stable regions and attenuates the disturbance between the output vector and the disturbance vector. Based on a proposed result of parametric eigenstructure assignment via state feedback in linear systems, the considered $H_2$-optimal control problem is changed into a minimization problem with certain constraints, and a simple and effective algorithm is proposed for this considered problem. A numerical example and its simulation results show the simplicity and effectiveness of this proposed algorithm.

Scalable Coding of Depth Images with Synthesis-Guided Edge Detection

  • Zhao, Lijun;Wang, Anhong;Zeng, Bing;Jin, Jian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권10호
    • /
    • pp.4108-4125
    • /
    • 2015
  • This paper presents a scalable coding method for depth images by considering the quality of synthesized images in virtual views. First, we design a new edge detection algorithm that is based on calculating the depth difference between two neighboring pixels within the depth map. By choosing different thresholds, this algorithm generates a scalable bit stream that puts larger depth differences in front, followed by smaller depth differences. A scalable scheme is also designed for coding depth pixels through a layered sampling structure. At the receiver side, the full-resolution depth image is reconstructed from the received bits by solving a partial-differential-equation (PDE). Experimental results show that the proposed method improves the rate-distortion performance of synthesized images at virtual views and achieves better visual quality.