We consider the convex optimization problem minx{f(x) : gj(x) ≤ 0, j = 1, . . . , m} where f is convex, the feasible set K is convex and Slater’s condition holds, but the funct...
The necessary and sufficient conditions for being able to estimate scene structure, motion and camera calibration from a sequence of images are very rarely satisfied in practice. ...
Yi Ma, Stefano Soatto, Jana Kosecka, Shankar Sastr...
Abstract-- In this paper, we introduce a new skeleton pruning method based on contour partitioning. Any contour partition can be used, but the partitions obtained by Discrete Curve...
: This article addresses the problem of estimating the motion of a camera as it observes the outline (or apparent contour) of a solid bounded by a smooth surface in successive imag...
Yasutaka Furukawa, Amit Sethi, Jean Ponce, David J...
In this paper, based on the new definition of high frequency geometric detail for point-sampled surfaces, a new approach for detail manipulation and a detail-preserving editing fra...