365 search results - page 27 / 73 » An Approach to Multiply Segmented Constraint Satisfaction Pr... |
129
click to vote
SCALESPACE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper we provide a method to find global minimizers of certain non-convex 2-phase image segmentation problems. This is achieved by formulating a convex minimizat...
158
click to vote
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
223
click to vote
GIS
2007
ACM
2007
ACM
Exploiting automatically inferred constraint-models for building identification in satellite imagery
16 years 4 months ago
The building identification (BID) problem is based on a process that uses publicly available information to automatically assign addresses to buildings in satellite imagery. In pr...
162
click to vote
CVPR
2003
IEEE
16 years 5 months ago
2003
IEEE
We present a novel algorithm for optimally segmenting dynamic scenes containing multiple rigidly moving objects. We cast the motion segmentation problem as a constrained nonlinear...
139
click to vote
EMO
2009
Springer
15 years 10 months ago
2009
Springer
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...