Sciweavers

427 search results - page 51 / 86
» Computing the Local Consensus of Trees
Sort
View
134
Voted
ICPR
2008
IEEE
16 years 5 months ago
Phase based level set segmentation of blood vessels
The segmentation and analysis of blood vessels has received much attention in the research community. The results aid numerous applications for diagnosis and treatment of vascular...
Gunnar Läthén, Jimmy Jonasson, Magnus ...
SI3D
2012
ACM
14 years 2 days ago
Fast, effective BVH updates for animated scenes
Bounding volume hierarchies (BVHs) are a popular acceleration structure choice for animated scenes rendered with ray tracing. This is due to the relative simplicity of refitting ...
Daniel Kopta, Thiago Ize, Josef B. Spjut, Erik Bru...
IWPEC
2009
Springer
15 years 11 months ago
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
Peter Damaschke
CVPR
2009
IEEE
16 years 11 months ago
Epitomized Priors for Multi-labeling Problems
Image parsing remains difficult due to the need to combine local and contextual information when labeling a scene. We approach this problem by using the epitome as a prior over ...
Jonathan Warrell, Simon J. D. Prince, Alastair P. ...
136
Voted
CVPR
2006
IEEE
16 years 6 months ago
Extracting Subimages of an Unknown Category from a Set of Images
Suppose a set of images contains frequent occurrences of objects from an unknown category. This paper is aimed at simultaneously solving the following related problems: (1) unsupe...
Sinisa Todorovic, Narendra Ahuja