Time-series data mining

P Esling, C Agon - ACM Computing Surveys (CSUR), 2012 - dl.acm.org
In almost every scientific field, measurements are performed over time. These observations
lead to a collection of organized data called time series. The purpose of time-series data …

Dynamic programming and graph algorithms in computer vision

PF Felzenszwalb, R Zabih - IEEE transactions on pattern …, 2010 - ieeexplore.ieee.org
Optimization is a powerful paradigm for expressing and solving problems in a wide range of
areas, and has been successfully applied to many vision problems. Discrete optimization …

[图书][B] Functional and shape data analysis

A Srivastava, EP Klassen - 2016 - Springer
Function and shape data analysis are old topics in statistics, studied off and on over the last
several decades. However, the early years of the new millennium saw a renewed focus and …

Shape analysis of elastic curves in euclidean spaces

A Srivastava, E Klassen, SH Joshi… - IEEE transactions on …, 2010 - ieeexplore.ieee.org
This paper introduces a square-root velocity (SRV) representation for analyzing shapes of
curves in euclidean spaces under an elastic metric. In this SRV representation, the elastic …

Shape classification using the inner-distance

H Ling, DW Jacobs - IEEE transactions on pattern analysis and …, 2007 - ieeexplore.ieee.org
Part structure and articulation are of fundamental importance in computer and human vision.
We propose using the inner-distance to build shape descriptors that are robust to articulation …

Design and perceptual validation of performance measures for salient object segmentation

V Movahedi, JH Elder - 2010 IEEE computer society …, 2010 - ieeexplore.ieee.org
Empirical evaluation of salient object segmentation methods requires i) a dataset of ground
truth object segmentations and ii) a performance measure to compare the output of the …

Recognition of shapes by editing their shock graphs

TB Sebastian, PN Klein… - IEEE Transactions on …, 2004 - ieeexplore.ieee.org
This paper presents a novel framework for the recognition of objects based on their
silhouettes. The main idea is to measure the distance between two shapes as the minimum …

An efficient earth mover's distance algorithm for robust histogram comparison

H Ling, K Okada - IEEE transactions on pattern analysis and …, 2007 - ieeexplore.ieee.org
We propose EMD-L_ {1}: a fast and exact algorithm for computing the Earth Mover's
Distance (EMD) between a pair of histograms. The efficiency of the new algorithm enables …

Analysis of planar shapes using geodesic paths on shape spaces

E Klassen, A Srivastava, M Mio… - IEEE transactions on …, 2004 - ieeexplore.ieee.org
For analyzing shapes of planar, closed curves, we propose differential geometric
representations of curves using their direction functions and curvature functions. Shapes are …

Path similarity skeleton graph matching

X Bai, LJ Latecki - IEEE transactions on pattern analysis and …, 2008 - ieeexplore.ieee.org
This paper proposes a novel graph matching algorithm and applies it to shape recognition
based on object silhouettes. The main idea is to match skeleton graphs by comparing the …