272 search results - page 27 / 55 » Minimal Function Graphs are not Instrumented |
ICPR
2008
IEEE
14 years 5 months ago
2008
IEEE
In this work, we present a novel segmentation method for deformable objects in monocular videos. Firstly we introduce the dynamic shape to represent the prior knowledge about obje...
IPMI
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We propose a novel algorithm called graph-shifts for performing image segmentation and labeling. This algorithm makes use of a dynamic hierarchical representation of the ...
CVPR
2006
IEEE
14 years 5 months ago
2006
IEEE
Many natural and man-made structures have a boundary that shows certain level of bilateral symmetry, a property that has been used to solve many computer-vision tasks. In this pap...
IPMI
2007
Springer
14 years 11 months ago
2007
Springer
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path...
ISAAC
2005
Springer
14 years 4 months ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...