# Patent

## Title
Method and apparatus for digital image manipulation to remove image blemishes

## Abstract

To better realize the great potential of amateur digital photography, the present invention introduces an intuitive system for digital manipulation. The system of the present invention allows a user to simply fix small blemishes in digital images. In one embodiment, the user merely places a cursor on the image blemish and activates a cursor control device such as a mouse button. In one embodiment, the blemish repair system is implemented using one of Dirichlet's theorems. The theorem provides a method of creating a smooth surface within a circle by using the values of points around the circle. To prevent the result from appearing too smooth, some pixelization may be added.

## Background
FIELD OF THE INVENTION
The present invention relates to the field of digital photography. In particular the present invention discloses a system for digital image processing.
BACKGROUND OF THE INVENTION
With improved technology and sharply reduced digital camera pricing, digital photography is rapidly replacing traditional film photography. With digital photography, there is no waiting for photographic film to be processed. Instead, most digital cameras allow the photographer to instantly review the digitally captured images. With this ability, the photographer may take another shot if he or she is not satisfied with the first digital images.
Digital photography has given amateur digital photographers new avenues of image distribution. Amateur digital photographs can easily be published on the world-wide web (WWW) to allow anyone on the Internet to view the digital photographs. Internet users can also email digital photographs as attachments or embedded within HTML formatted email messages.
One of the most powerful aspects of digital photography is ability to perform digital image manipulation. Digital image manipulation programs can be used to manipulate digital photographs in order to correct flaws, modify colors, etc. However, the potential of digital image manipulation by amateurs remains largely unrealized. The only image manipulation used by most amateur digital photographers is the rotation of digital images to correct the orientation of the image. Digital image manipulation largely remains the domain of experts since quality image manipulation software is often too expensive for the amateur photographer and too difficult to use for the casual user.
To better realize the great potential of amateur digital photography, it would be very desirable to have improved digital image manipulation tools that are available for amateur digital photography enthusiasts. These digital image manipulation tools should be highly intuitive yet provide powerful features for manipulating digital images.
SUMMARY OF THE INVENTION
To better realize the great potential of amateur digital photography, the present invention introduces an intuitive system for digital manipulation. The system of the present invention allows a user to simply fix small blemishes in digital images. In one embodiment, the user merely places a cursor on the image blemish and activates a cursor control device such as a mouse button.
In one embodiment, the blemish repair system is implemented using one of Dirichlet's theorems. The theorem provides a method of creating a smooth surface within a circle by using the values of points around the circle. To prevent the result from appearing too smooth, some pixelization may be added.
Other objects, features, and advantages of present invention will be apparent from the company drawings and from the following detailed description.



BRIEF DESCRIPTION OF THE DRAWINGS
The objects, features, and advantages of the present invention will be apparent to one skilled in the art in view of the following detailed description in which:
FIG. 1 illustrates a block diagram of a computer system that may be used to implement the present invention.
FIG. 2a illustrates one embodiment of an example graphical user interface for the blemish removal system of the present invention.
FIG. 2b illustrates the graphical user interface embodiment of FIG. 2a where the blemish removal system is being activated on an area of an image.
FIG. 2c illustrates the graphical user interface embodiment of FIG. 2b after the blemish has been removed from the image.
FIG. 2d illustrates a flow diagram of one embodiment of the present invention.
FIG. 3a illustrates an imaginary number plotted on a Cartesian coordinate system with the real number portion on the x-axis and the imaginary portion on the y-axis.
FIG. 3b illustrates a vector subtraction of a vector to a point in the unit circle from a vector to a point on the unit circle.
FIG. 3c illustrates a method of determining the magnitude of the difference vector of FIG. 3b. 
FIG. 4 conceptually illustrates iteration across all the pixels in a circle.
FIG. 5 conceptually illustrates iteration around the border pixels of a circle to generate the value of an inner pixel.
FIG. 6 illustrates a circle divided into octants.



DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT
A method and apparatus for the digital manipulation of images to removal blemishes is disclosed. In the following description, for purposes of explanation, specific nomenclature is set forth to provide a thorough understanding of the present invention. However, it will be apparent to one skilled in the art that these specific details are not required in order to practice the present invention. For example, the present invention has been described with reference to one of Dirichelt's Theorems. However, the system of the present invention may use other types of function interpolation methods.
Digital Image Blemishes
Digital photography is rapidly replacing traditional film photography. One of the most powerful aspects of digital photography is ability to perform image manipulation upon captured digital images. Digital image manipulation programs can be used to manipulate digital photographs in order to correct image flaws, modify image colors, and perform other image corrections. Most image manipulation can be performed on a typical personal computer system such as the iMac personal computers from Apple Computer, Inc. of Cupertino, Calif.
Image Processing Computer System
FIG. 1 illustrates an exemplary embodiment of a computer system 100 that may be used to implement the teachings of the present invention. Computer system 100 may be a typical personal computer system with a processor 110, a memory 120, and a bus controller 130 for controlling a system bus 135. Various different Input/Output devices may be coupled to the system bus 135 to allow the computer system 100 to interact with the outside world. For example, computer system 100 includes the input/output devices of a hard disk drive (HDD) 169, a display device 161 (such as a CRT or flat panel display), a keyboard 151, a cursor control device 153 (such as a computer mouse, track pad, or trackball), a fixed media drive 180, and network interface 191 for coupling to a network such as local area network (LAN) 195.
The image manipulation system 125 of the present invention resides in the memory 120 of computer system 100 as a set of computer instructions. The image manipulation system may also reside as a program on a fixed media device 181 such as Compact Disc Read-Only-Memory (CD-ROM) or Digital Versatile Disc Read-Only-Memory (DVD-ROM). The fixed media device is used with an associated fixed media drive 180 such as a CD-ROM drive or DVD-ROM drive, respectively. Alternatively, the image manipulation system 125 may be downloaded from across a network such as the global Internet 199 accessible through network interface 191.
The first task of the image blemish removal system of the present invention is to acquire digital images to process. Referring to FIG. 1, the acquired images are normally stored onto a mass storage device such as hard disk drive (HDD) 169. In one embodiment of the present invention, the image manipulation system 125 may acquire digital images from a number of different sources.
To acquire images, the system of the present invention may include driver software necessary to automatically identify and interoperate with several different types of digital cameras that may be coupled to the host computer system. For example, FIG. 1 illustrates a digital camera system 147 coupled to serial bus 145 controlled by serial bus interface 140 of the computer system 100. Serial bus 145 may be an IEEE 1394 Firewire serial bus, a Universal Serial Bus (USB), or any other type of serial bus. In a preferred embodiment, the system is able to automatically recognize when digital camera system 147 is coupled to computer system 100 such that the digital images in digital camera system 147 can be acquired.
The system can also acquire images in a number of other manners. For example, film photographs may be placed onto a floppy disc (not shown) or onto a fixed media device 181 by a film developer at the request of the film photographer. Such photos may be acquire by image manipulation system 125 by having the user place the floppy disc (not shown) or the fixed media device 181 into the appropriate drive such as floppy disc drive (not show) or the fixed media drive 180.
Digital images may also be obtained through a computer network interface 191 of computer system 100. For example, a user may obtain digital images from a World Wide Web (WWW) site on the global Internet 199. Digital images may also be obtained using a digital scanner (not shown) coupled to computer system 100 as is well known in the art.
To repair a blemish in a digital image, some embodiments provide a method illustrated in FIG. 2d. This process (1) identifies (at 250) a circle that surrounds the blemish, (2) interpolates (at 252) a smooth function defined by a first set of pixels that define a border of the circle, (3) fills (at 254) the circle with a second set of pixels created by the function, and (4) reduces (at 256) the smoothness of the set of pixels by causing pixelization that is a function of a brightness variance around the circle.
Image Blemishes
Captured digital images do not always appear the way we would like the digital images to appear. For example, acne appearing at an inopportune time can mar the digital image captured of a teen-ager on his Senior Prom. An airplane in the corner sky may disturb any otherwise perfect digital image of a beautiful sunset in a nature setting. A particle of dust on the Charge Coupled Device (CCD) sensor of a digital camera, or on its lens, may result in a black spot on every image. Such small undesirable flaws in a digital image are referred to as ‘blemishes.’
Film photographs tend to be even more susceptible to having image blemishes. The source film may become scratched causing a white line or white dot to appear on a photograph. Hair or dust may be present on a film lens or during the scan of a traditional film-based photograph used to bring the photograph into the digital domain. These blemishes distract the viewer from completely enjoying the image.
It would therefore be desirable to provide users with a blemish removal tool for repairing such image blemishes. Ideally, the blemish removal solution should be simple and intuitive such that any computer user could easily use the blemish removal tool.
Blemish Removal Overview
The present invention introduces a simple and intuitive blemish removal tool that may be used to remove unsightly blemishes from digital images. For example, FIG. 2a illustrates one embodiment of an example graphical user interface for the blemish removal system of the present invention. In FIG. 2a, an image window 210 contains an image of a house to use for a real estate listing web site. Unfortunately, a child left his Frisbee 230 in the yard thus disturbing the perfect image of the house. In order to remove the blemish (the Frisbee), a user may select the blemish removal tool by clicking on button 220.
FIG. 2b illustrates the graphical user interface embodiment of FIG. 2a after the user has clicked on the blemish removal button 220. The system then displays a small circle 240 on the image that may be moved using a cursor control device such as a mouse. In one embodiment, the size of circle 240 is determined as a function of the size of the overall image. One specific embodiment sets the radius of small circle as:




  
    
      
        radius
        =
        
          
            
              width
              *
              height
            
          
          125
        
      
    
    
      
        (
        1
        )
      
    
  




