A novel framework for robust 3D tracing in electron micrographs is presented. The proposed framework is built using ideas from hypergraph diffusion, and achieves two main objectives. Firstly, the approach scales to trace hundreds of targets without noticeable increase in runtime complexity. Secondly, the framework yields flexibility to fuse top down (global cues as hyperedges) and bottom up (lo...

We apply powerful, recently discovered techniques for the list decoding of error-correcting codes to the problem of efficiently tracing traitors. Much work has focused on methods for constructing such traceability schemes, but the complexity of the traitor tracing algorithms has received little attention. A widely used traitor tracing algorithm, the TA algorithm, has a runtime of O(N) in genera...

The most straightforward image synthesis algorithm is to follow photon-like particles from luminaires through the environment. These particles scatter or are absorbed when they interact with a surface or a volume. They contribute to the image if and when they strike a sensor. Such an algorithm implicitly solves the light transport equation. Alternatively, adjoint photons can be traced from the ...

This paper presents an efficient algorithm for filtering multi-layer depth images (MDIs) in order to produce approximate penumbras. The filtering is performed on a MDI that represents the view from the light source. The algorithm is based upon both ray tracing and the z-buffer shadow algorithm, and is closely related to convolution methods. The method’s effectiveness is demonstrated on especial...

We introduce and analyze a randomized traitor tracing algorithm for broadcast security. This algorithm is very efficient compared to brute force methods (the mean time it takes is O(√T ) where T is the mean time taken by the brute force algorithm) and can catch traitors, i.e., dishonest users who collude by giving subsets of their key(s) to others. The system model we use can be applied to vari...