Abstract:
A method, and an apparatus employing the method, of reducing red eye effect from image data having image attributes. In some embodiments, the method includes identifying image data with a first image attribute having characteristics of skin pixels, determining a shape of the identified image data having the first image attribute, mapping other image attributes within the determined shape, and determining a red eye presence from the other mapped image attributes.

Description:
CROSS REFERENCES TO RELATED APPLICATIONS  
       [0001]     This patent application is related to the U.S. patent application Ser. No. XXX,XXX, filed MONTH DAY, 2004, entitled “Red Eye Reduction Apparatus and Method” and assigned to the assignee of the present application. 
     
    
     STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT  
       [0002]     None.  
       REFERENCE TO SEQUENTIAL LISTING, ETC.  
       [0003]     None.  
       BACKGROUND  
       [0004]     1. Field of the Invention  
         [0005]     The present invention relates to a method of image processing, and in particular, to a method of processing an image having a red eye effect, and to an apparatus employing the method.  
         [0006]     2. Description of the Related Art  
         [0007]     Red eye effect is a common phenomenon in flash photography. Many methods have been proposed to reduce or remove the red eye effect in an image. For example, a user may be required to manually indicate a location of a red eye region. Thereafter, a computer is configured to find an extent of the red eye region, correct the extent, and color the extent of the red eye region with the rest of the image.  
       SUMMARY OF THE INVENTION  
       [0008]     The present invention is an automated red eye correction method. In some embodiments, the automated red eye correction method can find red eye effects in an image, and can correct the red eye effects without user intervention. For example, at a high level, the invention can use a search scheme that includes a plurality of sequential steps. These steps can include the acts of finding skin tones of an image, finding candidate regions such as faces of the image based on the found skin tones, and finding red eye regions based on the candidate regions. Starting with data from the entire image, the searching scheme can locate and narrow an area of search down with each step. In some embodiments, combinations of search steps and techniques are used to maximize a success rate.  
         [0009]     For example, in some embodiments, the invention provides a method of reducing red eye effect from an image that has image pixel data. The method can include the acts of comparing the image pixel data with data from a skin tone pixel class, and identifying the image pixel data based upon a match between the image pixel data and the data from the skin tone pixel class. The method can include the acts of forming a shape of the identified image pixels, locating at least one pixel that has a pixel attribute in the formed shape, comparing data of the located pixels with data from a red eye map class; and locating a red eye based on a match between the image data of the located pixels and the data from the red eye map class.  
         [0010]     In some embodiments, the invention provides a method of reducing red eye effect from image data having image attributes, including the acts of identifying image data with image attributes that are characteristics of skin pixels, and determining a shape of the identified image data that has characteristics of the skin pixels. The method can also include the acts of mapped pixel attributes within the determined shape, and determining a red eye presence from the mapped pixel attributes.  
         [0011]     Some embodiments of the present invention provide a red eye reduction system adapted to reduce a red eye effect of an image, including a skin tone identifier that identifies image data with image attributes characteristics of skin pixels, a shape identifier coupled to the skin tone identifier and adapted to determine a shape of the identified image pixel data having characteristics of the skin pixels. A mapping module coupled to the shape identifier and adapted to map pixel attributes within the determined shape, and a red eye detector coupled to the mapping module, and adapted to determine a red eye presence from the mapped image attributes.  
         [0012]     Other features and advantages of the invention will become apparent to those skilled in the art upon review of the following detailed description, claims, and drawings. 
     
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0013]     The patent or application file contains at least one drawing executed in color. Copies of the patent or patent application publication with color drawings(s) will be provided by the Office upon request and payment of the necessary fee.  
         [0014]      FIG. 1  shows an overview flow chart of an embodiment of the invention.  
         [0015]      FIG. 2  shows a skin tone detection flow chart according to an embodiment of the invention.  
         [0016]      FIG. 3  shows a second skin tone detection scheme according to an embodiment of the invention.  
         [0017]      FIG. 3A  shows an exemplary image including two faces and having red eye effects.  
         [0018]      FIG. 3B  shows a plurality of skin tone pixels detected by the skin tone detection scheme from the image of  FIG. 3A .  
         [0019]      FIG. 3C  shows a plurality of detected connected regions represented by different shading colors.  
         [0020]      FIG. 3D  shows a plurality of solidified regions of the connected groups in  FIG. 3C .  
         [0021]      FIG. 3E  shows a plurality of face boxes for the solidified regions of  FIG. 3D .  
         [0022]      FIG. 3F  shows an exemplary distance map obtained from the face boxes.  
         [0023]      FIG. 3G  shows an exemplary equalized distance map obtained from the distance map.  
         [0024]      FIG. 3H  shows an exemplary distance map obtained from the equalized distance map after thresholding.  
         [0025]      FIG. 3I  shows a plurality of red eye pixels determined in the face boxes.  
         [0026]      FIG. 3J  shows a plurality of opened red eye pixels after two iterations of erosion and dilation.  
         [0027]      FIG. 3K  shows a floating-point contrast map during the first iteration of a red eye mapping scheme.  
         [0028]      FIG. 3L  shows a normalized contrast map during a first iteration of the red eye mapping scheme.  
         [0029]      FIG. 3M  shows a normalized contrast map during a second iteration of the red eye mapping scheme.  
         [0030]      FIG. 3N  shows a normalized contrast map during a fifth iteration of the red eye mapping scheme.  
         [0031]      FIG. 3O  shows a finished image with the red eye effect removed from the original image of  FIG. 3A .  
         [0032]      FIG. 4  shows a flow chart of a shape identification scheme according to an embodiment of the invention.  
         [0033]      FIG. 5  shows a red eye mapping scheme according to an embodiment of the invention.  
         [0034]      FIG. 6  shows a flow chart of a red eye reduction process according to an embodiment of the invention.  
         [0035]      FIG. 7  shows a red eye reduction system according to an embodiment of the invention. 
     
    
     DETAILED DESCRIPTION  
       [0036]     Before any embodiments of the invention are explained in detail, it is to be understood that the invention is not limited in its application to the details of construction and the arrangement of components set forth in the following description or illustrated in the following drawings. The invention is capable of other embodiments and of being practiced or of being carried out in various ways. Also, it is to be understood that the phraseology and terminology used herein is for the purpose of description and should not be regarded as limiting. The use of “including,” “comprising,” or “having” and variations thereof herein is meant to encompass the items listed thereafter and equivalents thereof as well as additional items. Unless limited otherwise, the terms “connected,” “coupled,” and “mounted” and variations thereof herein are used broadly and encompass direct and indirect connections, couplings, and mountings. In addition, the terms “connected” and “coupled” and variations thereof are not restricted to physical or mechanical connections or couplings.  
         [0037]      FIG. 1  shows an overview flow chart of a method  100  according to an embodiment of the invention. At block  102 , the method  100  finds pixels that have characteristics of skin tones. After pixels that have characteristics of skin tones have been detected, the method  100  is configured to find candidate faces from the detected pixels at block  104 . Thereafter, the method  100  proceeds to find a red eye region from the candidate faces at block  106 , and corrects the red eyes at block  108 . Details of these blocks are discussed hereinafter.  
         [0038]     Some embodiments of the present invention use a database of skin tones. After an image has been acquired, each of the pixel data of the image is compared to the data stored in the skin tone database. When there is a match between the pixel data and the data stored in the skin tone database, or that the pixel data falls within a skin tone boundary set by the skin tone database, the pixel data is classified or identified as skin tone pixel data.  
         [0039]      FIG. 2  shows a flow chart of a skin tone detection scheme  120  according to an embodiment of the invention. At block  122 , a skin tone database is constructed. Specifically, to construct the skin tone database in some embodiments, known skin tone pixels from a plurality of images are collected or handpicked. The images can be representative of a vast number of people, races, and skin colors or subset thereof. The skin tone database can also or instead be constructed by selecting any number of ranges of colors to be identified as skin tones.  
         [0040]     Skin tones collected from the images (or in any other manner) can be sorted by image attribute or color space (e.g., sorted by luminance as shown in the illustrated embodiment at block  124 ). As a result, the sorted skin tone based on color space provides a plurality of efficient lookup tables. Although luminance of a Y-Cb-Cr color space is used in the embodiment of  FIG. 2 , any other color spaces such as RGB, Lab, HSV, and the like can be used as desired. Specifically, a (Cb, Cr) pair set corresponding to each Y value can be stored in a table or other form indexed by Y value. For each Y value, all (Cb, Cr) pair sets can be plotted. A (Cb, Cr) pair boundary for each Y value can thereafter be developed. The vertices of the boundary for each Y value can thus be stored in a table (or in any other format) of the skin tone database at block  126 .  
         [0041]     To find or search whether a pixel is skin color, the skin tone detection scheme  120  of the illustrated embodiment can initially convert the pixel color to a Y-Cb-Cr color space equivalent at block  128 . The skin tone detection scheme  120  then extracts the Y index of the pixel of the image, and compares it to the Y indices of the skin tone database. When there is a match between the extracted Y index and a Y index of the skin tone database, the skin tone detection scheme  120  can compare the extracted (Cb, Cr) pair with the corresponding (Cb, Cr) pair set in the database at block  130 . More particularly, the skin tone detection scheme  120  can check to determine if the extracted (Cb, Cr) pair falls within the (Cb, Cr) pair boundary set of the Y index at block  132 . If the (Cb, Cr) pair is inside the (Cb, Cr) pair boundary set, the pixel is considered or labeled as a skin tone pixel at block  134 . Otherwise, the pixel is considered or labeled as a non-skin tone pixel at block  136 .  
         [0042]     Of course, other techniques of determining whether an image pixel is a skin tone pixel can also be used. For example, in another embodiment as shown in  FIG. 3 , a second skin tone detection scheme  140  initially assumes that an ellipse represents all skin tones. Specifically, the skin tone detection scheme  140  illustrated in  FIG. 3  calculates an elliptical area for skin tones at block  142 , similar to the boundary established in  FIG. 2 . That is, the elliptical area will therefore represent all skin tones for all luminance values. In this way, determining if a point is inside the ellipse consumes less time than determining if the same point is inside a boundary as discussed earlier, and shown in  FIG. 2 . However, since one elliptical area is used for all luminance values, the (Cb, Cr) pairs of the elliptical area are generally compensated for low and high luminance values. Specifically, the second skin tone detection scheme  140  can obtain pixel attributes such as color of the pixel, using a Y-Cb-Cr color space at block  144 . Depending on the luminance obtained, the (Cb, Cr) pair is compensated for luminance at block  146  to obtain a (Cb′, Cr′) pair. In this way, a bias due to lighting color can be eliminated, thereby enabling normalization of colors so that such colors can be shown or determined without such bias. Thereafter, the second skin tone detection scheme  140  of  FIG. 3  determines if the transformed (Cb′, Cr′) pair is in the generated ellipse at block  148 . If the (Cb′, Cr′) pair is inside the ellipse set, the pixel is considered or labeled as a skin tone pixel at block  150 . Otherwise, the pixel is considered or labeled as a non-skin tone pixel at block  152 . For a relatively high-resolution image, in some embodiments only portions of all the skin pixels are located. Therefore, some pixels can be bypassed or skipped depending on the resolution of the image. For example, in some embodiments every other pixel can be bypassed for a 100-200 dpi image. As another example, in some embodiments every third pixel can be located for a 200-300 dpi image.  FIG. 3A  shows an image  160  having two faces  162 ,  164 . Each of the faces  162 ,  164  has a pair of eyes  166  reacting to a flash and thus having red eye effects.  FIG. 3B  shows a plurality of skin tone pixels (highlighted in magenta) detected by the skin tone detection scheme  140  from the image  160  of  FIG. 3A .  
         [0043]     Once the skin tone pixels have been detected such as by using one of the skin tone detection schemes  120 ,  140  (described above) some of the embodiments of the red eye reduction method according to the present invention determine a shape of the identified image data having characteristics of the skin pixels at block  104  of  FIG. 1 . Exemplary determined shapes can include hands, faces, feet, necks, and the like, some of which (i.e., face shapes) include eyes.  
         [0044]      FIG. 4  shows a flow chart of a shape identification scheme  200  according to an embodiment of the invention. Skin tone pixels of an image, (e.g., those detected in the previous detection scheme or otherwise identified in any other manner) can be stored in a buffer at block  203 . In some embodiments, the storing buffer can be a Boolean buffer that has the same size as the original image. Each entry in the Boolean buffer has a true/false value indicating whether the corresponding pixel in the image is a skin tone pixel. Due to noise, image defects (e.g., photo overexposure), or other causes incorrectly identified pixels are possible. To filter out incorrect skin pixel determinations, the method in the embodiment of  FIG. 4  can isolate groups of connected pixels determined to be skin tone pixels, such as groups of 4 or 8-connected pixels at block  206 .  FIG. 3C  shows a plurality of detected connected regions  168 ,  170  represented by different shading colors obtained at block  206 . The number of connected skin tone pixels in each connected skin tone pixel group is counted at block  209 . At block  212  the count is compared with an empirically determined threshold. If the number falls below the threshold at block  212 , the entire connected group can be considered spurious and thus be deleted from the buffer at block  225 . Otherwise, the group of connected pixels is further analyzed.  
         [0045]     In some embodiments, once the connected group of skin tone pixels has a minimum number of connected skin tone pixels to exceed the threshold, a bounding box of the connected group is obtained at block  218  to include all the connected groups. Each bounding box has a shape. Therefore, the bounding boxes will have many different shapes. However, a typical face will have a bounding box that is mostly rectangular in shape with its height being about twice its width, or is a square. The shape of the bounding box is examined at block  221 . Particularly, a badly shaped bounding box is considered as non-candidate groups and is deleted from the storing buffer at block  224 . For example, a bounding box with its width being four times its height is considered unlikely to contain a face, and therefore, the bounding box is considered a badly shaped bounding box. As a result, the pixels in the bounding box are eliminated from further analysis. Otherwise, the bounding box of connected groups can be considered to have an acceptable shape, and therefore merits further analysis. As a result, the bounding boxes of the remaining connected groups or regions of skin tone pixels can be passed on as candidate shapes or faces, or simply face boxes. There can be many face boxes in an image. For each face box, the gaps left by incorrect skin pixel determinations or enclosed by connected groups are filled or solidified as skin tone pixels at block  227 .  FIG. 3D  shows a plurality of solidified regions  168 ′,  170 ′ of the connected groups obtained at block  227  for the image  160 . At block  229 , the bounding box is saved as a face box.  FIG. 3E  shows a plurality of face boxes  172 ,  174  obtained at block  229  for the solidified regions  168 ′,  170 ′ of the image  160 . The process continues until all the groups have been examined. In some embodiments, the shape identification scheme  200  can develop a rectangular face box that encompasses an entire face. Thereafter, pixels inside the rectangular face identified as skin tone pixels can be filled or solidified.  
         [0046]     Optionally, in some embodiments, the shape identification scheme  200  can find a plurality of edges in an image and can store the edge pixels as non-skin pixels in the buffer. These edges can be identified after a skin tone pixel detection process (such as those described above), or after finding connected skin tone pixel groups (as also described above). In this way, different body parts can be separated. For example, in some cases, face pixels and shoulder pixels will appear connected since they can have the same color. However, marking the edge pixels of chin as non-skin pixels can open up a gap between a face and a shoulder in an image. As a result, the shape identification scheme  200  will have a smaller or reduced number of search areas to examine. Edge detection can be performed by any number of standard algorithms, such as by using a Canny edge detector or Shen-Castan edge detector. If desired, pixels can be skipped or bypassed in this step, such as for high-resolution images as described earlier.  
         [0047]     A red eye mapping scheme  250  according to an embodiment of the present invention is shown in  FIG. 5 , and can be used to map different pixel attributes to determine or find a red eye region. This process can be used in conjunction with the shape identification scheme  200  described above, such as after a candidate shape has been determined in some embodiments, it is assumed that an eye has a white portion on at least one side of an iris circle, that the eye has at least a few red eye pixels, and/or that the eye has a relatively higher contrast when compared to skin tone pixels. In the embodiment of  FIG. 5 , three types of attribute maps are used in determining if a red eye is present in an image. However, any other number of maps can also be used to determine the presence of a red eye.  
         [0048]     In some embodiments, the red eye mapping scheme  250  first creates for all face boxes a Boolean map of red eye colors in the image at block  253 . To use the red eye map, a red eye database can be made for red eye colors. Similar to the manner of skin tone detection described above with reference to  FIG. 2 , a red eye database can be constructed from known red eye pixels from a plurality of images collected or handpicked, or by selecting such colors in any other manner. Images can be representative of a number of people, races, and skin colors or any subject thereof.  
         [0049]     Red eyes collected from the images can be sorted by image attribute or color space (e.g., sorted by luminance). As a result, the sorted red eyes based on color space can provide a plurality of efficient lookup tables. Although luminance of a Y-Cb-Cr color space is used in the embodiment of  FIG. 5 , any other color spaces such as RGB, Lab, HSV, and the like can be used as desired. Specifically, a (Cb, Cr) pair set corresponding to each Y value can be stored in a table or other form indexed by Y value. For each Y value, all (Cb, Cr) pair sets can be plotted. A (Cb, Cr) pair boundary for each Y value can thereafter be developed. The vertices of the boundary for each Y value can thus be stored in a table (or in any other format) of the red eye database.  
         [0050]     To find or search whether a pixel is red eye pixel, the method illustrated in  FIG. 5  can initially convert the pixel color to a Y-Cb-Cr color space equivalent. The red eye mapping scheme  250  can then extract the Y index of the pixel of the image, and compare it to the Y indices of the red eye database. When there is a match between the extracted Y index and a Y index of the red eye database, the red eye mapping  250  scheme can compare the extracted (Cb, Cr) pair with the corresponding (Cb, Cr) pair set in the database. More particularly, the red eye mapping scheme  250  can check to determine if the extracted (Cb, Cr) pair falls within the (Cb, Cr) pair boundary set of the Y index. If the (Cb, Cr) pair is inside the (Cb, Cr) pair boundary set, the pixel is considered a red eye pixel. Thereafter, the red eye mapping scheme  250  can filter the red eye map for a right shape and a right size at block  256 , in a manner similar to deleting the badly shaped bounding boxes at block  221  as discussed earlier. For example, if a rectangular shaped red eye region is unlikely to contain a red eye, and therefore considered a non-red eye candidate. The remaining red eye regions are then considered red eye candidates. The non-red eye candidates are then deleted, whereas the red eye candidates are kept for further analysis.  
         [0051]     In some embodiments, the red eye mapping scheme  250  uses a distance map to locate or to find at least one white eye portion in an image (e.g., in a candidate face box described above). For example, the red eye mapping scheme  250  in the embodiment of  FIG. 5  can create a Boolean distance map at block  259 .  FIG. 3F  shows an exemplary distance map  176  obtained from the face boxes  172 ,  174 . Specifically, the red eye mapping scheme  250  can store a distance from a neutral color for each pixel. If a pixel has a high luminance value or has a color space distance relatively distant from the neutral color, the pixel can be generally considered white. A distance can be determined by calculating a standard deviation between red, green and blue components of the pixel. In many cases, distances thus found remain in a relatively narrow band and can be difficult to distinguish from one another. Therefore, in some embodiments the red eye mapping scheme  250  applies histogram equalization on the distance map in a manner known in the art. Equalized distances can then be compared with a predetermined high threshold value, to create a Boolean map carrying true/false values. For example, any pixel having an equalized distance above 200 can be considered white and made true in the distance map, while others can be labeled false.  FIG. 3G  shows an exemplary equalized distance map  178  obtained from the distance map  176 . Comparing the luminance values of the pixels can further reduce the number of pixels in the distance map to be analyzed. For example, if the luminance of a pixel is less than a threshold of 200, the pixel can be considered a non-white color, and the corresponding entry from the distance map can be deleted.  FIG. 3H  shows an exemplary distance map  180  obtained from the equalized distance map  176  after thresholding at block  259 .  
         [0052]     In operation, the red eye mapping scheme  250  can determine whether a pixel is a red eye pixel for each pixel in a set of pixels (e.g., in the face box as described above). The true/false results can be stored in a red eye map that generally has the same size as the face box.  FIG. 31  shows a plurality of red eye pixels  182  determined in the face boxes  180 . A few passes of erosion followed by dilation can be performed on the red eye map. The image processing technique of erosion followed by dilation is known as opening and creates or opens up a plurality of small gaps between connected groups or regions. Connected regions can thus be located, and thereafter a decision can be made regarding whether the pixels therein belong to a red eye. The red eye mapping can be based at least in part on the number of pixels in the region or group, and the shape of the bounding box (if used). Unlikely candidates can be deleted from the red eye map.  FIG. 3J  shows a plurality of opened red eye pixels  182 ′ after two passes or iterations of erosion and dilation.  
         [0053]     Some embodiments of the present invention use a contrast map to determine the contrast in the pixels being examined. This contrast map (created at block  262  in the embodiment of  FIG. 5 ) can again use gray scale dilation and erosion to construct a contrast map of a candidate face or facial area with floating-point values. Since contrast map values can vary from face to face, the contrast map can be scaled or normalized. For example, in the embodiment of  FIG. 5 , the contrast map is normalized to between 0 and 255 for each face at block  265 . It is also contemplated that pixels can be bypassed or skipped if needed.  FIG. 3K  shows a floating-point contrast map  184  during the first iteration of the red eye mapping scheme  250 . Similarly,  FIGS. 3L, 3M , and  3 N show a plurality of normalized contrast maps  184 ,  184 ′,  184 ″ during a first, a second, and a fifth iteration of the red eye mapping scheme  250 , respectively.  
         [0054]     In general, the decision regarding whether a red eye has been detected by the red eye mapping scheme  250  can require several passes or iterations of the red eye mapping scheme  250 . For example, in the embodiment of  FIG. 5 , the red eye mapping scheme  250  starts with making a Boolean contrast map from the contrast map with floating-point values at block  268 , and filters the contrast map for a right shape and a right size at block  271  in a similar manner as described earlier. More specifically, if a floating-point contrast value is more than a threshold value, the corresponding entry in the Boolean contrast map can be labeled true. Otherwise, the entry in the Boolean contrast map is labeled false. Depending on the resolution of the image, some pixels can be bypassed to enhance the speeds of the mapping scheme  250 .  
         [0055]     In some embodiments, connected regions in the Boolean contrast map of the red eye mapping scheme  250  are located. Based at least in part on the shape and size of the regions, the mapping scheme  250  can determine whether the region is a viable red eye candidate at block  274 . Unlikely candidates can be deleted. For each candidate region, the mapping scheme  250  references the red eye map, the distance map, and the contrast map. If all three maps agree on the candidacy at block  277 , the region can be considered red eye at block  280 . If less than all three maps agree on the candidacy at  277 , another region is then examined, and therefore, block  274  is repeated. In other embodiments, less than all maps need to agree for a determination that a red eye has been found. After the red eye mapping scheme  250  determines that an red eye has found at block  280 , and if the mapping scheme  250  identifies two eyes for a face at block  283 , the mapping scheme  250  can be run again for other faces detected in an image starting at block  253 . Otherwise, if less than two eyes are found, the mapping scheme  250  can re-scale the floating-point contrast map so that the mid point contrast of 127 now maps to end point contrast  255  at block  265  if a pre-determined number of iterations has not yet been performed as determined at block  286 . If the pre-determined number of iterations has been performed as determined at block  286 , another face box of the image is examined starting at block  253 . After a predefined number of iterations, the process can stop even if the red eye mapping scheme  250  does not find a red eye.  
         [0056]     After a red eye has been detected, the red eye effect can be removed.  FIG. 6  shows a flow chart of a red eye reduction process  300  according to an embodiment of the present invention. Specifically, once a red eye region has been located, such as by a mapping scheme  250 , as described above, the red eye reduction process  300  can calculate a centroid of the red eye pixels as a center of the red eye at block  303 . A radius of the red eye can be calculated from the number of red eye pixels found in the region at block  306 . For example, if the number of red eye pixels is N, the radius R is given by: R=square root of (N/π), where, π=3.14159. The color of pixels inside the radius R can be converted to another color, such as gray at block  309 . Red eye effect correction can be made for the identified region using any coloring technique at block  312  for pixels outside the radius and an extended radius, if desired.  FIG. 30  shows a finished image  186  with the red eye effect removed from the original image  160  ( FIG. 3A ).  
         [0057]      FIG. 7  shows a red eye reduction system  700  according to an embodiment of the present invention. The red eye reduction system  700  can include an image storage component  703  such as a memory, a disk, a buffer, and the like, that stores image data of an image. A skin tone identifier  706  can retrieve the image data from the connected image storage component  703  to identify image data having characteristics of skin pixels. For example, as described earlier, the image data can be compared with data in a skin tone database  709 . Although the storage component  703  and the skin tone database  709  are shown to be individual components, they can instead be part of a larger memory structure. Once pixels having characteristics of skin tone have been detected, a shape identifier  712  can be used to identify from the detected skin tone pixels an appropriate candidate shape, or a candidate face for further analysis. The shape identifier  712  can identify a shape that can include a red eye as described above with reference to  FIG. 4 . Once the shape has been identified, pixels of the identified shape can be fed to a mapping module  715 .  
         [0058]     In general, the mapping module  715  can map image attributes of the identified pixels to identify some facial components or features, such as an eye, a white portion of an eye, an iris of an eye, wrinkles, a nose, a pimple, a mouth, teeth in a mouth, and the like. The mapping module  715  can include a distance mapping module  718 , a contrast mapping module  721 , and/or a red eye mapping module  724 . The distance mapping module  718  can be configured to find a white portion of an eye. For example, for each shape, face box or other region identified, the distance mapping module  718  can generate a distance map  725 . In the distance map  725 , the distance mapping module  718  can store a color space distance from a neutral color for each pixel. For example, if a pixel has a high luminance value and is relatively close to a neutral color, the image data or the corresponding pixel can be considered white. In some embodiments, the color distance is determined by calculating the standard deviation between red, green and blue components of the pixel. Since distances found using the distance mapping module  718  can fall within a relatively narrow band, and can be generally difficult to distinguish from one another, a histogram equalizer  727  can be used to equalize or normalize the distances stored in the distance map  725 . Equalized or normalized distances can then be compared to a threshold comparator  730  with a predetermined high threshold. Thus, the distance map  725  can be transformed to a Boolean distance map carrying true or false values. For example, any pixel having a distance above a particular value can be considered white and made true in the Boolean distance map, while other pixels having distances less than the value can be labeled false. Comparing the luminance values of the pixels in a luminance comparator  733  can further reduce the distance map. For example, if the luminance of a pixel is less than a threshold value, the luminance comparator  733  can label the pixel as being not white. The corresponding distance in the distance map  725  can therefore be removed.  
         [0059]     The red eye mapping module  724  can include a red eye database  736  which can be generated as described earlier. At run time, for each pixel in face box or other region, the red eye mapping module  724  can determine whether the pixel is a red eye pixel. In some embodiments, true or false results are stored in a red eye map  737 . A few iterations or passes of erosion followed by dilation can also be performed on the red eye map  737  with an eroder  739  and a dilator  742 . The process of erosion followed by dilation can be used to open up small gaps between touching regions or groups. Thus, the red eye mapping module  724  can find connected regions, and/or can decide whether the connected regions belong to a red eye, such as by using a counter  745 . The counter  745  can include a shape pixel counter  751  and/or a red eye pixel counter  748 , which output a number pixels in the candidate face shape and a number of red eye pixels found in the shape, respectively. Unlikely candidates can be deleted from the red eye map  737  when the number of connected red eye pixels is greater than a pre-determined threshold, for example.  
         [0060]     The contrast mapping module  721  can include a gray scale dilator  754  and a gray scale eroder  757  to construct a floating-point contrast map  760  of the facial area created or generated previously (e.g., by a in shape identifier  712 ). Since values in the contrast map  760  can vary from face to face, the values can be scaled by a scaler  763 , such as between 0 and 255 for each face. Optionally, pixels can be skipped to speed up the mapping process.  
         [0061]     The red eye reduction system  700  can also include a red eye detector  766  coupled to the mapping module  715 . The red eye detector  766  can use the maps  725 ,  737 ,  760  generated in the mapping module  715  to determine if a red eye is present. By way of example only, the red eye detector  766  can start by making a Boolean contrast map  767  from the floating-point contrast map  760  in a contrast map converter  769 . If a floating-point contrast entry in the floating-point contrast map  760  is greater than a predetermined threshold, a corresponding entry in the Boolean contrast map  767  can be labeled true. Otherwise, the entry can be labeled false in the Boolean contrast map  767 . In some embodiments, the red eye reduction system  700  can then find if connected regions are present in the Boolean contrast map  767 . When the red eye reduction system  700  has located connected regions, sizes and shapes of the connected regions can be determined. Based at least in part on the shape and the size of the connected regions found, the red eye reduction system  700  can determine if the connected regions are a red eye candidate at a candidate comparator  768 . Unlikely candidates can be deleted.  
         [0062]     In some embodiments, for each candidate region, the red eye reduction system  700  looks at the red eye map  737  and the distance map  725 . If a candidacy comparator  768  determines a pixel value is the same in both the red eye map  737  and the distance map  725 , the connected region can be considered a red eye. If the red eye reduction system  700  finds two eyes for a face, the red eye reduction system  700  can stop automatically. Otherwise, the red eye reduction system  700  can re-scale the floating-point contrast map  760  and repeat the above-described process, making another Boolean contrast map. After a red eye is located, a red eye remover  770  can automatically remove the red eye effect from the image.  
         [0063]     Various features and advantages of the invention are set forth in the following claims.