1,920 research outputs found
Deep Adaptive Feature Embedding with Local Sample Distributions for Person Re-identification
Person re-identification (re-id) aims to match pedestrians observed by
disjoint camera views. It attracts increasing attention in computer vision due
to its importance to surveillance system. To combat the major challenge of
cross-view visual variations, deep embedding approaches are proposed by
learning a compact feature space from images such that the Euclidean distances
correspond to their cross-view similarity metric. However, the global Euclidean
distance cannot faithfully characterize the ideal similarity in a complex
visual feature space because features of pedestrian images exhibit unknown
distributions due to large variations in poses, illumination and occlusion.
Moreover, intra-personal training samples within a local range are robust to
guide deep embedding against uncontrolled variations, which however, cannot be
captured by a global Euclidean distance. In this paper, we study the problem of
person re-id by proposing a novel sampling to mine suitable \textit{positives}
(i.e. intra-class) within a local range to improve the deep embedding in the
context of large intra-class variations. Our method is capable of learning a
deep similarity metric adaptive to local sample structure by minimizing each
sample's local distances while propagating through the relationship between
samples to attain the whole intra-class minimization. To this end, a novel
objective function is proposed to jointly optimize similarity metric learning,
local positive mining and robust deep embedding. This yields local
discriminations by selecting local-ranged positive samples, and the learned
features are robust to dramatic intra-class variations. Experiments on
benchmarks show state-of-the-art results achieved by our method.Comment: Published on Pattern Recognitio
Counting and effective rigidity in algebra and geometry
The purpose of this article is to produce effective versions of some rigidity
results in algebra and geometry. On the geometric side, we focus on the
spectrum of primitive geodesic lengths (resp., complex lengths) for arithmetic
hyperbolic 2-manifolds (resp., 3-manifolds). By work of Reid, this spectrum
determines the commensurability class of the 2-manifold (resp., 3-manifold). We
establish effective versions of these rigidity results by ensuring that, for
two incommensurable arithmetic manifolds of bounded volume, the length sets
(resp., the complex length sets) must disagree for a length that can be
explicitly bounded as a function of volume. We also prove an effective version
of a similar rigidity result established by the second author with Reid on a
surface analog of the length spectrum for hyperbolic 3-manifolds. These
effective results have corresponding algebraic analogs involving maximal
subfields and quaternion subalgebras of quaternion algebras. To prove these
effective rigidity results, we establish results on the asymptotic behavior of
certain algebraic and geometric counting functions which are of independent
interest.Comment: v.2, 39 pages. To appear in Invent. Mat
Counting problems for geodesics on arithmetic hyperbolic surfaces
It is a longstanding problem to determine the precise relationship between
the geodesic length spectrum of a hyperbolic manifold and its commensurability
class. A well known result of Reid, for instance, shows that the geodesic
length spectrum of an arithmetic hyperbolic surface determines the surface's
commensurability class. It is known, however, that non-commensurable arithmetic
hyperbolic surfaces may share arbitrarily large portions of their length
spectra. In this paper we investigate this phenomenon and prove a number of
quantitative results about the maximum cardinality of a family of pairwise
non-commensurable arithmetic hyperbolic surfaces whose length spectra all
contain a fixed (finite) set of nonnegative real numbers
- …