US 7,606,417 B2Grant
Foreground/background segmentation in digital images with differential exposure calculations
Issue Date:2009-10-20
•47 Claims
•7 Drawing Sheets
Abstract
A digital segmentation method and apparatus determines foreground and/or background within at least one portion of a captured image. The determining includes comparing a captured image to a pre-captured or post captured reference image of nominally the same scene. One of the images is taken with flash and the other without. The system can be implemented as part of a digital camera acquisition chain having effective computation complexity.
Metadata
Assignee
- FotoNation Vision Limited
Inventors
- Eran Steinberg
- Yury Prilutsky
- Peter Corcoran
- Petronel Blgiol
Application Information
Application Number:US 11/217,788
Filing Date:2005-08-30
Priority Date:2004-08-16
Art Unit:2624
Classifications
IPC:
G06K9/34
Patent Drawings (7 sheets)
Description
Priority
[0001] This application is a continuation-in-part to United States patent application Ser. No. 10/919,226, filed Aug. 16, 2004, which is related to U.S. applications No. 10/635,918, filed Aug. 5, 2003 and Ser. No. 10/773,092, filed Feb. 4, 2004. Each of these applications is hereby incorporated by reference.
Background
[0002] 1. Field of the Invention
[0003] The invention relates to an image segmentation method and system, and in particular to a tool for determining regions indicative of foreground and background based on exposure analysis of captured and reference images.
[0004] 2. Description of the Related Art
[0005] Image segmentation involves digital image processing wherein an image is broken down into regions based on some predefined criteria. These criteria may be contextual, numerical, shape, size, and/or color-related, gradient-related and more. It is desired to have a technique for determining the foreground and background of digital images for numerous image processing operations. Such operations may include image enhancement, color correction, and/or object based image analysis. In the specific case of processing inside of an acquisition device, it is desired to perform such segmentation expeditiously, while utilizing suitable computations of relatively low complexity, for example, for performing calculations in-camera or in handset phones equipped with image acquisition capabilities.
Summary of the Invention
[0006] A digital image acquisition system is provided having no photographic film. The system includes an apparatus for capturing digital images, a flash unit for providing illumination during image capture, and a segmentation tool for determining regions indicative of foreground and/or background within at least one portion of a captured image. The determining is effected as a function of a comparison of a captured image and a reference image of nominally the same scene. One of the captured and reference images is taken with flash and the other is taken without flash.
[0007] While available ambient light such as sunlight is in general more spatially uniform in nature than strobe lighting, especially for point-and-shoot cameras (as opposed to studio settings with multiple strobe units) that originates from or close to the camera. Due to the fact that the strobe energy is inverse to the square of the distance, the closer the object is, the stronger the light on the object will be. The overall light distribution will vary between the two images, because one shot or subset of shots will be illuminated only with available ambient light while another will be illuminated with direct flash light.
[0008] A background/foreground segmented image can be used in numerous digital image processing algorithms such as algorithms to enhance the separation of the subject, which is usually in the foreground, from the background. This technique may be used to enhance depth of field, to enhance or eliminate the background altogether, or to extract objects such as faces or people from an image.
[0009] By reducing the area which is subjected to an image processing analysis, processing time is reduced substantially for many real-time algorithms. This is particularly advantageous for algorithms implemented within a digital image acquisition device where it is desired to apply image processing as part of the main image acquisition chain. Thus, the click-td-click time of a digital camera is improved. In certain embodiments it may advantageously allow multiple image processing techniques to be employed where previously only a single technique was applied. It can also serve to reduce occurrences of false positives for certain image processing algorithms where these are more likely to occur in either the background or foreground regions of an image.
[0010] The invention may be applied to embedded devices with limited computation capability. It can be used also to improve productivity, in particular where large amounts of images are to be processed, such as for security based facial detection, large volume printing systems or desktop analysis of a collection of images. The invention may be applied to still image capture devices, as well as for video or continuous capture devices with stroboscopic capability.
Brief Description of Drawings
[0011] Preferred embodiments will now be described, by way of example, with reference to the accompanying drawings, in which:
[0012] FIG. 1 is a block diagram of a camera apparatus operating in accordance with a preferred embodiment.
[0013] FIGS. 2( a), 2(b) and 2(c) illustrate a detailed workflow in accordance with preferred embodiments.
[0014] FIG. 3 is a graph illustrating the distributions in pixel intensities for a flash and non-flash version of an image.
[0015] FIG. 4 illustrates the alignment process used in the workflow of FIG. 2( a).
Detailed Description of Preferred Embodiments
[0016] FIG. 1 shows a block diagram of an image acquisition device 20 operating in accordance with a preferred embodiment. The digital acquisition device 20, which in the present embodiment is a portable digital camera, includes a processor 120. It can be appreciated that many of the processes implemented in the digital camera may be implemented in or controlled by software operating in a microprocessor, central processing unit, controller, digital signal processor and/or an application specific integrated circuit, collectively depicted as block 120 labelled “processor”. Generically, user interface and control of peripheral components such as buttons and display is controlled by a μ-controller 122.
[0017] The processor 120, in response to a user input at 122, such as half pressing a shutter button (pre-capture mode 32), initiates and controls the digital photographic process. Ambient light exposure is determined using light sensor 40 in order to automatically determine if a flash is to be used. The distance to the subject is determined using focusing means 50 which also focuses the image on image capture component 60. If a flash is to be used, processor 120 causes the flash 70 to generate a photographic flash in substantial coincidence with the recording of the image by image capture component 60 upon full depression of the shutter button.
[0018] The image capture component 60 digitally records the image in color. The image capture component 60 is known to those familiar with the art and may include a CCD (charge coupled device) or CMOS to facilitate digital recording. The flash may be selectively generated either in response to the light sensor 40 or a manual input 72 from the user of the camera. The image I(x,y) recorded by image capture component 60 is stored in image store component 80 which may comprise computer memory such a dynamic random access memory or a non-volatile memory. The camera is equipped with a display 100, such as an LCD, for preview and post-view of images.
[0019] In the case of preview images P(x,y), which are generated in the pre-capture mode 32 with the shutter button half-pressed, the display 100 can assist the user in composing the image, as well as being used to determine focusing and exposure. A temporary storage space 82 is used to store one or plurality of the preview images and can be part of the image store means 80 or a separate component. The preview image is usually generated by the image capture component 60. Parameters of the preview image may be recorded for later use when equating the ambient conditions with the final image. Alternatively, the parameters may be determined to match those of the consequently captured, full resolution image. For speed and memory efficiency reasons, preview images may be generated by subsampling a raw captured image using software 124 which can be part of a general processor 120 or dedicated hardware or combination thereof, before displaying or storing the preview image. The sub sampling may be for horizontal, vertical or a combination of the two. Depending on the settings of this hardware subsystem, the pre-acquisition image processing may satisfy some predetermined test criteria prior to storing a preview image. Such test criteria may be chronological—such as to constantly replace the previous saved preview image with a new captured preview image every 0.5 seconds during the pre-capture mode 32, until the final full resolution image I(x,y) is captured by full depression of the shutter button. More sophisticated criteria may involve analysis of the of the preview image content, for example, testing the image for changes, or the detection of faces in the image before deciding whether the new preview image should replace a previously saved image. Other criteria may be based on image analysis such as the sharpness, detection of eyes or metadata analysis such as the exposure condition, whether a flash is going to happen, and/or the distance to the subjects.
[0020] If test criteria are not met, the camera continues by capturing the next preview image without saving the current one. The process continues until the final full resolution image I(x,y) is acquired and saved by fully depressing the shutter button.
[0021] Where multiple preview images can be saved, a new preview image will be placed on a chronological First In First Out (FIFO) stack, until the user takes the final picture. The reason for storing multiple preview images is that the last image, or any single image, may not be the best reference image for comparison with the final full resolution image in. By storing multiple images, a better reference image can be achieved, and a closer alignment between the preview and the final captured image can be achieved in an alignment stage discussed further in relation to FIGS. 2( a)-2(c) and 4. Other reasons for capturing multiple images are that a single image may be blurred due to motion, the focus not being set, and/or the exposure not being set.
[0022] In an alternative embodiment, the multiple images may be a combination of preview images, which are images captured prior to the main full resolution image and postview images, which are image or images captured after said main image. In one embodiment, multiple preview images may assist in creating a single higher quality reference image; either higher resolution or by taking different portions of different regions from the multiple images.
[0023] A segmentation filter 90 analyzes the stored image I(x,y) for foreground and background characteristics before forwarding the image along with its foreground/background segmentation information 99 for further processing or display. The filter 90 can be integral to the camera 20 or part of an external processing device 10 such as a desktop computer, a hand held device, a cell phone handset or a server. In this embodiment, the segmentation filter 90 receives the captured image I(x,y) from the full resolution image storage 80 as well as one or a plurality of preview images P(x,y) from the temporary storage 82.
[0024] The image I(x,y) as captured, segmented and/or further processed may be either displayed on image display 100, saved on a persistent storage 112 which can be internal or a removable storage such as CF card, SD card, USB dongle, or the like, or downloaded to another device, such as a personal computer, server or printer via image output component 110 which can be tethered or wireless. The segmentation data may also be stored 99 either in the image header, as a separate file, or forwarded to another function which uses this information for image manipulation.
[0025] In embodiments where the segmentation filter 90 is implemented in an external application in a separate device 10, such as a desktop computer, the final captured image I(x,y) stored in block 80 along with a representation of the preview image as temporarily stored in 82, may be stored prior to modification on the storage device 112, or transferred together via the image output component 110 onto the external device 10, later to be processed by the segmentation filter 90. The preview image or multiple images, also referred to as sprite-images, may be pre-processed prior to storage, to improve compression rate, remove redundant data between images, align or color compress data.
[0026] FIGS. 2( a)-2(b) illustrate a workflow of the segmentation filter 90 of this embodiment. Referring to FIG. 2( a), there are two input images into the filter, namely a full resolution flash image I(x,y), 510, which is the one that was captured by full depression of the shutter button and a preview image P(x,y), 520, which is used as a reference image and is nominally the same scene as the image I(x,y) but taken without the flash. The preview image may be a result of some image processing, 522, taking into account multiple preview images and creating a single image. Methods of improving image quality based on multiple images are familiar to those versed in the art of image processing. The resulting output from the analysis process of 522 is a single preview image.
[0027] As explained above, the reference image and the final image may have different resolutions. The preview image 520 is normally, but not necessarily, of lower resolution than the full resolution image 510, typically being generated by clocking out a subset of the image sensor cells of the image capture component 60 or by averaging the raw sensor data.
[0028] The discrepancy in resolution may lead to differences in content, or pixel values, even though no data was changed in the subject image. In particular, edge regions when down-sampled and then up-sampled may have a blurring or an averaging effect on the pixels. Thus direct comparison of different resolution images, even when aligned, may lead to false contouring.
[0029] Therefore, the two images need to be matched in pixel resolution, 530. In the present context “pixel resolution” is meant to refer to the size of the image in terms of the number of pixels constituting the image concerned. Such a process may be done by either up-sampling the preview image, 534, down-sampling the acquired image, 532, or a combination thereof. Those familiar in the art will be aware of several techniques that may be used for such sampling methods. The result of step 530 is a pair of images I′(x,y) and P′(x,y) corresponding to the original images I(x,y) and P(x,y), or relevant regions thereof, with matching pixel resolution.
[0030] Where the foreground/background segmentation is done solely for the purpose of improving the detection of redeye artefacts, faces or other image features, the pixel matching as described above can be limited to those regions in the images containing or suspected to contain eyes, faces or other features, as the case may be, which can be determined by image processing techniques. In such a case the subsequent processing steps now to be described may be performed individually on each such region rather than on the images as a whole, and references to the “image” or “images” are to be interpreted accordingly.
[0031] The system and method of the preferred embodiment involves the segmentation of the image I(x,y) using exposure discrepancies between I′(x,y) and P′(x,y). It may also be advantageous to apply motion compensation 591 to one or both of the images I′(x,y) and P′(x,y). This can be achieved using two (or more) preview images 526, 527 to create a motion map 580 as described in U.S. application Ser. No. 10/985,657 and its corresponding PCT Application, which are hereby incorporated by reference, as well as other techniques for motion compensation that may be understood by those skilled in the art. In embodiments which incorporate motion compensation, the acquisition parameters for the main image I(x,y) will typically be used to determine if motion compensation is to be applied. Additionally, a user setting may be provided to enable or disable motion compensation. Alternatively, motion compensation may be applied, on a pixel by pixel basis, as part of alignment described below.
[0032] Motion compensation may be employed prior to the generation of a foreground/background map, e.g., where it is desired to eliminate a global motion of the image. However in certain embodiments it may be advantageous to perform a secondary motion compensation operation during the creation of the foreground/background map. This secondary motion compensation is not intended to eliminate a global motion of the image, but rather to compensate for small localized motions that may occur within the image. A good example is that of the leaves of a tree or bush which are fluttering in the wind while an image is being acquired. Such local motions can cause variations in luminance which should be compensated for after the initial foreground/background map is created 596 and segmented 597. Afterwards, a localized motion compensation may be employed to eliminate regions which exhibited localized motion or to subject such regions to more detailed analysis. This is illustrated in FIG. 2( c). In the case of this embodiment, morphological closing 592 and elimination of small regions 593 are included. Techniques to implement each of these are known to those skilled in the art of image segmentation.
[0033] Although nominally of the same scene, the preview image and the finally acquired full resolution image may differ spatially due to the temporal lag between capturing the two images. The alignment may be global, due to camera movement or local due to object movement, or a combination of the two. Therefore, the two images are advantageously aligned 540 in accordance with a preferred embodiment. Essentially, alignment involves transforming at least portions of one of the images, and in this embodiment the preview image P′(x,y), to obtain maximum correlation between the images based on measurable characteristics such as color, texture, edge analysis. U.S. Pat. No. 6,295,367 is hereby incorporated by reference as disclosing techniques for achieving alignment. The technique may align images that are initially misaligned due to object and camera movement. U.S. Pat. No. 5,933,546 is also hereby incorporated by reference. Multi-resolution data may be used for pattern matching. Alignment is also discussed further in relation to FIG. 4 .
[0034] The images are then equalized for exposure and possibly in color space 550. Equalisation attempts to bring the preview image and the flash full resolution image to the same overall level of exposure. The equalization can be achieved in different manners. The goal is to ensure that both images, preview and final have the same ambient conditions or a simulation of them. Specifically, the preview image is preferably conveyed having the same overall exposure as the flash image. In most cases, when using flash, even in a fill-flash mode, the final image will use a lower ambient exposure, to prevent over exposure due to the flash. In other words, the overall ambient exposure of the flash image is lower. In other words, the exposure on the foreground should remain constant after adding the flash light, and thus there is a need use a smaller aperture or shorter shutter speed. The equalization may be done analytically by matching the histograms of the images. Alternatively if the overall ambient exposure, which is depicted as function of aperture, shutter speed, and sensitivity (or gain) can be calculated and if the exposure is different, the pixel value can be modified, up to clipping conditions, based on the ratio between the two. Note that the exposure might not be equal in all channels and may also include a stage of color correction which compensates for different exposures for the various color channels. An example of this is when the ambient light is warm, such as incandescent, while the final image using flash is closer to daylight in terms of the overall color temperature.
[0035] In an alternative method, when the final ambient exposure is known, the preview image used as reference can be acquired with the same equivalent exposure. This can serve to eliminate the equalization stage. Note that in such case, the preview image may not be optimal to ambient conditions, but it is equalized with the final flash image.
[0036] As can be seen from FIG. 3 , an idealised non-flash image of a scene containing some foreground objects can be considered to have a generally unimodal distribution of luminance levels across all pixels. Where a scene is well lit, the peak of the distribution tends to be at a higher luminance level, whereas for dimly light scenes, the peak will tend to be a lower luminance level. In a flash version of the same scene, pixels corresponding to foreground objects will tend to have increased luminance levels due to the proximity to the flash source. However, pixels corresponding to background objects will tend to have relatively reduced luminance levels. Thus, in a preferred embodiment, pixel luminance levels for a flash version image of a scene are mapped to luminance levels which bring the non-flash (preview) image and the flash version image of the scene to the same overall level of exposure. This mapping g( ) can be represented as follows:
[0037]
[0038] In the simplest case, the function g( ) is a constant, in general greater than 1, mapping exposure levels in a preview image P′(x,y) to produce an altered image P″(x,y) having the same overall exposure level as the flash version image I′(x,y). (Alternatively, the image I′(x,y) could be mapped to I″(x,y).) In the simplest implementation of this case, both images I′(x,y) and P′(x,y) are converted to greyscale and the mean luminance for each image is computed. The luminance values of one of the images are then adjusted so that the mean luminance values of the altered image P″(x,y) and the image I′(x,y) match.
[0039] However, the function g(.) can be dependent on the original exposure level of a pixel P′(x,y), for example, to prevent color saturation or loss of contrast. The function may also be dependent on a pixel's (x,y) location within an image, perhaps tending to adjust more centrally located pixels more than peripheral pixels.
[0040] Nonetheless, it will be seen from FIG. 3 that in a pixel by pixel comparison, or even a block-based comparison (each block comprising N×N pixels within a regular grid of M×M regions), the adjusted flash version of the image has a bimodal distribution between the exposure levels of background and foreground objects.
[0041] In preferred embodiments, during equalisation, one or more thresholds VH, VL and possibly block size n are determined for later use in determining the background and foreground areas of the image I′(x,y). The threshold process is based on finding the optimal threshold values in a bimodal distribution and with the benefit of a reference unimodal non-flash image. Suitable techniques are described in the literature and are known to one familiar in the art of numerical classification. Nonetheless, as an example, the upper threshold level VH could be taken as the cross-over luminance value of the upper bimodal peak and the unimodal distribution, whereas the lower threshold VL could be taken as the cross-over of the lower bimodal peak and the unimodal distribution. It will be appreciated that the distribution of pixel exposure levels may not in practice be smooth and there may be several cross-over points in raw image data, and so some smoothing of the luminance distribution may need to be performed before determining such cross-over points and so the thresholds.
[0042] After the thresholds VH, VL are determined, the image is processed via a segmenting tool, 590, to designate pixels or regions as background or foreground. In one embodiment, pixels whose values change less than a threshold amount, say VH−VL (or some other empirically determined value) between flash I′(x,y) and non-flash versions P″(x,y) of the image represent pixels in areas of a flash-image forming a boundary between background and foreground objects. When such individual pixels are linked, then segments of the image I′(x,y) substantially enclosed by linked boundary pixels and having pixel values on average brighter than in the corresponding segment of the non-flash image P″(x,y) are designated as foreground, whereas segments of the image substantially enclosed by boundary pixels and having pixel values on average darker than in the corresponding segment of the non-flash image are designated as background.
[0043] In a second embodiment, foreground pixels in a flash image are initially determined at step 596 as those with exposure levels greater than the upper exposure threshold value VH and background pixels in a flash image are those with exposure levels less than the lower exposure threshold value VL.
[0044] In a still further embodiment of step 596, thresholds are not employed and initial segmentation is achieved simply by subtracting the local exposure values for each image on a pixel by pixel or block by block (each block comprising n×n pixels) basis to create a difference map. Typically, foreground pixels will have a higher (brighter) value and background pixels will have a lower value.
[0045] One technique by which a block by block averaging can be advantageously achieved in a state-of-art digital camera is to employ a hardware subsampler 124 where available. This can very quickly generate a subsampled 1/n version of both images where each pixel of each image represents an average over an n×n block in the original image.
[0046] In certain embodiments, after an initial matching of size between preview and main image, further subsampling may be implemented prior to subtracting the local exposure values for each image on a pixel by pixel basis. After an initial foreground/background map is determined using the smallest pair of matched images, this map may be refined by applying the results to the next largest pair of subsampled images, each pixel now corresponding to an N×N block of pixels in the larger pair of images.
[0047] A refinement of said initial map may be achieved by performing a full pixel-by-pixel analysis, of the larger pair of matched images, only on the border regions of the initial foreground/background map. It will be appreciated that where a hardware subsampler is available that generating multiple sets of matched subsampled images is relatively inexpensive in terms of computing resources. In certain embodiments performing a series of such refinements on successively larger pairs of matched subsampled images can advantageously eliminate the need for alignment and registration of the images. The advantages of this technique must be balanced against the requirement to temporarily store a series of pairs of matched subsampled images of successively decreasing size.
[0048] Each of the processes involving threshold comparisons may also take into account neighbouring pixel operations where the threshold value or comparison is dependent on the surrounding pixel values to eliminate noise artefacts and slight shifts between the preview and the final image.
[0049] Nonetheless, it will be seen that the determination of background/foreground membership is not achieved with complete accuracy using a single pass pixel-based or block-based analysis alone. As an example, consider a person with a striped shirt. It may be that the corrected luminance of the dark stripes actually indicates they are background pixels even though they are in close proximity to a large collection of foreground pixels.
[0050] Accordingly it is advantageous to incorporate additional analysis and so, following the creation of an initial foreground map, even if this has been performed on a n×n block rather than pixel basis, the foreground pixels/blocks are segmented and labelled 597. This step helps to eliminate artefacts such as a striped shirt and those due to image noise or statistical outliers in the foreground map. It is also advantageous to eliminate small segments.
[0051] Thus a final map (mask) of foreground pixels is created 594. This may now be upsized to match the size of the main acquired image, 599-1, and can be advantageously employed for further image processing of the main image, 501. For example, although not shown, the system may include a face detector or redeye filter, and in such a case 501 can include techniques for applying these selectively to the foreground region defined by the mask, thus reducing the execution time for such algorithms by excluding the analysis of background segments. Alternatively, where the system includes a component for identifying redeye candidate regions 501, U.S. patent application Ser. No. 10/976,336 is hereby incorporated by reference. This component can implement a redeye falsing analysis by increasing or decreasing the probability of a redeye candidate region being an actual redeye region according to whether the candidate appears in the foreground or background of the captured image.
[0052] As was already mentioned, in a preferred embodiment it may be advantageous to initially employ aggressive downsampling of the images 510, 520. This may eliminate the need for the alignment step 540 and, if the present invention is applied recursively and selectively on a regional basis, a full-sized foreground mask can be achieved without a great increase in computation time.
[0053] Referring back now to FIG. 2( b), where it is assumed that during the size matching 530 of FIG. 2( a), several pairs of matching images are created or, alternatively, are created dynamically on each recursion through the loop of FIG. 2( b). For example, consider a main image of size 1024×768 with a preview of size 256×192. Let us suppose that three sets of matching images are created at resolutions of 1024×768 (preview is upsized by 4×), 256×192 (main image is downsized by 4×) and at 64×48 (main image downsized by 16× and preview downsized by 4×). Now we assume that the initial analysis is performed on the 64×48 image as described in FIG. 2( a) as far as the segmentation tool step 590.
[0054] After the step 590, an additional step 517 determines if the comparison size (the image size used to generate the latest iteration of the foreground map) is equal to the size of the main flash image I(x,y). If not then the foreground map is upsized to the next comparison size 599-2—in this case 256×192 pixels. Each pixel in the original map is now enlarged into a 4×4 pixel block. The regions forming the boundary between foreground and background segments—they were pixels at the lower map resolution—of this enlarged map are next determined 570 and the downsampled images of this comparison size (256×192) are loaded 531. In this case, the technique may be applied to the entire image or a portion of the entire image at the higher resolution as regions within foreground segments are determined to definitely be foreground regions. In this embodiment, it is only the boundary regions between background and foreground that are analyzed. The same analysis that was applied to the main image are now applied to these regions. They may be aligned 540, before being equalizing 551, and the segmentation tool 590 is applied to each 16×16 region. The results are merged with the existing foreground map 515.
[0055] If the foreground map is now of the same size as the main flash image 517 then it can be directly applied to the main image 501. Alternatively, if it is still smaller then it is upsampled to the next image comparison size 599-2 and a further recursion through the algorithm is performed.
[0056] The segmented data is stored, 598 as a segmentation mask as in FIG. 2( a). If necessary in order to return to the original image size, the segmentation mask will need to be up-sampled, 599, by the same factor the acquired image was down-sampled in step 532. The upsampling 599 should be sophisticated enough to investigate the edge information in the periphery of the mask, to ensure that the right regions in the upsampled map will be covered. Such techniques may include upsampling of an image or a mask while maintaining edge information.
[0057] FIG. 4 shows the workflow of the alignment function 540 of FIG. 2( a), where the inputs are the two images I′(x,y) and P′(x,y) as defined in relation to FIG. 2( a). The alignment may be global for the entire image or local for specific regions. Global movement may be caused by camera movement while local movement may be caused by object movement during the exposure interval of the image. For example, a simple linear alignment, such as a shift in the horizontal direction by H pixels, and/or in the vertical direction by V pixels, or a combination of the two. Mathematically, the shifted image, P″(x,y), can be described as:
P″(x,y)=P′(x−H,y−V)
P″(x,y)=P′(x−H,y−V)
[0058] However, simple translation operation assumes shift invariance which may not suffice in the aligning of the image. Even in the case of camera movement, such movement may include a Affine transformation that includes rotation, and shear as well as translation. Therefore, there may be a need for X-Y shearing, which is a symmetrical shift of the object's points in the direction of the axis to correct for perspective changes; X-Y tapering where the object is pinched by shifting its coordinates towards the axis, the greater the magnitude of the coordinate the further the shift; or rotation around an arbitrary point.
[0059] In general, the alignment process may involve an Affine transformation, defined as a special class of projective transformations that do not move any objects from the affine space R3 to the plane at infinity or conversely, or any transformation that preserves co linearity (i.e. all points lying on a line initially still lie on a line after transformation) and ratios of distances (e.g., the midpoint of a line segment remains the midpoint after transformation). Geometric contraction, expansion, dilation, reflection, rotation, shear, similarity transformations, spiral similarities and translation are all affine transformations, as are their combinations. In general, the alignment 540 may be achieved via an affine transformation which is a composition of rotations, translations, dilations, and shears, all well-known to one familiar in the art of image processing.
[0060] If it is determined through a correlation process that a global transformation suffices, as determined in block 542=YES, one of the images, and for simplicity the preview image, will undergo an Affine transformation, 544, to align itself with the final full resolution image. Mathematically, this transformation can be depicted as:
P″=AP′+q
where A is a linear transformation and q is a translation.
P″=AP′+q
where A is a linear transformation and q is a translation.
[0061] However, in some cases a global transformation may not work well, in particular for cases where the subject matter moved, as could happen when photographing animated objects. In such case, in particular in images with multiple human subjects, and when the subjects move in independent fashion, the process of alignment 540 may be broken down, 546, to numerous local regions each with its own affine transformation. In the case of the use of the present technique for redeye detection and correction, it is preferred to align the eyes between the images. Therefore, according to this alternative, one or multiple local alignments may be performed, 548, for regions in the vicinity surrounding the eyes, such as faces.
[0062] Only after the images are aligned are the exposure value between the images equalised as in FIG. 2( a).
[0063] The preferred embodiments described above may be modified by adding or changing operations, steps and/or components in many ways to produce advantageous alternative embodiments. For example, the reference image can be a post-view image rather than a preview image, i.e. an image taken without flash immediately after the flash picture is taken.
[0064] Alternatively, the reference image could be the flash image and the full resolution captured image the non-flash image. An example of this is when the camera is set up in a special mode (similar to a portrait scene selection mode), so that the preview image is the one with the flash while the final image may be with no flash. In this case, the roles of the images reverse in terms of calculating the difference between the images. Additionally, the reference image may be either a preview image or a post-view image.
[0065] The preferred embodiments described herein may involve expanded digital acquisition technology that inherently involves digital cameras, but that may be integrated with other devices such as cell-phones equipped with an acquisition component or toy cameras. The digital camera or other image acquisition device of the preferred embodiment has the capability to record not only image data, but also additional data referred to as meta-data. The file header of an image file, such as JPEG, TIFF, JPEG-2000, etc., may include capture information including the preview image, a set of preview images or a single image that is processed to provide a compressed version of selected reference images, for processing and segmentation at a later post processing stage, which may be performed in the acquisition device or in a separate device such as a personal computer.
[0066] In these embodiments, in the comparison stages, the pixel values may be compared for lightness. Alternatively or additionally, these can be compared with other values such as color. An example of chromatic comparison is warm coloring such as yellow tint that may indicate incandescent light or blue tint that may indicate shade regions in sunlit environment, or other colours indicative of change between ambient lighting and the flash lighting. The comparison may be absolute or relative. In the absolute case the absolute value of the difference is recorded regardless to which of the images has the larger pixel value. In the relative case, not only the difference but also the direction is maintained. The two techniques may also assist in establishing the registration between the two images. In the case the subject slightly moves, for example horizontally, the relative difference may indicate a reversal of the values on the left side of the object and the right side of the object.
[0067] In certain embodiments it may also prove advantageous to employ a “ratio map” rather than a “difference map”. In such embodiments a ratio between the pixel luminance values of the two images (flash and non-flash) is determined. This technique can provide better results in certain cases and may be employed either as an alternative to a simple subtraction, or in certain embodiments it may be advantageous to combine output regions derived from both techniques using, logical or statistical techniques or a combination thereof, to generate a final foreground/background map.
[0068] The present invention is not limited to the embodiments described above herein, which may be amended or modified without departing from the scope of the present invention as set forth in the appended claims, and structural and functional equivalents thereof. In addition, United States published patent application no. 2003/0103159 to Nonaka, Osamu, entitled “Evaluating the effect of a strobe light in a camera” is hereby incorporated by reference as disclosing an in-camera image processing method for correcting shadow regions in a flash image.
[0069] In methods that may be performed according to preferred embodiments herein and that may have been described above and/or claimed below, the operations have been described in selected typographical sequences. However, the sequences have been selected and so ordered for typographical convenience and are not intended to imply any particular order for performing the operations.
[0070] In addition, all references cited above herein, in addition to the background and summary of the invention sections, are hereby incorporated by reference into the detailed description of the preferred embodiments as disclosing alternative embodiments and components.
Claims
What is claimed is:
1. A handheld digital image acquisition system having no photographic film, comprising:
(a) an apparatus for capturing digital images,
(b) a flash unit for providing illumination during image capture,
(c) a processor. and
(d) a memory having computer-readable code embedded therein for programming the processor to perform a digital segmentation method that comprises: determining one or more regions that are indicative of a foreground region, or of a background region, or of a background region and a foreground region, within at least one portion of a captured image,
(e) wherein said determining comprises comparing said captured image and a reference image of nominally the same scene captured in a temporal range between just before and just after exposure of the captured image,
(f) wherein the comparing comprises spatially aligning one or more regions of the captured and reference images at least in respect of pixels corresponding to the at least one portion of said captured image, and
(g) wherein one of said captured and reference images being taken with flash and the other being taken without flash.
2. A system according to claim 1, wherein the captured and reference images have different pixel resolutions, and wherein the system further comprises a pixel matching tool which is operative prior to application of the segmentation tool for matching the pixel resolutions of the captured and reference images at least in respect of said at least one portion.
3. A system according to claim 2, wherein said pixel matching tool utilizes up-sampling of the image of lower resolution or sub-sampling of the image of higher resolution, or both.
4. A system according to claim 1, wherein the aligning is performed prior to the determining.
5. A system according to claims 1, further comprising an exposure equalizer for substantially equalizing an overall level of exposure of said regions or all of said captured and reference images at least in respect of said at least one portion.
6. A system according to claim 5, wherein the substantially equalising of the overall level of exposure of said regions or all of said captured and reference image comprises simulating an ambient exposure of the captured image on the reference image.
7. A system according to claim 6, wherein the simulating of the ambient exposure of the captured image on the reference image comprises digitally simulating a one or a combination of aperture. acquisition speed, color transformations and gain of the captured image on the reference image.
8. A system according to claims 6, wherein the simulating of the ambient exposure of the captured image comprises individual, non-uniform manipulating of individual regions or color channels or combinations thereof.
9. A system according to any one of claims 5, wherein the substantially equalising of the overall level of exposure of said captured and reference image comprises setting an ambient exposure of the reference image to match a calculated exposure of the captured image.
10. A system according to claim 5, wherein at least in respect of said at least one portion, the segmentation tool determines corresponding pixels in the captured and reference images whose values differ by less than a predetermined threshold, and designates segments of the captured image bounded by said determined pixels as foreground or background by comparing pixel values in a segment with pixel values in a corresponding segment of the reference image.
11. A system according to claim 5, wherein at least in respect of said at least one portion, the segmentation tool determines upper and lower thresholds based on a comparison of the overall level of exposure of the captured and reference images and designates pixels of the captured image as foreground or background according to whether their values are greater than the upper threshold or less than the lower threshold.
12. A system according to claim 5, wherein at least in respect of said at least one portion, the segmentation tool designates one or more segments of the captured image as foreground or background by comparing pixel values in the captured and reference images.
13. A system according to claim 5, wherein the reference image comprises a preview image having a lower pixel resolution than the captured image, and the captured image comprises the image taken with flash.
14. A system according to claim 1, further comprising a face detection module.
15. A system according to claim 1, further comprising a red-eye detection filter or a red eye correction filter or both, for selective application to the foreground region.
16. A system according to claim 15, further comprising a probability module for changing a probability of a redeye candidate region being an actual redeye region according to whether the candidate appears in the foreground or background of the captured image.
17. A system according to claim 1, further comprising a depth of focus module for reducing a perceived depth of focus according to whether a candidate region appears in the foreground or background of the captured image.
18. A system according to claim 1, wherein the reference image comprises a preview image.
19. A system according to claim 1, wherein the reference image comprises an image captured chronologically after said captured image.
20. A system according to claim 1, wherein the reference image comprises a combination of multiple reference-images.
21. A system according to claim 1, wherein said digital image acquisition system comprises a digital camera.
22. A system according to claims 1, wherein said digital image acquisition system comprises a combination of a digital camera and an external processing device.
23. A system as claimed in claim 22, wherein said segmentation tool is located within said external processing device.
24. A system according to claims 1, wherein said digital image acquisition system comprises a batch processing system including a digital printing device.
25. A system according to claims 1, wherein said digital image acquisition system comprises a batch processing system including a server computer.
26. One or more computer-readable storage devices having code embedded therein for programming a processor of a handheld digital image acquisition device to perform a digital segmentation method that comprises:
determining one or more regions that are indicative of a foreground region, or of a background region, or of a background legion and a foreground legion, within at least one portion of a captured image,
wherein said determining comprises comparing said captured image and a reference image of nominally the same scene captured in a temporal range between just before and just after exposure of the captured image,
wherein the comparing comprises spatially aligning one or more regions of the captured and reference images at least in respect of pixels corresponding to the at least one portion of said captured image, and
wherein one of said captured and reference images being taken with flash and the other being taken without flash.
27. One or more computer-readable storage devices according to claim 26, wherein the captured and reference images have different pixel resolutions, and the method further comprises pixel matching prior to said determining for matching the pixel resolutions of the captured and reference images at least in respect of said at least one portion.
28. One or more computer-readable storage devices according to claim 27, wherein said pixel matching comprises up-sampling of the image of lower resolution or sub-sampling of the image of higher resolution, or both.
29. One or more computer-readable storage devices according to claim 26, wherein the aligning is performed prior to the determining.
30. One or more computer-readable storage devices according to claims 26, wherein the method further comprises Substantially equalizing an overall level of exposure of said captured and reference images at least in respect of said at least one portion.
31. One or more computer-readable storage devices according to claim 26, wherein the method further comprises face detection or filtering red-eye, or both, for selective application to the foreground region.
32. One or more computer-readable storage devices according to claim 31, wherein the method further comprises changing a probability of a redeye candidate region being an actual redeye region according to whether the candidate appears in the foreground or background of the captured image.
33. One or more computer-readable storage devices according to claim 31, wherein the method further comprises reducing a perceived depth of focus according to whether a candidate region appears in the foreground or background of the captured image.
34. One or more computer-readable storage devices according to claim 31, wherein the method further comprises blurring said regions indicative of background of the captured image.
35. One or more computer-readable storage devices according to claim 26, wherein the reference image comprises a preview image.
36. One or more computer-readable storage devices according to claim 26, wherein the reference image comprises an image captured chronologically after said captured image.
37. One or more computer-readable storage devices according to claim 26, wherein the reference image comprises a combination of multiple reference-images.
38. A method of digital segmentation involving a handheld digital image acquisition device, the method comprising: using a processor in
determining one or more regions that are indicative of a foreground region, or of a background region, or of a background region and a foreground region, within at least one portion of a captured image,
wherein said determining comprises comparing said captured image and a reference image of nominally the same scene captured just before, during, just after or temporally-overlapping exposure of the captured image; wherein the comparing comprises spatially aligning one or more regions of the captured and reference images at least in respect of pixels corresponding to the at least one portion of said captured image, and
wherein one of said captured and reference images being taken with flash and the other being taken without flash.
39. A method according to claim 38, wherein the captured and reference images have different pixel resolutions, and wherein the method further comprises, prior to said determining, matching the pixel resolutions of the captured and reference images at least in respect of said at least one portion.
40. A method according to claim 39, wherein said matching comprises up-sampling of the image of lower resolution or sub-sampling of the image of higher resolution, or both.
41. A method according to claim 38, wherein the aligning is performed prior to the determining.
42. A method according to claim 38, wherein said determining further comprises substantially equalizing an overall level of exposure of said captured and reference images at least in respect of said at least one portion.
43. A method according to claim 38, further comprising face detecting or filtering red-eye, or both, for selective application to the foreground region.
44. A method according to claim 43, wherein said determining comprises reducing or increasing a probability of a redeye candidate region being an actual redeye region according respectively to whether the candidate appears in the background or foreground of the captured image.
45. A method according to claim 43, further comprising reducing a perceived depth of focus according to whether a candidate region appears in the foreground or background of the captured image.
46. A method according to claim 43, further comprising blurring said regions determined to be background of the captured image.
47. A method according to claim 38, wherein the reference image comprises a preview image.
Patent Citations (125)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4683496(A) | 1987-07-01 | Tom | Applicant |
| US5046118(A) | 1991-09-01 | Ajewole et al. | Applicant |
| US5063448(A) | 1991-11-01 | Jaffray et al. | Applicant |
| US5109425(A) | 1992-04-01 | Lawton | Applicant |
| US5130935(A) | 1992-07-01 | Takiguchi | Applicant |
| US5164993(A) | 1992-11-01 | Capozzi et al. | Applicant |
| US5329379(A) | 1994-07-01 | Rodriguez et al. | Applicant |
| US5500685(A) | 1996-03-01 | Kokaram | Applicant |
| US5504846(A) | 1996-04-01 | Fisher | Applicant |
| US5534924(A) | 1996-07-01 | Florant | Applicant |
| US5594816(A) | 1997-01-01 | Kaplan et al. | Applicant |
| US5621868(A) | 1997-04-01 | Mizutani et al. | Applicant |
| US5724456(A) | 1998-03-01 | Boyack et al. | Applicant |
| US5812787(A) | 1998-09-01 | Astle | Applicant |
| US5844627(A) | 1998-12-01 | May et al. | Applicant |
| US5878152(A) | 1999-03-01 | Sussman | Applicant |
| US5880737(A) | 1999-03-01 | Griffin et al. | Applicant |
| US5949914(A) | 1999-09-01 | Yuen | Applicant |
| US5990904(A) | 1999-11-01 | Griffin | Applicant |
| US6005959(A) | 1999-12-01 | Mohan et al. | Applicant |
| US6008820(A) | 1999-12-01 | Chauvin et al. | Applicant |
| US6018590(A) | 2000-01-01 | Gaborski | Applicant |
| US6061476(A) | 2000-05-01 | Nichani | Applicant |
| US6069635(A) | 2000-05-01 | Suzuoki et al. | Applicant |
| US6069982(A) | 2000-05-01 | Reuman | Applicant |
| US6122408(A) | 2000-09-01 | Fang et al. | Applicant |
| US6198505(B1) | 2001-03-01 | Turner et al. | Applicant |
| US6240217(B1) | 2001-05-01 | Ercan et al. | Applicant |
| US6243070(B1) | 2001-06-01 | Hill et al. | Applicant |
| US6292194(B1) | 2001-09-01 | Powell, III | Applicant |
| US6326964(B1) | 2001-12-01 | Snyder et al. | Applicant |
| US6407777(B1) | 2002-06-01 | DeLuca | Applicant |
| US6483521(B1) | 2002-11-01 | Takahashi et al. | Applicant |
| US6526161(B1) | 2003-02-01 | Yan | Applicant |
| US6535632(B1) | 2003-03-01 | Park et al. | Applicant |
| US6538656(B1) | 2003-03-01 | Cheung et al. | Applicant |
| US6577762(B1) | 2003-06-01 | Seeger et al. | Applicant |
| US6577821(B2) | 2003-06-01 | Malloy Desormeaux | Examiner |
| US6593925(B1) | 2003-07-01 | Hakura et al. | Applicant |
| US6631206(B1) | 2003-10-01 | Cheng et al. | Applicant |
| US6670963(B2) | 2003-12-01 | Osberger | Applicant |
| US6678413(B1) | 2004-01-01 | Liang et al. | Applicant |
| US6683992(B2) | 2004-01-01 | Takahashi et al. | Applicant |
| US6744471(B1) | 2004-06-01 | Kakinuma et al. | Applicant |
| US6756993(B2) | 2004-06-01 | Popescu et al. | Applicant |
| US6781598(B1) | 2004-08-01 | Yamamoto et al. | Applicant |
| US6803954(B1) | 2004-10-01 | Hong et al. | Applicant |
| US6804408(B1) | 2004-10-01 | Gallagher et al. | Applicant |
| US6836273(B1) | 2004-12-01 | Kadono | Applicant |
| US6842196(B1) | 2005-01-01 | Swift et al. | Applicant |
| US6850236(B2) | 2005-02-01 | Deering | Applicant |
| US6930718(B2) | 2005-08-01 | Parulski et al. | Examiner |
| US6956573(B1) | 2005-10-01 | Bergen et al. | Applicant |
| US6987535(B1) | 2006-01-01 | Matsugu et al. | Applicant |
| US6990252(B2) | 2006-01-01 | Shekter | Applicant |
| US7013025(B2) | 2006-03-01 | Hiramatsu | Applicant |
| US7035477(B2) | 2006-04-01 | Cheatle | Applicant |
| US7042505(B1) | 2006-05-01 | DeLuca | Applicant |
| US7054478(B2) | 2006-05-01 | Harman | Applicant |
| US7064810(B2) | 2006-06-01 | Anderson et al. | Applicant |
| US7081892(B2) | 2006-07-01 | Alkouh | Applicant |
| US7102638(B2) | 2006-09-01 | Raskar et al. | Examiner |
| US7103227(B2) | 2006-09-01 | Raskar et al. | Examiner |
| US7103357(B2) | 2006-09-01 | Kirani et al. | Examiner |
| US7149974(B2) | 2006-12-01 | Girgensohn et al. | Applicant |
| US7206449(B2) | 2007-04-01 | Raskar et al. | Examiner |
| US7218792(B2) | 2007-05-01 | Raskar et al. | Examiner |
| US7295720(B2) | 2007-11-01 | Raskar | Examiner |
| US7317843(B2) | 2008-01-01 | Sun et al. | Applicant |
| US7359562(B2) | 2008-04-01 | Raskar et al. | Examiner |
| US2001/0000710(A1) | 2001-05-01 | Queiroz et al. | Applicant |
| US2001/0012063(A1) | 2001-08-01 | Maeda | Applicant |
| US2002/0093670(A1) | 2002-07-01 | Luo et al. | Applicant |
| US2002/0180748(A1) | 2002-12-01 | Popescu et al. | Applicant |
| US2002/0191860(A1) | 2002-12-01 | Cheatle | Applicant |
| US2003/0038798(A1) | 2003-02-01 | Besl et al. | Applicant |
| US2003/0052991(A1) | 2003-03-01 | Stavely et al. | Applicant |
| US2003/0103159(A1) | 2003-06-01 | Nonaka | Applicant |
| US2003/0169944(A1) | 2003-09-01 | Dowski et al. | Applicant |
| US2004/0047513(A1) | 2004-03-01 | Kondo et al. | Applicant |
| US2004/0145659(A1) | 2004-07-01 | Someya et al. | Applicant |
| US2004/0201753(A1) | 2004-10-01 | Kondo et al. | Applicant |
| US2004/0208385(A1) | 2004-10-01 | Jiang | Applicant |
| US2004/0223063(A1) | 2004-11-01 | DeLuca et al. | Applicant |
| US2005/0017968(A1) | 2005-01-01 | Wurmlin et al. | Applicant |
| US2005/0031224(A1) | 2005-02-01 | Prilutsky et al. | Applicant |
| US2005/0041121(A1) | 2005-02-01 | Steinberg et al. | Applicant |
| US2005/0058322(A1) | 2005-03-01 | Farmer et al. | Applicant |
| US2005/0140801(A1) | 2005-06-01 | Prilutsky et al. | Applicant |
| US2005/0213849(A1) | 2005-09-01 | Kreang-Arekul et al. | Applicant |
| US2005/0271289(A1) | 2005-12-01 | Rastogi | Applicant |
| US2006/0008171(A1) | 2006-01-01 | Petschnigg et al. | Applicant |
| US2006/0104508(A1) | 2006-05-01 | Daly et al. | Applicant |
| US2006/0153471(A1) | 2006-07-01 | Lim et al. | Applicant |
| US2006/0181549(A1) | 2006-08-01 | Alkouh | Applicant |
| JP2281879(A2) | 1990-11-01 | Applicant | |
| JP4127675(A2) | 1992-04-01 | Applicant | |
| JP6014193(A2) | 1994-01-01 | Applicant | |
| JP8223569(A2) | 1996-08-01 | Applicant | |
| JP10285011(A2) | 1998-10-01 | Applicant | |
| JP20102040(A2) | 2000-04-01 | Applicant | |
| JP20299789(A2) | 2000-10-01 | Applicant | |
| JP21101426(A2) | 2001-04-01 | Applicant | |
| JP21223903(A2) | 2001-08-01 | Applicant | |
| JP22112095(A2) | 2002-04-01 | Applicant | |
| JP23281526(A2) | 2003-10-01 | Applicant | |
| JP24064454(A2) | 2004-02-01 | Applicant | |
| JP24166221(A2) | 2004-06-01 | Applicant | |
| JP24185183(A2) | 2004-07-01 | Applicant | |
| JP26024206(A2) | 2006-01-01 | Applicant | |
| JP26080632(A2) | 2006-03-01 | Applicant | |
| JP26140594(A2) | 2006-06-01 | Applicant | |
| WO-9426057(A1) | 1994-11-01 | Applicant | |
| WO-02052839(A2) | 2002-07-01 | Applicant | |
| WO-02089046(A1) | 2002-11-01 | Applicant | |
| WO-2004017493(A1) | 2004-02-01 | Applicant | |
| WO-2004036378(A2) | 2004-04-01 | Applicant | |
| WO-2004059574(A2) | 2004-07-01 | Applicant | |
| WO2005/015896(A1) | 2005-02-01 | Applicant | |
| WO2005/076217(A2) | 2005-08-01 | Applicant | |
| WO-2005099423(A2) | 2005-10-01 | Applicant | |
| WO-2007025578(A1) | 2007-03-01 | Applicant | |
| WO-2007073781(A1) | 2007-07-01 | Applicant | |
| WO-2007093199(A2) | 2007-08-01 | Applicant | |
| WO-2007095477(A2) | 2007-08-01 | Applicant |
Non-Patent Literature (60)
- “PCT Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration”, for PCT Application No. PCT/EP2006/005109, 14 pages.Applicant
- Petschnigg G et al., “Digital Photography with Flash and No Flash Image Pairs”, The Institution of Electrical Engineers, Stevenage, GB; Aug. 2004, pp. 664-672.Applicant
- Braun M., and Petschnigg G: “Information Fusion of Flash and Non-Flash Images”, retrieved from the Internet: URL: http://graphics.stanford.edu/{georgp/vision.htm, XP-002398967, Dec. 31, 2002. pp. 1-12.Applicant
- Eissemann E., and Durand F., “Flash Photography Enhancement via Intrinsic Relighting” ACM Transactions on Graphics, vol. 23, No. 3, Aug. 12, 2004, pp. 673-678.Applicant
- Sun J., et al., “Flash Matting”, ACM Transactions on Graphics, vol. 25, No. 3, Jul. 31, 2006, pp. 772-778.Applicant
- SA A., et al. “Range-Enhanced Active foreground Extraction”, Image Processing, 2005, ICIP 2005, IEEE International Conference on Genova, Italy, Sep. 11-14, 2005, pp. 81-84, XP010851333, ISBN: 0-7803-9134-9.Applicant
- U.S. Appl. No. 10/772,767, filed Feb. 4, 2004, by inventors Michael J. DeLuca, et al.Applicant
- European Patent Office, extended European Search Report for EP application No. 07024773.9, dated Jun. 3, 2008, 5 pages.Applicant
- Boutell M et al, “Photo classification by integrating image content and camera metadata,” Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on Cambridge, UK Aug. 23-26, 2004, Piscataway, NJ, USA, IEEE, vol. 4, Aug. 23, 2004, pp. 901-904, XP010724066, ISBN: 978-0-7695-2128-2.Applicant
- Serrano N et al, “A computationally efficient approach to indoor/outdoor scene classification,” Pattern Recognition, 2002 Proceedings. 16th International Conference on Quebec City, Que., Canada Aug. 11-15, 2002, Los Alamitos, CA, USA, IEEE Comput. Soc, US, vol. 4, Aug. 11, 2002, pp. 146-149, XP010613491, ISBN: 978-0-7695-1695-0.Applicant
- Szummer M et al, “Indoor-outdoor image classification,” Content-Based Access of Image and Video Database, 1998. Proceedings., 1998 IEEE International Workshop on Bombay, India Jan. 3, 1998, Los Alamitos, CA, USA, IEEE Comput. Soc, US, Jan. 3, 1998, pp. 42-51, XP010261518, ISBN: 978-0-8186-8329-9.Applicant
- Adelson, E.H., “Layered Representations for Image Coding, http://web.mit.edu/persci/people/adelson/pub.sub.—pdfs/layers91.pdf.”, Massachusetts Institute of Technology, 1991, 20 pages.Applicant
- Aizawa, K. et al., “Producing object-based special effects by fusing multiple differently focused images, http://rlinks2.dialog.com/NASApp/ChannelWEB/DialogProServlet?ChName= engineering”, IEEE trans. on ciruits and systems for video tech., 2000, pp. 323-330, vol. 10-Iss. 2.Applicant
- Ashikhmin, Michael, “A tone mapping algorithm for high contrast images, http://portal.acm.org/citation.cfm?id=581 91 6and,coll=Portalanddl=ACMandCFID=l 7220933andCFTOKE N=8914269”, ACM International Conference Proceeding Series, Proceedings of the 13th Eurographics workshop on Rendering, 2002, pp. 145-156, vol. 28.Applicant
- Barreiro, R.B. et al., “Effect of component separation on the temperature distribution of the cosmic mirowave background, Monthly Notices of The Royal Astronomical Society, Current Contents Search Dialog File No. 440 Accession No. 23119677”, 2006, pp. 226-246, vol. 368-Iss. 1.Applicant
- BEIR, Thaddeus, “Feature-Based Image Metamorphosis,” In Siggraph '92, Silicon Graphics Computer Systems, 2011 Shoreline Blvd, Mountain View CA 94043, http://www.hammerhead.com/thad/thad.html. cited by other, 1992.Applicant
- Benedek, C. et al., “Markovian framework for foreground-background-shadow separation of real world video scenes, Proceedings v 3851 LNCS 2006, Ei Compendex®, Dialog® File No. 278 Accession No. 11071345”, 7th Asian Conference on Computer Vision, 2006.Applicant
- Chen, Shenchang et al., “View interpolation for image synthesis, ISBN:0-89791-601-8, http://portal.acm.org/citation.cfm?id=166153andcoli=GUIDEanddl=GUIDEandCFID=680˜9268andCFTOKEN=82843223.”, International Conference on Computer Graphics and Interactive Techniques, Proceedings of the 20th annual conference on Computer graphics and interactive techniques, 1993, pp. 279-288, ACM Press.Applicant
- Eissemann, E. et al., “Flash Photography Enhancement via Intrinsic Relighting, ACM Transactions on URL: http://graphics.stanford.edu/{georgp/vision.htm”, 2002, pp. 1-12.Applicant
- Eriksen, H.K. et al., “Cosmic microwave background component separation by parameter estimation, INSPEC. Dialog® File No. 2 Accession No. 9947674”, Astrophysical Journal, 2006, pp. 665-682, vol. 641—Issue 2.Applicant
- European Patent Office, Communication pursuant to Article 94(3) EPC for EP Application No. 06776529.7, dated Jan. 30, 2008, 3 pages.Applicant
- Favaro, Paolo, “Depth from focus/defocus, http://homepages.inf.ed.ac.uk/rbf/Cyonline/LOCAL—COPIES/FAVARO1/dfdtutorial.html.”, 2002.Applicant
- Haneda, E., “Color Imaging XII: Processing, Hardcopy, and Applications”, Proceedings of Society of Optical Engineers, 2007, vol. 6493.Applicant
- Hashi Yuzuru et al., “A New Method to Make Special Video Effects. Trace and Emphasis of Main Portion of Images, Japan Broadcasting Corp., Sci. and Technical Res. Lab., JPN, Eizo Joho Media Gakkai Gijutsu Hokoku, http://rlinks2.dialog.com/NASApp/ChannelWEB/Dialog ProServlet?ChName=engineering”, 2003, pp. 23-26, vol. 27.Applicant
- Heckbert, Paul S., “Survey of Texture Mapping, http://citeseer.ist.psu.edu/135643.html”, Proc. of Graphics Interface '86. IEEE Comp. Graphics and Applns. 1986, pp. 56-67 and 207-212.Applicant
- Homayoun Kamkar-Parsi, A., “A multi-criteria model for robust foreground extraction, http://portal.acm.org/citation.cfm?id=1099410andcoll=Porialanddl=ACMandCFID=17220933andCFTOKEN=89149269”, Proceedings of the third ACM international workshop on Video surveillance and sensor networks, 2005, pp. 67-70, ACM Press.Applicant
- Jin, Hailin et al., “A Variational Approach to Shape from Defocus, [ECCV] (2), http://citeseerist.psu.edu/554899.html”, 2002, pp. 18-30.Applicant
- Jin, J., “Medical Imaging, Image Processing, Murray H. Loew, Kenneth M. Hanson, Editors”, Proceedings of SPIE, 1996, pp. 864-868, vol. 2710.Applicant
- Kelby, Scott, “Photoshop Elements 3: Down and Dirty Tricks, ISBN: 0-321-27835-6, One Hour Photo: Portrait and studio effects”, 2004, Chapter 1, Peachpit Press.Applicant
- Kelby, Scott, “The Photoshop Elements 4 Book for Digital Photographers, XP002406720, ISBN: 0-321-38483-0, Section: Tagging Images of People (Face Tagging)”, 2005, New Riders.Applicant
- Khan, E.A., “Image-based material editing, http://portal.acm.org/citation.cfm?id=1141937andcoll=GUIDEanddl=GUIDEandCFID=68- 09268andCFTOKEN=82843223”, International Conference on Computer Graphics and Interactive Techniques, 2006, pp. 654 663, ACM Press.Applicant
- Komatsu, Kumitoshi et al., “Design of Lossless Block Transforms and Filter Banks for Image Coding, http://citeseerist.psu.edu/komatsu99design.html”.Applicant
- Leray et al., “Spatially distributed two-photon excitation fluorescence in scattering media: Experiments and time resolved Monte Carlo simulations”, Optics Comm., 2007, pp. 269-278, vol. 272—Issue 1.Applicant
- Leubner, Christian, “Multilevel Image Segmentation in Computer-Vision Systems, http://citeseerist.psu.edu/565983.html”.Applicant
- Li, Han et al., “A new model of motion blurred images and estimation of its parameter”, Acoustics, Speech, and Signal Processing, IEEE Intl Conf on ICASSP '86, pp. 2447-2450, vol. 11.Applicant
- Li, Liyuan et al., “Foreground object detection from videos containing complex background, http//portaLacm.org/citation.cfm?id=957017andcoll=Portalanddl=ACMandCFID=17220933andCFTCKE N=89149269”, Proceedings of the eleventh ACM international conference on Multimedia, 2003, pp. 2-10, ACM Press.Applicant
- Li, S. et al., “Multifocus image fusion using artificial neural networks, DOI=http://dx.doi.org/10.1016/S0167-8655(02)00029-6”, Patt. Recogn. Lett, 2002, pp. 985-997, vol. 23.Applicant
- McGuire, M. et al., “Defocus video matting, DOI=http://doi.acm.org/10.1145/1073204, 1073231”, ACM Trans. Graph., 2005, pp. 567-576, vol. 24—Issue 3.Applicant
- Neri, A. et al., “Automatic moving object and background separation Ei Compendex®. Dialog® File No. 278 Accession No. 8063256”, Signal Proc., 1998, pp. 219-232, vol. 66—Issue 2.Applicant
- Office Action in co-pending European Application No. 06 776 529.7-2202, entitled “Communication Pursuant to Article 94(3) EPC”, dated Sep. 30, 2008, 3 pages.Applicant
- Pavlidis Tsompanopoulos Papamarkos, “A Multi-Segment Residual Image Compression Technique” http://citeseerist.psu.edu/554555.html, 2008.Applicant
- PCT International Search Report, PCT/US2007/068190, dated Sep. 29, 2008, 4 pages.Applicant
- PCT Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration (PCT/EP2006/007573), dated Nov. 11, 2006.Applicant
- PCT Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for PCT application No. PCT/EP2006/008229, dated Jan. 14, 2008, 18 pages.Applicant
- PCT Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for PCT application No. PCT/US2007/061956, dated Mar. 14, 2008, 9 pages, cited by other.Applicant
- Potmesil, Michael et al., “A lens and aperture camera model for synthetic image generation, ISBN:0-89791-045-1, http://portal.acm.org/citation.cfm?id=806818andcoli=GUIDEanddl=GUIDEandCFID=680- 9268andCFTOKEN=82843222.”, International Conference on Computer Graphics and Interactive Techniques, Proceedings of the 8th annual conference on Computer graphics and interactive techniques, 1981, pp. 297-305, ACM Press.Applicant
- Rajagopalan, A.N. et al., “Optimal recovery of depth from defocused images using an mrf model, http://citeseer.ist.psu.edu/rajagopalan98optimal.html”, In Proc. International Conference on Computer Vision, 1998, pp. 1047-1052.Applicant
- Reinhard, E. et al., “Depth-of-field-based aplha-matte extraction, http://doi.acm.org/10.1145/1080402.1080419”, In Proceedings of the 2nd Symposium on Applied Perception in Graphics and Visualization, 2005, pp. 95-102, vol. 95.Applicant
- Saito, T. et al., “Separation of irradiance and reflectance from observed color images by logarithmical nonlinear diffusion process, Ei Compendex®, Dialog® File No. 278 Accession No. 10968692”, Proceedings of Society for Optical Engineering Computational Imaging IV—Electronic Imaging, 2006, vol. 6065.Applicant
- Schechner, Y.Y. et al., “Separation of transparent layers using focus, http:l/citeseer.1st.psu.edu/article/schechner98separation.html”, Proc. ICCV, 1998, pp. 1061-1066.Applicant
- Simard, Patrice Y. et al., “A foreground/background separation algorithm for image compression, Ei Compendex®, Dialog® File No. 278 Accession No. 9897343”, Data Compression Conference Proceedings, 2004.Applicant
- Subbarao, M. et al., “Depth from Defocus: A Spatial Domain Approach, Technical Report No. 9212.03, http://citeseerist.psu.edu/subbarao94depth.html”, Computer Vision Laboratory, SUNY, 1994.Applicant
- SUBBARAO, Murali et al., “Noise Sensitivity Analysis of Depth-from-Defocus by a Spatial-Domain Approach, http://citeseer.ist,psu.edu/subbaro97noise.html”, 1997Applicant
- Swain C. and Chen T. “Defocus-based image segmentation” In Proceedings ICASSP-95. vol. 4, pp. 2403-2406, Detroit, MI, May 1995, IEEE, http://citeseerist.psu.edu/swain95defocusbased—html, Sun, J., Li, Y., Kang, S. B., and Shum, H. 2006. Flash Matting.Applicant
- Television Asia, “Virtual sets and chromakey update: superimposing a foreground captured by one camera onto a background from another dates back to film days, but has come a long way since.” Television Asia, vol. 13, No. 9, p. 26, Nov. 2006. Business and Industry®, Dialog® File No. 9 Accession No. 4123327.Applicant
- Tzovaras, D. et al., “Three-dimensional camera motion estimation and foreground/background separation for stereoscopic image sequences, INSPEC. Dialog® File No. 2 Accession No. 6556637”, Optical Engineering, 1997, pp. 574-579, vol. 36—Issue 2.Applicant
- Utpal, G. et al., “On foreground-background separation in low quality document images, INSPEC. Dialog® File No. 2 Accession No. 9927003”, International Journal on Document Analysis and Recognition. pp. 47-63, vol. 8—Issue 1, 1999.Applicant
- Watanabe, Masahiro et al., “Rational Filters for Passive Depth from Defocus”, 1995.Applicant
- Yu, Jingyi et al., “Real-time reflection mapping with parallax, http//portal.acm.org/citation.cfm?id=1 053449andcoll=Portalanddl=ACMandCFID=1 7220933andCFTOKEN=89149269”, Symposium on Interactive 3D Graphics, Proceedings of the 2005 symposium on Interactive 3D graphics and games, 2005, pp. 133-138, ACM Press.Applicant
- Ziou, D. et al., “Depth from Defocus Estimation in Spatial Domain, http://citeseer.ist.psu.edu/ziou99depth.html”, CVIU, 2001, pp. 143-165, vol. 81—Issue 2.Applicant