Readings in Computer Vision 1987
DOI: 10.1016/b978-0-08-051581-6.50065-9
|View full text |Cite
|
Sign up to set email alerts
|

The Laplacian Pyramid as a Compact Image Code

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

4
1,189
0
22

Year Published

1999
1999
2015
2015

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 1,025 publications
(1,215 citation statements)
references
References 6 publications
4
1,189
0
22
Order By: Relevance
“…2. At the end of each iteration of the SART, each reconstructed DBT slice is separated into high (HF) and low frequency (LF) bands using Laplacian pyramid decomposition (Burt and Adelson, 1983) in three scales. The resulting high frequency bands consist of noise and small structures including microcalcifications.…”
Section: Methodsmentioning
confidence: 99%
“…2. At the end of each iteration of the SART, each reconstructed DBT slice is separated into high (HF) and low frequency (LF) bands using Laplacian pyramid decomposition (Burt and Adelson, 1983) in three scales. The resulting high frequency bands consist of noise and small structures including microcalcifications.…”
Section: Methodsmentioning
confidence: 99%
“…Inspired by Grenander’s [22] analysis by synthesis theory of inference, and by Burt and Adelson’s [23] Laplacian pyramid for efficient coding, Mumford [24] proposed that the visual hierarchy might form an efficient image pyramid, and that vision is accomplished by an analysis process and a synthesis process in a close loop. Here, the feedforward computation extracts features and proposals, and the feedback computation synthesizes expectations based on the high level of interpretation of the proposals using the internal models.…”
Section: Varieties Of Internal Modelsmentioning
confidence: 99%
“…It is mainly required at the disocclusion stage. The coarse-tofine refinement step consists to propagate the displacement field and the self-occlusion map H using pyramid expansion operations [4]. The latter has to be binarized.…”
Section: The Cost Functionmentioning
confidence: 99%