Sciweavers

2262 search results - page 19 / 453
» Points with large quadrant-depth
Sort
View
ICCV
2005
IEEE
16 years 1 months ago
A Robust Algorithm for Point Set Registration Using Mixture of Gaussians
This paper proposes a novel and robust approach to the point set registration problem in the presence of large amounts of noise and outliers. Each of the point sets is represented...
Bing Jian, Baba C. Vemuri
CAIP
2009
Springer
110views Image Analysis» more  CAIP 2009»
15 years 4 months ago
Optic Flow Using Multi-scale Anchor Points
We introduce a new method to determine the flow field of an image sequence using multi-scale anchor points. These anchor points manifest themselves in the scale-space representat...
Pieter van Dorst, Bart Janssen, Luc Florack, Bart ...
SIAMJO
2010
128views more  SIAMJO 2010»
14 years 6 months ago
Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm
We propose a Newton-CG primal proximal point algorithm for solving large scale log-determinant optimization problems. Our algorithm employs the essential ideas of the proximal poi...
Chengjing Wang, Defeng Sun, Kim-Chuan Toh
GIS
2007
ACM
16 years 27 days ago
Comparing global and interest point descriptors for similarity retrieval in remote sensed imagery
We investigate the application of a new category of low-level image descriptors termed interest points to remote sensed image analysis. In particular, we compare how scale and rot...
Shawn Newsam, Yang Yang
SODA
1996
ACM
121views Algorithms» more  SODA 1996»
15 years 1 months ago
Optimal Placement of Convex Polygons to Maximize Point Containment
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
Matthew Dickerson, Daniel Scharstein