The combination of multiple images, e.g., a foreground image and a background image, into composite images is an important task in various different commercial industries and other contexts. If two images, which could be partial or complete frames of video data, are combined inartfully, the result may be a visually unpleasant and artificial-looking composition.
One embodiment takes the form of a method that includes (i) obtaining foreground video data; (ii) obtaining background video data; (iii) determining a color-distribution dimensionality of the background video data to be either high-dimensional chromatic or low-dimensional chromatic; (iv) selecting a chromatic-adjustment technique from a set of chromatic-adjustment techniques based on the determined color-distribution dimensionality of the background video data; (v) adjusting the foreground video data using the selected chromatic-adjustment technique; (vi) generating combined video data at least in part by combining the background video data with the adjusted foreground video data; and (vii) outputting the combined video data for display.
Another embodiment takes the form of a system that includes a communication interface, a processor, and a non-transitory computer-readable medium storing instructions executable by the processor for causing the system to perform at least the functions listed in the preceding paragraph.
Moreover, any of the variations and permutations described herein can be implemented with respect to any embodiments, including with respect to any method embodiments and with respect to any system embodiments. Furthermore, this flexibility and cross-applicability of embodiments is present in spite of the use of slightly different language (e.g., process, method, steps, functions, set of functions, and the like) to describe and or characterize such embodiments.
In at least one embodiment, determining the color-distribution dimensionality of the background video data to be either high-dimensional chromatic or low-dimensional chromatic includes (i) converting pixels of the background video data from an {R,G,B} color space to an {L,a,b} color space; (ii) calculating an {a,b} variance of the converted background pixels; (iii) comparing the calculated {a,b} variance to an {a,b}-variance threshold; (iv) determining the color-distribution dimensionality of the background video data to be high-dimensional chromatic if the calculated {a,b} variance exceeds the {a,b}-variance threshold; and (v) determining the color-distribution dimensionality of the background video data to be low-dimensional chromatic if the calculated {a,b} variance does not exceed the {a,b}-variance threshold.
In at least one embodiment, calculating the {a,b} variance of the converted background pixels includes determining how many luminance levels in the converted background pixels have more than a luminance-level-specific degree of {a,b} variance. In at least one such embodiment, the {a,b}-variance threshold is a threshold number of luminance levels; in at least one such embodiment, the threshold number of luminance levels is zero; in at least one other such embodiment, the threshold number of luminance levels is greater than zero.
In at least one embodiment, calculating the {a,b} variance of the converted background pixels includes (i) determining a respective luminance-level-specific {a,b} variance for each of a plurality of luminance levels that are represented in the converted background pixels and (ii) calculating the {a,b} variance of the converted background pixels to be a sum of the determined luminance-level-specific {a,b} variances.
In at least one embodiment, calculating the {a,b} variance of the converted background pixels includes (i) determining a respective luminance-level-specific {a,b} variance for each luminance level represented in the converted background pixels and (ii) calculating the {a,b} variance of the converted background pixels to be a sum of the determined luminance-level-specific {a,b} variances.
In at least one embodiment, determining the color-distribution dimensionality of the background video data to be either high-dimensional chromatic or low-dimensional chromatic includes (i) determining the color-distribution dimensionality of the background video data to be low-dimensional chromatic if a background-color distribution of the background video data in an {L,a,b} color space is supported by a relationship defined by:
{(L,a,b)|a=fa(L),b=fb(L)} (Eq. 1)
where fa and fb are functions and (ii) otherwise determining the color-distribution dimensionality of the background video data to be high-dimensional chromatic.
In at least one embodiment: (i) the set of chromatic-adjustment techniques includes a white-balancing technique and a chromatic-replacement technique and (ii) selecting a chromatic-adjustment technique based on the determined color-distribution dimensionality includes (a) selecting the white-balancing technique when the color-distribution dimensionality of the background video data is determined to be high-dimensional chromatic and (b) selecting the chromatic-replacement technique when the color-distribution dimensionality of the background video data is determined to be low-dimensional chromatic.
In at least one embodiment, adjusting the foreground video data using the white-balancing technique includes (i) determining a foreground average of pixels of the foreground video data in an {R,G,B} color space; (ii) determining a background average of pixels of the background video data in the {R,G,B} color space; (iii) converting the foreground average and the background average from the {R,G,B} color space to a second color space; (iv) determining a transform matrix in the second color space from the converted foreground average to the converted background average; (v) converting the pixels of the foreground video data from the {R,G,B} color space to the second color space; (vi) transforming the converted foreground pixels in the second color space using the determined transform matrix; and (vii) converting the transformed foreground pixels from the second color space to the {R,G,B} color space.
In at least one embodiment, the determined transform matrix includes dimension-wise ratios in the second color space of the converted background average to the converted foreground average. In at least one embodiment, the second color space is an {L,a,b} color space. In at least one embodiment, the second color space is an {X,Y,Z} color space. In at least one such embodiment, converting the foreground pixels from the {R,G,B} color space to the second color space includes converting the foreground pixels from the {R,G,B} color space to an {L,a,b} color space and then from the {L,a,b} color space to the {X,Y,Z} color space.
In at least one embodiment, the method also includes converting pixels of the background video data from an {R,G,B} color space to an {L,a,b} color space, and adjusting the foreground video data using the chromatic-replacement technique includes: (i) generating an L-to-{a,b} lookup table based on the converted background pixels; (ii) converting pixels of the foreground video data from the {R,G,B} color space to the {L,a,b} color space; (iii) transforming the converted foreground pixels at least in part by (a) using the respective L values of the respective converted foreground pixels to select respective replacement {a,b} values for the respective converted foreground pixels based on the L-to-{a,b} lookup table and (b) replacing the respective {a,b} values of the respective converted foreground pixels with the corresponding respective selected replacement {a,b} values; and (iv) converting the transformed foreground pixels from the {L,a,b} color space to the {R,G,B} color space.
In at least one embodiment, using the respective L values of the respective converted foreground pixels to select the respective replacement {a,b} values for the respective converted foreground pixels based on the L-to-{a,b} lookup table includes retrieving the respective replacement {a,b} values from the L-to-{a,b} lookup table in cases where the respective L value of the respective converted foreground pixel is listed in the L-to-{a,b} lookup table.
In at least one embodiment, using the respective L values of the respective converted foreground pixels to select the respective replacement {a,b} values for the respective converted foreground pixels based on the L-to-{a,b} lookup table further includes using interpolated {a,b} values based on one or more entries in the L-to-{a,b} lookup table as the respective replacement {a,b} values in cases where the respective L value of the respective converted foreground pixel is not listed in the L-to-{a,b} lookup table. In at least one such embodiment, the interpolated {a,b} values are copied from a nearest L value that is listed in the L-to-{a,b} lookup table; in at least one other such embodiment, the interpolated {a,b} values are average {a,b} values of two or more proximate entries in the L-to-{a,b} lookup table.
In at least one embodiment, the method also includes (i) obtaining second foreground video data and (ii) adjusting the second foreground video data using the selected chromatic-adjustment technique, and generating the combined video data includes combining the background video data with both the adjusted foreground video data and the adjusted second foreground video data.
Before proceeding with this detailed description, it is noted that the entities, connections, arrangements, and the like that are depicted in—and described in connection with—the various figures are presented by way of example and not by way of limitation. As such, any and all statements or other indications as to what a particular figure “depicts,” what a particular element or entity in a particular figure “is” or “has,” and any and all similar statements—that may in isolation and out of context be read as absolute and therefore limiting—can only properly be read as being constructively preceded by a clause such as “In at least one embodiment, . . . .” And it is for reasons akin to brevity and clarity of presentation that this implied leading clause is not repeated ad nauseam in this detailed description.
In particular,
At step 102, the computing device 200 obtains foreground video data. At step 104, the computing device 200 obtains background video data. At step 106, the computing device determines a color-distribution dimensionality of the background video data to be either high-dimensional chromatic or low-dimensional chromatic. At step 108, the computing device 200 selects a chromatic-adjustment technique from a set of chromatic-adjustment techniques based on the determined color-distribution dimensionality of the background video data. At step 110, the computing device 200 adjusts the foreground video data using the selected chromatic-adjustment technique. At step 112, the computing device 200 generates combined video data at least in part by combining the background video data with the adjusted foreground video data. At step 114, the computing device 200 outputs the combined video data for display.
The communication interface 202 may be configured to be operable for communication according to one or more wireless-communication protocols, some examples of which include Long-Term Evolution (LTE), IEEE 802.11 (Wi-Fi), Bluetooth, and the like. The communication interface 202 may also or instead be configured to be operable for communication according to one or more wired-communication protocols, some examples of which include Ethernet and USB.) The communication interface 202 may include any necessary hardware (e.g., chipsets, antennas, Ethernet interfaces, etc.), any necessary firmware, and any necessary software for conducting one or more forms of communication with one or more other entities as described herein.
The processor 204 may include one or more processors of any type deemed suitable by those of skill in the relevant art, some examples including a general-purpose microprocessor and a dedicated digital signal processor (DSP).
The data storage 206 may take the form of any non-transitory computer-readable medium or combination of such media, some examples including flash memory, read-only memory (ROM), and random-access memory (RAM) to name but a few, as any one or more types of non-transitory data-storage technology deemed suitable by those of skill in the relevant art could be used. As depicted in
The user interface 212 may include one or more input devices (a.k.a. components and the like) and/or one or more output devices (a.k.a. components and the like.) With respect to input devices, the user interface 212 may include one or more touchscreens, buttons, switches, microphones, and the like. With respect to output devices, the user interface 212 may include one or more speakers, light emitting diodes (LEDs), and the like. In some embodiments, including the one depicted by way of example in
The peripherals 214 may include any computing device accessory, component, or the like, that is accessible to and useable by the computing device 200 during operation. In some embodiments, including the one depicted by way of example in
Returning to
At step 104, the computing device 200 obtains background video data, which the computing device 200 may do in any of the ways described above in connection with the computing device 200 obtaining the foreground video at step 102, or in any other manner deemed suitable in a given context by one of skill in the art.
Thus, in an example scenario, a user is using the computing device 200, which in this example is a laptop computer. The computing device 200 carries out step 102 by capturing video of the user, and then extracts from that captured video a persona of the user. In this example, then, the “foreground video” is the extracted persona. For an example procedure for persona extraction from a video feed, see U.S. Pat. No. 8,818,028, which issued Aug. 26, 2014 and is entitled “Systems and Methods for Accurate User Foreground Video Extraction,” the entire contents of which are hereby incorporated herein by reference.
Further to this example scenario, the computing device 200 carries out step 104 by receiving a video feed via a network connection. In this example, then, the “background video” is that received video feed, which could be a slide-based presentation, as one example. Further to this example scenario, at the time they are obtained by the computing device 200, both the foreground video and the background video are in the form of frames of pixels; furthermore, at the time these frames are obtained, those pixels are expressed in what is known as the {R,G,B} color space.
As is known in the art, a pixel is an independently changeable and addressable display-data element that has properties such as color and location (e.g., Cartesian coordinates in a rectangular image). Generally speaking, higher-resolution images include greater number of pixels, and thus the potential for a higher amount of detail, then do lower-resolution images. As is further known in the art, pixels can contain color information in any of a variety of different color spaces. Some examples that are discussed herein include the {R,G,B} color space, the {L,a,b} color space, and the {X,Y,Z} color space, though certainly many others could be listed here and discussed herein, as those three are listed here and discussed herein by way of example. These three example color spaces are briefly discussed below though, as stated, they are known to those of skill in the art, as are the manners of converting pixels from being expressed in one of those color spaces to being expressed in another.
The {R,G,B} color space expresses the color of a given pixel using a red (R) value, a green (G) value, and a blue (B) value, each of which can range from 0-255. Moreover, a related color space is the {R,G,B,A} color space, which adds a fourth value, the alpha (A) value, which can also range from 0-255 and is a measure of the transparency (and equivalently then the opacity) at which the given pixel should be displayed. The {R,G,B} color space, then, does not express color in a way that requires a separate brightness value. Instead, the resulting color of the pixel is the result of some amount of red-color intensity, some amount of green-color intensity, and some amount of blue-color intensity, where one or more of those amounts could be zero.
The {L,a,b} color space expresses the color of a given pixel using one value (L) to represent luminance (i.e., brightness) and the other two values (a and b) to represent color. Typically, for a given pixel, ‘L’ can range between values of 0 and 100, while each of ‘a’ and ‘b’ can range between −128 and +128. Thus, the combination of the ‘a’ value and the ‘b’ value identify a particular color, and the ‘L’ value indicates the luminance level at which that particular color should be displayed. More particularly, the combination of the ‘a’ value and the ‘b’ value specify what is known as the chromaticity of the pixel, where chromaticity is an objective specification of the quality of a color independent of luminance, and where the combination of the chromaticity of a pixel and the luminance of the pixel specify the visible color of that pixel. For simplicity of explanation, this disclosure considers (i) the ‘L’ value of a given pixel in the {L,a,b} color space to represent the luminance level of that pixel and (ii) the {a,b} values of a given pixel in the {L,a,b} color space to represent the color of that pixel.
The {X,Y,Z} color space is known as a tristimulus color space, and is based on the fact that the human eye has three types of cone cells, which are the types of cells that are responsible for color vision in medium-brightness and high-brightness situations. Each type of cone cell is essentially a filter having its peak sensitivity at a different respective wavelength of light. The {X,Y,Z} color space is similar to the {L,a,b} color space in at least one respect: one of the three values (Y) is used to represent luminance and the other two values (X and Z) in combination are used to specify chromaticity (and therefore color, given a level of luminance). For simplicity of explanation, this disclosure considers (i) the ‘Y’ value of a given pixel in the {X,Y,Z} color space to represent the luminance level of that pixel and (ii) the {X,Z} values of a given pixel in the {X,Y,Z} color space to represent the color of that pixel.
Moreover, in general, as the term is used herein, the “color-distribution dimensionality” of a given set of image data, video data, pixels, and/or the like is an expression of how varied (or not varied) the color values are across the particular data set. Moreover, a given data set that is determined to have a color-distribution dimensionality that is “high-dimensional chromatic” as that term is used herein is one that has been determined to have a relatively widely varying collection of color values across that given data set (i.e., a relatively wide variety of different colors); conversely, a given data set that is determined to have a color-distribution dimensionality that is “low-dimensional chromatic” as that term is used herein is one that has been determined to have only a relatively narrowly varying collection of color values across that given data set (i.e., a relatively narrow concentration of only a relatively small number of different colors).
The graph 300 also includes a scattering of pixels (solid black dots) that are collectively representative of the pixels in an example background video (e.g., a frame of background video) that is deemed in this disclosure to be high-dimensional chromatic. As can be seen in
It is further noted that the number of pixels that is depicted in
As alluded to above, the graph 500 also includes a (generally narrower) scattering of pixels that are collectively representative of the pixels in an example background video (e.g., a frame of background video) that is deemed in this disclosure to be low-dimensional chromatic (unlike the high-dimensional chromatic nature that is depicted in
At step 106, the computing device 200 determines the color-distribution dimensionality of the background video data to be either high-dimensional chromatic or low-dimensional chromatic. As described above,
In at least one embodiment, the computing device 200 carries out step 106 at least in part by carrying out a series of sub-steps. First, the computing device 200 converts the obtained background video data, which in this example is a single frame of background-video data (though in other examples the background-video data could be from or based on multiple frames of background-video data), from the {R,G,B} color space to the {L,a,b} color space. Second, the computing device 200 calculates the {a,b} variance of the converted background pixels. Third, the computing device 200 compares the calculated {a,b} variance to an {a,b}-variance threshold. Fourth and last, the computing device 200 determines the color-distribution dimensionality of the background video data to be (i) high-dimensional chromatic if the calculated {a,b} variance exceeds the {a,b}-variance threshold or (ii) low-dimensional chromatic if the calculated {a,b} variance does not exceed the {a,b}-variance threshold. Various example ways in which these sub-steps could be carried out are described below.
The computing device 200 could calculate the {a,b} variance of the converted background pixels in a number of different ways. In general, as stated above, as used herein, the {a,b} variance of a set of pixels—in this case the converted background pixels—is essentially an expression of how spread out or concentrated the pixels in that set are with respect to the ‘a’ and ‘b’ dimensions.
In some embodiments, the computing device 200 determines an {a,b} variance at each of a plurality of different ‘L’ values (perhaps all ‘L’ values that are represented in the converted background pixels), and on a luminance-level-by-luminance-level basis decides whether the {a,b} variance at each such luminance level exceeds a single-luminance-level threshold or degree of {a,b} variance. The computing device 200 may then count up how many levels have an {a,b} variance that exceeds that single-luminance-level threshold, and then compare that count to a threshold number of levels. In such embodiments, the {a,b}-variance threshold would take the form of a certain threshold number of levels. That number could be zero or greater than zero in various different embodiments; that number could also be expressed as a fraction or percentage of the total number of luminance levels that are represented in the converted background pixels, the total number of possible luminance levels, or some other possibility.
In some embodiments, the computing device 200 similarly determines an {a,b} variance at each of a plurality of different ‘L’ values (perhaps all ‘L’ values that are represented in the converted background pixels), sums those luminance-level-specific {a,b}-variance values, and then compares that sum with an {a,b}-variance threshold, which in such embodiments would take the form of a threshold aggregate amount of {a,b} variance as opposed to a number of luminance levels as described in the previous example. And certainly numerous other manners of calculating an aggregate {a,b} variance of the converted background pixels and comparing the result of that calculation to one or more threshold values could be listed here. And in this context and in others, the use of the {L,a,b} color space is by way of example and not limitation. The {X,Y,Z} color space or any other suitable color space could be used.
With respect to the calculation of the {a,b} variance at any given luminance level, this could involve a rigorous mathematical calculation of variance (i.e., the expected value of the squared deviation from the mean in both the ‘a’ and ‘b’ axes), and could instead or in addition involve a more “rough” calculation or proxy for the {a,b} variance such as the area, circumference, radius, or diameter of a minimum-bounding circle with respect to the pixels (perhaps excluding one or more outliers) at that luminance level. And certainly the dimensions and/or area or the like of shapes other than a minimum-bounding circle could be used as well or instead.
In at least one embodiment, step 106 can be characterized as (i) determining the color-distribution dimensionality of the background video data to be low-dimensional chromatic if the background-color distribution of the background video data in the {L,a,b} color space can be expressed as:
{(L,a,b)|a=fa(L),b=fb(L)},
where fa and fb are functions and (ii) otherwise determining the color-distribution dimensionality of the background video data to be high-dimensional chromatic. This is essentially saying that, if knowing the ‘L’ value of a given pixel is sufficient to identify both the ‘a’ value and the ‘b’ value for that pixel (or at least approximate the ‘a’ and ‘b’ values closely enough because the pixels are relatively concentrated in the a-b plane for all or a sufficient number of ‘L’ values), then the background video data can be characterized as being low-dimensional chromatic; and if not, the background video data can be characterized as being high-dimensional chromatic.
Returning to
In at least one embodiment, the set of chromatic-adjustment techniques includes what is referred to herein as a white-balancing technique. In at least one embodiment, the computing device 200 selects the white-balancing technique when the color-distribution dimensionality of the background video data is determined to be high-dimensional chromatic. In at least one embodiment, the set of chromatic-adjustment techniques includes what is referred to herein as a chromatic-replacement technique. In at least one embodiment, the computing device 200 selects the chromatic-replacement technique when the color-distribution dimensionality of the background video data is determined to be low-dimensional chromatic.
This and the next few paragraphs provide an example as to how the computing device 200 could carry out the white-balancing technique in cases where that is the selected chromatic-adjustment technique. In at least one embodiment, the computing device 200 adjusts the foreground video data using the white-balancing technique at least in part by carrying out a number of sub-steps. First, the computing device 200 determines an average of the pixels of the foreground video data and an average of the pixels in the background video data. In an embodiment, the computing device 200 determines both the foreground average pixel and the background average pixel in the {R,G,B} color space. Next, the computing device 200 converts both the foreground average pixel and the background average pixel from the {R,G,B} color space to a second color space, which could be {L,a,b}, {X,Y,Z}, or some other color space. {L,a,b} is used by way of example in this part of the disclosure.
Next, the computing device 200 determines a transform matrix in {L,a,b} from the converted foreground average pixel to the converted background average pixel. In an embodiment, this transform matrix includes three separate dimension-wise ratios: the ratio of the background-average-pixel ‘L’ value to the foreground-average-pixel ‘L’ value, the ratio of the background-average-pixel ‘a’ value to the foreground-average-pixel ‘a’ value, and the ratio of the background-average-pixel ‘b’ value to the foreground-average-pixel ‘b’ value. And certainly other forms of transform matrices could be used.
The computing device 200 also converts all or substantially all of the pixels of the obtained foreground video data to the second color space, which again is {L,a,b} in this example, and transforms the converted foreground pixels in the second color space using the determined transform matrix. In the case of the transform matrix including the three ratios described in the preceding paragraph, the computing device 200 would transform the converted foreground pixels at least in part by, for each foreground pixel, multiplying the foreground pixel's ‘L’ value by the average-background-L-to-average-foreground-L ratio, (ii) multiplying the foreground pixel's ‘a’ value by the average-background-a-to-average-foreground-a ratio, and (iii) multiplying the foreground pixel's ‘b’ value by the average-background-b-to-average-foreground-b ratio. The computing device 200 may then convert the now-transformed foreground pixels back to the {R,G,B} color space.
This and the next few paragraphs provide an example as to how the computing device 200 could carry out the chromatic-replacement technique in cases where that is the selected chromatic-adjustment technique. In at least one embodiment, the computing device 200 carries out the step of converting all or substantially all of the pixels of the obtained background video data from the {R,G,B} color space to the {L,a,b} color space. It is noted, however, that this conversion step is not necessarily part of carrying out the chromatic-replacement technique, since the computing device 200 may have already converted the background pixels from {R,G,B} to {L,a,b} in order to make the determination as to whether the color-distribution dimensionality of the background video data is high-dimensional chromatic or low-dimensional chromatic. If, however, the computing device 200 had not previously converted the background pixels to {L,a,b}, the computing device 200 may do so as part of—or as a necessary precursor to—carrying out the chromatic-replacement technique. In any event, the chromatic-replacement technique is described below in a manner that presumes that the background pixels have already been converted to {L,a,b}.
As to carrying out the chromatic-replacement technique, the computing device 200 may do so at least in part by carrying out a number of sub-steps. One such sub-step involves generating an L-to-{a,b} lookup table based on the converted background pixels. An example way of doing this is now described in connection with
In
It should be noted that, while it is certainly possible that a given pixel set would have every possible value of ‘L’ represented, it is also certainly possible that there could be a number of actual implementation examples in which there are one or more empty ‘L’ rows (i.e., values of ‘L’ for which no pixels (or perhaps too few pixels) exist in the pixel set and thus for which no characteristic ‘a’ values and characteristic ‘b’ values could be determined). In some embodiments, an extrapolation process is used to fill in the entire table in case characteristic {a,b} values are needed for missing ‘L’ values. In other embodiments, extrapolation takes place on an as-needed basis for missing ‘L’ values. Such extrapolation could involve simply copying the {a,b} data from a nearest ‘L’ entry, or perhaps averaging the {a,b} values from some number of proximate ‘L’ entries that have valid {a,b) data, etc. And certainly other example approaches could be listed as well.
In at least one embodiment, as an additional sub-step in carrying out the chromatic-replacement technique, the computing device 200 converts all or substantially all of the pixels of the foreground video data from the {R,G,B} color space to the {L,a,b} color space. The computing device 200 may do this before or after the generation of the L-to-{a,b} look-up table 900, which may or may not have been done in the above-described manner.
In at least one embodiment, as a further sub-step in carrying out the chromatic-replacement technique, the computing system 200 transforms the converted foreground pixels at least in part by (a) using the respective L values of the respective converted foreground pixels to select respective replacement {a,b} values for the respective converted foreground pixels based on the L-to-{a,b} lookup table 900 and (b) replacing the respective {a,b} values of the respective converted foreground pixels with the corresponding respective selected replacement {a,b} values. In at least one embodiment, as an additional sub-step in carrying out the chromatic-replacement technique, the computing device 200 converts the transformed foreground pixels from {L,a,b} back to {R,G,B}. An example of carrying out these last two sub-steps is described below in connection with
To wit, the graph 1300 is a depiction of the fact that, in this example, the foreground pixels as a group have significantly higher color-distribution dimensionality than do the background pixels as a group. Because the {L,a,b} color space (as does the {X,Y,Z} color space) is defined such that luminance is in a single dimension and color (or chromaticity) is in the other two dimensions, this color space provides a useful visualization tool of the color variance of a given set of pixels at various different luminance levels and also the relative color variance of two different sets of pixels.
As described above, the computing system 200 transforms the converted foreground pixels at least in part by (a) using the respective L values of the respective converted foreground pixels to select respective replacement {a,b} values for the respective converted foreground pixels based on the L-to-{a,b} lookup table 900 and (b) replacing the respective {a,b} values of the respective converted foreground pixels with the corresponding respective selected replacement {a,b} values. An example result of this sub-step of the chromatic-replacement technique is shown in
As described above, in at least one embodiment, in cases where the respective ‘L’ values of the foreground pixels are present in the L-to-{a,b} lookup table 900, the computing device 200 simply replaces the corresponding {a,b} values in the table 1100 with the {a,b} values from that ‘L’ entry in the L-to-{a,b} lookup table 900; and in cases where the respective ‘L’ values of the foreground pixels are not present in the L-to-{a,b} lookup table 900, the computing device 200 replaces the corresponding {a,b} values in the table 1100 with {a,b} values derived by interpolation, perhaps in one of the manners described above, from one or more ‘L’ entries that are present in the L-to-{a,b} lookup table 900.
With respect to the foreground pixels FG-2, FG-156000, and FG-307199, it can be seen in the transformed-foreground-{L,a,b} table 1400 that, while those three pixels still have L=50, each of them now has a=48 and b=32, which are the a50 and b50 values, respectively, from the L-to-{a,b} lookup table 900. Based on the discussion above, it will be evident to one of skill in the art that, while those three pixels previously had three different colors, they have now been transformed to all having the same color due to having the same brightness value.
Thus, the previous variety of light brown, pinkish red, and milk-chocolate brown among those three example pixels has been replaced by three dark-orange pixels. This would correspond to an example where the original background pixels were largely concentrated in the orange/red/brown area of the visible-light spectrum. And a foreground video that would have previously clashed with that background video (due at least to the pinkish red) has been transformed to a foreground video that appealingly sits within the relatively concentrated color range of the original background video.
Returning to
In at least one embodiment, generating the combined video at least in part by combining the adjusted foreground video data with the background video data includes performing a smoothing operation to a boundary between the adjusted foreground video data and the background video data. In an embodiment, the smoothing operation includes a Poisson image-blending technique. And certainly other examples could be listed.
In at least one embodiment, the method 100 also includes (i) obtaining second foreground video data and (ii) adjusting the second foreground video data using the selected chromatic-adjustment technique, and generating the combined video data includes combining the background video data with both the adjusted foreground video data and the adjusted second foreground video data. And clearly this is extendible to any number of foreground videos (e.g., personas of respective participants in a given collaborative online communication session) being obtained, chromatically adjusted based on the background video, and combined with the background video.
At step 114, the computing device 200 outputs the combined video data for display. This step may be performed in several different ways. In at least one embodiment, the computing device 200 outputs the combined video data for display via the display 220 and/or one or more other displays. In at least one embodiment, the computing device 200 outputs the combined video data via a network connection for display on one or more other devices. And certainly other examples could be listed.
Moreover, it is noted that, although the above examples and embodiments are described in the context of adjusting one or more foreground videos based on the color-distribution dimensionality of a single background video, this is not required of all embodiments. Indeed, in some embodiments, the designations of “foreground” and “background” could be reversed or not present at all (i.e., it could simply be the adjustment of a first video based on a color-distribution dimensionality of a second video). Moreover, it also need not be the case that one or more videos are chromatically adjusted based on another video and then combined with that other video; in some cases, one or more videos that are to be combined could each be chromatically adjusted based on a common reference point (e.g., a given white point, grey point, or the like). Indeed, in some embodiments, a “mood” or “style” or other setting could be available to chromatically adjust one or more videos (one or more “foreground” videos, a “background” video, and/or one or more other videos) prior to combination using chromatic profiles such as sepia, high brightness, pastels, earth tones, and/or one or more others deemed suitable by those in the art for a given implementation.
Number | Name | Date | Kind |
---|---|---|---|
5001558 | Burley | Mar 1991 | A |
5022085 | Cok | Jun 1991 | A |
5117283 | Kroos | May 1992 | A |
5227985 | DeMenthon | Jul 1993 | A |
5343311 | Morag | Aug 1994 | A |
5506946 | Bar | Apr 1996 | A |
5517334 | Morag | May 1996 | A |
5534917 | MacDougall | Jul 1996 | A |
5581276 | Cipolla | Dec 1996 | A |
5631697 | Nishimura | May 1997 | A |
5687306 | Blank | Nov 1997 | A |
5875040 | Matraszek | Feb 1999 | A |
6119147 | Toomey | Sep 2000 | A |
6125194 | Yeh | Sep 2000 | A |
6150930 | Cooper | Nov 2000 | A |
6288703 | Berman | Sep 2001 | B1 |
6411744 | Edwards | Jun 2002 | B1 |
6618444 | Haskell | Sep 2003 | B1 |
6661918 | Gordon | Dec 2003 | B1 |
6664973 | Iwamoto | Dec 2003 | B1 |
6760749 | Dunlap | Jul 2004 | B1 |
6798407 | Benman | Sep 2004 | B1 |
6937744 | Toyama | Aug 2005 | B1 |
6973201 | Colmenarez | Dec 2005 | B1 |
7050070 | Ida | May 2006 | B2 |
7124164 | Chemtob | Oct 2006 | B1 |
7317830 | Gordon | Jan 2008 | B1 |
7386799 | Clanton | Jun 2008 | B1 |
7420490 | Gupta | Sep 2008 | B2 |
7420590 | Matusik | Sep 2008 | B2 |
7463296 | Sun | Dec 2008 | B2 |
7512262 | Criminisi | Mar 2009 | B2 |
7518051 | Redmann | Apr 2009 | B2 |
7574043 | Porikli | Aug 2009 | B2 |
7599555 | McGuire | Oct 2009 | B2 |
7602990 | Matusik | Oct 2009 | B2 |
7631151 | Prahlad | Dec 2009 | B2 |
7633511 | Shum | Dec 2009 | B2 |
7634533 | Rudolph | Dec 2009 | B2 |
7668371 | Dorai | Feb 2010 | B2 |
7676081 | Blake | Mar 2010 | B2 |
7692664 | Weiss | Apr 2010 | B2 |
7720283 | Sun | May 2010 | B2 |
7742650 | Ku | Jun 2010 | B2 |
7747044 | Baker | Jun 2010 | B2 |
7755016 | Toda | Jul 2010 | B2 |
7773136 | Ohyama | Aug 2010 | B2 |
7821552 | Suzuki | Oct 2010 | B2 |
7831087 | Harville | Nov 2010 | B2 |
7912246 | Moon | Mar 2011 | B1 |
7965885 | Iwai | Jun 2011 | B2 |
8073196 | Yuan | Dec 2011 | B2 |
8094928 | Graepel | Jan 2012 | B2 |
8131011 | Nevatia | Mar 2012 | B2 |
8146005 | Jones | Mar 2012 | B2 |
8175379 | Wang | May 2012 | B2 |
8175384 | Wang | May 2012 | B1 |
8204316 | Panahpour | Jun 2012 | B2 |
8225208 | Sprang | Jul 2012 | B2 |
8238605 | Chien | Aug 2012 | B2 |
8249333 | Agarwal | Aug 2012 | B2 |
8264544 | Chang | Sep 2012 | B1 |
8300890 | Gaikwad | Oct 2012 | B1 |
8300938 | Can | Oct 2012 | B2 |
8320666 | Gong | Nov 2012 | B2 |
8331619 | Ikenoue | Dec 2012 | B2 |
8331685 | Pettigrew | Dec 2012 | B2 |
8335379 | Malik | Dec 2012 | B2 |
8345082 | Tysso | Jan 2013 | B2 |
8355379 | Thomas | Jan 2013 | B2 |
8363908 | Steinberg | Jan 2013 | B2 |
8379101 | Mathe | Feb 2013 | B2 |
8411149 | Maison | Feb 2013 | B2 |
8396328 | Sandrew | Mar 2013 | B2 |
8406494 | Zhan | Mar 2013 | B2 |
8411948 | Rother | Apr 2013 | B2 |
8422769 | Rother | Apr 2013 | B2 |
8437570 | Criminisi | May 2013 | B2 |
8446459 | Fang | May 2013 | B2 |
8446488 | Yim | May 2013 | B2 |
8477149 | Beato | Jul 2013 | B2 |
8503720 | Shotton | Aug 2013 | B2 |
8533593 | Grossman | Sep 2013 | B2 |
8533594 | Grossman | Sep 2013 | B2 |
8533595 | Grossman | Sep 2013 | B2 |
8565485 | Craig | Oct 2013 | B2 |
8588515 | Bang | Nov 2013 | B2 |
8625897 | Criminisi | Jan 2014 | B2 |
8643701 | Nguyen | Feb 2014 | B2 |
8649592 | Nguyen | Feb 2014 | B2 |
8649932 | Mian | Feb 2014 | B2 |
8655069 | Rother | Feb 2014 | B2 |
8659658 | Vassigh | Feb 2014 | B2 |
8666153 | Hung | Mar 2014 | B2 |
8682072 | Sengamedu | Mar 2014 | B2 |
8701002 | Grossman | Apr 2014 | B2 |
8723914 | Mackie | May 2014 | B2 |
8818028 | Nguyen | Aug 2014 | B2 |
8831285 | Kang | Sep 2014 | B2 |
8854412 | Tian | Oct 2014 | B2 |
8874525 | Grossman | Oct 2014 | B2 |
8890923 | Tian | Nov 2014 | B2 |
8890929 | Paithankar | Nov 2014 | B2 |
8897562 | Bai | Nov 2014 | B2 |
8913847 | Tang | Dec 2014 | B2 |
8994778 | Weiser | Mar 2015 | B2 |
9008457 | Dikmen | Apr 2015 | B2 |
9053573 | Lin | Jun 2015 | B2 |
9065973 | Graham | Jun 2015 | B2 |
9084928 | Klang | Jul 2015 | B2 |
9087229 | Nguyen | Jul 2015 | B2 |
9088692 | Carter | Jul 2015 | B2 |
9117310 | Coene | Aug 2015 | B2 |
9269153 | Gandolph | Feb 2016 | B2 |
9285951 | Makofsky | Mar 2016 | B2 |
9336610 | Ohashi | May 2016 | B2 |
9542626 | Martinson | Jan 2017 | B2 |
20020012072 | Toyama | Jan 2002 | A1 |
20020025066 | Pettigrew | Feb 2002 | A1 |
20020051491 | Challapali | May 2002 | A1 |
20020158873 | Williamson | Oct 2002 | A1 |
20040004626 | Ida | Jan 2004 | A1 |
20040153671 | Schuyler | Aug 2004 | A1 |
20040175021 | Porter | Sep 2004 | A1 |
20050063565 | Nagaoka | Mar 2005 | A1 |
20050094879 | Harville | May 2005 | A1 |
20050219264 | Shum | Oct 2005 | A1 |
20050219391 | Sun | Oct 2005 | A1 |
20050262201 | Rudolph | Nov 2005 | A1 |
20060072022 | Iwai | Apr 2006 | A1 |
20060193509 | Criminisi | Aug 2006 | A1 |
20060221248 | McGuire | Oct 2006 | A1 |
20060259552 | Mock | Nov 2006 | A1 |
20060291697 | Luo | Dec 2006 | A1 |
20070036432 | Xu | Feb 2007 | A1 |
20070070200 | Matusik | Mar 2007 | A1 |
20070110298 | Graepel | May 2007 | A1 |
20070133880 | Sun | Jun 2007 | A1 |
20070146512 | Suzuki | Jun 2007 | A1 |
20070201738 | Toda | Aug 2007 | A1 |
20070269108 | Steinberg | Nov 2007 | A1 |
20080109724 | Gallmeier | May 2008 | A1 |
20080181507 | Gope | Jul 2008 | A1 |
20080219554 | Dorai | Sep 2008 | A1 |
20080266380 | Gorzynski | Oct 2008 | A1 |
20080273751 | Yuan | Nov 2008 | A1 |
20090003687 | Agarwal | Jan 2009 | A1 |
20090044113 | Jones | Feb 2009 | A1 |
20090110299 | Panahpour | Apr 2009 | A1 |
20090144651 | Sprang | Jun 2009 | A1 |
20090199111 | Emori | Aug 2009 | A1 |
20090244309 | Maison | Oct 2009 | A1 |
20090245571 | Chien | Oct 2009 | A1 |
20090249863 | Kim | Oct 2009 | A1 |
20090278859 | Weiss | Nov 2009 | A1 |
20090284627 | Bando | Nov 2009 | A1 |
20090290795 | Criminisi | Nov 2009 | A1 |
20090300553 | Pettigrew | Dec 2009 | A1 |
20100027961 | Gentile | Feb 2010 | A1 |
20100034457 | Berliner | Feb 2010 | A1 |
20100046830 | Wang | Feb 2010 | A1 |
20100053212 | Kang | Mar 2010 | A1 |
20100128927 | Ikenoue | May 2010 | A1 |
20100166325 | Sengamedu | Jul 2010 | A1 |
20100171807 | Tysso | Jul 2010 | A1 |
20100195898 | Bang | Aug 2010 | A1 |
20100278384 | Shotton | Nov 2010 | A1 |
20100302376 | Boulanger | Dec 2010 | A1 |
20100302395 | Mathe | Dec 2010 | A1 |
20100329544 | Sabe | Dec 2010 | A1 |
20110038536 | Gong | Feb 2011 | A1 |
20110090311 | Fang | Apr 2011 | A1 |
20110115886 | Nguyen | May 2011 | A1 |
20110158529 | Malik | Jun 2011 | A1 |
20110193939 | Vassigh | Aug 2011 | A1 |
20110216965 | Rother | Sep 2011 | A1 |
20110216975 | Rother | Sep 2011 | A1 |
20110216976 | Rother | Sep 2011 | A1 |
20110242277 | Do | Oct 2011 | A1 |
20110243430 | Hung | Oct 2011 | A1 |
20110249190 | Nguyen | Oct 2011 | A1 |
20110249863 | Ohashi | Oct 2011 | A1 |
20110249883 | Can | Oct 2011 | A1 |
20110267348 | Lin | Nov 2011 | A1 |
20110293179 | Dikmen | Dec 2011 | A1 |
20110293180 | Criminisi | Dec 2011 | A1 |
20120051631 | Nguyen | Mar 2012 | A1 |
20120127259 | Mackie | May 2012 | A1 |
20120314077 | Clavenna, II | Dec 2012 | A1 |
20130016097 | Coene | Jan 2013 | A1 |
20130028476 | Craig | Jan 2013 | A1 |
20130094780 | Tang | Apr 2013 | A1 |
20130110565 | Means | May 2013 | A1 |
20130129205 | Wang | May 2013 | A1 |
20130142452 | Shionozaki | Jun 2013 | A1 |
20130147900 | Weiser | Jun 2013 | A1 |
20130243313 | Civit | Sep 2013 | A1 |
20130335506 | Carter | Dec 2013 | A1 |
20140003719 | Bai | Jan 2014 | A1 |
20140029788 | Kang | Jan 2014 | A1 |
20140063177 | Tian | Mar 2014 | A1 |
20140085398 | Tian | Mar 2014 | A1 |
20140112547 | Peeper | Apr 2014 | A1 |
20140119642 | Lee | May 2014 | A1 |
20140153784 | Gandolph | Jun 2014 | A1 |
20140229850 | Makofsky | Aug 2014 | A1 |
20140300630 | Flider | Oct 2014 | A1 |
20140307056 | Romea | Oct 2014 | A1 |
20170208243 | Masad | Jul 2017 | A1 |
Number | Date | Country |
---|---|---|
2013019259 | Feb 2013 | WO |
Entry |
---|
Akbarzadeh, A., et al., “Towards Urban 3D Reconstruction From Video,” Third International Symposium on 3D Data Processing, Visualization, and Transmission, pp. 1-8 (Jun. 14-16, 2006). |
Arbelaez, P., et ,al., “Contour detection and hierarchical image segmentation”, Pattern Analysis and Machine Intelligence, IEEE Transactions on 33.4 (2011): 898-916. |
Barnat, Jii'f, et al., “CUDA accelerated LTL Model Checking,” FI MU Report Series, FIMU-RS-2009-05, 20 pages (Jun. 2009). |
Benezeth et al., “Review and Evaluation of Commonly-Implemented Background Subtraction Algorithms”, 2008. |
Canesta™, “See How Canesta's Solution Gesture Control Will Change the Living Room,” retrieved Oct. 21, 2010, from http://canesta.com, 2 pages. |
Carsten, R., et al., “Grabcut: Interactive foreground extraction using iterated graph cuts”, ACM Transactions on Graphics (TOG) 23.3 (2004), pp. 309-314. |
Chan, S.C., et al., “Image-Based Rendering and Synthesis,” IEEE Signal Processing Magazine, pp. 22-31 (Nov. 2007). |
Chan, Shing-Chow, et al. “The Plenoptic Video,” 15(12) IEEE Transactions on Circuits and Systems for Video Technology 1650-1659 (Dec. 2005). |
Chen, Wan-Yu, et al., “Efficient Depth Image Based Rendering with Edge Dependent Depth Filter and Interpolation,” IEEE International Conference on Multimedia and Expo, pp. 1314-1317 (Jul. 6, 2005). |
Cheung et al., “Robust Techniques for Background Subtraction in Urban Traffice Video”, 2004. |
Crabb et al., “Real-Time Foreground Segmentation via Range and Color Imaging”, 2008. |
Debevec, Paul, et al., “Efficient View-Dependent Image-Based Rendering with Projective Texture-Mapping,” In 9th Eurographics Workshop on Rendering, pp. 105-116 (Jun. 1998). |
Fehn, Christoph, et al., “Interactive 3-DTV-Concepts and Key Technologies,” 94(3) Proceedings of the IEEE 524-538 (Mar. 2006). |
GPGPU (General-purpose computing on graphics processing units)—Wikipedia, retrieved Nov. 17, 2009, from http://en.wikipedia.org/wiki/GPGPU, 9 pages. |
Gvili et al., “Depth Keying”, 2003. |
Ho, Yo-Sung, et al., “Three-dimensional Video Generation for Realistic Broadcasting Services,” ITC-CSCC, pp. Tr4 through TR4 (2008). |
Jung, Kwang Hee, et al., “Depth Image Based Rendering for 3D Data Service Over T-DMB,” IEEE, 3DTV-CON'08, Istanbul, Turkey, pp. 237-240 (May 28-30, 2008). |
Kanade, Takeo, et al., “Virtualized Reality: Constructing Virtual Worlds from Real Scenes,” IEEE MultiMedia, pp. 34-46 (Jan.-Mar. 1997). |
Kao, Wen-Chung, et al., “Multistage Bilateral Noise Filtering and Edge Detection for Color Image Enhancement,” 51 (4) IEEE Transactions on Consumer Electronics 1346-1351 (Nov. 2005). |
Kipfer, Peter, “GPU Gems 3—Chapter 33. LCP Algorithms for Collision Detection Using CUDA,” retrieved Nov. 17, 2009, from http://http.developer.nvidia.com/ GPUGems3/qpuqems3 ch33.html, 11 pages (2007). |
Kitagawa et al., “Background Separation Encoding for Surveillance Purpose by using Stable Foreground Separation”, APSIPA, Oct. 4-7, 2009, pp. 849-852. |
Kolmogorov, et al., “Bi-Layer Segmentation of Binocular Stereo Vision”, IEEE, 2005. |
Kubota, Akira, et al., “Multiview Imaging and 3DTV,” IEEE Signal Processing Magazine, pp. 10-21 (Nov. 2007). |
Lee, D.S., “Effective Gaussian Mixture for Video Background Subtraction”, IEEE, vol. 27, No. 5, dated May 2005, pp. 827-832. |
Lee, Eun-Kyung, et al., “High-Resolution Depth Map Generation by Applying Stereo Matching Based on Initial Depth Information,” 3DTV-CON'08, Istanbul, Turkey, pp. 201-204 (May 28-30, 2008). |
Izquierdo' M. Ebroul. “Disparity/segmentation analysis: matching with an adaptive window and depth-driven segmentation.” Circuits and Systems for Video Technology, IEEE Transactions on 9.4 (1999): 589-607. |
Mark, William R., et al., “Post-Rendering 3D Warping,” In Proceedings of 1997 Symposium on Interactive 3D Graphics, Providence, RI, pp. 7-16 (Apr. 27-30, 1997). |
McMillan, Jr., Leonard, “An Image-Based Approach to Three-Dimensional Computer Graphics,” University of North Carolina at Chapel Hill, Chapel Hill, NC, 206 pages (1997). |
Nguyen, Ha T., et al., “Image-Based Rendering with Depth Information Using the Propagation Algorithm,” Proc. of IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 4 pages (Mar. 2005). |
Nguyen, Quang H., et al., “Depth image-based rendering from multiple cameras with 3D propagation algorithm,” Proceedings of the 2nd International Conference on Immersive Telecommunications, 6 pages (2009). |
Nguyen, Quang H., et al., “Depth Image-Based Rendering with Low Resolution Depth,” 16th IEEE International Conference on Image Processing (ICIP), pp. 553-556 (2009). |
Piccardi, M., “Background Subtraction Techniques: A Review”, IEEE, 2004. |
PrimeSense, Home Page, retrieved Oct. 21, 2010, from http://www.primesense.com, 1 page. |
Saxena, Ashutosh, et al., “3-D Depth Reconstruction from a Single Still Image,” 76(1) International Journal of Computer Vision 53-69 (2007). |
Shade, Jonathan, et al., “Layered Depth Images,” Computer Graphics Proceedings, Annual Conference Series, pp. 231-242 (Jul. 19-24, 1998). |
Tomasi, C., et al., “Bilateral Filtering for Gray and Color Images,” Sixth International Conference on Computer Vision, pp. 839-846 (1998). |
Vazquez, C., et al., “3D-TV: Coding of Disocclusions for 2D+Depth Representation of Multi-View Images,” Proceedings of the Tenth IASTED Int'l Conference: Computer Graphics and Imaging, pp. 26-33 (Feb. 13-15, 2008). |
Wang, L., et al., “Tofcut: Towards robust real-time foreground extraction using a time-off camera.”, Proc. of 3DPVT, 2010. |
Xu, F., et al., “Human detection using depth and gray images”, Advanced Video and Signal Based Surveillance, 2003., Proceedings, IEEE Conference on IEEE, 2003. |
Yang, Qingxiong, et al., “Spatial-Depth Super Resolution for Range Images,” IEEE Conference on Computer Vision and Pattern Recognition, pp. 1-8 (2007). |
Zhang, Buyue, et al., “Adaptive Bilateral Filter for Sharpness Enhancement and Noise Removal,” IEEE ICIP, pp. IV-417-IV-420 (2007). |
Zhang, Q., et al., “Segmentation and tracking multiple objects under occlusion from multiview video.”, Image Processing, IEEE Transactions on 20.11 (2011), pp. 3308-3313. |
H. Y. Shum and S. B. Kang, “A Review of Image-based Rendering Techniques,” Proc. IEEE/SPIE Visual Communications and Image (VCIP) 2000, pp. 2-13, Perth, Jun. 2000. |
Um, Gi-Mun, et al., “Three-dimensional Scene Reconstruction Using Multi-View Images and Depth Camera”, pp. 271-280, SPIE-IS&t, vol. 5664, 2005. |
Zitnick, C. Lawrence, et al., “High-quality video view interpolation using a layered representation,” 23(3) Journal ACM Transactions on Graphics (TOG)—Proceedings of ACM SIGGRAPH 2004, pp. 600-608 (Aug. 2004). |
Yacoob, Y., et al., “Detection, analysis and matching of hair,” in Computer Vision, 2005, ICCV 2005. Tenth IEEE International Conference, vol. 1., No., pp. 741-748, vol. 1, Oct. 17-21, 2005. |
Talukder, A., et al., “Real-time detection of moving objects in a dynamic scene from moving robotic vehicles,” in Intelligent Robots and Systems, 2003. (IROS 2003). Proceedings. 2003 IEEE/RSJ international Conference on, vol. 2, pp. 1308-1313, vol. 2, Oct. 27-31, 2003. |
Sheasby, G., et al., “A robust stereo prior for human segmentation”, In ACCV, 2012. |
Hradis, M., et al., “Real-time Tracking of Participants in Meeting Video”, Proceedings of CESCG, Wien, 2006. |
Working screenshot of Snagit manufactured by Techsmith, released Apr. 18, 2014. |
Number | Date | Country | |
---|---|---|---|
20170359559 A1 | Dec 2017 | US |