# Search results for: Ryszard Kozera

Metody Ilościowe w Badaniach Ekonomicznych > 2017 > 18 > 1 > 7-17

*u*whose graph is the visible part of the surface [9], [16], [17], [24]. In the present paper we consider the same task, but...

^{n}from an ordered collection of data points

*qi*= γ(

*t*

_{i}), with either the

*ti*’s known or unknown. For the

*ti*’s uniform (known or unknown) piecewise Lagrange interpolation provides efficient length estimates, but in other cases it may fail. In this paper, we apply this classical...

^{1}we adapt Leap-Frog to solve an optimization problem in computer vision. The vision problem in the present paper is to recover (as far as possible) an integrable vector field (over an orthogonal grid) from a field corrupted by noise or the effects of digitization of...

^{n}from points

*qi*= γ(

*ti*), where the parameters

*ti*are not given. When the

*ti*are uniformly distributed Lagrange interpolation by piecewise polynomials provides efficient length estimates, but in other cases this method can behave very badly [15]. In the present paper we apply this simple algorithm...

Lecture Notes in Computer Science > Computer Vision — ECCV 2002 > Structure from Motion / Stereoscopic Vision / Surface Geometry / Shape > 613-625

*T*] → ℝ

^{2}and its derivatives from an ordered sample of interpolation points γ(

*t*

_{0}), γ(

*t*

_{1}),...,γ(

*t*

_{ i }-1),γ(

*t*

_{ i }),...,γ(

*t*

_{ m }-1),γ(

*t*

_{ m }), where 0 =

*t*

_{0}<

*t*...

Lecture Notes in Computer Science > Computational Science — ICCS 2003 > Track on Applications > 100-108

Lecture Notes in Computer Science > Computer Analysis of Images and Patterns > Image Analysis > 518-526

*T*] → ℝ

^{n}from points

*q*

_{i}=γ(

*t*

_{i}), where the parameters

*t*

_{i}are not given. Of course, it is necessary to make some assumptions about the distribution of the

*t*

_{i}: in the present paper

*ε*-uniformity. Our theoretical result concerns an algorithm which uses piecewise-quadratic...

Lecture Notes in Computer Science > Computer Analysis of Images and Patterns > Interpolation and Spatial Transformations > 697-705

*n*-dimensional Euclidean space. The corresponding tabular parameters are assumed to be

*unknown*. In this paper the convergence rates for estimating both curve and its length with cumulative chord piecewise-quartics are established for different types of unparameterized...

Mathematica Applicanda > 2013 > 41 > 1

Journal of Mathematical Imaging and Vision > 2009 > 34 > 2 > 200-221

*restricted correspondence problem*is the task of solving the classical stereo correspondence problem when the surface being observed is known to belong to a family of surfaces that vary in a known way with one or more parameters. Under this constraint the surface can be extracted far more robustly than by classical stereo applied to an arbitrary surface, since the problem is solved semi-globally,...

Journal of Mathematical Imaging and Vision > 2008 > 30 > 2 > 181-193

*d*=2 (quadric) algebraic surface there is a 1-parameter family of surfaces that reproduce the outlines. When the algebraic surface...

Journal of Mathematical Imaging and Vision > 2003 > 18 > 2 > 119-127

*J. Math. Australian Soc.*A, Vol. 64, pp. 37–50, 1999) is an iterative scheme for solving a class of nonquadratic optimization problems. In this paper a 2-D version of Leap-Frog is applied to a non optimization problem in computer vision, namely the recovery (so far as possible) of an unknown surface from 3 noisy camera images. This contrasts with previous work on photometric...

Journal of Mathematical Imaging and Vision > 1997 > 7 > 2 > 123-138

Applied Mathematics and Computation > 1995 > 73 > 1 > 1-37