Sciweavers

29 search results - page 3 / 6
» Image segmentation by convex quadratic programming
Sort
View
AADA
2011
12 years 5 months ago
Sparse Template-Based variational Image Segmentation
We introduce a variational approach to image segmentation based on sparse coverings of image domains by shape templates. The objective function combines a data term that achieves ...
Dirk Breitenreicher, Jan Lellmann, Christoph Schn&...
ICMCS
2005
IEEE
136views Multimedia» more  ICMCS 2005»
13 years 11 months ago
Human Posture Recognition with Convex Programming
We present a novel human posture recognition method using convex programming based matching schemes. Instead of trying to segment the object from the background, we develop a nove...
Hao Jiang, Ze-Nian Li, Mark S. Drew
CVIU
2011
12 years 9 months ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 5 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...

Publication
210views
14 years 25 days 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 to correspondence involve matching features between images. In this pa...
Gemma Roig, Xavier Boix, Fernando De la Torre