4,482 research outputs found
Learning Adaptive Discriminative Correlation Filters via Temporal Consistency Preserving Spatial Feature Selection for Robust Visual Tracking
With efficient appearance learning models, Discriminative Correlation Filter
(DCF) has been proven to be very successful in recent video object tracking
benchmarks and competitions. However, the existing DCF paradigm suffers from
two major issues, i.e., spatial boundary effect and temporal filter
degradation. To mitigate these challenges, we propose a new DCF-based tracking
method. The key innovations of the proposed method include adaptive spatial
feature selection and temporal consistent constraints, with which the new
tracker enables joint spatial-temporal filter learning in a lower dimensional
discriminative manifold. More specifically, we apply structured spatial
sparsity constraints to multi-channel filers. Consequently, the process of
learning spatial filters can be approximated by the lasso regularisation. To
encourage temporal consistency, the filter model is restricted to lie around
its historical value and updated locally to preserve the global structure in
the manifold. Last, a unified optimisation framework is proposed to jointly
select temporal consistency preserving spatial features and learn
discriminative filters with the augmented Lagrangian method. Qualitative and
quantitative evaluations have been conducted on a number of well-known
benchmarking datasets such as OTB2013, OTB50, OTB100, Temple-Colour, UAV123 and
VOT2018. The experimental results demonstrate the superiority of the proposed
method over the state-of-the-art approaches
Going Further with Point Pair Features
Point Pair Features is a widely used method to detect 3D objects in point
clouds, however they are prone to fail in presence of sensor noise and
background clutter. We introduce novel sampling and voting schemes that
significantly reduces the influence of clutter and sensor noise. Our
experiments show that with our improvements, PPFs become competitive against
state-of-the-art methods as it outperforms them on several objects from
challenging benchmarks, at a low computational cost.Comment: Corrected post-print of manuscript accepted to the European
Conference on Computer Vision (ECCV) 2016;
https://link.springer.com/chapter/10.1007/978-3-319-46487-9_5
Fingerprint Recognition Using Translation Invariant Scattering Network
Fingerprint recognition has drawn a lot of attention during last decades.
Different features and algorithms have been used for fingerprint recognition in
the past. In this paper, a powerful image representation called scattering
transform/network, is used for recognition. Scattering network is a
convolutional network where its architecture and filters are predefined wavelet
transforms. The first layer of scattering representation is similar to sift
descriptors and the higher layers capture higher frequency content of the
signal. After extraction of scattering features, their dimensionality is
reduced by applying principal component analysis (PCA). At the end, multi-class
SVM is used to perform template matching for the recognition task. The proposed
scheme is tested on a well-known fingerprint database and has shown promising
results with the best accuracy rate of 98\%.Comment: IEEE Signal Processing in Medicine and Biology Symposium, 201
Principled Design and Implementation of Steerable Detectors
We provide a complete pipeline for the detection of patterns of interest in
an image. In our approach, the patterns are assumed to be adequately modeled by
a known template, and are located at unknown position and orientation. We
propose a continuous-domain additive image model, where the analyzed image is
the sum of the template and an isotropic background signal with self-similar
isotropic power-spectrum. The method is able to learn an optimal steerable
filter fulfilling the SNR criterion based on one single template and background
pair, that therefore strongly responds to the template, while optimally
decoupling from the background model. The proposed filter then allows for a
fast detection process, with the unknown orientation estimation through the use
of steerability properties. In practice, the implementation requires to
discretize the continuous-domain formulation on polar grids, which is performed
using radial B-splines. We demonstrate the practical usefulness of our method
on a variety of template approximation and pattern detection experiments
Learning Descriptors for Object Recognition and 3D Pose Estimation
Detecting poorly textured objects and estimating their 3D pose reliably is
still a very challenging problem. We introduce a simple but powerful approach
to computing descriptors for object views that efficiently capture both the
object identity and 3D pose. By contrast with previous manifold-based
approaches, we can rely on the Euclidean distance to evaluate the similarity
between descriptors, and therefore use scalable Nearest Neighbor search methods
to efficiently handle a large number of objects under a large range of poses.
To achieve this, we train a Convolutional Neural Network to compute these
descriptors by enforcing simple similarity and dissimilarity constraints
between the descriptors. We show that our constraints nicely untangle the
images from different objects and different views into clusters that are not
only well-separated but also structured as the corresponding sets of poses: The
Euclidean distance between descriptors is large when the descriptors are from
different objects, and directly related to the distance between the poses when
the descriptors are from the same object. These important properties allow us
to outperform state-of-the-art object views representations on challenging RGB
and RGB-D data.Comment: CVPR 201
- …