Sciweavers

517 search results - page 45 / 104
» An Approximate Algorithm for Structural Matching of Images
Sort
View
WG
2007
Springer
14 years 2 months ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
SEBD
2000
112views Database» more  SEBD 2000»
13 years 9 months ago
Correct and efficient evaluation of region-based image search
Abstract. Content-based image retrieval systems allow the user to interactively search image databases looking for those images which are similar to a specified query image. To thi...
Ilaria Bartolini, Marco Patella
MICCAI
2008
Springer
14 years 9 months ago
New Algorithms to Map Asymmetries of 3D Surfaces
Abstract. In this paper, we propose a set of new generic automated processing tools to characterise the local asymmetries of anatomical structures (represented by surfaces) at an i...
Benoît Combès, Sylvain Prima

Book
34534views
15 years 6 months ago
OpenCV - Open Source Computer Vision Reference Manual
OpenCV is a C/C++ computer vision library originally developed by Intel. It is free for commercial and research use under a BSD license. The library is cross-platform. It is highl...
Intel
SIROCCO
2010
13 years 9 months ago
Traffic Grooming in Star Networks via Matching Techniques
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
Ignasi Sau, Mordechai Shalom, Shmuel Zaks