Source Code
This is the sample implementation of a Markov random field based image segmentation algorithm described in the following papers:
1. Mark Berthod, Zoltan Kato, Shan Yu, and Josi...
ICCD
2001
IEEE
14 years 1 months ago
2001
IEEE
Classical floorplanning minimizes a linear combination of area and wirelength. When Simulated Annealing is used, e.g., with the Sequence Pair representation, the typical choice o...
DAC
2005
ACM
14 years 5 months ago
2005
ACM
Previous research has shown both theoretically and practically that simulated annealing can greatly benefit from the incorporation of an adaptive range limiting window to control ...
ICIP
2009
IEEE
14 years 5 months ago
2009
IEEE
We propose a new fibre tracking algorithm for cardiac DTMRI that parts with the locally "greedy" paradigm intrinsic to conventional tracking algorithms. We formulate the...
ICPR
2002
IEEE
14 years 5 months ago
2002
IEEE
This paper proposes two modifications to the geometrically deformable template model. First, the optimization stage originally based on simulated annealing is replaced with a meta...
ICIP
2003
IEEE
14 years 6 months ago
2003
IEEE
Virtually all implementations of simulated annealing are simplified by assuming discrete unknowns, however continuous-parameter annealing has many potential applications to image ...
CVPR
2004
IEEE
14 years 6 months ago
2004
IEEE
The problem of multibody motion segmentation is an important and challenging issue in computer vision. In this paper, a novel segmentation technique based on simulated annealing (...
Publication
Drawbacks of the traditional scenario of image modeling by Gibbs random fields with multiple pairwise pixel interactions are outlined, and a more reasonable alternative scenario b...