Acta Cybern.Pub Date : 2021-12-07DOI: 10.14232/actacyb.287868
José Vicente Egas López, G. Gosztolya
{"title":"Using the Fisher Vector Approach for Cold Identification","authors":"José Vicente Egas López, G. Gosztolya","doi":"10.14232/actacyb.287868","DOIUrl":"https://doi.org/10.14232/actacyb.287868","url":null,"abstract":"In this paper, we present a computational paralinguistic method for assessing whether a person has an upper respiratory tract infection (i.e. cold) using their speech. Having a system that can accurately assess a cold can be helpful for predicting its propagation. For this purpose, we utilize Mel-frequency Cepstral Coefficients (MFCC) as audio-signal representations, extracted from the utterances, which allowed us to fit a generative Gaussian Mixture Model (GMM) that serves to produce an encoding based on the Fisher Vector (FV) approach. Here, we use the URTIC dataset provided by the organizers of the ComParE Challenge 2017 of the Interspeech Conference. The classification is done by a linear kernel Support Vector Machines (SVM); owing to the high imbalance of classes on the training dataset, we opt for undersampling the majority class, that is, to reduce the number of samples to those of the minority class. We find that applying Power Normalization (PN) and Principal Component Analysis (PCA) on the Fisher vector features is an effective strategy for the classification performance. We get better performance than that of the Bag-of-Audio-Words approach reported in the paper of the challenge.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134186688","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Acta Cybern.Pub Date : 2021-12-07DOI: 10.14232/actacyb.288282
Ádám Fodor, László Kopácsi, Z. '. Milacski, András Lőrincz
{"title":"Speech De-identification with Deep Neural Networks","authors":"Ádám Fodor, László Kopácsi, Z. '. Milacski, András Lőrincz","doi":"10.14232/actacyb.288282","DOIUrl":"https://doi.org/10.14232/actacyb.288282","url":null,"abstract":"Cloud-based speech services are powerful practical tools but the privacy of the speakers raises important legal concerns when exposed to the Internet. We propose a deep neural network solution that removes personal characteristics from human speech by converting it to the voice of a Text-to-Speech (TTS) system before sending the utterance to the cloud. The network learns to transcode sequences of vocoder parameters, delta and delta-delta features of human speech to those of the TTS engine. We evaluated several TTS systems, vocoders and audio alignment techniques. We measured the performance of our method by (i) comparing the result of speech recognition on the de-identified utterances with the original texts, (ii) computing the Mel-Cepstral Distortion of the aligned TTS and the transcoded sequences, and (iii) questioning human participants in A-not-B, 2AFC and 6AFC tasks. Our approach achieves the level required by diverse applications.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"73 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115825532","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Acta Cybern.Pub Date : 2021-12-07DOI: 10.14232/actacyb.288351
Dániel Pásztor, P. Ekler, J. Levendovszky
{"title":"Energy-Efficient Routing in Wireless Sensor Networks","authors":"Dániel Pásztor, P. Ekler, J. Levendovszky","doi":"10.14232/actacyb.288351","DOIUrl":"https://doi.org/10.14232/actacyb.288351","url":null,"abstract":"Efficient data collection is the core concept of implementing Industry4.0 on IoT platforms. This requires energy aware communication protocols for Wireless Sensor Networks (WSNs) where different functions, like sensing and processing on the IoT nodes must be supported by local battery power. Thus, energy aware network protocols, such as routing, became one of fundamental challenges in IoT data collection schemes.In our research, we have developed novel routing algorithms which guarantee minimum energy consumption data transfer which is achieved subject to pre-defined reliability constraints. We assume that data is transmitted in the form of packets and the routing algorithm identifies the paths over which the packets can reach the Base Station (BS) with minimum transmission energy, while the probability of successful packet transmission still exceeds a pre-defined reliability parameter. In this way, the longevity and the information throughput of the network is maximized and the low energy transmissions will considerably extend the lifetime of the IoT nodes. In this paper we propose a solution that maximizes the lifetime of the nodes.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133340588","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Acta Cybern.Pub Date : 2021-12-07DOI: 10.14232/actacyb.289524
P. Hudoba, A. Kovács
{"title":"Toolset for Supporting the Research of Lattice Based Number Expansions","authors":"P. Hudoba, A. Kovács","doi":"10.14232/actacyb.289524","DOIUrl":"https://doi.org/10.14232/actacyb.289524","url":null,"abstract":"The world of generalized number systems contains many challenging areas. Computer experiments often support the theoretical research. In this paper we introduce a toolset that helps to analyze some properties of lattice based number expansions. The toolset is able to (1) analyze the expansions, (2) decide the number system property, (3) classify and visualize the periodic points. The toolset is implemented in Python, published alongside with a database that stores plenty of special expansions, and is able to store the custom properties like signature, operator eigenvalues, etc. Researchers can connect to the server and request/upload data, or perform experiments on them. We present an introductory usage of the toolset and detail some results that has been observed by the toolset. The toolset can be downloaded from http://numsys.info domain.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"600 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133322151","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Acta Cybern.Pub Date : 2021-08-04DOI: 10.14232/actacyb.290352
Zoltán Richárd Jánki, Vilmos Bilicki
{"title":"Taxonomy for Trade-off Problem in Distributed Telemedicine Systems","authors":"Zoltán Richárd Jánki, Vilmos Bilicki","doi":"10.14232/actacyb.290352","DOIUrl":"https://doi.org/10.14232/actacyb.290352","url":null,"abstract":"Increasing amount of data and demands for features are challenging for Web systems. By serving these requirements, distributed systems gather ground, however they bring problems along. These issues are already present in telemedicine. Since telemedicine is a wide discipline, various phenomena have different effects on data. Availability and consistency have both important roles in telemedicine, but as CAP and PACELC theorems addressed trade-off problem, no one can guarantee both capabilities simultaneously. Our research aims to get a nearer view of the problem considering real world telemedicine use-cases and offer an easily tunable system with a taxonomy that gives a helping hand at designing telemedicine systems. Model checking verifies and data quality measurement proves the correctness of our model. In the course of measurements, we revealed an interesting occurence and consequence that is called hypothetical-zero-latency.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121949064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Acta Cybern.Pub Date : 2021-08-04DOI: 10.14232/actacyb.289938
M. Kamel, P. Ligeti, C. Reich
{"title":"Lamred: Location-Aware and Privacy Preserving Multi-Layer Resource Discovery for IoT","authors":"M. Kamel, P. Ligeti, C. Reich","doi":"10.14232/actacyb.289938","DOIUrl":"https://doi.org/10.14232/actacyb.289938","url":null,"abstract":"The resources in the Internet of Things (IoT) network are distributed among different parts of the network. Considering huge number of IoT resources, the task of discovering them is challenging. While registering them in a centralized server such as a cloud data center is one possible solution, but due to billions of IoT resources and their limited computation power, the centralized approach leads to some efficiency and security issues. In this paper we proposed a location aware and decentralized multi layer model of resource discovery (LaMRD) in IoT. It allows a resource to be registered publicly or privately, and to be discovered in a decentralized scheme in the IoT network. LaMRD is based on structured peer-to-peer (p2p) scheme and follows the general system trend of fog computing. Our proposed model utilizes Distributed Hash Table (DHT) technology to create a p2p scheme of communication among fog nodes. The resources are registered in LaMRD based on their locations which results in a low added overhead in the registration and discovery processes. LaMRD generates a single overlay and it can be generated without specific organizing entity or location based devices. LaMRD guarantees some important security properties and it showed a lower latency comparing to the cloud based and decentralized resource discovery. ","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124866939","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Acta Cybern.Pub Date : 2021-08-04DOI: 10.14232/actacyb.290007
Csaba Bálint, Mátyás Kiglics
{"title":"A Geometric Method for Accelerated Sphere Tracing of Implicit Surfaces","authors":"Csaba Bálint, Mátyás Kiglics","doi":"10.14232/actacyb.290007","DOIUrl":"https://doi.org/10.14232/actacyb.290007","url":null,"abstract":"Sphere tracing is a common raytracing technique used for rendering implicit surfaces defined by a signed distance function (SDF). However, these distance functions are often expensive to compute, prohibiting several real-time applications despite recent efforts to accelerate it. This paper presents a method to precompute a slightly augmented distance field that hugely accelerates rendering. This novel method called quadric tracing supports two configurations: (i) accelerating raytracing without losing precision, so the original SDF is still needed; (ii) entirely replacing the SDF and tracing an interpolated surface. Quadric tracing can offer 20% to 100% speedup in rendering static scenes and thereby amortizing the slowdown caused by the complexity of the geometry.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"284 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122964405","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Acta Cybern.Pub Date : 2021-08-04DOI: 10.14232/actacyb.290145
Gábor Valasek, Csaba Bálint, András Leitereg
{"title":"Footvector Representation of Curves and Surfaces","authors":"Gábor Valasek, Csaba Bálint, András Leitereg","doi":"10.14232/actacyb.290145","DOIUrl":"https://doi.org/10.14232/actacyb.290145","url":null,"abstract":"This paper proposes a foot mapping-based representation of curves and surfaces which is a geometric generalization of signed distance functions. We present a first-order characterization of the footvector mapping in terms of the differential geometric invariants of the represented shape and quantify the dependence of the spatial partial derivatives of the footvector mapping with respect to the principal curvatures at the footpoint. The practical applicability of foot mapping representations is highlighted by several fast iterative methods to compute the exact footvector mapping of the offset surface of CSG trees. The set operations for footpoint mappings are higher-order functions that map a tuple of functions to a single function, which poses a challenge for GPU implementations. We propose a code generation framework to overcome this that transforms CSG trees to the GLSL shader code.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128485086","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Acta Cybern.Pub Date : 2021-08-04DOI: 10.14232/actacyb.289662
István Fábián, G. Gulyás
{"title":"A Comparative Study on the Privacy Risks of Face Recognition Libraries","authors":"István Fábián, G. Gulyás","doi":"10.14232/actacyb.289662","DOIUrl":"https://doi.org/10.14232/actacyb.289662","url":null,"abstract":"The rapid development of machine learning and the decreasing costs of computational resources has led to a widespread usage of face recognition. While this technology offers numerous benefits, it also poses new risks. We consider risks related to the processing of face embeddings, which are floating point vectors representing the human face in an identifying way. Previously, we showed that even simple machine learning models are capable of inferring demographic attributes from embeddings, leading to the possibility of re-identification attacks. This paper examines three popular Python libraries for face recognition, comparing their face detection performance and inspecting how much risk each library's embeddings pose regarding the aforementioned data leakage. Our experiments were conducted on a balanced face image dataset of different sexes and races, allowing us to discover biases in our results.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132770492","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Acta Cybern.Pub Date : 2021-08-04DOI: 10.14232/actacyb.289248
Róbert Bán, Gábor Valasek
{"title":"Geometric Distance Fields of Plane Curves","authors":"Róbert Bán, Gábor Valasek","doi":"10.14232/actacyb.289248","DOIUrl":"https://doi.org/10.14232/actacyb.289248","url":null,"abstract":"This paper introduces a geometric generalization of signed distance fields for plane curves. We propose to store simplified geometric proxies to the curve at every sample. These proxies are constructed based on the differential geometric quantities of the represented curve and are used for queries such as closest point and distance calculations. We investigate the theoretical approximation order of these constructs and provide empirical comparisons between geometric and algebraic distance fields of higher order. We apply our results to font representation and rendering.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129479338","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
