• Title/Summary/Keyword: Chen algorithm

Search Result 496, Processing Time 0.029 seconds

Majorization-Minimization-Based Sparse Signal Recovery Method Using Prior Support and Amplitude Information for the Estimation of Time-varying Sparse Channels

  • Wang, Chen;Fang, Yong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.10
    • /
    • pp.4835-4855
    • /
    • 2018
  • In this paper, we study the sparse signal recovery that uses information of both support and amplitude of the sparse signal. A convergent iterative algorithm for sparse signal recovery is developed using Majorization-Minimization-based Non-convex Optimization (MM-NcO). Furthermore, it is shown that, typically, the sparse signals that are recovered using the proposed iterative algorithm are not globally optimal and the performance of the iterative algorithm depends on the initial point. Therefore, a modified MM-NcO-based iterative algorithm is developed that uses prior information of both support and amplitude of the sparse signal to enhance recovery performance. Finally, the modified MM-NcO-based iterative algorithm is used to estimate the time-varying sparse wireless channels with temporal correlation. The numerical results show that the new algorithm performs better than related algorithms.

DIntrusion Detection in WSN with an Improved NSA Based on the DE-CMOP

  • Guo, Weipeng;Chen, Yonghong;Cai, Yiqiao;Wang, Tian;Tian, Hui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.11
    • /
    • pp.5574-5591
    • /
    • 2017
  • Inspired by the idea of Artificial Immune System, many researches of wireless sensor network (WSN) intrusion detection is based on the artificial intelligent system (AIS). However, a large number of generated detectors, black hole, overlap problem of NSA have impeded further used in WSN. In order to improve the anomaly detection performance for WSN, detector generation mechanism need to be improved. Therefore, in this paper, a Differential Evolution Constraint Multi-objective Optimization Problem based Negative Selection Algorithm (DE-CMOP based NSA) is proposed to optimize the distribution and effectiveness of the detector. By combining the constraint handling and multi-objective optimization technique, the algorithm is able to generate the detector set with maximized coverage of non-self space and minimized overlap among detectors. By employing differential evolution, the algorithm can reduce the black hole effectively. The experiment results show that our proposed scheme provides improved NSA algorithm in-terms, the detectors generated by the DE-CMOP based NSA more uniform with less overlap and minimum black hole, thus effectively improves the intrusion detection performance. At the same time, the new algorithm reduces the number of detectors which reduces the complexity of detection phase. Thus, this makes it suitable for intrusion detection in WSN.

A Model Stacking Algorithm for Indoor Positioning System using WiFi Fingerprinting

  • JinQuan Wang;YiJun Wang;GuangWen Liu;GuiFen Chen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.4
    • /
    • pp.1200-1215
    • /
    • 2023
  • With the development of IoT and artificial intelligence, location-based services are getting more and more attention. For solving the current problem that indoor positioning error is large and generalization is poor, this paper proposes a Model Stacking Algorithm for Indoor Positioning System using WiFi fingerprinting. Firstly, we adopt a model stacking method based on Bayesian optimization to predict the location of indoor targets to improve indoor localization accuracy and model generalization. Secondly, Taking the predicted position based on model stacking as the observation value of particle filter, collaborative particle filter localization based on model stacking algorithm is realized. The experimental results show that the algorithm can control the position error within 2m, which is superior to KNN, GBDT, Xgboost, LightGBM, RF. The location accuracy of the fusion particle filter algorithm is improved by 31%, and the predicted trajectory is close to the real trajectory. The algorithm can also adapt to the application scenarios with fewer wireless access points.

Joint Optimization for Congestion Avoidance in Cognitive Radio WMNs under SINR Model

  • Jia, Jie;Lin, Qiusi;Chen, Jian;Wang, Xingwei
    • ETRI Journal
    • /
    • v.35 no.3
    • /
    • pp.550-553
    • /
    • 2013
  • Due to limited spectrum resources and differences in link loads, network congestion is one of the key issues in cognitive radio wireless mesh networks. In this letter, a congestion avoidance model with power control, channel allocation, and routing under the signal-to-interference-and-noise ratio is presented. As a contribution, a nested optimization scheme combined with a genetic algorithm and linear programming solver is proposed. Extensive simulation results are presented to demonstrate the effectiveness of our algorithm.

Computation Controllable Mode Decision and Motion Estimation for Scalable Video Coding

  • Zheng, Liang-Wei;Li, Gwo-Long;Chen, Mei-Juan;Yeh, Chia-Hung;Tai, Kuang-Han;Wu, Jian-Sheng
    • ETRI Journal
    • /
    • v.35 no.3
    • /
    • pp.469-479
    • /
    • 2013
  • This paper proposes an efficient computation-aware mode decision and search point (SP) allocation algorithm for spatial and quality scalabilities in Scalable Video Coding. In our proposal, a linear model is derived to allocate the computation for macroblocks in enhancement layers by using the rate distortion costs of the base layer. In addition, an adaptive SP decision algorithm is proposed to decide the number of SPs for motion estimation under the constraint of the allocated computation. Experiment results demonstrate that the proposed algorithm allocates the computation resource efficiently and outperforms other works in rate distortion performance under the same computational availability constraint.

