Eugen-Richard Ardelean

Mr. Eugen-Richard Ardelean

Department of Computer Science, Technical University of Cluj-Napoca, Cluj-Napoca, Cluj, Romania
orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
9 March 2023 in PLOS ONE
Verified
Journal Article
Open access
PDF file
Eugen-Richard ArdeleanEugen-Richard Ardelean
Eugen-Richard Ardelean
ACAndreea Coporîie
Andreea Coporîie
AIAna-Maria Ichim
Ana-Maria Ichim
MDMihaela Dînșoreanu
Mihaela Dînșoreanu
RMRaul Cristian Mureșan
Raul Cristian Mureșan
Spike sorting is the process of grouping spikes of distinct neurons into their respective clusters. Most frequently, this grouping is performed by relying on the similarity of features extracted from spike shapes. In spite of recent developments, current methods have yet to achieve satisfactory performance and many investigators favour sorting manually, even though it is an intensive undertaking that requires prolonged allotments of time. To automate the process, a diverse array of machine learning techniques has been applied. The performance of these techniques depends however critically on the feature extraction step. Here, we propose deep learning using autoencoders as a feature extraction method and evaluate extensively the performance of multiple designs. The models presented are evaluated on publicly available synthetic and real “in vivo” datasets, with various numbers of clusters. The proposed methods indicate a higher performance for the process of spike sorting when compared to other state-of-the-art techniques.

19 July 2025 in Diagnostics
Verified
Journal Article
Open access
PDF file
AAAdriana-Ioana Ardelean
Adriana-Ioana Ardelean
Eugen-Richard ArdeleanEugen-Richard Ardelean
Eugen-Richard Ardelean
AMAnca Marginean
Anca Marginean
Background: Optical Coherence Tomography has become a common imaging technique that enables a non-invasive and detailed visualization of the retina and allows for the identification of various diseases. Through the advancement of technology, the volume and complexity of OCT data have rendered manual analysis infeasible, creating the need for automated means of detection. Methods: This study investigates the ability of state-of-the-art object detection models, including the latest YOLO versions (from v8 to v12), YOLO-World, YOLOE, and RT-DETR, to accurately detect pathological biomarkers in two retinal OCT datasets. The AROI dataset focuses on fluid detection in Age-related Macular Degeneration, while the OCT5k dataset contains a wide range of retinal pathologies. Results: The experiments performed show that YOLOv12 offers the best balance between detection accuracy and computational efficiency, while YOLOE manages to consistently outperform all other models across both datasets and most classes, particularly in detecting pathologies that cover a smaller area. Conclusions: This work provides a comprehensive benchmark of the capabilities of state-of-the-art object detection for medical applications, specifically for identifying retinal pathologies from OCT scans, offering insights and a starting point for the development of future automated solutions for analysis in a clinical setting.

16 May 2025 in Informatics
Verified
Journal Article
Open access
PDF file
DHDenisa Maria Herlea
Denisa Maria Herlea
BIBogdan Iancu
Bogdan Iancu
Eugen-Richard ArdeleanEugen-Richard Ardelean
Eugen-Richard Ardelean
This study investigates the ability of well-known deep learning models, such as ResNet and EfficientNet, to perform audio-based infant cry detection. By comparing the performance of different machine learning algorithms, this study seeks to determine the most effective approach for the detection of infant crying, enhancing the functionality of baby monitoring systems and contributing to a more advanced understanding of audio-based deep learning applications. Understanding and accurately detecting a baby’s cries is crucial for ensuring their safety and well-being, a concern shared by new and expecting parents worldwide. Despite advancements in child health, as noted by UNICEF’s 2022 report of the lowest ever recorded child mortality rate, there is still room for technological improvement. This paper presents a comprehensive evaluation of deep learning models for infant cry detection, analyzing the performance of various architectures on spectrogram and MFCC feature representations. A key focus is the comparison between pretrained and non-pretrained models, assessing their ability to generalize across diverse audio environments. Through extensive experimentation, ResNet50 and DenseNet trained on spectrograms emerged as the most effective architectures, significantly outperforming other models in classification accuracy. Additionally, the study investigates the impact of feature extraction techniques, dataset augmentation, and model fine-tuning, providing deeper insights into the role of representation learning in audio classification. The findings contribute to the growing field of audio-based deep learning applications, offering a detailed comparative study of model architectures, feature representations, and training strategies for infant cry detection.

