Sciweavers

1093 search results - page 107 / 219
» Clustering from Constraint Graphs
Sort
View
CVPR
2001
IEEE
16 years 5 months ago
Local Feature View Clustering for 3D Object Recognition
There have been important recent advances in object recognition through the matching of invariant local image features. However, the existing approaches are based on matching to i...
David G. Lowe
116
Voted
RT
2004
Springer
15 years 9 months ago
A Self-Shadow Algorithm for Dynamic Hair using Density Clustering
Self-shadowing is an important factor in the appearance of hair and fur. In this paper we present a new rendering algorithm to accurately compute shadowed hair at interactive rate...
Tom Mertens, Jan Kautz, Philippe Bekaert, Frank Va...
QSHINE
2005
IEEE
15 years 9 months ago
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
Zhenjiang Li, J. J. Garcia-Luna-Aceves
110
Voted
HT
1991
ACM
15 years 7 months ago
Implementing Hypertext Database Relationships through Aggregations and Exceptions
In order to combine hypertext with database facilities, we show how to extract an effective storage structure from given instance relationships. The schema of the structure recogn...
Yoshinori Hara, Arthur M. Keller, Gio Wiederhold
128
Voted
CVPR
2010
IEEE
1171views Computer Vision» more  CVPR 2010»
16 years 8 days ago
Geodesic Star Convexity for Interactive Image Segmentation
In this paper we introduce a new shape constraint for interactive image segmentation. It is an extension of Veksler's star-convexity prior, in two ways: from a single star to ...
Varun Gulshan, Carsten Rother, Antonio Criminisi, ...