Scale Invariant Feature Transform 1 (Feature Detectors)

Поділитися
Вставка
  • Опубліковано 17 січ 2025

КОМЕНТАРІ • 31

  • @supreetkurdekar5726
    @supreetkurdekar5726 4 роки тому +4

    Hey buddy. You have a really nice explanation style and it comes from the fact that you have a very in depth understanding of the subject matter. This was my first time learning SIFT and I understood it completely. Good job. If you continue to post technical content like this, ill definitely subscribe. Hope your interest in computer vision stays the same!

    • @pratikian
      @pratikian  4 роки тому

      Thank you so much for the feedback. Yes I will keep uploading videos .. 😊✌

  • @shunnoysarkar6906
    @shunnoysarkar6906 2 роки тому +1

    Wow quite lucidly explained! At 28:05 how does the transpose of the inverse multiplied with the original matrix become identity matrix? Inverse multiplied with the matrix itself gives an identity right?
    Anyway thanks for the video!

    • @pratikian
      @pratikian  2 роки тому

      Thanks for the feedback. Since Hessian matrices are symettric tye transpose of inverse is equal to the inverse matrix.

  • @deeps-n5y
    @deeps-n5y Рік тому

    you are gifted man! this was so much fun :)

  • @michelpohl1019
    @michelpohl1019 2 роки тому +1

    I don't understand why we do scale space extrema detection and not just space extrema detection. In a previous slide, you show a 1D example with convolution with the laplacian of Gaussian, but there are not several values of sigma in that slide...

    • @pratikian
      @pratikian  2 роки тому

      If you see the slide titled (Coming to the point) you can see that the concept works only when the size of the blob is similar to that of the sigma value of the laplacian. Hence its important to serach within a range of different sigma values

  • @piyushkumar-wg8cv
    @piyushkumar-wg8cv Рік тому +1

    Is there any implementation available for this from scratch i.e. without using the library?

  • @jayasimhayenumaladoddi1602
    @jayasimhayenumaladoddi1602 2 роки тому

    Can you please make a video on OLPP?

  • @arpitaingermany
    @arpitaingermany 2 роки тому +1

    Loved the way you explained it. Thanks a lot.
    I have one question. In scale-space extrema detection, do we need to always compare the middle pixel of the second(intermediate image)? I don't understand that part.

    • @pratikian
      @pratikian  2 роки тому

      Thank you for your feedback. 😇
      To answer your question, it's not necessarily the second image it can be any image from the second image to second last image. Basically the pixels should have 26 neighbours in total. 9 above 9 below and 8 in the same plane.

  • @silverlordboy
    @silverlordboy 4 роки тому

    Very well described and shown, the best!

  • @anupambanerjee5222
    @anupambanerjee5222 3 роки тому

    Great explanation Sir.

  • @cskarthik9909
    @cskarthik9909 3 роки тому

    Awesome explanation

  • @sathblr
    @sathblr 4 роки тому

    Thanks for the nice video. I have a doubt in the step 'scale-space extrema detection'. For an octave: (considering 5 different scales of images created using Gaussian blur), we would be having 4 resulting DoG images from the previous step. So it's understandable to compare pixels from the 2nd DoG image with its neighbors from the 1st and the 3rd DoG images. Similarly, we could compare pixels from the 3rd DoG image with the 2nd and the 4th images. But how about the pixels in 1st and the 4th (topmost in that octave)? With whom should those be compared? Or we just consider only those in the middle (2nd and 3rd from the four DoG images from the previous step!!)

    • @pratikian
      @pratikian  4 роки тому +1

      We only consider those that are in middle . For more better understanding you can see the description i have put a link of visual interaction and explanation of algorithm please check that.

  • @yashikabarike72
    @yashikabarike72 4 роки тому

    excellent explanation!! Thankyou

  • @ximingwen2542
    @ximingwen2542 2 роки тому +1

    why this is a derivative of guassin?

    • @pratikian
      @pratikian  2 роки тому

      I did not understand your question. Is your question why is the laplacian of gaussian a derivative of gaussian ?

    • @iampossibledude
      @iampossibledude 2 роки тому

      Gaussian simply blurs the image (or we can say cancels the white noise). Besides, derivate of gaussian determines the changes in pixel values/edges. Therefore, for detecting edges it's necessary to use the derivative of gaussian.

  • @ExploreElectronics
    @ExploreElectronics 3 роки тому

    Very nice explanation

    • @ExploreElectronics
      @ExploreElectronics 3 роки тому

      How to contact you. I need bit of clarification on SIFT

    • @ExploreElectronics
      @ExploreElectronics 3 роки тому

      Can I use haris corner detector and then SIFT descriptor far face?

  • @Capt.Cooking
    @Capt.Cooking 4 роки тому

    Thank you man for this video. It's really helpful

    • @Capt.Cooking
      @Capt.Cooking 3 роки тому

      @Kaleb Omar nice try guys you are so believable omg..

  • @bijjalanaganithin3798
    @bijjalanaganithin3798 4 роки тому

    Thank You so much very well explained

  • @jpssasadara3624
    @jpssasadara3624 4 роки тому

    very nice explanation thanks sir..

  • @renjithnano5425
    @renjithnano5425 3 роки тому

    Great work man

  • @haiderabbasi145
    @haiderabbasi145 4 роки тому

    impressive man ,
    thumbs up

  • @throwawaylikemylife
    @throwawaylikemylife 4 роки тому

    WOW

  • @jevenrichard4251
    @jevenrichard4251 4 роки тому

    讲的挺好的,就是印度口音听着有点别扭