Tuesday, July 28, 2009

Lightcuts: a scalable approach to illumination (July 30)

http://www.cs.cornell.edu/~kb/projects/lightcuts/

Bruce Walter, Sebastian Fernandez, Adam Arbree, Kavita Bala, Michael Donikian, Donald P. Greenberg
Program of Computer Graphics, Cornell University

5 comments:

  1. I thought that clustering point sources of light to cut down the number of rays was pretty cool. It allows very complex scenes with many light sources to be rendered quickly. Seeing the chart which shows the sublinear growth function was impressive. The results were incredible; I couldn't tell the difference between the pictures that were generated with lightcuts and the original images. Another major breakthrough is that lightcuts can be used in different scenarios, such as area lighting, HDR lighting and indirect lighting.

    I didn't completely understand the lightcut algorithm. I can see the concept behind it, but it wasn't clear how the binary tree structure is used.

    I think the paper was well written. It reads pretty well and they didn't overwhelm the reader with equations. The accompanying video and presentations were helpful as well.

    It may be possible to improve the clustering algorithm that groups point sources of light, but overall, I don't think much more can be done. The algorithm is already extremely fast, especially with many point sources of light, and the results look incredible. With only a 2 percent difference between the reference image, the human eye can't see any errors.

    Since the authors refer to lightcuts as a framework, I would imagine that there are some libraries that can be used by developers. This would be very useful in games and renderers, like Maxwell Renderer.

    ReplyDelete
  2. a) what did you find interesting or novel about the paper?

    The speed they achieved is outstanding. They really didn't need to include the reference for their sample images. They could have just said "this looks perfect."

    b) what aspects of the paper were most difficult to understand?

    The overall principle of clustering lights was easy to grasp, and the light tree (christmas tree) was too. Many of the lower-level details in the implementation section were more difficult to conceptualize.

    c) was the paper well written?

    Yes. I very much appreciated their approach to marking up terms in their equations (well, their equation). It made it much easier to understand, having the names for the terms easy to see, rather than needing to hunt through the text above and below. Granted, it was an extremely simple equation anyway, but the same extra effort for marking up the equations would be greatly appreciated in other papers. The diagonal names they used in the presentation slides were even better.

    d) could the methods have been improved?

    Sure, the authors ideas for future work included adding more types of lighting, more BRDF types, and more types of illumination. They also mention visibility bounds, but I'm not clear on the defition.

    e) what possible applications does this have?

    Real-time ray tracing exists, but not at this level of quality. If it takes 150 seconds to render an image, we only need a computer that's 9000 times faster to get 60 fps. Under Moore's law, we'll only have to wait 14 years. :)

    --
    mwc

    ReplyDelete
  3. This article was interesting because it fascinates me
    how the lightcuts algorithm simulates light from
    different sources and creates a more realistic
    picture. The approach seemed novel in that
    this algorithm creates a light tree and produces
    the light by cutting across the tree.

    The layout of this article was decent.
    I like how the authors displayed diagrams to
    model what they were explaining. I also
    liked how the article was outlined.

    Using this algorithm, programmers can integrate
    more light sources in their images, thus producing
    more real world images.

    ReplyDelete
  4. I am really impresssed with the results obtained by this method. The autors designed a technique that performs extremely fast approximating illumination. As theu mention, the method can approximate tons of point lights by just using a small number of rays. I consider that the paper is very novel despte another close related technique has been developed (reconstruction cuts).

    I think that the paper was well written. They define how the document will be structured and give a forecasta of the information. They give a very detailed explanation of each step of their algorithm, making it easy to understand.

    I am not an expert in this area; therefore its hard for me to come up with a possible field of improvement for this technique due to its amazing results. The only efficency target I can suggest is the Light tree, it is unclear to me if the way it is traversed and created is the most efficient way.

    Finally, Lightcuts approach is a fast approximation to illumination and this implies that is has lots of applications in the video game and movie industries

    ReplyDelete
  5. Complex lighting is good and sublinear growth is better. I thought the paper had some really good-looking results, indistinguishable (to my eye) from "ground truth" images. I thought their tree hierarchy for lights was a good idea - distant groups of lights can be approximated by single lights.

    It's probably just a naming thing, but I wasn't sure what the geometric term in their light equation was supposed to be. Also, I was a bit lost in their explanation of the the error bounding terms.

    It seems like one drawback to this method is that it requires the user to manually convert area and complex lights into arrays of point lights. This could possibly be automated, but they made it sound like the best conversion was highly dependent on many different factors.

    ReplyDelete