Sciweavers

1054 search results - page 29 / 211
» Fast Approximated SIFT
Sort
View
72
Voted
CVPR
2006
IEEE
15 years 11 months ago
Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories
This paper presents a method for recognizing scene categories based on approximate global geometric correspondence. This technique works by partitioning the image into increasingl...
Svetlana Lazebnik, Cordelia Schmid, Jean Ponce
DGCI
2009
Springer
15 years 2 months ago
Pixel Approximation Errors in Common Watershed Algorithms
Abstract. The exact, subpixel watershed algorithm delivers very accurate watershed boundaries based on a spline interpolation, but is slow and only works in 2D. On the other hand, ...
Hans Meine, Peer Stelldinger, Ullrich Köthe
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
14 years 7 months ago
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
JCB
2007
168views more  JCB 2007»
14 years 9 months ago
Fast Molecular Shape Matching Using Contact Maps
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
Pankaj K. Agarwal, Nabil H. Mustafa, Yusu Wang
122
Voted
ISCAS
2007
IEEE
371views Hardware» more  ISCAS 2007»
15 years 4 months ago
FIR Filter Approximation by IIR Filters Based on Discrete-Time Vector Fitting
— We present a novel way of approximating FIR filters by IIR structures through generalizing the vector fitting (VF) algorithm, popularly used in continuous-time frequency-doma...
Ngai Wong, Chi-Un Lei