Lukas Hedegaard

Lukas Hedegaard

Auto-generated profile, based on publicly available information

Lukas Hedegaard

Department of Electrical and Computer Engineering, Aarhus University, Aarhus, Denmark

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
14 March 2023 in Pattern Recognition
Verified
Journal Article
Open access
LHLukas Hedegaard
Lukas Hedegaard
NHNegar Heidari
Negar Heidari
AIAlexandros Iosifidis
Alexandros Iosifidis

14 October 2021 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
LHLukas Hedegaard
Lukas Hedegaard
OSOmar Ali Sheikh-Omar
Omar Ali Sheikh-Omar
AIAlexandros Iosifidis
Alexandros Iosifidis
Domain Adaptation is the process of alleviating distribution gaps between data from different domains. In this paper, we show that Domain Adaptation methods using pair-wise relationships between source and target domain data can be formulated as a Graph Embedding in which the domain labels are incorporated into the structure of the intrinsic and penalty graphs. Specifically, we analyse the loss functions of three existing state-of-the-art Supervised Domain Adaptation methods and demonstrate that they perform Graph Embedding. Moreover, we highlight some generalisation and reproducibility issues related to the experimental setup commonly used to demonstrate the few-shot learning capabilities of these methods. To assess and compare Supervised Domain Adaptation methods accurately, we propose a rectified evaluation protocol, and report updated benchmarks on the standard datasets Office31 (Amazon, DSLR, and Webcam), Digits (MNIST, USPS, SVHN, and MNIST-M) and VisDA (Synthetic, Real).

26 June 2024 in Pattern Recognition
Verified
Journal Article
Open access
LHLukas Hedegaard
Lukas Hedegaard
AAAman Alok
Aman Alok
JJJuby Jose
Juby Jose
AIAlexandros Iosifidis
Alexandros Iosifidis



25 December 2025 in Neural Networks
Verified
Journal Article
Open access
GPGinés Carreto Picón
Ginés Carreto Picón
IOIllia Oleksiienko
Illia Oleksiienko
LHLukas Hedegaard
Lukas Hedegaard
ABArian Bakhtiarnia
Arian Bakhtiarnia
AIAlexandros Iosifidis
Alexandros Iosifidis
Transformers are widely used for their ability to capture data relations in sequence processing, with great success for a wide range of static tasks. However, the computational and memory footprint of their main component, i.e., the Scaled Dot-product Attention, is commonly overlooked. This makes their adoption infeasible in applications involving stream data processing with constraints in response latency, computational and memory resources. Some works have proposed methods to lower the computational cost of Transformers by using low-rank approximations, sparsity in attention, and efficient formulations for Continual Inference. In this paper, we introduce a new formulation of the Scaled Dot-product Attention based on the Nyström approximation that is suitable for Continual Inference. In experiments on Online Audio Classification and Online Action Detection tasks, the proposed Continual Scaled Dot-product Attention can lower the number of operations by up to three orders of magnitude compared to the original Transformers while retaining the predictive performance of competing models.