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

Ruobing Wu

dblp:135/4952 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
2since 2021 · last 2026
—ORCID · conflict

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

Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-authorArtificial intelligence and machine learning · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 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.

Artificial intelligence
2 papers
Representation and self-supervised learning · 59% Image recognition and object detection · 41%
Computer graphics and multimedia
1 paper
Visual content generation and editing · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › visual representation › image representation › convolutional neural network features
deep convolutional features
0.212015
Harvesting Discriminative Meta Objects with Deep CNN Features for Scene Classification · ICCV 2015
Computer vision › Image recognition and object detection
scene recognition
0.212015
Harvesting Discriminative Meta Objects with Deep CNN Features for Scene Classification · ICCV 2015
Visual content generation and editing › texture synthesis
example-based texture synthesis
0.212014
Optimized Synthesis of Art Patterns and Layered Textures · IEEE Trans. Vis. Comput. Graph. 2014
Visual content generation and editing
texture synthesis
0.212014
Optimized Synthesis of Art Patterns and Layered Textures · IEEE Trans. Vis. Comput. Graph. 2014
Machine learning › Representation and self-supervised learning › representation learning
dimensionality reduction
0.212013
SCaLE: Supervised and Cascaded Laplacian Eigenmaps for Visual Object Recognition Based on Nearest Neighbors · CVPR 2013
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction › manifold learning › spectral manifold learning
laplacian eigenmaps
0.212013
SCaLE: Supervised and Cascaded Laplacian Eigenmaps for Visual Object Recognition Based on Nearest Neighbors · CVPR 2013
Computer vision › Image recognition and object detection
object recognition
0.212013
SCaLE: Supervised and Cascaded Laplacian Eigenmaps for Visual Object Recognition Based on Nearest Neighbors · CVPR 2013
Visual content generation and editing › sketch generation
line drawing generation
0.112014
Optimized Synthesis of Art Patterns and Layered Textures · IEEE Trans. Vis. Comput. Graph. 2014

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

region proposal · 0.2discriminative clustering · 0.2CNN fine-tuning · 0.2level set method · 0.2global optimization · 0.2expectation-maximization · 0.2supervised laplacian eigenmaps · 0.2nonlinear regression · 0.2nearest neighbor classifier · 0.2
YearPublicationVenuePosition
2026 Application of Decision Tree Mining Algorithm Based on Information Entropy in Intelligent Power Marketing
abstract
ABSTRACT The rapid development of smart power marketing demands the building of very accurate and efficient predictive models to optimize customer segmentation, demand forecasting, and fraud detection. Traditional classification techniques are generally incapable of dealing with large‐scale, complex energy consumption data sets due to redundant attributes, class imbalance, and overfitting issues. In order to solve these problems, the paper suggests applying the Optimized C5.0 Decision Tree with Entropy‐Based Feature Selection for smart power trading to a higher level. The model proposed not only includes the traditional decision tree classification but also the entropy‐based feature selection, pruning, and advanced techniques in data preprocessing like normalization, imputation of missing data, and Synthetic Minority Over‐Sampling Technique for class imbalance and robustness of classification. The first step in the process of building a decision tree is to find out the entropy, which indicates how uncertain the dataset is. The Information Gain of each attribute is then calculated, and the one with the highest IG is taken as the root node. The data is partitioned repeatedly until a stop criterion is reached, which is where the condition to avoid the model being too complex and thus overfitting comes in. Along with the use of pruning techniques such as Reduced Error Pruning and Gini Index‐based feature scoring, the optimum classification accuracy is achieved. The results of the performance evaluation show that the Optimized C5.0 Decision Tree is better than classical classifiers.
Ruobing Wu, Ze He
Concurr. Comput. Pract. Exp.1
2025 CCi-YOLOv8n: Enhanced Fire Detection with CARAFE and Context-Guided Modules
Kunwei Lv, Ruobing Wu, Suyang Chen
ICIC (13)2
2015 Harvesting Discriminative Meta Objects with Deep CNN Features for Scene Classification
abstract
Recent work on scene classification still makes use of generic CNN features in a rudimentary manner. In this paper, we present a novel pipeline built upon deep CNN features to harvest discriminative visual objects and parts for scene classification. We first use a region proposal technique to generate a set of high-quality patches potentially containing objects, and apply a pre-trained CNN to extract generic deep features from these patches. Then we perform both unsupervised and weakly supervised learning to screen these patches and discover discriminative ones representing category-specific objects and parts. We further apply discriminative clustering enhanced with local CNN fine-tuning to aggregate similar objects and parts into groups, called meta objects. A scene image representation is constructed by pooling the feature response maps of all the learned meta objects at multiple spatial scales. We have confirmed that the scene image representation obtained using this new pipeline is capable of delivering state-of-the-art performance on two popular scene benchmark datasets, MIT Indoor 67 [22] and Sun397 [31].
Ruobing Wu, Baoyuan Wang, Yizhou Yu
ICCV1
2014 Optimized Synthesis of Art Patterns and Layered Textures
abstract
Line drawings and digital arts appear everywhere, from simple icons and logos to cartoons, maps, and illustrations. We define art patterns as the subset of line drawings and digital arts that are comprised of repeated elements. There exist textures that share characteristics with art patterns. Examples of such textures include piled discrete elements with curved contours. Inspired by recent success of exemplar-based texture synthesis, in this paper, we focus on synthesizing art patterns and textures with curvilinear features from exemplars, which we cast as a global optimization problem. Our energy function for this problem measures both the appearance similarity of color patterns and shape similarity of curvilinear features between an input exemplar and a synthesized image. We develop an overall expectation-maximization-style algorithm for minimizing this energy function. The shape similarity part of the energy is minimized through an innovative application of the level set method. We further generalize our energy function and optimization algorithm to multilayer pattern and texture synthesis. Our generalized optimization can effectively handle multiple layers and synthesize valid instances of interaction.
Ruobing Wu, Yizhou Yu
IEEE Trans. Vis. Comput. Graph.1
2013 SCaLE: Supervised and Cascaded Laplacian Eigenmaps for Visual Object Recognition Based on Nearest Neighbors
abstract
Recognizing the category of a visual object remains a challenging computer vision problem. In this paper we develop a novel deep learning method that facilitates example-based visual object category recognition. Our deep learning architecture consists of multiple stacked layers and computes an intermediate representation that can be fed to a nearest-neighbor classifier. This intermediate representation is discriminative and structure-preserving. It is also capable of extracting essential characteristics shared by objects in the same category while filtering out nonessential differences among them. Each layer in our model is a nonlinear mapping, whose parameters are learned through two sequential steps that are designed to achieve the aforementioned properties. The first step computes a discrete mapping called supervised Laplacian Eigenmap. The second step computes a continuous mapping from the discrete version through nonlinear regression. We have extensively tested our method and it achieves state-of-the-art recognition rates on a number of benchmark datasets.
Ruobing Wu, Yizhou Yu, Wenping Wang 0001
CVPR1