In another embodiment, the user is allowed to determine the size of circle 240. However, the blemish removal tool will work best with small circles.

Referring again to FIG. 2b, the user places circle 240 such that it surrounds the blemish. After the user has placed circle 240 on the blemish, the user simply requests the user to repair the blemish. The request may be indicated by activating a switch on a cursor control device such as a mouse button. FIG. 2c illustrates the graphical user interface embodiment of FIG. 2b after the blemish has been repaired. In one embodiment, the user is given the option of creating completely new pixels for the blemish area or creating a blend of the existing pixels and new pixels.
Blemish Removal Embodiment Details
A number of different methods of performing the blemish removal may be used to implement the invention. In one embodiment, one of Dirichiet's Theorems in the imaginary number domain is used to perform blemish removal. The use of the Dirichlet Theorem allows the blemish repair tool to calculate the only unwrinkled surface that fits exactly into the existing photo at the edges of a circle around the blemish point.
The Math
The Dirichlet Theorem in the imaginary number domain used by the present invention is expressed as follows:




  
    
      
        
          U
          ⁡
          
            (
            Z
            )
          
        
        =
        
          
            1
            
              2
              ⁢
              
                
              
              ⁢
              π
            
          
          ⁢
          
            
              ∫
              0
              
                2
                ⁢
                π
              
            
            ⁢
            
              
                f
                ⁡
                
                  (
                  
                    e
                    
                      i
                      ⁢
                      
                        
                      
                      ⁢
                      θ
                    
                  
                  )
                
              
              ⁢
              
                
                  1
                  -
                  
                    
                      
                      Z
                      
                    
                    2
                  
                
                
                  
                  
                    Z
                    -
                    
                      e
                      
                        i
                        ⁢
                        
                          
                        
                        ⁢
                        θ
                      
                    
                  
                  
                
              
              ⁢
              
                
              
              ⁢
              
                d
                θ
              
            
          
        
      
    
    
      
        (
        2
        )
      
    
  




where Z is an imaginary number that can be expressed in the form of:

Z=x+yi  (3)

Imaginary numbers are commonly plotted on a Cartesian coordinate system with the real number portion on the x-axis and the imaginary portion on the y-axis as illustrated in FIG. 3a. The absolute value of an imaginary number is the length of the imaginary vector x+yi. Specifically:

|Z|=|x+yi|=√{square root over (x2+y2)}  (4)

The Dirichlet Theorem of equation (2) generates a smooth two-dimensional function for all the area enclosed within a unit circle on the real/imaginary plane since:

eiθ=cos θ+i(sin θ)  (5)

