Ivan Kazantsev

Dr. Ivan Kazantsev


Research Focus & Metrics

Academic Career Length

36Years (1991-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2007 in IEEE Journal of Selected Topics in Signal Processing
Verified
Journal Article
Closed access
DBDan Butnariu
Dan Butnariu
RDRan Davidi
Ran Davidi
GHGabor T. Herman
Gabor T. Herman
IKIvan Kazantsev
Ivan Kazantsev
We study the convergence behavior of a class of projection methods for solving convex feasibility and optimization problems. We prove that the algorithms in this class converge to solutions of the consistent convex feasibility problem, and that their convergence is stable under summable perturbations. Our class is a subset of the class of string-averaging projection methods, large enough to contain, among many other procedures, a version of the Cimmino algorithm, as well as the cyclic projection method. A variant of our approach is proposed to approximate the minimum of a convex functional subject to convex constraints. This variant is illustrated on a problem in image processing: namely, for optimization in tomography.

1 May 2002 in Signal Processing
Verified
Journal Article
Closed access
IKIvan Kazantsev
Ivan Kazantsev
ILI. Lemahieu
I. Lemahieu
GSG.I. Salov
G.I. Salov
RDR. Denys
R. Denys

7 July 2017 in Journal of Applied Crystallography
Verified
Journal Article
Open access
PDF file
KBKenneth R. Beyerlein
Kenneth R. Beyerlein
TWThomas A. White
Thomas A. White
OYOleksandr M. Yefanov
Oleksandr M. Yefanov
CGCornelius Gati
Cornelius Gati
IKIvan Kazantsev
Ivan Kazantsev
SSSøren Schmidt
Søren Schmidt
A novel algorithm for indexing multiple crystals in snapshot X-ray diffraction images, especially suited for serial crystallography data, is presented. The algorithm, FELIX, utilizes a generalized parametrization of the Rodrigues–Frank space, in which all crystal systems can be represented without singularities. The new algorithm is shown to be capable of indexing more than ten crystals per image in simulations of cubic, tetragonal and monoclinic crystal diffraction patterns. It is also used to index an experimental serial crystallography dataset from lysozyme microcrystals. The increased number of indexed crystals is shown to result in a better signal-to-noise ratio, and fewer images are needed to achieve the same data quality as when indexing one crystal per image. The relative orientations between the multiple crystals indexed in an image show a slight tendency of the lysozme microcrystals to adhere on (\overline 110) facets.

1 June 1998 in Inverse Problems
Verified
Journal Article
Closed access
PDF file
IKIvan Kazantsev
Ivan Kazantsev
In this paper tomographic reconstruction based on the concept of ridge functions (Logan and Shepp) is considered. A reconstruction approach for the ridge functions from a finite number of arbitrary projections is suggested within the framework of parallel beam geometry. The method deals with images that can be presented as a sum of ridge functions. This assumption results in a consistent linear system of Fredholm integral equations of the third kind in terms of one-dimensional functions. We derive a formula to calculate the ridge functions from the set of arbitrary projections. In the case of equally spaced projections formulae for the analytical inversion of matrices encountered in the calculation of ridge functions are derived.

26 June 2006 in IEEE Transactions on Medical Imaging
Verified
Journal Article
Closed access
SMS. Matej
S. Matej
IKIvan Kazantsev
Ivan Kazantsev
Fourier-based approaches for three-dimensional (3-D) reconstruction are based on the relationship between the 3-D Fourier transform (FT) of the volume and the two-dimensional (2-D) FT of a parallel-ray projection of the volume. The critical step in the Fourier-based methods is the estimation of the samples of the 3-D transform of the image from the samples of the 2-D transforms of the projections on the planes through the origin of Fourier space, and vice versa for forward-projection (reprojection). The Fourier-based approaches have the potential for very fast reconstruction, but their straightforward implementation might lead to unsatisfactory results if careful attention is not paid to interpolation and weighting functions. In our previous work, we have investigated optimal interpolation parameters for the Fourier-based forward and back-projectors for iterative image reconstruction. The optimized interpolation kernels were shown to provide excellent quality comparable to the ideal sinc interpolator. This work presents an optimization of interpolation parameters of the 3-D direct Fourier method with Fourier reprojection (3D-FRP) for fully 3-D positron emission tomography (PET) data with incomplete oblique projections. The reprojection step is needed for the estimation (from an initial image) of the missing portions of the oblique data. In the 3D-FRP implementation, we use the gridding interpolation strategy, combined with proper weighting approaches in the transform and image domains. We have found that while the 3-D reprojection step requires similar optimal interpolation parameters as found in our previous studies on Fourier-based iterative approaches, the optimal interpolation parameters for the main 3D-FRP reconstruction stage are quite different. Our experimental results confirm that for the optimal interpolation parameters a very good image accuracy can be achieved even without any extra spectral oversampling, which is a common practice to decrease errors caused by interpolation in Fourier reconstruction

1 July 2005 in Electronic Notes in Discrete Mathematics
Verified
Journal Article
Closed access
IKIvan Kazantsev
Ivan Kazantsev
SMSamuel Matej
Samuel Matej
RLRobert M. Lewitt
Robert M. Lewitt