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

Jie Li 0023

dblp:17/2703-23 · DBLP profile ↗
← Back
8ranked-venue papers
6as first author
6since 2021 · last 2025
0000-0002-2916-4960ORCID · conflict

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

Graphics, computer vision, multimedia, augmented reality and games · 6 · 5 first-author · 4 since 2021Artificial intelligence and machine learning · 2 · 1 first-author · 2 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
2 papers
Visual content generation and editing · 88% Image and video processing · 12%

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

TopicWeightPapersLastEvidence papers
Visual content generation and editing
texture synthesis
1.022023
Optimal Transport-Based Patch Matching for Image Style Transfer · IEEE Trans. Multim. 2023
Non-Local Texture Optimization With Wasserstein Regularization Under Convolutional Neural Network · IEEE Trans. Multim. 2019
Visual content generation and editing › style transfer
image style transfer
0.712023
Optimal Transport-Based Patch Matching for Image Style Transfer · IEEE Trans. Multim. 2023
Visual content generation and editing › texture synthesis
patch-based texture synthesis
0.712023
Optimal Transport-Based Patch Matching for Image Style Transfer · IEEE Trans. Multim. 2023
Visual content generation and editing › texture synthesis
example-based texture synthesis
0.412019
Non-Local Texture Optimization With Wasserstein Regularization Under Convolutional Neural Network · IEEE Trans. Multim. 2019
Image and video processing
image restoration
0.412019
Non-Local Texture Optimization With Wasserstein Regularization Under Convolutional Neural Network · IEEE Trans. Multim. 2019

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

patch matching · 0.7optimal transport · 0.7wasserstein distance · 0.4expectation-maximization · 0.4convolutional neural network · 0.4
YearPublicationVenuePosition
2025 Ensemble fractional fuzzy dispersion entropy: A low bias approach for data analysis
Chengjiang Zhou, Longkun He, Xuanyu Liao, Jie Li 0023, Yang Yang 0032
Eng. Appl. Artif. Intell.4
2023 Soft multimodal style transfer via optimal transport
Jie Li 0023, Liwen Wu, Dan Xu 0001, Shaowen Yao 0001
Knowl. Based Syst.1
2023 Optimal Transport-Based Patch Matching for Image Style Transfer
abstract
State-of-the-art image style transfer methods have achieved impressive results by using neural networks. However, neural style transfer (NST) methods either ignore the local details of the style image by using the global statistics for style modeling or cannot fully use shallow features of neural networks, leading to the synthesized image having fewer details. In this study, we proposed a new patch-based style transfer method that directly operates in the image pixel domain without using any neural networks, achieving fascinating style transfer results with rich image details. The proposed method was derived from classic texture synthesis methods. Most previous methods rely on nearest neighbor search (NNS) for patch matching. However, this greedy strategy cannot guarantee the similarity of patch distributions between the synthesized image and the style image, which limits the expressiveness of textures. We solved this problem by proposing an optimal patch matching algorithm formed on the Optimal Transport (OT) theory, which theoretically guarantees the similarity of the patch distributions and gives a flexible style modeling method. Various qualitative and quantitative experiments demonstrated that the proposed method achieves better synthesized results than state-of-the-art style transfer methods, including NST and classic methods based on texture synthesis.
Jie Li 0023, Yong Xiang 0001, Hao Wu 0010, Shaowen Yao 0001, Dan Xu 0001
IEEE Trans. Multim.1
2022 Sliced Wasserstein Distance for Neural Style Transfer
Jie Li 0023, Dan Xu 0001, Shaowen Yao 0001
Comput. Graph.1
2022 Arbitrary style transfer with attentional networks via unbalanced optimal transport
abstract
Abstract Arbitrary style transfer aims to stylize the content image with the style image. The key problem of style transfer is how to balance the global content structure and the local style patterns. A promising method to solve this problem is the attentional style transfer method, where a learnable embedding of image features enables style patterns to be flexibly recombined with the content image, so local style patterns will be well preserved in the stylized image. However, current attentional style transfer methods cannot well preserve the global content structure. To solve this problem, a novel attentional style transfer network is proposed, that relies on Optimal Transport (OT) for computing the attention map. The proposed OT‐based attention ensures the similarity between global distributions of the synthesized image and its corresponding style image. For the optimal transport computation, a regularized formulation is used, which not only allows an unbalanced optimal transport to address the deviational distributions but also improves the robustness of stylized results. The proposed method finds a well balance between the global content structure and local style patterns. Various experiments are conducted to demonstrate the superiority of the proposed method over state‐of‐the‐art methods.
Jie Li 0023, Liwen Wu, Dan Xu 0001, Shaowen Yao 0001
IET Image Process.1
2021 A fully-automatic image colorization scheme using improved CycleGAN with skip connections
Shanshan Huang 0001, Xin Jin 0005, Jie Li 0023, Shin-Jye Lee, Puming Wang, Shaowen Yao 0001
Multim. Tools Appl.4
2019 Non-Local Texture Optimization With Wasserstein Regularization Under Convolutional Neural Network
abstract
Example-based texture synthesis aims to generate a new texture from an exemplar texture and has long been drawing attention in the fields of computer graphics, computer vision, and image processing. Nevertheless, synthesizing structured textures remains a challenging task. Most previous methods rely on additional guidance channels, which encode the structured features of textures. However, estimating the guidance channel is very difficult, and often fails when a texture has unpronounced features. In this paper, we propose a novel texture synthesis method, based on non-local operators, which captures the long-range structure of a texture without the additional guidance channel. The synthesized texture is generated by minimizing non-local texture energy through an expectation-maximization like optimization algorithm. A statistical constraint based on the Wasserstein distance is also proposed to ensure that the synthesized texture preserves the global statistics of the exemplar texture. Extensive experiments show that the proposed method can stably handle textures with different scale structures.
Jie Li 0023, Yong Xiang 0001, Jingyu Hou 0001, Dan Xu 0001
IEEE Trans. Multim.1
2015 A Scores Based Rendering for Yunnan Out-of-Print Woodcut
abstract
Woodcut is a painting, in which knife and woodblock are used instead of pen and paper. Yunnan out-of-print woodcut is an extension of the traditional woodcut. In this paper, we introduce an automatic image-based approach with three steps. First, image is sliced out by color clustering. Then, scores collected from real woodcuts are placed automatically in segmenting regions. Finally, a virtual printing method combining all regions with their colors is proposed to synthesize multicolor woodcut. This method is simple and efficient, and the simulated result looks good.
Jie Li 0023, Dan Xu 0001
CAD/Graphics1