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

Taekyong Lee

dblp:39/3603 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
1since 2021 · last 2021
—ORCID · none

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

Databases, data management, data science and information retrieval · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 since 2021Graphics, 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.

Databases, data mining, and information retrieval
1 paper
Data models and query languages · 50% Query processing and optimization · 50%
Computer graphics and multimedia
1 paper
Multimedia systems and quality of experience · 100%

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

TopicWeightPapersLastEvidence papers
Data models and query languages
graph query language
0.011999
Querying Multimedia Presentations Based on Content · IEEE Trans. Knowl. Data Eng. 1999
Multimedia systems and quality of experience
multimedia presentation
0.011999
Querying Multimedia Presentations Based on Content · IEEE Trans. Knowl. Data Eng. 1999

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

temporal operators · 0.0path formulas · 0.0graph calculus · 0.0
YearPublicationVenuePosition
2021 Deep-learning-based recognition of symbols and texts at an industrially applicable level from images of high-density piping and instrumentation diagrams
Hyungki Kim, Wonyong Lee, Mijoo Kim, Yoochan Moon, Taekyong Lee, Mincheol Cho, Duhwan Mun
Expert Syst. Appl.5
2000 Query Processing Techniques for Multimedia Presentations
Taekyong Lee, Nevzat Hurkan Balkir, Abdullah Al-Hamdani, Gultekin Özsoyoglu, Z. Meral Özsoyoglu
Multim. Tools Appl.1
1999 Querying Multimedia Presentations Based on Content
abstract
Considers the problem of querying multimedia presentations based on content information. Multimedia presentations are modeled as presentation graphs, which are directed acyclic graphs that visually specify the presentations. We present a graph data model for the specification of multimedia presentations and discuss query languages as effective tools to query and manipulate multimedia presentation graphs with respect to content information. To query the information flow throughout a multimedia presentation, as well as in each individual multimedia stream, we use revised versions of temporal operators Next, Connected and Until, together with path formulas. These constructs allow us to specify and query paths along a presentation graph. We present an icon-based graphical query language, GVISUAL, that provides iconic representations for these constructs and a user-friendly graphical interface for query specification. We also present an OQL-like language, GOQL (Graph OQL), with similar constructs, that allows textual and more traditional specifications of graph queries. Finally, we introduce GCalculus (Graph Calculus), a calculus-based language that establishes the formal grounds for the use of temporal operators in path formulas and for querying presentation graphs with respect to content information. We also discuss GCalculus/S (GCalculus with Sets) which avoids highly complex query expressions by eliminating the universal path quantifier, the negation operator and the universal quantifier. GCalculus/S represents the formal basis for GVISUAL, i.e. GVISUAL uses the constructs of GCalculus/S directly.
Taekyong Lee, Tolga Bozkaya, Nevzat Hurkan Balkir, Z. Meral Özsoyoglu, Gultekin Özsoyoglu
IEEE Trans. Knowl. Data Eng.1
1996 A Scientific Multimedia Database System for Polymer Science Experiments
abstract
This paper describes SciMMDB, a scientific multimedia database system designed for polymer science experiment data applications. SciMMDB maintains multimedia data types of video, test and picture (as well as other standard data types), and allows users to: form multimedia presentation streams about experiments; define a presentation which organizes a number of presentation streams for playout purposes; and control the playout of a presentation. To form video, text or picture streams, a presentation stream construction language is described. Queries in this language express spatial and temporal relationships involving content objects and efficient evaluation of such queries are facilitated by indexing structures. SciMMDB uses IB+trees for queries involving temporal intervals. In SciMMDB, presentation streams are formed into a presentation using the notion of presentation graphs. During the playout of a presentation, each presentation stream in the presentation is played out by a separate transaction, called an output agent. Such transactions communicate and synchronize with each other using the cooperative transaction model.
Taekyong Lee, Tolga Bozkaya, Huang-Cheng Kuo, Gultekin Özsoyoglu, Z. Meral Özsoyoglu
SSDBM1