Two stage detection for photographic eye artifacts

Information

  • Patent Grant
  • 8180115
  • Patent Number
    8,180,115
  • Date Filed
    Monday, May 9, 2011
    13 years ago
  • Date Issued
    Tuesday, May 15, 2012
    12 years ago
Abstract
A digital image acquisition device is for acquiring digital images including one or more preview images. A face detector analyzes the one or more preview images to ascertain information relating to candidate face regions therein. A speed-optimized filter produces a first set of candidate red-eye regions based on the candidate face region information provided by the face detector.
Description
BACKGROUND

1. Field of the Invention


The present invention relates to digital image processing, and more particularly to a method and apparatus for detection and correction of red-eye defects and/or other artifacts in an acquired digital image.


2. Description of the Related Art


Redeye is the appearance of an unnatural reddish coloration of the pupils of a person appearing in an image captured by a camera with flash illumination. Redeye is caused by light from the flash reflecting off blood vessels in the person's retina and returning to the camera.


A large number of image processing techniques have been proposed to detect and correct redeye in color images. In general, these techniques typically are semi-automatic or automatic. Semi-automatic redeye detection techniques rely on human input. For example, in some semi-automatic redeye reduction systems, a user must manually identify to the system the areas of an image containing redeye before the defects can be corrected.


Many automatic redeye reduction systems rely on a preliminary face detection step before redeye areas are detected. A common automatic approach involves detecting faces in an image and, subsequently, detecting eyes within each detected face. After the eyes are located, redeye is identified based on shape, coloration, and brightness of image areas corresponding to the detected eye locations. In general, face-detection-based automatic redeye reduction techniques have high computation and memory resource requirements. In addition, most of the face detection algorithms are only able to detect faces that are oriented in an upright frontal view. These approaches generally do not detect faces that are rotated in-plane or out-of-plane with respect to the image plane.


A redeye filter process is illustrated in FIG. 1(a). An input image is first analyzed by a speed optimized redeye detection stage 100 at a pixel level 103 and segmented into candidate redeye regions 104. A further series of falsing and verification filters 106 are then applied to the candidate regions and a set of confirmed redeye regions 108 is thus determined. A correction filter (pixel modifier) 102 is next applied to the confirmed regions and a final image 112, corrected for redeye, is generated.


U.S. Pat. No. 6,407,777 to inventor DeLuca discloses in-camera detection and correction of redeye pixels in an acquired digital image, while US published patent application 2002/0176623 to inventor Steinberg discloses automated real-time detection and correction of redeye defects optimized for handheld devices (each of these is assigned to the same assignee as the present application, as are U.S. application Ser. No. 10/919,226, filed Aug. 16, 2004, U.S. application Ser. No. 10/772,092, filed Feb. 4, 2004, U.S. application Ser. No. 10/772,767, filed Feb. 4, 2004, and U.S. application Ser. No. 10/635,918, filed Aug. 5, 2003). US published patent applications 2005/0047655 and 2005/0047656 to Luo et al disclose techniques for detecting and correcting redeye in a digital image and in embedded systems, respectively. The aforementioned patent and published and unpublished patent applications are all hereby incorporated by reference.


Within an image acquisition subsystem such as is embodied in typical digital cameras, a peak computing load and resource requirements occur around the time of image acquisition. Upon receiving an image acquisition request from the user the main embedded processing system refines the image focus and exposure to achieve an optimal main acquired image. This image, in turn, is off-loaded from the main optical sensor of the camera and subjected to further image processing to convert it from its raw format (e.g. Bayer) to a conventional color space such as RGB or YCC. Finally the acquired image is compressed prior to saving it on a removable storage medium such as a compact flash or multimedia card.


The time taken by the camera to recover from the acquisition of a first image and reinitialize itself to capture a second image is referred to as the “click-to-click” time. This parameter is used in the comparison and marketing of modern digital cameras. It is desired for manufacturers to minimize this “click-to-click” time. Thus, it is desired that any additional image processing, such as redeye filtering, which is to be added to the main image acquisition chain should be highly optimized for speed of execution in order to minimize its impact on the click-to-click time of the main system. Such a redeye filter typically compromises its overall performance in terms of accuracy of detection of redeye defects and quality of image correction.


An alternative would be to wait until after the main image has been acquired and perform the redeye filtering at a later time when the camera may execute the filter as a background process, or to perform the redeye filtering off-camera on a desktop PC or printer. There can be drawbacks to this alternative approach, though. First, images are displayed on the acquiring device, immediately after acquisition, with uncorrected redeye defects. Second, when images are accessed in playback mode, there is a further delay while images are post-processed before an image can be displayed. Both drawbacks would create a negative impression on end users.


Further, as most digital cameras store images using lossy compression techniques there can be additional disadvantages with respect to image quality as images are decompressed and recompressed in order to perform redeye detection and correction processes in playback or background modes. Such loss of image quality may not become apparent until later when a user wishes to print an image and it is too late to reverse the process.


If redeye processing is delayed until the images are loaded onto another device, such as a desktop PC or printer, there can be further disadvantages. First, meta-data relating to the acquiring device and its state at the time the image was acquired may not be available to the redeye filter process. Second, this post-processing device performs redeye filtering on the entire image; so that for an embedded device such as a printer that may be relatively constrained in terms of CPU cycles and processing resources for its primary post-processing activity, it would be desirable to optimize the performance of the full redeye filter. It is generally desired to optimize the detection of red-eye defects in digital images for embedded image acquisition and processing systems.


SUMMARY OF THE INVENTION

A digital image acquisition device is provided. An imaging optic and detector is for acquiring digital images including one or more preview images and a main image. A face detector module is for analyzing the one or more preview images to ascertain information relating to candidate face regions therein. An image generating module is for programming the processor to generate a sub-sampled version of the main image. A first speed-optimized red-eye filter is for programming the processor to produce a first set of candidate red-eye regions in a sub-sampled version of the main image based on the candidate face region information provided by the face detector.


An image encoder is for encoding the acquired image. An image compressor is for compressing the main image.


An image store memory is for storing therein said encoded image in association with said first set of candidate red-eye regions for later image processing of the encoded image.


An analysis-optimized red eye filter is for later analysis of a full resolution version of the main image based in part on the previous analysis.


A display is for displaying an image processed by said first speed-optimized red-eye filter.


A signal connection is for transferring images to a PC or other microprocessor-based device, or both, for further image processing.


The face detector may include a search module for detecting candidate face regions and a tracking module for predicting and confirming candidate face regions.


The one or more preview images may include a sub-sampled version of an acquired image.


The candidate face region information includes (i) a list of one or more candidate face regions; (ii) a set of data associated with one or more candidate face regions and statistical data derived from a history of the one or more candidate face regions; or (iii) a predicted location for one or more candidate face regions; or (iv) combinations thereof.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1(
a) illustrates a redeye process.



FIG. 1(
b) illustrates a redeye process according to a preferred embodiment.



FIG. 1(
c) illustrates a redeye process according to an alternative embodiment.



FIG. 2(
a) illustrates an embodiment within a digital image acquisition device.



FIG. 2(
b) illustrates an embodiment wherein analysis-optimized redeye filtering is performed on a separate device from an acquiring device.



FIG. 3(
a) illustrates a process according to an embodiment whereby a speed-optimized redeye detector is applied to a partially compressed DCT block image.



FIG. 3(
b) is a workflow diagram of an illustrative embodiment of an improved in-camera redeye detection component employing a redeye DCT prefilter.



FIG. 3(
c) is a workflow diagram of an illustrative embodiment of the redeye DCT prefilter.



