This is a paper discribing a fast matting method. It uses a large kernal matting laplacian. A KD-Tree trimap segmentation is also used to decide the size of the kernal.

关于数据库多维索引结构KD树的介绍，包括构建和检索的算法。-Multi-dimensional database index structure on the introduction of KD tree, including the construction and retrieval algorithms

Paper about Music Identification