Sciweavers

29 search results - page 2 / 6
» Image segmentation by convex quadratic programming
Sort
View
JMLR
2006
115views more  JMLR 2006»
13 years 5 months ago
Structured Prediction, Dual Extragradient and Bregman Projections
We present a simple and scalable algorithm for maximum-margin estimation of structured output models, including an important class of Markov networks and combinatorial models. We ...
Benjamin Taskar, Simon Lacoste-Julien, Michael I. ...
NIPS
2001
13 years 6 months ago
Learning Lateral Interactions for Feature Binding and Sensory Segmentation
We present a new approach to the supervised learning of lateral interactions for the competitive layer model (CLM) dynamic feature binding architecture. The method is based on con...
Heiko Wersing
CVPR
2007
IEEE
14 years 7 months ago
Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
Carl Olsson, Anders P. Eriksson, Fredrik Kahl
ICCV
2007
IEEE
14 years 7 months ago
Half Quadratic Analysis for Mean Shift: with Extension to A Sequential Data Mode-Seeking Method
Theoretical understanding and extension of mean shift procedure has received much attention recently [8, 18, 3]. In this paper, we present a theoretical exploration and an algorit...
Xiaotong Yuan, Stan Z. Li

Publication
433views
14 years 1 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...
Gemma Roig, Xavier Boix, Fernando De la Torre