Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Konstantin Sarin"'
Autor:
Konstantin Sarin, Ilya Hodashinsky
Publikováno v:
Компьютерная оптика, Vol 43, Iss 5, Pp 833-845 (2019)
Handwritten signature verification is an important research area in the field of person authentication and biometric identification. There are two known methods for handwriting signature verification: if it is possible to digitize the speed of pen mo
Externí odkaz:
https://doaj.org/article/993aa937feb44e8c87c9dcf7825c7516
Autor:
Ilya Hodashinsky, Evgeny Kostyuchenko, Konstantin Sarin, Aleksandr Anfilofev, Marina Bardamova, Sergey Samsonov, Igor Filimonenko
Publikováno v:
Компьютерная оптика, Vol 42, Iss 4, Pp 657-666 (2018)
Dynamic signature verification is one of the most fast, intuitive, and cost effective tools for user authentication. Dynamic signature recognition uses multiple characteristics in the analysis of an individual’s handwriting. Dynamic characteristics
Externí odkaz:
https://doaj.org/article/a69f84b4d5984b208762ae54dd895f33
Publikováno v:
Symmetry, Vol 11, Iss 11, p 1423 (2019)
This paper concerns several important topics of the Symmetry journal, namely, pattern recognition, computer-aided design, diversity and similarity. We also take advantage of the symmetric structure of a membership function. Searching for the (sub) op
Externí odkaz:
https://doaj.org/article/2b33a99599d3438c8e0084ff88e52d84
Autor:
Emrah Hancer, Marina Bardamova, Ilya Hodashinsky, Konstantin Sarin, Artem Slezkin, Mikhail Svetlakov
Publikováno v:
Informatica. :523-543
In this paper we propose modifications of the well-known algorithm of particle swarm optimization (PSO). These changes affect the mapping of the motion of particles from continuous space to binary space for searching in it, which is widely used to so
Publikováno v:
Soft Computing. 25:8665-8681
Handwritten signature verification is one of the most fast, intuitive and cost-effective tools for user authentication. However, the analysis of the handwritten signature may become complicated due to the large dimensionality. Feature selection is tr
Autor:
Dariya Novokhrestova, Marina Bardamova, Ilya Hodashinsky, Evgeny Kostyuchenko, Konstantin Sarin
Publikováno v:
Speech and Computer ISBN: 9783031209796
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::79f1d6f8138e86b4f775f341cef47d58
https://doi.org/10.1007/978-3-031-20980-2_44
https://doi.org/10.1007/978-3-031-20980-2_44
Autor:
Ruben Tolosana, Ruben Vera-Rodriguez, Carlos Gonzalez-Garcia, Julian Fierrez, Aythami Morales, Javier Ortega-Garcia, Juan Carlos Ruiz-Garcia, Sergio Romero-Tapiador, Santiago Rengifo, Miguel Caruana, Jiajia Jiang, Songxuan Lai, Lianwen Jin, Yecheng Zhu, Javier Galbally, Moises Diaz, Miguel Angel Ferrer, Marta Gomez-Barrero, Ilya Hodashinsky, Konstantin Sarin, Artem Slezkin, Marina Bardamova, Mikhail Svetlakov, Mohammad Saleem, Cintia Lia Szcs, Bence Kovari, Falk Pulsmeyer, Mohamad Wehbi, Dario Zanca, Sumaiya Ahmad, Sarthak Mishra, Suraiya Jabin
Publikováno v:
Biblos-e Archivo. Repositorio Institucional de la UAM
instname
instname
This article presents SVC-onGoing1, an on-going competition for on-line signature verification where researchers can easily benchmark their systems against the state of the art in an open common platform using large-scale public databases, such as De
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::18b1568e7a647e19f5fa20858720e740
http://hdl.handle.net/10486/702400
http://hdl.handle.net/10486/702400
Autor:
Ilya Hodashinsky, Konstantin Sarin
Publikováno v:
Programming and Computer Software. 45:221-227
The NP-hard feature selection problem is studied. For solving this problem, a population based algorithm that uses a combination of random and heuristic search is proposed. The solution is represented by a binary vector the dimension of which is dete
Autor:
Ilya Hodashinsky, Konstantin Sarin
Publikováno v:
Automation and Remote Control. 80:324-333
We propose a new approach for feature selection. The proposed approach is based on a combination of random and heuristic search strategies. The solution is represented as a binary vector whose dimension is determined by the number of features in the
Autor:
Mohamad Wehbi, Juan Carlos Ruiz-Garcia, Ruben Vera-Rodriguez, Marina Bardamova, Moises Diaz, Falk Pulsmeyer, Miguel Ferrer, Santiago Rengifo, Javier Galbally, Mikhail Svetlakov, Sergio Romero-Tapiador, Cintia Lia Szücs, Sumaiya Ahmad, Mohammad Saleem, Ruben Tolosana, Julian Fierrez, Sarthak Mishra, Konstantin Sarin, Jiajia Jiang, Dario Zanca, Yecheng Zhu, Ilya Hodashinsky, Lianwen Jin, Javier Ortega-Garcia, Carlos Gonzalez-Garcia, Songxuan Lai, Marta Gomez-Barrero, Bence Kovari, Aythami Morales, Suraiya Jabin, Artem Slezkin
Publikováno v:
Document Analysis and Recognition – ICDAR 2021 ISBN: 9783030863364
ICDAR (4)
Sergio Romero Tapiador
ICDAR (4)
Sergio Romero Tapiador
This paper describes the experimental framework and results of the ICDAR 2021 Competition on On-Line Signature Verification (SVC 2021). The goal of SVC 2021 is to evaluate the limits of on-line signature verification systems on popular scenarios (off
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::68ca22d354971267768246d69265b60f
https://doi.org/10.1007/978-3-030-86337-1_48
https://doi.org/10.1007/978-3-030-86337-1_48