50 search results - page 2 / 10 » Exploiting discriminant information in elastic graph matchin... |
104
click to vote
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
A convenient way of dealing with image sets is to represent them as points on Grassmannian manifolds. While several recent studies explored the applicability of discriminant analy...
PKDD
2005
Springer
15 years 3 months ago
2005
Springer
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...
TMI
2002
14 years 9 months ago
2002
This paper presents a fully automated segmentation method for medical images. The goal is to localize and parameterize a variety of types of structure in these images for subsequen...
153
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
In the symbol recognition stage of online handwritten math expression recognition, the one-pass dynamic programming algorithm can produce high-quality symbol graphs in addition of...