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

Ming-Hen Tsai

dblp:02/10069 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2012
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 first-authorGraphics, 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 · 100%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › image retrieval › semantic image retrieval
attribute-based image retrieval
0.112012
Weak attributes for large-scale image retrieval · CVPR 2012
Information retrieval
image retrieval
0.112012
Weak attributes for large-scale image retrieval · CVPR 2012
Information retrieval
retrieval models
0.112012
Weak attributes for large-scale image retrieval · CVPR 2012
Machine learning › Representation and self-supervised learning › representation learning › semantic representation learning
attribute representation
0.012012
Weak attributes for large-scale image retrieval · CVPR 2012

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

weak attributes · 0.3semi-supervised graphical model · 0.3
YearPublicationVenuePosition
2012 Weak attributes for large-scale image retrieval
abstract
Attribute-based query offers an intuitive way of image retrieval, in which users can describe the intended search targets with understandable attributes. In this paper, we develop a general and powerful framework to solve this problem by leveraging a large pool of weak attributes comprised of automatic classifier scores or other mid-level representations that can be easily acquired with little or no human labor. We extend the existing retrieval model of modeling dependency within query attributes to modeling dependency of query attributes on a large pool of weak attributes, which is more expressive and scalable. To efficiently learn such a large dependency model without overfitting, we further propose a semi-supervised graphical model to map each multiattribute query to a subset of weak attributes. Through extensive experiments over several attribute benchmarks, we demonstrate consistent and significant performance improvements over the state-of-the-art techniques. In addition, we compile the largest multi-attribute image retrieval dateset to date, including 126 fully labeled query attributes and 6,000 weak attributes of 0.26 million images.
Felix X. Yu, Rongrong Ji, Ming-Hen Tsai, Guangnan Ye, Shih-Fu Chang
CVPR3
2010 Active learning strategies using SVMs
abstract
In this paper, we decompose the problem of active learning into two parts, learning with few examples and learning by querying labels of samples. The first part is achieved mainly by SVM classifiers. We also consider variants based on transductive learning. In the second part, based on SVM decision values, we propose a framework to flexibly select points for query. Our experiments are conducted on the data sets of Causality Active Learning Challenge. With measurements of Area Under Curve (AUC) and Area under the Learning Curve (ALC), we find suitable methods for different data sets.
Ming-Hen Tsai, Chia-Hua Ho, Chih-Jen Lin
IJCNN1