LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Hu, W.; Xie, N.; Hu, R.; Ling, H.; Chen, Q.; Yan, S.; Maybank, Stephen J. (2014)
Publisher: IEEE Computer Society
Languages: English
Types: Article
Subjects: csis

Classified by OpenAIRE into

ACM Ref: ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION
Large variations in image background may cause partial matching and normalization problems for histogram-based representations, i.e., the histograms of the same category may have bins which are significantly different, and normalization may produce large changes in the differences between corresponding bins. In this paper, we deal with this problem by using the ratios between bin values of histograms, rather than bin values' differences which are used in the traditional histogram distances. We propose a bin ratio-based histogram distance (BRD), which is an intra-cross-bin distance, in contrast with previous bin-to-bin distances and cross-bin distances. The BRD is robust to partial matching and histogram normalization, and captures correlations between bins with only a linear computational complexity. We combine the BRD with the ℓ1 histogram distance and the χ2 histogram distance to generate the ℓ1 BRD and the χ2 BRD, respectively. These combinations exploit and benefit from the robustness of the BRD under partial matching and the robustness of the ℓ1 and χ2 distances to small noise. We propose a method for assessing the robustness of histogram distances to partial matching. The BRDs and logistic regression-based histogram fusion are applied to image classification. The experimental results on synthetic data sets show the robustness of the BRDs to partial matching, and the experiments on seven benchmark data sets demonstrate promising results of the BRDs for image classification.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • 1. A. Agarwal and B. Triggs, “Hyperfeatures - Multilevel Local Coding for Visual Recognition,” INRIA Research Report RR-5655, 2006.
    • 2. A. C. Berg, T. L. Berg, and J. Malik, “Shape Matching and Object Recognition Using Low Distortion Correspondences,” in Proc. of Computer Vision and Pattern Recognition, vol. 1, pp. 26-33, 2005.
    • 3. D. Cai, X. He, and J. Han, “Efficient Kernel Discriminant Analysis via Spectral Regression,” In Proc. of IEEE International Conference on Data Mining, pp. 427-432, Oct. 2007.
    • 4. C.-K. Chiang, C.-H. Duan, S.-H. Lai, and S.-F. Chang, “Learning Component-Level Sparse Representation Using Histogram Information for Image Classification,” in Proc. of IEEE International Conference on Computer Vision, pp. 1519-1526, 2011.
    • 5. O. Chapelle, P. Haffner, and V. Vapnik, “Support Vector Machines for Histogram-Based Image Classification,” IEEE Trans. on Neural Networks, vol. 10, no. 5, pp. 1055-1064, Sep. 1999.
    • 6. O. Duchenne, F. Bach, I. Kweon, and J. Ponce, “A Tensor-Based Algorithm for High-Order Graph Matching,” in Proc. of Computer Vision and Pattern Recognition Workshops, pp. 1980-1987, 2009.
    • 7. V. Ablavsky and S. Sclaroff, “Learning Parameterized Histogram Kernels on the Simplex Manifold for Image and Action Classification,” in Proc. of IEEE International Conference on Computer Vision, pp. 1473-1480, 2011.
    • 8. M. Everingham, A. Zisserman, C. Williams, L. van Gool, M. Allan, C. Bishop, O. Chapelle, N. Dalal, T. Deselaers, and G. Dorko, “The 2005 Pascal Visual Object Classes Challenge,” Machine Learning Challenges, Lecture Notes in Computer Science, vol. 3944, pp. 117-176, 2006.
    • 9. L. Fei-Fei and P. Perona, “A Bayesian Hierarchical Model for Learning Natural Scene Categories,” in Proc. of IEEE Conference on Computer Vision and Pattern Recognition, pp. 524-531, vol. 2, June 2005.
    • 10. P. Gehler and S. Nowozin, “On Feature Combination for Multiclass Object Classification,” in Proc. of IEEE International Conference on Computer Vision, pp. 221-228, Sep. 2009.
    • 11. J.C.V. Gemert, C.J. Veenman, A.W.M. Smeulders, and J.M. Geusebroek, “Visual Word Ambiguity,” IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 32, no. 7, pp. 1271-1283, July 2010.
    • 12. G. Griffin, A. Holub, and P. Perona. “Caltech-256 Object Category Dataset,” Technical Report: CaltechAUTHORS: CNS-TR-2007-001, California Institute of Technology, 2007.
    • 13. K. Grauman and T. Darrell, “The Pyramid Match Kernel: Efficient Learning with Sets of Features,” Journal of Machine Learning Research, vol. 8, no. 4, pp. 725-760, April 2007.
    • 14. J. Hafner, H. Sawhney, W. Equitz, M. Flickner, and W. Niblack, “Efficient Color Histogram Indexing for Quadratic Form Distance Functions,” IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 17, no. 7, pp. 729-736, July 1995.
    • 15. G.R.G. Lanckriet, N. Cristianini, P. Bartlett, L.E. Ghaoui, and M.I. Jordan, “Learning the Kernel Matrix with Semi-Definite Programming,” Journal of Machine Learning Research, vol. 5, pp. 27-72, Jan. 2004
    • 16. G. Lang and P. Seitz, “Robust Classification of Arbitrary Object Classes Based on Hierarchical Spatial Feature-Matching,” Machine Vision and Applications, vol. 10, no. 3, pp. 123-135, 1997.
    • 17. S. Lazebnik, C. Schmid, and J. Ponce, “Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories,” in Proc. of IEEE Conference on Computer Vision and Pattern Recognition, vol. 2, pp. 2169-2178, 2006.
    • 18. M. Leordeanu and M. Hebert, “A Spectral Technique for Correspondence Problems Using Pairwise Constraints,” in Proc. of IEEE International Conference on Computer Vision, vol. 2, pp. 1482-1489, Oct. 2005.
    • 19. J. Li, W. Wu, T. Wang, and Y. Zhang, “One Step Beyond Histograms: Image Representation Using Markov Stationary Features,” in Proc. of IEEE Conference on Computer Vision and Pattern Recognition, pp. 1-8, June 2008.
    • 20. H. Ling and K. Okada, “Diffusion Distance for Histogram Comparison,” in Proc. of IEEE Conference on Computer Vision and Pattern Recognition, vol. 1, pp. 246-253, June 2006.
    • 21. H. Ling and S. Soatto, “Proximity Distribution Kernels for Geometric Context in Category Recognition,” in Proc. of IEEE International Conference on Computer Vision, pp. 1-8, Oct. 2007.
    • 22. S. Maji, A.C. Berg, and J. Malik, “Classification Using Intersection Kernel Support Vector Machines is Efficient,” in Proc. of IEEE Conference on Computer Vision and Pattern Recognition, pp. 1-8, June 2008.
    • 23. M. Marszalek, C. Schmid, H. Harzallah, and J.V.D Weijer, “Learning Object Representations for Visual Object Class Recognition,” in Proc. of Visual Recognition Challange workshop: PASCAL VOC 2007, in Conjunction with ICCV, 2007.
    • 24. M.-E. Nilsback and A. Zisserman, “A Visual Vocabulary for Flower Classification,” in Proc. of IEEE Conference on Computer Vision and Pattern Recognition, vol. 2, pp. 1447-1454, 2006.
    • 25. M.-E. Nilsback and A. Zisserman, “Automated Flower Classification over a Large Number of Classes,” in Proc. of Indian Conference on Computer Vision, Graphics and Image Processing, pp. 722-729, Feb. 2008.
    • 26. A. Oliva and A. Torralba, “Modeling the Shape of the Scene: a Holistic Representation of the Spatial Envelope,” International Journal of Computer Vision, vol. 42, no. 3, pp. 145-175, 2001.
    • 27. O. Pele and M. Werman, “Fast and Robust Earth Mover's Distances,” in Proc. of IEEE International Conference on Computer Vision, pp. 460-467, Sep. 2009.
    • 28. F. Li, G. Lebanon, and C. Sminchisescu, “Chebyshev Approximations to the Histogram χ2 Kernel,” in Proc. of IEEE Conference on Computer Vision and Pattern Recognition, pp. 2424-2431, 2012.
    • 29. J. Puzicha, T. Hofmann, and J. Buhmann, “Non-Parametric Similarity Measures for Unsupervised Texture Segmentation and Image Retrieval,” in Proc. of IEEE Conference on Computer Vision and Pattern Recognition, pp. 267-272, June 1997.
    • 30. Y. Rubner, C. Tomasi, and L.J. Guibas, “The Earth Mover's Distance as a Metric for Image Retrieval,” International Journal of Computer Vision, vol. 40, no. 2, pp. 99-121, Nov. 2000.
    • 31. S. Savarese, J. M. Winn, and A. Criminisi, “Discriminative Object Class Models of Appearance and Shape by Correlations,” in Proc. of IEEE Conference on Computer Vision and Pattern Recognition, vol. 2, pp. 2033-2040, 2006.
    • 32. K.E.A.V.D. Sande, T. Gevers, and C.G.M, Snoek, “Evaluation of Color Descriptors for Object and Scene Recognition,” IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 32, no. 9, pp. 1582-1596, Sep. 2010.
    • 33. C. Schmid, “Weakly Supervised Learning of Visual Models and Its Application to Content-Based Retrieval,” International Journal of Computer Vision, vol. 56, no. 1-2, pp. 7-16, Jan.-Feb. 2004.
    • 34. M. Swain and D. Ballard, “Color Indexing,” International Journal of Computer Vision, vol. 7, no. 1, pp. 11-32, 1991.
    • 35. M.A. Tahir, J. Kittler, K. Mikolajczyk, F. Yan, K.E.A.V.D. Sande, and T. Gevers, “Visual Category Recognition Using Spectral Regression and Kernel Discriminant Analysis,” in Proc. of IEEE International Workshop on Subspace, Kyoto, Japan, pp. 178-185, Jan 2009.
    • 36. M. Varma and D. Ray, “Learning the Discriminative Power Invariance Trade-Off,” in Proc. of IEEE International Conference on Computer Vision, pp. 1-8, Oct. 2007.
    • 37. N. Dalal and B. Triggs, “Histograms of Oriented Gradients for Human Detection,” in Proc. of IEEE Conference on Computer Vision and Pattern Recognition, vol. 1, pp. 886-893, June 2005.
    • 38. J. Willamowski, D. Arregui, G. Csurka, C. Dance, and L. Fan, “Categorizing Nine Visual Classes Using Local Appearance Descriptors,” ICPR Workshop on Learning for Adaptable Visual Systems, Cambridge, UK, pp. 21-31, Aug. 2004.
    • 39. Z. Wu, Q. Ke, M. Isard, and J. Sun, “Bundling Features for Large Scale Partial-Duplicate Web Image Search,” in Proc. of IEEE Conference on Computer Vision and Pattern Recognition, pp. 25-32, 2009.
    • 40. J. Wu and J.M. Rehg, “Beyond the Euclidean distance: Creating Effective Visual Codebooks Using the Histogram Intersection Kernel,” in Proc. of IEEE International Conference on Computer Vision, pp. 630-637, Sep. 2009.
    • 41. N. Xie, H. Ling, W. Hu, and X. Zhang, “Use Bin-Ratio Information for Category and Scene Classification,” in Proc. of IEEE Conference on Computer Vision and Pattern Recognition, pp. 2313-2319, June 2010.
    • 42. P. Felzenszwalb, R. Girshick, D. McAllester, and D. Ramanan, “Object Detection with Discriminatively Trained Part Based Models,” IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 32, no. 9, pp. 1627-1645, Sep. 2010.
    • 43. J. Zhang, M. Marszalek, S. Lazebnik, and C. Schmid, “Local Features and Kernels for Classification of Texture and Object Categories: a Comprehensive Study,” International Journal of Computer Vision, vol. 73, no. 2, pp. 213-238, June 2007.
    • 44. A. Opelt, M. Fussenegger, A. Pinz, and P. Auer, “Weak Hypotheses and Boosting for Generic Object Detection and Recognition,” in Proc. of European Conference on Computer Vision, pp. 71-84, 2004.
    • 45. G. Csurka, C. Dance, L. Fan, J. Williamowski, and C. Bray, “Visual Categorization with Bags of Keypoints,” in Proc. of ECCV Workshop on Statistical Learning in Computer Vision, pp. 1-22, 2004.
    • 46. F.S. Khan, J. van de Weijer, and M. Vanrell, “Modulating Shape Features by Color Attention for Object Recognition,” International Journal of Computer Vision, vol. 98, no. 1, pp. 49-64, 2012.
    • 47. B.-D. Liu, Y.-X. Wang, Y.-J. Zhang, and B. Shen, “Learning Dictionary on Manifolds for Image Classification,” Pattern Recognition, vol. 46, no. 7, pp. 1879-1890, 2013.
    • 48. Q. Chen, Z. Song, Y. Hua, Z. Huang, and S. Yan, “Hierarchical Matching with Side Information for Image Classification,” In Proc. of IEEE Conference on Computer Vision and Pattern Recognition, pp. 3426-3433, June 2012.
    • 49. H.-G. Nguyen, R. Fablet, and J.-M. Boucher, “Visual Textures as Realizations of Multivariate Log- Gaussian Cox Processes,” in Proc. of IEEE Conference on Computer Vision and Pattern Recognition, pp. 2945-2952, June 2011.
    • 50. H.-G. Nguyen, R. Fablet, A. Ehrhold, and J.-M. Boucher, “Keypoint-Based Analysis of Sonar Images: Application to Seabed Recognition,” IEEE Trans. on Geoscience and Remote Sensing, vol. 50, no. 4, pp. 1171-1184, April 2012.
    • 51. H.-G. Nguyen, R. Fablet, and J.-M. Boucher, “Multivariate Log-Gaussian Cox Models of Elementary Shapes for Recognizing Natural Scene Categories,” in Proc. of IEEE International Conference on Image Processing, Brussels Belgium, pp. 665-668, Sep. 2011.
    • 52. H.-G. Nguyen, R. Fablet, and J.-M. Boucher, “Spatial Statistics of Visual Keypoints for Texture Recognition,” in Proc. of European Conference on Computer Vision, Crete-Greece, pp.764-777, Sep. 2010.
    • 53. H.-G. Nguyen, R. Fablet, and J.-M. Boucher, “Invariant Descriptors of Sonar Textures from Spatial Statistics of Local Features,” in Proc. of International Conference on Acoustics, Speech and Signal Processing, pp. 1674-1677, March 2010. n q2jpi2 qi2p2j 2qj piqi pj   j1
  • No related research data.
  • Discovered through pilot similarity algorithms. Send us your feedback.

Share - Bookmark

Cite this article