LATCH (Learned Arrangements of Three Patch Codes) improves the accuracy of local binary descriptor by comparing three pixel blocks rather than tow pixel blocks. However, the improvement of accuracy brings a larger time consuming. Based on the study of LATCH and other local binary descriptors, using integral graph theory in improved LATCH descriptor, it reduces repeated calculation of each pixel blocks in LATCH descriptors. According to the experiment results, the computation time of the improved algorithm is reduced by 30%-40% compared with the original algorithms, while the accuracy of the improved algorithm is similar to that of the original algorithm.