Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Konstantinos Raftopoulos

dblp:70/1738 · DBLP profile ↗
← Back
8ranked-venue papers
6as first author
1since 2021 · last 2025
0000-0002-9791-601XORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 5 first-author · 1 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
3D vision · 90% Information extraction and text analysis · 10%
Databases, data mining, and information retrieval
2 papers
Information retrieval · 94% Data mining · 6%
Computer graphics and multimedia
1 paper
Geometric modeling and processing · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

Topics — the 7 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
3d shape analysis
0.212014
Noising versus Smoothing for Vertex Identification in Unknown Shapes · CVPR 2014
Information retrieval
image retrieval
0.212013
Mining User Queries with Markov Chains: Application to Online Image Retrieval · IEEE Trans. Knowl. Data Eng. 2013
Information retrieval
retrieval models
0.212013
Mining User Queries with Markov Chains: Application to Online Image Retrieval · IEEE Trans. Knowl. Data Eng. 2013
Information retrieval › indexing
semantic indexing
0.212013
Mining User Queries with Markov Chains: Application to Online Image Retrieval · IEEE Trans. Knowl. Data Eng. 2013
Natural language and speech › Information extraction and text analysis
web information extraction
0.112005
STAVIES: A System for Information Extraction from Unknown Web Data Sources through Automatic Web Wrapper Generation Using Clustering Techniques · IEEE Trans. Knowl. Data Eng. 2005
Data mining
clustering
0.012005
STAVIES: A System for Information Extraction from Unknown Web Data Sources through Automatic Web Wrapper Generation Using Clustering Techniques · IEEE Trans. Knowl. Data Eng. 2005
Data mining › clustering
hierarchical clustering
0.012005
STAVIES: A System for Information Extraction from Unknown Web Data Sources through Automatic Web Wrapper Generation Using Clustering Techniques · IEEE Trans. Knowl. Data Eng. 2005

Methods — techniques the papers use, named apart from their topics

vertex localization · 0.7noise analysis · 0.7noising · 0.4distance function analysis · 0.4mean first cross passage time · 0.2markov chain · 0.2aggregate markov chain · 0.2statistical analysis · 0.1hierarchical clustering · 0.1
YearPublicationVenuePosition
2025 Context-Aware Adaptive Visualizations for Critical Decision Making
abstract
Effective decision-making often relies on timely insights from complex visual data. While Information Visualization (InfoVis) dashboards can support this process, they rarely adapt to users’ cognitive state, and less so in real time. We present SYMBIOTIK, an intelligent, context-aware adaptive visualization system that leverages neurophysiological signals to estimate mental workload (MWL) and dynamically adapt visual dashboards using reinforcement learning (RL). Through a user study with 120 participants and three visualization types, we demonstrate that our approach improves task performance and engagement. SYMBIOTIK offers a scalable, real-time adaptation architecture, and a validated methodology for neuroadaptive user interfaces.
Ángela López-Cardona, Mireia Masias Bruns, Nuwan T. Attygalle, Sebastian Idesis, Matteo Salvatori, Konstantinos Raftopoulos, Saravanakumar Duraisamy, Parvin Emami, Nacera Latreche, Alaa Eddine Anis Sahraoui, Michalis Vakalellis, Jean Vanderdonckt, Ioannis Arapakis, Luis A. Leiva
ECAI6
2018 On the Beneficial Effect of Noise in Vertex Localization
Konstantinos Raftopoulos, Stefanos D. Kollias, Dionyssios D. Sourlas, Marin Ferecatu
Int. J. Comput. Vis.1
2014 Noising versus Smoothing for Vertex Identification in Unknown Shapes
abstract
A method for identifying shape features of local nature on the shape's boundary, in a way that is facilitated by the presence of noise is presented. The boundary is seen as a real function. A study of a certain distance function reveals, almost counter-intuitively, that vertices can be defined and localized better in the presence of noise, thus the concept of noising, as opposed to smoothing, is conceived and presented. The method works on both smooth and noisy shapes, the presence of noise having an effect of improving on the results of the smoothed version. Experiments with noise and a comparison to state of the art validate the method.
Konstantinos Raftopoulos, Marin Ferecatu
CVPR1
2013 Mining User Queries with Markov Chains: Application to Online Image Retrieval
abstract
We propose a novel method for automatic annotation, indexing and annotation-based retrieval of images. The new method, that we call Markovian Semantic Indexing (MSI), is presented in the context of an online image retrieval system. Assuming such a system, the users' queries are used to construct an Aggregate Markov Chain (AMC) through which the relevance between the keywords seen by the system is defined. The users' queries are also used to automatically annotate the images. A stochastic distance between images, based on their annotation and the keyword relevance captured in the AMC, is then introduced. Geometric interpretations of the proposed distance are provided and its relation to a clustering in the keyword space is investigated. By means of a new measure of Markovian state similarity, the mean first cross passage time (CPT), optimality properties of the proposed distance are proved. Images are modeled as points in a vector space and their similarity is measured with MSI. The new method is shown to possess certain theoretical advantages and also to achieve better Precision versus Recall results when compared to Latent Semantic Indexing (LSI) and probabilistic Latent Semantic Indexing (pLSI) methods in Annotation-Based Image Retrieval (ABIR) tasks.
Konstantinos Raftopoulos, Klimis S. Ntalianis, Dionyssios D. Sourlas, Stefanos D. Kollias
IEEE Trans. Knowl. Data Eng.1
2011 Visual Pathways for Shape Abstraction
Konstantinos Raftopoulos, Stefanos D. Kollias
ICANN (1)1
2011 The Global-Local transformation for noise resistant shape representation
Konstantinos Raftopoulos, Stefanos D. Kollias
Comput. Vis. Image Underst.1
2006 Visual Pathways for Detection of Landmark Points
Konstantinos Raftopoulos, Klimis S. Ntalianis
ICANN (1)1
2005 STAVIES: A System for Information Extraction from Unknown Web Data Sources through Automatic Web Wrapper Generation Using Clustering Techniques
abstract
A fully automated wrapper for information extraction from Web pages is presented. The motivation behind such systems lies in the emerging need for going beyond the concept of "human browsing". The World Wide Web is today the main "all kind of information" repository and has been so far very successful in disseminating information to humans. By automating the process of information retrieval, further utilization by targeted applications is enabled. The key idea in our novel system is to exploit the format of the Web pages to discover the underlying structure in order to finally infer and extract pieces of information from the Web page. Our system first identifies the section of the Web page that contains the information to be extracted and then extracts it by using clustering techniques and other tools of statistical origin. STAVIES can operate without human intervention and does not require any training. The main innovation and contribution of the proposed system consists of introducing a signal-wise treatment of the tag structural hierarchy and using hierarchical clustering techniques to segment the Web pages. The importance of such a treatment is significant since it permits abstracting away from the raw tag-manipulating approach. Experimental results and comparisons with other state of the art systems are presented and discussed in the paper, indicating the high performance of the proposed algorithm.
Dimitrios Skoutas 0001, Konstantinos Raftopoulos, Theodora A. Varvarigou
IEEE Trans. Knowl. Data Eng.3