Sciweavers

2527 search results - page 40 / 506
» Discrete optimization in computer vision
Sort
View
PRL
2006
105views more  PRL 2006»
15 years 17 days ago
Parisian camera placement for vision metrology
This paper presents a novel camera network design methodology based on the Parisian evolutionary computation approach. This methodology proposes to partition the original problem ...
Enrique Dunn, Gustavo Olague, Evelyne Lutton
ECCV
1998
Springer
16 years 2 months ago
Motion Recovery from Image Sequences: Discrete Viewpoint vs. Differential Viewpoint
Abstract. The aim of this paper is to explore intrinsic geometric methods of recovering the three dimensional motion of a moving camera from a sequence of images. Generic similarit...
Yi Ma, Jana Kosecka, Shankar Sastry
ICPR
2008
IEEE
16 years 1 months ago
Robust decomposition of a digital curve into convex and concave parts
We propose a linear in time and easy-to-implement algorithm that robustly decomposes a digital curve into convex and concave parts. This algorithm is based on classical tools in d...
Tristan Roussillon, Isabelle Sivignon, Laure Tougn...
107
Voted
CVPR
2010
IEEE
15 years 26 days ago
Learning kernels for variants of normalized cuts: Convex relaxations and applications
We propose a new algorithm for learning kernels for variants of the Normalized Cuts (NCuts) objective – i.e., given a set of training examples with known partitions, how should ...
Lopamudra Mukherjee, Vikas Singh, Jiming Peng, Chr...
89
Voted
CORR
2010
Springer
80views Education» more  CORR 2010»
15 years 23 days ago
Many-to-Many Graph Matching: a Continuous Relaxation Approach
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...