Sciweavers

1149 search results - page 66 / 230
» Minimally non-Pfaffian graphs
Sort
View
MP
1998
117views more  MP 1998»
14 years 11 months ago
The node capacitated graph partitioning problem: A computational study
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
Carlos Eduardo Ferreira, Alexander Martin, C. Carv...
MICCAI
2010
Springer
14 years 10 months ago
Non-parametric Iterative Model Constraint Graph min-cut for Automatic Kidney Segmentation
We present a new non-parametric model constraint graph min-cut algorithm for automatic kidney segmentation in CT images. The segmentation is formulated as a maximum a-posteriori es...
Moti Freiman, A. Kronman, S. J. Esses, Leo Joskowi...
CVPR
2003
IEEE
16 years 1 months ago
Joint 3D-Reconstruction and Background Separation in Multiple Views using Graph Cuts
This paper deals with simultaneous depth map estimation and background separation in a multi-view setting with several fixed calibrated cameras, two problems which have previously...
Bastian Goldlücke, Marcus A. Magnor
PKDD
2009
Springer
155views Data Mining» more  PKDD 2009»
15 years 6 months ago
Dynamic Factor Graphs for Time Series Modeling
Abstract. This article presents a method for training Dynamic Factor Graphs (DFG) with continuous latent state variables. A DFG includes factors modeling joint probabilities betwee...
Piotr W. Mirowski, Yann LeCun
ICPR
2008
IEEE
15 years 6 months ago
Video object segmentation based on graph cut with dynamic shape prior constraint
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...
Peng Tang, Lin Gao