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

Marios Mantzourogiannis

dblp:41/6480 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2003
—ORCID · none

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

Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1

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.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 80% Data models and query languages · 20%
Computer graphics and multimedia
1 paper
Multimedia analysis and retrieval · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Multimedia analysis and retrieval › image retrieval
content-based image retrieval
0.012003
Fast retrieval of similar configurations · IEEE Trans. Multim. 2003
Information retrieval › image retrieval
content-based image retrieval
0.011999
Content-Based Retrieval Using Heuristic Search · SIGIR 1999
Information retrieval
heuristic search
0.011999
Content-Based Retrieval Using Heuristic Search · SIGIR 1999
Information retrieval
multimedia analysis and retrieval
0.011999
Content-Based Retrieval Using Heuristic Search · SIGIR 1999
Information retrieval
similarity search
0.011999
Content-Based Retrieval Using Heuristic Search · SIGIR 1999
Data models and query languages
structured query
0.011999
Content-Based Retrieval Using Heuristic Search · SIGIR 1999
Algorithms and data structures › search algorithms
heuristic search
0.012003
Fast retrieval of similar configurations · IEEE Trans. Multim. 2003

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

simulated annealing · 0.1hill climbing · 0.1genetic algorithm · 0.1systematic search · 0.0heuristic search · 0.0allen's relations · 0.0
YearPublicationVenuePosition
2003 Fast retrieval of similar configurations
abstract
Configuration similarity is a special form of content-based image retrieval that considers relative object locations. It can be used as a standalone method, or to complement retrieval based on visual or semantic features. The corresponding queries ask for sets of objects that satisfy some spatio-temporal constraints, e.g., "find all triplets of objects (v/sub 1/, v/sub 2/, v/sub 3/), such that v/sub 1/ is northeast of v/sub 2/, which is inside v/sub 3/." Exhaustive processing (i.e., retrieval of the best solutions) of configuration similarity queries, in general, has exponential complexity and fast search for sub-optimal solutions is the only way to deal with the vast amounts of multimedia information in several real-time applications. In this paper we first discuss the utilization of nonsystematic search heuristics, based on genetic algorithms, simulated annealing and hill climbing approaches. An extensive experimentation with real and synthetic datasets reveals that hill climbing techniques are the best for the current problem; therefore, as a subsequent step we study the search space, and develop improved variations of hill climbing that take advantage of the special structure of the problem to enhance speed. The proposed heuristic methods significantly outperform systematic search when there is only limited time for query processing.
Dimitris Papadias, Marios Mantzourogiannis, Ishfaq Ahmad 0001
IEEE Trans. Multim.2
1999 Content-Based Retrieval Using Heuristic Search
abstract
The fast growth of multimedia information in image and video databases has triggered research on efficient retrieval methods.This paper deals with structural queries, a type of content-based retrieval where similarity is not defined on visual properties such as color and texture, but on object relations in space.We propose the application of heuristic algorithms which provide good, but not necessarily optimal, solutions in a pre-determined time period, and compare our approach with systematic search methods which are guaranteed to find optimal solutions but require exponential time in the worst case.The quality of the output is calculated using a relation framework which is an extension of Allen's relations.With this framework our methods can be applied in multiple resolutions and dimensions, thus covering a wide range of applications in spatial, multimedia and video systems.
Dimitris Papadias, Marios Mantzourogiannis, Panos Kalnis, Nikos Mamoulis, Ishfaq Ahmad 0001
SIGIR2