Sciweavers

6266 search results - page 31 / 1254
» New results on the computability and complexity of points - ...
Sort
View
CVPR
1998
IEEE
14 years 8 months ago
A New Complex Basis for Implicit Polynomial Curves and its Simple Exploitation for Pose Estimation and Invariant Recognition
New representations are developed for 2D IP (implicit polynomial) curves ofarbitrary degree. These representations permit shape recognition and pose estimation with essentially sin...
David B. Cooper, Jean-Philippe Tarel
ICB
2007
Springer
183views Biometrics» more  ICB 2007»
13 years 11 months ago
Robust Point-Based Feature Fingerprint Segmentation Algorithm
Abstract. A critical step in automatic fingerprint recognition is the accurate segmentation of fingerprint images. The objective of fingerprint segmentation is to decide which part...
Chaohong Wu, Sergey Tulyakov, Venu Govindaraju
WOSP
2010
ACM
14 years 2 months ago
A general result for deriving product-form solutions in markovian models
In this paper we provide a general method to derive productform solutions for stochastic models. We take inspiration from the Reversed Compound Agent Theorem [14] and we provide a...
Andrea Marin, Maria Grazia Vigliotti
COMPGEOM
1993
ACM
13 years 11 months ago
Approximating Center Points with Iterated Radon Points
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
Kenneth L. Clarkson, David Eppstein, Gary L. Mille...
ICPR
2002
IEEE
14 years 16 days ago
Exploratory Analysis of Point Proximity in Subspaces
We consider clustering as computation of a structure of proximity relationships within a data set in a feature space or its subspaces. We propose a data structure to represent suc...
Tin Kam Ho