J
Jian Sun
Researcher at Xi'an Jiaotong University
Publications - 394
Citations - 356427
Jian Sun is an academic researcher from Xi'an Jiaotong University. The author has contributed to research in topics: Computer science & Object detection. The author has an hindex of 109, co-authored 360 publications receiving 239387 citations. Previous affiliations of Jian Sun include French Institute for Research in Computer Science and Automation & Tsinghua University.
Papers
More filters
Book ChapterDOI
GridFace: Face Rectification via Learning Local Homography Transformations
Erjin Zhou,Zhimin Cao,Jian Sun +2 more
TL;DR: This paper proposes a method, called GridFace, to reduce facial geometric variations and improve the recognition performance, which rectifies the face by local homography transformations, which are estimated by a face rectification network.
Patent
Association and prediction in facial recognition
Jian Sun,Qi Yin,Xiaoou Tang +2 more
TL;DR: Some implementations employ an identity data set having a plurality of images representing different intrapersonal settings as mentioned in this paper, and some implementations utilize a likelihood-prediction approach for comparing images that generates a classifier for an input image based on an association of an image with the ID data set.
Posted Content
Convergence of the Point Integral method for Poisson equation on point cloud
Zuoqiang Shi,Jian Sun +1 more
TL;DR: The convergence of Point Integral method (PIM) for Poisson equation with Neumann boundary condition on submanifolds isometrically embedded in Euclidean spaces is analyzed.
Proceedings ArticleDOI
Content-Aware Rotation
Kaiming He,Huiwen Chang,Jian Sun +2 more
TL;DR: This work designs an optimization-based method that preserves the rotation of horizontal/vertical lines, maintains the completeness of the image content, and reduces the warping distortion.
Journal ArticleDOI
Gromov---Hausdorff Approximation of Filamentary Structures Using Reeb-Type Graphs
TL;DR: It is proved that filamentary structures that can be seen as topological metric graphs can be approximated with respect to the Gromov–Hausdorff distance by well-chosen Reeb graphs and an efficient and easy-to-implement algorithm is provided to compute such approximations in almost linear time.