520 research outputs found
Local Rotation Invariant Patch Descriptors for 3D Vector Fields
Abstract—In this paper, we present two novel methods for the fast computation of local rotation invariant patch descriptors for 3D vectorial data. Patch based algorithms have recently become very popular approach for a wide range of 2D computer vision problems. Our local rotation invariant patch descriptors allow an extension of these methods to 3D vector fields. Our approaches are based on a harmonic representation for local spherical 3D vector field patches, which enables us to derive fast algorithms for the computation of rotation invariant power spectrum and bispectrum feature descriptors of such patches. Keywords-local feature; 3D vector field; invariance; I
Topological descriptors for 3D surface analysis
We investigate topological descriptors for 3D surface analysis, i.e. the
classification of surfaces according to their geometric fine structure. On a
dataset of high-resolution 3D surface reconstructions we compute persistence
diagrams for a 2D cubical filtration. In the next step we investigate different
topological descriptors and measure their ability to discriminate structurally
different 3D surface patches. We evaluate their sensitivity to different
parameters and compare the performance of the resulting topological descriptors
to alternative (non-topological) descriptors. We present a comprehensive
evaluation that shows that topological descriptors are (i) robust, (ii) yield
state-of-the-art performance for the task of 3D surface analysis and (iii)
improve classification performance when combined with non-topological
descriptors.Comment: 12 pages, 3 figures, CTIC 201
Graphic Symbol Recognition using Graph Based Signature and Bayesian Network Classifier
We present a new approach for recognition of complex graphic symbols in
technical documents. Graphic symbol recognition is a well known challenge in
the field of document image analysis and is at heart of most graphic
recognition systems. Our method uses structural approach for symbol
representation and statistical classifier for symbol recognition. In our system
we represent symbols by their graph based signatures: a graphic symbol is
vectorized and is converted to an attributed relational graph, which is used
for computing a feature vector for the symbol. This signature corresponds to
geometry and topology of the symbol. We learn a Bayesian network to encode
joint probability distribution of symbol signatures and use it in a supervised
learning scenario for graphic symbol recognition. We have evaluated our method
on synthetically deformed and degraded images of pre-segmented 2D architectural
and electronic symbols from GREC databases and have obtained encouraging
recognition rates.Comment: 5 pages, 8 figures, Tenth International Conference on Document
Analysis and Recognition (ICDAR), IEEE Computer Society, 2009, volume 10,
1325-132
DTW-Radon-based Shape Descriptor for Pattern Recognition
International audienceIn this paper, we present a pattern recognition method that uses dynamic programming (DP) for the alignment of Radon features. The key characteristic of the method is to use dynamic time warping (DTW) to match corresponding pairs of the Radon features for all possible projections. Thanks to DTW, we avoid compressing the feature matrix into a single vector which would otherwise miss information. To reduce the possible number of matchings, we rely on a initial normalisation based on the pattern orientation. A comprehensive study is made using major state-of-the-art shape descriptors over several public datasets of shapes such as graphical symbols (both printed and hand-drawn), handwritten characters and footwear prints. In all tests, the method proves its generic behaviour by providing better recognition performance. Overall, we validate that our method is robust to deformed shape due to distortion, degradation and occlusion
DART: Distribution Aware Retinal Transform for Event-based Cameras
We introduce a generic visual descriptor, termed as distribution aware
retinal transform (DART), that encodes the structural context using log-polar
grids for event cameras. The DART descriptor is applied to four different
problems, namely object classification, tracking, detection and feature
matching: (1) The DART features are directly employed as local descriptors in a
bag-of-features classification framework and testing is carried out on four
standard event-based object datasets (N-MNIST, MNIST-DVS, CIFAR10-DVS,
NCaltech-101). (2) Extending the classification system, tracking is
demonstrated using two key novelties: (i) For overcoming the low-sample problem
for the one-shot learning of a binary classifier, statistical bootstrapping is
leveraged with online learning; (ii) To achieve tracker robustness, the scale
and rotation equivariance property of the DART descriptors is exploited for the
one-shot learning. (3) To solve the long-term object tracking problem, an
object detector is designed using the principle of cluster majority voting. The
detection scheme is then combined with the tracker to result in a high
intersection-over-union score with augmented ground truth annotations on the
publicly available event camera dataset. (4) Finally, the event context encoded
by DART greatly simplifies the feature correspondence problem, especially for
spatio-temporal slices far apart in time, which has not been explicitly tackled
in the event-based vision domain.Comment: 12 pages, revision submitted to TPAMI in Nov 201
Fuzzy Intervals for Designing Structural Signature: An Application to Graphic Symbol Recognition
Revised selected papers from Eighth IAPR International Workshop on Graphics RECognition (GREC) 2009.The motivation behind our work is to present a new methodology for symbol recognition. The proposed method employs a structural approach for representing visual associations in symbols and a statistical classifier for recognition. We vectorize a graphic symbol, encode its topological and geometrical information by an attributed relational graph and compute a signature from this structural graph. We have addressed the sensitivity of structural representations to noise, by using data adapted fuzzy intervals. The joint probability distribution of signatures is encoded by a Bayesian network, which serves as a mechanism for pruning irrelevant features and choosing a subset of interesting features from structural signatures of underlying symbol set. The Bayesian network is deployed in a supervised learning scenario for recognizing query symbols. The method has been evaluated for robustness against degradations & deformations on pre-segmented 2D linear architectural & electronic symbols from GREC databases, and for its recognition abilities on symbols with context noise i.e. cropped symbols
Employing fuzzy intervals and loop-based methodology for designing structural signature: an application to symbol recognition
Motivation of our work is to present a new methodology for symbol
recognition. We support structural methods for representing visual associations
in graphic documents. The proposed method employs a structural approach for
symbol representation and a statistical classifier for recognition. We
vectorize a graphic symbol, encode its topological and geometrical information
by an ARG and compute a signature from this structural graph. To address the
sensitivity of structural representations to deformations and degradations, we
use data adapted fuzzy intervals while computing structural signature. The
joint probability distribution of signatures is encoded by a Bayesian network.
This network in fact serves as a mechanism for pruning irrelevant features and
choosing a subset of interesting features from structural signatures, for
underlying symbol set. Finally we deploy the Bayesian network in supervised
learning scenario for recognizing query symbols. We have evaluated the
robustness of our method against noise, on synthetically deformed and degraded
images of pre-segmented 2D architectural and electronic symbols from GREC
databases and have obtained encouraging recognition rates. A second set of
experimentation was carried out for evaluating the performance of our method
against context noise i.e. symbols cropped from complete documents. The results
support the use of our signature by a symbol spotting system.Comment: 10 pages, Eighth IAPR International Workshop on Graphics RECognition
(GREC), 2009, volume 8, 22-3
- …