Sciweavers

162 search results - page 7 / 33
» Structural Matching Via Optimal Basis Graphs
Sort
View
DAGM
2006
Springer
14 years 2 months ago
Segmentation-Based Motion with Occlusions Using Graph-Cut Optimization
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
Michael Bleyer, Christoph Rhemann, Margrit Gelautz
ICCAD
1999
IEEE
120views Hardware» more  ICCAD 1999»
14 years 3 months ago
Regularity extraction via clan-based structural circuit decomposition
Identifying repeating structural regularities in circuits allows the minimization of synthesis, optimization, and layout e orts. We introduce in this paper a novel method for ident...
Soha Hassoun, Carolyn McCreary
ICIP
2010
IEEE
13 years 9 months ago
Image modeling and enhancement via structured sparse model selection
An image representation framework based on structured sparse model selection is introduced in this work. The corresponding modeling dictionary is comprised of a family of learned ...
Guoshen Yu, Guillermo Sapiro, Stéphane Mall...
CORR
2010
Springer
198views Education» more  CORR 2010»
13 years 7 months ago
Convex Graph Invariants
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...
BIBE
2007
IEEE
114views Bioinformatics» more  BIBE 2007»
14 years 5 months ago
A Hierarchical Grow-and-Match Algorithm for Backbone Resonance Assignments Given 3D Structure
Abstract—This paper develops an algorithm for NMR backbone resonance assignment given a 3D structure and a set of relatively sparse 15 N-edited NMR data, with the through-space 1...
Fei Xiong, Chris Bailey-Kellogg