Sciweavers

4137 search results - page 34 / 828
» On the number of matchings of a tree
Sort
View
ICIP
2003
IEEE
14 years 9 months ago
Fast indexing for image retrieval based on local appearance with re-ranking
This paper describes an approach to retrieve images containing specific objects, scenes or buildings. The image content is captured by a set of local features. More precisely, we ...
Hao Shao, Tomás Svoboda, Vittorio Ferrari, ...
3DPVT
2006
IEEE
257views Visualization» more  3DPVT 2006»
14 years 1 months ago
3D from Line Segments in Two Poorly-Textured, Uncalibrated Images
This paper addresses the problem of camera selfcalibration, bundle adjustment and 3D reconstruction from line segments in two images of poorly-textured indoor scenes. First, we ge...
Herbert Bay, Andreas Ess, Alexander Neubeck, Luc J...
DM
2008
91views more  DM 2008»
13 years 7 months ago
Lower bounds for the game colouring number of partial k-trees and planar graphs
This paper discusses the game colouring number of partial k-trees and planar graphs. Let colg(PT k) and colg(P) denote the maximum game colouring number of partial k trees and the...
Jiaojiao Wu, Xuding Zhu
ICIP
2005
IEEE
14 years 9 months ago
A context adaptation model for the compression of images with a reduced number of colors
Recently, Chen et al. proposed a method for compressing color-quantized images that is based on a binary tree representation of colors and on context-based arithmetic coding with ...
António J. R. Neves, Armando J. Pinho
VLDB
2005
ACM
144views Database» more  VLDB 2005»
14 years 1 months ago
Bidirectional Expansion For Keyword Search on Graph Databases
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on s...
Varun Kacholia, Shashank Pandit, Soumen Chakrabart...