The paper deals with grouping of edges to contours of shapes using only local symmetry and continuity. Shape skeletons are used to generate the search space for a version of the M...
Physical map reconstruction in the presence of errors is a central problem in genetics of high computational complexity. A parallel genetic algorithm for a maximum likelihood esti...
Suchendra M. Bhandarkar, Jinling Huang, Jonathan A...
This paper describes a technique for the probabilistic self-localization of a sensor network based on noisy inter-sensor range data. Our method is based on a number of parallel in...
Slice sampling provides an easily implemented method for constructing a Markov chain Monte Carlo (MCMC) algorithm. However, slice sampling has two major drawbacks: (i) it requires...
We first formulate multiple targets tracking problem in a dynamic Markov network(DMN)which is derived from a MRFs for joint target state and a binary process for occlusion of dual...