Sciweavers

1802 search results - page 134 / 361
» Complexity Theory for Operators in Analysis
Sort
View
ECCV
2006
Springer
15 years 10 months ago
An Efficient Method for Tensor Voting Using Steerable Filters
In many image analysis applications there is a need to extract curves in noisy images. To achieve a more robust extraction, one can exploit correlations of oriented features over a...
Erik Franken, Markus van Almsick, Peter Rongen, Lu...
CORR
2008
Springer
76views Education» more  CORR 2008»
15 years 6 months ago
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher
ICIP
2009
IEEE
15 years 4 months ago
Overview of adaptive morphology: Trends and perspectives
In this paper we briefly overview emerging trends in `Adaptive Morphology', i.e. work related to the theory and/or applications of image analysis filters, systems, or algorit...
Petros Maragos, Corinne Vachier
CIE
2007
Springer
16 years 17 days ago
Speed-Up Theorems in Type-2 Computation
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
Chung-Chih Li
COMPGEOM
2011
ACM
14 years 10 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...