# The Laplacian Pyramid as a Compact Image Code

##### Citations

20,028 citations

17,693 citations

9,803 citations

### Cites background from "The Laplacian Pyramid as a Compact ..."

...antic segmentation results in Section5. Combining feature hierarchies We fuse features across layers to deﬁne a nonlinear local-to-global representation that we tune end-to-end. The Laplacian pyramid [26] is a classic multi-scale representation made of ﬁxed smoothing and differencing. The jet of Koenderink and van Doorn [27] is a rich, local feature deﬁned by compositions of partial derivatives. In th...

[...]

... the model make local predictions that respect global structure. This crossing of layers and resolutions is a learned, nonlinear counterpart to the multi-scale representation of the Laplacian pyramid [26]. By analogy to the jet of Koenderick and van Doorn [27], we call our feature hierarchy the deep jet. Layer fusion is essentially an elementwise operation. However, the correspondence of elements acro...

[...]

^{1}

8,588 citations

7,458 citations

### Cites methods from "The Laplacian Pyramid as a Compact ..."

...We use the coefficients 1/16{1, 4, 6, 4, 1}, the same ones used in Burt and Adelson’s [26] Laplacian pyramid....

[...]

##### References

4,231 citations

927 citations

### "The Laplacian Pyramid as a Compact ..." refers background in this paper

...The difference between these two functions is similar to the "Laplacian" operators commonly used in image enhancement [13]....

[...]

^{1}

551 citations

### "The Laplacian Pyramid as a Compact ..." refers background in this paper

...These steps are then repeated to compress the low-pass image....

[...]

442 citations

### "The Laplacian Pyramid as a Compact ..." refers background or methods in this paper

...This is a very algorithm, requiring fewer computational steps to compute a set of filtered than are required by the fast Fourier transform to compute a single filtered image [ 2 ]....

[...]

...A suitable fast algorithm has recently been developed [ 2 ] and will be described in the section....

[...]

...This weighting pattern, called the generating kernel, is chosen t o certain constraints [ 2 ]....

[...]

...A graphical representation of this process in one dimension i s given in Fig. 1. The of the function is not [ 2 ]....

[...]