← Back to Patent Explorer
EP0610604A1 Expired / Lapsed EP ⏱️ 0.0 years remaining

Multiple processing of radiographic images based on a pyramidal image decomposition

Assignee: Agfa HealthCare NV
•
Filing: 1993-02-11
•
Granted: —
•
Expires: 2013-02-11
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract 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 Vuylsteke

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-11-09 13:33
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 125 words
A method of processing a digital representation of an original radiographic image, comprising steps of: 1)-transforming said image into a multiresolution representation which represents localised image detail at multiple scales, 2)-storing said multiresolution representation into a memory, 3)-producing at least two differently processed images by applying at least two individual processing cycles, each processing cycle comprising the steps of: 4)-retrieving said multiresolution representation from said memory, 5)-modifying the multiresolution representation at at least one resolution level according to a non-identity function of a neighbourhood of retrieved values, said neighbourhood consisting of values of the same resolution level which correspond to a spatially coherent region of pixels in said image, 6)-obtaining a processed image by applying the inverse of said transform to the modified multiresolution representation.
Claim 2
Dependent Claim 29 words
A method according to claim 1 wherein the multiresolution representation is a pyramidal representation wherein the number of pixels in each detail image decreases at each coarser resolution level.
Claim 3
Dependent Claim 39 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.
Claim 4
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 5
Dependent Claim 238 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 6
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 7
Dependent Claim 106 words
A method according to claim 1 wherein said multiresolution representation comprises detail transform images at multiple resolution levels and a residual coefficient, each detail image comprising a set of transform coefficients expressing the relative contribution to the original image of the corresponding basis function out of a set of predetermined basis functions, each of said functions representing local detail at a specific resolution level and being non-periodic, and having zero mean value, and wherein said transform is characterised by the existence of an inverse transform which returns the original image or a close approximation thereof when being applied to said transform coefficients and said residual coefficient.
Claim 8
Dependent Claim 12 words
A method according to claim 7 wherein said basis functions are orthogonal.
Claim 9
Dependent Claim 13 words
A method according to claim 7 wherein said basis functions are discrete wavelets.
Claim 10
Dependent Claim 46 words
A method according to claim 1 wherein said radiographic image is stored in a photostimulable phosphor screen and wherein said digital image representation is obtained by scanning said screen with stimulating irradiation, detecting light emitted upon stimulation and converting said detected light into a digital representation.
Claim 11
Dependent Claim 21 words
A method according to claim 1 wherein said function depends on the value of a corresponding pixel in said original image.
Claim 12
Dependent Claim 37 words
A method according to claim 1 wherein said function has a slope that gradually decreases with increasing argument values with the exception of a region of lowest absolute argument values where the slope is constant or increasing.
Claim 13
Dependent Claim 39 words
A method according to claim 1 wherein said function is not identically defined at each resolution level in said decomposition, such that modifications applied to finer resolution levels ampplify image detail more than modifications applied to intermediate resolution levels.
Claim 14
Dependent Claim 39 words
A method according to claim 1 wherein said function is not identically defined at each resolution level in said decomposition, such that modifications applied to coarser resolution levels amplify image detail less than modifications applied to intermediate resolution levels.
Claim 15
Dependent Claim 29 words
A method according to claim 1 wherein said values are modified as a function of the estimated amount of image content and in accordance with an estimated noise level.
Claim 16
Dependent Claim 21 words
A method according to claim 15 wherein said noise level is determined as the estimated noise level in each detail image.
Claim 17
Dependent Claim 87 words
A method according to claim 15 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.

References Cited (Backward Citations)

EP0152355A2 Cited
US4933775A Cited

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag