Sciweavers

1387 search results - page 50 / 278
» Convexity in Discrete Space
Sort
View
CVPR
2008
IEEE
14 years 12 months ago
Shape priors in variational image segmentation: Convexity, Lipschitz continuity and globally optimal solutions
In this work, we introduce a novel implicit representation of shape which is based on assigning to each pixel a probability that this pixel is inside the shape. This probabilistic...
Daniel Cremers, Frank R. Schmidt, Frank Barthel
ADCM
2010
89views more  ADCM 2010»
13 years 10 months ago
Minimization of convex functionals over frame operators
Abstract. We present results about minimization of convex functionals defined over a finite set of vectors in a finite dimensional Hilbert space, that extend several known results ...
Pedro Massey, Mariano Ruiz
CORR
2010
Springer
76views Education» more  CORR 2010»
13 years 10 months ago
Query Strategies for Evading Convex-Inducing Classifiers
Classifiers are often used to detect miscreant activities. We study how an adversary can systematically query a classifier to elicit information that allows the adversary to evade...
Blaine Nelson, Benjamin I. P. Rubinstein, Ling Hua...
IJCAI
1997
13 years 11 months ago
Constraint Satisfaction over Connected Row Convex Constraints
This paper studies constraint satisfaction over connected row-convex (CRC) constraints. It shows that CRC constraints are closed under composition, intersection, and transposition...
Yves Deville, Olivier Barette, Pascal Van Hentenry...
EMMCVPR
2011
Springer
12 years 9 months ago
Optimality Bounds for a Variational Relaxation of the Image Partitioning Problem
Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. While the resulting relaxed co...
Jan Lellmann, Frank Lenzen, Christoph Schnörr