Research
Semantic Segmentation
Many natural problems in computer vision are instances of dense prediction. The goal is to compute a discrete or continuous label for each pixel in the image. A prominent example is semantic segmentation, which calls for classifying each pixel into one of a given set of categories. Semantic segmentation is challenging because it requires combining pixel-level accuracy with multi-scale contextual reasoning.
Person Re-Identification
Person re-identification (re-ID) is usually viewed as an image retrieval problem, which matches pedestrians from different cameras or across time using a single camera. Given a person-of-interest (query), person re-ID determines whether the person has been observed by another camera.
Super Resolution
The recovery of a high resolution (HR) image or video from its low resolution (LR) counter part is topic of great interest in digital image processing. This task is referred as super-resolution (SR) problem.
Generative Image Modeling
Generative models provide a principled approach to unsupervised learning. A perfect model of natural images would be able to optimally predict parts of an image given other parts of an image and thereby clearly demonstrate a form of scene understanding.
Fast Multipole Method
FMM is one of ten most important algorithm in 20 century, it reduce the calculate cost from 2N to N and is extremely efficient for large N.
The important Reading Materials for FMM:
- V. Rokhlin, Rapid Solution of Integral Equations of Classical Potential Theory, Journal of Computational Physics, 60, 187-207, 1983.
- Leslie Greengard, The Rapid Evaluation of Potential Fields in Particle System.
- J. Carrier, L. Greengard, and V. Rokhlin. A Fast Adaptive Multipole Algorithm for Particle Simulations, SIAM J. STAT. COMPUT. Vol. 9, No. 4, 1988.
- A. Dutt, M. Gu and V. Rokhlin, Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation, SIAM J. Numer. Anal, Vol. 33, No. 5, pp. 1689-1711, 1996.
- T. Hrycak and V. Rokhlin, An Improved Fast Multipole Algorithm for Potential Fields, SIAM J. Sci. Comput, Vol. 19, No. 6, pp. 1804-1826, 1998.
I write a note for Fast Multipole Method to explain most important details about FMM method. If you are confused by FMM method, this note may help you to catch the most important conceptions.
For our paper:
Order O(1) algorithm for first-principles transient current through open quantum systems
You also can refer this note for details:
Fast Calculate for Evolution Operators