This article illustrates the application of the Kalman filter in real-time human re-identification tasks to improve accuracy, reliability, and reduce computational costs while determining a person's position and orientation. The use of the Kalman filter addresses noise filtering and prediction issues in human re-identification tasks.
The study aims to explore a method for identifying corresponding objects across multiple camera views, to improve the accuracy of object re-identification. We analyzed various techniques, including contour detection, region of interest extraction, and keypoint extraction. We also examined the challenges of finding object correspondences between multiple camera views. To evaluate the effectiveness of the proposed method, we utilized two human attribute datasets, Market-1501 and DukeMTMC-reID, and performed extensive testing on these datasets.
The problem of extraction of the image objects features by means of using the inverse filters (IF) is considered. The IF are formed by the inversion of the matrix composed of correlation vectors of a set of objects templates examples. The inversion is made with the help of singular value decomposition. Three approaches to regularization and its impact on IF recognition properties are also considered. There was defined the functional that specifies minimal mutual relations between functions of the filters to obtain optimal separation of the features. A training process is used in order to obtain filters with high recognition performance.
In this work, partially homomorphic encryption algorithm based on elliptic curves is implemented. The established algorithm allows performing operations of encryption, addition and decryption of various aspects of the system. One of the possible applications of the algorithm is the creation of the depersonalization protocol in the electronic voting systems with different scales. The mathematical model of algorithm and mathematical models of basic analogues, among which it is possible to distinguish the algorithm of Paillier, which is also homomorphic according to the addition operation, are given. Comparison of fast-acting is executed between the algorithm based on elliptic curves and algorithm of Paillier at correlative cryptoproof lengths of the keys.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.