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

Tai-Hsu Lin

dblp:72/5660 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 4Artificial intelligence and machine learning · 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
2 papers
Multimedia analysis and retrieval · 80% Computational photography and imaging · 20%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Multimedia analysis and retrieval › visual search
mobile visual search
0.112012
Mobile product search with Bag of Hash Bits and boundary reranking · CVPR 2012
Multimedia analysis and retrieval › multimedia retrieval
reranking
0.112012
Mobile product search with Bag of Hash Bits and boundary reranking · CVPR 2012
Multimedia analysis and retrieval
visual search
0.112012
Mobile product search with Bag of Hash Bits and boundary reranking · CVPR 2012
Information retrieval › image retrieval
hashing-based image retrieval
0.112011
Mobile product search with bag of hash bits · ACM Multimedia 2011
Information retrieval › image retrieval
mobile visual search
0.112011
Mobile product search with bag of hash bits · ACM Multimedia 2011
Information retrieval
retrieval models
0.112011
Mobile product search with bag of hash bits · ACM Multimedia 2011
Computational photography and imaging › light field imaging
light field capture
0.112008
Programmable aperture photography: multiplexed light field acquisition · ACM Trans. Graph. 2008
Computational photography and imaging
depth estimation
0.012008
Programmable aperture photography: multiplexed light field acquisition · ACM Trans. Graph. 2008

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

bag of hash bits · 0.3multi-table indexing · 0.1hamming distance ranking · 0.1multi-hash table · 0.1hamming distance scoring · 0.1photometric distortion self-calibration · 0.1optimal multiplexing · 0.1
YearPublicationVenuePosition
2012 Mobile product search with Bag of Hash Bits and boundary reranking
abstract
Rapidly growing applications on smartphones have provided an excellent platform for mobile visual search. Most of previous visual search systems adopt the framework of ”Bag of Words”, in which words indicate quantized codes of visual features. In this work, we propose a novel visual search system based on ”Bag of Hash Bits” (BoHB), in which each local feature is encoded to a very small number of hash bits, instead of quantized to visual words, and the whole image is represented as bag of hash bits. The proposed BoHB method offers unique benefits in solving the challenges associated with mobile visual search, e.g., low transmission cost, cheap memory and computation on the mobile side, etc. Moreover, our BoHB method leverages the distinct properties of hashing bits such as multi-table indexing, multiple bucket probing, bit reuse, and hamming distance based ranking to achieve efficient search over gigantic visual databases. The proposed method significantly outperforms state-of-the-art mobile visual search methods like CHoG, and other (conventional desktop) visual search approaches like bag of words via vocabulary tree, or product quantization. The proposed BoHB approach is easy to implement on mobile devices, and general in the sense that it can be applied to different types of local features, hashing algorithms and image databases. We also incorporate a boundary feature in the reranking step to describe the object shapes, complementing the local features that are usually used to characterize the local details. The boundary feature can further filter out noisy results and improve the search performance, especially at the coarse category level. Extensive experiments over large-scale data sets up to 400k product images demonstrate the effectiveness of our approach.
Junfeng He, Jinyuan Feng, Xianglong Liu 0001, Tai-Hsu Lin, Hyunjin Chung, Shih-Fu Chang
CVPR5
2011 Mobile product search with bag of hash bits
abstract
The advent of smart phones has provided an excellent plat- form for mobile visual search. Most of previous mobile visual search systems adopt the framework of "bag of words",in which words indicate quantized codes of visual features. In this work, we propose a novel mobile visual search system based on "bag of hash bits". Using new ideas for hash bit selection, multi-hash table generation, and hamming-distance soft scoring, we overcome the problem of bit inefficiency affecting the traditional hashing approaches, and achieve promising accuracy outperforming state of the art. The framework is also general in that general feature type can be used for generating the hash bits. Demos and experiments over a large scale product image set demonstrate the effectiveness of our approach.
Junfeng He, Tai-Hsu Lin, Jinyuan Feng, Shih-Fu Chang
ACM Multimedia2
2009 Realism assessment of color compatibility using a single image
abstract
In this paper, we present a study of the realism of color image composites. Assessing the realism of image composites has emerged as a new field of image processing due to the advances in digital imaging and communications. However, when making image composites, users often suffer from color incompatibility between the inserted object and the background. We observe two properties that help make an image composite look realistic. The first property is related to the color similarity between different segments of the image, and the second one is related to the consistency of color deviation between the segments. These two properties only require information available from a single image. An algorithm based on these two properties is proposed for assessment of image realism. Effectiveness of the algorithm is demonstrated.
Bing-Yi Wong, Chia-Kai Liang, Tai-Hsu Lin, Homer H. Chen
ICIP3
2008 Programmable aperture photography: multiplexed light field acquisition
abstract
In this paper, we present a system including a novel component called programmable aperture and two associated post-processing algorithms for high-quality light field acquisition. The shape of the programmable aperture can be adjusted and used to capture light field at full sensor resolution through multiple exposures without any additional optics and without moving the camera. High acquisition efficiency is achieved by employing an optimal multiplexing scheme, and quality data is obtained by using the two post-processing algorithms designed for self calibration of photometric distortion and for multi-view depth estimation. View-dependent depth maps thus generated help boost the angular resolution of light field. Various post-exposure photographic effects are given to demonstrate the effectiveness of the system and the quality of the captured light field.
Chia-Kai Liang, Tai-Hsu Lin, Bing-Yi Wong, Homer H. Chen
ACM Trans. Graph.2