The present disclosure relates generally to 3D image processing, and more particularly, to a system for background subtraction from images in a video stream using a three-dimensional camera.
Background subtraction (BGS) refers to the ability to remove unwanted background from a live video. Some current video conferencing programs use BGS technology to subtract and replace the background with another prerecorded still or moving background.
There have been several methods developed for BGS using color information only. These methods are either not robust for challenging, but common, situations such as a moving background and changing lighting, or too computationally expensive to be able to run in real-time. The recent emergency of depth cameras provides an opportunity to develop robust, real-time BGS systems using depth information. However, due to current hardware limitations, some of which are fundamental, recorded depth video has poor quality. Notable problems with recorded depth are noisy and instable depth values around object boundaries, and the loss of depth values in hair of a person or shiny object areas, such as belt buckles. As a result, background removal by a simple depth thresholding-referred to as Basic BGS herein-inherits a lot of annoying visual artifacts. Ideally, a robust system will detect and eliminate visual artifacts, and reduce jitter and roughness around edges contiguous with a removed background.
A more particular description of the disclosure briefly described above will be rendered by reference to the appended drawings. Understanding that these drawings only provide information concerning typical embodiments and are not therefore to be considered limiting of its scope, the disclosure will be described and explained with additional specificity and detail through the use of the accompanying drawings.
By way of introduction, the present disclosure relates to a system having a computing device (or other computer) coupled with a three-dimensional (3D) camera for subtracting a background (BG) from a video feed. The system may also replace the removed background with a new background, whether a still or video image. The system executes various, or all, of the steps executable by a background subtraction module disclosed herein to achieve step-by-step improvement in a robustness and quality of the result. That is, the module as executed by a processor eliminates the artifacts, noise, and the instability of the depth information around edges of one or more target person—also referred to as subject herein—that is to remains as foreground (FG) when the background is subtracted.
The system receives a video feed from the 3D camera that contains colored images of the one or more subject that includes depth information. For each colored image extracted from the video feed, the system segments colored pixels and corresponding depth information of the images into three different regions including foreground (FG), background (BG), and unclear (UC). The system may then categorize UC pixels as FG or BG using a function that considers the color and background history (BGH) information associated with the UC pixels and the color and BGH information associated with pixels near the UC pixels. Pixels that are near other pixels may also be referred to herein as neighbor pixels, which are pixels within a predetermined-sized window that includes the pixel of reference.
The system may also examine the pixels marked as FG and apply temporal and spatial filters to smooth boundaries of the FG regions. The system may then construct a new image by overlaying the FG regions on top of a new background, and display a video feed of the new image in a display device coupled with the computing device. The new background may include still images or video. The FG region that remains preferably includes one or more target subjects that are to be transferred from the processed image to the new image. The system may also continually maintain the BGH to keep it up to date for continued processing across multiple images within a video stream. Additional or different steps are contemplated and explained with reference to the Figures herein.
The 3D camera 103 includes, among other components, a red/green/blue (RGB) sensor 113, an infrared (IR) sensor 115, and an IR illuminator 117. The IR illuminator 117 shines light through a lens of the camera 103 and the infrared sensor 115 receives the depth information of the reflected light, giving definition to objects within view or in the “scene” of the camera 103. The RGB sensor 113 captures the colored pixel information in the scene of the captured video image. The 3D camera 103 may also include synchronization hardware and/or software 119 embedded therein to temporally synchronize the IR illuminator 117, the IR sensor 115, and the RGB sensor 113 together. The 3D camera 103 may also include a 3D application programming interface (API) 121, which may be programmed to receive the depth information (Z) 123, the brightness (B) 125, and RGB pixel 127 information of a reflected video image as captured by the 3D camera 103. The 3D API 121 provides the IO structure and interface programming required to pass this information 123, 125, and 127 to the computer or computing device 101.
The computing device 101 may further include, or be coupled with, a background subtraction module 129 stored in memory and executable by a processor, a post-processing module 131, background subtraction application programming interface (API) 133, a background history (BGH) storage 135 part of memory, and a display 139 such as a computer screen/monitor or a plasma or LCD screen of a television or smart device. Accordingly, the computing device 101 may include a desktop, laptop, smart phone, or other mobile or stationary computing device having sufficient processing power to execute the background subtraction module 129. Where X and Y axes may be referred to herein, it is with reference to a two-dimensional (2D) plane cut through some point along the Z axis.
The computing device 101 may process the background subtraction module with reference to sequential sets of images from the video feed continually in real time. The post-processing module 131 may, for instance, overlay the surviving FG regions onto a new background image, whether from a still or a video, to create a new image. Sequential, real-time processing may yield a series of such new images over the top of the new background to create a new video feed having the old background replaced with the new background. The computer 101 may then display the one or more subject in front of the new background on the display screen 139 for viewing by the user.
During the process of processing sequential colored images from an incoming video feed, background history of the sequential colored images may be kept up to date in the BGH storage 135. This history allows tracking the BG status of pixels in previous frames, e.g., whether the pixels were previously categorized as BG. This process and the way the background module incorporates BGH into a decision whether to categorized UC regions as BG will be discussed in more detail below.
At block 202, the system 100 may receive depth 123 and color 127 information of a colored image and perform depth and IR thresholding, thus segmenting colored pixels and corresponding depth information of the images into three different regions including foreground (FG), background (BG), and unclear (UC). The result of the depth and IR thresholding of the image is a region map that shows the three regions pictorially. In block 204, the system 100 may identify and clean FG, BG, and UC three-dimensional connected components. At block 206, the system 100 may enable a user 109 to select a user mode that depends on how close a target subject is located with reference to the camera 103. At block 208, the system 100 may clean the UC region under a center of mass (COM) of the target subject. At block 210, the system 100 may warp the image from a depth point of view to a color point of view, so that the depth and color information are aligned in 3D-space. At block 212, the system 100 may receive RGB color information 127 and clean the remaining UC region with background history (BGH). At block 214, the system 100 may interpolate the region map to categorize uncategorized pixels in the RGB image which have unknown depth value and unknown region value as FG or UC depending on region information of neighbor pixels. At block 216, the system 100 may dilate the UC region outward to surrounding pixels that are not in the FG region. At block 218, the system 100 may detect a FG fringe, which may include a thin area along the boundaries of the FG edges, e.g., those edges between the FG region and the UC region or the BG region. At block 220, the system 100 may update the BGH.
At block 222, the system 100 may clean the UC region using neighbor pixels, which step focuses on cleaning along the colored edge of the FG region. At block 224, the system 100 may clean the UC region under the COM of the target subject. At block 226, the system 100 may apply a median filter to the UC region to remove very small UC region, then merge the remaining UC regions into the FG regions. At block 228, the system 100 may stabilize and smooth the edges of the FG region(s). At block 230, the system 100 may check for reset conditions, and if present, sets a reset flag. At block 234, the system 100 determines if the reset flag is true, and if so, resets the flag. At block 240, the system may reset both the BGH and a BG mask of the region map. Processing by the background subtraction module 121 of the system 100 may then continue with another image from the video feed. Sequential processing of colored images may lead to a continuous, real-time video feed having the BG subtracted therefrom. At block 234, if the reset flag has not been set, e.g., it has a false value, the system 100 continues operation at block 202 again to continue processing sequential images. The same is true after resetting the BG mask and BGH at block 240.
As discussed earlier, the “z” as used herein is with reference to a depth value of a particular pixel. A smaller value of z indicates that a pixel is closer to the camera 103. The term “b” refers to brightness or, in other words, the IR intensity collected by the IR sensor. With regards to a particular pixel, the higher the intensity (b) value is, the more confidently the system 100 can differentiate the real signal from ambient noise, and the more the system 100 can trust the depth value. Values segmented into a FG or BG region are done with high confidence, whereas pixels initially segmented into the UC region are pixels with regards to which the system 100 is unsure how to categorize. Accordingly, if pixels of a colored image are not categorizable as either FG or BG, the pixels may be categorized as UC. Note that pixels in the same region do not need to be adjacent or near each other to be categorized, as displayed in
One set of rules to drive this segmentation of the pixels of an image is for the system 100 to: (1) categorize the pixel as foreground (FG) if a depth thereof is less than a predetermined threshold distance from the camera and a intensity thereof is greater than a predetermined threshold intensity; (2) categorize the pixel as unclear (UC) if a depth thereof is less than the predetermined threshold distance and an intensity thereof is less than the predetermined threshold strength; and (3) categorize all other pixels not categorized as FG or UC as background (BG). These rules are cast below in Equation 1, which depicts a region map, rmap[i].
The system 100, in executing block 204, begins by detecting and labeling pixels that are adjacent to each other, in the same region, and that have similar depth values as region-specific connected components. In other words, the depth values of two adjacent pixels in the same component is smaller than a predetermined threshold. For instance, the system may detect and label FG-connected components in 3D space (XY plane plus depth, Z). The system 100 thus groups pixels that are determined to be connected components for common processing. In the follow expressions, D is the depth image, p is a pixel, R is the region-labeled map, N(p) are adjacent pixels around pixel p. A 3D connected-component label CkϵC is defined as Ck={pϵD: ∀pjϵN(p), R(pj)=R(p), ID(pj)−D(p) I<δ}. Let M be a connected component label map. For example M(pi) may be equal to Ck where C is a set of connected components and where Ck is a connected component (k) in that set.
Note that there may be many components in a region; however, every pixel in the same component includes the same region label. When a UC component is referred to, reference is being made to a connected component in the UC region, for instance.
A meaningful component is a component whose area is larger than some threshold value, γ. A large UC component, however, is most likely a meaningless component, for example, a part of a wall, a ceiling, or a floor. There are, however, some small-but-meaningful UC component such as human hair, a belt, and a cell phone because these objects tend to absorb infrared (IR) and are objects that should be kept for further processing. The trick is differentiating between meaningful UC components with other noisy small UC components. In general, the meaningful UC components are going to be found adjacent to large, meaningful FG components. From these observations, the system 100 is programmed to delete components based on the following rules:
Rule 1: Categorize as BG any FG connected component having a cross-sectional area less than a predetermined threshold area, γ.
Rule 2: Categorize as BG any UC connected component having a cross-sectional area greater than γ, where γ may be different than γ.
Rule 3: Categorize as BG any UC connected component having a cross-sectional area less than γ and for which no adjacent component thereof includes a FG connected component having a cross-sectional area greater than γ.
Note that categorizing FG or UC connected components as BG will have the result of ultimately removing those components when the BG is subtracted.
In preparation for image processing under other blocks, the system may, at or near block 204, find the center of mass (COM) of large FG connected components, such as a target subject, and compute the average depth value for each FG component. In other words, for a FG component
is the x coordinate of pixel p. From the same formula for COMy(i), compute the average depth as:
For each of the FG components, the system 100 categorizes all the UC pixels that lie under the COM as BG, thus cleaning those portions from further processing within the UC region. The follow is example pseudo code for block 208:
For each pixel pϵD such that y(p)<COMy//vertically under the COM point
The purpose of block 208 is to help reduce errors caused by unexpected noise around the user and reduce processing time. Simultaneously, the system 100 is still able to keep a hair part, for instance, in the UC region for further processing in subsequent steps that the system 100 may execute, which are shown in
More particularly, each point of an image in 2D space can be mapped one to one with a ray in 3D space that goes through the camera position. Given a 2D image plane with basis vectors ({right arrow over (s)},{right arrow over (t)}) and a 3D space ({right arrow over (i)},{right arrow over (j)},{right arrow over (k)}), the 2D point to 3D ray mapping relation is:
where (u, v) is the 2D coordinate of the point in the image plane; r represents the direction of the corresponding ray; {right arrow over (s)}ijk,{right arrow over (t)}ijk, and {right arrow over (w)}ijk are representations of {right arrow over (s)}, {right arrow over (t)} and viewing direction {right arrow over (w)} in {{right arrow over (i)},{right arrow over (j)},{right arrow over (k)}}. Matrix P is called the mapping matrix.
Consider a point X in 3D space {{right arrow over (i)},{right arrow over (j)},{right arrow over (k)}}. Let {right arrow over (x)}r, and {right arrow over (x)}d be homogeneous coordinates of X in the reference image plane and the desired image plane as shown in
where d({right arrow over (x)}r) is the depth value of point {right arrow over (x)}r.
The BGH is a frame that contains only background (BG) pixels. The frame is built in an accumulated fashion from the previous frame. At block 212 of
Dilation is one of the two basic operators in the area of mathematical morphology, the other being erosion. It is typically applied to binary images, but there are versions that work on grayscale images. The basic effect of the mathematical morphology operator on a binary image is to gradually enlarge the boundaries of regions of foreground pixels (i.e. white pixels, typically). Thus areas of foreground pixels grow in size while holes within those regions become smaller.
The purpose of detecting the FG fringe and merging it into the UC region is as follows. Due to the tolerance in registration (or warping between the depth information and color image), depth resolution, interpolation and flickering artifacts, the region map edges shown in
Block 224 repeats this cleaning step because the system 100 expanded the UC region around the region map edges at block 216, and after block 222, there may still exist some unresolved UC pixels. Because, after the next step, the UC pixels are set to FG (to recover the top part of the hair), so block 224 helps reduce errors caused by unexpected noisy edges around the user without affecting the hair part (or other reflectance-sensitive area).
To execute block 226, the system 100 may remove very small remaining UC connected components, also referred to as fragments, but keep and smoothen the edges of big UC connected components such as part or all of the hair of a target subject. A 7×7 support window may be applied by the median filter to the UC connected components, for instance, or another suitably-sized window may be applied. Then the UC region may be merged with the FG region. Pseudo code to be executed by the system 100 at block 226 may include:
At block 230 of
In a networked deployment, the computer system 2900 may operate in the capacity of a server or as a client-user computer in a server-client user network environment, or as a peer computer system in a peer-to-peer (or distributed) network environment. The computer system 2900 may also be implemented as or incorporated into various devices, such as a personal computer or a mobile computing device capable of executing a set of instructions 2902 that specify actions to be taken by that machine, including and not limited to, accessing the Internet or Web through any form of browser. Further, each of the systems described may include any collection of sub-systems that individually or jointly execute a set, or multiple sets, of instructions to perform one or more computer functions.
The computer system 2900 may include a processor 2904, such as a central processing unit (CPU) and/or a graphics processing unit (GPU). The Processor 2904 may include one or more general processors, digital signal processors, application specific integrated circuits, field programmable gate arrays, digital circuits, optical circuits, analog circuits, combinations thereof, or other now known or later-developed devices for analyzing and processing data. The processor 2904 may implement the set of instructions 2902 or other software program, such as manually-programmed or computer-generated code for implementing logical functions. The logical function or any system element described may, among other functions, process and/or convert an analog data source such as an analog electrical, audio, or video signal, or a combination thereof, to a digital data source for audio-visual purposes or other digital processing purposes such as for compatibility for computer processing.
The computer system 2900 may include a memory 2908 on a bus 2912 for communicating information. Code operable to cause the computer system to perform any of the acts or operations described herein may be stored in the memory 2908. The memory 2908 may be a random-access memory, read-only memory, programmable memory, hard disk drive or any other type of volatile or non-volatile memory or storage device.
The computer system 2900 may also include a disk or optical drive unit 2914. The disk drive unit 2914 may include a computer-readable medium 2918 in which one or more sets of instructions 2902, e.g., software, can be embedded. Further, the instructions 2902 may perform one or more of the operations as described herein. The instructions 2902 may reside completely, or at least partially, within the memory 3208 and/or within the processor 2904 during execution by the computer system 2900. Accordingly, the BGH database described above in
The memory 2908 and the processor 2904 also may include computer-readable media as discussed above. A “computer-readable medium,” “computer-readable storage medium,” “machine readable medium,” “propagated-signal medium,” and/or “signal-bearing medium” may include any device that includes, stores, communicates, propagates, or transports software for use by or in connection with an instruction executable system, apparatus, or device. The machine-readable medium may selectively be, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, device, or propagation medium.
Additionally, the computer system 2900 may include an input device 2924, such as a keyboard or mouse, configured for a user to interact with any of the components of system 2900. It may further include a display 2929, such as a liquid crystal display (LCD), a cathode ray tube (CRT), or any other display suitable for conveying information. The display 2929 may act as an interface for the user to see the functioning of the processor 2904, or specifically as an interface with the software stored in the memory 2908 or the drive unit 2914.
The computer system 2900 may include a communication interface 2936 that enables communications via the communications network 116. The network 116 may include wired networks, wireless networks, or combinations thereof. The communication interface 2936 network may enable communications via any number of communication standards, such as 802.11, 802.17, 802.20, WiMax, cellular telephone standards, or other communication standards.
Accordingly, the method and system may be realized in hardware, software, or a combination of hardware and software. The method and system may be realized in a centralized fashion in at least one computer system or in a distributed fashion where different elements are spread across several interconnected computer systems. Any kind of computer system or other apparatus adapted for carrying out the methods described herein is suited. A typical combination of: hardware and software may be a general-purpose computer system with a computer program that, when being loaded and executed, controls the computer system such that it carries out the methods described herein. Such a programmed computer may be considered a special-purpose computer.
The method and system may also be embedded in a computer program product, which includes all the features enabling the implantation of the operations described herein and which, when loaded in a computer system, is able to carry out these operations. Computer program in the present context means any expression, in any language, code or notation, of a set of instructions intended to cause a system having an information processing capability to perform a particular function, either directly or after either or both of the following: a) conversion to another language, code or notation; b) reproduction in a different material form.
The above-disclosed subject matter is to be considered illustrative, and not restrictive, and the appended claims are intended to cover all such modifications, enhancements, and other embodiments, which fall within the true spirit and scope of the present disclosure. Thus, to the maximum extent allowed by law, the scope of the present embodiments are to be determined by the broadest permissible interpretation of the following claims and their equivalents, and shall not be restricted or limited by the foregoing detailed description. While various embodiments have been described, it will be apparent to those of ordinary skill in the art that many more embodiments and implementations are possible within the scope of the above detailed description. Accordingly, the embodiments are not to be restricted except in light of the attached claims and their equivalents.
This application is a continuation of U.S. application Ser. No. 15/389,952, filed Dec. 23, 2016, entitled “SYSTEM FOR BACKGROUND SUBTRACTION WITH 3D CAMERA”, which is a continuation of U.S. application Ser. No. 14/805,335, filed Jul. 21, 2015, entitled “SYSTEM FOR BACKGROUND SUBTRACTION WITH 3D CAMERA”, now U.S. Pat. No. 9,530,044, which is a continuation of U.S. application Ser. No. 14/174,498, filed Feb. 6, 2014, entitled “SYSTEM FOR BACKGROUND SUBTRACTION WITH 3D CAMERA”, now U.S. Pat. No. 9,087,229, which is a continuation of U.S. application Ser. No. 12/871,428, filed Aug. 30, 2010, entitled “SYSTEM FOR BACKGROUND SUBTRACTION WITH 3D CAMERA”, now U.S. Pat. No. 8,649,592, each of which are hereby incorporated by reference in its entirety.
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 |
6600475 | Gutta | Jul 2003 | B2 |
6618444 | Haskell | Sep 2003 | B1 |
6658136 | Brumitt | Dec 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 | Xu | 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 |
9530044 | Nguyen | Dec 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 |
20050285874 | Zitnick, III | Dec 2005 | A1 |
20050286759 | Zitnick, III | Dec 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 |
20080158340 | Shibata | Jul 2008 | A1 |
20080181507 | Gope | Jul 2008 | A1 |
20080184124 | Agarwal | Jul 2008 | A1 |
20080219554 | Dorai | Sep 2008 | A1 |
20080246759 | Summers | Oct 2008 | A1 |
20080266380 | Gorzynski | Oct 2008 | A1 |
20080273751 | Yuan | Nov 2008 | A1 |
20080316328 | Steinberg | Dec 2008 | A1 |
20080317378 | Steinberg | Dec 2008 | A1 |
20090003687 | Agarwal | Jan 2009 | A1 |
20090044113 | Jones | Feb 2009 | A1 |
20090110299 | Panahpour | Apr 2009 | A1 |
20090116732 | Zhou | May 2009 | A1 |
20090116766 | Matsumoto | May 2009 | A1 |
20090144651 | Sprang | Jun 2009 | A1 |
20090154807 | Rossato | Jun 2009 | A1 |
20090199111 | Emori | Aug 2009 | A1 |
20090219379 | Rossato | Sep 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 |
20110007183 | Kahlman | Jan 2011 | 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 |
20120019728 | Moore | Jan 2012 | A1 |
20120051631 | Nguyen | Mar 2012 | A1 |
20120127259 | Mackie | May 2012 | A1 |
20120287233 | Wang | Nov 2012 | A1 |
20120314077 | Clavenna, II | Dec 2012 | A1 |
20120317511 | Bell | Dec 2012 | A1 |
20130016097 | Coene | Jan 2013 | A1 |
20130028476 | Craig | Jan 2013 | A1 |
20130084006 | Zhang | Apr 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 |
20150029294 | Lin | Jan 2015 | A1 |
20150187076 | DennisLin | Jul 2015 | A1 |
20150189146 | Venshtain | Jul 2015 | A1 |
20160343141 | Lin | Nov 2016 | A1 |
20170109872 | Nguyen | Apr 2017 | A1 |
20170208243 | Masad | Jul 2017 | A1 |
Number | Date | Country |
---|---|---|
2013019259 | Feb 2013 | WO |
Entry |
---|
Arbelaez, P., et ,al., “Contour detection and hierarchical image segmentation”, Pattern Analysis and Machine Intelligence, IEEE Transactions on 33.4 (2011): 898-916. |
Benezeth et al., “Review and Evaluation of Commonly-Implemented Background Subtraction Algorithms”, 2008. |
Carsten, R., et al., “Grabcut: Interactive foreground extraction using iterated graph cuts”, ACM Transactions on Graphics (TOG) 23.3 (2004), pp. 309-314. |
Crabb et al., “Real-Time Foreground Segmentation via Range and Color Imaging”, 2008. |
Gvili et al., “Depth Keying”, 2003. |
Kolmogorov, et al., “Bi-Layer Segmentation of Binocular Stereo Video”, IEEE, 2005. |
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. |
Piccardi, M., “Background Subtraction Techniques: A Review”, IEEE, 2004. |
Wang, L., et al., “Tofcut: Towards robust real-time foreground extraction using a Time-of-Flight 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. |
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. |
Kitagawa et al., “Background Separation Encoding for Surveillance Purpose by using Stable Foreground Separation”, APSIPA, Oct. 4-7, 2009, pp. 849-852. |
Lee, D.S., “Effective Gaussian Mixture Learning for Video Background Subtraction”, IEEE, vol. 27, No. 5, dated May 2005, pp. 827-832. |
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). |
Barnat, Jii'f, et al., “CUDA accelerated LTL Model Checking,” FI MU Report Series, FIMU-RS-2009-05, 20 pages (Jun. 2009). |
Canesta™, “See How Canesta's Solution Gesture Control Will Change the Living Room,” retrieved Oct. 21, 2010, from http://canesta.com, 2 pages. |
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). |
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. |
Ho, Yo-Sung, et al., “Three-dimensional Video Generation for Realistic Broadcasting Services,” ITC-CSCC, pp. TR-1 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). |
Kubota, Akira, et al., “Multiview Imaging and 3DTV,” IEEE Signal Processing Magazine, pp. 10-21 (Nov. 2007). |
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). |
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). |
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). |
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). |
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). |
Working screenshot of Snagit manufactured by Techsmith, released Apr. 18, 2014. |
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. |
Cheung et al., “Robust Techniques for Background Subtraction in Urban Traffic Video”, 2004. |
Number | Date | Country | |
---|---|---|---|
20180089814 A1 | Mar 2018 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15389952 | Dec 2016 | US |
Child | 15785407 | US | |
Parent | 14805335 | Jul 2015 | US |
Child | 15389952 | US | |
Parent | 14174498 | Feb 2014 | US |
Child | 14805335 | US | |
Parent | 12871428 | Aug 2010 | US |
Child | 14174498 | US |