FIG. 3(
d) illustrates segmentation of a redeye DCT prefilter.



FIG. 3(
e) shows a 4-DCT block neighborhood.



FIG. 4(
a) illustrates eye regions mapped onto a rectangular grid.



FIG. 4(
b) illustrates the approximate color which will be recorded by a DC coefficient of each DCT block after the image of FIG. 4(a) is transformed into the DCT domain.



FIGS. 4(
c), 4(d) and 4(e) illustrate DCT blocks from FIG. 4(a) that can be identified with the colors of a redeye candidate region, an eye-white region and a skin color region, respectively, through the use of an inclusive color determining filter method;



FIG. 5 illustrates a functional implementation of a modified redeye filtering process according to another embodiment.



FIG. 6(
a) illustrates an original defect region stored in a header and a corrected defect region applied to a main image body.



FIG. 6(
b) illustrates a corrected defect region stored in the header and the original defect region remaining uncorrected in the main image body.



FIG. 6(
c) illustrates an original defect region and at least one alternative corrected defect region stored in the header and the optimally determined corrected defect region applied to the main image body.



FIG. 7 illustrates a functional implementation of a preferred further embodiment of a redeye filtering process.





DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

A two-stage redeye filtering process is provided whereby a speed optimized filter performs the initial segmentation of candidate redeye regions and optionally applies a speed-optimized set of falsing/verification filters to determine a first set of confirmed redeye regions for correction. Some of the candidate regions which are rejected during the first stage are recorded and re-analyzed during a second stage by an alternative set of analysis-optimized filters to determine a second set of confirmed redeye regions.


Optionally, the first set of confirmed redeye regions may be passed through the second stage analysis-optimized filters.


In an alternative embodiment, the second stage filter may incorporate an enhanced correction filter which may be optionally applied to the first set of confirmed redeye regions.


A process is provided including implementing a two-stage redeye filter wherein a first redeye filter process, which is optimized for speed, is combined with a second redeye process which is optimized for accurate image analysis. The advantages of a redeye filter implemented within a main image acquisition chain are combined with those of a redeye filter implemented in background/playback mode, while disadvantages generally associated with each of these two approaches are reduced or eliminated.


A red eye process in accordance with a preferred embodiment is illustrated in FIG. 1(b). An input image 110 is processed by a pixel analyzer 103, segmented into a set of candidate regions 104 and subsequently passed through a set of falsing & verification filters 106. these components form a speed optimized redeye detection filter 100 corresponding generally to the filter 100 of FIG. 1(a), except that in the embodiment illustrated at FIG. 1(b), filter 100 is modified so that candidate redeye regions which, instead of being ultimately classified as false positives, based on their size or probability being below a predetermined threshold are saved as candidate regions 109 for a subsequent optimized analysis 101.


Thus, in this embodiment the falsing & verification filters 106 generates a set of secondary candidate regions 109 in addition to the set of confirmed redeye regions 108. The set of secondary candidate regions may include members of the original candidate region set 104, which could be neither confirmed nor eliminated by the speed optimized redeye detection process 100. It may also include combined candidate regions in close proximity to each other.


This set of candidate regions 109 is saved either in a RAM buffer, or in non-volatile memory depending on the implementation of the embodiment. Where the data is saved in RAM (or volatile) memory, the image acquisition system applies the second stage redeye filter to the image prior to powering down. The preferred form of storage is in non-volatile memory, or on a removable media card. In other embodiments this data may be stored in the image header with the part-processed image itself.


In this embodiment, a second stage, analysis optimised redeye filter 101 is next applied to the secondary set of candidate regions 109. During the analysis optimized detection process 101, the saved candidate regions 109 are preferably further analyzed at a higher resolution than during the speed optimized process. Thus, the filter 101 includes an analysis optimized set of falsing and verification filters 116, which differ either in their nature or in their operating parameters from the falsing and verification filters 106 employed in the speed optimized analysis. Nonetheless, it will be appreciated that it may be useful to perform one or more intermediate stages of optimized analysis at increasing image resolutions. This will depend on the hardware capabilities of the imaging appliance and the resources available within the image processing subsystems of the imaging appliance.


Second stage analysis may occur in response to a variety of external events. For example, a user may initiate image playback causing this filter 101 to be applied. Alternatively, a camera may signal that it has been idle for a predetermined interval and thus background redeye processing may be initiated. Where a camera can determine its motion from auto-focus data, e.g., when a camera is idle such that image focus does not change for a predetermined interval and no user input is received, background image processing including stage-two redeye filtering may be initiated.


After a set of confirmed redeye regions 118 is determined by the second stage redeye filter 101, a correction filter (pixel modifier) 102 is applied and these corrected regions are merged 115 with the initial corrected image 112 to generate a final corrected image 113.


An alternative embodiment is illustrated in FIG. 1(c) which differs from the embodiment of FIG. 1(b) in that a single correction filter (pixel modifier) 102b is applied after the second stage redeye filter 101, rather than merging the initial corrected image 112 with the corrected regions determined by the stage-two filter 101. The filter 102b corrects both the original confirmed redeye regions 108 and the second stage confirmed redeye regions 118 to produce the final corrected image 113.



FIG. 2(
a) illustrates an embodiment within a digital image acquisition device. The speed optimized redeye filter 411 may contains both detection 411-1, 411-2 & 411-4 and, optionally, correction 411-3 processes. Similarly, the analysis optimized redeye filter 412, which may operate as a background process 403, performs additional refinements to the initial determinations and corrections of the speed optimized filter 411. Data related to these initial determinations is provided by the redeye filter metadata 410-5 which is stored with the acquired image 410-2 in an image store 410.



FIG. 2(
b) illustrates a variation on the embodiment of FIG. 2(a) wherein the analysis optimized redeye filter is performed on a separate device 400 to the original acquiring device. This may be, for example, a desktop PC, or a printer. In other embodiments the camera may connect directly to a network or web service. The image data transfer means 404a, 404b may be either a point-to-point communications link between the two devices. A removable storage media may be physically exchanged between the two devices, or alternatively both devices may be connected to a common network such as the internet. In other embodiments, the redeye filter metadata 410-5 may be incorporated with the main image data 410-2 by adding the metadata to the JPEG header (see FIG. 3(a)). Background redeye filters may operate on both the original acquiring device 400 and a separate device 400′. Supporting multiple redeye filters of increasing sophistication can involve exchange and storage of complex and detailed metadata with the image being analyzed and corrected.


For an exemplary, non-exhaustive list of some typical filters that may be found in either the speed or analysis-optimized redeye filters 411, 412, see U.S. published application Ser. No. 10/976,336, filed Oct. 28, 2004, which is assigned to the same assignee as the present application and is hereby incorporated by reference.


In the embodiments above, speed optimized redeye detection 100 is preferably applied to a sub-sampled input image. The confirmed redeye regions 108 from this speed optimized redeye detection 100 are passed to a redeye correction module 102/102a. The corrected redeye image 112 can be displayed on a low-resolution viewing screen of a digital camera immediately after the image acquisition process providing the user with a redeye corrected image almost instantly. However, although this initial corrected image 112 may be adequately corrected, for example, where it is a portrait-style image in which a face occupies most of an image or where large high probability red-eye regions exist, it may not be adequately corrected for images including a large groups of persons, where the candidate redeye regions are smaller or less certain. Accordingly, the second analysis optimized redeye filtering process 101 is preferably implemented after image acquisition but prior to final image 113 display on a larger viewer, or image printing. The analysis optimized redeye detection process 101 and correction process 102 may be advantageously delayed until such high resolution viewing or printing is desired by the end user.


In the embodiments of FIGS. 2(a) and 2(b), the sub-sampled versions of the main image or well as uncorrected full size versions of the main image may be provided directly from main image acquisition device hardware 402 rather than needing to explicitly sub-sample a decoded full size main image.


As in the case of FIG. 1(c), image correction need not be performed on images within the acquisition chain and can in fact be performed in the background on acquired images for which speed optimised redeye detection has been performed in the acquisition chain. This is advantageous in many image acquisition appliances where image compression is often implemented in hardware as part of the main image acquisition chain 401. In this embodiment, only the detection process is actually performed in the acquisition chain. A speed optimized correction or a full analysis optimized redeye filter may be subsequently selected in playback mode either based on a predetermined setting within the camera, or on a user selection at the time of image playback/viewing.


In the embodiment of FIG. 3(a), an acquired raw image 402 is partially processed 404 before being provided to DCT compression block 408-1. This block provides a sub-sampled version of the acquired image and, although not shown, this can be provided to the image store 410 as explained above. A speed optimized redeye detector 428 is then applied to the partially compressed DCT block image and DCT red-eye candidate regions both corrected and suspected uncorrected regions are output for storage in the store 410. An advantage of applying speed optimised correction at DCT block level, rather than at the pixel level, is that the need for an explicit image subsampling step is avoided, yet the benefits of applying redeye analysis to a sub-sampled image as detailed in the prior art cited herein are retained.


The regions output by the DCT prefilter 428, incorporated in the main image acquisition chain 401, can advantageously allow much of the DCT block stream to be bypassed without being processed when an image is subsequently corrected by a filter such as a background filter module 426. This allows either much faster or more detailed analysis and filtering of the DCT blocks which are determined to require processing by an analysis optimized redeye filter 406. Those skilled in the art will realize that further embodiments are possible which separate aspects of both the DCT prefilter and the otherwise conventional type redeye filter 406 between the main image acquisition chain, 401 and a background redeye detection and correction process 426.



FIG. 3(
b) shows in more detail the operation of the redeye DCT prefilter 428. This particular example illustrates how the DCT prefilter can integrate with the main image acquisition, processing and compression chain, 402, 404 and 408 of FIG. 3(a). The DCT image to be filtered is first loaded into memory 902 after which the main DCT prefilter 428 is applied. This has three main stages. First, the DCT blocks of the image are scanned 904 and the relevant DCT coefficients are extracted. Depending on the sophistication of the filter, perhaps only the DC components of each DCT block may be utilized in the subsequent analysis. Alternatively, some of the AC components may be extracted in order to allow some texture or sharpness/blur determination as part of the prefilter operation.


In a second principle stage of the DCT prefilter 428, the DCT blocks are segmented and grouped 906 based on a plurality of criteria determined from the coefficients extracted at step 904. A region based analysis is performed 907 in order to determine the final candidate redeye groupings. It is next determined if there are any valid candidate grouping 908 and if not the normal JPEG compression process is resumed 408-2. If candidate regions are determined 908 then a bounding region is determined for each region 910 which is sufficiently large to include various eye-region features which may be used as part of a main redeye filter process 411/412 of FIG. 3(a). If the certainty of the region being a flash eye defect is high enough, a bounding box region may be decompressed to bitmap format 912 and a speed optimized redeye filter chain 914 may be applied to correct that region of the main image 914. The corrected regions in bitmap space are next mapped to an integer number of 8×8 block boundaries and are recompressed 918 and subsequently overwritten 920 onto the DCT domain. Finally, normal JPEG compression is resumed 408-2. As mentioned previously each of the corrected region boundaries and suspected region boundaries may be output for use in later analysis optimized detection and correction.



FIG. 3(
c) shows the region based analysis 907 of FIG. 3(b) in more detail. First, the DCT coefficients are read 930 from a DCT image in temporary memory store. These coefficients are then preprocessed into a set of criteria tables 932. Each table is preferably a numeric table of size N×M where there are N×M DCT blocks in the image being analyzed. As examples, one such table will contain the red chrominance component normalized to emphasize a colour range associated with flash eye defects and derived from the DC coefficients for the luminance (Y) and red chrominance (Cr) components of each DCT block. Another table may contain differential values derived from neighboring DCT blocks and used in edge detection. Yet another table may contain variance values calculated across a set of neighboring DCT blocks. Those skilled in the art will realize that as an implementation of the DCT prefilter becomes increasingly sophisticated that multiple additional criteria may be incorporated into the algorithm.


After the calculations required for each criteria table have been completed 932 they are copied into temporary storage 933 and the prefilter algorithm will next perform a filtering and segmentation step 907 for each of the plurality of criteria tables. This particular step is further detailed in FIG. 3(d) below. Now the prefilter has determined a plurality of sets of DCT block grouping based on the segmentation analysis of a plurality of criteria tables. These groupings are sorted and analyzed to determine a final set of flash defect candidate regions.


This region-based analysis 936 is comprised of a number of alternative techniques which will be known to those skilled in the art. In particular, we mention that regions may be combined both in inclusive, exclusive and less frequently in mutually exclusive combinations 936-1. An alternative approach to region-based analysis will employ template matching 936-2. An example is provided in U.S. Pat. No. 5,805,727 to Nakano, which is hereby incorporated by reference. A sub-region is matched within a DCT image using both coarse and fine template matching techniques based on the DC coefficients of the DCT blocks within the image.


A component of the region based analysis is a re-segmentation engine 92-6 which is responsible for analyzing larger regions which may, in fact, be two distinct overlapping regions, or clusters of smaller regions which may, in fact, be a single larger region. Then once the region based analysis 936 is completed a final LUT containing the list of determined flash defect candidate regions is obtained and written to system memory.



FIG. 3(
d) shows the segmentation step 907 of the redeye DCT prefilter in more detail. The next preprocessed criteria table to be processed by the segmentation process is first loaded 950 and the labeling LUT for the region grouping process is initialized 952. Next the current DCT block and DCT block neighborhoods are initialized 954.



FIG. 3(
e) shows a diagrammatic representation of a 4-DCT block neighborhood 992 containing the three upper DCT blocks and the DCT block to the left of the current DCT block 994, which is cross-hatched in FIG. 3(e). This 4-block neighborhood 992 is used in the labeling algorithm of this exemplary embodiment. A look-up table, LUT, is defined to hold correspondence labels.


Returning to step 954 we see that after initialization is completed the next step for the workflow of FIG. 3(d) is to begin a recursive iteration through all the elements of the current criteria table in a raster-scan from top-left to bottom-right. The workflow next determines if the current criteria table value, associated with the current DCT block satisfies membership criteria for a candidate redeye region 958. Essentially this implies that the current criteria table value has properties which are compatible with a flash eye defect. If the current criteria table value satisfies membership criteria for a segment 958, then the algorithm checks for other member DCT blocks in the 4-block neighborhood 960. If there are no other member blocks, then the current block is assigned membership of the current label 980. The LUT is then updated 982 and the current label value is incremented 984. If there are other member blocks in the 4-block neighborhood 960 then the current block is given membership in the segment with the lowest label value 962 and the LUT is updated accordingly 516. After the current block has been labeled as part of a flash-eye defect segment 962 or 980, or has been categorized as not being a member of a candidate defect region during step 958, a test is then performed to determine if it is the last DCT block in the image 966. If the current block is the last block in the image then a final update of the LUT is performed 970. Otherwise the next criteria table value is obtained by incrementing the current block pointer 968 and returning to step 958 and is processed in the same manner. Once the final DCT block is processed and the final LUT completed 970, all of the blocks with segment membership are sorted into a labeled-segment table of potential eye-defect segments 972. Another test is then made to determine if this is the last criteria table to be processed 966 and if that is the case then control is passed to the region based analysis step of FIG. 3(c) 936. Otherwise the block segmentor returns to step 950 and loads the next criteria table for processing.


