Sciweavers

1348 search results - page 66 / 270
» Matching planar maps
Sort
View
COMBINATORICS
2002
87views more  COMBINATORICS 2002»
13 years 9 months ago
Kasteleyn Cokernels
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is ...
Greg Kuperberg
AVSS
2008
IEEE
14 years 4 months ago
A Fast Linear Registration Framework for Multi-camera GIS Coordination
We propose a novel registration framework to map the field-of-coverage of pan-tilt cameras to a GIS (Geographic Information System) planar coordinate system. The camera’s fiel...
Karthik Sankaranarayanan, James W. Davis
WACV
2007
IEEE
14 years 4 months ago
Homography-based Analysis of People and Vehicle Activities in Crowded Scenes
This paper presents an new framework for homographybased analysis of pedestrian-vehicle activity in crowded scenes. Planar homography constraint is exploited to extract view-invar...
Sangho Park, Mohan M. Trivedi
CGF
2008
118views more  CGF 2008»
13 years 10 months ago
Image-Based Surface Compression
We present a generic framework for compression of densely sampled 3D surfaces in order to satisfy the increasing demand for storing large amounts of 3D content. We decompose a giv...
Tilo Ochotta, Dietmar Saupe
CSCLP
2007
Springer
14 years 4 months ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...