US 9,811,901 B2Grant

Linear-based Eulerian motion modulation

Issue Date:2017-11-07

•13 Claims

•17 Drawing Sheets

Abstract

In one embodiment, a method of amplifying temporal variation in at least two images comprises examining pixel values of the at least two images. The temporal variation of the pixel values between the at least two images can be below a particular threshold. The method can further include applying signal processing to the pixel values.

Metadata

Assignees

Massachusetts Institute of Technology
Quanta Computer Inc.

Inventors

Hao-yu Wu
Michael Rubinstein
Eugene Inghaw Shih
John V. Guttag
Frederic Durand
William T. Freeman

Application Information

Application Number:US 13/850,717

Filing Date:2013-03-26

Priority Date:2012-09-07

Art Unit:2665

Classifications

IPC:

G06K9/00G06T7/00G06T7/254G06T7/262

Patent Drawings (17 sheets)

Description

Related Applications

[0001] This application is a continuation-in-part of U.S. application Ser. No. 13/607,173, filed Sep. 7, 2012 and this application is a continuation-in-part of U.S. application Ser. No. 13/707,451, filed Dec. 6, 2012.

Government Support

[0002] This invention was made with government support under 1111415 from the National Science Foundation. The government has certain rights in the invention.

Background of the Invention

[0003] The human visual system has limited spatio-temporal sensitivity, but many signals that fall below its sensitivity threshold can be informative. For example, human skin color varies slightly corresponding to blood circulation. This variation, while invisible to the naked eye, can be exploited to extract pulse rate or to visualize blood flow. Similarly, motion with low spatial amplitude, while hard or impossible for humans to see, can be magnified to reveal interesting mechanical behavior.

Summary of the Invention

[0004] In one embodiment, a method of amplifying temporal variation in at least two images comprises examining pixel values of the at least two images. The temporal variation of the pixel values between the at least two images can be below a particular threshold. The method can further include applying signal processing to the pixel values.

[0005] In another embodiment, applying signal processing can amplify the variations of the pixel values between the at least two images. The signal processing can be temporal processing. The temporal processing can be a bandpass filter or be performed by a bandpass filter. The bandpass filter can be configured to analyze frequencies over time. Applying signal processing can include spatial processing. Spatial processing can remove noise.

[0006] In another embodiment, the method can include visualizing a pattern of flow of blood in a body shown in the at least two images.

[0007] In another embodiment, a system for amplifying temporal variation in at least two images can include a pixel examination module configured to examine pixel values of the at least two images. The temporal variation of the pixel values between the at least two images can be below a particular threshold. The system can further include a signal processing module configured to apply signal processing to the pixel values.

[0008] The signal processing module can be further configured to amplify variations of the pixel values between the at least two images. The signal processing module can be further configured to employ temporal processing. The temporal processing can be a bandpass filter or performed by a bandpass filter. The bandpass filter can be configured to analyze frequencies over time. The signal processing module can be further configured to perform spatial processing. The spatial processing can remove noise.

Brief Description of the Drawings

[0009] The patent or application file contains at least one drawing executed in color. Copies of this patent or patent application publication with color drawings will be provided by the Office upon request and payment of the necessary fee.

[0010] The foregoing will be apparent from the following more particular description of example embodiments of the invention, as illustrated in the accompanying drawings in which like reference characters refer to the same parts throughout the different views. The drawings are not necessarily to scale, emphasis instead being placed upon illustrating embodiments of the present invention.

[0011] FIGS. 1A-H are example frames illustrating Eulerian Video Magnification framework for visualizing the human pulse in a series of frames.

[0012] FIGS. 1I-J illustrate how Eulerian Video Magnification amplifies the periodic color variation.

[0013] FIG. 2 is an illustration of a temporal processing module employing the Eulerian video magnification framework.

[0014] FIG. 3 is a chart illustrating that temporal filtering can approximate spatial translation.

[0015] FIGS. 4A-D are charts illustrating motion amplification on a 1D signal for different spatial frequencies and α values.

[0016] FIGS. 5A-B are charts illustrating motion magnification error, computed as the L₁-norm between the true motion-amplified signal (FIG. 4A) and the temporally-filtered result (FIG. 4B), as function of wavelength, for different values of δ(t), (FIG. 5A), and α, (FIG. 5B).

[0017] FIG. 6 is a graph illustrating amplification factor, α, as a function of spatial wavelength λ, for amplifying motion.

[0018] FIGS. 7A-B are illustrations showing Eulerian video magnification used to amplify subtle motions of blood vessels arising from blood flow.

[0019] FIG. 8 illustrates representative frames 810, 820, 830, 840, 850, and 860 from additional videos demonstrating the process.

[0020] FIGS. 9A-D are graphs illustrating the frequency responses of some of the temporal filters.

[0021] FIGS. 10A-B are diagrams illustrating selective motion amplification on a synthetic sequence.

[0022] FIG. 11A illustrates frame from the face video (FIG. 1) with white Gaussian noise added.

[0023] FIG. 11B illustrates intensity traces over time for the pixel marked blue on the input frame, showing the trace obtained when the (noisy) sequence is processed with the same spatial filter used to process the original face sequence, a separable binomial filter of size 20.

[0024] FIG. 11C shows the trace when using a filter tuned according to the estimated radius in Eq. 15, a binomial filter of size 80.

[0025] FIGS. 12A-C are diagrams illustrating a comparison between Eulerian and Lagrangian motion magnification on a synthetic sequence with additive noise.

[0026] FIG. 13 is a flow diagram illustrating an example embodiment of the Eulerian embodiment of the method described herein.

[0027] FIG. 14 illustrates a computer network or similar digital processing environment in which the present invention may be implemented.

[0028] FIG. 15 is a diagram of the internal structure of a computer (e.g., client processor/device or server computers) in the computer system of FIG. 14.

Detailed Description of the Invention

[0029] A description of example embodiments of the invention follows.

[0030] The method described herein (a) reveals temporal variations in videos that are difficult or impossible to see with the naked eye and (b) displays the temporal variations in an indicative manner. The method, called Eulerian Video Magnification, inputs a standard video sequence, applies spatial decomposition, and applies temporal filtering to the frames. The resulting signal is then amplified to reveal hidden information. This method can, for example, visualize flow of blood filling a face in a video and also amplify and reveal small motions. The method can run in real time to show phenomena occurring at temporal frequencies selected by the user.

[0031] FIGS. 1A-H are example frames illustrating Eulerian Video Magnification framework for visualizing the human pulse in a series of frames. FIGS. 1A-D illustrate four frames from the original video sequence showing a face. FIGS. 1E-H illustrate four frames with the subject's pulse signal amplified. FIG. 1I is a chart illustrating a vertical scan line from the input and FIG. 1J is a chart illustrating a vertical scan line from the output videos plotted over time. FIGS. 1I-J illustrate how Eulerian Video Magnification amplifies the periodic color variation shown in spatiotemporal YT slices. In the input sequence (FIGS. 1A-D) the signal is imperceptible, but the variation is clear in the magnified sequence.

[0032] The success of these tools motivates the development of new techniques to reveal invisible signals in videos. A combination of spatial and temporal processing of videos can amplify subtle variations that reveal important aspects of the world.

[0033] The method described herein considers a time series of color values at any spatial location (e.g., a pixel) and amplifies variation in a given temporal frequency band of interest. For example, in FIG. 1, the method selects and then amplifies a band of temporal frequencies including plausible human heart rates. The amplification reveals the variation of redness as blood flows through the face. For this application, lower spatial frequencies are temporally filtered (spatial pooling) to allow a subtle input signal to rise above the camera sensor and quantization noise.

[0034] The temporal filtering approach not only amplifies color variation, but can also reveal low-amplitude motion. For example, the method can enhance the subtle motions around the chest of a breathing baby. The method's mathematical analysis employs a linear approximation related to the brightness constancy assumption used in optical flow formulations. The method also derives the conditions under which this approximation holds. This leads to a multiscale approach to magnify motion without feature tracking or motion estimation.