A number of alternative techniques can advantageously be adapted for use within the redeye DCT prefilter. U.S. Pat. No. 5,949,904 to Delp discloses querying image colors within a DCT block. In particular it allows the determination of color within the DCT block from the DC coefficient of the DCT alone. Thus from a knowledge of the DC coefficients alone color matching can be achieved. U.S. Pat. No. 6,621,867 to Sazzad et al discloses determining the presence of edges within DCT blocks based on differences between the DC coefficients in neighbouring DCT blocks.


Now additional image qualities such as texture and image sharpness/blur can be determined through an analysis of additional AC components within a DCT block. Examples of such analysis techniques are described in US patent application No. 2004/0120598 to Feng and US patent application No. 2004/0057623 to Schuhurke et al.


Alternative DCT block segmentation techniques may be employed in other embodiments, and specifically techniques described in U.S. Pat. No. 6,407,777 to DeLuca, U.S. Pat. No. 6,873,743 to Steinberg, and US patent applications 2005/0047655 and 2005/0047656 to Luo et al. All of these patents and published applications are hereby incorporated by reference.


In FIG. 4(a) we show an example of how an outline color template can be constructed for redeye regions. FIG. 4(a) shows an eye regions mapped onto a rectangular grid. Each block of the grid 201 corresponds to an 8×8 pixel block. The main redeye defect 204 is typically surrounded by an iris region 203 and an additional eye-white region 202 and the boundary of the main redeye region, 206 as determined by a redeye filter.


Next, in FIG. 4(b) we show the approximate color which will be recorded by the DC coefficient of each DCT block after the image in FIG. 4(a) is transformed into the DCT domain. The colour combinations shown in FIG. 4(b) are as follows: R is a reddish hue indicative of a flash-eye defect phenomenon; S is a hue indicative of a skin colour; W: indicates a whitish colour associated with the eye-white region; I: is the Iris colour of the eye which can vary significantly from person to person; WS: indicates a block with mixed skin and eye-white; RW: is a block with mixed redeye and eye white; and RI: has a hue which is a mix of red and the Iris color. Now if sufficiently inclusive color filtering is applied to these image blocks it is possible to determine directly from the DC coefficients of the DCT domain image a color map for a typical redeye. FIG. 4(c) illustrates a region which will be determined as red if an inclusive color filter is used. FIGS. 4(d) and 4(e) illustrate this for eye white and skin color regions surrounding the flash eye defect region. This data can, for example, be used to build a set of color templates for a flash eye defect region. By applying other conventional techniques it is possible to determine DCT blocks which contain sharp edges, or transitions between color regions. This can provide additional information to improve the DCT prefilter detection process.


A potential disadvantage in the embodiment of FIG. 3(a) is that it requires the entire image to be decompressed in order to perform the second-step redeye filtering process. As most cameras use JPEG compression which is lossy it is desirable for certain embodiments to implement a lossless embodiment which allows a two-stage redeye process to be applied within an image acquisition appliance without loss of image quality.


Accordingly, FIG. 5 illustrates a functional implementation of modified redeye filtering process which allows an analysis optimized redeye detection and correction to occur in playback mode, without loss of image quality. This also allows complex post-processing, to be implemented in incremental steps. Thus, when a camera is idle with respect to user activity, yet is still switched on it may load and commence processing of an image. When user activity recommences the camera can recompress and save the image being processed prior to responding to the user. As the embodiment described below allows lossless saving and restoration of a image within the camera, it thus facilitates incremental process of an image which is not limited to redeye, but may be applied likewise to other in-camera methods such as face detection or recognition.


Various means of sensing user activity may be alternatively employed. One example includes detecting camera motion and optionally correlating this with other in-camera functions such as an autofocus subsystem and a user-interface subsystem. A camera may also incorporate a power-saving mode which determines that the camera has been inactive long enough to disable certain subsystems. When such a mode is activated by user inactivity then additional background image processing can be initiated without interfering with the use of the appliance by the user.


Returning to FIG. 5, an embodiment is illustrated which incorporates a speed-optimized redeye filter 411 in the main image acquisition chain 401. In this exemplary embodiment, the speed optimization of the filter is achieved by implementing a minimal set of falsing and validation filters and no correction process is applied during the main image acquisition chain. In alternative embodiments the speed optimization techniques described in relation to embodiments above may optionally be incorporated or substituted.


After an image is analyzed by this speed optimized redeye filter 411 it is subsequently compressed 427-1 and stored 410. In addition data relating to the location of candidate redeye regions and false positives is recorded and associated with the stored image.


Now when the camera can initiate background processing, as described above, or when the user enters playback mode and selects an image for viewing it will be partially decompressed 433 from JPEG to DCT block form. As this decompression step is lossless there is no loss of quality to the main image which is temporarily stored in memory and passed to a DCT region decompressor 430. This DCT region decompressor uses the data stored and associated with the original image to determine the specific DCT blocks which contain candidate redeye regions, and, optionally, false positive regions which may benefit from additional detection processing if sufficient time & system resources are available.


Each decompressed DCT region is then incrementally filtered by one or more redeye filters to determine corrections which should be applied to said DCT image block.


In certain embodiments, DCT blocks may be decompressed to bitmap format and filtered as a pixel block. In other embodiments adjacent, non-candidate DCT blocks may be included in the decompression 430 and filtering 412 processes. Once a decompressed DCT block region, which may include multiple DCT blocks, has been corrected by the redeye filter 412 then the corrected DCT image segment is passed onto a DCT block matching module 416 which, in addition to checking the alignment of DCT blocks will also check the integration of the corrected DCT blocks within the partially decompressed and temporarily stored DCT block image. When all candidate DCT blocks and any adjacent DCT blocks included in the redeye filter analysis have been corrected they are overwritten onto the partially decompressed and temporarily stored DCT block image by a DCT region overwriter 418 module. The partially decompressed and temporarily stored DCT block image is next passed to the DCT to JPEG image compression module 427-1 and is losslessly compressed back to JPEG format.


Note that in this way the only regions of the image which are decompressed using lossy techniques are those identified by the speed optimized redeye filter 411 in the image acquisition chain. As these image regions are to be corrected the effect of lossy decompression and recompression on them will thus be negligible.


Several further embodiments can be identified. These include (i) saving a copy of the original defect region prior to overwriting the DCT blocks which contain the image defect in the temporary copy of the DCT image. This alternative embodiment supports lossless restoration of the original image. The saved original DCT block region containing the defect can be stored within the header of the JPEG image. In U.S. Pat. No. 6,298,166 to Ratnakar et al., watermark data is incorporated in the image. Thus the corrected image can contain a copy of any original uncorrected regions. Alternatively (ii) multiple alternative correction algorithms can be employed and these may be temporarily copied for later storage in the JPEG header for later selection by an end user through a user interface, either on the camera or subsequently in a computer based image processing application. The overwriting step is optional. If it is used, then certain image analysis criteria can be applied as additional processing either immediately prior to overwriting, or as an integral part of detecting or correcting red-eye or combinations thereof.


