Sciweavers

2743 search results - page 279 / 549
» Minimization of an M-convex Function
Sort
View
PAMI
2006
226views more  PAMI 2006»
15 years 6 months ago
Graph Partitioning Active Contours (GPAC) for Image Segmentation
In this paper we introduce new type of variational segmentation cost functions and associated active contour methods that are based on pairwise similarities or dissimilarities of t...
Baris Sumengen, B. S. Manjunath
CAGD
2004
122views more  CAGD 2004»
15 years 6 months ago
Axioms and variational problems in surface parameterization
For a surface patch on a smooth, two-dimensional surface in IR3 , low-distortion parameterizations are described in terms of minimizers of suitable energy functionals. Appropriate...
Ulrich Clarenz, Nathan Litke, Martin Rumpf
CVPR
2008
IEEE
16 years 8 months ago
Transfer learning for image classification with sparse prototype representations
To learn a new visual category from few examples, prior knowledge from unlabeled data as well as previous related categories may be useful. We develop a new method for transfer le...
Ariadna Quattoni, Michael Collins, Trevor Darrell
ECCV
2006
Springer
16 years 8 months ago
Unsupervised Texture Segmentation with Nonparametric Neighborhood Statistics
Abstract. This paper presents a novel approach to unsupervised texture segmentation that relies on a very general nonparametric statistical model of image neighborhoods. The method...
Suyash P. Awate, Tolga Tasdizen, Ross T. Whitaker
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
16 years 7 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb