Affinity Propagation Clustering of Measurements for Multiple Extended Target Tracking
نویسندگان
چکیده
منابع مشابه
Affinity Propagation Clustering of Measurements for Multiple Extended Target Tracking
More measurements are generated by the target per observation interval, when the target is detected by a high resolution sensor, or there are more measurement sources on the target surface. Such a target is referred to as an extended target. The probability hypothesis density filter is considered an efficient method for tracking multiple extended targets. However, the crucial problem of how to ...
متن کاملAdaptive Affinity Propagation Clustering
Affinity propagation clustering (AP) has two limitations: it is hard to know what value of parameter ‘preference’ can yield an optimal clustering solution, and oscillations cannot be eliminated automatically if occur. The adaptive AP method is proposed to overcome these limitations, including adaptive scanning of preferences to search space of the number of clusters for finding the optimal clus...
متن کاملSubspace clustering using affinity propagation
This paper proposes a subspace clustering algorithm by introducing attribute weights in the affinity propagation algorithm. A new step is introduced to the affinity propagation process to iteratively update the attribute weights based on the current partition of the data. The relative magnitude of the attribute weights can be used to identify the subspaces in which clusters are embedded. Experi...
متن کاملAffinity Propagation Clustering Using Path Based Similarity
Clustering is a fundamental task in data mining. Affinity propagation clustering (APC) is an effective and efficient clustering technique that has been applied in various domains. APC iteratively propagates information between affinity samples, updates the responsibility matrix and availability matrix, and employs these matrices to choose cluster centers (or exemplars) of respective clusters. H...
متن کاملMap/Reduce Affinity Propagation Clustering Algorithm
The Affinity Propagation (AP) is a clustering algorithm that does not require pre-set K cluster numbers. We improve the original AP to Map/Reduce Affinity Propagation (MRAP) implemented in Hadoop, a distribute cloud environment. The architecture of MRAP is divided to multiple mappers and one reducer in Hadoop. In the experiments, we compare the clustering result of the proposed MRAP with the K-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sensors
سال: 2015
ISSN: 1424-8220
DOI: 10.3390/s150922646