Giter Site home page Giter Site logo

Reference about dirt HOT 3 OPEN

pmh47 avatar pmh47 commented on June 10, 2024
Reference

from dirt.

Comments (3)

pmh47 avatar pmh47 commented on June 10, 2024

Unfortunately I don't have access to the notes just now -- they're handwritten papers sitting in a pile in another country! However, if you have any specific questions, I'm happy to answer.

from dirt.

cecabert avatar cecabert commented on June 10, 2024

Thanks @pmh47 for the clarification. I've actually some questions if you don't mind.

  • When you compute the spatial derivative in the image space, you use the scharr operator, is it for a specific reason ? I'm asking since the OpenDR uses either the sobel operator or the central difference.

  • Can provide some details on the edge dilation part starting there ? Is it similar to OpenDR where they ensure dat the filters (i.e. Sobel) does not cross the occluder's primitive boundary ?

Christophe

from dirt.

pmh47 avatar pmh47 commented on June 10, 2024
  • There is no particular reason for choosing the Scharr operator in this case. Any choice is an approximation; Scharr gives better results in some contexts, but may provide no benefit here. It would be interesting to compare results with different filters.

  • Consider a pixel that is over the background (not a triangle), but is immediately adjacent to one that is over a triangle. In that case, there should be a non-zero derivative of that background pixel as the edge moves towards it. 'Dilating' the triangle means that we consider this background pixel as if it were part of the triangle, giving the required result as that means the derivative is propagated to its vertices. For the case of an occluding edge, roughly the same thing happens. This is indeed related to what OpenDR does -- by dilating the occluder, we also ensure not to propagate a spurious gradient to the occluded triangle. In practice, this is complicated by the fact that a background pixel may be adjacent to multiple triangles, which means we should propagate gradients to each of them. In the current implementation, I don't do this, but instead consider only horizontal or vertical dilation based on the dominant gradient, and if there are triangles on both sides, pick one at random.

from dirt.

Related Issues (20)

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.