Equation (2) operates by computing a value for internal pixel (Z) as a function of all the vales of pixels around the unit circle (f (eiθ)). Substituting equations (3), (4), and (5) into equation (2) yields:





  
    
      
        
          U
          ⁡
          
            (
            
              x
              +
              
                y
                ⁢
                
                  
                
                ⁢
                i
              
            
            )
          
        
        =
        
          
            1
            
              2
              ⁢
              
                
              
              ⁢
              π
            
          
          ⁢
          
            
              ∫
              0
              
                2
                ⁢
                
                  
                
                ⁢
                π
              
            
            ⁢
            
              
                f
                ⁡
                
                  (
                  
                    
                      cos
                      ⁢
                      
                        
                      
                      ⁢
                      θ
                    
                    +
                    
                      i
                      ⁡
                      
                        (
                        
                          sin
                          ⁢
                          
                            
                          
                          ⁢
                          θ
                        
                        )
                      
                    
                  
                  )
                
              
              ⁢
              
                
                  1
                  -
                  
                    (
                    
                      
                        x
                        2
                      
                      +
                      
                        y
                        2
                      
                    
                    )
                  
                
                
                  
                    
                    
                      x
                      +
                      
                        y
                        ⁢
                        
                          
                        
                        ⁢
                        i
                      
                      -
                      
                        cos
                        ⁢
                        
                          
                        
                        ⁢
                        θ
                      
                      -
                      
                        
                          (
                          
                            sin
                            ⁢
                            
                              
                            
                            ⁢
                            θ
                          
                          )
                        
                        ⁢
                        i
                      
                    
                    
                  
                  2
                
              
              ⁢
              
                
              
              ⁢
              
                d
                θ
              
            
          
        
      
    
    
      
        (
        6
        )
      
    
  




The denominator contains the vector subtraction x+yi−cos θ−(sin θ)i which is subtracting the vector of the x+yi position (x, y) being analyzed from the current vector on the unit circle (x0, y0). This vector subtraction is illustrated in FIG. 3b. However, as seen in equation (6), the absolute value of the difference vector is desired. The absolute value of the difference vector can be determined with the Pythagorean Theorem as illustrated in FIG. 3c. Thus, equation (6) can be simplified to:





  
    
      
        
          U
          ⁡
          
            (
            
              x
              +
              
                y
                ⁢
                
                  
                
                ⁢
                i
              
            
            )
          
        
        =
        
          
            1
            
              2
              ⁢
              
                
              
              ⁢
              π
            
          
          ⁢
          
            
              ∫
              0
              
                2
                ⁢
                
                  
                
                ⁢
                π
              
            
            ⁢
            
              
                f
                ⁡
                
                  (
                  
                    
                      x
                      0
                    
                    ,
                    
                      y
                      0
                    
                  
                  )
                
              
              ⁢
              
                
                  1
                  -
                  
                    (
                    
                      
                        x
                        2
                      
                      +
                      
                        y
                        2
                      
                    
                    )
                  
                
                
                  
                    
                      (
                      
                        x
                        -
                        
                          x
                          0
                        
                      
                      )
                    
                    2
                  
                  +
                  
                    
                      (
                      
                        y
                        -
                        
                          y
                          0
                        
                      
                      )
                    
                    2
                  
                
              
              ⁢
              
                
              
              ⁢
              
                d
                θ
              
            
          
        
      
    
    
      
        (
        7
        )
      
    
  




Equation (6) serves as the basis for one embodiment of the blemish removal tool of the present invention.

An Implementation

Every pixel in the circle surrounding the blemish may be fixed by using equation (7) on every pixel within the blemish circle. This may be performed by iterating across a square and fixing every point within the circle in the square as illustrated in FIG. 4. Specifically, the following code can fix every pixel within radius r2 of the center of the blemish defined by point xcenter, ycenter:













For (i = −r2; i <= r2; i++)
// Iterate across the rows (x)









{










for (j = −r2; j <= r2; j++)
// Iterate down the column (y)









{









if (i*i + j*j >= r2*r2) continue; // If not in circle, then move



to next pixel in square.









fixpixel(imageBuffer, xcenter+i, ycenter+j);









}









}










Equation (7) can be implemented with a discrete integral that integrates around a circle of pixels that surround a blemish as conceptually illustrated by FIG. 5. The information from all the pixels around the circle edge affects the value of each pixel within the circle. The following code implements a method of determining the red, green, and blue values for a replacement pixel within the blemish area.












// x1 = Current x value inside normalized unit circle


// y1 = Current y value inside normalized unit circle


rsum = gsum = bsum = 0.0; // Start with zero


angleIncrement = 1.183 /((float) r1); // Determine angle increment as


function of radius


//Determine # of points around circle as 2*Pi/angle + 1


nCirclePoints = floor(1+ (2*3.14159265358979)/angleIncrement);


k = 0;   // Create sin & cos look-up table for efficiency


for (theta = 0; theta < 2* 3.14159265358979; theta += angleIncrement)









{









cosTheta[k  ] = cos(theta);



sinTheta[k++] = sin(theta);









}







// Determine Final increment to complete the circle


finalIncrement = 2*3.14159265358979 = theta + angleIncrement;








zmodsq = x1*x1 + y1*y1;
// Squared(|Z|) = x1*x1 + y1*y1


npts = 0;


for (k = 0; k < nCirclePoints; k++)
//Iterate around the blemish border.









{









npts++;



x2 = cosTheta[k]; // x value of current point on normalized unit



circle



y2 = sinTheta[k]; // Y value of current point on normalized unit



circle










xdelta = floor(r1*x2 + 0.5);
// x value of pixel on circle outside




blemish



ydelta = floor(r1*y2 + 0.5);
// y value of pixel on circle outside




blemish









// Calculate address of the pixel on the blemish border



borderpix = imageBuffer + (ycenter + ydelta)*rowBytes +



(xcenter+xdelta)*bytesPerPixel;










r = (float) borderpix[1];
// Grab red value of border pixel



g = (float) borderpix[2];
// Grab Green value of border pixel



b = (float) borderpix[3];
// Grab blue value of border pixel









if (k < nCirclePoints − 1) // Last circle border pixel?









{









rsum += r* (1 − zmodsq) / ((x1−x2)*(x1−x2) +



(y1−y2)*(y1−y2));



gsum += g* (1 − zmodsq) / ((x1−x2)*(x1−x2) +



(y1−y2)*(y1−y2));



bsum += b* (1 − zmodsq) / ((x1−x2)*(x1−x2) +



(y1−y2)*(y1−y2));









}









else









{









rsum += finalIncrement/angleIncrement* r* (1−zmodsq) /



((x1−x2)*(x1−x2)+(y1−y2)*(y1−y2));



gsum += finalIncrement/angleIncrement* g* (1−zmodsq) /



((x1−x2)*(x1−x2)+(y1−y2)*(y1−y2));



bsum += finalIncrement/angleIncrement* b* (1−zmodsq) /



((x1−x2)*(x1−x2)+(y1−y2)*(y1−y2));









}









}







rfinal = rsum/(npts−1.0 + finalIncrement/angleIncrement); // Div by # of


pnts−the 1/2*Pi div


qfinal = gsum/(npts−1.0 + finalIncrement/angleIncrement); // Div by # of


pnts−the 1/2*Pi div


bfinal = bsum/(npts−1.0 + finalIncrement/angleIncrement); // Div by # of


pnts−the 1/2*Pi div









where image buffer contains the image, r1 is the radius of the pixel circle around the blemish, xcenter is the x value of center of the blemish, y is the y value of center of the blemish, and x1 & y1 define the point in the unit circle being fixed.

Blemish Repair Tweaks
The blemish removal system described in the previous section will provide a perfectly smooth replacement for the area within the blemish circle. However, a perfectly smooth replacement may appear too perfect. Thus, some pixelization may be created to prevent the repair from appearing unnaturally smooth. The pixelization may be added equally to the red, blue, and green components in order to prevent undesirable color changes.
One embodiment operates by first dividing the blemish border into octants as illustrated by FIG. 6. Next, a brightness average and variance for each octant is calculated. The brightness variance and average of the octants are sorted by the amount of variance and the picks the second highest amount of variance is selected to replicate in the blemish repair area.
To further blend the blemish repair into the existing image, the blemish repair tool may generate Gaussian noise, the statistical type found in general in digital photos, to modulate the smoothed surface with the computed Gaussian noise. The modulation with Gaussian noise achieves a pixelization that blends with the existing photo.
The following code segments the circle around the blemish into eight octants, calculates the mean and variance in brightness in each of those segments, sorts them, chooses an appropriate variance level, and generates a matching Gaussian noise:












brightnessaccum = brightnessSquaredAccum = 0.0;  //clear accumulators


octant = previousoctant = 0;


for (k = 0; k < nCirclePoints; k++ ) { //Iterate around the blemish border.










x2 = cosTheta[k];
// x value of current point on normalized unit




circle



y2 = sinTheta[k];
// y value of current point on normalized unit




circle










xdelta = floor (r1*x2 + 0.5);
// x value of pixel on circle outside




blemish



ydelta = floor (r1*y2 + 0.5);
// y value of pixel on circle outside




blemish









// Calculate address of the pixel on the blemish border & grab it



pix = imageBuffer + (ycenter+ydelta)*BytesPerRow +



(xcenter+xdelta)*bytesPerPixel;



r = (float) pix[1]; // Grab red value of border pixel



g = (float) pix[2]; // Grab Green value of border pixel



b = (float) pix[3]; // Grab blue value of border pixel










brightness r+g+b;
// Determine brightness of




borderpixel



octant = k/(nCirclePoints/8);
// Determine what octant we are in



if (octant > previousOctant) {









//calculate average brightness



avg[previousOctant] = (float) brightnessaccum/



(nCirclepPoints/8);



// Calculate variance for previous octant



var[previousOctant] = brightnessSquaredAccum/









(nCirclePoints/8) −



avg[previousOctant]*avg[previousOctant];









previousOctant = octant;



brightnessaccum = 0.0;    //Clear accumulators



brightnessSquaredAccum = 0.0;









}



brightnessaccum += (double) brightness;



brightnessSquaredAccum += (double) brightness*brightness;







}


//Sort array of mean and variance values for octants around reference


// circle from high variance to low variance.


for (m = 0; m < 7; m++) {









for (n = 0; n < 7−m; n++) {









if (var[n+1] < var[n]) { //swap values if lower









var1 = var[n]; var[n] = var[n+1]; var[n+1] = var1;



avg1 = avg[n]; avg[n] = avg[n+1]; avg[n+1] = avg1;









}









}







}








mean = (avg[5] + avg[6] + avg[7])/3.0;
//Array now sorted by size



of variance.


variance = var[1];
// Choose second highest



variance







rNoise = sqrt(−2.0 * variance * log(1.0 − (float) rand( )/((double)


RAND_MAX + 0.1)));


theta2 = (float) 2 * 3.14159265 * rand( )/((double) RAND_MAX + 0.1)


−3.14159265;


pointgain = (mean + rNoise*cos(theta2))/mean;









// Generate gain, which has Gaussian



//distribution, for specific pixel







//Some adjustments


if (pointgain < (mean − 1.8*sqrt(variance))/mean)


pointgain=(mean − 1.8*sqrt(variance))/mean;


if (pointgain > (mean + 2.4*sqrt(variance))/mean)


pointgain=(mean + 2.4*sqrt(variance))/mean;


// Adjust the brightness of the pixel color components


rfinal = pointgain * rpixel; gfinal = pointgain * gpixel; bfinal =


pointgain * bpixel;









The above code to cause the pixelization may be combined with the code to perform the pixel repair for a more efficient solution. Specifically, the brightness calculation only needs to be performed once.

The foregoing has described a method and apparatus for the digital manipulation of images to removal blemishes. It is contemplated that changes and modifications may be made by one of ordinary skill in the art, to the materials and arrangements of elements of the present invention without departing from the scope of the invention.

## Claims

1. A method of repairing a blemish in a digital image, said method comprising:
identifying a circle about said blemish;
interpolating a smooth function defined by a first set of pixels that define a border of said circle around said blemish;
filling said circle with a second set of pixels created by said function;
reducing a smoothness of the second set of pixels within said circle; and
causing pixelization in said circle to reduce said smoothness, wherein said pixelization is a function of a brightness variance around said circle.