[0035] Previous attempts have been made to unveil imperceptible motions in videos. For example, a method, described in Liu et al. 2005, analyzes and amplifies subtle motions and visualizes deformations that are otherwise invisible. Another method, described in Wang et al. 2006, proposes using a Cartoon Animation Filter to create perceptually appealing motion exaggeration. These approaches follow a Lagrangian perspective, in reference to fluid dynamics where the trajectory of particles is tracked over time. As such, they rely on accurate motion estimation, which is computationally expensive and difficult to make artifact-free, especially at regions of occlusion boundaries and complicated motions. Moreover, the method of Liu et al. 2005 shows that additional techniques, including motion segmentation and image in-painting, are required to produce good quality synthesis. This increases the complexity of the algorithm further.

[0036] In contrast, the Eulerian perspective observes properties of a voxel of fluid, such as pressure and velocity, which evolve over time. The method studies and amplifies the variation of pixel values over time, in a spatially-multiscale manner. The Eulerian approach to motion magnification does not explicitly estimate motion, but rather exaggerates motion by amplifying temporal color changes at fixed positions. The method employs differential approximations that form the basis of optical flow algorithms.

[0037] Temporal processing has been used previously to extract invisible signals, such as in Poh et al. 2010 (hereinafter “Poh”) and to smooth motions, such as in Fuchs et al. 2010 (hereinafter “Fuchs”). For example, Poh describes extracting a heart rate from a video of a face based on the temporal variation of the skin color, which is normally invisible to the human eye. Poh focuses on extracting a single number, whereas the method described herein employs localized spatial pooling and bandpass filtering to extract and reveal visually the signal corresponding to the pulse. This primal domain analysis allows amplification and visualization of the pulse signal at each location on the face. This has important potential monitoring and diagnostic applications to medicine, where, for example, the asymmetry in facial blood flow can be a symptom of arterial problems.

[0038] Fuchs uses per-pixel temporal filters to dampen temporal aliasing of motion in videos. Fuchs also describes the high-pass filtering of motion, but mostly for non-photorealistic effects and for large motions. In contrast, the method described herein strives to make imperceptible motions visible using a multiscale approach. The method described herein excels at amplifying small motions, in one embodiment.

[0039] First, nearly invisible changes in a dynamic environment can be revealed through Eulerian spatio-temporal processing of standard monocular video sequences. Moreover, for a range of amplification values that is suitable for various applications, explicit motion estimation is not required to amplify motion in natural videos. The method is robust and runs in real time. Second, an analysis of the link between temporal filtering and spatial motion is provided and shows that the method is best suited to small displacements and lower spatial frequencies. Third, a single framework can amplify both spatial motion and purely temporal changes (e.g., a heart pulse) and can be adjusted to amplify particular temporal frequencies—a feature which is not supported by Lagrangian methods. Fourth, we analytically and empirically compare Eulerian and Lagrangian motion magnification approaches under different noisy conditions. To demonstrate our approach, we present several examples where our method makes subtle variations in a scene visible.

[0040] Space-time Video Processing

[0041] FIG. 2 is an illustration of a temporal processing module employing the Eulerian video magnification framework. The spatial decomposition module 204 of system first decomposes the input video 202 into different spatial frequency bands 206, then applies the same temporal filter to the spatial frequency bands 206. The outputted filtered spatial bands 210 are then amplified by an amplification factor 212, added back to the original signal by adders 214, and collapsed by a reconstruction module 216 to generate the output video 218. The temporal filter 208 and amplification factors 212 can be tuned to support different applications. For example, the system can reveal unseen motions of a Digital SLR camera, caused by the flipping mirror during a photo burst.

[0042] The method as illustrated by FIG. 2 combines spatial and temporal processing to emphasize subtle temporal changes in a video. The method decomposes the video sequence into different spatial frequency bands. These bands might be magnified differently because (a) they might exhibit different signal-to-noise ratios or (b) they might contain spatial frequencies for which the linear approximation used in motion magnification does not hold. In the latter case, the method reduces the amplification for these bands to suppress artifacts. When the goal of spatial processing is to increase temporal signal-to-noise ratio by pooling multiple pixels, the method spatially low-pass filters the frames of the video and downsamples them for computational efficiency. In the general case, however, the method computes a full Laplacian pyramid.

[0043] The method then performs temporal processing on each spatial band. The method considers the time series corresponding to the value of a pixel in a frequency band and applies a bandpass filter to extract the frequency bands of interest. As one example, the method may select frequencies within the range of 0.4-4 Hz, corresponding to 24-240 beats per minute, if the user wants to magnify a pulse. If the method extracts the pulse rate, it can employ a narrow frequency band around that value. The temporal processing is uniform for all spatial levels and for all pixels within each level. The method then multiplies the extracted bandpassed signal by a magnification factor α. This factor can be specified by the user, and may be attenuated automatically according to guidelines described later in this application. Next, the method adds the magnified signal to the original signal and collapses the spatial pyramid to obtain the final output. Since natural videos are spatially and temporally smooth, and since the filtering is performed uniformly over the pixels, the method implicitly maintains spatiotemporal coherency of the results.

[0044] 3 Eulerian Motion Magnification

[0045] The present method can amplify small motion without tracking motion as in Lagrangian methods. Temporal processing produces motion magnification, shown using an analysis that relies on the first-order Taylor series expansions common in optical flow analyses.

[0046] 3.1 First-order Motion

[0047] To explain the relationship between temporal processing and motion magnification, the case of a 1D signal undergoing translational motion is informative. This analysis generalizes to locally-translational motion in 2D.

[0048] Function I(x, t) denotes the image intensity at position x and time t. Since the image undergoes translational motion, can be expressed as the observed intensities with respect to a displacement function δ(t), I(x, t)=ƒ(x+δ(t)) and such that I(x, 0)=ƒ(x). The goal of motion magnification is to synthesize the signal
Î(x,t)=ƒ(x+(1+α)δ(t)) (1)

[0049] for some amplification factor α. Assuming the image can be approximated by a first-order Taylor series expansion, the image at time t, ƒ(x+δ(t)) in a first-order Taylor expansion about x, can be written as

[0050]

\begin{matrix} I (x, t) \approx f (x) + δ (t) \frac{\partial f (x)}{\partial x} . & (2) \end{matrix}

[0051] Function B(x, t) is the result of applying a broadband temporal bandpass filter to I(x, t) at every position x (picking out everything except ƒ(x) in Eq. 2). For now, assume the motion signal, δ(t), is within the passband of the temporal bandpass filter. Then,

[0052]

\begin{matrix} B (x, t) = δ (t) \frac{δ f (x)}{δ x} . & (3) \end{matrix}

[0053] The method then amplifies that bandpass signal by α and adds it back to I(x, t), resulting in the processed signal
Ĩ(x,t)=I(x,t)+αB(x,t). (4)

[0054] Combining Eqs. 2, 3, and 4 results in

[0055]

\begin{matrix} \hat{I} (x, t) \approx f (x) + (1 + α) δ (t) \frac{δ f (x)}{δ x}, & (5) \end{matrix}

[0056] Assuming the first-order Taylor expansion holds for the amplified larger perturbation, (1+α)δ(t), the amplification of the temporally bandpassed signal can be related to motion magnification. The processed output is simply
Ĩ(x,t)≈ƒ(x+(1+α)δ(t)). (6)

[0057] This shows that the processing magnifies motions—the spatial displacement δ(t) of the local image ƒ(x) at time t has been amplified to a magnitude of (1+α).

[0058] FIG. 3 is a chart 300 illustrating that temporal filtering can approximate spatial translation. This effect is demonstrated here on a 1D signal, but applies to 2D. The input signal is shown at two time instants: I(x, t)=ƒ(x) at time t and I(x, t+1)=ƒ(x+δ) at time t+1. The first order Taylor series expansion of I(x, t+1) about x approximates the translated signal. The temporal bandpass is amplified and added to the original signal to generate a larger translation. In this example α=1, magnifying the motion by 100%, and the temporal filter is a finite difference filter, subtracting the two curves.

