Cookies Policy
The website need some cookies and similar means to function. If you permit us, we will use those means to collect data on your visits for aggregated statistics to improve our service. Find out More
Accept Reject
  • Menu
Publications

Publications by LIAAD

2023

Automatic characterisation of Dansgaard-Oeschger events in palaeoclimate ice records

Authors
Barbosa, S; Silva, ME; Dias, N; Rousseau, D;

Publication

Abstract
Greenland ice core records display abrupt transitions, designated as Dansgaard-Oeschger (DO) events, characterised by episodes of rapid warming (typically decades) followed by a slower cooling. The identification of abrupt transitions is hindered by the typical low resolution and small size of paleoclimate records, and their significant temporal variability. Furthermore, the amplitude and duration of the DO events varies substantially along the last glacial period, which further hinders the objective identification of abrupt transitions from ice core records Automatic, purely data-driven methods, have the potential to foster the identification of abrupt transitions in palaeoclimate time series in an objective way, complementing the traditional identification of transitions by visual inspection of the time series.In this study we apply an algorithmic time series method, the Matrix Profile approach, to the analysis of the NGRIP Greenland ice core record, focusing on:- the ability of the method to retrieve in an automatic way abrupt transitions, by comparing the anomalies identified by the matrix profile method with the expert-based identification of DO events;- the characterisation of DO events, by classifying DO events in terms of shape and identifying events with similar warming/cooling temporal patternThe results for the NGRIP time series show that the matrix profile approach struggles to retrieve all the abrupt transitions that are identified by experts as DO events, the main limitation arising from the diversity in length of DO events and the method’s dependence on fixed-size sub-sequences within the time series. However, the matrix profile method is able to characterise the similarity of shape patterns between DO events in an objective and consistent way.

2023

Zero-shot Classification at Different Levels of Granularity

Authors
Molina, M;

Publication
2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)

Abstract

2023

Whispered speech segmentation based on Deep Learning

Authors
Nunes, Gonçalo Duarte;

Publication

Abstract

2023

COMPLEXITY SCALABLE LEARNING-BASED IMAGE DECODING

Authors
Munna, TA; Ascenso, A;

Publication
2023 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, ICIP

Abstract
Recently, learning-based image compression has attracted a lot of attention, leading to the development of a new JPEG AI standard based on neural networks. Typically, this type of coding solution has much lower encoding complexity compared to conventional coding standards such as HEVC and VVC (Intra mode) but has much higher decoding complexity. Therefore, to promote the wide adoption of learning-based image compression, especially to resource-constrained (such as mobile) devices, it is important to achieve lower decoding complexity even if at the cost of some coding efficiency. This paper proposes a complexity scalable decoder that can control the decoding complexity by proposing a novel procedure to learn the filters of the convolutional layers at the decoder by varying the number of channels at each layer, effectively having simple to more complex decoding networks. A regularization loss is employed with pruning after training to obtain a set of scalable layers, which may use more or fewer channels depending on the complexity budget. Experimental results show that complexity can be significantly reduced while still allowing a competitive rate-distortion performance.

2023

Evaluating Post-hoc Interpretability with Intrinsic Interpretability

Authors
Amorim, JP; Abreu, PH; Santos, JAM; Müller, H;

Publication
CoRR

Abstract

2023

Bone Metastases Detection in Patients with Breast Cancer: Does Bone Scintigraphy Add Information to PET/CT?

Authors
Santos, JC; Abreu, MH; Santos, MS; Duarte, H; Alpoim, T; Próspero, I; Sousa, S; Abreu, PH;

Publication
ONCOLOGIST

Abstract
This article compares the effectiveness of the PET/CT scan and bone scintigraphy for the detection of bone metastases in patients with breast cancer. Background Positron emission tomography/computed tomography (PET/CT) has become in recent years a tool for breast cancer (BC) staging. However, its accuracy to detect bone metastases is classically considered inferior to bone scintigraphy (BS). The purpose of this work is to compare the effectiveness of bone metastases detection between PET/CT and BS. Materials and Methods Prospective study of 410 female patients treated in a Comprehensive Cancer Center between 2014 and 2020 that performed PET/CT and BS for staging purposes. The image analysis was performed by 2 senior nuclear medicine physicians. The comparison was performed based on accuracy, sensitivity, and specificity on a patient and anatomical region level and was assessed using McNemar's Test. An average ROC was calculated for the anatomical region analysis. Results PET/CT presented higher values of accuracy and sensitivity (98.0% and 93.83%), surpassing BS (95.61% and 81.48%) in detecting bone disease. There was a significant difference in favor of PET/CT (sensitivity 93.83% vs. 81.48%), however, there is no significant difference in eliminating false positives (specificity 99.09% vs. 99.09%). PET/CT presented the highest accuracy and sensitivity values for most of the bone segments, only surpassed by BS for the cranium. There was a significant difference in favor of PET/CT in the upper limb, spine, thorax (sternum) and lower limb (pelvis and sacrum), and in favor of BS in the cranium. The ROC showed that PET/CT has a higher sensitivity and consistency across the bone segments. Conclusion With the correct imaging protocol, PET/CT does not require BS for patients with BC staging.

  • 98
  • 516