Repository logo
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Scholalry Output
  3. Publications
  4. Corner detection using random forests
 
  • Details

Corner detection using random forests

Source
Advances in Intelligent Systems and Computing
ISSN
21945357
Date Issued
2017-01-01
Author(s)
Pachori, Shubham
Singh, Kshitij
Raman, Shanmuganathan  
DOI
10.1007/978-981-10-2104-6_49
Volume
459 AISC
Abstract
We present a fast algorithm for corner detection, exploiting the local features (i.e. intensities of neighbourhood pixels) around a pixel. The proposed method is simple to implement but is efficient enough to give results comparable to that of the state-of-the-art corner detectors. The algorithm is shown to detect corners in a given image using a learning-based framework. The algorithm simply takes the differences of the intensities of candidate pixel and pixels around its neighbourhood and processes them further to make the similar pixels look even more similar and distinct pixels even more distinct. This task is achieved by effectively training a random forest in order to classify whether the candidate pixel is a corner or not. We compare the results with several state-of-the-art techniques for corner detection and show the effectiveness of the proposed method.
Unpaywall
URI
https://d8.irins.org/handle/IITG2025/22569
Subjects
Corner detection | Feature extraction | Random forests
IITGN Knowledge Repository Developed and Managed by Library

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify