• Title/Summary/Keyword: weighted algorithm

Search Result 1,102, Processing Time 0.029 seconds

Object Tracking with the Multi-Templates Regression Model Based MS Algorithm

  • Zhang, Hua;Wang, Lijia
    • Journal of Information Processing Systems
    • /
    • v.14 no.6
    • /
    • pp.1307-1317
    • /
    • 2018
  • To deal with the problems of occlusion, pose variations and illumination changes in the object tracking system, a regression model weighted multi-templates mean-shift (MS) algorithm is proposed in this paper. Target templates and occlusion templates are extracted to compose a multi-templates set. Then, the MS algorithm is applied to the multi-templates set for obtaining the candidate areas. Moreover, a regression model is trained to estimate the Bhattacharyya coefficients between the templates and candidate areas. Finally, the geometric center of the tracked areas is considered as the object's position. The proposed algorithm is evaluated on several classical videos. The experimental results show that the regression model weighted multi-templates MS algorithm can track an object accurately in terms of occlusion, illumination changes and pose variations.

Design and Performance Evaluation of a Media Access Control Algorithm supporting Weighted Fairness among Users in Ethernet PON (Ethernet PON에서 가입자간 가중치 공평성을 보장하는 매체접근 제어 알고리즘의 설계 및 성능 분석)

  • 최은영;이재용;김병철;권영미
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.8
    • /
    • pp.45-53
    • /
    • 2004
  • This paper proposes and analyzes a new media access control (MAC) scheduling algorithm, “Interleaved Polling with Deficit Round Robin (IPDRR)” that supports weighted fairness among ONUs in Ethernet Passive Optical Network (PON). The purpose of the proposed IPDRR algerian is not only to eliminate the unused bandwidth of upstream ONU traffic, but also to provide weighted fair sharing of upstream bandwidth among ONUs in Ethernet PON systems. Simulation results show that the IPDRR improves the utilization of upstream channel by removing the unused bandwidth and provides weighted fairness among ONUs, although the IPACT scheduling is unfair according to traffic characteristics.

Image Restoration using Weighted Cross-Shape Median Filter (가중격자형 메디안 필터를 이용한 영상복원)

  • Na, Cheol-Hun;Kim, Su-Yeong;Han, Man-Soo;Kang, Seong-Jun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.10a
    • /
    • pp.711-714
    • /
    • 2015
  • A new technique for image restoration using Weighted cross-shaped median filter with edge-detection algorithm is proposed in this paper. It consists of simple hypothesis test for edge-detection, and makes use of the weighted cross-shape window. This method is applied to noise corrupted image and its results are compared with those of median filters. As for the experimental result, method of weighted cross-shape median filter is superior to other median filters.

  • PDF

Weighted sum Pareto optimization of a three dimensional passenger vehicle suspension model using NSGA-II for ride comfort and ride safety

  • Bagheri, Mohammad Reza;Mosayebi, Masoud;Mahdian, Asghar;Keshavarzi, Ahmad
    • Smart Structures and Systems
    • /
    • v.22 no.4
    • /
    • pp.469-479
    • /
    • 2018
  • The present research study utilizes a multi-objective optimization method for Pareto optimization of an eight-degree of freedom full vehicle vibration model, adopting a non-dominated sorting genetic algorithm II (NSGA-II). In this research, a full set of ride comfort as well as ride safety parameters are considered as objective functions. These objective functions are divided in to two groups (ride comfort group and ride safety group) where the ones in one group are in conflict with those in the other. Also, in this research, a special optimizing technique and combinational method consisting of weighted sum method and Pareto optimization are applied to transform Pareto double-objective optimization to Pareto full-objective optimization which can simultaneously minimize all objectives. Using this technique, the full set of ride parameters of three dimensional vehicle model are minimizing simultaneously. In derived Pareto front, unique trade-off design points can selected which are non-dominated solutions of optimizing the weighted sum comfort parameters versus weighted sum safety parameters. The comparison of the obtained results with those reported in the literature, demonstrates the distinction and comprehensiveness of the results arrived in the present study.

An Improved Weighted Filter for AWGN Removal (AWGN 제거를 위한 개선된 가중치 필터)

  • Long, Xu;Kim, Nam-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.5
    • /
    • pp.1227-1232
    • /
    • 2013
  • Recently, the expectation of quality about images over the increasing demand of digital devices is increasing with the development of the technology of the digital. But the images are degraded by a variety of causes, and the main reason is the noises. Therefore, the necessity of denoising comes to the fore, and the research for denoising is progressing dynamically. The images are mainly degraded by AWGN(additive white Gaussian noise), and the characteristics of denoising of existing methods such as mean filter are insufficient. In this paper, an algorithm combined by the spatial weighted filter and the modified adaptive weighted filter is proposed in order to effectively remove the AWGN. In the simulation result, the proposed algorithm showed excellent denoising capabilities.

CURVATURE-WEIGHTED SURFACE SIMPLIFICATION ALGORITHM USING VERTEX-BASED GEOMETRIC FEATURES

  • CHOI, HAN-SOO;GWON, DALHYEON;HAN, HEEJAE;KANG, MYUNGJOO
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.24 no.1
    • /
    • pp.23-37
    • /
    • 2020
  • The quadratic error metric (QEM) algorithm has been frequently used for simplification of triangular surface models that utilize the vertex-pair algorithm. Simplified models obtained using such algorithms present the advantage of smaller storage capacity requirement compared to the original models. However, a number of cases exist where significant features are lost geometrically, and these features can generally be preserved by utilizing the advantages of the curvature-weighted algorithm. Based on the vertex-based geometric features, a method capable of preserving the geometric features better than the previous algorithms is proposed in this work. To validate the effectiveness of the proposed method, a simplification experiment is conducted using several models. The results of the experiment indicate that the geometrically important features are preserved well when a local feature is present and that the error is similar to those of the previous algorithms when no local features are present.

Weighted Collaborative Representation and Sparse Difference-Based Hyperspectral Anomaly Detection

  • Wang, Qianghui;Hua, Wenshen;Huang, Fuyu;Zhang, Yan;Yan, Yang
    • Current Optics and Photonics
    • /
    • v.4 no.3
    • /
    • pp.210-220
    • /
    • 2020
  • Aiming at the problem that the Local Sparse Difference Index algorithm has low accuracy and low efficiency when detecting target anomalies in a hyperspectral image, this paper proposes a Weighted Collaborative Representation and Sparse Difference-Based Hyperspectral Anomaly Detection algorithm, to improve detection accuracy for a hyperspectral image. First, the band subspace is divided according to the band correlation coefficient, which avoids the situation in which there are multiple solutions of the sparse coefficient vector caused by too many bands. Then, the appropriate double-window model is selected, and the background dictionary constructed and weighted according to Euclidean distance, which reduces the influence of mixing anomalous components of the background on the solution of the sparse coefficient vector. Finally, the sparse coefficient vector is solved by the collaborative representation method, and the sparse difference index is calculated to complete the anomaly detection. To prove the effectiveness, the proposed algorithm is compared with the RX, LRX, and LSD algorithms in simulating and analyzing two AVIRIS hyperspectral images. The results show that the proposed algorithm has higher accuracy and a lower false-alarm rate, and yields better results.

Optimization of Tree-like Core Overlay in Hybrid-structured Application-layer Multicast

  • Weng, Jianguang;Zou, Xuelan;Wang, Minhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.12
    • /
    • pp.3117-3132
    • /
    • 2012
  • The tree topology in multicast systems has high transmission efficiency, low latency, but poor resilience to node failures. In our work, some nodes are selected as backbone nodes to construct a tree-like core overlay. Backbone nodes are reliable enough and have strong upload capacity as well, which is helpful to overcome the shortcomings of tree topology. The core overlay is organized into a spanning tree while the whole overlay is of mesh-like topology. This paper focuses on improving the performance of the application-layer multicast overlay by optimizing the core overlay which is periodically adjusted with the proposed optimization algorithm. Our approach is to construct the overlay tree based on the out-degree weighted reliability where the reliability of a node is weighted by its upload bandwidth (out-degree). There is no illegal solution during the evolution which ensures the evolution efficiency. Simulation results show that the proposed approach greatly enhances the reliability of the tree-like core overlay systems and achieves shorter delay simultaneously. Its reliability performance is better than the reliability-first algorithm and its delay is very close to that of the degree-first algorithm. The complexity of the proposed algorithm is acceptable for application. Therefore the proposed approach is efficient for the topology optimization of a real multicast overlay.

Bayesian Nonlinear Blind Channel Equalizer based on Gaussian Weighted MFCM

  • Han, Soo-Whan;Park, Sung-Dae;Lee, Jong-Keuk
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.12
    • /
    • pp.1625-1634
    • /
    • 2008
  • In this study, a modified Fuzzy C-Means algorithm with Gaussian weights (MFCM_GW) is presented for the problem of nonlinear blind channel equalization. The proposed algorithm searches for the optimal channel output states of a nonlinear channel based on received symbols. In contrast to conventional Euclidean distance in Fuzzy C-Means (FCM), the use of the Bayesian likelihood fitness function and the Gaussian weighted partition matrix is exploited in this method. In the search procedure, all possible sets of desired channel states are constructed by considering the combinations of estimated channel output states. The set of desired states characterized by the maxima] value of the Bayesian fitness is selected and updated by using the Gaussian weights. After this procedure, the Bayesian equalizer with the final desired states is implemented to reconstruct transmitted symbols. The performance of the proposed method is compared with those of a simplex genetic algorithm (GA), a hybrid genetic algorithm (GA merged with simulated annealing (SA):GASA), and a previously developed version of MFCM. In particular, a relative]y high accuracy and a fast search speed have been observed.

  • PDF

Weighted Neighbor-node Distribution Localization for Large-scale Wireless Sensor Networks (대규모 무선 센서 네트워크에서 이웃 노드 분포를 이용한 분산 위치인식 기법 및 구현)

  • Lee, Sang-Hoon;Lee, Ho-Jae;Lee, Sang-Hoon
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.255-256
    • /
    • 2008
  • Distributed localization algorithms are required for large-scale wireless sensor network applications. In this paper, we introduce an efficient algorithm, termed weighted neighbor-node distribution localization(WNDL), which emphasizes simple refinement and low system-load for low-cost and low-rate wireless sensors. We inspect WNDL algorithm through MATLAB simulation.

  • PDF