Sciweavers

1133 search results - page 91 / 227
» Basics of Graph Cuts
Sort
View
DAM
2011
15 years 1 months ago
A General Label Search to investigate classical graph search algorithms
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic proce...
Richard Krueger, Geneviève Simonet, Anne Be...
COMBINATORICS
2004
74views more  COMBINATORICS 2004»
15 years 6 months ago
Enumerative Problems Inspired by Mayer's Theory of Cluster Integrals
The basic functional equations for connected and 2-connnected graphs can be traced back to the statistical physicists Mayer and Husimi. They play an essential role in establishing...
Pierre Leroux
BMCBI
2010
183views more  BMCBI 2010»
15 years 6 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
CVPR
2004
IEEE
16 years 8 months ago
Window-Based, Discontinuity Preserving Stereo
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...
Motilal Agrawal, Larry S. Davis
CVPR
2006
IEEE
16 years 8 months ago
Seamless Image Stitching of Scenes with Large Motions and Exposure Differences
This paper presents a technique to automatically stitch multiple images at varying orientations and exposures to create a composite panorama that preserves the angular extent and ...
Ashley Eden, Matthew Uyttendaele, Richard Szeliski