Further aspects of these embodiments are illustrated in FIGS. 6(a)-(c). FIG. 6(a) illustrates an example of the original defect region 506 stored in the header 504 and the corrected defect region 508 applied to the main image body 502. FIG. 6(b) illustrates an example of the corrected defect region 508 stored in the header 504 and the original defect region 506 remaining uncorrected in the main image body 502. FIG. 6(c) illustrates an example of the original defect region 506 and at least one alternative corrected defect region 508-2 stored in the header 504 and the optimally determined corrected defect region 508-1 applied to the main image body 502. The graphical representations of “corrected” and “uncorrected” eye regions used in FIGS. 6(a)-(c) is for illustrative purposes; while graphical eye-regions preferably actually represents a transformed block of DCT coefficients.


In other embodiments, the performance of the fast red-eye filter can be further improved by selectively applying it to a limited set of regions within the acquired image. As it is generally impractical to implement extensive image analysis during the main image acquisition chain, these regions are preferably determined prior to the initiation of the main image acquisition.


One convenient approach to pre-determine image regions which have a high probability of containing red-eye candidates is to perform pre-processing on a set of preview images. Many state-of-art digital cameras acquire such a stream of images captured at video rates of 15-30 frames per second (fps) at a lower resolution than that provided by the main image acquisition architecture and/or programming. A set of 320×240, or QVGA images is typical of many consumer cameras and the size and frame-rate of this preview images stream can normally be adjusted within certain limits.


In one embodiment, as illustrated in FIG. 7, the digital camera includes a face detector (600) which operates on the preview image stream (410-3). The face detector may have two principle modes: (i) a full image search mode to detect (and confirm) new face-candidate regions (601); and (ii) a main tracking mode which predicts and then confirms the new location of existing face-candidates in subsequent frames of the image stream and compiles statistical information relating to each such confirmed candidate region. Both modes can employ a variety of methods including face detection, skin region segmentation, feature detection including eye and mouth regions, active contour analysis and even non-image based inputs such as directional voice analysis (e.g. US 2005/0147278 to Rui et al which describes a system for automatic detection and tracking of multiple individuals using multiple cues). As the first mode, hereafter referred to as the “seeding mode” is applied to the entire image, it is computationally more intensive and is only applied occasionally, e.g., every 30-60 image frames. As such, new faces appearing in the image will still be detected within a couple of seconds which is sufficient for most consumer applications. The second mode is preferably applied to every image frame, although not all of the analysis cues may be applied on every frame.


Thus in normal operation only the output(s) from the second operational mode of a face tracker algorithm will be available after every frame of the preview image stream. There may be three principle outputs from this second mode: (i) a list of candidate face regions which are confirmed to still contain faces; and/or (ii) a set of data associated with each such confirmed face region including its location within that frame of the image and various additional data determined from a statistical analysis of the history of said confirmed face region; and/or (iii) a predicted location for each such confirmed face region in the next frame of the preview image stream. If item (ii) is used, item (iii) can be optional as sufficient data may be provided by item (ii) for a determination of predicted location.


These outputs from the preview face detector (600) enable the speed optimized red-eye detector 411 to be applied selectively to face regions (601) where it is expected that a red-eye defect will be found.


Techniques are known wherein a face detector is first applied to an image prior to the application of a red-eye filter (e.g. US 20020172419 to Lin et al; US 20020126893 to Held et al; US 20050232490 to Itagaki et al and US 20040037460 to Luo et al.). We emphasize that, under normal circumstances, there is not sufficient time available during the main image acquisition chain, which is operable within a digital camera to allow the application of face detector prior to the application of a red-eye filter. The present embodiment overcomes this disadvantage of the prior art by employing the predictive output of a face tracker module (600). Although the size of the predicted region will typically be larger than the size of the corresponding face region, it is still significantly smaller than the size of the entire image. Thus, advantages of faster and more accurate detection can be achieved within a digital camera or embedded image acquisition system without the need to operate a face detector (600) within the main image acquisition chain.


Note that where multiple face candidate regions (601) are tracked, then multiple predicted regions will have the speed-optimized red-eye filter applied.


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 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.


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
  • 1. A digital image acquisition device, comprising: an imaging optic and detector for acquiring digital images including one or more preview images and a main image;a processor;a face detector to analyze the one or more preview images to ascertain information relating to candidate face regions therein, the face detector including a search module for detecting candidate face regions;a face tracking module for predicting and confirming candidate face regions;an image acquisition chain for image processing to generate a sub-sample resolution version of the main image, including a reduced resolution version of an approximately same scene as the main image;a first speed-optimized face defect filter to produce a first set of candidate face defect regions in the sub-sample resolution version of the main image based on the candidate face region information provided by the face detector;a display to show a first speed-optimized face defect filtered acquired image thereon; anda second analysis-optimized face defect filter configured to be activated after display of said first speed-optimized corrected acquired image on said display, said second filter being activated upon initiation of an image playback mode, said second analysis-optimized face defect filter being configured to produce, with enhanced accuracy of face defect detection and/or higher quality of image correction than the first filter, a second set of candidate face defect regions for viewing at a higher resolution than the first speed-optimized face defect filtered acquired image shown on said display.
  • 2. The device of claim 1, further comprising an image encoder for encoding said acquired image.
  • 3. The device of claim 1, further comprising an image store memory for storing therein an encoded image in association with said first set of candidate face defect regions for later image processing of said encoded image.
  • 4. The device of claim 1, wherein the second analysis-optimized filter is configured to operate on regions of said array identified as corresponding to regions of said first speed-optimized set of candidate face defect regions.
  • 5. The device of claim 1, further comprising a display for displaying an image processed by said first speed-optimized face defect filter.
  • 6. The device of claim 1, further comprising an image compressor for compressing said acquired image.
  • 7. The device of claim 1, further comprising a signal connection for transferring said image to a computing appliance for further image processing of said image.
  • 8. The device of claim 1, wherein the one or more preview images comprises a sub-sampled version of an acquired image.
  • 9. The device of claim 1, wherein the candidate face region information comprises: (i) a list of one or more candidate face regions;(ii) a set of data associated with one or more candidate face regions and statistical data derived from a history of the one or more candidate face regions; or(iii) a predicted location for one or more candidate face regions; or(iv) combinations thereof.
  • 10. A method for filtering a face defect artifact from an acquired digital image, the method comprising: using a processor;detecting candidate face regions;predicting and confirming candidate face regions;acquiring one or more preview images;analyzing the one or more preview images to ascertain information relating to candidate face regions therein;acquiring a main image using a lens and image sensor;generating and analyzing a sub-sample resolution version of the main image, including a reduced resolution version of an approximately same scene as the main image;producing a first set of candidate face defect regions in the main image based on the candidate face region information in the one or more preview images provided by the face detector and on the analysis of the sub-sample resolution version of the main image;displaying a first speed-optimized face defect filtered acquired image thereon; andactivating a second analysis-optimized filter after displaying said first speed-optimized corrected acquired image, said activating being performed upon initiation of an image playback mode, said second analysis-optimized face defect filter being configured for enhanced accuracy of face defect detection and/or higher quality of image correction than the first speed-optimized face defect filtered acquired image, and thereby producing a second set of candidate face defect regions for viewing at a higher resolution than the displaying of said first speed-optimized face defect filtered acquired image.
  • 11. The method of claim 10, further comprising encoding said main image.
  • 12. The method of claim 10, further comprising storing an encoded main image in association with said first set of candidate face defect regions for later image processing of said encoded main image.
  • 13. The method of claim 12, further comprising image processing a full resolution version of the main image with an analysis-optimized face defect filter based only in part on information obtained in the previous analyzing.
  • 14. The method of claim 13, further comprising correcting detected face defect artifacts within the main image, and storing a corrected main image.
  • 15. The method of claim 10, wherein the producing said second set of candidate face defect regions comprises operating the second analysis-optimized filter on regions identified as corresponding to the first set of candidate face defect regions.
  • 16. The method of claim 10, further comprising transferring the main image to a PC or other microprocessor-based device, or both, for further image processing along with information obtained in the previous analyzing.
  • 17. The method of claim 10, wherein the one or more preview images comprises a sub-sampled version of an acquired image.
  • 18. The method of claim 10, wherein the candidate face region information comprises: (i) a list of one or more candidate face regions;(ii) a set of data associated with one or more candidate face regions and statistical data derived from a history of the one or more candidate face regions; or(iii) a predicted location for one or more candidate face regions; or(iv) combinations thereof.
  • 19. One or more storage devices having program instruction embedded therein for programming a processor to perform the method of any of claims 10-18.