[0059] This process is illustrated for a single sinusoid in FIG. 3. For a low frequency cosine wave and a relatively small displacement, δ(t), the first-order Taylor series expansion approximates the translated signal at time t+1. When boosting the temporal signal by α and adding it back to I(x, t), the Taylor series approximates that the expansion wave is translated by (1+α)δ.

[0060] For completeness, in a more general case, δ(t) is not entirely within the passband of the temporal filter, δ_k(t), indexed by k, and represents the different temporal spectral components of δ(t). Each δ_k(t) is attenuated by the temporal filtering by a factor λ_k. This results in a bandpassed signal,

[0061]

\begin{matrix} B (x, t) = \sum_{k} Υ k δ k (t) \frac{δ f (x)}{δ x} & (7) \end{matrix}

[0062] (compare with Eq. 3). Because of the multiplication in Eq. 4, this temporal frequency dependent attenuation can equivalently be interpreted as a frequency-dependent motion magnification factor, α_k=λ_kα.

[0063] 3.2 Bounds

[0064] In practice, the assumptions in Sect. 3.1 hold for smooth images and small motions. For quickly changing image functions (i.e., high spatial frequencies), ƒ(x), the first-order Taylor series approximations becomes inaccurate for large values of the perturbation, 1+αδ(t), which increases both with larger magnification α and motion δ(t). FIGS. 4 and 5 demonstrate the effect of higher frequencies, larger amplification factors and larger motions on the motion-amplified signal of a sinusoid.

[0065] As a function of spatial frequency, ω, the process derives a guide for how large the motion amplification factor, α, can be given the observed motion δ(t). For the processed signal, Ĩ(x, t) to be approximately equal to the true magnified motion, Î(x, t), the process seeks the conditions under which

[0066]

\begin{matrix} \overline{I} (x, t) \approx \hat{I} (x, t) \Rightarrow f (x) + (1 + α) δ (t) \frac{\partial f (x)}{\partial x} \approx f (x + (1 + α) δ (t)) & (8) \end{matrix}

[0067] FIGS. 4A-D are charts illustrating motion amplification on a 1D signal for different spatial frequencies and α values. For FIGS. 4A and 4C, λ=2π and

[0068]

δ (1) = \frac{π}{8}

is the true translation. For FIGS. 4B and 4D, λ=π and

[0069]

δ (1) = \frac{π}{8} .

FIGS. 4A-B illustrate the true displacement (e.g., true motion amplification, true motion application being represented by I(x,t)=ƒ(x+(1+α)δ(t))) of I(x, 0) by (1+α)δ(t) at time t=1, colored from blue (small amplification factor) to red (high amplification factor). FIG. 4C-D illustrate the amplified displacement (e.g., motion amplification via temporal filter, the motion amplification represented by I(x,t)=I(x,t)+αB(x,t)) produced by the filter of the present method, with colors corresponding to the correctly shifted signals in (a). Referencing Eq. 13, the red (far right) curves of each plot correspond to

[0070]

(1 + α) δ (t) = \frac{λ}{4}

for the left plot, and

[0071]

(1 + α) δ (t) = \frac{λ}{2}

for the right plot, showing the mild, then severe, artifacts introduced in the motion magnification from exceeding the bound on (1+α) by factors of 2 and 4, respectively.

[0072] FIGS. 5A-B are charts 500 and 520, respectively, illustrating motion magnification error, computed as the L₁-norm between the true motion-amplified signal (e.g., FIGS. 4A-B) and the temporally-filtered result (e.g., FIG. 4C-D), as function of wavelength, for variable values of δ(t) and a constant value of α, (FIG. 5A), and variable values of α and a constant value of δ(t), (FIG. 5B). In FIG. 5A, the constant value of α is 1, and in FIG. 5B, the constant value of δ(t) is 2. The markers on each curve represent a derived cutoff point

[0073]

\begin{matrix} (1 + α) δ (t) = \frac{λ}{8} . & (Eq . 13) \end{matrix}

[0074] Let ƒ(x)=cos(ωx) for spatial frequency ω, and denote β=1+α. The process requires that
cos(ωx)−βωδ(t)sin(ωx)≈cos(ωx+βωδ(t)) (9)

[0075] Using the addition law for cosines,
cos(ωx)−βωδ(t)sin(ωx)=cos(ωx)cos βωδ(t))−sin(ωx)sin βωδ(t)) (10)

[0076] Hence, the following should approximately hold
cos(βωδ(t))≈1 (11)
sin(βωδ(t))≈βδ(t)ω (12)

[0077] FIG. 6 is a graph 600 illustrating a preferred amplification factor, α, as a function of spatial wavelength λ, for amplifying motion. The preferred amplification factor is fixed to a for spatial bands that are within the derived bound (Eq. 13), and is attenuated linearly for higher spatial frequencies.

[0078] The small angle approximations of Eqs. (11) and (12) hold to within 10% for

[0079]

βωδ (t) \leq \frac{π}{4}

(the sine term is the leading approximation which gives

[0080]

\sin (\frac{π}{4}) = 0.9 * \frac{π}{4}) .

In terms of the spatial wavelength,

[0081]

λ = \frac{2 π}{ω},

of the moving signal, this gives

[0082]

\begin{matrix} (1 + α) δ (t) < \frac{λ}{8} . & (13) \end{matrix}

[0083] Eq. 13 above provides the sought after guideline, giving the largest motion amplification factor, α, compatible with accurate motion magnification of a given video motion δ(t) and image structure spatial wavelength, λ. FIG. 4B shows the motion magnification errors for a sinusoid when α is boosted beyond the limit in Eq. 13. In some videos, violating the approximation limit can be perceptually preferred and the λ cutoff is a user-modifiable parameter in the multiscale processing.

[0084] This suggests a scale-varying process: use a specified α magnification factor over some desired band of spatial frequencies, then scale back for the high spatial frequencies (found from Eq. 13 or specified by the user) where amplification gives undesirable artifacts. FIG. 6 shows such a modulation scheme for α. Although areas of high spatial frequencies (sharp edges) are generally amplified less than lower frequencies, the resulting videos to contain perceptually appealing magnified motion. Such effect is also exploited in the earlier work of Freeman et al. [1991] to create the illusion of motion from still images.

[0085] Testing results can be generated using non-optimized MATLAB code on a machine with a six-core processor and 32 GB RAM. The computation time per video is on the order of a few minutes. A separable binomial filter of size five constructs the video pyramids. A prototype application allows users to reveal subtle changes in real-time from live video feeds, essentially serving as a microscope for temporal variations. It is implemented in C++, can be CPU-based, and processes 640×480 videos at 45 frames per second on a standard laptop, but can be further accelerated by utilizing GPUs.

[0086] To process an input video by Eulerian video magnification, a user takes four steps: (1) select a temporal bandpass filter; (2) select an amplification factor, α; (3) select a spatial frequency cutoff (specified by spatial wavelength, λ_c) beyond which an attenuated version of α is used; and (4) select the form of the attenuation for α—either force α to zero for all λ<λ_c, or linearly scale a down to zero. The frequency band of interest can be chosen automatically in some cases, but it is often important for users to be able to control the frequency band corresponding to their application. In our real-time application, the amplification factor and cutoff frequencies are all customizable by the user.

[0087] FIGS. 7A-B are illustrations 700 and 710, respectively, showing Eulerian video magnification used to amplify subtle motions of blood vessels (e.g., a radial artery 714 and an ulnar artery 716) arising from blood flow. For this video, the temporal filter is turned to a frequency band that includes the heart rate—0.88 Hz (53 bpm)—and the amplification factor is set to α=10. To reduce motion magnification of irrelevant objects, a user-given mask amplifies the area near the wrist only. Movement of the radial artery 714 and the ulnar artery 716 can barely be seen in the input video of FIG. 7A taken with a standard point-and-shoot camera, but is significantly more noticeable in the motion-magnified output shown in FIG. 7B. The motion of the pulsing arteries is more visible when observing a spatio-temporal YT slice 712 of the wrist (a) and (b).

