Sciweavers

588 search results - page 69 / 118
» Computing the Dimension of Linear Subspaces
Sort
View
SODA
2010
ACM
143views Algorithms» more  SODA 2010»
13 years 8 months ago
Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a giv...
Karthekeyan Chandrasekaran, Daniel Dadush, Santosh...
IPL
2007
104views more  IPL 2007»
13 years 9 months ago
A linear-time algorithm for Euclidean feature transform sets
The Euclidean distance transform of a binary image is the function that assigns to every pixel the Euclidean distance to the background. The Euclidean feature transform is the fun...
Wim H. Hesselink
ICCV
2009
IEEE
15 years 2 months ago
Sparse Representation of Cast Shadows via L1-Regularized Least Squares
Scenes with cast shadows can produce complex sets of images. These images cannot be well approximated by lowdimensional linear subspaces. However, in this paper we show that the...
Xue Mei, Haibin Ling, David W. Jacobs
ICCV
2005
IEEE
14 years 12 months ago
3D Shape Recognition and Reconstruction Based on Line Element Geometry
This paper presents a new method for the recognition and reconstruction of surfaces from 3D data. Line element geometry, which generalizes both line geometry and the Laguerre geom...
Michael Hofer, Boris Odehnal, Helmut Pottmann, Tib...
ICPR
2002
IEEE
14 years 11 months ago
Natural Image Correction by Iterative Projections to Eigenspace Constructed in Normalized Image Space
Image correction is discussed for realizing both effective object recognition and realistiic image-based rendering. Three image normalizations are compared in relation with the li...
Takeshi Shakunaga, Fumihiko Sakaue