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

Chia-Han Lin

dblp:29/2556 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2010
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorSystems, architecture and hardware · 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.

Computer graphics and multimedia
1 paper
Multimedia analysis and retrieval · 100%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Multimedia analysis and retrieval › indexing
multimedia indexing
0.112006
Indexing and matching multiple-attribute strings for efficient multimedia query processing · IEEE Trans. Multim. 2006
Multimedia analysis and retrieval › multimedia database
multimedia query processing
0.112006
Indexing and matching multiple-attribute strings for efficient multimedia query processing · IEEE Trans. Multim. 2006
Information retrieval
retrieval models
0.012006
Indexing and matching multiple-attribute strings for efficient multimedia query processing · IEEE Trans. Multim. 2006

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

q-attribute string matching · 0.1indexing methodology · 0.1
YearPublicationVenuePosition
2010 A DSM-based fragmented data sharing framework for grids
Po-Cheng Chen, Jyh-Biau Chang, Ce-Kuen Shieh, Chia-Han Lin, Yi-Chang Zhuang
Future Gener. Comput. Syst.4
2006 Indexing and matching multiple-attribute strings for efficient multimedia query processing
abstract
Multimedia data can be represented as a multiple-attribute string of feature values corresponding to multiple features of the data. Therefore, the retrieval problem can be transformed into the q-attribute string matching problem if q features are considered in a query. A general solution is proposed in this paper. It includes an index structure and the matching methodologies, which can be applied on different values of q. The experiment results show the efficiency of the proposed approach.
Chia-Han Lin, Arbee L. P. Chen
IEEE Trans. Multim.1
2001 Processing concept queries with object motions in video databases
abstract
This paper proposes an indexing and query processing approach for content-based video retrieval The concept hierarchy is used to provide high-level concepts for users to specify queries. The index buckets and suffix trees are proposed to index the static attributes and motions of video objects A flexible query processing strategy is designed based on the index structure. Also, strategies for processing approximate queries and queries involving object motions are considered.
Chia-Han Lin, Arbee L. P. Chen
ICIP (2)1