[0088] FIG. 8 illustrates representative frames 810, 820, 830, 840, 850, and 860 from additional videos demonstrating the process.

[0089] The process first selects the temporal bandpass filter to pull out the motions or signals to be amplified (step 1 above). The choice of filter is generally application dependent. For motion magnification, a filter with a broad passband is preferred; for color amplification of blood flow, a narrow passband produces a more noise-free result.

[0090] FIGS. 9A-D are graphs 900, 910, 920, and 930, respectively, illustrating the frequency responses of a respective temporal filters. Ideal bandpass filters are used for color amplification, since they have passbands with sharp cutoff frequencies. Low-order IIR filters can be useful for both color amplification and motion magnification and are convenient for a real-time implementation. In general, two first-order lowpass IIR filters with cutoff frequencies ω_land ω_hare used to construct an IIR bandpass filter.

[0091] The process selects the desired magnification value, α, and spatial frequency cutoff, λ_c(steps 2 and 3). While Eq. 13 can be a guide, in practice, a user can try various α and λ_cvalues to achieve a desired result. The user can select a higher a that violates the bound to exaggerate specific motions or color changes at the cost of increasing noise or introducing more artifacts. In some cases, the user can account for color clipping artifacts by attenuating the chrominance components of each frame. The method achieves this by doing all the processing in the YIQ space. The user can attenuate the chrominance components, I and Q, before conversion to the original color space.

[0092] For human pulse color amplification, where emphasizing low spatial frequency changes is essential, the process may force α=0 for spatial wavelengths below λ_c. For motion magnification videos, the user can choose to use a linear ramp transition for α (step 4).

[0093] The ideal filters, the frequency response of which is illustrated by graphs 900 and 910 of FIGS. 9A-B, are implemented using a discrete cosine transform (DCT). The graph 900 of FIG. 9A illustrates the frequency response of an ideal filter from 0.8-1 Hz. The graph 900 is a transform of the “face” video, the representative frame 820 of which is illustrated in FIG. 8. The graph 910 of FIG. 9B illustrates the frequency response of an ideal filter from 175-225 Hz. The graph 910 is a transform of the “guitar” video, the representative frame 830 of which is illustrated in FIG. 8. The Butterworth filter, the frequency response of which is illustrated by graph 920 of FIG. 9C, converts a user-specified frequency band to a second-order IIR structure and is used in our real-time application. The graph 920 of FIG. 9C illustrates the frequency response of the Butterworth filter from 3.6-6.2 Hz. The graph 920 is a transform of the “subway” video, the representative frame 840 of which is illustrated in FIG. 8. The second-order IIR filter, the frequency response of which is illustrated by graph 930 of FIG. 9D, also allows user input to perform its transform. Second-order filters have a broader passband than an ideal filter. The graph 930 of FIG. 9D illustrates the frequency response to a pulse detection.

[0094] The method was evaluated for color amplification using a few videos: two videos of adults with different skin colors and one of a newborn baby. An adult subject with lighter complexion is shown in face (e.g., FIG. 1), while an individual with darker complexion is shown in face2 (e.g., FIG. 8). In both videos, the objective is to amplify the color change as the blood flows through the face. In both face and face2, a Laplacian pyramid is applied and α is set for the finest two levels to 0. Essentially, each frame is downsampled and applied a spatial lowpass filter to reduce both quantization and noise and to boost the subtle pulse signal. For each video, the method then passes each sequence of frames through an ideal bandpass filter with a passband of 0.83 Hz to 1 Hz (50 bpm to 60 bpm). Finally, a large value of α≈100 and λ_c≈1000 is applied to the resulting spatially lowpass signal to emphasize the color change as much as possible. The final video is formed by adding this signal back to the original. The final video shows periodic green to red variations at the heart rate and how blood perfuses the face.

[0095] baby2 is a video of a newborn recorded in situ at the Nursery Department at Winchester Hospital in Massachusetts. In addition to the video, ground truth vital signs from a hospital grade monitor are obtained. This information confirms the accuracy of the heart rate estimate and verifies that the color amplification signal extracted from our method matches the photoplethysmogram, an optically obtained measurement of the perfusion of blood to the skin, as measured by the monitor.

[0096] FIGS. 10A-B are diagrams 1000, and 1010 and 1020, respectively, an synthetic input sequence (FIG. 10A) and respective selective motion amplification responses (FIG. 10B, 1010, 1020). The video sequence contains blobs 1002, 1004, 1006, 1008 oscillating at temporal frequencies of 7 Hz, 5 Hz, 3 Hz, and 2 Hz, respectively, as shown on the input frame. The method uses an ideal temporal bandpass filter of 1-3 Hz to amplify only the motions occurring within the specified passband. In FIG. 10B, the spatio-temporal slices from the resulting video show the different temporal frequencies and the amplified motion of the blob oscillating at 2 Hz. The space-time processing is applied uniformly to all the pixels.

[0097] To evaluate the method for motion magnification, several different videos are tested: face (FIG. 1), sim4 (FIG. 10), wrist (FIGS. 7A-B), camera (FIG. 2), face2, guitar, baby, subway, shadow, and baby2 (FIG. 8). For all videos, a standard Laplacian pyramid for spatial filtering is used. For videos where motions at specific temporal frequencies (e.g., in sim4 and guitar) are to be emphasized, the method employs ideal bandpass filters. In sim4 and guitar, the method can selectively amplify the motion of a specific blob or guitar string by using a bandpass filter tuned to the oscillation frequency of the object of interest. These effects can be observed in the supplemental video. The values used for α and λ_cfor all of the videos are shown in Table 1.

[0098] For videos where revealing broad, but subtle motion is desired, the method employs temporal filters with a broader passband. For example, for the face2 video, the method employs a second-order IIR filter with slow roll-off regions. By changing the temporal filter, the method magnifies the motion of the head rather than amplifying the change in the skin color. Accordingly, α=20; λ_c=80 are chosen to magnify the motion.

[0099] By using broadband temporal filters and setting α and λ_caccording to Eq. 14, the method is able to reveal subtle motions, as in the camera and wrist videos. For the camera video, a camera with a sampling rate of 300 Hz records a Digital SLR camera vibrating while capturing photos at about one exposure per second. The vibration caused by the moving mirror in the SLR, though invisible to the naked eye, is revealed by our approach. To verify that the method amplifies the vibrations caused by the flipping mirror, a laser pointer is secured to the camera and a video of the laser light recorded, appearing at a distance of about four meters from the source. At that distance, the laser light visibly oscillated with each exposure, with the oscillations in sync with the magnified motions.

[0100] The method exaggerates visible yet subtle motion, as seen in the baby, face2, and subway videos. In the subway example the method amplified the motion beyond the derived bounds of where the first-order approximation holds to increase the effect and to demonstrate the algorithm's artifacts. Many testing examples contain oscillatory movements because such motion generally has longer duration and smaller amplitudes. However, the method can amplify non-periodic motions as well, as long as they are within the passband of the temporal bandpass filter. In shadow, for example, the method processes a video of the sun's shadow moving linearly, yet imperceptibly, to the human eye over 15 seconds. The magnified version makes it possible to see the change even within this short time period.

[0101]

TABLE 1

Table 1: Table of α, λ_c, ω_t; ω_hvalues used to produce the various
output videos. For face2, two different sets of parameters are
used-one for amplifying pulse, another for amplifying motion.
For guitar, different cutoff frequencies and values for (α, λ_c) are
used to “select” the different oscillating guitar strings. f_sis
the frame rate of the camera.
				ω_t	ω_h	f_s
	Video	α	λ_c	(Hz)	(Hz)	(Hz)

	baby	10	16	0.4	3	30
	baby2	150	600	2.33	2.67	30
	camera	120	20	45	100	300
	face	100	1000	0.83	1	30
	face2	20	80	0.83	1	30
	motion
	face2	120	960	0.83	1	30
	pulse
	guitar	50	40	72	92	600
	Low E
	guitar A	100	40	100	120	600
	shadow	5	48	0.5	10	30
	subway	60	90	3.6	6.2	30
	wrist	10	80	0.4	3	30

