#### Filter Results:

- Full text PDF available (75)

#### Publication Year

1987

2017

- This year (1)
- Last 5 years (11)
- Last 10 years (33)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Dmitry Chetverikov, Dmitry Stepanov, Pavel Krsek
- Image Vision Comput.
- 2005

The problem of geometric alignment of two roughly pre-registered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension of the popular Iterative Closest Point (ICP) algorithm [1] is presented, called Trimmed ICP. The new algorithm is based on the consistent use of the Least Trimmed Squares approach… (More)

- Dmitry Chetverikov, Renaud Péteri
- CORES
- 2005

- Dmitry Chetverikov, D. Svirko, Dmitry Stepanov, Pavel Krsek
- ICPR
- 2002

The problem of geometric alignment of two roughly preregistered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension of the popular Iterative Closest Point (ICP) algorithm [1] is presented, called the Trimmed ICP (TrICP). The new algorithm is based on the consistent use of the Least Trimmed… (More)

- Dmitry Chetverikov
- Image Vision Comput.
- 1998

Regular structures, flat and non-flat, are perceived as regular in a wide range of viewing angles and under varying illumination. In this papers, we exploit this simple observation and develop an invariant measure of pattern regularity. The measure is the maximum of the regularity values obtained for different directions within the pattern. We demonstrate… (More)

- Evgeny Lomonosov, Dmitry Chetverikov, Anikó Ekárt
- Pattern Recognition Letters
- 2006

This paper reports on a successful application of genetic optimisation in 3D data registration. We consider the problem of Euclidean alignment of two arbitrarily oriented, partially overlapping surfaces represented by measured point sets contaminated by noise and outliers. Recently, we have proposed the Trimmed Iterative Closest Point algorithm (TrICP) [1]… (More)

- Renaud Péteri, Dmitry Chetverikov
- IbPRIA
- 2005

The processing, description and recognition of dynamic (time-varying) textures are new exciting areas of texture analysis. Many real-world textures are dynamic textures whose retrieval from a video database should be based on both dynamic and static features. In this article, a method for extracting features revealing fundamental properties of dynamic… (More)

- Dmitry Chetverikov
- CAIP
- 2003

A new algorithm is proposed for detection of corners and other high curvature points in planar curves. A corner is deened as a location where a triangle with speciied opening angle and size can be inscribed in the curve. The tests compare the new algorithm to four alternative algorithms for corner detection.

- Sándor Fazekas, Dmitry Chetverikov
- Sig. Proc.: Image Comm.
- 2007

We address the problem of dynamic texture (DT) classification using optical flow features. optical flow based approaches dominate among the currently available DT classification methods. The features used by these approaches often describe local image distortions in terms of such quantities as curl or divergence. Both normal and complete flows have been… (More)

- Tomer Amiaz, Sándor Fazekas, Dmitry Chetverikov, Nahum Kiryati
- SSVM
- 2007

Motion estimation is usually based on the brightness constancy assumption. This assumption holds well for rigid objects with a Lambertian surface, but it is less appropriate for fluid and gaseous materials. For these materials a variant of this assumption, which we call the brightness conservation assumption should be employed. Under this assumption an… (More)

- Judit Verestóy, Dmitry Chetverikov
- Theoretical Foundations of Computer Vision
- 1998