Skip to main content

Research Repository

Advanced Search

Outputs (2851)

Geometric Features Enhanced Human-Object Interaction Detection (2024)
Journal Article
Zhu, M., Ho, E. S. L., Chen, S., Yang, L., & Shum, H. P. H. (2024). Geometric Features Enhanced Human-Object Interaction Detection. IEEE Transactions on Instrumentation and Measurement, 73, Article 5026014. https://doi.org/10.1109/TIM.2024.3427800

Cameras are essential vision instruments to capture images for pattern detection and measurement. Human–object interaction (HOI) detection is one of the most popular pattern detection approaches for captured human-centric visual scenes. Recently, Tra... Read More about Geometric Features Enhanced Human-Object Interaction Detection.

SID-NERF: Few-Shot Nerf Based on Scene Information Distribution (2024)
Presentation / Conference Contribution
Li, Y., Wan, F., & Long, Y. (2024, July). SID-NERF: Few-Shot Nerf Based on Scene Information Distribution. Presented at 2024 IEEE International Conference on Multimedia and Expo (ICME), Niagara Falls, ON, Canada

The novel view synthesis from a limited set of images is a significant research focus. Traditional NeRF methods, relying mainly on color supervision, struggle with accurate scene geometry reconstruction when faced with sparse input images, leading to... Read More about SID-NERF: Few-Shot Nerf Based on Scene Information Distribution.

The complexity of computing optimum labelings for temporal connectivity (2024)
Journal Article
Klobas, N., Mertzios, G., Molter, H., & Spirakis, P. (2024). The complexity of computing optimum labelings for temporal connectivity. Journal of Computer and System Sciences, 146, Article 103564. https://doi.org/10.1016/j.jcss.2024.103564

A graph is temporally connected if a strict temporal path exists from every vertex u to every other vertex v. This paper studies temporal design problems for undirected temporally connected graphs. Given a connected undirected graph G, the goal is to... Read More about The complexity of computing optimum labelings for temporal connectivity.

Simplifying Multimedia Programming for Novice Programmers: MediaLib and Its Learning Materials (2024)
Presentation / Conference Contribution
Wynn, A., Wang, J., & Valente, A. (2024, July). Simplifying Multimedia Programming for Novice Programmers: MediaLib and Its Learning Materials. Presented at ITiCSE 2024: Innovation and Technology in Computer Science Education, Milan, Italy

Beginner programmers can develop an intuitive understanding of programming by leveraging the motivating field of multimedia to visually inspect outputs and experiment with different ways to solve problems. This paper presents MediaLib, a Python libra... Read More about Simplifying Multimedia Programming for Novice Programmers: MediaLib and Its Learning Materials.

Designing a Pedagogical Framework for Developing Abstraction Skills (2024)
Presentation / Conference Contribution
Begum, M., Crossley, J., Strömbäck, F., Akrida, E., Alpizar-Chacon, I., Evans, A., Gross, J. B., Haglund, P., Lonati, V., Satyavolu, C., & Thorgeirsson, S. (2024, July). Designing a Pedagogical Framework for Developing Abstraction Skills. Presented at ITiCSE 2024: Innovation and Technology in Computer Science Education, Milan Italy

Parallel Derandomization for Coloring (2024)
Presentation / Conference Contribution
Coy, S., Czumaj, A., Davies-Peck, P., & Mishra, G. (2024, May). Parallel Derandomization for Coloring. Presented at 38th IEEE International Parallel & Distributed Processing Symposium (IPDPS 2024), San Francisco

Graph coloring problems are among the most fundamental problems in parallel and distributed computing, and have been studied extensively in both settings. In this context, designing efficient deterministic algorithms for these problems has been found... Read More about Parallel Derandomization for Coloring.

1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise (2024)
Presentation / Conference Contribution
Ciardo, L., Kozik, M., Krokhin, A., Nakajima, T.-V., & Živný, S. (2024, July). 1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise. Presented at LICS '24: 39th Annual ACM/IEEE Symposium on Logic in Computer Science, Tallinn Estonia

The 1-in-3 and Not-All-Eqal satisfiability problems for Boolean CNF formulas are two well-known NP-hard problems. In contrast, the promise 1-in-3 vs. Not-All-Eqal problem can be solved in polynomial time. In the present work, we investigate this cons... Read More about 1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise.

Uncovering hidden and complex relations of pandemic dynamics using an AI driven system (2024)
Journal Article
Demirbaga, U., Kaur, N., & Aujla, G. S. (2024). Uncovering hidden and complex relations of pandemic dynamics using an AI driven system. Scientific Reports, 14(1), Article 15433. https://doi.org/10.1038/s41598-024-65845-0

The COVID-19 pandemic continues to challenge healthcare systems globally, necessitating advanced tools for clinical decision support. Amidst the complexity of COVID-19 symptomatology and disease severity prediction, there is a critical need for robus... Read More about Uncovering hidden and complex relations of pandemic dynamics using an AI driven system.

Reducing University Students’ Exam Anxiety via Mindfulness-Based Cognitive Therapy in VR with Real-Time EEG Neurofeedback (2024)
Presentation / Conference Contribution
Pan, Z., Cristea, A. I., & Li, F. W. B. (2024, July). Reducing University Students’ Exam Anxiety via Mindfulness-Based Cognitive Therapy in VR with Real-Time EEG Neurofeedback. Presented at AIED 2024: Artificial Intelligence in Education, Recife, Brazil

This research aims to develop and evaluate a novel approach to reduce university students’ exam anxiety and teach them how to better manage it using a personalised, emotion-informed Mindfulness-Based Cognitive Therapy (MBCT) method, delivered within... Read More about Reducing University Students’ Exam Anxiety via Mindfulness-Based Cognitive Therapy in VR with Real-Time EEG Neurofeedback.