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

Lican Dai

dblp:119/0252 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
1since 2021 · last 2026
0000-0003-1292-6815ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 4 · 3 first-author · 1 since 2021

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
Image and video coding · 50% Multimedia systems and quality of experience · 50%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Image and video coding
image compression
0.112012
IMShare: instantly sharing your mobile landmark images by search-based reconstruction · ACM Multimedia 2012
Information retrieval
image retrieval
0.012012
IMShare: instantly sharing your mobile landmark images by search-based reconstruction · ACM Multimedia 2012
Information retrieval › image retrieval › instance retrieval
partial-duplicate image search
0.012012
IMShare: instantly sharing your mobile landmark images by search-based reconstruction · ACM Multimedia 2012
Information retrieval
retrieval models
0.012012
IMShare: instantly sharing your mobile landmark images by search-based reconstruction · ACM Multimedia 2012

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

parallel computing · 0.3image stitching · 0.3SIFT descriptors · 0.1SIFT descriptor · 0.1
YearPublicationVenuePosition
2026 Knowledge select relational graph attention networks for multimodal fake news detection
Weiqing Chen, Shengze Wang 0006, Lican Dai
Multim. Tools Appl.6
2013 Large scale image retrieval with visual groups
abstract
Bag-of-visual words (BoW) representation has been widely used in the large scale image retrieval. Though efficient, it ignores the geometric correlation among visual words, whereas the geometric verification has demonstrated its effectiveness in image retrieval. In this paper, we propose a new representation - visual group, to improve the retrieval precision by grouping the geometrically related features based on the inclusion relationship between features at different scales. A visual group consists of a master feature and several member features covered by the master feature. The geometric constraint inside each group is introduced into visual group matching for efficient geometric verification. Experimental evaluation on the dataset Oxford5K+Flickr1M shows that our visual group based image search approach outperforms BoW and the state-of-the-art visual phrase based schemes.
Lican Dai, Xiaoyan Sun 0001, Feng Wu 0001, Nenghai Yu
ICIP1
2012 Efficient Tag Mining via Mixture Modeling for Real-Time Search-Based Image Annotation
abstract
Although it has been extensively studied for many years, automatic image annotation is still a challenging problem. Recently, data-driven approaches have demonstrated their great success to image auto-annotation. Such approaches leverage abundant partially annotated web images to annotate an uncaptioned image. Specifically, they first retrieve a group of visually closely similar images given an uncaptioned image as a query, then figure out meaningful phrases from the surrounding texts of the image search results. Since the surrounding texts are generally noisy, how to effectively mine meaningful phrases is crucial for the success of such approaches. We propose a mixture modeling approach which assumes that a tag is generated from a convex combination of topics. Different from a typical topic modeling approach like LDA, topics in our approach are explicitly learnt from a definitive catalog of the Web, i.e. the Open Directory Project (ODP). Compared with previous works, it has two advantages: Firstly, it uses an open vocabulary rather than a limited one defined by a training set. Secondly, it is efficient for real-time annotation. Experimental results conducted on two billion web images show the efficiency and effectiveness of the proposed approach.
Lican Dai, Xin-Jing Wang, Lei Zhang 0001, Nenghai Yu
ICME1
2012 IMShare: instantly sharing your mobile landmark images by search-based reconstruction
abstract
Instantly sharing captured landmark images is becoming fashionable, much like when you write a blog or chat with friends by mobile phone. However, real-time transmission of high-resolution images poses a significant challenge to contemporary mobile networks. Either long delays in transmission or largely reduced image resolution can lead to bad user experience. In this paper, we propose a novel mobile-cloud scheme IMShare to enable instant sharing of high-resolution images. On the mobile side, high-resolution images are described by their thumbnails and SIFT (Scale-Invariant Feature Transform) descriptors. After compression, data sent by mobile phones can be reduced to an average of 2.6 kilobytes (KB) per mega pixel. On the cloud side, high-resolution images are reproduced from a large-scale image database by retrieving partial duplicate images by SIFT descriptors and stitching corresponding image patches together under the guidance of the thumbnails. IMShare is the first scheme to demonstrate that not only visually pleasant images can be reconstructed using this mobile-cloud method but also the reconstruction can be done in seconds using parallel computing. Our user study of a half million images in a database shows that the proposed IMShare significantly outperforms the current method on subjective quality.
Lican Dai, Huanjing Yue, Xiaoyan Sun 0001, Feng Wu 0001
ACM Multimedia1