PRIORITY

This application is a Continuation of U.S. patent application Ser. No. 12/952,162, filed Nov. 22, 2010, now U.S. Pat. No. 7,970,183; which is a Division of U.S. patent application Ser. No. 11/462,035, filed Aug. 2, 2006, now U.S. Pat. No. 7,920,723, which is a Continuation-in-Part of U.S. patent application Ser. No. 11/282,954, filed Nov. 18, 2005, now U.S. Pat. No. 7,689,009, which is hereby incorporated by reference.

US Referenced Citations (357)
Number Name Date Kind
4285588 Mir Aug 1981 A
4577219 Klie et al. Mar 1986 A
4646134 Komatsu et al. Feb 1987 A
4777620 Shimoni et al. Oct 1988 A
4881067 Watanabe et al. Nov 1989 A
4978989 Nakano et al. Dec 1990 A
5016107 Sasson et al. May 1991 A
5070355 Inoue et al. Dec 1991 A
5130789 Dobbs et al. Jul 1992 A
5164831 Kuchta et al. Nov 1992 A
5164833 Aoki Nov 1992 A
5202720 Fujino et al. Apr 1993 A
5227837 Terashita Jul 1993 A
5231674 Cleveland et al. Jul 1993 A
5249053 Jain Sep 1993 A
5274457 Kobayashi et al. Dec 1993 A
5301026 Lee Apr 1994 A
5303049 Ejima et al. Apr 1994 A
5335072 Tanaka et al. Aug 1994 A
5384601 Yamashita et al. Jan 1995 A
5400113 Sosa et al. Mar 1995 A
5424794 McKay Jun 1995 A
5432863 Benati et al. Jul 1995 A
5432866 Sakamoto Jul 1995 A
5438367 Yamamoto et al. Aug 1995 A
5452048 Edgar Sep 1995 A
5455606 Keeling et al. Oct 1995 A
5537516 Sherman et al. Jul 1996 A
5568187 Okino Oct 1996 A
5568194 Abe Oct 1996 A
5649238 Wakabayashi et al. Jul 1997 A
5671013 Nakao Sep 1997 A
5678073 Stephenson, III et al. Oct 1997 A
5694926 DeVries et al. Dec 1997 A
5708866 Leonard Jan 1998 A
5719639 Imamura Feb 1998 A
5719951 Shackleton et al. Feb 1998 A
5721983 Furutsu Feb 1998 A
5724456 Boyack et al. Mar 1998 A
5734425 Takizawa et al. Mar 1998 A
5748764 Benati et al. May 1998 A
5748784 Sugiyama May 1998 A
5751836 Wildes et al. May 1998 A
5761550 Kancigor Jun 1998 A
5781650 Lobo et al. Jul 1998 A
5805720 Suenaga et al. Sep 1998 A
5805727 Nakano Sep 1998 A
5805745 Graf Sep 1998 A
5815749 Tsukahara et al. Sep 1998 A
5818975 Goodwin et al. Oct 1998 A
5847714 Naqvi et al. Dec 1998 A
5850470 Kung et al. Dec 1998 A
5862217 Steinberg et al. Jan 1999 A
5862218 Steinberg Jan 1999 A
5892837 Luo et al. Apr 1999 A
5949904 Delp Sep 1999 A
5974189 Nicponski Oct 1999 A
5990973 Sakamoto Nov 1999 A
5991456 Rahman et al. Nov 1999 A
5991549 Tsuchida Nov 1999 A
5991594 Froeber et al. Nov 1999 A
5999160 Kitamura et al. Dec 1999 A
6006039 Steinberg et al. Dec 1999 A
6009209 Acker et al. Dec 1999 A
6011547 Shiota et al. Jan 2000 A
6016354 Lin et al. Jan 2000 A
6028611 Anderson et al. Feb 2000 A
6035072 Read Mar 2000 A
6035074 Fujimoto et al. Mar 2000 A
6036072 Lee Mar 2000 A
6101271 Yamashita et al. Aug 2000 A
6104839 Cok et al. Aug 2000 A
6118485 Hinoue et al. Sep 2000 A
6125213 Morimoto Sep 2000 A
6134339 Luo Oct 2000 A
6151403 Luo Nov 2000 A
6172706 Tatsumi Jan 2001 B1
6192149 Eschbach et al. Feb 2001 B1
6195127 Sugimoto Feb 2001 B1
6201571 Ota Mar 2001 B1
6204858 Gupta Mar 2001 B1
6204868 Yamauchi et al. Mar 2001 B1
6233364 Krainiouk et al. May 2001 B1
6249315 Holm Jun 2001 B1
6252976 Schildkraut et al. Jun 2001 B1
6266054 Lawton et al. Jul 2001 B1
6268939 Klassen et al. Jul 2001 B1
6275614 Krishnamurthy et al. Aug 2001 B1
6278491 Wang et al. Aug 2001 B1
6285410 Marni Sep 2001 B1
6292574 Schildkraut et al. Sep 2001 B1
6295378 Kitakado et al. Sep 2001 B1
6298166 Ratnakar et al. Oct 2001 B1
6300935 Sobel et al. Oct 2001 B1
6381345 Swain Apr 2002 B1
6393148 Bhaskar May 2002 B1
6396963 Shaffer et al. May 2002 B2
6407777 DeLuca Jun 2002 B1
6421468 Ratnakar et al. Jul 2002 B1
6426775 Kurokawa Jul 2002 B1
6429924 Milch Aug 2002 B1
6433818 Steinberg et al. Aug 2002 B1
6438264 Gallagher et al. Aug 2002 B1
6441854 Fellegara et al. Aug 2002 B2
6459436 Kumada et al. Oct 2002 B1
6473199 Gilman et al. Oct 2002 B1
6496655 Malloy Desormeaux Dec 2002 B1
6501911 Malloy Desormeaux Dec 2002 B1
6505003 Malloy Desormeaux Jan 2003 B1
6510520 Steinberg Jan 2003 B1
6516154 Parulski et al. Feb 2003 B1
6614471 Ott Sep 2003 B1
6614995 Tseng Sep 2003 B2
6621867 Sazzad et al. Sep 2003 B1
6628833 Horie Sep 2003 B1
6631208 Kinjo et al. Oct 2003 B1
6700614 Hata Mar 2004 B1
6707950 Burns et al. Mar 2004 B1
6714665 Hanna et al. Mar 2004 B1
6718051 Eschbach Apr 2004 B1
6724941 Aoyama Apr 2004 B1
6728401 Hardeberg Apr 2004 B1
6765686 Maruoka Jul 2004 B2
6786655 Cook et al. Sep 2004 B2
6792161 Imaizumi et al. Sep 2004 B1
6798913 Toriyama Sep 2004 B2
6859565 Baron Feb 2005 B2
6873743 Steinberg Mar 2005 B2
6885766 Held et al. Apr 2005 B2
6895112 Chen et al. May 2005 B2
6900882 Iida May 2005 B2
6912298 Wilensky Jun 2005 B1
6937997 Parulski Aug 2005 B1
6967680 Kagle et al. Nov 2005 B1
6980691 Nesterov et al. Dec 2005 B2
6984039 Agostinelli Jan 2006 B2
7024051 Miller et al. Apr 2006 B2
7027643 Comaniciu et al. Apr 2006 B2
7027662 Baron Apr 2006 B2
7030927 Sasaki Apr 2006 B2
7035461 Luo et al. Apr 2006 B2
7035462 White et al. Apr 2006 B2
7042501 Matama May 2006 B1
7042505 DeLuca May 2006 B1
7062086 Chen et al. Jun 2006 B2
7116820 Luo et al. Oct 2006 B2
7130453 Kondo et al. Oct 2006 B2
7133070 Wheeler et al. Nov 2006 B2
7155058 Gaubatz et al. Dec 2006 B2
7171044 Chen et al. Jan 2007 B2
7216289 Kagle et al. May 2007 B2
7224850 Zhang et al. May 2007 B2
7269292 Steinberg Sep 2007 B2
7289664 Enomoto Oct 2007 B2
7295233 Steinberg et al. Nov 2007 B2
7310443 Kris et al. Dec 2007 B1
7315631 Corcoran et al. Jan 2008 B1
7336821 Ciuc et al. Feb 2008 B2
7352394 DeLuca et al. Apr 2008 B1
7362368 Steinberg et al. Apr 2008 B2
7369712 Steinberg et al. May 2008 B2
7403643 Ianculescu et al. Jul 2008 B2
7436998 Steinberg et al. Oct 2008 B2
7454040 Luo et al. Nov 2008 B2
7515740 Corcoran et al. Apr 2009 B2
7574069 Setlur et al. Aug 2009 B2
7593603 Wilensky Sep 2009 B1
7613332 Enomoto et al. Nov 2009 B2
7630006 DeLuca et al. Dec 2009 B2
7657060 Cohen et al. Feb 2010 B2
7702149 Ohkubo et al. Apr 2010 B2
7738015 Steinberg et al. Jun 2010 B2
7747071 Yen et al. Jun 2010 B2
20010015760 Fellegara et al. Aug 2001 A1
20010031142 Whiteside Oct 2001 A1
20010052937 Suzuki Dec 2001 A1
20020019859 Watanabe Feb 2002 A1
20020041329 Steinberg Apr 2002 A1
20020051571 Jackway et al. May 2002 A1
20020054224 Wasula et al. May 2002 A1
20020085088 Eubanks Jul 2002 A1
20020089514 Kitahara et al. Jul 2002 A1
20020090133 Kim et al. Jul 2002 A1
20020093577 Kitawaki et al. Jul 2002 A1
20020093633 Milch Jul 2002 A1
20020105662 Patton et al. Aug 2002 A1
20020114513 Hirao Aug 2002 A1
20020126893 Held et al. Sep 2002 A1
20020131770 Meier et al. Sep 2002 A1
20020136450 Chen et al. Sep 2002 A1
20020141661 Steinberg Oct 2002 A1
20020150292 O'callaghan Oct 2002 A1
20020150306 Baron Oct 2002 A1
20020159630 Buzuloiu et al. Oct 2002 A1
20020172419 Lin et al. Nov 2002 A1
20020176623 Steinberg Nov 2002 A1
20030007687 Nesterov et al. Jan 2003 A1
20030021478 Yoshida Jan 2003 A1
20030025808 Parulski et al. Feb 2003 A1
20030025811 Keelan et al. Feb 2003 A1
20030039402 Robins et al. Feb 2003 A1
20030044063 Meckes et al. Mar 2003 A1
20030044070 Fuersich et al. Mar 2003 A1
20030044176 Saitoh Mar 2003 A1
20030044177 Oberhardt et al. Mar 2003 A1
20030044178 Oberhardt et al. Mar 2003 A1
20030052991 Stavely et al. Mar 2003 A1
20030058343 Katayama Mar 2003 A1
20030058349 Takemoto Mar 2003 A1
20030086134 Enomoto May 2003 A1
20030086164 Abe May 2003 A1
20030095197 Wheeler et al. May 2003 A1
20030107649 Flickner et al. Jun 2003 A1
20030113035 Cahill et al. Jun 2003 A1
20030118216 Goldberg Jun 2003 A1
20030137597 Sakamoto et al. Jul 2003 A1
20030142285 Enomoto Jul 2003 A1
20030161506 Velazquez et al. Aug 2003 A1
20030190072 Adkins et al. Oct 2003 A1
20030194143 Iida Oct 2003 A1
20030202715 Kinjo Oct 2003 A1
20040017481 Takasumi et al. Jan 2004 A1
20040027593 Wilkins Feb 2004 A1
20040032512 Silverbrook Feb 2004 A1
20040032526 Silverbrook Feb 2004 A1
20040033071 Kubo Feb 2004 A1
20040037460 Luo et al. Feb 2004 A1
20040041924 White et al. Mar 2004 A1
20040046878 Jarman Mar 2004 A1
20040047491 Rydbeck Mar 2004 A1
20040056975 Hata Mar 2004 A1
20040057623 Schuhrke et al. Mar 2004 A1
20040057705 Kohno Mar 2004 A1
20040057715 Tsuchida et al. Mar 2004 A1
20040090461 Adams May 2004 A1
20040093432 Luo et al. May 2004 A1
20040109614 Enomoto et al. Jun 2004 A1
20040114796 Kaku Jun 2004 A1
20040114797 Meckes Jun 2004 A1
20040114829 LeFeuvre et al. Jun 2004 A1
20040114904 Sun et al. Jun 2004 A1
20040119851 Kaku Jun 2004 A1
20040120598 Feng Jun 2004 A1
20040125387 Nagao et al. Jul 2004 A1
20040126086 Nakamura et al. Jul 2004 A1
20040141657 Jarman Jul 2004 A1
20040150743 Schinner Aug 2004 A1
20040160517 Iida Aug 2004 A1
20040165215 Raguet et al. Aug 2004 A1
20040184044 Kolb et al. Sep 2004 A1
20040184670 Jarman et al. Sep 2004 A1
20040196292 Okamura Oct 2004 A1
20040196503 Kurtenbach et al. Oct 2004 A1
20040213476 Luo et al. Oct 2004 A1
20040223063 DeLuca et al. Nov 2004 A1
20040227978 Enomoto Nov 2004 A1
20040228542 Zhang et al. Nov 2004 A1
20040233299 Ioffe et al. Nov 2004 A1
20040233301 Nakata et al. Nov 2004 A1
20040234156 Watanabe et al. Nov 2004 A1
20040239779 Washisu Dec 2004 A1
20040240747 Jarman et al. Dec 2004 A1
20040258308 Sadovsky et al. Dec 2004 A1
20050001024 Kusaka et al. Jan 2005 A1
20050013602 Ogawa Jan 2005 A1
20050013603 Ichimasa Jan 2005 A1
20050024498 Iida et al. Feb 2005 A1
20050031224 Prilutsky et al. Feb 2005 A1
20050041121 Steinberg et al. Feb 2005 A1
20050046730 Li Mar 2005 A1
20050047655 Luo et al. Mar 2005 A1
20050047656 Luo et al. Mar 2005 A1
20050053279 Chen et al. Mar 2005 A1
20050058340 Chen et al. Mar 2005 A1
20050058342 Chen et al. Mar 2005 A1
20050062856 Matsushita Mar 2005 A1
20050063083 Dart et al. Mar 2005 A1
20050068452 Steinberg et al. Mar 2005 A1
20050074164 Yonaha Apr 2005 A1
20050074179 Wilensky Apr 2005 A1
20050078191 Battles Apr 2005 A1
20050117132 Agostinelli Jun 2005 A1
20050129331 Kakiuchi et al. Jun 2005 A1
20050134719 Beck Jun 2005 A1
20050140801 Prilutsky et al. Jun 2005 A1
20050147278 Rui et al. Jul 2005 A1
20050151943 Iida Jul 2005 A1
20050163498 Battles et al. Jul 2005 A1
20050168965 Yoshida Aug 2005 A1
20050196067 Gallagher et al. Sep 2005 A1
20050200736 Ito Sep 2005 A1
20050207649 Enomoto et al. Sep 2005 A1
20050212955 Craig et al. Sep 2005 A1
20050219385 Terakawa Oct 2005 A1
20050219608 Wada Oct 2005 A1
20050220346 Akahori Oct 2005 A1
20050220347 Enomoto et al. Oct 2005 A1
20050226499 Terakawa Oct 2005 A1
20050232490 Itagaki et al. Oct 2005 A1
20050238217 Enomoto et al. Oct 2005 A1
20050238230 Yoshida Oct 2005 A1
20050243348 Yonaha Nov 2005 A1
20050275734 Ikeda Dec 2005 A1
20050276481 Enomoto Dec 2005 A1
20050280717 Sugimoto Dec 2005 A1
20050286766 Ferman Dec 2005 A1
20060008171 Petschnigg et al. Jan 2006 A1
20060017825 Thakur Jan 2006 A1
20060038916 Knoedgen et al. Feb 2006 A1
20060039690 Steinberg et al. Feb 2006 A1
20060045352 Gallagher Mar 2006 A1
20060050300 Mitani et al. Mar 2006 A1
20060066628 Brodie et al. Mar 2006 A1
20060082847 Sugimoto Apr 2006 A1
20060093212 Steinberg et al. May 2006 A1
20060093213 Steinberg et al. May 2006 A1
20060093238 Steinberg et al. May 2006 A1
20060098867 Gallagher May 2006 A1
20060098875 Sugimoto May 2006 A1
20060119832 Iida Jun 2006 A1
20060120599 Steinberg et al. Jun 2006 A1
20060126938 Lee et al. Jun 2006 A1
20060140455 Costache et al. Jun 2006 A1
20060150089 Jensen et al. Jul 2006 A1
20060203108 Steinberg et al. Sep 2006 A1
20060204052 Yokouchi Sep 2006 A1
20060204110 Steinberg et al. Sep 2006 A1
20060221408 Fukuda Oct 2006 A1
20060280361 Umeda Dec 2006 A1
20060280375 Dalton et al. Dec 2006 A1
20060285754 Steinberg et al. Dec 2006 A1
20070098260 Yen et al. May 2007 A1
20070110305 Corcoran et al. May 2007 A1
20070116379 Corcoran et al. May 2007 A1
20070116380 Ciuc et al. May 2007 A1
20070133863 Sakai et al. Jun 2007 A1
20070154189 Harradine et al. Jul 2007 A1
20070201724 Steinberg et al. Aug 2007 A1
20070263104 DeLuca et al. Nov 2007 A1
20070263928 Akahori Nov 2007 A1
20080002060 DeLuca et al. Jan 2008 A1
20080013798 Ionita et al. Jan 2008 A1
20080043121 Prilutsky et al. Feb 2008 A1
20080112599 Nanu et al. May 2008 A1
20080144965 Steinberg et al. Jun 2008 A1
20080186389 DeLuca et al. Aug 2008 A1
20080211937 Steinberg et al. Sep 2008 A1
20080219518 Steinberg et al. Sep 2008 A1
20080232711 Prilutsky et al. Sep 2008 A1
20080240555 Nanu et al. Oct 2008 A1
20110211095 Nanu et al. Sep 2011 A1
20110222730 Steinberg et al. Sep 2011 A1
20110228134 Nanu et al. Sep 2011 A1
20110228135 Nanu et al. Sep 2011 A1
20110262034 Prilutsky et al. Oct 2011 A1
20110262035 Prilutsky et al. Oct 2011 A1
20110262038 Prilutsky et al. Oct 2011 A1
Foreign Referenced Citations (62)
Number Date Country
884694 Dec 1998 EP
911759 Apr 1999 EP
911759 Jun 2000 EP
1199672 Apr 2002 EP
1229486 Aug 2002 EP
1288858 Mar 2003 EP
1288859 Mar 2003 EP
1288860 Mar 2003 EP
1293933 Mar 2003 EP
1296510 Mar 2003 EP
1429290 Jun 2004 EP
1478169 Nov 2004 EP
1528509 May 2005 EP
979487 Mar 2006 EP
1429290 Jul 2008 EP
2 165 523 Apr 2011 EP
841609 Jul 1960 GB
2379819 Mar 2003 GB
3205989 Sep 1991 JP
4192681 Jul 1992 JP
5224271 Sep 1993 JP
7281285 Oct 1995 JP
9214839 Aug 1997 JP
2000-134486 May 2000 JP
2002-247596 Aug 2002 JP
2002-271808 Sep 2002 JP
2003-030647 Jan 2003 JP
WO9802844 Jan 1998 WO
WO9917254 Apr 1999 WO
WO9933684 Jul 1999 WO
WO0171421 Sep 2001 WO
WO0192614 Dec 2001 WO
WO0245003 Jun 2002 WO
WO 03019473 Mar 2003 WO
WO03026278 Mar 2003 WO
WO03071484 Aug 2003 WO
WO2004034696 Apr 2004 WO
WO 2005015896 Feb 2005 WO
WO2005015896 Feb 2005 WO
WO2005041558 May 2005 WO
WO2005076217 Aug 2005 WO
WO2005076217 Aug 2005 WO
WO2005087994 Sep 2005 WO
WO 2005076217 Oct 2005 WO
WO2005109853 Nov 2005 WO
WO2006011635 Feb 2006 WO
WO2006018056 Feb 2006 WO
WO2006045441 May 2006 WO
WO2007057063 May 2007 WO
WO2007057064 May 2007 WO
WO2007093199 Aug 2007 WO
WO2007093199 Aug 2007 WO
WO2007095553 Aug 2007 WO
WO2007095553 Aug 2007 WO
WO2007142621 Dec 2007 WO
WO2008023280 Feb 2008 WO
WO 2008109708 Sep 2008 WO
WO2008109644 Sep 2008 WO
WO2008109644 Sep 2008 WO
WO 2010017953 Feb 2010 WO
WO2010017953 Feb 2010 WO
WO2010025908 Mar 2010 WO
Related Publications (1)
Number Date Country
20110211095 A1 Sep 2011 US
Divisions (1)
Number Date Country
Parent 11462035 Aug 2006 US
Child 12952162 US
Continuations (1)
Number Date Country
Parent 12952162 Nov 2010 US
Child 13103842 US
Continuation in Parts (1)
Number Date Country
Parent 11282954 Nov 2005 US
Child 11462035 US