[0102] Finally, videos may contain regions of temporal signals that do not need amplification, or that, when amplified, are perceptually unappealing. Due to Eulerian processing, the user can manually restrict magnification to particular areas by marking them on the video.

[0103] Sensitivity to Noise. The amplitude variation of the signal of interest is often much smaller than the noise inherent in the video. In such cases direct enhancement of the pixel values do not reveal the desired signal. Spatial filtering can enhance these subtle signals. However, if the spatial filter applied is not large enough, the signal of interest is not be revealed, as in FIG. 11.

[0104] Assuming that the noise is zero-mean white and wide-sense stationary with respect to space, spatial low pass filtering reduces the variance of the noise according to the area of the low pass filter. To boost the power of a specific signal (e.g., the pulse signal in the face) the spatial characteristics of the signal can estimate the spatial filter size.

[0105] Let the noise power level be σ², and the prior signal power level over spatial frequencies be S(λ). An ideal spatial low pass filter has radius r such that the signal power is greater than the noise in the filtered frequency region. The wavelength cut off of such a filter is proportional to its radius, r, so the signal prior can be represented as S(r). The noise power σ²can be estimated by examining pixel values in a stable region of the scene, from a gray card. Since the filtered noise power level, σ′², is inversely proportional to r², the radius r can be found with,

[0106]

\begin{matrix} S (r) = σ^{′2} = k \frac{σ^{2}}{r^{2}} & (14) \end{matrix}

[0107] where k is a constant that depends on the shape of the low pass filter. This equation gives an estimate for the size of the spatial filter needed to reveal the signal at a certain noise power level.

[0108] Eulerian vs. Lagrangian Processing. Because the two methods take different approaches to motion—Lagrangian approaches explicitly track motions, while Eulerian approach does not—they can be used for complementary motion domains. Lagrangian approaches enhance motions of fine point features and support larger amplification factors, while the Eulerian method is better suited to smoother structures and small amplifications. The Eulerian method does not assume particular types of motions. The first-order Taylor series analysis can hold for general small 2D motions along general paths.

[0109] FIG. 11A illustrates frame from the face video (FIG. 1) with white Gaussian noise (σ=0.1 pixel) added. FIG. 11B illustrates intensity traces over time for the pixel marked blue on the input frame, showing the trace obtained when the (noisy) sequence is processed with the same spatial filter used to process the original face sequence, a separable binomial filter of size 20. FIG. 11C shows the trace when using a filter tuned according to the estimated radius in Eq. 14, a binomial filter of size 80. The pulse signal is not visible in FIG. 11B, as the noise level is higher than the power of the signal, while in FIG. 11C the pulse is clearly visible (the periodic peaks about one second apart in the trace).

[0110] Appendix A provides estimates of the accuracy of the two approaches with respect to noise. Comparing the Lagrangian error, _εL(Eq. 28), and the Eulerian error, _εE(Eq. 30), both methods are equally sensitive to the temporal characteristics of the noise, n_t, while the Lagrangian process has additional error terms proportional to the spatial characteristics of the noise, n_x, due to the explicit estimation of motion (Eq. 26). The Eulerian error, on the other hand, grows quadratically with α, and is more sensitive to high spatial frequencies (I_xx). In general, this means that Eulerian magnification is preferable over Lagrangian magnification for small amplifications and larger noise levels.

[0111] This analysis is validated on a synthetic sequence of a 2D cosine oscillating at 2 Hz temporally and 0.1 pixels spatially with additive white spatiotemporal Gaussian noise of zero mean and standard deviation σ (FIG. 12). The results match the error-to-noise and error-to-amplification relationships predicted by the derivation (FIG. 12B)). The region where the Eulerian approach outperforms the Lagrangian results (FIG. 12A, left) is also as expected. The Lagrangian method is more sensitive to increases in spatial noise, while the Eulerian error is hardly affected by it (FIG. 12C). While different regularization schemes used for motion estimation (that are harder to analyze theoretically) may alleviate the Lagrangian error, they do not change the result significantly (FIG. 12A, right). In general, for small amplifications, the Eulerian approach strikes a better balance between performance and efficiency.

[0112] The method takes a video as input and exaggerates subtle color changes and imperceptible motions. To amplify motion, the method does not perform feature tracking or optical flow computation, but merely magnifies temporal color changes using spatio-temporal processing. This Eulerian based method, which temporally processes pixels in a fixed spatial region, successfully reveals informative signals and amplifies small motions in real-world videos.

[0113] Eulerian and Lagrangian Error

[0114] This section estimates the error in the Eulerian and Lagrangian motion magnification with respect to spatial and temporal noise. The derivation is performed again in 1D for simplicity, and can be generalized to 2D.

[0115] Both methods approximate the true motion-amplified sequence, Î(x, t), as shown in (1). First, analyze the error in those approximations on the clean signal, I(x, t).

[0116] Without noise: In the Lagrangian approach, the motion amplified sequence, Ĩ_L(x, t), is achieved by directly amplifying the estimated motion, (t), with respect to the reference frame, I(x, 0)
Ĩ_L(x,t)=I(x+(1+α){tilde over (δ)}(t),0) (15)

[0117] In its simplest form, δ(t) can be estimated in a point-wise manner

[0118]

\begin{matrix} \tilde{δ} (t) = \frac{I_{t} (x, t)}{I_{x} (x, t)} & (16) \end{matrix}

[0119] where I_x(x, t)=∂I(x, t)/∂x and I_t(x, t)=I(x, t)−I(x, 0). From now on, the space (x) and time (t) indices are omitted when possible for brevity.

[0120] The error in the Lagrangian solution is directly determined by the error in the estimated motion, which is the second-order term in the brightness constancy equation,

[0121]

\begin{matrix} I (x, t) \approx I (x, 0) + δ (t) I_{x} + \frac{1}{2} δ^{2} (t) I_{xx} \Rightarrow \frac{I_{t}}{I_{x}} \approx δ (t) + \frac{1}{2} δ^{2} (t) I_{xx} & (17) \end{matrix}

[0122] The estimated motion, {tilde over (δ)}(t), is related to the true motion, δ(t), by

[0123]

\begin{matrix} \tilde{δ} (t) \approx δ (t) + \frac{1}{2} δ^{2} (t) I_{xx} & (18) \end{matrix}

[0124] Plugging (18) in (15) and using a Taylor expansion of/about x+(1+α)δ(t) gives,

[0125]

\begin{matrix} \tilde{I} (x, t) \approx I (x + (1 + α) δ (t), 0) + \frac{1}{2} (1 + α) δ^{2} (t) I_{xx} I_{x} & (19) \end{matrix}

[0126] Subtracting (1) from (19), the error in the Lagrangian motion magnified sequence, _εL, is

[0127]

\begin{matrix} ɛ_{L} \approx \langle \frac{1}{2} (1 + α) δ^{2} (t) I_{xx} I x \rangle . & (20) \end{matrix}

[0128] In the Eulerian approach, the magnified sequence, Î_E(x, t), is

[0129]

\begin{matrix} {\tilde{I}}_{ɛ} (x, t) = I (x, t) + α I_{t} (x, t) = I (x, 0) + (1 + α) I_{t} (x, t) & (21) \end{matrix}

[0130] similar to (4), using a two-tap temporal filter to compute I_t. Using a Taylor expansion of the true motion-magnified sequence, Î defined in (1), about x gives,

[0131]

\begin{matrix} \hat{I} (x, t) \approx I (x, 0) + (1 + α) δ (t) I_{x} + \frac{1}{2} {(1 + α)}^{2} δ^{2} (t) I_{xx} & (22) \end{matrix}

[0132] Using (17) and subtracting (1) from (22), the error in the Eulerian motion-magnified sequence, _εE, is

[0133]

\begin{matrix} ɛ_{E} \approx \langle \frac{1}{2} {(1 + α)}^{2} δ^{2} (t) I_{xx} - \frac{1}{2} (1 + α) δ^{2} (t) I_{xx} I_{x} \rangle & (23) \end{matrix}

[0134] With noise: Let I′(x, t) be the noisy signal, such that
I′(x,t)=I(x,t)+n(x,t) (24)

[0135] for additive noise n(x; t).

[0136] The estimated motion in the Lagrangian approach becomes

[0137]

\begin{matrix} \tilde{δ} (t) = \frac{I_{t}^{'}}{I_{x}^{'}} = \frac{I_{t} + n_{t}}{I_{x} + n_{x}} & (25) \end{matrix}

[0138] where n_x=∂_n/∂_xand n_t=n(x, t)−n(x, 0). Using a Taylor Expansion on (n_t, n_x) about (0, 0) (zero noise), and using (17), gives

[0139]

\begin{matrix} (t) \approx δ (t) + \frac{n_{t}}{I_{x}} - n_{x} \frac{I_{t}}{I_{x}^{2}} + \frac{1}{2} δ^{2} (t) I_{xx} & (26) \end{matrix}

[0140] Plugging (26) into (15), and using a Taylor expansion of I about x+(1+α)δ(t), gives

[0141]

\begin{matrix} (1 + α) I_{x} (\frac{n_{t}}{I_{x}} - n_{x} \frac{I_{t}}{I_{x}^{2}} + \frac{1}{2} δ^{2} (t) I_{xx})) + n . & (27) \end{matrix}

[0142] Using (18) again and subtracting (1), the Lagrangian error as a function of noise, _εL(n), is

[0143]

\begin{matrix} \langle (1 + α) n_{t} - (1 + α) n_{x} δ (t) - \frac{1}{2} (1 + α) δ^{2} (t) I_{xx} n_{x} + \frac{1}{2} (1 + α) δ^{2} (t) I_{xx} I_{x} + n \rangle . & (28) \end{matrix}

[0144] In the Eulerian approach, the noisy motion-magnified sequence becomes

[0145]

