['Matching high dimensional features between images is computationally expensive for exhaustive search approaches in computer vision. Although the dimension of the feature can be degraded by simplifying the prior knowledge of homography, matching accuracy may degrade as a result. In this thesis, we present a feature matching method based on K-means algorithm, which combines with L1-norm based pyramid structure that reduces the matching cost to match the features between images instead of using a simplified geometric assumption. Experimental results show that the proposed method outperforms the previous linear exhaustive search approaches in terms of the inlier ratio of matched pairs. We also implement the proposed approach on FPGA using a structured pipeline design to further improve the execution efficiency of the proposed matching algorithm.']