Sciweavers

1538 search results - page 147 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
CORR
2004
Springer
223views Education» more  CORR 2004»
15 years 3 months ago
Better Foreground Segmentation Through Graph Cuts
For many tracking and surveillance applications, background subtraction provides an effective means of segmenting objects moving in front of a static background. Researchers have ...
Nicholas R. Howe, Alexandra Deschamps
SAC
2009
ACM
15 years 10 months ago
Visualization of clustered directed acyclic graphs with node interleaving
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...
Pushpa Kumar, Kang Zhang
CORR
2006
Springer
127views Education» more  CORR 2006»
15 years 3 months ago
Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising
Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently devel...
Steven de Rooij, Paul M. B. Vitányi
CVPR
2006
IEEE
16 years 5 months ago
Hierarchical Volumetric Multi-view Stereo Reconstruction of Manifold Surfaces based on Dual Graph Embedding
This paper presents a new volumetric stereo algorithm to reconstruct the 3D shape of an arbitrary object. Our method is based on finding the minimum cut in an octahedral graph str...
Alexander Hornung, Leif Kobbelt
ECCV
2008
Springer
16 years 5 months ago
Feature Correspondence Via Graph Matching: Models and Global Optimization
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
Lorenzo Torresani, Vladimir Kolmogorov, Carsten Ro...