Main Article Content
The traditional Harris detector are sensitive to noise and resolution because without the property of scale invariant. In this research, The Harris corner detector algorithm is improved, to work with multi resolution images, the technique has also been working with poor lighting condition by using histogram equalization technique. The work we have done addresses the issue of robustly detection of feature points, detected multiple of local features are characterized by the intensity changes in both horizontal and vertical direction which is called corner features. The goal of this work is to detect the corner of an object through the Harris corner detector with multiple scale of the same image. The scale invariant property applied to the Harris algorithm for improving the corner detection performance in different resolution of the same image with the same interest point. The detected points represented by two independent variables (x, y) in a matrix (x, y) and the dependent variable f are called intensity of interest points. Through these independent variable, we get the displacement and velocity of object by subtracting independent variable f(x,y) at current frame from the previous location f ̀((x,) ̀(y,) ̀) of another frame. For further work, multiple of moving object environment have been taken consideration for developing algorithms.
 Shi, J. (1994, June). Good features to track. In Computer Vision and Pattern Recognition, 1994. Proceedings CVPR'94., 1994 IEEE Computer Society Conference on (pp. 593-600). IEEE.
 Lowe, D. G. (2004). Distinctive image features from scale-invariant keypoints. International journal of computer vision, 60(2), 91-110.
 Se, S., Lowe, D., & Little, J. (2002). Mobile robot localization and mapping with uncertainty using scale-invariant visual landmarks. The international Journal of robotics Research, 21(8), 735-758.
 Bay, H., Ess, A., Tuytelaars, T., & Van Gool, L. (2008). Speeded-up robust features (SURF). Computer vision and image understanding, 110(3), 346-359.
 Riemenschneider, H., Sternig, S., Donoser, M., Roth, P. M., & Bischof, H. (2012, October). Hough regions for joining instance localization and segmentation. In European Conference on Computer Vision (pp. 258-271). Springer, Berlin, Heidelberg.
 Rosten, E., & Drummond, T. (2005, October). Fusing points and lines for high performance tracking. In Computer Vision, 2005. ICCV 2005. Tenth IEEE International Conference on(Vol. 2, pp. 1508-1515). IEEE.
 Calonder, M., Lepetit, V., Ozuysal, M., Trzcinski, T., Strecha, C., & Fua, P. (2012). BRIEF: Computing a local binary descriptor very fast. IEEE Transactions on Pattern Analysis and Machine Intelligence, 34(7), 1281-1298.
 Cafforio, C., & Rocca, F. (1976). Methods for measuring small displacements of television images. IEEE transactions on Information Theory, 22(5), 573-579
 Leutenegger, S., Chli, M., & Siegwart, R. Y. (2011, November). BRISK: Binary robust invariant scalable keypoints. In Computer Vision (ICCV), 2011 IEEE International Conference on (pp. 2548-2555). IEEE.
 Lepetit, V., & Fua, P. (2006). Keypoint recognition using randomized trees. IEEE transactions on pattern analysis and machine intelligence, 28(9), 1465-1479.
 Trzcinski, T., Christoudias, M., Fua, P., & Lepetit, V. (2013, June). Boosting binary keypoint descriptors. In Computer Vision and Pattern Recognition (CVPR), 2013 IEEE Conference on (pp. 2874-2881). IEEE.
 Das, P., Ghoshal, R., Kole, D. K., & Ghosh, R. (2012). Measurement of Displacement and Velocity of a Moving Object from Real Time Video. International Journal of Computer Applications, 49(13).
 Kanan, C., & Cottrell, G. W. (2012). Color-to-grayscale: does the method matter in image recognition. PloS one, 7(1), e29740.