← Back to Patent Explorer
US5644662A Expired / Lapsed US ⏱️ 0.0 years remaining

Multiple processing of radiographic images based on a pyramidal image decomposition

Assignee: Agfa HealthCare NV
•
Filing: 1995-03-28
•
Granted: 1997-07-01
•
Expires: 2015-03-28
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Multiple processing of radiographic images based on a pyramidal image decomposition. A method of multiple processing a digital representation of a radiographic image is disclosed that is based on a pyarmidal decomposition of said image. A pyramidal decomposition is stored and retrieved to be applied to at least two different processing cycles, processed images are obtained by application of a reconstruction algorithm.

Inventors

  • 👤 Pieter Paul Vuylsteke

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 16:53
CPC Classifications
G; G06; G06T; G06T5/00; G06T5/10; G06T5/20; G06T2207/00; G06T2207/10; G06T2207/10116; G06T2207/20; G06T2207/20016

Claims Analysis

Total Claims: 17
Claim 1
Independent Claim 183 words
A method of generating more than one differently processed image version originating from a single radiation image, comprising the steps of: 1. applying a decomposition transform to said radiation image to decompose it into a multiresolution representation which represents localized image detail at multiple resolution levels, 2. storing said multiresolution representation into a memory, 3. producing at least two differently processed image versions by applying at least two individual processing cycles to said multi-resolution representation, each processing cycle comprising the steps of: (i) retrieving said multiresolution representation from said memory, (ii) modifying the multiresolution representation at at least one resolution level by applying a non-linear monotonically increasing odd modifying function with a slope that gradually decreases with increasing argument values to elements of the multiresolution representation that belong to a same resolution level, (iii) obtaining a processed image representation by applying the inverse of said decomposition transform to the modified multiresolution representation, (iv) applying said processed image presentation to a hard copy recorder or to a display device to control generation of density values of a processed image version of said original image.
Claim 2
Independent Claim 183 words
A method of generating more than one differently processed image version originating from a single radiation image, comprising the steps of: 1. applying a decomposition transform to said radiation image to decompose it into a multiresolution representation which represents localized image detail at multiple resolution levels, 2. storing said multiresolution representation into a memory, 3. producing at least two differently processed image versions by applying at least two individual processing cycles to said multi-resolution representation, each processing cycle comprising the steps of: (i) retrieving said multiresolution representation from said memory, (ii) modifying the multiresolution representation at at least one resolution level by applying a non-linear monotonically increasing odd modifying function with a slope that gradually decreases with increasing argument values to elements of the multiresolution representation that belong to a same resolution level, (iii) obtaining a processed image representation by applying the inverse of said decomposition transform to the modified multiresolution representation, (iv) applying said processed image presentation to a hard copy recorder or to a display device to control generation of density values of a processed image version of said original image.
Claim 3
Dependent Claim 30 words
Method according to claim 1 wherein said slope decreases gradually with increasing argument values except for a region of lowest absolute argument values where the slope is constant or increasing.
Claim 4
Dependent Claim 55 words
A method according to claim 1 wherein said multiresolution representation is obtained as a sequence of detail images at multiple resolution levels and a residual image at a resolution level lower than the minimum of said multiple resolution levels and wherein the number of pixels in the detail images decreases at each coarser resolution level.
Claim 5
Dependent Claim 72 words
A method according to claim 3 wherein the detail image at the finest resolution level is obtained as the pixel wise difference between the original image and an image obtained by low pass filtering the original image, and wherein the successive coarser resolution level detail images are obtained by taking the pixelwise difference between two low pass filtered versions of the original image, the second having a smaller bandwidth than the former.
Claim 6
Dependent Claim 235 words
A method according to claim 3 wherein the detail images at successive coarser resolution levels are obtained as a result of K iterations of the following steps: a) computing an approximation image at a next coarser level by applying a low pass filter to the approximation image corresponding to the current iteration, ans subsampling the result in proportion to the reduction in spatial frequency bandwidth, using the original image as input to said low pass filter in the course of the first iteration; b) computing a detail image as the pixelwise difference between the approximation image corresponding to the current iteration and the approximation image at a next coarser resolution level computed according to the method sub 4a;both images being brought into register by proper interpolation of the latter image; and wherein the residual image is equal to the approximation image produced by the last iteration, and wherein said processed image is computed by iterating K times the following procedure starting from the coarsest detail image and the residual image: computing the approximation image at the current resolution level by pixelwise adding the modified detail image at the same resolution level to the approximation image at the coarser resolution level corresponding to the previous iteration, both images being brought into register by proper interpolation of the latter image, using the residual image instead of the coarser approximation image in the course of the first iteration.
Claim 7
Dependent Claim 26 words
A method according to claim 5 wherein said subsampling factor is 2, and said low-pass filter has an impulse response which approximates a two-dimensional gaussian distribution.
Claim 8
Dependent Claim 44 words
A method according to claim 1 wherein said digital image representation is obtained by scanning a photostimulable phosphor screen that has been exposed to said radiation image with stimulating irradiation, detecting light emitted upon stimulation and converting said detected light into a digital representation.
Claim 9
Dependent Claim 23 words
A method according to claim 1 wherein said modifying function depends on the pixel value of a corresponding pixel in said original image.
Claim 10
Dependent Claim 39 words
A method according to claim 1 wherein said modifying function is not identical for each resolution level in said decomposition, such that modifications applied to finer resolution levels amplify image detail more than modifications applied to intermediate resolution levels.
Claim 11
Dependent Claim 38 words
A method according to claim 1 wherein different modifying functions are used for different resolution levels in said decomposition, such that modifications applied to coarser resolution levels amplify image detail less than modifications applied to intermediate resolution levels.
Claim 12
Dependent Claim 36 words
A method according to claim 1 wherein said multi-resolution representation is modified to an extent that depends on an estimation of the amount of variance in the image and in accordance with an estimated noise level.
Claim 13
Dependent Claim 21 words
A method according to claim 11 wherein said noise level is determined as the estimated noise level in each detail image.
Claim 14
Dependent Claim 86 words
A method according to claim 11 wherein a set of noise suppression functions are computed, each being associated with one of said detail images, said functions being monotonically non-decreasing in one variable and parametrically depending on said noise variance in a non-increasing monotonic way and said suppression functions being positive and asymptotically reaching a maximum value equal to one and wherein each detail image is attenuated by multiplying it with an associated noise suppression function evaluated at an abscissa equal to said local detail image variance.
Claim 15
Dependent Claim 10 words
The visual image produced by the process of claim 1.
Claim 16
Dependent Claim 10 words
The visual image produced by the process of claim 3.
Claim 17
Dependent Claim 10 words
The visual image produced by the process of claim 7.

References Cited (Backward Citations)

US4718104A Cited
US4709394A Cited
US5163103A Cited
US5086488A Cited
US5048111A Cited
US4969204A Cited
US5229618A Cited
US5119195A Cited
US5434931A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2000-06-30 2000-12-30 2001-07-01 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2004-06-30 2004-12-30 2005-07-01 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2008-06-30 2008-12-30 2009-07-01 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag