Results 231 to 240 of about 49,732,844 (278)
Some of the next articles are maybe not open access.
Local shape approximation from shading
Journal of Mathematical Imaging and Vision, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daphna Weinshall
exaly +4 more sources
Proceedings of 12th International Conference on Pattern Recognition, 1995
A new approach for the reconstruction of a smooth three dimensional object from its two dimensional gray level image is presented. An algorithm based on topological properties of simple smooth surfaces is provided to solve the problem of global reconstruction.
Ron Kimmel, Alfred M. Bruckstein
openaire +3 more sources
A new approach for the reconstruction of a smooth three dimensional object from its two dimensional gray level image is presented. An algorithm based on topological properties of simple smooth surfaces is provided to solve the problem of global reconstruction.
Ron Kimmel, Alfred M. Bruckstein
openaire +3 more sources
IEEE Transactions on Pattern Analysis and Machine Intelligence, 1999
Summary: Since the first shape-from-shading (SFS) technique was developed by Horn in the early 1970s, many different approaches have emerged. In this paper, six well-known SFS algorithms are implemented and compared. The performance of the algorithms was analyzed on synthetic images using mean and standard deviation of depth error, mean of surface ...
Ruo Zhang +3 more
openaire +2 more sources
Summary: Since the first shape-from-shading (SFS) technique was developed by Horn in the early 1970s, many different approaches have emerged. In this paper, six well-known SFS algorithms are implemented and compared. The performance of the algorithms was analyzed on synthetic images using mean and standard deviation of depth error, mean of surface ...
Ruo Zhang +3 more
openaire +2 more sources
2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2010
We examine the shape from shading problem without boundary conditions as a polynomial system. This view allows, in generic cases, a complete solution for ideal polyhedral objects. For the general case we propose a semidefinite programming relaxation procedure, and an exact line search iterative procedure with a new smoothness term that favors folds at ...
Ady Ecker, Allan D. Jepson
openaire +2 more sources
We examine the shape from shading problem without boundary conditions as a polynomial system. This view allows, in generic cases, a complete solution for ideal polyhedral objects. For the general case we propose a semidefinite programming relaxation procedure, and an exact line search iterative procedure with a new smoothness term that favors folds at ...
Ady Ecker, Allan D. Jepson
openaire +2 more sources
An application of shape from shading
ICARCV 2004 8th Control, Automation, Robotics and Vision Conference, 2004., 2005Shape from shading (SFS) is an important domain in computer vision. At first the paper introduces a method of shape from shading based on single image and puts forward its implementation. Then adds proper boundary conditions and adjusts the factor of brightness error function adaptively according to the results by the original algorithm, and finds ...
Quan Ying Du, Shanben Chen, Tao Lin 0011
openaire +2 more sources
Computer Vision and Image Understanding, 1996
A global shape from shading algorithm which develops a technique to merge local shape from shading results obtained around singular points into the complete shape using the mountaineers theorem was recently presented in Kimmel and Bruckstein (1995).
Ilan Shimshoni +2 more
openaire +1 more source
A global shape from shading algorithm which develops a technique to merge local shape from shading results obtained around singular points into the complete shape using the mountaineers theorem was recently presented in Kimmel and Bruckstein (1995).
Ilan Shimshoni +2 more
openaire +1 more source
Computer Vision, Graphics, and Image Processing, 1988
We present a new method for the recovery of a bivariate function H(x, y) that describes a “nice,” almost everywhere differentiable height profile, from shading information. The given shading data is assumed to be a result of diffuse, Lambertian reflection of light from the surface.
openaire +2 more sources
We present a new method for the recovery of a bivariate function H(x, y) that describes a “nice,” almost everywhere differentiable height profile, from shading information. The given shading data is assumed to be a result of diffuse, Lambertian reflection of light from the surface.
openaire +2 more sources
Multiresolution shape from shading
Proceedings CVPR '89: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003A method to reduce image resolution that simulates the reduction of shape resolution is presented. Such resolution reduction is critical for shape-from-shading algorithms. This method of resolution reduction is used in accelerating the shape from shading by using small multiresolution pyramids.
Gad Ron, Shmuel Peleg
openaire +2 more sources
2020
In this chapter, the algorithms to reconstruct the shape of the visible 3D surface using only the brightness variation information (shading, that is, the level variations of gray or colored) observed in the image are described. The inverse problem of reconstructing the shape of the visible surface from the changes in brightness in the image is known as
Arcangelo Distante, Cosimo Distante
openaire +2 more sources
In this chapter, the algorithms to reconstruct the shape of the visible 3D surface using only the brightness variation information (shading, that is, the level variations of gray or colored) observed in the image are described. The inverse problem of reconstructing the shape of the visible surface from the changes in brightness in the image is known as
Arcangelo Distante, Cosimo Distante
openaire +2 more sources
CVGIP: Image Understanding, 1990
Summary: The paper uses a new algorithm, hierarchical basis conjugate gradient descent, to provide a faster solution to the shape from shading problem. This approach is similar to the multigrid techniques that have previously been used to speed convergence, but it does not require heuristic approximations to the true irradiance equation.
openaire +4 more sources
Summary: The paper uses a new algorithm, hierarchical basis conjugate gradient descent, to provide a faster solution to the shape from shading problem. This approach is similar to the multigrid techniques that have previously been used to speed convergence, but it does not require heuristic approximations to the true irradiance equation.
openaire +4 more sources