Luca Anselma

Prof. Luca Anselma

Dipartimento di Informatica, Università degli Studi di Torino
orcid

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 2006 in Artificial Intelligence in Medicine
Verified
Journal Article
Closed access
LALuca Anselma
Luca Anselma
PTPaolo Terenziani
Paolo Terenziani
SMStefania Montani
Stefania Montani
ABAlessio Bottrighi
Alessio Bottrighi

1 February 2017 in Artificial Intelligence in Medicine
Verified
Journal Article
Closed access
LALuca Anselma
Luca Anselma
LPLuca Piovesan
Luca Piovesan
PTPaolo Terenziani
Paolo Terenziani

12 October 2012 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
LALuca Anselma
Luca Anselma
PTPaolo Terenziani
Paolo Terenziani
RSRichard T. Snodgrass
Richard T. Snodgrass
Valid-time indeterminacy is "don't know when" indeterminacy, coping with cases in which one does not exactly know when a fact holds in the modeled reality. In this paper, we first propose a reference representation (data model and algebra) in which all possible temporal scenarios induced by valid-time indeterminacy can be extensionally modeled. We then specify a family of 16 more compact representational data models. We demonstrate their correctness with respect to the reference representation and analyze several properties, including their data expressiveness. Then, we compare these compact models along several relevant dimensions. Finally, we also extend the reference representation and a representative of compact representations to cope with probabilities.

1 April 2017 in Journal of Biomedical Informatics
Verified
Journal Article
Closed access
LALuca Anselma
Luca Anselma
Alessandro MazzeiAlessandro Mazzei
Alessandro Mazzei
FMFranco De Michieli
Franco De Michieli

18 April 2023 in Electronics
Verified
Journal Article
Open access
PDF file
Muhammad Saad AminMuhammad Saad Amin
Muhammad Saad Amin
Syed Tahir Hussain RizviSyed Tahir Hussain Rizvi
Syed Tahir Hussain Rizvi
Alessandro MazzeiAlessandro Mazzei
Alessandro Mazzei
LALuca Anselma
Luca Anselma
Sign language recognition is one of the most challenging tasks of today’s era. Most of the researchers working in this domain have focused on different types of implementations for sign recognition. These implementations require the development of smart prototypes for capturing and classifying sign gestures. Keeping in mind the aspects of prototype design, sensor-based, vision-based, and hybrid approach-based prototypes have been designed. The authors in this paper have designed sensor-based assistive gloves to capture signs for the alphabet and digits. These signs are a small but important fraction of the ASL dictionary since they play an essential role in fingerspelling, which is a universal signed linguistic strategy for expressing personal names, technical terms, gaps in the lexicon, and emphasis. A scaled conjugate gradient-based back propagation algorithm is used to train a fully-connected neural network on a self-collected dataset of isolated static postures of digits, alphabetic, and alphanumeric characters. The authors also analyzed the impact of activation functions on the performance of neural networks. Successful implementation of the recognition network produced promising results for this small dataset of static gestures of digits, alphabetic, and alphanumeric characters.

29 July 2011 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
LALuca Anselma
Luca Anselma
ABAlessio Bottrighi
Alessio Bottrighi
SMStefania Montani
Stefania Montani
PTPaolo Terenziani
Paolo Terenziani
The cooperative construction of data/knowledge bases has recently had a significant impulse (see, e.g., Wikipedia [1]). In cases in which data/knowledge quality and reliability are crucial, proposals of update/insertion/deletion need to be evaluated by experts. To the best of our knowledge, no theoretical framework has been devised to model the semantics of update proposal/ evaluation in the relational context. Since time is an intrinsic part of most domains (as well as of the proposal/evaluation process itself), semantic approaches to temporal relational databases (specifically, Bitemporal Conceptual Data Model (henceforth, BCDM) [2]) are the starting point of our approach. In this paper, we propose BCDMPV, a semantic temporal relational model that extends BCDM to deal with multiple update/insertion/deletion proposals and with acceptances/rejections of proposals themselves. We propose a theoretical framework, defining the new data structures, manipulation operations and temporal relational algebra and proving some basic properties, namely that BCDMPV is a consistent extension of BCDM and that it is reducible to BCDM. These properties ensure consistency with most relational temporal database frameworks, facilitating implementations.