Results 1  10
of
196,068
SURF: Speeded Up Robust Features
 ECCV
"... Abstract. In this paper, we present a novel scale and rotationinvariant interest point detector and descriptor, coined SURF (Speeded Up Robust Features). It approximates or even outperforms previously proposed schemes with respect to repeatability, distinctiveness, and robustness, yet can be comp ..."
Abstract

Cited by 847 (12 self)
 Add to MetaCart
be computed and compared much faster. This is achieved by relying on integral images for image convolutions; by building on the strengths of the leading existing detectors and descriptors (in casu, using a Hessian matrixbased measure for the detector, and a distributionbased descriptor); and by simplifying
Bordered Complex Hessians
, 2000
"... We record some basic facts about bordered complex Hessians and logarithmically plurisubharmonic functions. These enable us to prove that a nonnegative bihomogeneous polynomial is plurisubharmonic if and only if it is logplurisubharmonic; we give a more general version for twice differentiable homog ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We record some basic facts about bordered complex Hessians and logarithmically plurisubharmonic functions. These enable us to prove that a nonnegative bihomogeneous polynomial is plurisubharmonic if and only if it is logplurisubharmonic; we give a more general version for twice differentiable
Bordered Complex Hessians
, 2000
"... polynomial Abstract: We record some basic facts about bordered complex Hessians and logarithmically plurisubharmonic functions. These enable us to prove that a nonnegative bihomogeneous polynomial is plurisubharmonic if and only if it is logplurisubharmonic; we give a more general version for twice ..."
Abstract
 Add to MetaCart
polynomial Abstract: We record some basic facts about bordered complex Hessians and logarithmically plurisubharmonic functions. These enable us to prove that a nonnegative bihomogeneous polynomial is plurisubharmonic if and only if it is logplurisubharmonic; we give a more general version
Hessian
, 2003
"... Qualms regarding “Nonextensive Hamilton systems follow Boltzmann’s principle not Tsallis statistics–phase transitions, second law of ..."
Abstract
 Add to MetaCart
Qualms regarding “Nonextensive Hamilton systems follow Boltzmann’s principle not Tsallis statistics–phase transitions, second law of
SpeededUp Robust Features (SURF)
, 2008
"... This article presents a novel scale and rotationinvariant detector and descriptor, coined SURF (SpeededUp Robust Features). SURF approximates or even outperforms previously proposed schemes with respect to repeatability, distinctiveness, and robustness, yet can be computed and compared much faste ..."
Abstract

Cited by 301 (5 self)
 Add to MetaCart
faster. This is achieved by relying on integral images for image convolutions; by building on the strengths of the leading existing detectors and descriptors (specifically, using a Hessian matrixbased measure for the detector, and a distributionbased descriptor); and by simplifying these methods
Necessary and Sufficient Condition
, 2010
"... We provide a necessary and sufficient condition for goods to be normal when utility functions are differentiable and strongly quasiconcave. Our condition is equivalent to the condition proposed by Alarie et al. (1990), but it is easier to check: it only requires to compute the minors associated wit ..."
Abstract
 Add to MetaCart
with the border column (or row) of the bordered Hessian matrix of the utility function. JEL classification: D11
Fast Exact Multiplication by the Hessian
 Neural Computation
, 1994
"... Just storing the Hessian H (the matrix of second derivatives d^2 E/dw_i dw_j of the error E with respect to each pair of weights) of a large neural network is difficult. Since a common use of a large matrix like H is to compute its product with various vectors, we derive a technique that directly ca ..."
Abstract

Cited by 91 (5 self)
 Add to MetaCart
Just storing the Hessian H (the matrix of second derivatives d^2 E/dw_i dw_j of the error E with respect to each pair of weights) of a large neural network is difficult. Since a common use of a large matrix like H is to compute its product with various vectors, we derive a technique that directly
A note on the augmented hessian when the reduced hessian is semidefinite. Working paper
, 1999
"... Abstract. Certain matrix relationships play an important role in optimality conditions and algorithms for nonlinear and semidefinite programming. Let H be an n × n symmetric matrix, A an m × n matrix, and Z a basis for the null space of A. (In a typical optimization context, H is the Hessian of a sm ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. Certain matrix relationships play an important role in optimality conditions and algorithms for nonlinear and semidefinite programming. Let H be an n × n symmetric matrix, A an m × n matrix, and Z a basis for the null space of A. (In a typical optimization context, H is the Hessian of a
H Hessian matrix
"... This paper presents the development of a frequency response sensitivity function that is applied to the determination of a state space coupled rotorfuselage helicopter flight dynamics model using frequency domain system identification. The new function exposes the frequencydependent sensitivity o ..."
Abstract
 Add to MetaCart
the frequency response sensitivity function are introduced that substantially reduce the computational cost of the solution. Simulated flight test data are used to validate a direct state space matrix identification process incorporating the frequency response sensitivity function. Results demonstrate
using Hessian
"... Labelfree optical lymphangiography: development of an automatic segmentation method applied to optical coherence tomography to visualize lymphatic vessels using Hessian filters ..."
Abstract
 Add to MetaCart
Labelfree optical lymphangiography: development of an automatic segmentation method applied to optical coherence tomography to visualize lymphatic vessels using Hessian filters
Results 1  10
of
196,068