Zobrazeno 1 - 10
of 18
pro vyhledávání: '"V. B. Mnukhin"'
Autor:
V. B. Mnukhin
Publikováno v:
Proceedings of X All-Russian Scientific Conference "System Synthesis and Applied Synergetics".
Autor:
V. B. Mnukhin, A. N. Karkishchenko
Publikováno v:
Pattern Recognition and Image Analysis. 31:421-430
The aim of this study is to develop a method for detecting the characteristic points in a digital image that is stable under a certain class of brightness transformations. The need for such a method is due to the need to identify key points of images
Autor:
V. B. Mnukhin, A. N. Karkishchenko
Publikováno v:
IZVESTIYA SFedU. ENGINEERING SCIENCES. :141-154
Autor:
A. N. Karkishchenko, V. B. Mnukhin
Publikováno v:
IZVESTIYA SFedU. ENGINEERING SCIENCES. :59-70
Autor:
V. B. Mnukhin, A. N. Karkishchenko
Publikováno v:
Pattern Recognition and Image Analysis. 30:359-371
It is described how to construct a distance on analog and quantized images, which is invariant with respect to strictly monotonic increasing transformations of the brightness function. The distance function takes into account possible normal noise on
Autor:
V. B. Mnukhin
Publikováno v:
Pattern Recognition and Image Analysis. 24:552-560
This paper considers an algebraic method of digital images processing, based on the representation of images as functions on "finite complex planes" called complex discrete tori. Properties of such tori are studied; in particular, the concept of comp
Autor:
A N Karkishchenko, V B Mnukhin
Publikováno v:
Journal of Physics: Conference Series. 1096:012040
The problem of furnishing systems of eigenvectors for the discrete Fourier transform (DFT) is fundamental to image processing with applications in image compression and digital watermarking. This paper studies some properties of such system for DFT o
Autor:
V. B. Mnukhin, Johannes Siemons
Publikováno v:
Journal of Combinatorial Theory, Series A. 114(3):572-574
Autor:
V. B. Mnukhin
Publikováno v:
Acta Applicandae Mathematicae. 52:149-162
Let G be a permutation group on a set Ω. Then G acts in the natural way on the collection Ω{k} of all k-element subsets. Orbits under this action are called k-orbits. A problem similar to the Edge-Reconstruction Conjecture in graph theory can be po
Autor:
V. B. Mnukhin
Publikováno v:
Acta Applicandae Mathematicae. 29:83-117
Let (G, W) be a permutation group on a finite set W = {w 1,..., w n}. We consider the natural action of G on the set of all subsets of W. Let h 0, h 1,..., h N be the orbits of this action. For each i, 1 ≤ i ≤ N, there exists k, 1 ≤ k ≤ n, su