As Figure 1 shows, the geodesic constraint enforced on GCD maps greatly facilitates saliency accuracy by strength-ening the contrast in local regions. Through effectively integrating the …

It has been shown that the popular AdaBoost algo-rithm [7] is equivalent to GCD procedure with an exponen-tial loss `(y; f(x; p)) = exp( yf(x; p)). In our implemen-tation, we use the same …

We present a novel framework for cross-age face verification (FV) by seek-ing help from its “competitor" named cross-face age verification (AV), i.e., deciding whether two face photos …

It has been shown that the popular AdaBoost algo-rithm [7] is equivalent to GCD procedure with an exponen-tial loss `(y; f(x; p)) = exp( yf(x; p)). In our implemen-tation, we use the same …

In the bottom of Table 1, we evaluate the contributions of important components to our system: rare class expansion (RCE), local context descriptors (LCD) and global context descriptors …

| ). pixels of 5-by-5 grid cells. The four components are combined into p(Dθ p (Ed|Eθ)p(Od|θαp(GCd|θβp(C θδ. (12) | ) ≈ ) ) | ) As in our previous work [10], we set α = 6. We …

In the Paillier cryptosystem, the public key is defined as pk = (n,g), where n = p · q with p and q two large prime numbers such that gcd(pq,(p−1)(q −1)) = 1, and g ∈ Z∗ n2. On the other hand, …