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

Yunli Long

dblp:75/11235 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2016
0009-0004-6095-5965ORCID · corroborated

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

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

Artificial intelligence
1 paper
Image recognition and object detection · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › Image recognition and object detection › texture classification
local binary pattern
0.212014
BRINT: Binary Rotation Invariant and Noise Tolerant Texture Classification · IEEE Trans. Image Process. 2014
Computer vision › Image recognition and object detection
texture classification
0.212014
BRINT: Binary Rotation Invariant and Noise Tolerant Texture Classification · IEEE Trans. Image Process. 2014

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

binary rotation invariant descriptor · 0.2
YearPublicationVenuePosition
2016 Parallel particle PHD filter implemented on multicore and cluster systems
Yunli Long, Yaoyuan Zeng
Signal Process.2
2014 BRINT: Binary Rotation Invariant and Noise Tolerant Texture Classification
abstract
In this paper, we propose a simple, efficient, yet robust multiresolution approach to texture classification-binary rotation invariant and noise tolerant (BRINT). The proposed approach is very fast to build, very compact while remaining robust to illumination variations, rotation changes, and noise. We develop a novel and simple strategy to compute a local binary descriptor based on the conventional local binary pattern (LBP) approach, preserving the advantageous characteristics of uniform LBP. Points are sampled in a circular neighborhood, but keeping the number of bins in a single-scale LBP histogram constant and small, such that arbitrarily large circular neighborhoods can be sampled and compactly encoded over a number of scales. There is no necessity to learn a texton dictionary, as in methods based on clustering, and no tuning of parameters is required to deal with different data sets. Extensive experimental results on representative texture databases show that the proposed BRINT not only demonstrates superior performance to a number of recent state-of-the-art LBP variants under normal conditions, but also performs significantly and consistently better in presence of noise due to its high distinctiveness and robustness. This noise robustness characteristic of the proposed BRINT is evaluated quantitatively with different artificially generated types and levels of noise (including Gaussian, salt and pepper, and speckle noise) in natural texture images.
Li Liu 0002, Yunli Long, Paul W. Fieguth, Songyang Lao, Guoying Zhao 0001
IEEE Trans. Image Process.2
2012 Extended local binary patterns for texture classification
Li Liu 0002, Lingjun Zhao, Yunli Long, Gangyao Kuang, Paul W. Fieguth
Image Vis. Comput.3