Affinity Propagation is a state-of-the-art clustering method recently proposed by Frey and Dueck. It has been successfully applied to broad areas of computer science research because it has much better clustering performance than traditional clustering methods such as k-means. In order to obtain high quality sets of clusters, the original Affinity Propagation algorithm iteratively exchanges rea...

Clustering domain is vital part of data mining domain and widely used in different applications. In this project we are focusing on affinity propagation (AP) clustering which is presented recently to overcome many clustering problems in different clustering applications. Many clustering applications are based on static data. AP clustering approach is supporting only static data applications, he...

In this lecture, we study the Belief propagation algorithm(BP) and the Max Product algorithm(MP). Last lecture reminds us of that in MRF, computing the marginal probabilities of random variables and Maximum A Posteriori(MAP) assignment is important. The Belief Propagation algorithm is a popular algorithm that is used to compute marginal probability of random variables. Max Product algorithm is ...

We propose an algorithm to compute the optimal parameters of a probabilistic data propagation algorithm for wireless sensor networks (WSN). The probabilistic data propagation algorithm we consider was introduced in previous work, and it is known that this algorithm, when used with adequate parameters, balances the energy consumption and increases the lifespan of the WSN. However, we show that i...

The popularity of particle filtering for inference in Markov chain models defined over random variables with very large or continuous domains makes it natural to consider sample–based versions of belief propagation (BP) for more general (tree–structured or loopy) graphs. Already, several such algorithms have been proposed in the literature. However, many questions remain open about the behavior...

Recently, we proposed a new isosurface extraction algorithm that extracts portions of the isosurface in a viewdependent manner by ray casting and propagation. The algorithm casts rays through a volume to find visible active cells as seeds and then propagates their polygonal isosurface into the neighboring cells. Small pieces of the isosurface are generated by distance-limited propagation and jo...

We define an algebra of ternary relations for cyclic ordering of 2D orientations, which is a refinement of the CYCORD theory . The algebra (1) contains 24 atomic relations, hence 224 general relations, of which the usual CYCORD relation is a particular relation ; and (2) is NP-complete, which is not surprising since the CYCORD theory is . We then provide the following : (1) a constraint propaga...