ON [1, 2]-DOMINATION IN TREES

  • Chen, Xue-Gang;Sohn, Moo Young
    • Communications of the Korean Mathematical Society
    • /
    • v.33 no.2
    • /
    • pp.631-638
    • /
    • 2018
  • Chellai et al. [3] gave an upper bound on the [1, 2]-domination number of tree and posed an open question "how to classify trees satisfying the sharp bound?". Yang and Wu [5] gave a partial solution for tree of order n with ${\ell}$-leaves such that every non-leaf vertex has degree at least 4. In this paper, we give a new upper bound on the [1, 2]-domination number of tree which extends the result of Yang and Wu. In addition, we design a polynomial time algorithm for solving the open question. By using this algorithm, we give a characterization on the [1, 2]-domination number for trees of order n with ${\ell}$ leaves satisfying $n-{\ell}$. Thereby, the open question posed by Chellai et al. is solved.

Image recognition technology in rotating machinery fault diagnosis based on artificial immune

  • Zhu, Dachang;Feng, Yanping;Chen, Qiang;Cai, Jinbao
    • Smart Structures and Systems
    • /
    • v.6 no.4
    • /
    • pp.389-403
    • /
    • 2010
  • By using image recognition technology, this paper presents a new fault diagnosis method for rotating machinery with artificial immune algorithm. This method focuses on the vibration state parameter image. The main contribution of this paper is as follows: firstly, 3-D spectrum is created with raw vibrating signals. Secondly, feature information in the state parameter image of rotating machinery is extracted by using Wavelet Packet transformation. Finally, artificial immune algorithm is adopted to diagnose rotating machinery fault. On the modeling of 600MW turbine experimental bench, rotor's normal rate, fault of unbalance, misalignment and bearing pedestal looseness are being examined. It's demonstrated from the diagnosis example of rotating machinery that the proposed method can improve the accuracy rate and diagnosis system robust quality effectively.

Conflict Graph-based Downlink Resource Allocation and Scheduling for Indoor Visible Light Communications

  • Liu, Huanlin;Dai, Hongyue;Chen, Yong;Xia, Peijie
    • Journal of the Optical Society of Korea
    • /
    • v.20 no.1
    • /
    • pp.36-41
    • /
    • 2016
  • Visible Light Communication (VLC) using Light Emitting Diodes (LEDs) within the existing lighting infrastructure can reduce the implementation cost and may gain higher throughput than radio frequency (RF) or Infrared (IR) based wireless systems. Current indoor VLC systems may suffer from poor downlink resource allocation problems and small system throughput. To address these two issues, we propose an algorithm called a conflict graph scheduling (CGS) algorithm, including a conflict graph and a scheme that is based on the conflict graph. The conflict graph can ensure that users are able to transmit data without interference. The scheme considers the user fairness and system throughput, so that they both can get optimum values. Simulation results show that the proposed algorithm can guarantee significant improvement of system throughput under the premise of fairness.

ON GENERALIZED NONLINEAR QUASI-VARIATIONAL-LIKE INCLUSIONS DEALING WITH (h,η)-PROXIMAL MAPPING

  • Liu, Zeqing;Chen, Zhengsheng;Shim, Soo-Hak;Kang, Shin-Min
    • Journal of the Korean Mathematical Society
    • /
    • v.45 no.5
    • /
    • pp.1323-1339
    • /
    • 2008
  • In this paper, a new class of $(h,{\eta})$-proximal for proper functionals in Hilbert spaces is introduced. The existence and Lip-schitz continuity of the $(h,{\eta})$-proximal mappings for proper functionals are proved. A class of generalized nonlinear quasi-variational-like inclusions in Hilbert spaces is introduced. A perturbed three-step iterative algorithm with errors for the generalized nonlinear quasi-variational-like inclusion is suggested. The existence and uniqueness theorems of solution for the generalized nonlinear quasi-variational-like inclusion are established. The convergence and stability results of iterative sequence generated by the perturbed three-step iterative algorithm with errors are discussed.

High Performance De-interlacing Algorithm Based on Region Adaptive Interpolation Filter

  • Yang, Yang;Chen, Xiangdong;Wang, Jin;Jeong, Jechang
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2011.11a
    • /
    • pp.200-203
    • /
    • 2011
  • In order to convert interlaced video into progressive scanning format, this paper proposed a high performance de-interlacing algorithm based on region adaptive interpolation filter design. Specifically, usage of the 6-tap filter is only for the most complex region, but for the smooth and regular edge region, much more correlated filter such as 2-tap or 4-tap filter should be used instead. According to the experimental results, the proposed algorithm has achieved noticeably good performance.

  • PDF