2. The method as claimed in claim 1 wherein interpolating a smooth function is performed using Dirichlet's Theorem.

3. The method as claimed in claim 1 wherein said pixelization includes Gaussian noise.

4. The method as claimed in claim 1 wherein interpolating a smooth function is performed by performing a discrete integral around said circle.

5. A method of repairing a blemish in a digital image, said method comprising:
identifying a circle about said blemish;
interpolating a smooth function defined by a first set of pixels that define a border of said circle around said blemish;
filling said circle with a second set of pixels created by said function; and
reducing a smoothness of the second set of pixels within said circle, wherein a radius of said circle is a function of a size of said digital image.

6. A method of repairing a blemish in a digital image, the method comprising:
activating a blemish removal control to display a blemish removal tool;
moving said blemish removal tool to identify a circle with the blemish;
performing a cursor control operation with said blemish removal tool to automatically remove a blemish; and
causing pixelization in said circle to reduce a smoothness, wherein said pixelization is a function of a brightness variance around said circle.

7. The method of claim 6, wherein the blemish removal tool comprises a visible boundary of a circle.

8. The method of claim 7, wherein identifying said circle comprises surrounding the blemish with said visible boundary of the circle.

9. The method of claim 6, wherein identifying the circle and automatically removing the blemish comprises a cursor control operation of the blemish removal tool.

10. The method of claim 6, wherein a cursor control device operates on the blemish removal tool.

11. The method of claim 6, wherein the cursor control operation is a click.

12. A computer readable medium comprising a computer program for repairing a blemish in a digital image said computer program comprising sets of instructions for:
identifying a circle about said blemish, wherein a radius of said circle is a function of a size of said digital image;
interpolating a smooth function defined by a first set of pixels that define a border of said circle around said blemish;
filling said circle with a second set of pixels created by said function; and
reducing a smoothness of the second set of pixels within said circle.

13. The computer readable medium as claimed in claim 12 wherein said instructions for interpolating a smooth function comprise instructions for using Dirichlet's Theorem.

14. The computer readable medium claimed in claim 12, said computer program further comprising a set of instructions for:
causing pixelization in said circle to reduce said smoothness.

15. The computer readable medium as claimed in claim 14 wherein said pixelization comprises Gaussian noise.

16. The computer readable medium as claimed in claim 12 wherein said set of instructions for interpolating a smooth function comprises instructions for performing a discrete integral around said circle.

17. The computer readable medium of claim 12, wherein said set of instructions for reducing a smoothness comprises instructions for adding Gaussian noise.

18. A computer readable medium comprising a computer program for repairing a blemish in a digital image, said computer program comprising sets of instructions for:
identifying a circle about said blemish;
interpolating a smooth function defined by a first set of pixels that define a border of said circle around said blemish;
filling said circle with a second set of pixels created by said function;
reducing a smoothness of the second set of pixels within said circle; and
causing pixelization in said circle to reduce said smoothness, wherein said pixelization is a function of a brightness variance around said circle.

19. A graphical user interface (“GUI”) for an application, the GUI comprising:
a display area for displaying an image;
a blemish removal tool; and
a blemish removal control for causing the GUI to display the blemish removal tool, wherein the blemish removal tool is for identifying a circle with a blemish in the image and for activating to cause the automated removal of a blemish from the image, wherein a radius of said circle is a function of a size of said image.

20. The GUI of claim 19, wherein the blemish removal tool is movable using a cursor control device.

21. The GUI of claim 19, wherein the blemish removal tool activates through an operation of the cursor control device.

22. The GUI of claim 19, wherein the automated removal of the blemish is achieved by filling in a selected circle with pixels based on the pixels around the selected circle.

23. The GUI of claim 22, wherein the automated removal of the blemish is further achieved by adding noise to the selected circle.

24. The GUI of claim 23, wherein the noise is Gaussian noise.

25. The GUI of claim 19, wherein the blemish removal tool for identifying the circle is movable to surround the circle.

26. The GUI of claim 25, wherein the blemish removal tool is activated by a switch on the cursor control device.

27. The GUI of claim 19, wherein the blemish removal tool acts as a cursor, moves via a cursor control device movement action, and activates by a cursor control device click.