Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
This paper incorporates multiscale vesselness filtering into the Livewire framework to simultaneously compute optimal medial axes and boundaries in vascular images. To this end, we...
In this paper, we propose a probabilistic method to model the dynamic traffic flow across nonoverlapping camera views. By assuming the transition time of object movement follows a...
We propose new filtering algorithms for the SEQUENCE constraint and some extensions of the SEQUENCE constraint based on network flows. We enforce domain consistency on the SEQUENCE...
Michael J. Maher, Nina Narodytska, Claude-Guy Quim...
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...