This document describes our submission to QBSH task of MIREX 2013. Our algorithm adopts a two-stage cascaded solution based on Locality Sensitive Hashing (LSH) and accurate matching of frame-level pitch sequence. Firstly, LSH is employed to quickly filter out songs with low matching possibilities, resulting in a list of candidate songs for further processing. In the second stage, Dynamic Time Warping (DTW) is applied to find the N (set to 10) most matching songs from the candidate list. This approach allows for fast pruning of irrelevant songs whilst preserving the most matching ones.