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

Method for temporally adaptive filtering of frames of a noisy image sequence using motion estimation

Assignee: Intellectual Ventures Fund 83 LLC
•
Filing: 1991-05-09
•
Granted: 1997-02-04
•
Expires: 2011-05-09
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method of temporally adaptive filtering of the frames of an image sequence is disclosed. To filter the kth frame, first, the motion trajectories that transverse the pixel locations at the kth frame are determined using a motion estimation algorithm. Motion trajectories pass through a predetermined number of frames neighboring the kth frame. Image values at the neighboring frames, along motion trajectories are then evaluated. Temporally adaptive linear minimum mean square error (LMMSE) estimates of the image values at the pixel locations of the kth frame are determined using the image values along the motion trajectories. These steps are repeated for each of the other frames of the image sequence.

Inventors

  • 👤 Muhammed I. Sezan
  • 👤 Mehmet K. Ozkan
  • 👤 Sergei V. Fogel

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 18:56
CPC Classifications
G; G06; G06T; G06T7/00; G06T7/20; H; H04; H04N; H04N19/00; H04N19/50; H04N19/503; H04N19/51; H04N19/60; H04N19/61; H04N19/615; H04N19/63; H04N19/80; H04N5/00; H04N5/14; H04N5/21; H04N19/10; H04N19/102; H04N19/13

Claims Analysis

Total Claims: 20
Claim 1
Independent Claim 186 words
A method of temporally adaptive filtering frames of an image sequence in which each image of the sequence has pixel locations, comprising: (a) subdividing an image sequence into a plurality of frames; (b) determining motion trajectories of pixels that pass through the pixel locations at a kth frame using a motion estimation algorithm; (c) determining image values for a pixel originally located at a specific pixel location at the kth frame along the motion trajector of that pixel to the same or other pixel locations in other frames of the image sequence, and repeating for all pixel locations at the kth frame; (d) determining temporally adaptive linear minimum mean square error (LMMSE) estimates of the image value at each of the pixel locations at the kth frame based upon the determined image values; (e) repeating steps b, c and d for each of the other frames of the image sequence; (f) modifying the image values of the pixels at the pixel locations at each frame of the image sequence based upon the determined temporally adaptive LMMSE estimates; and (g) generating a temporally adaptive filtered image sequence.
Claim 2
Independent Claim 186 words
A method of temporally adaptive filtering frames of an image sequence in which each image of the sequence has pixel locations, comprising: (a) subdividing an image sequence into a plurality of frames; (b) determining motion trajectories of pixels that pass through the pixel locations at a kth frame using a motion estimation algorithm; (c) determining image values for a pixel originally located at a specific pixel location at the kth frame along the motion trajector of that pixel to the same or other pixel locations in other frames of the image sequence, and repeating for all pixel locations at the kth frame; (d) determining temporally adaptive linear minimum mean square error (LMMSE) estimates of the image value at each of the pixel locations at the kth frame based upon the determined image values; (e) repeating steps b, c and d for each of the other frames of the image sequence; (f) modifying the image values of the pixels at the pixel locations at each frame of the image sequence based upon the determined temporally adaptive LMMSE estimates; and (g) generating a temporally adaptive filtered image sequence.
Claim 3
Dependent Claim 58 words
The method of claim 1, wherein, for a pixel located at (m,n) in the kth frame, the motion trajectory τ m ,n,k is defined as a set of locations containing (m,n) as well as displaced locations corresponding to (m,n) in N-1 neighboring frames at times k-M, . . . k-1, k+1, . . . , k+M, where N=2M+1.
Claim 4
Dependent Claim 18 words
The method of claim 1, wherein step (b) further comprises estimating displacement vectors with the motion estimation algorithm.
Claim 5
Dependent Claim 38 words
The method of claim 3, wherein components of the displacement vector estimates are real-valued, such that the motion trajectories include subpixel locations, and wherein step (c) further comprises (f) determining image values at the subpixel locations by interpolation.
Claim 6
Dependent Claim 14 words
The method of claim 1, wherein the motion estimation algorithm is a spatiotemporal-gradient method.
Claim 7
Dependent Claim 13 words
The method of claim 5, wherein the spatiotemporal-gradient method is the Fogel algorithm.
Claim 8
Dependent Claim 56 words
The method of claim 1, wherein step (b) includes the steps of: (b) (1) forming a multiresolution representation of the image sequence; (b) (2) constraining a displacement vector field estimate using optical flow and directional smoothness constraints; (b) (3) obtaining a displacement vector field estimate using a variational principle; and (b) (4) solving the variational principle.
Claim 9
Dependent Claim 86 words
The method of claim 1, wherein the temporally local LMMSE estimate of the image value at pixel location (m,n) of the kth frame is determined according to the equation: ##EQU15## where σ f 2 (m,n;k)=max[0,σ g 2 (m,n;k)-σ v 2 (m,n;k)], and σ g 2 (m,n,;k) is the sample variance, and μ f (m,n;k)=μ g (m,n;k) is the sample mean of a degraded image sequence computed over the motion trajectory τ m ,n,k, and σ v 2 (m,n) denotes the sample variance of a noise process.
Claim 10
Dependent Claim 28 words
The method of claim 1, wherein step (b) includes estimating the motion trajectories from the kth frame to a predetermined number of contiguous frames in the image sequence.
Claim 11
Dependent Claim 19 words
The method of claim 9, wherein the predetermined number of contiguous frames are used to filter the kth frame.
Claim 12
Dependent Claim 25 words
The method of claim 1, wherein step (b) includes estimating the motion trajectories from the kth frame to a k-1 frame and a k+1 frame.
Claim 13
Dependent Claim 37 words
The method of claim 11, wherein the k-1, k and k+1 frames are filtered to produce three intermediate frames, these intermediate frames then being filtered to determine an estimate f(m,n,k) of the image value in step (d).
Claim 14
Dependent Claim 40 words
The method of claim 1, wherein the kth frame is filtered using N=2M+1 frames, the filtering being performed in M steps, and the LMMSE estimation is applied to groups of three frames where N is a predetermined number of frames.
Claim 15
Dependent Claim 90 words
The method of claim 1, wherein the temporally local LMMSE estimate of the image value at pixel location (m,n) of the kth frame is determined according to the equation: ##EQU16## where σ f 2 (m,n;k)=max[0,σ g 2 (m,n;k)-σ v 2 (m,n;k)], and σ g 2 (m,n;k) is the sample variance, and μ a f (m,n;k)= ##EQU17## is a motion-adaptive sample mean where the weight function is given by w(i,j,l)≐K(1+a.sup.2 max[ε.sup.2, (g(m,n,k)-g(i,j,l)).sup.2 ]).sup.-1, and the constant K is defined as K≐β(i,j,k-1)β(i,j,k)β(i,j,k+1)/[β(i,j,k-1)β(i,j,k)+β(i,j,k-1)β(i,j,k+1)+β(i,j,k)β(i,j,k+1)] the quantity β being given by, β(i,j,l)≐1+a.sup.2 (max[ε.sup.2, (g(m,n,k)-g(i,j,l)).sup.2 ]).
Claim 16
Dependent Claim 51 words
The method of claim 1, wherein the temporally local LMMSE estimate of the image value at pixel location (m,n) of the kth frame is determined according to the equation f(m,n,k)=μ a f (m,n,k) where μ a f (m,n,k) is a motion-adaptive sample mean value and f(m,n,k) is a filtered pixel value.
Claim 17
Independent Claim 179 words
A method of temporally adaptively filtering frames of an image sequence in which each image of the sequence has pixel locations, comprising: (a) subdividing an image sequence into a plurality of frames; (b) determining motion trajectories of pixels that pass through the pixel locations at a kth frame using a motion estimation algorithm; (c) determining image values for a pixel originally located at a specific pixel location at the kth frame along the motion trajectory of that pixel to the same or other pixel locations in other frames of the image sequence, and repeating for all pixel locations at the kth frame; (d) determining temporally adaptive estimates of image value at each of the pixel locations at the kth frame based upon the determined image values; (e) repeating steps b, c and d for each of the other frames of the image sequence; (f) modifying the image values of the pixels at the pixel locations at each frame of the image sequence based upon the determined temporally adaptive LMMSE estimates; and (g) generating a temporally adaptive filtered image sequence.
Claim 18
Independent Claim 179 words
A method of temporally adaptively filtering frames of an image sequence in which each image of the sequence has pixel locations, comprising: (a) subdividing an image sequence into a plurality of frames; (b) determining motion trajectories of pixels that pass through the pixel locations at a kth frame using a motion estimation algorithm; (c) determining image values for a pixel originally located at a specific pixel location at the kth frame along the motion trajectory of that pixel to the same or other pixel locations in other frames of the image sequence, and repeating for all pixel locations at the kth frame; (d) determining temporally adaptive estimates of image value at each of the pixel locations at the kth frame based upon the determined image values; (e) repeating steps b, c and d for each of the other frames of the image sequence; (f) modifying the image values of the pixels at the pixel locations at each frame of the image sequence based upon the determined temporally adaptive LMMSE estimates; and (g) generating a temporally adaptive filtered image sequence.
Claim 19
Dependent Claim 20 words
The method of claim 16, wherein step (d) includes median filtering along the motion trajectories to perform temporal noise filtering.
Claim 20
Dependent Claim 12 words
The method of claim 16, wherein step (d) includes edge-preserving spatial filtering.

References Cited (Backward Citations)

US4383272A Cited
US4482970A Cited
US4668986A Cited
US4745458A Cited
US4890160A Cited
US4760445A Cited
US4807034A Cited
US4864393A Cited
US4937667A Cited
US4989087A Cited
US5019903A Cited

USPTO Annuity & Maintenance Windows

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

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag