Results 11  20
of
1,677
Color Based Object Recognition
 Pattern Recognition
, 1997
"... This paper is organized as follows. In Section 2, the dichromatic reflectance under "white" reflection is introduced and new photometric invariant color features are proposed. The performance of object recognition by histogram matching differentiated for the various color models is evaluat ..."
Abstract

Cited by 149 (26 self)
 Add to MetaCart
+G+B , g(R; G; B) = G R+G+B , b(R; G; B) = B R+G+B , hue H(R; G; B) = arctan \Gamma p 3(G\GammaB) (R\GammaG)+(R\GammaB) \Delta and saturation S(R; G; B) = 1 \Gamma min(R;G;B) R+G+B . 2.1 The Reflection Model Consider an image of an infinitesimal surface patch. Using the red, green and blue
Variational Problems on Flows of Diffeomorphisms for Image Matching
, 1998
"... This paper studies a variational formulation of the image matching problem. We consider a scenario in which a canonical representative image T is to be carried via a smooth change of variable into an image which is intended to provide a good fit to the observed data. The images are all defined on a ..."
Abstract

Cited by 148 (19 self)
 Add to MetaCart
then takes the form arg min v kvk 2 + Z G jT ffi j(0; x) \Gamma D(x)j 2 dx ; (0:2) where kvk is an appropriate norm on the velocity field v(\Delta; \Delta), and the second term attempts to enforce fidelity to the data. In this paper we derive conditions under which the variational problem
On the Complexity of Partial Order Properties
 IN PROC. 18TH INT. WORKSHOP GRAPHTHEORET. CONCEPTS COMPUT. SCI., LNCS
, 1993
"... The recognition complexity of ordered set properties is considered, i.e. how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove a lower bound of \Omega\Gamma n 2 ) for properties that are characterized by forbidden substructures of fixed size ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
size. For the properties being connected, and having exactly k comparable pairs we show that the recognition complexity is \Gamma n 2 \Delta ; the complexity of interval orders is exactly \Gamma n 2 \Delta \Gamma 1. Nontrivial upper bounds are given for being a lattice, containing a chain
Fast Scheduling of Periodic Tasks on Multiple Resources
 In Proceedings of the 9th International Parallel Processing Symposium
"... Given n periodic tasks, each characterized by an execution requirement and a period, and m identical copies of a resource, the periodic scheduling problem is concerned with generating a schedule for the n tasks on the m resources. We present an algorithm that schedules every feasible instance of t ..."
Abstract

Cited by 129 (15 self)
 Add to MetaCart
task x in \Gamma for exactly x:e time units in each interval [k \Delta x:p; (k+1) \Delta x:p) for all k in N, subject to the following constraints: Constraint 1: A resource can only be allocated to a task for an entire "slot" of time, where for each i in N slot i is the unit interval from
BONDS FUTURES: DELTA? NO GAMMA!
"... Abstract. Bond futures are liquid but complex instruments. Here they are analysed in a onefactor Gaussian HJM model. The inthemodel delta and outofthemodel delta and gamma are studied. An explicit formula is provided for inthemodel delta. The outofthemodel delta and gamma are equivalent t ..."
Abstract
 Add to MetaCart
Abstract. Bond futures are liquid but complex instruments. Here they are analysed in a onefactor Gaussian HJM model. The inthemodel delta and outofthemodel delta and gamma are studied. An explicit formula is provided for inthemodel delta. The outofthemodel delta and gamma are equivalent
On Fundamental Solutions of Generalized Schrödinger Operators
"... . We consider the generalized Schrodinger operator \Gamma\Delta + where is a nonnegative Radon measure in R n , n 3. Assuming that satisfies certain scaleinvariant Kato condition and doubling condition, we establish the following bounds for the fundamental solution of \Gamma\Delta + in R n ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
n : c e \Gamma" 2 d(x;y;) jx \Gamma yj n\Gamma2 \Gamma (x; y) C e \Gamma" 1 d(x;y;) jx \Gamma yj n\Gamma2 where d(x; y; ) is the distance function for the modified Agmon metric m(x; )dx 2 associated with . We also study the boundedness of the corresponding Riesz transforms r(\Gamma\Delta
Isoperimetric Problems for Convex Bodies and a Localization Lemma
, 1995
"... We study the smallest number /(K) such that a given convex body K in IR n can be cut into two parts K 1 and K 2 by a surface with an (n \Gamma 1)dimensional measure /(K)vol(K 1 ) \Delta vol(K 2 )=vol(K). Let M 1 (K) be the average distance of a point of K from its center of gravity. We prove for ..."
Abstract

Cited by 133 (9 self)
 Add to MetaCart
We study the smallest number /(K) such that a given convex body K in IR n can be cut into two parts K 1 and K 2 by a surface with an (n \Gamma 1)dimensional measure /(K)vol(K 1 ) \Delta vol(K 2 )=vol(K). Let M 1 (K) be the average distance of a point of K from its center of gravity. We prove
Deltagamma four ways
, 1999
"... We describe four methods to approximate the deltagamma distribution, commonly used in ValueatRisk calculations, and evaluate the methods for accuracy and speed. The best techniques are Partial Monte Carlo and Fourier inversion of the moment generating function. The Fourier inversion is the best u ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We describe four methods to approximate the deltagamma distribution, commonly used in ValueatRisk calculations, and evaluate the methods for accuracy and speed. The best techniques are Partial Monte Carlo and Fourier inversion of the moment generating function. The Fourier inversion is the best
2n n \Gamma 3j \Gamma 1' * \Delta q
"... Theorem. The number of n \Theta n uppertriangular matrices over GF (q) (the finite field with q elements), whose square is the zero matrix, is given by the polynomial Cn(q), where, ..."
Abstract
 Add to MetaCart
Theorem. The number of n \Theta n uppertriangular matrices over GF (q) (the finite field with q elements), whose square is the zero matrix, is given by the polynomial Cn(q), where,
The Groupoid Interpretation of Type Theory
 In Venice Festschrift
, 1996
"... ion and application Suppose that M 2 Tm(B). We define its abstraction A;B (M) 2 Tm(\Pi LF (A; B)) on objects by A;B (M)(fl)(a) = M(fl; a) A;B (M)(fl)(q) = M(id fl ; q) If p : fl ! fl 0 then we need a natural transformation A;B (M)(p) : p \Delta A;B (M)(fl) ! A;B (M)(fl 0 ) At object a ..."
Abstract

Cited by 34 (1 self)
 Add to MetaCart
a 2 A(fl 0 ) it is given by M(p; id a ). Conversely, if M 2 Tm(\Pi(A; B)) we define a dependent object \Gamma1 A;B 2 Tm(B). Its object part is given by \Gamma1 A;B (M)(fl; a) = M(fl)(a) For the morphism part assume p : fl ! fl 0 and q : p \Delta a ! a 0 . We define \Gamma1 A;B (M
Results 11  20
of
1,677