Jianchao Tan

Jianchao Tan

Auto-generated profile, based on publicly available information

Jianchao Tan

Kuaishou Technology, Beijing, China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2023 in Communications in Information and Systems
Verified
Journal Article
Closed access
PDF file
QWQiling Wu
Qiling Wu
JTJianchao Tan
Jianchao Tan
KXKun Xu
Kun Xu
International Press of Boston - publishers of scholarly mathematical and scientific journals and books

26 July 2023 in ACM Transactions on Graphics
Verified
Journal Article
Open access
ZDZheng-Jun Du
Zheng-Jun Du
LKLiang-Fu Kang
Liang-Fu Kang
JTJianchao Tan
Jianchao Tan
YGYotam Gingold
Yotam Gingold
KXKun Xu
Kun Xu
A key advantage of vector graphics over raster graphics is their editability. For example, linear gradients define a spatially varying color fill with a few intuitive parameters, which are ubiquitously supported in standard vector graphics formats and libraries. By layering regions filled with linear gradients, complex appearances can be created. We propose an automatic method to convert a raster image into layered regions of linear gradients. Given an input raster image segmented into regions, our approach decomposes the resulting regions into opaque and semi-transparent linear gradient fills. Our approach is fully automatic (e.g., users do not identify a background as in previous approaches) and exhaustively considers all possible decompositions that satisfy perceptual cues. Experiments on a variety of images demonstrate that our method is robust and effective.

23 July 2018 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
JTJianchao Tan
Jianchao Tan
SDStephen DiVerdi
Stephen DiVerdi
JLJingwan Lu
Jingwan Lu
YGYotam Gingold
Yotam Gingold
The colorful appearance of a physical painting is determined by the distribution of paint pigments across the canvas, which we model as a per-pixel mixture of a small number of pigments with multispectral absorption and scattering coefficients. We present an algorithm to efficiently recover this structure from an RGB image, yielding a plausible set of pigments and a low RGB reconstruction error. We show that under certain circumstances we are able to recover pigments that are close to ground truth, while in all cases our results are always plausible. Using our decomposition, we repose standard digital image editing operations as operations in pigment space rather than RGB, with interestingly novel results. We demonstrate tonal adjustments, selection masking, cut-copy-paste, recoloring, palette summarization, and edge enhancement.

26 July 2023 in ACM Transactions on Graphics
Verified
Journal Article
Open access
CCCheng-Kang Ted Chao
Cheng-Kang Ted Chao
JKJason Klein
Jason Klein
JTJianchao Tan
Jianchao Tan
JEJose Echevarria
Jose Echevarria
YGYotam Gingold
Yotam Gingold
Color editing in images often consists of two main tasks: changing hue and saturation, and editing lightness or tone curves. State-of-the-art palette-based recoloring approaches entangle these two tasks. A user's only lightness control is changing the lightness of individual palette colors. This is inferior to state-of-the-art commercial software, where lightness editing is based on flexible tone curves that remap lightness. However, tone curves are only provided globally or per color channel (e.g., RGB). They are unrelated to the image content. Neither tone curves nor palette-based approaches support direct image-space edits---changing a specific pixel to a desired hue, saturation, and lightness. ColorfulCurves solves both of these problems by uniting palette-based and tone curve editing. In ColorfulCurves , users directly edit palette colors' hue and saturation, per-palette tone curves, or image pixels (hue, saturation, and lightness). ColorfulCurves solves an L 2,1 optimization problem in real-time to find a sparse edit that satisfies all user constraints. Our expert study found overwhelming support for ColorfulCurves over experts' preferred tools.

21 October 2022 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
YXYunyang Xu
Yunyang Xu
XGXifeng Gao
Xifeng Gao
CZCaiming Zhang
Caiming Zhang
JTJianchao Tan
Jianchao Tan
XLXuemei Li
Xuemei Li
Superpixel generation is increasingly an important area for computer vision tasks. While superpixels with highly regular shapes are preferred to make the subsequent processing easier, the accuracy of the superpixel boundaries is also necessary. Previous methods usually depend on a distance function considering both spatial and color coherency regularization on the whole image, which however is hard to balance between shape regularity and boundary adherence, especially when the desired number of superpixels is small. In addition, non-adaptive parameters and insufficient contour information also affect the performance of segmentation. To mitigate these problems, we propose a robust divide-and-conquer superpixel segmentation method, of which the core idea is that we apply a new contour information extraction and a pixel clustering to separate the input image into flat and non-flat regions, where the former targets shape regularity and the latter emphasizes boundary adherence, followed by an efficient hierarchical merging to clean up tiny and dangling superpixels. Our algorithm requires no additional parameter tuning except the desired number of superpixels since our internal parameters are self-adaptive to the image contents. Experimental results demonstrate that for public benchmark datasets, our algorithm consistently generates more regular superpixels with stronger boundary adherence than state-of-the-art methods while maintaining a competitive efficiency. We will release our code upon acceptance.

21 October 2023
Verified
Conference Paper
Open access
BZBeichuan Zhang
Beichuan Zhang
CSChenggen Sun
Chenggen Sun
JTJianchao Tan
Jianchao Tan
XCXinjun Cai
Xinjun Cai
JZJun Zhao
Jun Zhao
YSYang Song
Yang Song
Increasing the size of embedding layers has shown to be effective in improving the performance of recommendation models, yet gradually causing their sizes to exceed terabytes in industrial recommender systems, and hence the increase of computing and storage costs. To save resources while maintaining model performances, we propose SHARK, the model compression practice we have summarized in the recommender system of industrial scenarios. SHARK consists of two main components. First, we use the novel first-order component of Taylor expansion as importance scores to prune the number of embedding tables (feature fields). Second, we introduce a new row-wise quantization method to apply different quantization strategies to each embedding. We conduct extensive experiments on both public and industrial datasets, demonstrating that each component of our proposed SHARK framework outperforms previous approaches. We conduct A/B tests in multiple models on Kuaishou, such as short video, e-commerce, and advertising recommendation models. The results of the online A/B test showed SHARK can effectively reduce the memory footprint of the embedded layer. For the short-video scenarios, the compressed model without any performance drop significantly saves 70% storage and thousands of machines, improves 30% queries per second (QPS), and has been deployed to serve hundreds of millions of users and process tens of billions of requests every day.