Buscar
Mostrando ítems 1-10 de 11
Multi-view gait recognition on curved
(2017-12-11)
Appearance changes due to viewing angle changes cause difficulties for most of the gait recognition methods. In this paper, we propose a new approach for multi-view recognition, which allows to recognize people walking on ...
Entropy Volumes for Viewpoint Independent Gait Recognition
(2017-02-17)
Gait as biometrics has been widely used for
human identi cation. However, direction changes cause
di culties for most of the gait recognition systems, due
to appearance changes. This study presents an e cient
multi-view ...
Sistema digital de catalogación y consulta de documentos académicos: Tesis, Tesinas, Proyectos de Fin de Carrera
(Universidad de Córdoba, Vicerrectorado de Innovación y Calidad Docente, 2005)
A digital system has been developed on order to catalogue and consult academic documents: Theses, First Degree Dissertations and Technical Degree Final Projects. The system uses a listing of bibliographical subjects which ...
The AVA Multi-View Dataset for Gait Recognition
(2018)
In this paper, we introduce a new multi-view dataset for
gait recognition. The dataset was recorded in an indoor scenario, using
six convergent cameras setup to produce multi-view videos, where each
video depicts a ...
A new approach for multi-view gait recognition on unconstrained paths
(2017)
Direction changes cause di culties for most of the gait recognition systems, due to appearance
changes. We propose a new approach for multi-view gait recognition, which
focuses on recognizing people walking on unconstrained ...
A new thresholding approach for automatic generation of polygonal approximations
(Elsevier, 2016)
The present paper proposes a new algorithm for automatic generation of
polygonal approximations of 2D closed contours based on a new thresholding
method. The new proposal computes the signi cance level of the contour
points ...
A new approach for optimal time-series segmentation
(Elsevier, 2020)
This paper proposes a new optimal approach, called OSTS, to improve the segmentation of time series. The proposed method is based on A* algorithm and it uses an improved version of the well-known Salotti method for obtaining ...
Optimal online time-series segmentation
(Springer, 2024)
When time series are processed, the difficulty increases with the size of the series. This fact is aggravated when time series are processed online, since their size increases indefinitely. Therefore, reducing their number ...
A new approach for optimal offline time-series segmentation with error bound guarantee
(Elsevier, 2021)
This paper proposes a new optimal approach, called OSFS, based on feasible space (FS) Liu et al. (2008)[, that minimizes the number of segments of the approximation and guarantees the error bound using the L∞-norm. On the ...
Assessing polygonal approximations: A new measurement and a comparative study
(Elsevier, 2023)
Two proposals related to the evaluation of polygonal approximations are presented in this document. First, a new measurement, called normalized compression ratio and adjustment error (NCA), to provide a fair evaluation of ...