1 November 2024 in Knowledge and Information Systems
Verified
Journal Article
Open access
PDF file
Eugen-Richard ArdeleanEugen-Richard Ardelean
Eugen-Richard Ardelean
RPRaluca Laura Portase
Raluca Laura Portase
RPRodica Potolea
Rodica Potolea
MDMihaela Dinsoreanu
Mihaela Dinsoreanu
Clustering algorithms are essential in data analysis, but evaluating their performance is challenging when the true labels are not available, especially for non-convex clusters. Traditional performance evaluation metrics struggle to identify clustering quality, often assigning higher scores for linearly separated clusters than the true clusters. We propose an original approach to distance computation that accounts for the data structure, thus improving the clustering quality evaluation for non-convex clusters without affecting other shapes of clusters. We also showcase the applicability of this method through a modified version of K-Means using the proposed method that is capable of correctly separating non-convex clusters. The validation included the analysis of performance and time complexity of 3 traditional clustering quality evaluation metrics and the K-Means clustering algorithm against their augmented versions with the proposed approach. This analysis conducted on 7 benchmark synthetic datasets and 6 real datasets with various numbers of examples and features of diverse characteristics and joint complexities: simple convex clusters, overlapped and imbalanced clusters, and non-convex clusters. Through these analyses, we show the ineffectiveness of traditional methods and that the proposed approach overcomes the weaknesses of traditional methods.

7 December 2023 in Frontiers in Human Neuroscience
Verified
Journal Article
Open access
Eugen-Richard ArdeleanEugen-Richard Ardelean
Eugen-Richard Ardelean
HBHarald Bârzan
Harald Bârzan
AIAna-Maria Ichim
Ana-Maria Ichim
RMRaul Cristian Muresan
Raul Cristian Muresan
VMVasile Vlad Moca
Vasile Vlad Moca
Brain oscillations most often occur in bursts, called oscillation packets, which span a finite extent in time and frequency. Recent studies have shown that these packets portray a much more dynamic picture of synchronization and transient communication between sites than previously thought. To understand their nature and statistical properties, techniques are needed to objectively detect oscillation packets and to quantify their temporal and frequency extent, as well as their magnitude. There are various methods to detect bursts of oscillations. The simplest ones divide the signal into band limited sub-components, quantifying the strength of the resulting components. These methods cannot by themselves cope with broadband transients that look like genuine oscillations when restricted to a narrow band. The most successful detection methods rely on time-frequency representations, which can readily show broadband transients and harmonics. However, the performance of such methods is conditioned by the ability of the representation to localize packets simultaneously in time and frequency, and by the capabilities of packet detection techniques, whose current state of the art is limited to extraction of bounding boxes. Here, we focus on the second problem, introducing two detection methods that use concepts derived from clustering and topographic prominence. These methods are able to delineate the packets’ precise contour in the time-frequency plane. We validate the new approaches using both synthetic and real data recorded in humans and animals and rely on a super-resolution time-frequency representation, namely the superlets, as input to the detection algorithms. In addition, we define robust tests for benchmarking and compare the new methods to previous techniques. Results indicate that the two methods we introduce shine in low signal-to-noise ratio conditions, where they only miss a fraction of packets undetected by previous methods. Finally, algorithms that delineate precisely the border of spectral features and their subcomponents offer far more valuable information than simple rectangular bounding boxes (time and frequency span) and can provide a solid foundation to investigate neural oscillations’ dynamics.

22 September 2022
Verified
Conference Paper
Closed access
DMDenisa Bianca Mureșan
Denisa Bianca Mureșan
RCRaluca-Dana Ciure
Raluca-Dana Ciure
Eugen-Richard ArdeleanEugen-Richard Ardelean
Eugen-Richard Ardelean
VMVasile Vlad Moca
Vasile Vlad Moca
RMRaul Cristian Mureșan
Raul Cristian Mureșan
MDMihaela Dînș
Mihaela Dînș
Because of the intricacy of neural data, spike sorting is a challenging problem in neuroscience. Overlapping clusters are one of the hardest issues to solve, along with the similarity of spike shapes, excessive noise, and unbalanced clusters. Here, we focus on analyzing the efficacy and integrating the Superlets Transform as a feature extraction method. Our results indicate that Superlets achieve not only super-resolution in time and frequency, but also provide the conditions for smooth clustering performance. The Superlet Transform was analyzed in conjunction with Principal Component Analysis, Singular Value Decomposition, and Isomap Embedding as dimensionality reduction methods. The Superlet-extracted features were classified using Neural Networks in order to assess their relevance.