\begin{matrix} {\hat{I}}_{E}^{'} (x, t) = I^{'} (x, 0) + (1 + α) I_{t}^{'} = I (x, 0) + (1 + α) (I_{t} + n_{t}) + n & (29) \end{matrix}

[0146] Using (23) and subtracting (1), the Eulerian error as a function of noise, _εE(n), is

[0147]

\begin{matrix} (30) \end{matrix}

[0148] If the noise is set to zero in (28) and (30), the resulting errors correspond to those derived for the non-noisy signal as shown in (20) and (23).

[0149] FIGS. 12A-C are diagrams illustrating a comparison between Eulerian and Lagrangian motion magnification on a synthetic sequence with additive noise. FIG. 12A shows diagrams 1202 and 1204 illustrating the minimal error, min(_εE, _εL), computed as the (frame-wise) RMSE between each method's result and the true motion-magnified sequence, as function of noise and amplification, colored from blue (small error) to red (large error). Graph 1202 illustrates the minimal error with spatial regularization in the Lagrangian method, and graph 1204 illustrates the minimal error without spatial regularization in the Lagrangian method. The black curves mark the intersection between the error surfaces, and the overlayed text indicate the best performing method in each region. FIG. 11B shows RMSE of the two approaches as function of noise (left) and amplification (right).

[0150] In this section Supplemental Information estimates of the error in the Eulerian and Lagrangian motion magnification results with respect to spatial and temporal noise are derived. The derivation is done again for the 1D case for simplicity, and can be generalized to 2D. The true motion-magnified sequence is

[0151]

\begin{matrix} \hat{I} (x, t) = f (x + (1 + α) δ (t)) = I (x + (1 + α) δ (t), 0) & (31) \end{matrix}

[0152] Both methods approximate the true motion-amplified sequence, Î(x, t) (Eq. 31). First, the error in those approximations on the clean signal, I(x, t), is analyzed.

[0153] 1.1 Without Noise

[0154] In the Lagrangian approach, the motion-amplified sequence, Ĩ_L(x, t), is achieved by directly amplifying the estimated motion, {tilde over (δ)}(t), with respect to the reference frame I(x, 0)
Ĩ_L(x,t)=I(x+(1+α){tilde over (d)}(t),0) (32)

[0155] In its simplest form, δ(t) can be estimated using point-wise brightness constancy

[0156]

\begin{matrix} \tilde{δ} (t) = \frac{I_{t} (x, t)}{I_{x} (x, t)} & (33) \end{matrix}

[0157] where I_x(x, t)=∂I(x, t)/∂x and I_t(x, t)=I(x, t)−I(x, 0). From now on, space (x) and time (t) indices are omitted when possible for brevity.

[0158] The error in the Lagrangian solution is directly determined by the error in the estimated motion, which is the second-order term in the brightness constancy equation

[0159]

\begin{matrix} I (x, t) = I (x + δ (t), 0) \approx I (x, 0) + δ (t) I_{x} + \frac{1}{2} δ^{2} (t) I_{xx} \frac{I_{t}}{I_{x}} \approx δ (t) + \frac{1}{2} δ^{2} (t) I_{xx} & (34) \end{matrix}

[0160] So that the estimated motion {tilde over (δ)}(t) is related to the true motion, δ(t), as

[0161]

\begin{matrix} \tilde{δ} (t) \approx δ (t) + \frac{1}{2} δ^{2} (t) I_{xx} & (35) \end{matrix}

[0162] Plugging (35) in (32),

[0163]

\begin{matrix} {\tilde{I}}_{L} (x, t) \approx I (x + (1 + α) (δ (t) + \frac{1}{2} δ^{2} (t) I_{xx}), 0) \approx I (x + (1 + α) δ (t) + \frac{1}{2} (1 + α) δ^{2} (t) I_{xx}, 0) & (36) \end{matrix}

[0164] Using first-order Taylor expansion of I about x+(1+α)δ(t),

[0165]

\begin{matrix} {\tilde{I}}_{L} (x, t) \approx I (x + (1 + α) δ (t), 0) + \frac{1}{2} (1 + α) δ^{2} (t) I_{xx} I_{x} & (37) \end{matrix}

[0166] Subtracting (31) from (37), the error in the Lagrangian motion-magnified sequence, _εL, is

[0167]

\begin{matrix} ε_{L} \approx \langle \frac{1}{2} (1 + α) δ^{2} (t) I_{xx} I_{x} \rangle & 38 \end{matrix}

[0168] In the Eulerian approach, the magnified sequence, Î_E(x, t), is computed as

[0169]

\begin{matrix} {\hat{I}}_{E} (x, t) = I (x, t) + α I_{t} (x, t) = I (x, 0) + (1 + α) I_{t} (x, t) & (39) \end{matrix}

[0170] similar to Eq. 34, using a two-tap temporal filter to compute I_t.

[0171] Using Taylor expansion of the true motion-magnified sequence, Î (Eq. 1), about x, gives

[0172]

\begin{matrix} \hat{I} (x, t) \approx I (x, 0) + (1 + α) δ (t) I_{x} + \frac{1}{2} {(1 + α)}^{2} δ^{2} (t) I_{xx} & (40) \end{matrix}

[0173] Plugging (34) into (40)

[0174]

\begin{matrix} \hat{I} (x, t) \approx I (x, 0) + (1 + α) (I_{t} - \frac{1}{2} δ^{2} (t) I_{xx} I_{x}) + \frac{1}{2} {(1 + α)}^{2} δ^{2} (t) I_{xx} \approx I (x, 0) + (1 + α) I_{t} - \frac{1}{2} (1 + α) δ^{2} (t) I_{xx} I_{x} + \frac{1}{2} {(1 + α)}^{2} δ^{2} (t) I_{xx} & (41) \end{matrix}

[0175] Subtracting (39) from (41) gives the error in the Eulerian solution

[0176]

\begin{matrix} ɛ_{E} \langle \approx \frac{1}{2} {(1 + α)}^{2} δ^{2} (t) I_{xx} - \frac{1}{2} (1 + α) δ^{2} (t) I_{xx} I_{x} \rangle & (42) \end{matrix}

[0177] 1.2 With Noise

[0178] Let I′(x, t) be the noisy signal, such that
I′(x,t)=I(x,t)+n(x,t) (43)

[0179] for additive noise n(x, t).

[0180] In the Lagrangian approach, the estimated motion becomes

[0181]

\begin{matrix} \hat{δ} (t) = \frac{I_{t}^{'}}{I_{x}^{'}} = \frac{I_{t} + n_{t}}{I_{x} + n_{x}} & (44) \end{matrix}

[0182] where n_x=∂n/∂x and n_t=n(x, t)−n(x, 0).

[0183] Using Taylor Expansion on (n_t, n_x) about (0, 0) (zero noise), and using (34) gives,

[0184]

\begin{matrix} \tilde{δ} (t) \approx \frac{I_{t}}{I_{x}} + n_{t} \frac{1}{I_{x} + n_{x}} \frac{I_{t} + n_{t}}{{(I_{x} + n_{x})}^{2}} \approx δ (t) + \frac{n_{t}}{I_{x}} - n_{x} \frac{I_{t}}{I_{x}^{2}} + \frac{1}{2} δ^{2} (t) I_{xx} & (45) \end{matrix}

[0185] where the terms involving products of the noise components are ignored.

[0186] Plugging into Eq. (32), and using Taylor expansion of I about x+(1+α)δ(t) (t) gives

[0187]

\begin{matrix} {\tilde{I}}_{L}^{'} (x, t) \approx I (x + (1 + α) δ (t), 0) + (1 + α) I_{x} (\frac{n_{t}}{I_{x}} - n_{x} \frac{I_{t}}{I_{x}^{2}} + \frac{1}{2} I_{xx} δ^{2} (t))) + n) & (46) \end{matrix}

[0188] Arranging terms, and substituting (34) in (46),

[0189]

\begin{matrix} {\tilde{I}}_{L}^{'} (x, t) \approx I (x + (1 + α) δ (t), 0) + (1 + α) (n_{t} - n_{x} (δ (t) + \frac{1}{2} δ^{2} (t) I_{xx}) + \frac{1}{2} δ^{2} (t) I_{xx} I_{x}) + n = I (x + (1 + α) δ (t), 0) + (1 + α) n_{t} - (1 + α) n_{x} δ (t) - \frac{1}{2} (1 + α) n_{x} δ^{2} (t) I_{xx} + \frac{1}{2} (1 + α) δ^{2} (t) I_{xx} I_{x} + n & (47) \end{matrix}

[0190] Using (35) again and subtracting (31), the Lagrangian error as function of noise, _εL(n), is

[0191]

\begin{matrix} ɛ_{L} (n) \approx \langle (1 + α) n_{t} - (1 + α) n_{x} δ (t) - \frac{1}{2} (1 + α) δ^{2} (t) I_{xx} n_{z} + \frac{1}{2} (1 + α) δ^{2} (t) I_{xx} I_{x} + n \rangle & (48) \end{matrix}

[0192] In the Eulerian approach, the noisy motion-magnified sequence becomes

[0193]

\begin{matrix} {\tilde{I}}_{E}^{'} (x, t) = I^{'} (x, 0) + (1 + α) I_{t}^{'} = I (x, 0) + (1 + α) (I_{t} + n_{t}) + n = I_{E} (x, t) + (1 + α) n_{t} + n & (49) \end{matrix}

[0194] Using (42) and subtracting (31), the Eulerian error as function of noise, _εE(n), is

[0195]

\begin{matrix} ɛ_{E} (n) \approx \langle (1 + α) n_{t} + \frac{1}{2} {(1 + α)}^{2} δ^{2} (t) I_{xx} - \frac{1}{2} (1 + α) δ^{2} (t) I_{xx} I_{x} + n \rangle & (50) \end{matrix}

[0196] Notice that setting zero noise in (48) and (50), gives the corresponding errors derived for the non-noisy signal in (38) and (42).

[0197] FIG. 13 is a flow diagram 1300 illustrating an example embodiment of the Eulerian embodiment of the method described herein. The Eulerian-based method begins by examining pixel values of two or more images (1302). The method then determines the temporal variation of the examined pixel values (1304). The method is designed to amplify only small temporal variations. While the method can be applied to large temporal variations, the advantage in the method is provided for small temporal variations. Therefore the method is optimized when the input video has small temporal variations between the images. The method then applies signal processing to the pixel values (1306). For example, signal processing can amplify the determined temporal variations, even when the temporal variations are small.

[0198] FIG. 14 illustrates a computer network or similar digital processing environment in which the present invention may be implemented.

[0199] Client computer(s)/devices 50 and server computer(s) 60 provide processing, storage, and input/output devices executing application programs and the like. Client computer(s)/devices 50 can also be linked through communications network 70 to other computing devices, including other client devices/processes 50 and server computer(s) 60. Communications network 70 can be part of a remote access network, a global network (e.g., the Internet), a worldwide collection of computers, Local area or Wide area networks, and gateways that currently use respective protocols (TCP/IP, Bluetooth, etc.) to communicate with one another. Other electronic device/computer network architectures are suitable.

[0200] FIG. 15 is a diagram of the internal structure of a computer (e.g., client processor/device 50 or server computers 60) in the computer system of FIG. 14. Each computer 50, 60 contains system bus 79, where a bus is a set of hardware lines used for data transfer among the components of a computer or processing system. Bus 79 is essentially a shared conduit that connects different elements of a computer system (e.g., processor, disk storage, memory, input/output ports, network ports, etc.) that enables the transfer of information between the elements. Attached to system bus 79 is I/O device interface 82 for connecting various input and output devices (e.g., keyboard, mouse, displays, printers, speakers, etc.) to the computer 50, 60. Network interface 86 allows the computer to connect to various other devices attached to a network (e.g., network 70 of FIG. 14). Memory 90 provides volatile storage for computer software instructions 92 and data 94 used to implement an embodiment of the present invention (e.g., code detailed above). Disk storage 95 provides non-volatile storage for computer software instructions 92 and data 94 used to implement an embodiment of the present invention. Central processor unit 84 is also attached to system bus 79 and provides for the execution of computer instructions.

[0201] In one embodiment, the processor routines 92 and data 94 are a computer program product (generally referenced 92), including a computer readable medium (e.g., a removable storage medium such as one or more DVD-ROM's, CD-ROM's, diskettes, tapes, etc.) that provides at least a portion of the software instructions for the invention system. Computer program product 92 can be installed by any suitable software installation procedure, as is well known in the art. In another embodiment, at least a portion of the software instructions may also be downloaded over a cable, communication and/or wireless connection. In other embodiments, the invention programs are a computer program propagated signal product 107 embodied on a propagated signal on a propagation medium (e.g., a radio wave, an infrared wave, a laser wave, a sound wave, or an electrical wave propagated over a global network such as the Internet, or other network(s)). Such carrier medium or signals provide at least a portion of the software instructions for the present invention routines/program 92.

[0202] In alternate embodiments, the propagated signal is an analog carrier wave or digital signal carried on the propagated medium. For example, the propagated signal may be a digitized signal propagated over a global network (e.g., the Internet), a telecommunications network, or other network. In one embodiment, the propagated signal is a signal that is transmitted over the propagation medium over a period of time, such as the instructions for a software application sent in packets over a network over a period of milliseconds, seconds, minutes, or longer. In another embodiment, the computer readable medium of computer program product 92 is a propagation medium that the computer system 50 may receive and read, such as by receiving the propagation medium and identifying a propagated signal embodied in the propagation medium, as described above for computer program propagated signal product.

[0203] Generally speaking, the term “carrier medium” or transient carrier encompasses the foregoing transient signals, propagated signals, propagated medium, storage medium and the like.

[0204] While this invention has been particularly shown and described with references to example embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the scope of the invention encompassed by the appended claims.

Claims

Certificate of Correction present

The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.

What is claimed is:

1. A method of amplifying temporal variation in at least two images, the method comprising:

for each particular pixel of the at least two images, detecting a temporal variation of the particular pixel of the at least two images by applying a bandpass filter, the resulting detected temporal variation of the particular pixel between the two images being below a particular threshold;

amplifying the detected temporal variation of each particular pixel; and

providing at least two modulated images by adding the amplified temporal variation to the at least two images by synthesizing the modulated images, for an amplification factor α, according to ƒ(x+(1+α), δ(t)), δ(t) being a displacement function.

2. The method of claim 1, wherein detecting the temporal variation employs temporal processing.

3. The method of claim 1, wherein detecting the temporal variation employs spatial processing.

4. The method of claim 3, wherein the spatial processing removes noise.

5. The method of claim 1, further comprising visualizing a pattern of flow of blood in a body shown in the at least two images.

6. A system for amplifying temporal variation in at least two images, the system comprising:

a pixel examination module configured to, for each particular pixel of the at least two images, detecting a temporal variation of the particular pixel of the at least two images by applying a bandpass filter, the resulting detected temporal variation between the two images being below a particular threshold; and

a signal processing module configured to:

amplify the detected temporal variation of each particular pixel, and

provide at least two modulated images by adding the amplified temporal variation to the at least two images by synthesizing the modulated images for an amplification factor α, according to ƒ(x+(1+α), δ(t)), δ(t) being a displacement function.

7. The system of claim 6, wherein the pixel examination module is further configured to detect temporal variation by employing temporal processing.

8. The system of claim 6, wherein the signal processing is further configured to detect the temporal variation by employing spatial processing.

9. The system of claim 8, wherein the spatial processing removes noise.

10. The system of claim 6, further comprising a blood flow visualization module configured to visualize a pattern of flow of blood in a body shown in the at least two images.

11. The method of claim 1, wherein applying the bandpass filter includes, for each pixel value, analyzing a one-dimensional (1D) image intensity.

12. The method of claim 11, wherein the 1D image intensity profile is based on a function ƒ(x+δ(t)), where δ(t) is a displacement function.

13. The system of claim 6, wherein the pixel examination module is further configured to, for each pixel value, analyze a one-dimensional (1D) image intensity profile.

Patent Citations (16)

Patent	Date	Inventor	Cited By
US4063281(A)	1977-12-01	Kornreich et al.	Examiner
US7821546(B2)	2010-10-01	Sakamoto et al.	Applicant
US9324005(B2)	2016-04-01	Wadhwa et al.	Applicant
US9338331(B2)	2016-05-01	Wadhwa et al.	Applicant
US2007/0115370(A1)	2007-05-01	Sakamoto et al.	Applicant
US2007/0185393(A1)	2007-08-01	Zhou et al.	Applicant
US2008/0037906(A1)	2008-02-01	Yano et al.	Examiner
US2009/0208080(A1)	2009-08-01	Grau et al.	Applicant
US2009/0304246(A1)	2009-12-01	Walker et al.	Examiner
US2010/0166300(A1)	2010-07-01	Spampinato et al.	Examiner
US2014/0072190(A1)	2014-03-01	Wu et al.	Examiner
US2014/0072228(A1)	2014-03-01	Rubinstein et al.	Examiner
US2014/0072229(A1)	2014-03-01	Wadhwa et al.	Examiner
US2014/0153692(A1)	2014-06-01	Larkin et al.	Applicant
US2015/0124062(A1)	2015-05-01	Didyk et al.	Applicant
US2015/0195430(A1)	2015-07-01	Wadhwa et al.	Applicant

Non-Patent Literature (25)

Balakrishnan, Guha, Fredo Durand, and John Guttag. “Detecting pulse from head motions in video.” Computer Vision and Pattern Recognition (CVPR), 2013 IEEE Conference on. IEEE, 2013. APA.Examiner
Poh, Ming-Zher, Daniel J. McDuff, and Rosalind W. Picard. “Non-contact, automated cardiac pulse measurements using video imaging and blind source separation.” Optics express 18.10 (2010): 10762-10774.Examiner
Unuma, Munetoshi, Ken Anjyo, and Ryozo Takeuchi. “Fourier principles for emotion-based human figure animation.” Proceedings of the 22nd annual conference on Computer graphics and interactive techniques. ACM, 1995.Examiner
Verkruysse, Wim, Lars O. Svaasand, and J. Stuart Nelson. “Remote plethysmographic imaging using ambient light.” Optics express 16.26 (2008): 21434-21445.Examiner
Viola, Paul, and Michael J. Jones. “Robust real-time face detection.” International journal of computer vision 57.2 (2004): 137-154.Examiner
Wadhwa, Neal, et al. “Phase-based video motion processing.” ACM Transactions on Graphics (TOG) 32.4 (2013): 80.Examiner
Wadhwa, Neal, et al. “Riesz pyramids for fast phase-based video magnification.” Computational Photography (ICCP), 2014 IEEE International Conference on. IEEE, 2014.Examiner
Timoner, Samson J. Subpixel motion estimation from sequences of video images. Diss. Massachusetts Institute of Technology, 1999.Examiner
Timoner, Samson J., and Dennis M. Freeman. “Multi-image gradient-based algorithms for motion estimation.” Optical engineering 40.9 (2001): 2003-2016.Examiner
Lucas, Bruce D., and Takeo Kanade. “An iterative image registration technique with an application to stereo vision.” IJCAI. vol. 81. 1981.Examiner
Bai, J., et al., “Selectively de-animating video,” ACM Transactions on Graphics, (2012).Applicant
Bojanic, S., et al., “Ocular microtremor: a tool for measuring depth of anaesthesia?” British J. Anaestheia, 86(4): 519-522 (2001).Applicant
Burt, P. and Adelson, E., “The laplacian pyramid as a compact image code,” IEEE Trans. Comm., 31(4): 532-540 (1983).Applicant
Fleet, D.J. and Jepson, A.D., “Computation of component image velocity from local phase information,” Int. J. Comput., Vision 5(1): 77-104 (Sep. 1990).Applicant
Freeman, W.T., et al., “Motion without movement,” SIGGRAPH Comput. Graph., 25: 27-30 (Jul. 1991).Applicant
Fuchs, M., et al., “Real-time temporal shaping of high-speed video streams,” Computers & Graphics, 34(5) : 575-584 (2010).Applicant
Gautama, T. and Van Hulle, M., “A phase-based approach to the estimation of the optical flow field using spatial filtering”, Neural Networks, IEEE Transactions, 13(5): 1127-1136 (Sep. 2002).Applicant
Liu, C., et al., “Motion magnification”, ACM Trans. Graph., 24: 519-526 (Jul. 2005).Applicant
Portilla, J. and Simoncelli, E.D., “A parametric texture model based on joint statistics of complex wavelet coefficients,” Int. J. Comput. Vision, 49(1): 49-70 (Oct. 2000).Applicant
Rolfs, M., “Microsaccades: Small steps on a long way,” Vision Res., 49(20): 2415-2441 (2009).Applicant
Rubinstein, M., et al., “Motion denoising with application to time-lapse photography,” IEEE Computer Vision and Pattern Recognition, CVPR, pp. 313-320 (Jun. 2011).Applicant
Simoncelli, E.P. and Freeman, W.T., The steerable pyramid: a flexible architecture for multi-scale derivative computation, in Proc. of the 1995 Int'l Conf. on Image Proc., IEEE Computer Society, ICIP, Washington, DC, USA, 3: 3444 (1995).Applicant
Wang, J., et al., “The cartoon animation filter,” ACM Trans. Graph., 25: 1169-1173 (2006).Applicant
Wu, H.-Y., et al., “Eulerian video magnification for revealing subtle changes in the world,” ACM Trans. Graph. (Proc. SIGGRAPH), 31 (Aug. 2012).Applicant
Rubinstein, Miki, “Eulerian Video Magnification” You Tube, http://www.youtube.com/watch?v=ONZcjs1Pjmk, May 23, 2012, 3 pages.Applicant

Abstract