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
Demo Data from SIGIR 2026 / reviewers in the wild / expert

Nikos Nikopoulos

dblp:71/5521 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2000
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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.

Computer graphics and multimedia
1 paper
Image and video processing · 50% Geometric modeling and processing · 50%

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

TopicWeightPapersLastEvidence papers
Image and video processing
mathematical morphology		 0.012000
A fast implementation of 3-D binary morphological transformations · IEEE Trans. Image Process. 2000
Geometric modeling and processing › computational geometry
minkowski sum		 0.012000
A fast implementation of 3-D binary morphological transformations · IEEE Trans. Image Process. 2000

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

structuring elements · 0.0
YearPublicationVenuePosition
2000 A fast implementation of 3-D binary morphological transformations
abstract
This paper proposes a fast algorithm for implementing the basic operation of Minkowski addition for the special case of binary three-dimensional (3-D) images, using 3-D structuring elements of arbitrary size and shape. The application of the proposed algorithm for all the other morphological transformations is straightforward, as they can all be expressed in terms of Minkowski addition. The efficiency of the algorithm is analyzed and some experimental results of its application are presented. As shown, the efficiency of the algorithm increases with the size of the structuring element.
Nikos Nikopoulos, Ioannis Pitas
 IEEE Trans. Image Process.1