Patent Grant
8682097
This application claims priority to U.S. provisional patent application 60/945,558, filed Jun. 21, 2007.
This application also is a CIP of U.S. patent application Ser. No. 11/674,650, filed Feb. 13, 2007, now U.S. Pat. No. 7,702,236; which claims priority to U.S. provisional patent application Ser. No. 60/773,714, filed Feb. 14, 2006.
This application also is a CIP of U.S. Ser. No. 11/836,744, filed Aug. 9, 2007, which claims priority to U.S. provisional patent application Ser. No. 60/821,956, filed Aug. 9, 2006.
This application is related to U.S. patent application Ser. No. 11/573,713, filed Feb. 14, 2007, now U.S. Pat. No. 7,868,922; which claims priority to U.S. provisional patent application No. 60/773,714, filed Feb. 14, 2006, and to PCT application no. PCT/EP2006/008229, filed Aug. 15, 2006, published as WO 2007/093199.
This application also is related to Ser. No. 11/024,046, filed Dec. 27, 2004, now U.S. Pat. No. 7,565,030; which is a CIP of U.S. patent application Ser. No. 10/608,772, filed Jun. 26, 2003, now U.S. Pat. No. 7,440,593.
This application also is related to PCT/US2006/021393, filed Jun. 2, 2006, published as WO 2007/142621; which is a CIP of Ser. No. 10/608,784, filed Jun. 26, 2003.
This application also is related to U.S. application Ser. No. 10/985,657, filed Nov. 10, 2004, now U.S. Pat. No. 7,636,486.
This application also is related to U.S. application Ser. No. 11/462,035, filed Aug. 2, 2006, now U.S. Pat. No. 7,920,723; which is a CIP of U.S. application Ser. No. 11/282,954, filed Nov. 18, 2005, now U.S. Pat. No. 7,689,009.
This application also is related to Ser. No. 11/233,513, filed Sep. 21, 2005, now U.S. Pat. No. 7,587,085; which is a CIP of U.S. application Ser. No. 11/182,718, filed Jul. 15, 2005, now Abandoned; which is a CIP of U.S. application Ser. No. 11/123,971, filed May 6, 2005, now U.S. Pat. No. 7,436,998; and which is a CIP of U.S. application Ser. No. 10/976,336, filed Oct. 28, 2004, now U.S. Pat. No. 7,536,036.
This application also is related to U.S. patent application Ser. No. 11/460,218, filed Jul. 26, 2006, now U.S. Pat. No. 7,792,335; which claims priority to U.S. provisional patent application Ser. No. 60/776,338, filed Feb. 24, 2006.
This application also is related to U.S. patent application Ser. No. 12/063,089, filed Feb. 6, 2008, now U.S. Pat. No. 8,055,029; which is a CIP of U.S. Ser. No. 11/766,674, filed Jun. 21, 2007, now U.S. Pat. No. 7,460,695; which is a CIP of U.S. Ser. No. 11/753,397, now U.S. Pat. No. 7,403,643; which is a CIP of U.S. Ser. No. 11/765,212, filed Aug. 11, 2006, now U.S. Pat. No. 7,315,631.
This application is related to a family of applications filed contemporaneously by the same inventors, including an application entitled DIGITAL IMAGE ENHANCEMENT WITH REFERENCE IMAGES, Ser. No. 12/140,048; and another entitled METHOD OF GATHERING VISUAL META DATA USING A REFERENCE IMAGE, Ser. No. 12/140,125; and another entitled IMAGE CAPTURE DEVICE WITH CONTEMPORANEOUS REFERENCE IMAGE CAPTURE MECHANISM, Ser. No. 12/140,532; and another entitled FOREGROUND/BACKGROUND SEPARATION USING REFERENCE IMAGES, Ser. No. 12/140,827; and another entitled MODIFICATION OF POST-VIEWING PARAMETERS FOR DIGITAL IMAGES USING IMAGE REGION OR FEATURE INFORMATION, Ser. No. 12/140,950; and another entitled REAL-TIME FACE TRACKING WITH REFERENCE IMAGES, Ser. No. 12/141,042, now U.S. Pat. No. 7,620,218; and another entitled METHOD AND APPARATUS FOR RED-EYE DETECTION USING PREVIEW OR OTHER REFERENCE IMAGES, Ser. No. 12/142,134.
The invention relates to enhancement of digital image processing in a portable image capture device by use supplementary meta data from reference images.
It is recognized in the present invention that reference images of various types can be used advantageously in processing and enhancing digital images, particularly when efficiency is desired and/or when various defects tend to be present in the images as originally-acquired. In some cases, existing techniques can be improved and in other cases, new techniques are made available.
For some applications the ability to provide foreground/background separation in an image is useful. In US published application 2006/0039690, separation based on an analysis of a flash and non-flash version of an image is discussed. However, there are situations where flash and non-flash versions of an image may not provide sufficient discrimination, e.g. in bright sunlight.
Depth from de-focus is an image processing technique which creates a depth map from two or more images with different focal lengths. A summary of this technique can be found at: http://homepages.inf.ed.ac.uk/rbf/CVonline/LOCAL_COPIES/FAVARO1/dfdtutori al.html. Favaro is based on a statistical analysis of radiance of two or more images—each out of focus—to determine depth of features in an image. Favaro is based on knowing that blurring of a pixel corresponds with a given Gaussian convolution kernel and so applying an inverse convolution indicates the extent of defocus of a pixel and this in turn can be used to construct a depth map. Favaro involves a dedicated approach to depth calculation once images have been acquired in that a separate radiance map is created for each image used in depth calculations. This represents a substantial additional processing overhead compared to the existing image acquisition process.
US published application 2003/0052991 discloses for each of a series of images taken at different focus settings, building a contrast map for each pixel based on a product of the difference in pixel brightness surrounding a pixel. The greater the product of brightness differences, the more likely a pixel is considered to be in focus. The image with the greatest contrast levels for a pixel is taken to indicate the distance of the pixel from the viewfinder. This enables the camera to build a depth map for a scene. The camera application then implements a simulated fill flash based on the distance information. Here, the contrast map is specifically built representing substantial additional processing overhead over the existing image acquisition process.
US published application 2004/0076335 to Epson describes a method for low depth of field image segmentation. The Epson technique involves some knowledge that sharply focused regions contain high frequency components. US published application 2003/0219172 to Philips discloses calculating the sharpness of a single image according to the Kurtosis (shape of distribution) of its Discrete Cosine Transform (DCT) coefficients. US published application 2004/0120598 to Xiao-Fan Feng discloses using DCT blocks of a single image to detect blur within the image. The Epson, Philips and Feng techniques each involve an analysis of only a single image, and do not provide reliable distinctions between foreground and background regions of an image. US published application 2003/0091225 describes a creation of a depth map from two “stereo” images. It is desired to have an improved method of distinguishing between foreground and background regions of a digital image.
Even though human beings have little trouble interpreting images semantically, the challenge to do so using artificial intelligence is not that straight forward. A few methods are available to those familiar in the art of image and pattern recognition that separate images using a learning-based descriptor space. Such methods involve a training set and maximization methods of likelihood. Examples of such methods includes the Adatron (1989) method as described by Analauf et. al. (see citation below). Other work includes scene analysis such as the work by Le Saux Bertrand et al. (2004), citation below.
Face tracking in digital image acquisition devices may be described as involving the marking or identification of human faces in a series of images such as a video stream or a camera preview. Face tracking can be used to indicate to a photographer the locations of faces in an image, thereby improving acquisition parameters, or for allowing post processing of the images based on some knowledge of the locations of the faces.
In general, a face tracking system may employ two principle modules: (i) a face detection module for locating of new candidate face regions in an acquired image or a sequence of images; and (ii) a face tracking module for confirming face regions.
A fast-face detection algorithm is disclosed in US published application 2002/0102024 to Viola-Jones. In brief, Viola-Jones involves deriving an integral image from an acquired image, which is usually an image frame in a video stream. Each element of the integral image is calculated as the sum of intensities of all points above and to the left of the point in the image. The total intensity of any sub-window in an image can then be derived by subtracting an integral image value for the top left point of the sub-window from the integral image value for the bottom right point of the sub-window. Intensities for adjacent sub-windows are compared using particular combinations of integral image values from points of the sub-windows.
According to Viola-Jones, a chain (cascade) of 32 classifiers based on rectangular (and increasingly refined) Haar features may be used with the integral image by applying the classifiers to a sub-window within the integral image. For a complete analysis of an acquired image, this sub-window is shifted incrementally across the integral image until the entire image has been covered.
In addition to moving the sub-window across the entire integral image, the sub window is also be scaled up or down to cover a range of face sizes. In Viola-Jones, a scaling factor of 1.25 is used and typically, a range of about 10-12 different scales is used to cover possible face sizes in an XVGA size image.
The resolution of the integral image may be determined by the smallest sized classifier sub-window, i.e. the smallest size face to be detected, as larger sized sub-windows can use intermediate points within the integral image for their calculations.
There are a number of variants of the original Viola-Jones algorithm described in the literature. These generally employ rectangular, Haar feature classifiers and use the integral image techniques of Viola-Jones.
Even though Viola-Jones is significantly faster than other face detectors, it still involves significant computation, e.g., on a Pentium-class computer. In a resource-restricted embedded system, such as hand-held image acquisition devices, (e.g., including digital cameras, hand-held computers or cellular phones equipped with a cameras), it is not generally practical to run such a computationally-intensive face detector at real-time frame rates for video. From tests within a typical digital camera, it is only possible to achieve complete coverage of all 10-12 sub-window scales with a 3-4 classifier cascade. This allows some level of initial face detection to be achieved, but with undesirably high false positive rates.
Viola and Jones in their paper entitled “Robust Real Time Object Detection” as presented in the 2nd international workshop on Statistical and Computational theories of Vision, in Vancouver, Canada, Jul. 31st, 2001, describe a visual object detection framework that is capable of processing images extremely rapidly while achieving high detection rates. The paper demonstrates a framework for the task of face detection. The described technique is based on a learning algorithm where a small number of critical visual features yield a set of classifiers.
In US published application 2005/0147278 by Rui et al., a system is described for automatic detection and tracking of multiple individuals using multiple cues. Rui et al. disclose using Viola-Jones as a fast face detector. However, in order to avoid the processing overhead of Viola-Jones, Rui et al. instead disclose using an auto-initialization module which uses a combination of motion, audio and fast face detection to detect new faces in the frame of a video sequence. The remainder of the system employs well-known face tracking methods to follow existing or newly discovered candidate face regions from frame to frame. It is also noted that the Rui et al. technique involves some video frames being dropped in order to run a complete face detection process.
Yang et al., in IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 24, No. 1, pages 34-58 (January 2002), have provided a useful and comprehensive review of face detection techniques. These authors discuss various methods of face detection which may be divided into four main categories: (i) knowledge-based methods; (ii) feature-invariant approaches, including the identification of facial features, texture and skin color; (iii) template matching methods, both fixed and deformable and (iv) appearance-based methods, including eigenface techniques, statistical distribution-based methods and neural network approaches. They also discuss a number of main applications for face detection technology. It is recognized in the present invention that none of these references describe detection and knowledge of faces in images to create and/or use tools for the enhancement and/or correction of images in accordance with the present invention and the several preferred and alternative embodiment set forth below, and particularly to using reference images, such as preview or postview images these enhancements and/or corrections.
Baluja in 1997 (see citations below) described methods of extending upright, frontal templates based on a face detection system to efficiently handle in-plane rotations, thus achieving a rotation invariant face detection system.
It is recognized that human faces are perhaps the most photographed subject matter for the amateur and professional photographer. Thus it is possible to assume a high starting percentage for algorithms based on the existence of faces in them.
The camera is usually held horizontally or vertically, counter-clockwise or clockwise in relation to the horizontal position when the picture is taken, creating what is referred to as landscape mode or portrait mode, respectively. Thus most images are taken in either one of the three orientations, namely landscape, clockwise portrait and counter-clockwise portrait. When viewing images, it is preferable to determine ahead of time the orientation of the camera at acquisition, thus eliminating a step of rotating the image and automatically orienting the image. The system may try to determine if the image was shot horizontally, which is also referred to as landscape format, where the width is larger than the height of an image, or vertically, also referred to as portrait mode, where the height of the image is larger than the width.
Techniques may be used to determine an orientation of an image. Primarily these techniques include either recording the camera orientation at an acquisition time using an in-camera mechanical indicator or attempting to analyze image content post-acquisition. In-camera methods, although providing precision, use additional hardware and sometimes movable hardware components which can increase the price of the camera and add a potential maintenance challenge. However, post-acquisition analysis may not generally provide sufficient precision. Knowledge of location, size and orientation of faces in a photograph, a computerized system can offer powerful automatic tools to enhance and correct such images or to provide options for enhancing and correcting images.
The human visual system is very sensitive to the orientation of faces. As a matter of fact, the way the human mind stores faces is different for upright and inverted faces, as described in Endo in 1982 (see citation below). In particular, recognition of inverted faces is known to be a difficult perceptual task. While the human visual system performs well in recognizing different faces, performing the same task with inverted faces is significantly worse. Such results were illustrated for example by Moses in 1994 (see citation below), where face memory and face recognition is determined to be highly orientation dependent. A detailed review of face recognition of inverted faces was made available by Valentine in 1988 (see citation below).
It is therefore only natural that artificial intelligence detection algorithms based on face-related classifiers may have the same features of being orientation-variant.
Cameras are becoming strong computation tools. In particular, FotoNation Vision, Inc., assignee of the present application, has developed many advantageous face detection tools. Some of these are described at U.S. patent application Ser. Nos. 10/608,776, 10/608,810, 10/764,339, 10/919,226, 11/182,718, and 11/027,001, which are hereby incorporated by reference.
It is desired to have a smart system for disqualifying unsatisfactory images, particularly of faces, and/or that alerts a photographer to take another picture due to poor quality of a previous picture. It is also desired to do so without using a trigger to take a picture, nor waiting for an event that may or may not happen (e.g. a smile). U.S. Pat. No. 6,301,440 discloses adjusting image capture parameters based on analysis of temporary images, and awaiting taking a picture until everyone in the temporary images is smiling. The camera must await a certain event that may or may not ever happen. It is many times not acceptable to make people wait for the camera to decide that a scene is optimal before taking a picture, and there is no description in the '440 patent that would alleviate such dilemma. The '440 patent also provides no guidance as to how to detect or determine certain features within a scene. There are also security cameras that take pictures when a subject enters the view of the camera. However, these generally only detect motion or abrupt changes in what is generally a stagnant scene.
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. Red-eye is caused by light from the flash reflecting off blood vessels in a 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 may be characterized as either semi-automatic or automatic. Semi-automatic red-eye detection techniques rely on human input. For example, in some semi-automatic red-eye reduction systems, a user manually identifies to the system the areas of an image containing red-eye before the defects can be corrected.
An automatic red-eye reduction system may rely on a preliminary detection of any faces in an image before red-eye areas are detected. One automatic approach may involve detecting faces in an image and, subsequently, detecting eyes within each detected face. After the eyes are located, red-eye is identified based on shape, coloration, and/or brightness of image areas corresponding to the detected eye locations. In general, face detection-based automatic red-eye 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.
U.S. Pat. No. 6,407,777, having inventor DeLuca and assignee Fotonation, 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 (see also U.S. application Ser. Nos. 10/919,226, filed Aug. 16, 2004, 10/772,092, filed Feb. 4, 2004, 10/773,092, filed Feb. 4, 2004, and 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.
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.
Most algorithms that involve image analysis and classification, are statistical in nature. It is therefore desired to develop tools which will improve the probability of successful detection, while reducing the probability of false detection, while maintaining optimal execution, especially in limited computational devices such as in handheld or otherwise portable digital cameras. In many cases, knowledge of image characteristics such as image quality may affect the design parameters and decisions the detection and correction software uses. For example an image with suboptimal exposure may deteriorate the overall detection of red-eye defects. It is desired to have a method of improving a success rate of efficient algorithms for detecting and reducing red-eye phenomenon by utilizing information, meta-data and/or image data from reference images.
A map of defects caused by dust particles present in optical elements of a digital image acquisition device may be generated, and used in processing images captured by the device. For example, FIG. 1 of US published patent application No. 2003/0193604 to Robins illustrates a set of LEDs 38 or 38a disposed within camera lens elements 42, 44, 46 and, with the lens cover 36, 36a in place, lighting the LEDs and acquiring a calibration image from the camera sensor to detect contamination of the camera lens elements. In addition, published PCT application no. PCT/EP2004/010199, which is assigned to Fotonation and corresponding to one or more of seven sequentially numbered U.S. published applications nos. 2005/0068446 through '68452, and 2005/0078173 disclose building a statistical dust map based on information derived from one or more images acquired by a camera. While working with camera companies, there is a constant complaint about ORBS which are undesirable artefacts in images. Scientifically they are reflections of water or dust particles. As to correction, Kodak has worked on detection and correction of defective-colored eyes (thus, round shapes). For example, U.S. Pat. No. 7,035,462 describes an apparatus and method for processing digital images having eye color defects. The correction of artefacts is also approached at U.S. Pat. No. 7,031,548, which describes a method and apparatus for filtering noise from a digital image. U.S. Pat. No. 6,614,946 discloses a system and method for correcting defects in digital images through selective fill-in from surrounding areas. U.S. Pat. No. 6,160,923 also relates to this issue. It is desired to provide an efficient, quality dust or orb artifact correction technique for a hand-held or otherwise portable or spatial or temporal performance-based image capture device
A digital image processing method includes capturing, on a hand-held or otherwise portable or spatial or temporal performance-based image capture device, an original main image and one or more reference images having a temporal or spatial overlap or proximity with the original image, or combinations thereof. The method also includes in general the ability to obtain supplemental or complementary data, such as visual information to the captured image, using a reference image. In one embodiment, such data analysis includes assessing on the device that the original main image has one or more defects or otherwise sub-optimal characteristics. Information, image data or meta data, or combinations thereof, of the one or more reference images relating to the one or more defects or otherwise sub-optimal characteristics of the original main image are analyzed on the device. The one or more defects or other sub-optimal characteristics in the original main image are corrected on the device based on the information, image data or meta data, or combinations thereof, of the one or more reference images. Thus, a modified image is created than includes an enhanced version of the original main image. The modified image is rendered at a digital rendering device, display or printer, or combinations thereof, as output from the image capture device. The correcting of the one or more defects or other sub-optimal characteristics of the original main image based on the one or more reference images produces at the device the modified image from the original main image in real-time with spatial economy and performance efficiency.
The original main image and at least one reference image may include flash and non-flash versions of a substantially same scene. The original main image may be segmented into foreground and background regions, at least one of which may be modified based on the one or more reference images. A region containing a face may be detected within the original main image, and the face region may be modified based on the one or more reference images. A red-eye defect may be corrected within the face region of the original main image. A blur defect may be corrected in the original main image based on the one or more reference images. A dust artifact defect may be corrected in the original main image based on the one or more reference images.
A hand-held or otherwise portable or spatial or temporal performance-based image capture device may include one or more lenses, and a corresponding one or more sensors configured to provide a closely overlapping or identical temporal proximity between the acquired image and the reference image. Alternatively, the reference image may be acquired using the same optical system but at different times, e.g., just before or just after acquiring the main image. The device may also include an aperture and a photodetector for capturing the original main image and the one or more reference images, as well as a processor, and one or more processor-readable media having embedded therein programming code for the processor to perform a digital image processing method as described above or below herein.
Several embodiments are described herein that use information obtained from reference images for processing a main image. That is, the data that are used to process the main image come at least not solely from the image itself, but instead or also from one or more separate “reference” images.
Reference images provide supplemental meta data, and in particular supplemental visual data to an acquired image, or main image. The reference image can be a single instance, or in general, a collection of one or more images varying from each other. The so-defined reference image(s) provides additional information that may not be available as part of the main image.
Example of a spatial collection may be multiple sensors all located in different positions relative to each other. Example of temporal distribution can be a video stream.
The reference image differs from the main captured image, and the multiple reference images differ from each other in various potential manners which can be based on one or combination of permutations in time (temporal), position (spatial), optical characteristics, resolution, and spectral response, among other parameters.
One example is temporal disparity. In this case, the reference image is captured before and/or after the main captured image, and preferably just before and/or just after the main image. Examples may include preview video, a pre-exposed image, and a post-exposed image. In certain embodiments, such reference image uses the same optical system as the acquired image, while in other embodiments, wholly different optical systems or optical systems that use one or more different optical components such as a lens, an optical detector and/or a program component.
Alternatively, a reference image may differ in the location of secondary sensor or sensors, thus providing spatial disparity. The images may be taken simultaneously or proximate to or in temporal overlap with a main image. In this case, the reference image may be captured using a separate sensor located away from the main image sensor. The system may use a separate optical system, or via some splitting of a single optical system into a plurality of sensors or a plurality of sub-pixels of a same sensor. As digital optical systems become smaller dual or multi sensor capture devices will become more ubiquitous. Some added registration and/or calibration may be typically involved when two optical systems are used.
Alternatively, one or more reference images may also be captured using different spectral responses and/or exposure settings. One example includes an infra red sensor to supplement a normal sensor or a sensor that is calibrated to enhance specific ranges of the spectral response such as skin tone, highlights or shadows.
Alternatively, one or more reference images may also be captured using different capture parameters such as exposure time, dynamic range, contrast, sharpness, color balance, white balance or combinations thereof based on any image parameters the camera can manipulate.
Alternatively, one or more reference images may also be captured using a secondary optical system with a differing focal length, depth of field, depth of focus, exit pupil, entry pupil, aperture, or lens coating, or combinations thereof based on any optical parameters of a designed lens.
Alternatively, one or more reference images may also capture a portion of the final image in conjunction with other differentials. Such example may include capturing a reference image that includes only the center of the final image, or capturing only the region of faces from the final image. This allows saving capture time and space while keeping as reference important information that may be useful at a later stage.
Reference images may also be captured using varying attributes as defined herein of nominally the same scene recorded onto different parts of a same physical sensor. As an example, one optical subsystem focuses the scene image onto a small area of the sensor, while a second optical subsystem focuses the scene image, e.g., the main image, onto a much larger area of the sensor. This has the advantage that it involves only one sensor and one post-processing section, although the two independently acquired scene images will be processed separately, i.e., by accessing the different parts of the sensor array. This approach has another advantage, which is that a preview optical system may be configured so it can change its focal point slightly, and during a capture process, a sequence of preview images may be captured by moving an optical focus to different parts of the sensor. Thus, multiple preview images may be captured while a single main image is captured. An advantageous application of this embodiment would be motion analysis.
Getting data from a reference image in a preview or postview process is akin to obtaining meta data rather than the image-processing that is performed using the meta data. That is, the data used for processing a main image, e.g., to enhance its quality, is gathered from one or more preview or postview images, while the primary source of image data is contained within the main image itself. This preview or postview information can be useful as clues for capturing and/or processing the main image, whether it is desired to perform red-eye detection and correction, face tracking, motion blur processing, dust artefact correction, illumination or resolution enhancement, image quality determination, foreground/background segmentation, and/or another image enhancement processing technique. The reference image or images may be saved as part of the image header for post processing in the capture device, or alternatively after the data is transferred on to an external computation device. In some cases, the reference image may only be used if the post processing software determines that there is missing data, damaged data or need to replace portions of the data.
In order to maintain storage and computation efficiency, the reference image may also be saved as a differential of the final image. Example may include a differential compression or removal of all portions that are identical or that can be extracted from the final image.
In one example involving red-eye correction, a face detection process may first find faces, find eyes in a face, and check if the pupils are red, and if red pupils are found, then the red color pupils are corrected, e.g., by changing their color to black. Another red-eye process may involve first finding red in a digital image, checking whether the red pixels are contained in a face, and checking whether the red pixels are in the pupil of an eye. Depending on the quality of face detection available, one or the other of these may be preferred. Either of these may be performed using one or more preview or postview images, or otherwise using a reference image, rather than or in combination with, checking the main image itself. A red-eye filter may be based on use of acquired preview, postview or other reference image or images, and can determine whether a region may have been red prior to applying a flash.
Another known problem involves involuntary blinking. In this case, the post processing may determine that the subject's eyes were closed or semi closed. If there exists a reference image that was captured time-wise either a fraction of a second before or after such blinking, the region of the eyes from the reference image can replace the blinking eye portion of the final image.
In some cases as defined above, the camera may store as the reference image only high resolution data of the Region of Interest (ROI) that includes the eye locations to offer such retouching.
Multiple reference images may be used, for example, in a face detection process, e.g., a selected group of preview images may be used. By having multiple images to choose from, the process is more likely to have a more optimal reference image to operate with. In addition, a face tracking process generally utilizes two or more images anyway, beginning with the detection of a face in at least one of the images. This provides an enhanced sense of confidence that the process provides accurate face detection and location results.
Moreover, a perfect image of a face may be captured in a reference image, while a main image may include an occluded profile or some other less than optimal feature. By using the reference image, the person whose profile is occluded may be identified and even have her head rotated and unblocked using reference image data before or after taking the picture. This can involve upsampling and aligning a portion of the reference image, or just using information as to color, shape, luminance, etc., determined from the reference image. A correct exposure on a region of interest or ROI may be extrapolated using the reference image. The reference image may include a lower resolution or even subsampled resolution version of the main image or another image of substantially a same scene as the main image.
Meta data that is extracted from one or more reference images may be advantageously used in processes involving face detection, face tracking, red-eye, dust or other unwanted image artefact detection and/or correction, or other image quality assessment and/or enhancement process. In this way, meta data, e.g., coordinates and/or other characteristics of detected faces, may be derived from one or more reference images and used for main image quality enhancement without actually looking for faces in the main image.
A reference image may also be used to include multiple emotions of a single subject into a single object. Such emotions may be used to create more comprehensive data of the person, such as smile, frown, wink, and/or blink. Alternatively, such data may also be used to post process editing where the various emotions can be cut-and-pasted to replace between the captured and the reference image. An example may include switching between a smile to a sincere look based on the same image.
Finally, the reference image may be used for creating a three-dimensional representation of the image which can allow rotating subjects or the creation of three dimensional representations of the scene such as holographic imaging or lenticular imaging.
A reference image may include an image that differs from a main image in that it may have been captured at a different time before or after the main image. The reference image may have spatial differences such as movements of a subject or other object in a scene, and/or there may be a global movement of the camera itself. The reference image may, preferably in many cases, have lower resolution than the main image, thus saving valuable processing time, bytes, bitrate and/or memory, and there may be applications wherein a higher resolution reference image may be useful, and reference images may have a same resolution as the main image. The reference image may differ from the main image in a planar sense, e.g., the reference image can be infrared or Gray Scale, or include a two bit per color scheme, while the main image may be a full color image. Other parameters may differ such as illumination, while generally the reference image, to be useful, would typically have some common overlap with the main image, e.g., the reference image may be of at least a similar scene as the main image, and/or may be captured at least somewhat closely in time with the main image.
Some cameras (e.g., the Kodak V570, see http://www.dcviews.com/_kodak/v570.htm) have a pair of CCDs, which may have been designed to solve the problem of having a single zoom lens. A reference image can be captured at one CCD while the main image is being simultaneously captured with the second CCD, or two portions of a same CCD may be used for this purpose. In this case, the reference image is neither a preview nor a postview image, yet the reference image is a different image than the main image, and has some temporal or spatial overlap, connection or proximity with the main image. A same or different optical system may be used, e.g., lens, aperture, shutter, etc., while again this would typically involve some additional calibration. Such dual mode system may include a IR sensor, enhanced dynamic range, and/or special filters that may assist in various algorithms or processes.
In the context of blurring processes, i.e., either removing camera motion blur or adding blur to background sections of images, a blurred image may be used in combination with a non-blurred image to produce a final image having a non-blurred foreground and a blurred background. Both images may be deemed reference images which are each partly used to form a main final image, or one may be deemed a reference image having a portion combined into a main image. If two sensors are used, one could save a blurred image at the same time that the other takes a sharp image, while if only a single sensor is used, then the same sensor could take a blurred image followed by taking a sharp image, or vice-versa. A map of systematic dust artefact regions may be acquired using one or more reference images.
Reference images may also be used to disqualify or supplement images which have with unsatisfactory features such as faces with blinks, occlusions, or frowns.
A method is provided for distinguishing between foreground and background regions of a digital image of a scene. The method includes capturing first and second images of nominally the same scene and storing the captured images in DCT-coded format. These images may include a main image and a reference image, and/or simply first and second images either of which images may comprise the main image. The first image may be taken with the foreground more in focus than the background, while the second image may be taken with the background more in focus than the foreground. Regions of the first image may be assigned as foreground or background according to whether the sum of selected high order DCT coefficients decreases or increases for equivalent regions of the second image. In accordance with the assigning, one or more processed images based on the first image or the second image, or both, are rendered at a digital rendering device, display or printer, or combinations thereof.
This method lends itself to efficient in-camera implementation due to the relatively less-complex nature of calculations utilized to perform the task.
In the present context, respective regions of two images of nominally the same scene are said to be equivalent if, in the case where the two images have the same resolution, the two regions correspond to substantially the same part of the scene. If, in the case where one image has a greater resolution than the other image, the part of the scene corresponding to the region of the higher resolution image is substantially wholly contained within the part of the scene corresponding to the region of the lower resolution image. Preferably, the two images are brought to the same resolution by sub-sampling the higher resolution image or upsampling the lower resolution image, or a combination thereof. The two images are preferably also aligned, sized or other process to bring them to overlapping as to whatsoever relevant parameters for matching.
Even after subsampling, upsampling and/or alignment, the two images may not be identical to each other due to slight camera movement or movement of subjects and/or objects within the scene. An additional stage of registering the two images may be utilized.
Where the first and second images are captured by a digital camera, the first image may be a relatively high resolution image, and the second image may be a relatively low resolution pre- or post-view version of the first image. While the image is captured by a digital camera, the processing may be done in the camera as post processing, or externally in a separate device such as a personal computer or a server computer. In such case, both images can be stored. In the former embodiment, two DCT-coded images can be stored in volatile memory in the camera for as long as they are being used for foreground/background segmentation and final image production. In the latter embodiment, both images may be preferably stored in non-volatile memory. In the case of lower resolution pre-or-post view images, the lower resolution image may be stored as part of the file header of the higher resolution image.
In some cases only selected regions of the image are stored as two separated regions. Such cases include foreground regions that may surround faces in the picture. In one embodiment, if it is known that the images contain a face, as determined, for example, by a face detection algorithm, processing can be performed just on the region including and surrounding the face to increase the accuracy of delimiting the face from the background.
Inherent frequency information as to DCT blocks is used to provide and take the sum of high order DCT coefficients for a DCT block as an indicator of whether a block is in focus or not. Blocks whose high order frequency coefficients drop when the main subject moves out of focus are taken to be foreground with the remaining blocks representing background or border areas. Since the image acquisition and storage process in a digital camera typically codes captured images in DCT format as an intermediate step of the process, the method can be implemented in such cameras without substantial additional processing.
This technique is useful in cases where differentiation created by camera flash, as described in U.S. application Ser. No. 11/217,788, published as 2006/0039690, incorporated by reference (see also U.S. Ser. No. 11/421,027) may not be sufficient. The two techniques may also be advantageously combined to supplement one another.
Methods are provided that lend themselves to efficient in-camera implementation due to the computationally less rigorous nature of calculations used in performing the task in accordance with embodiments described herein.
A method is also provided for determining an orientation of an image relative to a digital image acquisition device based on a foreground/background analysis of two or more images of a scene.
In the case of preview images which are generated in the pre-capture mode 32 with the shutter button half-pressed, the display 100 can assist the user in composing the image, as well as being used to determine focusing and exposure. Temporary storage 82 is used to store one or plurality of the preview images and can be part of the image store 80 or a separate component. The preview image is usually generated by the image capture device 60. For speed and memory efficiency reasons, preview images usually have a lower pixel resolution than the main image taken when the shutter button is fully depressed, and are generated by sub-sampling a raw captured image using software 124 which can be part of the general processor 120 or dedicated hardware or combinations thereof. Depending on the settings of this hardware subsystem, the pre-acquisition image processing may satisfy some predetermined test criteria prior to storing a preview image. Such test criteria may be chronological, such as to constantly replace the previous saved preview image with a new captured preview image every 0.5 seconds during the pre-capture mode 32, until the final high resolution image is captured by full depression of the shutter button. More sophisticated criteria may involve analysis of the preview image content, for example, testing the image for changes, before deciding whether the new preview image should replace a previously saved image. Other criteria may be based on image analysis such as the sharpness, or metadata analysis such as the exposure condition, whether a flash will be used in the final image, the distance to the subject, or combinations thereof.
If test criteria are not met, the camera continues by capturing the next preview image while storing and/or discarding preceding captured previews. The process continues until the final high resolution image is acquired and saved by fully depressing the shutter button.
Where multiple preview images can be saved, a new preview image will be placed on a chronological First-In, First-Out (FIFO) stack, until the user takes the final picture. A reason for storing multiple preview images is that the last preview image, or any single preview image, may not be the best reference image for comparison with the final high resolution image in, for example, a red-eye correction process or, in the present embodiments, portrait mode processing. By storing multiple images, a better reference image can be achieved, and a closer alignment between the preview and the final captured image can be achieved in an alignment stage discussed later. Also, some processing may involve the use of multiple preview and/or post-view images.
The camera is also able to capture and store in the temporary storage 82 one or more low resolution post-view images when the camera is in portrait mode. Post-view images are essentially the same as preview images, except that they occur after the main high resolution image is captured.
In this embodiment the camera 20 has a user-selectable mode 30. The user mode 30 is one which involves foreground/background segmentation of an image as part of a larger process, e.g. for applying special effects filters to the image or for modifying or correcting an image. Thus in the user mode 30 the foreground/background segmentation is not an end in itself. However, as the segmentation aspects of the user mode 30 are relevant, those aspects are described further herein.
If user mode 30 is selected, when the shutter button is depressed the camera is caused to automatically capture and store a series of images at close intervals so that the images are nominally of the same scene. The particular number, resolution and sequence of images, and the extent to which different parts of the image are in or out of focus, depends upon the particular embodiment. A user mode processor 90 analyzes and processes the stored images according to a workflow to be described. The processor 90 can be integral to the camera 20—indeed, it could be the processor 120 with suitable programming—or part of an external processing device 10 such as a desktop computer. In this embodiment the processor 90 processes the captured images in DCT format. As explained above, the image acquisition and storage process in a digital camera typically codes the captured images in DCT format as an intermediate step of the process, the images being finally stored in, for example, jpg format. Therefore, the intermediate DCT-coded images can be readily made available to the processor 90.
These two images are taken in rapid succession so that the scene captured by each image is nominally the same. In this embodiment steps 200 to 206 just described take place in the camera 20. The remaining steps now to be described can take place in the camera or in an external device 10.
Images A and B are aligned in step 206, to compensate for any slight movement in the subject or camera between taking these images. Alignment algorithms are well known. Then, at step 208, a high frequency (HF) map of the foreground focussed image A is constructed by taking the sum of selected high order DCT coefficients for each, or at least the majority of, the DCT blocks of the image. By way of background, for an 8×8 block of pixels, a set of 64 DCT coefficients going from the first (d.c.) component to the highest frequency component is generated. In this embodiment, the top 25% of the DCT coefficients for a block are added to provide an overall HF index for the block. If not all the DCT blocks of the image are used to construct the map, those that are should be concentrated on the regions expected to contain the foreground subject of interest. For example, the extreme edges of the image can often be omitted, since they will almost always be background. The resultant map is referred to herein as Map A.
Next, step 210, an HF map (Map B) of the background focussed image B is constructed by calculating the HF indices of the DCT blocks using the same procedure as for Map A.
Now, step 212, a difference map is constructed by subtracting Map A from Map B. This is done by subtracting the HF indices obtained in step 208 individually from the HF indices obtained in step 210. Since Image A has a higher resolution than image B, a DCT block in Image B will correspond to a larger area of the scene than a DCT block in Image A. Therefore, each HF index of Map A is subtracted from that HF index of Map B whose DCT block corresponds to an area of the scene containing or, allowing for any slight movement in the subject or camera between taking the images, substantially containing the area of the scene corresponding to the DCT block of Map A. This means that the HF indices for several adjacent DCT blocks in Image A will be subtracted from the same HF index of Map B, corresponding to a single DCT block in Image B.
At step 214, using the values in the difference map, a foreground/background map is constructed wherein each DCT block of Image A is assigned as corresponding to a foreground or background region of the image according to whether the difference between its HF index and the HF index of the DCT block of Image B from which it was subtracted in step 212 is, respectively, negative or positive.
Finally, at step 216, additional morphological, region filling and related image processing techniques, alone or in combination with other foreground/background segmentation techniques, can further improve and enhance the final foreground/background map.
The final foreground/background map 218 may now be applied to the DCT-coded or jpg version of Image A for use in processing the image according to the function to be performed by the user-selectable mode 30.
Where the processor 90 is integral to the camera 20, the final processed jpg image may be displayed on image display 100, saved on a persistent storage 112 which can be internal or a removable storage such as CF card, SD card or the like, or downloaded to another device, such as a personal computer, server or printer via image output device 110 which can be tethered or wireless. In embodiments where the processor 90 is implemented in an external device 10, such as a desktop computer, the final processed image may be returned to the camera 20 for storage and display as described above, or stored and displayed externally of the camera.
Variations of the foregoing embodiment are possible. For example, Image B could be a low resolution preview image rather than a post-view image. Alternatively, both Images A and B could be high resolution images having the same resolution. In that case a DCT block in Image B will correspond to the same area of the scene as a DCT block in Image A. Thus, in step 212, the difference map would be constructed by subtracting each HF index of Map A from a respective different HF index of Map B, i.e. that HF index of Map B corresponding to the same or, allowing for any slight movement in the subject or camera between taking the images, substantially the same area of the scene. In another embodiment both Images A and B are low resolution preview and/or post-view images having the same resolution, and the foreground/background map derived therefrom is applied to a third, higher resolution image of nominally the same scene.
In another embodiment, rather than basing the maps and comparison on a DCT block by block analysis, each map can first be pre-processed to provide regions, each having similar HF characteristics. For example, contiguous blocks with HF components above a given threshold are grouped together and contiguous blocks with HF components below a given threshold are grouped together. Regions from the foreground and background images can then be compared to determine if they are foreground or background.
In another embodiment, Images A and B may have different pixel resolutions, and prior to DCT coding, the pixel resolutions of the two images are matched by up-sampling the image of lower resolution and/or sub-sampling the image of higher resolution. In this context, US published patent applications nos. 2005/0041121 and 2006/0098890, which are assigned to the same assignee as the present application, are hereby incorporated by reference. In this embodiment, a digital foreground/background map may be preferably created and stored, while it may also be possible to use the foreground/background designation of the image region corresponding to each DCT block directly in another algorithm, instead of formally creating and storing a digital map.
As mentioned above, the ability to provide foreground/background separation in an image is useful in many applications.
In other embodiments, a particular application may use a foreground/background map of an image, regardless of whether it has been calculated using the embodiment described above or, e.g, using a flash-based technique such as that described at US published patent application no. 2006/0285754, which is hereby incorporated by reference. The technique may detect the orientation of an image relative to the camera. The technique may be applicable to any digital image acquisition device. For many situations, this may imply an orientation of a camera when the image was taken without an additional mechanical device.
Referring now to
An exemplary implementation may use two reference images, e.g., preview or postview images or combinations of preview, postview and/or ordinary images suitably matched in resolution, one flash and one non-flash, and transforms these into grey level. For each pixel, the grey level of the non-flash image is subtracted from the one corresponding to the flash image to provide a difference image. In other implementations, a ratio could be used instead of subtraction.
For each potential image/camera orientation direction, a box is taken in the difference image. So, for an image sensing array 310 in an upright camera, box 312 is associated with an upright orientation of the camera, and box 316 is associated with an inverted orientation of the camera, box 314 is associated with a clockwise rotation of the camera relative to a scene, and box 318 is associated with an anti-clockwise rotation of the camera relative to the scene.
For each of boxes 312-318 of
For clarity, the boxes 312-318 of
The maximum of the average values for the boxes 312-318 may be computed and the box corresponding to the largest value may be deemed to be a region with the greatest degree of foreground vis-a-vis the remaining regions. This is deemed to indicate that this region lies at the bottom of the reference image(s). In the example of
In some implementations, it can be of benefit to run some tests in order to validate the presumptive image orientation. For example, the maximum of the average values may be tested to determine if it is dominant vis-à-vis other values and a level of confidence can be implied from this dominance or otherwise. The degree of dominance involved can be varied experimentally for different types of images (e.g., indoor/outdoor as described in US published patent application no. 2006/0285754, or day/night).
Information from other image analysis components which are used within the camera may also be combined for determining a level of confidence. One exemplary image analysis component is a face tracking module which may be operable on a stream of ordinary, preview or postview images. This component may store historical data relating to tracked face regions, including a confidence level that a region is a face and an associated orientation. Where multiple faces are present, their data may be combined in determining a level of confidence.
In an example, if the difference values for the presumed left and right sides of an image are similar and smaller then the presumed bottom and larger than the presumed top, then it may be more (or less) likely that the orientation has been detected correctly.
Because foreground/background maps can be provided for both indoor and outdoor images according to whether the maps have been created using flash or non-flash based segmentation, knowing image orientation can be useful in many further camera applications. For example, knowing the likely orientation of objects in an image can reduce processing overhead in attempting to identify such objects in every possible orientation.
In another embodiment, a method is provided wherein one or more groups of pixels are identified as faces or other objects or subjects within a digital acquisition device based on information from one or more reference images, which may be preview, postview or other different images from a main image within which it is desired to identify such faces, or other objects or subjects. Certain embodiments are described below including methods and devices for providing and/or suggesting options for determining image orientation automatically using face detection. A preferred embodiment includes an image processing application whether implemented in software or in firmware, as part of the image capture process, such as in a digital camera, or as part of post processing, such as a desktop, in the camera as a post processing background process or on a server application. This system receives images in digital form, where the images can be translated into a grid representation including multiple pixels.
The preferred embodiment describes a method of re-using face detection information in different orientations of the image to determine the orientation with the highest probability to be the correct one. The information regarding the location and size of faces in an image assist in determining correct orientation.
Advantages of the preferred embodiments include the ability to automatically perform or suggest or assist in the determination of the correct orientation of an image. Another advantage is that the processing may be automatically performed and/or suggested based on this information. Such automatic processing is fast enough and efficient enough to handle multiple images in close to real time, or be used for a single image as part of the image processing in the acquisition device.
Many advantageous techniques are provided in accordance with preferred and alternative embodiments set forth herein. For example, this method of detection the image orientation can be combined with other methods of face detection, thus improving the functionality, and re-purposing the process for future applications.
Two or more methods of detecting faces in different orientations may be combined to achieve better accuracy and parameters of a single algorithm may be concatenated into a single parameter. The digital image may be transformed to speed up the process, such as subsampling or reducing the color depth. The digital image may be transformed to enhance the accuracy such as preprocessing stage for improving the color balance, exposure or sharpness. The digital image may post-processed to enhance the accuracy, such as removal of false positives as a post processing process, based on parameters and criteria of the face detection algorithm.
Values of orientation may be adjusted such that a rotation value for the digital image is determined. This technique may be implemented for supporting arbitrary rotation or fixed interval rotation such as 90 degree rotation.
The method may be performed within any digital image capture device, which as, but not limited to digital still camera, phone handset with built in camera, web camera or digital video camera. Determining which of the sub-group of pixels belong to which of the group of face pixels may be performed. The determining of the initial values of one or more parameters of pixels may be calculated based on the spatial orientation of the one or more sub-groups that correspond to one or more facial features. The spatial orientation of the one or more sub-groups that correspond to one or more facial features may be calculated based on an axis of an ellipse fit to the sub-group. The adjusted values of pixels within the digital image may be rounded to a closest multiple of 90 degrees. The initial values may be adjusted to adjusted values for re-orienting the image to an adjusted orientation. The one or more facial features may include an eye, two eyes, two eyes and a mouth, an eye, a mouth, hairline, ears, nostrils, nose bridge, eyebrows or a nose, or combinations thereof. On a more abstract level the features used for the detection of objects in general in the image, or faces specifically may be determined through a mathematical classifiers that are either deduced via a learning process or inserted into the system. One example of such classifiers are described by Viola Jones in the paper incorporated herein by reference. Other classifiers can be the eigenfaces, which are the basis functions that define images with faces.
Each of the methods provided are preferably implemented within software and/or firmware either in the camera or with external processing equipment. The software may also be downloaded into the camera or image processing equipment. In this sense, one or more processor readable storage devices having processor readable code embodied thereon are provided. The processor readable code programs one or more processors to perform any of the above or below described methods.
The classifiers are preferably pre-determined for the specific image classification. A detailed description of the learning process to create the appropriate classifiers can be found in the paper by Viola and Jones that has been cited and incorporated by reference hereinabove. The classifiers are loaded, at step 408, into the application.
The image is preferably rotated into three orientations at block 410. Only two or more than three orientation may alternatively be used: The preferred orientations are counter clockwise 412, no rotation 414 and clockwise, 416. Note that a fourth orientation which is the upside down 418 is technically and theoretically plausible but is not preferred due to the statistical improbability of such images. One or more images rotated by 1°, or a few seconds or minutes, or by 3° or 45°, or an arbitrary amount, may also be used.
The three images are then provided to the face detection software at block 420 and the results are analyzed at block 430. The image with the highest probability of detection of faces is determined at block 440 to be most likely the one with the right orientation.
The classifiers are preferably combined into a single set of classifiers at block 470. The concatenation of the classifiers is preferably performed in such a manner that an false eliminating process would still be optimized. Note that these operations need not be executed at the time of analysis, but can be prepared prior to running the process on an image, as a preparatory step. Also note that the two approaches may be combined, where some classifiers may or may not be used depending on the results of the previous classifies. It may be possible to merge the preferred three sets, or an arbitrary number of two or more sets, of rotated classifiers.
Part-way through, the common classifiers one would branch into the specific classifiers for each orientation. This would speed up the algorithm because the first part of the classification would be common to the three orientations.
In another embodiment, where the classifier set contains rotation invariant classifiers it is possible to reduce the number of classifiers which must be applied to an image from 3N to 3N-2M where N is the number of classifiers in the original classifier set and M is the number of rotation invariant classifiers. The image is then prepared at block 458 to run the face detection algorithm at block 422. Such preparation varies on the algorithm and can include different operations such as converting the image format, the color depth, the pixel representation etc. In some cases the image is converted, such as described by Viola and Jones, to form a pixel based representation from an integral one. In other cases the image may be subsampled to reduce computation, converted to a gray scale representation, or various image enhancement algorithms such as edge enhancement, sharpening, blurring, noise reduction etc. may be applied to the image. Numerous operations on the image in preparation may also be concatenated. The face detection algorithm is run once on the image at block 422, using the multiple set of classifiers 470. The results are then collated at block 428, according to each of the three orientations of the preferred classifier set. The number of surviving face regions for each orientation of the classifier set are next compared at block 430. The orientation with the highest number of surviving face regions is determined at block 440 to be the one with the highest likelihood orientation.
In an additional embodiment, the algorithm handles may handle cases of false detection of faces. The problem occurs where in some cases regions that are not faces are marked as potential faces. In such cases, it is not enough to count the occurrence of faces, but the probability of false detection and missed faces needs to be accounted for.
According to another embodiment, there is provided a digital image acquisition system comprising an apparatus for capturing digital images and a digital processing component for determining a camera motion blur function in a captured digital image based on a comparison of at least two images each taken during, temporally proximate to or overlapping an exposure period of said captured image and of nominally the same scene.
Preferably, the at least two images comprise the captured image and another image taken outside, preferably before and alternatively after, the exposure period of said captured image.
Preferably at least one reference image is a preview image.
Referring back again briefly to
Upon full depression of the shutter button, a full resolution image is acquired and stored at image store 80. The image may go through image processing stages such as conversion from the RAW sensor pattern to RGB, format, color correction and image enhancements. These operations may be performed as part of the main processor 120 or by using a secondary processor such as a dedicated DSP. Upon completion of the image processing the images are stored in a long term persistent storage such as a removable storage device 112.
According to this embodiment, the system further includes a motion de-blurring component. This component can be implemented as firmware or software running on the main processor 120 or on a separate processor. Alternatively, this component may be implemented in software running on an external processing device 10 of
The criteria 484 that a preview image is determined to satisfy can vary depending on specific implementations of the process. In one embodiment, such criteria may be whether the image is not blurred. This is based on the assumption that even if a camera is constantly moving, being hand held by the user, there are times where the movement is zero, whether because the user is firmly holding the camera or due to change of movement direction the movement speed is zero at a certain instance. Such criteria may not need to be absolute. In addition such criteria may be based on one or more 1-dimensional vectors as opposed to a full two dimensional image. In other words, the criteria 484 may be satisfied if the image is blurred horizontally, but no vertical movement is recorded and vice versa, due to the fact that the motion may be mathematically described in orthogonal vectors, thus separable. More straight forward criteria will be chronological, saving images every predefined time which can be equal or slower to the speed the preview images are generated. Other criteria may be defined such as related to the exposure, whether the preview reached focus, whether flash is being used, etc.
Finally, the full resolution image is acquired at 492 is saved at 494. After the full resolution image is saved 494, it is loaded into memory 495 and the preview image or images are loaded into memory as well at 496 of
A description of two different methods of calculating PSF is provided with reference to
Due to the fact that the preview image and the final full resolution image differ temporally, there may not be a perfect alignment. In this case, local alignment, based on image features and using techniques known to those skilled in the art, will normally be sufficient. The process of alignment may be performed on selected extracted regions 520, or as a local operation. Moreover, this alignment is only required in the neighborhood of the selected region(s) or feature(s) used for the creation of the PSF. In this case, matching regions of the full resolution and preview image are extracted, 521 and 522. The process of extraction of such regions may be as simple as separating the image into a grid, which can be the entire image, or fine resolution regions. Other more advanced schemes will include the detection of distinct regions of interest based on a classification process, such as detecting regions with high contrast in color or exposure, sharp edges or other distinctive classifiers that will assist in isolating the PSF. One familiar in the art is aware of many algorithms for analyzing and determining local features or regions of high contrast; frequency transform and edge detection techniques are two specific examples that may be employed for this step, which may further include segmentation, feature extraction and classification steps.
The preview image 512 is normally, but not necessarily, of lower resolution than the full resolution image 511, typically being generated by clocking out a subset of the sensor cells or by averaging the raw sensor data. Therefore, the two images, or alternatively the selected regions in the images, need to be matched in pixel resolution, 530. In the present context “pixel resolution” means the size of the image, or relevant region, in terms of the number of pixels constituting the image or region concerned. Such a process may be done by either upsampling the preview image, 532, downsampling the acquired image, 531, or a combination thereof. Those familiar in the art will be aware of several techniques best used for such sampling methods.
Now we recall from before that:
Now it is well known that where a mathematical function, such as the aforementioned MPSF(x,y), is convoluted with a Dirac delta function δ(x,y) that the original function is preserved. Thus, if within a preview image a sharp point against a homogenous background can be determined, it is equivalent to a local occurrence of a 2D Dirac delta function within the unblurred preview image. If this can now be matched and aligned locally with the main, blurred image I′(x,y) then the distortion pattern around this sharp point will be a very close approximation to the exact PSF which caused the blurring of the original image I(x,y). Thus, upon performing the alignment and resolution matching between preview and main images the distortion patterns surrounding distinct points or high contrast image features, are, in effect, representations of the 2D PSF, for points and representation of a single dimension of the PSF for sharp, unidirectional lines.
The PSF may be created by combining multiple regions. In the simple case, a distinguished singular point on the preview image and its corresponding motion blurred form of this point which is found in the main full-resolution image is the PSF.
However, as it may not always be possible to determine, match and align, a single distinct point in both preview and full resolution image, it is alternatively possible to create a PSF from a combination of the orthogonal parts of more complex features such as edges and lines. Extrapolation to multiple 1-D edges and corners should be clear for one familiar in the art. In this case multiple line-spread-functions, depicting the blur of orthogonal lines need to be combined and analysed mathematically in order to determine a single-point PSF.
Due to statistical variances this process may not be exact enough to distinguish the PSF based on a single region. Therefore, depending on the processing power and required accuracy of the PSF, the step of finding the PSF may include some statistical pattern matching or statistical combination of results from multiple regions within an image to create higher pixel and potentially sub pixel accuracy for the PSF.
As explained above, the PSF may not be shift invariant. Therefore, the process of determining the right PSF may be performed in various regions of the image, to determine the variability of the PSF as a function of location within the image.
b shows a method 600 of extrapolating a PSF using multiple preview images.
In this embodiment, the movement of the image is extrapolated based on the movement of the preview images. According to
One or more distinctive regions in a preview image are selected, 630. By distinctive, one refers to a region that can be isolated from the background, such as regions with noticeable difference in contrast or brightness. Techniques for identifying such regions are well known in the art and may include segmentation, feature extraction and classification.
Each region is next matched with the corresponding region in each preview image, 632. In some cases not all regions may be accurately determined on all preview images, due to motion blurring or object obscurations, or the fact that they have moved outside the field of the preview image. The coordinates of each region is recorded, 634, for the preview images and, 636, for the final image.
Knowing the time intervals of the preview images, one can extrapolate the movement of the camera as a function of time. When the full resolution image 620 is acquired, the parameter that needs to be recorded is the time interval between the last captured preview image and the full resolution image, as well as the duration of the exposure of the full resolution image. Based on the tracking before the image was captured, 634, and the interval before and duration of the final image, the movement of single points or high contrast image features can be extrapolated, 640, to determine the detailed motion path of the camera.
This process is illustrated in
Tracking one dimension as a function of time, the same regions are illustrated in 930 where the regions are plotted based on their displacement 932, as a function of time interval 932. The objects 942, 944, 946948 and 950 correspond to the regions 912, 914, 916, 918 and 920.
The motion is calculated as the line 960. This can be done using statistical interpolation, spline or other curve interpolation based on discrete sampling points. For the final image, due to the fact that the curve may not be possible to calculate, it may also be done via extrapolation of the original curve, 960.
The region of the final acquired image is enlarged 970 for better viewing. In this plot, the blurred object 950 is depicted as 952, and the portion of the curve 690 is shown as 962. The time interval in this case, 935 is limited to the exact length in which the exposure is being taken, and the horizontal displacement 933, is the exact horizontal blur. Based on that, the interpolated curve, 952, within the exposure time interval 935, produces an extrapolation of the motion path 990.
Now, an extrapolation of the motion path may often be sufficient to yield a useful estimate of the PSF if the motion during the timeframe of the principle acquired image can be shown to have practically constant velocity and practically zero acceleration. As many cameras now incorporate sensitive gyroscopic sensors it may be feasible to determine such information and verify that a simple motion path analysis is adequate to estimate the motion blur PSF.
However when this is not the case (or where it is not possible to reliably make such a determination) it is still possible to estimate the detailed motion blur PSF from a knowledge of the time separation and duration of preview images and a knowledge of the motion path of the camera lens across an image scene. This process is illustrated in
Any PSF is an energy distribution function which can be represented by a convolution kernel k(x,y)→w where (x,y) is a location and w is the energy level at that location. The kernel k must satisfy the following energy conservation
∫∫k(x,y)dxdy=1,
constraint:
which states that energy is neither lost nor gained by the blurring operation. In order to define additional constraints that apply to motion blur PSFs we use a time parameterization of the PSF as a path function, f(t)→(x,y) and an energy function h(t)→w. Note that due to physical speed and acceleration constraints, f(t) should be continuous and at least twice differentiable, where f′(t) is the velocity of the (preview) image frame and f″ (t) is the acceleration at time t. By making the assumption that the scene radiance does not change during image acquisition, we get the additional constraint:
where [tstart, tend] is the acquisition interval for a (preview) image. This constraint states that the amount of energy which is integrated at any time interval is proportional to the length of the interval.
Given these constraints we can estimate a continuous motion blur PSF from discrete motion samples as illustrated in
Now in order to estimate the energy function h(t) along this path we need to determine the extent of each image frame along this interpolated path. This may be achieved using the motion centroid assumption described in Ben-Ezra et al and splitting the path into frames with a 1-D Voronoi tessellation as shown in
The resulting PSF determined by this process is illustrated in
The process may not be exact enough to distinguish the PSF based on a single region. Therefore, depending on the processing power and accuracy need, the step of finding the PSF may include some statistical pattern matching of multiple regions, determining multiple motion paths, thus creating higher pixel and potentially sub pixel accuracy for the PSF.
Advantageously, a determination may be made whether a threshold amount of camera motion blur has occurred during the capture of a digital image. The determination is made based on a comparison of a least two images acquired during or proximate to the exposure period of the captured image. The processing occurs so rapidly, either in the camera or in an external processing device, that the image blur determination occurs in “real time”. The photographer may be informed and/or a new image capture can take place on the spot due to this real time image blur determination feature. Preferably, the determination is made based on a calculated camera motion blur function, and further preferably, the image may be de-blurred based on the motion blur function, either in-camera or in an external processing device in real time or later on.
When either a preview or a full resolution image is acquired while the sensor is lit by the light source, the obtained calibration image will be uniform enough to allow construction of a map of dust related defects on the CCD sensor surface. Even if the CCD surface is not uniformly lit (as a consequence of an off-center LED) the non-uniformity is persistent, and can be thus accounted for in a map or a formula that can be stored (in a compressed form) in a lookup table for mapping a calibration image to a final dust map.
At any suitable time after an image has been acquired, it can be compared with a dust map to identify and/or correct defects in the image resulting from sensor defects. Where camera click-to-click interval is critical, this processing is likely to be performed in the background during periods of camera inactivity. It is also possible that the dust map could be used both to analyze and correct low resolution preview or post-view images as well as full resolution acquired images.
Detection and correction of digital image artifacts that appear in images acquired by compact digital still cameras due to the flash reflection on airborne dust particles (or small waterborne particles in underwater photography) that are placed out of focus. An exemplary method uses a preview image (or other reference image), taken without flash just before (or during or just after) the acquisition of the actual image.
Artifacts may appear in the digital image taken with flash. The overall shape may be semi-transparent round areas, encompassed by a brighter outer edge. Within the artifact area the original content of the image is shaded, as the “orbs” inside is matted and slightly textured.
The main approach of detecting dust artifacts is based on the extraction of edges from image luminance components and a search of circular frontiers, and/or thresholding of a color image in the luminance and saturation domains, and selecting regions that are relatively bright and slightly unsaturated. The computation of the local contrast (within the luminance component) could also be used.
A different approach may be used to detect orb artifacts. These could be obtained as a last preview image acquired of a scene. Since the preview is taken without flash, it offers a clean version of the scene, providing a baseline of the image content. Obtaining such a baseline image implies the color calibration of the preview image to the final image, based on a linear transformation of the RGB color channels. The transformation is to be obtained by a minimal mean square error matching of colors selected from the preview and the final images in uniform regions at the same spatial location. These same preview or other reference images may be used in other applications, e.g., to detect red eye in images. The concept of the preview with no flash that has no artifact and the one with flash that has artifact is similar. Airborne artifacts may also be detected and corrected using this process.
A digital image acquisition device 1100 is provided. An imaging optic and detector are for acquiring digital images including one or more preview, postview or other reference images and a main image. A face detector module 1110 is for analyzing the one or more preview or other reference images to ascertain information relating to candidate face regions therein. An image generating module 1120 is for programming the processor to generate a sub-sampled version of the main image. A first speed-optimized red-eye filter 1122 is for programming the processor to produce a first set of candidate red-eye regions in a sub-sampled version 1124 of the main image 1126 based on the candidate face region information provided by the face detector 1110.
An analysis-optimized red eye filter 1128 is for later analysis of a full resolution version of the main image based in part on the previous analysis. The one or more preview images may include a sub-sampled version of an acquired image.
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
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 1110 enable the speed optimized red-eye detector 1122 to be applied selectively to face regions 1130 where it is expected that a red-eye defect will be found. The speed optimized filter 1122 may include a pixel locator 1136, a shape analyzer 1138 and/or falsing and verification analysis 1140. Other image processing may be performed 1143 including other image processing described herein, e.g., blur processing, face analysis, quality analysis, foreground/background processing, chrominance or luminance enhancement, and/or various others.
As further illustrated at
A face detector may be first applied to an image prior to the application of a red-eye filter (see, 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.). Under normal circumstances, however, 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. An advantageous embodiment overcomes this disadvantage by employing a predictive output of a face tracker module 1110. 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 1110 within the main image acquisition chain.
Note that where multiple face candidate regions 1130 are tracked, then multiple predicted regions will have the speed-optimized red-eye filter 1122 applied.
After candidate eye-defect groupings have been determined by the segmentor 1210, a shape analyzer 1230 next applies a set of subfilters to determine if a particular candidate grouping is physically compatible with known eye-defects. Thus some basic geometric filters 1231 are first applied followed by one or more additional region compactness filters 1232, as well as one or more boundary continuity filters 1233. Further determining is then performed by one or more region size filters 1234, and a series of additional filters then determine if neighboring features exist which are indicative of eye shape 1235, eyebrows 1236 and iris regions 1237. In certain embodiments, the redeye filter may additionally use anthropometric data to assist in the accurate determining of such features.
Now the remaining candidate regions are passed to a falsing analyzer 1250 which includes a range of subfilter groups which eliminate candidate regions based on a range of criteria including lips filters 1251, face region filters 1252, skin texture filters 1253, eye-glint filters 1254, white region filters 1255, region uniformity filters 1256, skin color filters 1257, and eye-region falsing filters 1258. Further to these standard filters a number of specialized filters may also be included as part of the falsing analyzer 1250. In particular, a category of filter may be based on the use of acquired preview images, i.e., a preview image filter 1259, which can determine if a region was red prior to applying a flash. This particular preview filter 1259 may also be incorporated as part of the initial region determining process 1210, as described in co-pending U.S. application Ser. No. 10/919,226 from August, 2004 entitled “Red-Eye Filter Method And Apparatus”. An additional category of falsing filter employs image metadata determined from the camera acquisition process, as metadata based filters 1260. This category of filter can be particularly advantageous when combined with anthropometric data as described in PCT Application No. PCT/EP2004/008706. An additional category of filter may be a user confirmation filter 1261 which can be optionally used to request a final user input at the end of the detection process. This filter can be activated or disabled based on how sub-optimal the quality of an acquired image is, and the amount, if any, of user involvement that is desired not desired.
The pixel modifier 1270 works with the correction of confirmed redeye regions. Where an embodiment incorporates a face recognition module, then the pixel modifier 1270 may advantageously employ data from an in-camera known person database (not shown) to indicate aspects of the eye color of a person in the image. This can have great benefit as certain types of flash eye-defects in an image can destroy indications of original eye color.
In another embodiment, an additional component of a redeye filter 1200 may be a filter chain adapter 1280. This component 1280 is responsible for combining, and sequencing the subfilters of the redeye filter 1200 and for activating each filter with a set of input parameters corresponding to parameter list(s) 1282 supplied from an image compensation prefilter.
In further regard to
A method is provided for disqualifying an unsatisfactory scene as an image acquisition control for a camera. An analysis of the content of the captured image determines whether the image should be acquired or discarded. One example includes human faces. It may be determined whether an image is unsatisfactory based on whether the eyes are closed, partially closed or closing down or moving up during a blinking process. Alternatively, other non-desirable or unsatisfactory expressions or actions such as frowning, covering one's face with a hand or other occluding or shadowing of a facial feature or other key feature of a scene, or rotating the head away from the camera, etc., may be detected.
A present image of a scene is captured including a face region. One or more groups of pixels is/are identified corresponding to the region of interest, such as an eye region, or a mouth within the face region.
In the case of blink detection, it is determined whether the eye region is in a blinking process. If so, then the scene is disqualified as a candidate for a processed, permanent image while the eye is completing the blinking.
The present image may include a preview image, and the disqualifying may include delaying full resolution capture of an image of the scene. The delaying may include ending the disqualifying after a predetermined wait time.
A preview image may be used. This can provide an indication of a region of interest (ROI) where the eyes may be in the captured image. This provides a fast search in the final image of the mouth or eyes based on spatial information provided from the analysis of preview images.
The delaying may include predicting when the blinking will be completed and ending the disqualifying at approximately the predicted blink completion time. The predicting may include determining a point of a complete blinking process the scene is at, and calculating a remainder time for completion of the blinking. The calculating may include multiplying a fraction of the complete blinking process remaining times a predetermined complete blinking process duration. The predetermined complete blinking process duration may be programmed based on an average blinking process duration and/or may be determined based on estimating a time from a beginning of the blinking to the present and in view of the fraction representing the point of the complete blinking process the scene is at. The estimating may be based on analyzing a temporal capture parameter of one or more previous preview images relative to that of the present preview image. The fraction may be determined based on whether the eye that is blinking is opening or closing in the present preview image, and a degree to which the eye is open or shut.
The method may include determining whether the eye is blinking including determining a degree to which the eye is open or shut. The degree to which the eye is open or shut may be determined based on relatively analyzing the present preview image and one or more other preview images relatively acquired within less than a duration of a complete blinking process. The determining whether the eye is blinking may include determining a degree of blurriness of one or both eye lids. It may be determined what portion of a pupil, an iris, one or both eye lids or an eye white that is/are showing, or combinations thereof. A color analysis of the eye may be performed and differentiating pixels corresponding to an eye lid tone from pixels corresponding to an iris tone or pupil tone or eye white tone, or combinations thereof. A shape analysis of the eye may be performed and pixels differentiated as corresponding to an eye lid shape contrast with those corresponding to an iris shape or pupil shape or eye white shape, or combinations thereof.
The present image may include a full resolution capture image. The disqualifying may include foregoing further processing of the present image. It may be determined whether the eye is blinking including determining a degree to which the eye is open or shut. This may include relatively analyzing the present preview image and one or more other preview images relatively acquired within less than a duration of a complete blinking process. The determination of whether the eye is blinking may be based on determining a degree of blurriness of one or both eye lids.
The method may include determining a portion of a pupil, an iris, one or both eye lids or an eye white that is/are showing, or combinations thereof. A color analysis of the eye may be performed and pixels differentiated as corresponding to an eye lid tone contrasted with pixels corresponding to an iris tone or pupil tone or eye white tone, or combinations thereof. A shape analysis of the eye may be performed and pixels differentiated as corresponding to an eye lid shape contrasted with pixels corresponding to an iris shape or pupil shape or eye white shape, or combinations thereof.
The present image may include a full resolution capture image. The method may include assembling a combination image including pixels from the present image and open-eye pixels corresponding to the eye that is blinking from a different image. The different image may include a preview image or a post-view image or another full resolution image. The different image may include a lower resolution than the present image, and the assembling may include upsampling the different image or downsampling the present image, or a combination thereof. The method may also include aligning the present image and the different image, including matching an open-eye pixel region to a blinking eye region in the present image.
A further method is provided for automatically disqualifying an unsatisfactory scene as an image acquisition control of a camera. The method includes acquiring multiple preview images. Information is extracted from the multiple preview images. One or more changes is/are analyzed in the scene between individual images of the multiple temporary images. Based on the analyzing, it is determined whether one or more unsatisfactory features exist within the scene. The scene is disqualified as a candidate for a processed, permanent image while the one or more unsatisfactory features continue to exist.
One or more processor readable storage devices having processor readable code embodied thereon are also provided. The processor readable code is for programming one or more processors to perform a method of disqualifying an unsatisfactory scene as an image acquisition control for a camera, as set forth herein above or below. The processor may be embedded as part of the camera or external to the acquisition device. The acquisition device may be a hand held camera, a stationary camera, a video camera, a mobile phone equipped with a acquisition device, a hand held device equipped with a acquisition device, a kiosk booth, such as ones used for portraits, a dedicated portrait camera such as one used for security or identifications or generically, any image capture device.
An image may be generated as a combination of a present image, and a preview, post-view or other full resolution image. For example, the combination image may include a face region and some background imagery, wherein one or both eye regions, which are unsatisfactorily closed or partially closed in the present image, are replaced with one or both open eyes from the preview, post-view or other full resolution image. This feature may be combined with features presented in U.S. patent application Ser. No. 10/608,776. In the '776 application, a method of digital image processing using face detection is described. A group of pixels is identified that corresponds to a face within a digital image. A second group of pixels is identified that corresponds to another feature within the digital image. A re-compositioned image is determined including a new group of pixels for at least one of the face and the other feature.
In one embodiment, the camera will take the picture right after the subject completes a blinking process. The present system can be used to disqualify an image having a subject whose eyes are closed, and can take multiple images to prevent having no images that lack blinking. One of the images will likely have eyes open for each subject person, and the pictures can have a mixture of pixels combined into a single image with no eyes blinking. The camera may decide on the number of images to take based on the number of subjects in the image. The more people, the higher the likelihood of one person blinking, thus more images should be acquired. If it is acceptable for efficiency that a certain percentage of persons may be blinking in a large group shot, e.g., that is below a certain amount, e.g., 5%, then the number of images can be reduced. These threshold numbers and percentage tolerances can be selected by a camera product manufacturer, program developer, or user of a digital image acquisition apparatus. This information may be generated based on analysis of preview images. The preview image may also assist in determining the location of the eyes, so that the post processing analysis can be faster honing into the region of interest as determined by the preview analysis.
The present system sets a condition under which a picture will not be taken or will not be used or further processed after it has already been taken, and/or where an additional image or images will be taken to replace the unsatisfactory image. Thus, another advantageous feature of a system in accordance with a preferred embodiment is that it can correct an acquired blink region with a user's eye information from a preview or post-view image or another full resolution image. The present system preferably uses preview images, which generally have lower resolution and may be processed more quickly. The present system can also look for comparison of changes in facial features (e.g., of the eyes or mouth), between images as potentially triggering a disqualifying of a scene for an image capture. In such a case, the system may distinguish between a squint which is somewhat permanent or of longer duration during the session than a blink which is more a temporary state. The system may also through a comparison of multiple images determine the difference between eyes that are naturally narrow due to the location of the upper-eye-lid or the epicanthal fold, or based on a determined nationality of a subject person, e.g., distinguishing Asian from Caucasian eyes.
The determining a degree to which an eye may be open or shut is further provided at 1310 of
In an alternative embodiment, eye detection software may be activated inside a camera or other handheld or portable device, as part of an acquisition process. In this scenario, the eye detection portion may be implemented differently to support real time or near real time operation. Such implementation may include sub-sampling of the image, and weighted sampling to reduce the number of pixels on which the computations are performed. This embodiment is further described with reference to
At 1602, default values are loaded and/or determined for image attributes. Then at 1650, values of attributes, e.g., of one or more reference images, particularly preview images, are compared in captured regions to default or other reference image attribute values. Image capture may be delayed at 1660 while the attributes match default image attributes. Manual override instructions may be accepted at 1670. A photographer may take a picture at 1690.
At 1610, a camera captures a main or reference image. At 1620, the camera seeks eyes in the image. If no eye has been detected at 1630, then the process exits at 1632. Eyes may be manually added at 1634. If eyes are detected, then regions are marked or otherwise identified as eyes at 1640. False detected eye regions may be removed at 1644. At 1646, selected regions may be manually graded based on importance. Then, the process moves to 1650, 1660, 1670 and 1690 as introduced above.
In an alternative embodiment, the eye detection can then also make use of information provided from preview images to determine the location of the eyes in preview, thus expediting the analysis being performed in a smaller region on the final image.
In an alternative embodiment, the eye detection software may be activated inside the rendering device as part of the output process. In this scenario, the eye detection portion may be implemented either within the rendering device, using the captured image or using a single or plurality of preview images, or within an external driver to such device. This embodiment is further described with reference to
Referring to
An image is then digitally downloaded onto the device 2110. An image-detection process, preferably an eye or a face detection process, is applied to the downloaded image to seek eyes or faces in the image at 2120. If no images are found, the process terminates at 2132 and the device resumes its normal rendering process. Alternatively, or in addition to the automatic detection of 2130, the user can manually select 2134 detected eyes or faces or other features, using some interactive user interface mechanism, by utilizing, for example, a display on the device. Alternatively, the process can be implemented without a visual user interface by changing the sensitivity or threshold of the detection process.
When eyes or faces are detected at 2130, they are marked at 2140, and labeled. Detecting in 2130 may be more than a binary process of selecting whether an eye or a face is detected or not. It may also be designed as part of a process where each of the eyes or faces is given a weight based on size of the faces, location within the frame, other parameters described herein, etc., which define the importance of the eye or face in relation to other eyes or faces detected.
Alternatively, or in addition, the user can manually deselect regions at 2144 that were wrongly false detected as eyes or faces. Such selection can be due to the fact that an eye or face was false detected or when the photographer may wish to concentrate on one or two of the eyes or one of the faces as the main subject matter and not on other eyes or faces. Alternatively, 2146, the user may re-select, or emphasize one or more eyes or faces to indicate that these eyes or faces have a higher importance in the calculation relative to other eyes or faces. This process as defined in 1146, further defines the preferred identification process to be a continuous value one as opposed to a binary one. The process can be done utilizing a visual user interface or by adjusting the sensitivity of the detection process.
After the eyes or faces or other scene or image features are correctly isolated at 2140, their attributes are compared at 2150 to default values that were predefined in 2102. At least one preferred attribute that the process is looking for is blinking eyes. Such comparison will determine a potential transformation between the two images, in order to reach the same values. The image may be disqualified at 2160 if one or more eyes are determined to be blinking. The disqualifying may be overridden manually at 2170 or open eye pixels may be substituted from a different image. The transformation may be translated to the device rendering parameters, and the image at 2190 may be rendered. The process may include a plurality of images. In this case at 2180, the process repeats itself for each image prior to performing the rendering process. A practical example is the creation of a thumbnail or contact sheet which is a collection of low resolution images, on a single display instance.
A practical example is that if the eyes or face were too darkly captured, the rendering parameters may change the tone reproduction curve to lighten the eyes or face. Note that the image attributes are not necessarily only related to the eye or face regions, but can also be in relation to an overall tone reproduction.
Note that it may not be enough to just locate the different facial features, but such features may be compared to each other. For example, the color of the eyes may be compared to ensure that the pair of eyes originated from the same person.
Alternatively, the features of the face may be compared with preview images. Such usage may prevent a case where a double upper eyelid may be mistaken to a semi closed eye. If the software combines the mouth of 2180 with the eyes of 2260, 2240 as illustrated at
A digital image is acquired in raw format from an image sensor (CCD or CMOS) 3105 and an image subsampler 3112 generates a smaller copy of the main image. Most digital cameras already contain dedicated hardware subsystems to perform image subsampling, for example to provide preview images to a camera display. Typically the subsampled image is provided in bitmap format (RGB or YCC). In the meantime the normal image acquisition chain performs post-processing on the raw image 3110 which typically includes some luminance and color balancing. In certain digital imaging systems the subsampling may occur after such post-processing, or after certain post-processing filters are applied, but before the entire post-processing filter chain is completed.
The subsampled image is next passed to an integral image generator 3115 which creates an integral image from the subsampled image. This integral image is next passed to a fixed size face detector 3120. The face detector is applied to the full integral image, but as this is an integral image of a subsampled copy of the main image, the processing required by the face detector is proportionately reduced. If the subsample is one quarter of the main image, this implies the involved processing time will be only 25% of what would be involved for the full image.
This approach is particularly amenable to hardware embodiments where the subsampled image memory space can be scanned by a fixed size DMA window and digital logic to implement a Haar-feature classifier chain can be applied to this DMA window. However, this does not preclude the use of several sizes of classifier (in a software embodiment), or the use of multiple fixed-size classifiers (in a hardware embodiment). The key advantage is that a smaller integral image is calculated.
After application of the fast face detector 3280 any newly detected candidate face regions 3141 are passed onto a face tracking module 3111 where any face regions confirmed from previous analysis 3145 are merged with the new candidate face regions prior to being provided 3142 to a face tracker 3290.
In alternative embodiments, sub-sampled preview images for the camera display can be fed through a separate pipe than the images being fed to and supplied from the image sub-sampler 3112 and so every acquired image and its sub-sampled copies can be available both to the detector 3280 as well as for camera display.
In addition to periodically acquiring samples from a video stream, the process may also be applied to a single still image acquired by a digital camera. In this case, the stream for the face tracking comprises a stream of preview images and the final image in the series is the full resolution acquired image. In such a case, the face tracking information can be verified for the final image. In addition, the information such as coordinates or mask of the face may be stored with the final image. Such data for example may fit as an entry in the saved image header, for future post processing, whether in the acquisition device or at a later stage by an external device.
When the confidence factor is sufficiently high for a region, indicating that at least one face is in fact present in an image frame, the camera firmware runs a light-weight face recognition algorithm 3160 at the location of the face, for example a DCT-based algorithm. The face recognition algorithm 3160 uses a database 3161 preferably stored on the camera comprising personal identifiers and their associated face parameters.
In operation, the module 3160 collects identifiers over a series of frames. When the identifiers of a detected face tracked over a number of preview frames are predominantly of one particular person, that person is deemed by the recognition module to be present in the image. The identifier of the person, and the last known location of the face, may be stored either in the image (in a header) or in a separate file stored on the camera storage 3150. This storing of the person's ID can occur even when the recognition module 3160 fails for the immediately previous number of frames but for which a face region was still detected and tracked by the module 3111.
When the image is copied from camera storage to a display or permanent storage device such as a PC (not shown), the person's ID's are copied along with the images. Such devices are generally more capable of running a more robust face detection and recognition algorithm and then combining the results with the recognition results from the camera, giving more weight to recognition results from the robust face recognition (if any). The combined identification results are presented to the user, or if identification was not possible, the user is asked to enter the name of the person that was found. When the user rejects an identification or a new name is entered, the PC retrains its face print database and downloads the appropriate changes to the capture device for storage in the light-weight database 3161.
When multiple confirmed face regions 3145 are detected, the recognition module 3160 can detect and recognize multiple persons in the image.
Multiple images taken at different focal lengths may be used to simulate fill-flash (see 2003/0052991 to Stavely et al.). These multiple images may be of different sizes, and/or they may misaligned, and/or they may be captured outside of a main acquisition process, such that described embodiments regarding use of preview/postview images in a camera would be advantageous
A subsampled (or blurred) version of a main image may be used (see U.S. Pat. No. 6,249,315 to Holm), and according to described embodiments above subsampled preview images may be used as a reference image.
A scene may be “sensed” for regional brightness and range to subject prior to main image capture (see, e.g., 2001/0031142 to Whiteside). In accordance with certain embodiments, a preview image may be made available in a camera which is configured to perform the sensing.
Digital scene analysis may be performed for brightness adjustment (see, e.g., U.S. Pat. No. 5,724,456 to Boyack et al.). A system may be provided for processing a digital image signal representing an image that contains luminance and/or chrominance data. The luminance data may be mapped to a tonal reproduction capability of a destination application. An image signal may be acquired and the luminance data may be separated from the image signal. In accordance with certain embodiment, the image signal that is acquired may include a preview image or other reference image. The image signal may be converted and temporarily stored as a pixelated digital image. The luminance and chrominance data may be digitally processed.
Also, features have been described that relate to face tracking. In addition, a user may teach a camera by presenting the camera with a view of an object, such that the camera may then seek to control a tracking motor so as to keep the object in view, and/or a zoom motor such that the size of the object with respect to the overall image remains fixed at the region learned by the camera. In a further embodiment, a model of a person's head may be provided such that the camera can correctly identify the head, or others like it, within it's field of view. Thus the device seeks to maintain a lock on a target. Such may be performed mechanistically or according to software and/or firmware provided within the camera. Advantageously, multiple targets such as multiple faces or facial regions may be tracked and/or zoomed, and preferably digitally enhanced, e.g., in view of aesthetic considerations.
While an exemplary drawings and specific embodiments of the present invention have been described and illustrated, it is to be understood that that the scope of the present invention is not to be limited to the particular embodiments discussed. Thus, the embodiments shall be regarded as illustrative rather than restrictive, and it should be understood that variations may be made in those embodiments by workers skilled in the arts without departing from the scope of the present invention as set forth in the claims that follow and their structural and functional equivalents.
In addition, in methods that may be performed according to the claims below and/or preferred embodiments herein, 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, unless a particular ordering is expressly provided or understood by those skilled in the art as being necessary.
In addition, all references cited herein, as well as the background, invention summary, abstract and brief description of the drawings, are incorporated by reference into the detailed description of the preferred embodiments as disclosing alternative embodiments, including:
| Number | Name | Date | Kind |
|---|---|---|---|
| 4047187 | Mashimo et al. | Sep 1977 | A |
| 4168510 | Kaiser | Sep 1979 | A |
| 4317991 | Stauffer | Mar 1982 | A |
| 4367027 | Stauffer | Jan 1983 | A |
| RE31370 | Mashimo et al. | Sep 1983 | E |
| 4448510 | Murakoshi | May 1984 | A |
| 4469417 | Masunaga et al. | Sep 1984 | A |
| 4562346 | Hayashi et al. | Dec 1985 | A |
| 4638364 | Hiramatsu | Jan 1987 | A |
| 4673276 | Yoshida et al. | Jun 1987 | A |
| 4796043 | Izumi et al. | Jan 1989 | A |
| 4970663 | Bedell et al. | Nov 1990 | A |
| 4970683 | Harshaw et al. | Nov 1990 | A |
| 4975969 | Tal | Dec 1990 | A |
| 5008946 | Ando | Apr 1991 | A |
| 5018017 | Sasaki et al. | May 1991 | A |
| RE33682 | Hiramatsu | Sep 1991 | E |
| 5051770 | Cornuejols | Sep 1991 | A |
| 5061951 | Higashihara et al. | Oct 1991 | A |
| 5063603 | Burt | Nov 1991 | A |
| 5111231 | Tokunaga | May 1992 | A |
| 5150432 | Ueno et al. | Sep 1992 | A |
| 5161204 | Hutcheson et al. | Nov 1992 | A |
| 5164831 | Kuchta et al. | Nov 1992 | A |
| 5164992 | Turk et al. | Nov 1992 | A |
| 5227837 | Terashita | Jul 1993 | A |
| 5262820 | Tamai et al. | Nov 1993 | A |
| 5278923 | Nazarathy et al. | Jan 1994 | A |
| 5280530 | Trew et al. | Jan 1994 | A |
| 5291234 | Shindo et al. | Mar 1994 | A |
| 5305048 | Suzuki et al. | Apr 1994 | A |
| 5311240 | Wheeler | May 1994 | A |
| 5331544 | Lu et al. | Jul 1994 | A |
| 5353058 | Takei | Oct 1994 | A |
| 5384615 | Hsieh et al. | Jan 1995 | A |
| 5384912 | Ogrinc et al. | Jan 1995 | A |
| 5430809 | Tomitaka | Jul 1995 | A |
| 5432863 | Benati et al. | Jul 1995 | A |
| 5450504 | Calia | Sep 1995 | A |
| 5465308 | Hutcheson et al. | Nov 1995 | A |
| 5488429 | Kojima et al. | Jan 1996 | A |
| 5493409 | Maeda et al. | Feb 1996 | A |
| 5496106 | Anderson | Mar 1996 | A |
| 5534924 | Florant | Jul 1996 | A |
| 5543952 | Yonenaga et al. | Aug 1996 | A |
| 5576759 | Kawamura et al. | Nov 1996 | A |
| 5633678 | Parulski et al. | May 1997 | A |
| 5638136 | Kojima et al. | Jun 1997 | A |
| 5638139 | Clatanoff et al. | Jun 1997 | A |
| 5652669 | Liedenbaum | Jul 1997 | A |
| 5680481 | Prasad et al. | Oct 1997 | A |
| 5684509 | Hatanaka et al. | Nov 1997 | A |
| 5706362 | Yabe | Jan 1998 | A |
| 5710833 | Moghaddam et al. | Jan 1998 | A |
| 5715325 | Bang et al. | Feb 1998 | A |
| 5724456 | Boyack et al. | Mar 1998 | A |
| 5745668 | Poggio et al. | Apr 1998 | A |
| 5748764 | Benati et al. | May 1998 | A |
| 5764790 | Brunelli et al. | Jun 1998 | A |
| 5764803 | Jacquin et al. | Jun 1998 | A |
| 5771307 | Lu et al. | Jun 1998 | A |
| 5774129 | Poggio et al. | Jun 1998 | A |
| 5774591 | Black et al. | Jun 1998 | A |
| 5774747 | Ishihara et al. | Jun 1998 | A |
| 5774754 | Ootsuka | Jun 1998 | A |
| 5781650 | Lobo et al. | Jul 1998 | A |
| 5802208 | Podilchuk et al. | Sep 1998 | A |
| 5812193 | Tomitaka et al. | Sep 1998 | A |
| 5818975 | Goodwin et al. | Oct 1998 | A |
| 5835616 | Lobo et al. | Nov 1998 | A |
| 5842194 | Arbuckle | Nov 1998 | A |
| 5844573 | Poggio et al. | Dec 1998 | A |
| 5850470 | Kung et al. | Dec 1998 | A |
| 5852669 | Eleftheriadis et al. | Dec 1998 | A |
| 5852823 | De Bonet | Dec 1998 | A |
| RE36041 | Turk et al. | Jan 1999 | E |
| 5870138 | Smith et al. | Feb 1999 | A |
| 5905807 | Kado et al. | May 1999 | A |
| 5911139 | Jain et al. | Jun 1999 | A |
| 5912980 | Hunke | Jun 1999 | A |
| 5926218 | Smith | Jul 1999 | A |
| 5963670 | Lipson et al. | Oct 1999 | A |
| 5966549 | Hara et al. | Oct 1999 | A |
| 5978519 | Bollman et al. | Nov 1999 | A |
| 5990973 | Sakamoto | Nov 1999 | A |
| 5991456 | Rahman et al. | Nov 1999 | A |
| 6009209 | Acker et al. | Dec 1999 | A |
| 6016354 | Lin et al. | Jan 2000 | A |
| 6028960 | Graf et al. | Feb 2000 | A |
| 6035072 | Read | Mar 2000 | A |
| 6035074 | Fujimoto et al. | Mar 2000 | A |
| 6053268 | Yamada | Apr 2000 | A |
| 6061055 | Marks | May 2000 | A |
| 6072094 | Karady et al. | Jun 2000 | A |
| 6097470 | Buhr et al. | Aug 2000 | A |
| 6101271 | Yamashita et al. | Aug 2000 | A |
| 6108437 | Lin | Aug 2000 | A |
| 6115052 | Freeman et al. | Sep 2000 | A |
| 6128397 | Baluja et al. | Oct 2000 | A |
| 6128398 | Kuperstein et al. | Oct 2000 | A |
| 6134339 | Luo | Oct 2000 | A |
| 6139202 | Depatie et al. | Oct 2000 | A |
| 6148092 | Qian | Nov 2000 | A |
| 6151073 | Steinberg et al. | Nov 2000 | A |
| 6157677 | Martens et al. | Dec 2000 | A |
| 6173068 | Prokoski | Jan 2001 | B1 |
| 6184926 | Khosravi et al. | Feb 2001 | B1 |
| 6188777 | Darrell et al. | Feb 2001 | B1 |
| 6192149 | Eschbach et al. | Feb 2001 | B1 |
| 6240198 | Rehg et al. | May 2001 | B1 |
| 6246779 | Fukui et al. | Jun 2001 | B1 |
| 6246790 | Huang et al. | Jun 2001 | B1 |
| 6249315 | Holm | Jun 2001 | B1 |
| 6252976 | Schildkraut et al. | Jun 2001 | B1 |
| 6263113 | Abdel-Mottaleb et al. | Jul 2001 | B1 |
| 6268939 | Klassen et al. | Jul 2001 | B1 |
| 6278491 | Wang et al. | Aug 2001 | B1 |
| 6282317 | Luo et al. | Aug 2001 | B1 |
| 6285410 | Marni | Sep 2001 | B1 |
| 6292575 | Bortolussi et al. | Sep 2001 | B1 |
| 6301370 | Steffens et al. | Oct 2001 | B1 |
| 6301440 | Bolle et al. | Oct 2001 | B1 |
| 6332033 | Qian | Dec 2001 | B1 |
| 6334008 | Nakabayashi | Dec 2001 | B2 |
| 6349373 | Sitka et al. | Feb 2002 | B2 |
| 6351556 | Loui et al. | Feb 2002 | B1 |
| 6377702 | Cooper | Apr 2002 | B1 |
| 6393148 | Bhaskar | May 2002 | B1 |
| 6400830 | Christian et al. | Jun 2002 | B1 |
| 6404900 | Qian et al. | Jun 2002 | B1 |
| 6407777 | DeLuca | Jun 2002 | B1 |
| 6421468 | Ratnakar et al. | Jul 2002 | B1 |
| 6426779 | Noguchi et al. | Jul 2002 | B1 |
| 6434272 | Saarelma | Aug 2002 | B1 |
| 6438234 | Gisin et al. | Aug 2002 | B1 |
| 6438264 | Gallagher et al. | Aug 2002 | B1 |
| 6441854 | Fellegara et al. | Aug 2002 | B2 |
| 6445810 | Darrell et al. | Sep 2002 | B2 |
| 6456732 | Kimbell et al. | Sep 2002 | B1 |
| 6459436 | Kumada et al. | Oct 2002 | B1 |
| 6463163 | Kresch | Oct 2002 | B1 |
| 6473199 | Gilman et al. | Oct 2002 | B1 |
| 6483521 | Takahashi et al. | Nov 2002 | B1 |
| 6501857 | Gotsman et al. | Dec 2002 | B1 |
| 6502107 | Nishida | Dec 2002 | B1 |
| 6504942 | Hong et al. | Jan 2003 | B1 |
| 6504951 | Luo et al. | Jan 2003 | B1 |
| 6516154 | Parulski et al. | Feb 2003 | B1 |
| 6526156 | Black et al. | Feb 2003 | B1 |
| 6526161 | Yan | Feb 2003 | B1 |
| 6529630 | Kinjo | Mar 2003 | B1 |
| 6549641 | Ishikawa et al. | Apr 2003 | B2 |
| 6556708 | Christian et al. | Apr 2003 | B1 |
| 6560029 | Dobbie et al. | May 2003 | B1 |
| 6564225 | Brogliatti et al. | May 2003 | B1 |
| 6567983 | Shiimori | May 2003 | B1 |
| 6587119 | Anderson et al. | Jul 2003 | B1 |
| 6606398 | Cooper | Aug 2003 | B2 |
| 6633655 | Hong et al. | Oct 2003 | B1 |
| 6661907 | Ho et al. | Dec 2003 | B2 |
| 6697503 | Matsuo et al. | Feb 2004 | B2 |
| 6697504 | Tsai | Feb 2004 | B2 |
| 6700999 | Yang | Mar 2004 | B1 |
| 6704458 | Ford | Mar 2004 | B2 |
| 6714665 | Hanna et al. | Mar 2004 | B1 |
| 6747690 | Molgaard | Jun 2004 | B2 |
| 6754368 | Cohen | Jun 2004 | B1 |
| 6754389 | Dimitrova et al. | Jun 2004 | B1 |
| 6760465 | McVeigh et al. | Jul 2004 | B2 |
| 6760485 | Gilman et al. | Jul 2004 | B1 |
| 6765612 | Anderson et al. | Jul 2004 | B1 |
| 6778216 | Lin | Aug 2004 | B1 |
| 6791608 | Miyazawa | Sep 2004 | B1 |
| 6792135 | Toyama | Sep 2004 | B1 |
| 6792161 | Hashimoto et al. | Sep 2004 | B1 |
| 6798834 | Murakami et al. | Sep 2004 | B1 |
| 6801250 | Miyashita | Oct 2004 | B1 |
| 6801642 | Gorday et al. | Oct 2004 | B2 |
| 6816611 | Hagiwara et al. | Nov 2004 | B1 |
| 6829009 | Sugimoto | Dec 2004 | B2 |
| 6850274 | Silverbrook et al. | Feb 2005 | B1 |
| 6859565 | Baron | Feb 2005 | B2 |
| 6876755 | Taylor et al. | Apr 2005 | B1 |
| 6879705 | Tao et al. | Apr 2005 | B1 |
| 6900840 | Schinner et al. | May 2005 | B1 |
| 6937773 | Nozawa et al. | Aug 2005 | B1 |
| 6940545 | Ray et al. | Sep 2005 | B1 |
| 6940550 | Kitawaki et al. | Sep 2005 | B2 |
| 6940554 | Robins et al. | Sep 2005 | B2 |
| 6947601 | Aoki et al. | Sep 2005 | B2 |
| 6959109 | Moustafa | Oct 2005 | B2 |
| 6965684 | Chen et al. | Nov 2005 | B2 |
| 6967680 | Kagle et al. | Nov 2005 | B1 |
| 6977687 | Suh | Dec 2005 | B1 |
| 6980691 | Nesterov et al. | Dec 2005 | B2 |
| 6993157 | Oue et al. | Jan 2006 | B1 |
| 7003135 | Hsieh et al. | Feb 2006 | B2 |
| 7020337 | Viola et al. | Mar 2006 | B2 |
| 7027619 | Pavlidis et al. | Apr 2006 | B2 |
| 7027621 | Prokoski | Apr 2006 | B1 |
| 7027662 | Baron | Apr 2006 | B2 |
| 7031548 | Baggs | Apr 2006 | B2 |
| 7034848 | Sobol | Apr 2006 | B2 |
| 7035456 | Lestideau | Apr 2006 | B2 |
| 7035462 | White et al. | Apr 2006 | B2 |
| 7035467 | Nicponski | Apr 2006 | B2 |
| 7038709 | Verghese | May 2006 | B1 |
| 7038715 | Flinchbaugh | May 2006 | B1 |
| 7039222 | Simon et al. | May 2006 | B2 |
| 7042501 | Matama | May 2006 | B1 |
| 7042505 | DeLuca | May 2006 | B1 |
| 7042511 | Lin | May 2006 | B2 |
| 7043056 | Edwards et al. | May 2006 | B2 |
| 7043465 | Pirim | May 2006 | B2 |
| 7050607 | Li et al. | May 2006 | B2 |
| 7057653 | Kubo | Jun 2006 | B1 |
| 7061648 | Nakajima et al. | Jun 2006 | B2 |
| 7064776 | Sumi et al. | Jun 2006 | B2 |
| 7082212 | Liu et al. | Jul 2006 | B2 |
| 7099510 | Jones et al. | Aug 2006 | B2 |
| 7103227 | Raskar et al. | Sep 2006 | B2 |
| 7106374 | Bandera et al. | Sep 2006 | B1 |
| 7106887 | Kinjo | Sep 2006 | B2 |
| 7110569 | Brodsky et al. | Sep 2006 | B2 |
| 7110575 | Chen et al. | Sep 2006 | B2 |
| 7113641 | Eckes et al. | Sep 2006 | B1 |
| 7119838 | Zanzucchi et al. | Oct 2006 | B2 |
| 7120279 | Chen et al. | Oct 2006 | B2 |
| 7146026 | Russon et al. | Dec 2006 | B2 |
| 7151843 | Rui et al. | Dec 2006 | B2 |
| 7158680 | Pace | Jan 2007 | B2 |
| 7162076 | Liu | Jan 2007 | B2 |
| 7162101 | Itokawa et al. | Jan 2007 | B2 |
| 7171023 | Kim et al. | Jan 2007 | B2 |
| 7171025 | Rui et al. | Jan 2007 | B2 |
| 7190829 | Zhang et al. | Mar 2007 | B2 |
| 7194114 | Schneiderman | Mar 2007 | B2 |
| 7200249 | Okubo et al. | Apr 2007 | B2 |
| 7218759 | Ho et al. | May 2007 | B1 |
| 7227976 | Jung et al. | Jun 2007 | B1 |
| 7254257 | Kim et al. | Aug 2007 | B2 |
| 7269292 | Steinberg | Sep 2007 | B2 |
| 7274822 | Zhang et al. | Sep 2007 | B2 |
| 7274832 | Nicponski | Sep 2007 | B2 |
| 7289664 | Enomoto | Oct 2007 | B2 |
| 7295233 | Steinberg et al. | Nov 2007 | B2 |
| 7315630 | Steinberg et al. | Jan 2008 | B2 |
| 7315631 | Corcoran et al. | Jan 2008 | B1 |
| 7315658 | Steinberg et al. | Jan 2008 | B2 |
| 7317815 | Steinberg et al. | Jan 2008 | B2 |
| 7321670 | Yoon et al. | Jan 2008 | B2 |
| 7324670 | Kozakaya et al. | Jan 2008 | B2 |
| 7324671 | Li et al. | Jan 2008 | B2 |
| 7336821 | Ciuc et al. | Feb 2008 | B2 |
| 7336830 | Porter et al. | Feb 2008 | B2 |
| 7340110 | Lim et al. | Mar 2008 | B2 |
| 7352394 | Deluca et al. | Apr 2008 | B1 |
| 7362210 | Bazakos et al. | Apr 2008 | B2 |
| 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 |
| 7437998 | Burger et al. | Oct 2008 | B2 |
| 7440593 | Steinberg et al. | Oct 2008 | B1 |
| 7457477 | Petschnigg et al. | Nov 2008 | B2 |
| 7460695 | Steinberg et al. | Dec 2008 | B2 |
| 7469055 | Corcoran et al. | Dec 2008 | B2 |
| 7515740 | Corcoran et al. | Apr 2009 | B2 |
| 7536036 | Steinberg et al. | May 2009 | B2 |
| 7536060 | Steinberg et al. | May 2009 | B2 |
| 7536061 | Steinberg et al. | May 2009 | B2 |
| 7565030 | Steinberg et al. | Jul 2009 | B2 |
| 7587085 | Steinberg et al. | Sep 2009 | B2 |
| 7590305 | Steinberg et al. | Sep 2009 | B2 |
| 7620218 | Steinberg et al. | Nov 2009 | B2 |
| 7623177 | Nakamura et al. | Nov 2009 | B2 |
| 7636486 | Steinberg et al. | Dec 2009 | B2 |
| 7680342 | Steinberg et al. | Mar 2010 | B2 |
| 7683946 | Steinberg et al. | Mar 2010 | B2 |
| 7689009 | Corcoran et al. | Mar 2010 | B2 |
| 7702236 | Steinberg et al. | Apr 2010 | B2 |
| 7724950 | Umeda | May 2010 | B2 |
| 7738015 | Steinberg et al. | Jun 2010 | B2 |
| 7792335 | Steinberg et al. | Sep 2010 | B2 |
| 7868922 | Ciuc et al. | Jan 2011 | B2 |
| 7920723 | Nanu et al. | Apr 2011 | B2 |
| 7953251 | Steinberg et al. | May 2011 | B1 |
| 8055029 | Petrescu et al. | Nov 2011 | B2 |
| 8073286 | David et al. | Dec 2011 | B2 |
| 8135184 | Steinberg et al. | Mar 2012 | B2 |
| 8213737 | Steinberg et al. | Jul 2012 | B2 |
| 8320641 | Steinberg et al. | Nov 2012 | B2 |
| 8330831 | Steinberg et al. | Dec 2012 | B2 |
| 20010005222 | Yamaguchi | Jun 2001 | A1 |
| 20010015760 | Fellegara et al. | Aug 2001 | A1 |
| 20010028731 | Covell et al. | Oct 2001 | A1 |
| 20010031142 | Whiteside | Oct 2001 | A1 |
| 20010038712 | Loce et al. | Nov 2001 | A1 |
| 20010038714 | Masumoto et al. | Nov 2001 | A1 |
| 20020038076 | Sheehan et al. | Mar 2002 | A1 |
| 20020041717 | Murata et al. | Apr 2002 | A1 |
| 20020093577 | Kitawaki et al. | Jul 2002 | A1 |
| 20020102024 | Jones et al. | Aug 2002 | A1 |
| 20020105662 | Patton et al. | Aug 2002 | A1 |
| 20020106114 | Yan et al. | Aug 2002 | A1 |
| 20020114535 | Luo | Aug 2002 | A1 |
| 20020118287 | Grosvenor et al. | Aug 2002 | A1 |
| 20020136433 | Lin | Sep 2002 | A1 |
| 20020141640 | Kraft | Oct 2002 | A1 |
| 20020150662 | Dewis et al. | Oct 2002 | A1 |
| 20020168108 | Loui et al. | Nov 2002 | A1 |
| 20020172419 | Lin et al. | Nov 2002 | A1 |
| 20020176609 | Hsieh et al. | Nov 2002 | A1 |
| 20020176610 | Okazaki et al. | Nov 2002 | A1 |
| 20020176623 | Steinberg | Nov 2002 | A1 |
| 20020181801 | Needham et al. | Dec 2002 | A1 |
| 20020191861 | Cheatle | Dec 2002 | A1 |
| 20030012414 | Luo | Jan 2003 | A1 |
| 20030023974 | Dagtas et al. | Jan 2003 | A1 |
| 20030025812 | Slatter | Feb 2003 | A1 |
| 20030035573 | Duta et al. | Feb 2003 | A1 |
| 20030039402 | Robins et al. | Feb 2003 | A1 |
| 20030044070 | Fuersich et al. | Mar 2003 | A1 |
| 20030044177 | Oberhardt et al. | Mar 2003 | A1 |
| 20030048950 | Savakis et al. | Mar 2003 | A1 |
| 20030052991 | Stavely et al. | Mar 2003 | A1 |
| 20030059107 | Sun et al. | Mar 2003 | A1 |
| 20030059121 | Savakis et al. | Mar 2003 | A1 |
| 20030071908 | Sannoh et al. | Apr 2003 | A1 |
| 20030084065 | Lin et al. | May 2003 | A1 |
| 20030095197 | Wheeler et al. | May 2003 | A1 |
| 20030107649 | Flickner et al. | Jun 2003 | A1 |
| 20030118216 | Goldberg | Jun 2003 | A1 |
| 20030118249 | Edgar | Jun 2003 | A1 |
| 20030123713 | Geng | Jul 2003 | A1 |
| 20030123751 | Krishnamurthy et al. | Jul 2003 | A1 |
| 20030142209 | Yamazaki et al. | Jul 2003 | A1 |
| 20030142285 | Enomoto | Jul 2003 | A1 |
| 20030151674 | Lin | Aug 2003 | A1 |
| 20030169907 | Edwards et al. | Sep 2003 | A1 |
| 20030174773 | Comaniciu et al. | Sep 2003 | A1 |
| 20030193604 | Robins et al. | Oct 2003 | A1 |
| 20030202715 | Kinjo | Oct 2003 | A1 |
| 20040022435 | Ishida | Feb 2004 | A1 |
| 20040041121 | Yoshida et al. | Mar 2004 | A1 |
| 20040095359 | Simon et al. | May 2004 | A1 |
| 20040114904 | Sun et al. | Jun 2004 | A1 |
| 20040120391 | Lin et al. | Jun 2004 | A1 |
| 20040120399 | Kato | Jun 2004 | A1 |
| 20040125387 | Nagao et al. | Jul 2004 | A1 |
| 20040170397 | Ono | Sep 2004 | A1 |
| 20040175021 | Porter et al. | Sep 2004 | A1 |
| 20040179719 | Chen et al. | Sep 2004 | A1 |
| 20040184667 | Raskar et al. | Sep 2004 | A1 |
| 20040218832 | Luo et al. | Nov 2004 | A1 |
| 20040223063 | DeLuca et al. | Nov 2004 | A1 |
| 20040227978 | Enomoto | Nov 2004 | A1 |
| 20040228505 | Sugimoto | Nov 2004 | A1 |
| 20040233301 | Nakata et al. | Nov 2004 | A1 |
| 20040234156 | Watanabe et al. | Nov 2004 | A1 |
| 20040264744 | Zhang et al. | Dec 2004 | A1 |
| 20050007486 | Fujii et al. | Jan 2005 | A1 |
| 20050013479 | Xiao et al. | Jan 2005 | A1 |
| 20050013603 | Ichimasa | Jan 2005 | A1 |
| 20050018923 | Messina et al. | Jan 2005 | A1 |
| 20050031224 | Prilutsky et al. | Feb 2005 | A1 |
| 20050036044 | Funakura | Feb 2005 | A1 |
| 20050041121 | Steinberg et al. | Feb 2005 | A1 |
| 20050068446 | Steinberg et al. | Mar 2005 | A1 |
| 20050068452 | Steinberg et al. | Mar 2005 | A1 |
| 20050069208 | Morisada | Mar 2005 | A1 |
| 20050089218 | Chiba | Apr 2005 | A1 |
| 20050104848 | Yamaguchi et al. | May 2005 | A1 |
| 20050104997 | Nonaka | May 2005 | A1 |
| 20050105780 | Ioffe | May 2005 | A1 |
| 20050128518 | Tsue et al. | Jun 2005 | A1 |
| 20050140801 | Prilutsky et al. | Jun 2005 | A1 |
| 20050147278 | Rui et al. | Jul 2005 | A1 |
| 20050185054 | Edwards et al. | Aug 2005 | A1 |
| 20050195317 | Myoga | Sep 2005 | A1 |
| 20050232509 | Blake et al. | Oct 2005 | A1 |
| 20050265453 | Saito | Dec 2005 | A1 |
| 20050275721 | Ishii | Dec 2005 | A1 |
| 20060006077 | Mosher et al. | Jan 2006 | A1 |
| 20060008152 | Kumar et al. | Jan 2006 | A1 |
| 20060008171 | Petschnigg et al. | Jan 2006 | A1 |
| 20060008173 | Matsugu et al. | Jan 2006 | A1 |
| 20060018517 | Chen et al. | Jan 2006 | A1 |
| 20060029265 | Kim et al. | Feb 2006 | A1 |
| 20060039690 | Steinberg et al. | Feb 2006 | A1 |
| 20060050933 | Adam et al. | Mar 2006 | A1 |
| 20060056655 | Wen et al. | Mar 2006 | A1 |
| 20060083440 | Chen | Apr 2006 | A1 |
| 20060093212 | Steinberg et al. | May 2006 | A1 |
| 20060093213 | Steinberg et al. | May 2006 | A1 |
| 20060093238 | Steinberg et al. | May 2006 | A1 |
| 20060098875 | Sugimoto | May 2006 | A1 |
| 20060098890 | Steinberg et al. | May 2006 | A1 |
| 20060120599 | Steinberg et al. | Jun 2006 | A1 |
| 20060133699 | Widrow et al. | Jun 2006 | A1 |
| 20060140455 | Costache et al. | Jun 2006 | A1 |
| 20060147192 | Zhang et al. | Jul 2006 | A1 |
| 20060153472 | Sakata et al. | Jul 2006 | A1 |
| 20060177100 | Zhu et al. | Aug 2006 | A1 |
| 20060177131 | Porikli | Aug 2006 | A1 |
| 20060187305 | Trivedi et al. | Aug 2006 | A1 |
| 20060203106 | Lawrence et al. | Sep 2006 | A1 |
| 20060203107 | Steinberg et al. | Sep 2006 | A1 |
| 20060203108 | Steinberg et al. | Sep 2006 | A1 |
| 20060204034 | Steinberg et al. | Sep 2006 | A1 |
| 20060204037 | Watanabe et al. | Sep 2006 | A1 |
| 20060204054 | Steinberg et al. | Sep 2006 | A1 |
| 20060204055 | Steinberg et al. | Sep 2006 | A1 |
| 20060204056 | Steinberg et al. | Sep 2006 | A1 |
| 20060204057 | Steinberg | Sep 2006 | A1 |
| 20060204058 | Kim et al. | Sep 2006 | A1 |
| 20060204110 | Steinberg et al. | Sep 2006 | A1 |
| 20060210264 | Saga | Sep 2006 | A1 |
| 20060215924 | Steinberg et al. | Sep 2006 | A1 |
| 20060227997 | Au et al. | Oct 2006 | A1 |
| 20060257047 | Kameyama et al. | Nov 2006 | A1 |
| 20060268150 | Kameyama et al. | Nov 2006 | A1 |
| 20060269270 | Yoda et al. | Nov 2006 | A1 |
| 20060280380 | Li | Dec 2006 | A1 |
| 20060285754 | Steinberg et al. | Dec 2006 | A1 |
| 20060291739 | Li et al. | Dec 2006 | A1 |
| 20070018980 | Berteig et al. | Jan 2007 | A1 |
| 20070035628 | Kanai | Feb 2007 | A1 |
| 20070036438 | Thakur | Feb 2007 | A1 |
| 20070047768 | Gordon et al. | Mar 2007 | A1 |
| 20070053614 | Mori et al. | Mar 2007 | A1 |
| 20070070440 | Li et al. | Mar 2007 | A1 |
| 20070071347 | Li et al. | Mar 2007 | A1 |
| 20070091203 | Peker et al. | Apr 2007 | A1 |
| 20070098303 | Gallagher et al. | May 2007 | A1 |
| 20070110305 | Corcoran et al. | May 2007 | A1 |
| 20070110417 | Itokawa | May 2007 | A1 |
| 20070116379 | Corcoran et al. | May 2007 | A1 |
| 20070116380 | Ciuc et al. | May 2007 | A1 |
| 20070122056 | Steinberg et al. | May 2007 | A1 |
| 20070154095 | Cao et al. | Jul 2007 | A1 |
| 20070154096 | Cao et al. | Jul 2007 | A1 |
| 20070160307 | Steinberg et al. | Jul 2007 | A1 |
| 20070189606 | Ciuc et al. | Aug 2007 | A1 |
| 20070189748 | Drimbarean et al. | Aug 2007 | A1 |
| 20070189757 | Steinberg et al. | Aug 2007 | A1 |
| 20070195174 | Oren | Aug 2007 | A1 |
| 20070201724 | Steinberg et al. | Aug 2007 | A1 |
| 20070201725 | Steinberg et al. | Aug 2007 | A1 |
| 20070201726 | Steinberg et al. | Aug 2007 | A1 |
| 20070263104 | Deluca et al. | Nov 2007 | A1 |
| 20070273504 | Tran | Nov 2007 | A1 |
| 20070296833 | Corcoran et al. | Dec 2007 | A1 |
| 20080002060 | Deluca et al. | Jan 2008 | A1 |
| 20080013798 | Ionita et al. | Jan 2008 | A1 |
| 20080013799 | Steinberg et al. | Jan 2008 | A1 |
| 20080013800 | Steinberg et al. | Jan 2008 | A1 |
| 20080019565 | Steinberg | Jan 2008 | A1 |
| 20080037827 | Corcoran et al. | Feb 2008 | A1 |
| 20080037838 | Ianculescu et al. | Feb 2008 | A1 |
| 20080037839 | Corcoran et al. | Feb 2008 | A1 |
| 20080037840 | Steinberg et al. | Feb 2008 | A1 |
| 20080043121 | Prilutsky et al. | Feb 2008 | A1 |
| 20080043122 | Steinberg et al. | Feb 2008 | A1 |
| 20080049970 | Ciuc et al. | Feb 2008 | A1 |
| 20080055433 | Steinberg et al. | Mar 2008 | A1 |
| 20080075385 | David et al. | Mar 2008 | A1 |
| 20080144966 | Steinberg et al. | Jun 2008 | A1 |
| 20080175481 | Petrescu et al. | Jul 2008 | A1 |
| 20080175574 | Tomita et al. | Jul 2008 | A1 |
| 20080186389 | DeLuca et al. | Aug 2008 | A1 |
| 20080205712 | Ionita et al. | Aug 2008 | A1 |
| 20080219517 | Blonk et al. | Sep 2008 | A1 |
| 20080240555 | Nanu et al. | Oct 2008 | A1 |
| 20080267461 | Ianculescu et al. | Oct 2008 | A1 |
| 20080316327 | Steinberg et al. | Dec 2008 | A1 |
| 20080316328 | Steinberg et al. | Dec 2008 | A1 |
| 20080317339 | Steinberg et al. | Dec 2008 | A1 |
| 20080317357 | Steinberg et al. | Dec 2008 | A1 |
| 20080317379 | Steinberg et al. | Dec 2008 | A1 |
| 20090002514 | Steinberg et al. | Jan 2009 | A1 |
| 20090003652 | Steinberg et al. | Jan 2009 | A1 |
| 20090003708 | Steinberg et al. | Jan 2009 | A1 |
| 20090052749 | Steinberg et al. | Feb 2009 | A1 |
| 20090087030 | Steinberg et al. | Apr 2009 | A1 |
| 20090087042 | Steinberg et al. | Apr 2009 | A1 |
| 20100053362 | Nanu et al. | Mar 2010 | A1 |
| 20100060727 | Steinberg et al. | Mar 2010 | A1 |
| 20100231727 | Steinberg et al. | Sep 2010 | A1 |
| 20100259622 | Steinberg et al. | Oct 2010 | A1 |
| 20110110567 | Jiang | May 2011 | A1 |
| 20110122297 | Steinberg et al. | May 2011 | A1 |
| 20110221936 | Steinberg et al. | Sep 2011 | A1 |
| 20120069198 | Steinberg et al. | Mar 2012 | A1 |
| 20120069222 | Steinberg et al. | Mar 2012 | A1 |
| Number | Date | Country |
|---|---|---|
| 578508 | Jan 1994 | EP |
| 984386 | Mar 2000 | EP |
| 1128316 | Aug 2001 | EP |
| 1398733 | Mar 2004 | EP |
| 1478169 | Nov 2004 | EP |
| 1626569 | Feb 2006 | EP |
| 1785914 | May 2007 | EP |
| 1668886 | Sep 2008 | EP |
| 2370438 | Jun 2002 | GB |
| 5260360 | Oct 1993 | JP |
| 2000050062 | Feb 2000 | JP |
| 2003030647 | Jan 2003 | JP |
| 2004-327485 | Nov 2004 | JP |
| 25164475 | Jun 2005 | JP |
| 26005662 | Jan 2006 | JP |
| 26254358 | Sep 2006 | JP |
| WO-0133497 | May 2001 | WO |
| WO-02052835 | Jul 2002 | WO |
| 03019473 | Mar 2003 | WO |
| WO-03028377 | Apr 2003 | WO |
| 2005041558 | May 2005 | WO |
| 2005109853 | Nov 2005 | WO |
| WO-2006045441 | May 2006 | WO |
| 2007078682 | Jul 2007 | WO |
| 2007093199 | Aug 2007 | WO |
| 2007095556 | Aug 2007 | WO |
| WO-2007095477 | Aug 2007 | WO |
| WO 2007095483 | Aug 2007 | WO |
| WO-2007095553 | Aug 2007 | WO |
| 2007095556 | Dec 2007 | WO |
| 2007142621 | Dec 2007 | WO |
| WO-2007142621 | Dec 2007 | WO |
| 2008022005 | Feb 2008 | WO |
| WO-2008015586 | Feb 2008 | WO |
| WO-2008017343 | Feb 2008 | WO |
| WO-2008018887 | Feb 2008 | WO |
| WO-2008023280 | Feb 2008 | WO |
| 2007093199 | Mar 2008 | WO |
| 2008070122 | Jun 2008 | WO |
| 2007095556 | Jul 2008 | WO |
| 2008102205 | Aug 2008 | WO |
| WO-2008104549 | Sep 2008 | WO |
| 2008157792 | Dec 2008 | WO |
| 2008022005 | Dec 2008 | WO |
| 2008102205 | Apr 2009 | WO |
| Entry |
|---|
| Aoki, Hiroyuki et al., “An Image Storage System Using Complex-Valued Associative Memories. Abstract printed from http://csdl.computer.org/comp/proceedings/icpr/2000/0750/02/07502626abs.htm”, International Conference on Pattern Recognition (ICPR '00), 2000, vol. 2. |
| Batur et al., “Adaptive Active Appearance Models”, IEEE Transactions on Image Processing, 2005, pp. 1707-1721, vol. 14—Issue 11. |
| Beraldin, J.A. et al., “Object Model Creation from Multiple Range Images: Acquisition, Calibration, Model Building and Verification. Abstract primed from http://csdl.computer.org/comp/proccedings/nrc/1997/7943/00/79430326abs.htm”, International Conference on Recent Advances in 3-D Digital Imaging and Modeling, 1997. |
| Beymer, David, “Pose-Invariant face Recognition Using Real and Virtual Views, A.I. Technical Report No. 1574”, Massachusetts Institute of Technology Artificial Intelligence Laboratory, 1996, pp. 1-176. |
| Buenaposada, J.. “Efficiently estimating 1-3,16 facial expression and illumination in appearance—based tracking. Retrieved from the Internet: URL:http://www.bmva.ac.uk/bmvc/2006/ [retrieved on Sep. 1, 2008]”, Proc. British machine vision conference. 2006. |
| Chang, T., “Texture Analysis and Classification with Tree-Structured Wavelet Transform”, IEEE Transactions on Image Processing, 1993, pp. 429-441, vol. 2—Issue 4. |
| Cootes T. et al., “Modeling Facial Shape and Appearance, S. Li and K. K. Jain (EDS.): “Handbook of face recognition”, XP002494037”, 2005, Chapter 3, Springer. |
| Cootes, T.F. et al., “A comparative evaluation of active appearance model algorithms”, Proc. 9th British Machine Vison Conference. British Machine Vision Association, 1998, pp. 680-689. |
| Cootes. T.F. et al., “On representing edge structure for model matching”, Proc. IEEE Computer Vision and Pattern Recognition, 2001, pp. 1114-1119. |
| Crowley, J. et al., “Multi-modal tracking of faces for video communication, http://citeseer.ist.psu.edu/crowley97multimodal.html”, in Computer Vision and Patent Recognition, 1997. |
| Dalton, John, “Digital Cameras and Electronic Color Image Acquisition, Abstract printed from http://csdl.computcr.org/comp/proceedings/compcon/1996/7414/00/74140431abs.htm”, C0MPC0N Spring '96—41st IEEE International Conference, 1996. |
| Deng, Ya-Feng et al., “Fast and Robust face detection in video, http://rlinks2.dialog.com/NASApp/ChannelWEB/DialogProServlet?ChName=engineering”, International Conference on Machine Learning and Cybernetics, 2005. |
| Donner, Rene et al., “Fast Active Appearance Model Search Using Canonical Correlation Analysis”, IEEE Transactions on Pattern Analysis and Machine Intelligence, 2006, pp. 1690-1694. vol. 28—Issue 10. |
| Edwards, G.J. et al., “Advances in active appearance models”. International Conference on Computer Vision (ICCV'99), 1999, pp. 137-142. |
| Edwards, G.J. et al.. “Learning to identify and track faces in image sequences, Automatic Face and Gesture Recognition”, IEEE Comput. Soc, 1998, pp. 260-265. |
| Examination Report for European patent application No. 05792584.4, dated May 13, 2008, 8 pgs. |
| Feraud, R. et al., “A Fast and Accurate Face Detector Based on Neural Networks”, IEEE Transactions on Pattern Analysis and Machine Intelligence, 2001, pp. 42-53, vol. 23—Issue 1. |
| Fernandez, Anna T. et al., “Synthetic Elevation Beamforming and Image Acquisition Capabilities Using an 8x 128 1.75D Array, Abstract Printed from http://www.ieee-uffc.org/archive/uffc/trans/toc/abs/03/10310040.htm”, The Technical Institute of Electrical and Electronics Engineers. |
| Froba, B. et al., “Face detection with the modified census transform”. Proceedings of the Sixth IEEE International Conference on Automatic Face and Gesture Recognition, 2004, pp. 91-96. |
| Froba, B. et al., “Real time face detection, Kauai, Hawai Retrieved from the Internet:URL:http://www.embassi.de/publi/veroeffent/Froeba.pdf [retrieved on Oct. 23, 2007]”, Dept. of Applied Electronics, Proceedings of lasted “Signal and Image Processing”, 2002, pp. 1-6. |
| Gangaputra, Sachin et al., “A Unified Stochastic Model for Detecting and Tracking Faces, http://portal.acm.org/citation.cfm?id=1068818andcoll=GUIDEanddl=GUIDEandCF-ID=6809268andCFTOKEN=82843223”, Proceedings of the the 2nd Canadian Conference on Computer and Robot Vision (CRV 2005). 2005, pp. 306-313, vol. 00, IEEE Computer Society. |
| Garnaoui, H.H. et al., “Visual Masking and the Design of Magnetic Resonance Image Acquisition, Abstract printed from http://csdl.computer.org/comp/proceedings/icip/1995/7310/01/73100625abs.htm”. International Conference on Image Processing, 1995, vol. 1. |
| Gaubatz, Matthew et al., “Automatic Red-Eye Detection and Correction”, IEEE ICIP, Proceedings 2002 Intl Conf on Image Processing, 2002, pp. 1-804-1-807, vol. 2—Issue 3. |
| Gerbrands, J., “On the Relationships Between SVD, KLT, and PCA”, Pattern Recognition, 1981, pp. 375-381, vol. 14, Nos. 1-6. |
| Goodall, C.. “Procrustes Methods in the Statistical Analysis of Shape, Stable URL: http://www.jstor.org/stable/2345744”, Journal of the Royal Statistical Society. Series B (Methodological), 1991, pp. 285-339, vol. 53—Issue 2, Blackwell Publishing for the Royal Statistical Society. |
| Hayashi, S. et al., “A Detection Technique for Degraded Face Images”, Conference on Computer Vision and Pattern Recognition, 2006, pp. 1506 1512, vol. 2, IEEE Computer Society. |
| Heisele, B. el al., “Hierarchical Classification and Feature Reduction for Fast Face Detection with Support Vector Machines”, Pattern Rec., 2003, pp. 2007-2017, vol. 36—Issue 9, Elsevier. |
| Hou, Xinwen et al., “Direct Appearance Models”, IEEE, 2001, pp. I-828-I-833. |
| Hu, Wen-Chen et al., “A Line String Image Representation for Image Storage and Retrieval, Abstract printed from http://csdl.computer.oro/comp/proceedings/icmcs/1997/7819/00/7819/00/78190434abs.htm”, International Conference on Multimedia Computing and systems, 1997. |
| Huang, J. et al., “Detection of human faces using decision trees, http://doLieeecomputersociety.org/10.1109/Recognition”, 2nd International Conference on Automatic Face and Gesture Recognition (FG '96), IEEE Xplore, 2001, p. 248. |
| Huber, Reinhold et al., “Adaptive Aperture Control for Image Acquisition, Abstract printed from http://csdl.computer.org/comp/proccedings/wacv/2002/1858/00/18580320abs.htm.”, Sixth IEEE Workshop on Applicatons of Computer Vision, 2002. |
| Isukapalli, Ramana et al., “Learning a dynamic classification method to detect faces and identify facial expression, http://rlinks2.dialog.com/NASApp/ChannelWEB/DialogProServlet?ChName=engineering”, International Workshop on Analysis and Modelling of Faces and Gestures, AMFG 2005, in Lecture Notes in Computer Science, 2005. vol. 3723. |
| Jebara, Tony S. et al., “3D Pose Estimation and Normalization for Face Recognition. A Thesis submitted to the Faculty of Graduate Studies and Research in Partial fulfillment of the requirements of the degree of Bachelor of Engineering”, Dept of EE, 1996, pp. 1-121, McGill University. |
| Jones, M et al., “Fast multi-view face detection, http://www.merl.com/papers/docs/TR2003-96.pdf”, Mitsubishi Electric Research Lab, 2003, 10 pgs. |
| Kang, Sing Bing et al., “A Multibaseline Stereo System with Active Illumination and Real-Time Image Acquisition, Abstract printed from http://csdl.computer.org/comp/proccedings/iccv/1995/7042/00/70420088abs.htm”, Fifth International Conference on Computer Vision, 1995. |
| Kita, Nobuyuki et al., “Archiving Technology for Plant Inspection Images Captured by Mobile Active Cameras—4D Visible Memory, Abstract printed from http://csdl.computer.org/comp/proceedings/3dpvt/2002/1521/00/15210208abs.htm”, 1st International Symposium on 3D Data Processing Visualization and Transmission (3DPVT '02), 2002. |
| Kouzani, A.Z., “Illumination-Effects Compensation in Facial Images Systems”, Man and Cybernetics, IEEE SMC '99 Conference Proceedings, 1999, pp. VI-840-VI-844, vol. 6. |
| Kozubek, Michal et al., “Automated Multi-view 3D Image Acquisition in Human Genome Research, Abstract printed from http://csdl.computer.org/comp/proceedings/3pvt/2002/1521/00/15210091abs.htm”, 1st International Symposium on 3D Data Processing Visualization and Transmission (3DPVT '02), 2002. |
| Krishnan, Arun, “Panoramic Image Acquisition, Abstract printed from http://csdl.computer.org/comp/proceedings/cvpr/1996/7258/00/72580379abs.htm”, Conference on Computer Vision and Pattern Recognition (CVPR '96), 1996. |
| Lai, J.H. et al., “Face recognition using holistic Fourier in variant features, http://digitalimaging.inf.brad.ac.uk/publication/pr34-1.pdf.”, Pattern Recognition, 2001, pp. 95-109. vol. 34. |
| Lei et al., “A CBIR Method Based on Color-Spatial Feature”, IEEE 10th Ann. Int. Conf., 1999. |
| Lienhart, R. et al., “A Detector Tree of Boosted Classifiers for Real-Time Object Detection and Tracking”, Proceedings of the 2003 International Conference on Multimedia and Expo, 2003, pp. 277-280, vol. 1, IEEE Computer Society. |
| Matkovic, Kresimir et al., “The 3D Wunderkammer an Indexing by Placing Approach to the Image Storage and Retrieval, Abstract printed from http://csdl.computer.org/comp/proceedings/tocg/2003/1942/00/19420034abs.htm”, Theory and Practice of Computer Graphics, 2003, University of Birmingham. |
| Matthews, I. et al., “Active appearance models revisited, Retrieved from http://www.d.cmu.edu/pub—files/pub4/matthews—iain—2004—2/matthews—iain—2004—2.pdf”. International Journal of Computer Vision, 2004, pp. 135-164. vol. 60—Issue 2. |
| Mekuz, N. et al., “Adaptive Step Size Window Matching for Detection”, Proceedings of the 18th International Conference on Pattern Recognition, 2006, pp. 259-262, vol. 2. |
| Mitra. S. et al., “Gaussian Mixture Models Based on the Frequency Spectra for Human Identification and Illumination Classification”, Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies, 2005, pp. 245-250. |
| Moghaddam, Baback et al., “Bayesian Modeling of Facial Similarity, http://citeseer.ist.psu.edu/article/moghaddam98bayesian.html”, Advances in Neural Information Processing Systems (NIPS 1998), 1998, pp. 910-916. |
| Nayak et al., “Automatic illumination correction for scene enhancement and objection tracking, XP005600656, ISSN: 0262-8856”, Image and Vision Comp, 2006, pp. 949-959, vol. 24—Issue 9. |
| Nordstrom, M.M. et al., “The IMM face database an annotated-dataset of 240 face images, http://www2.imm.dtu.dk/pubdb/p.php?3160”, Informatics and Mathematical Modelling, 2004. |
| Ohta, Y-I et al., “Color Information for Region Segmentation, XP008026458”, Computer Graphics and Image Processing, 1980, pp. 222-241, vol. 13—Issue 3, Academic Press. |
| Park, Daechul et al., “Lenticular Stereoscopic imaging and Displaying Techniques with no Special Glasses, Abstract printed from http://csdl.computer.org/comp/proceedings/icip/1995/7310/03/73103137abs.htm”, International Conference on Image Processing, 1995, vol. 3. |
| PCT International Preliminary Report on Patentability (IPRP) for PCT Application PCT/EP2005/011010, dated Jan. 23, 2007, 18 pages. |
| PCT International Search Report and Written Opinion of the International Searching Authority, or the Declaration, for PCT Application No. PCT/US2006/021393, filed Jun. 2, 2006, paper dated Mar. 29, 2007, 12 pgs. |
| PCT International Search Report and Written Opinion of the International Searching Authority, or the Declaration, for PCT Application No. PCT/US2006/060392, filed Oct. 31, 2006, paper dated Sep. 19, 2008, 9 pgs. |
| PCT Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for PCT Application No. PCT/US2006/032959, dated Mar. 6, 2007, 8 pages. |
| PCT Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for PCT/EP/2005/011010, dated Jan. 23, 2006, 14 pages. |
| PCT Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, for PCT Application No. PCT/EP2007/005330, filed Jun. 18, 2007, paper dated Sep. 28, 2007, 11 pages. |
| PCT Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, for PCT Application No. PCT/EP2007/006540, Nov. 7, 2008, 6 pgs. |
| PCT Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, for PCT Application No. PCT/EP2007/006540, Nov. 8, 2007, 11 pgs. |
| PCT Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, for PCT Application No. PCT/EP2007/009763, paper dated Jun. 17, 2008, 11 pages. |
| PCT Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, for PCT Application No. PCT/EP2008/001510, dated May 29, 2008, 13 pages. |
| PCT Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, for PCT Application No. PCT/EP2008/052329, dated Sep. 15, 2008, 12 pages. |
| PCT Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, for PCT Application No. PCT/IB2007/003724, dated Aug. 28, 2008, 9 pages. |
| PCT Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, for PCT Application No. PCT/US2008/067746, dated Sep. 10, 2008, 8 pages. |
| Romdhani, S. et al., “Face Identification by Fitting a 3D Morphable Model using linear Shape and Texture Error Functions, XP003018283”, European Conference on Computer Vision, 2002, pp. 1-15. |
| Roux, Sebastien et al., “Embedded Convolutional Face Finder,Multimedia and Expo, XP031032828, ISBN: 978-1-4244-0366-0”, IEEE International Conference on IEEE, 2006, pp. 285-288. |
| Rowley, Henry A. et al., “Neural network-based face detection. ISSN: 0162-8828, DOI: 10.1109/34.655647, Posted online: Aug. 6, 2002. http://ieeexplore.ieee.org/xpl/freeabs—all.jsp?arnnumber-655647andisnumber-14286”, IEEE Transactions on Pattern Analysis and Machine Intelligence, 1998, pp. 23-38, p. 92. vol. 20—Issue 1. |
| Ryu et al., “Coarse-to-Fine Classification for Image-Based Face Detection”, 1999, p. 92, subsection 8.3, Chapter 6, Carnegie Melon Univ. |
| Ryu, Hanjin et al., “Coarse-to-Fine Classification for Image-Based Face Detection”, Image and video retrieval lecture notes in Computer science, 2006, pp. 291-299. vol. 4071, Springer-Verlag. |
| Sahba, F. et al., “Filter Fusion for Image Enhancement Using Reinforcement Learning, XP010654204, ISBN: 0-7803-7781-8”, Canadian Conference on Electrical and computer Engineering, 2003, pp. 847-850, vol. 3. |
| Shand, M., “Flexible Image Acquisition Using Reconfigurable Hardware. Abstract printed from http://csdl.computer.org/comp/proceedings/fccm/1995/7086/00/70860125abs.htm”, IEEE Symposium of FPGA's for Custom Computing Machines (FCCM '95), 1995. |
| Sharma, G. et al.. “Digital color imaging, [Online]. Available: citeseer.ist.psu.edu/sharma97digital.html”. IEEE Transactions on Image Processing, 1997, pp. 901-932, vol. 6—Issue 7. |
| Shock, D. et al., “Comparison of Rural Remote Site Production of Digital Images Employing a film Digitizer or a Computed Radiography (CR) System, Abstract printed from http://csdl/computer.org/comp/proccedings/imac/1995/7560/00/75600071abs.htm”, 4th International Conference on Image Management and Communication ( IMAC '95), 1995. |
| Sim, T. et al., “The CMU Pose, Illumination, and Expression (PIE) Database of Human Faces Robotics Institute, Tech. Report, CMU-RI-TR-01-02”, 2001, 18 pgs, Carnegie Mellon University. |
| Skocaj, Danijel, “Range Image Acquisition of Objects with Non-Uniform Albedo Using Structured Light Range Sensor, Abstract printed from http://csdl.computer.org/comp/proceedings/icpr/2000/0750/01/07501778abs.htm”, International Conference on Pattern Recognition (ICPR '00), 2000, vol. 1. |
| Smeraldi, F. et al., “Facial feature detection by saccadic exploration of the Gabor decomposition, XP010586874”, Image Processing, ICIP 98. Proceedings International Conference on Chicago, IL, USA, IEEE Comput. Soc. 1998, pp. 163-167, vol. 3. |
| Song, Hong et al., “Face detection and segmentation for video surveillance Language: Chinese. http://rlinks2.dialog.com/NASApp/ChannelWEB/DialogProServlet?ChName=engineering”. Binggong Xuebao/Acta Armamentarii, 2006, pp. 252-257, vol. 27—Issue 2. |
| Soriano, M. et al., “Making Saturated Facial Images Useful Again, XP002325961, ISSN: 0277-786X”, Proceedings of The Spie, 1999, pp. 113-121, vol. 3826. |
| Stegmann, M.B. et al., “A flexible appearance modelling environment, Available: http://www2.imm.dru.dk/pubdb/p.php?1918”, IEEE Transactions on Medical Imaging, 2003, pp. 1319-1331, vol. 22—Issue 10. |
| Stegmann, M.B. et al., “Multi-band modelling of appearance. XP009104697”, Image and Vision Computing, 2003, pp. 61-67, vol. 21—Issue 1. |
| Stricker et al., “Similarity of color images”, SPIE Proc, 1995, pp. 1-12, vol. 2420. |
| Sublett, J.W. et al., “Design and Implementation of a Digital Teleultrasound System for Real-Time Remote Diagnosis. Abstract printed from http://csdl.computer.org/comp/proceedings/cbms/1995/7117/00/71170292abs.htm”, Eight Annual IEEE Symposium on Computer-Based Medical Systems (CBMS '95), 1995. |
| Tang, Yuan Y. et al., “Information Acquisition and Storage of Forms in Document Processing, Abstract printed from http://csdl.computer.org/comp/proceedings/icdar/1997/7898/00/78980170abs.htm”, 4th International Conference Document Analysis and Recognition, 1997, vol. I and II. |
| Tjahyadi et al., “Application of the DCT Energy Histogram for Face Recognition”, Proceedings of the 2nd International Conference on Information Technology for Application, 2004, pp. 305-310. |
| Tkalcic, M. et al., “Colour spaces perceptual, historical and applicational background. ISBN: 0-7803-7763-X”, IEEE, EUROCON, 2003, pp. 304-308, vol. 1. |
| Turk, Matthew et al., “Eigenfaces for Recognition”, Journal of Cognitive Neuroscience, 1991, 17 pgs, vol. 3—Issue 1. |
| Turkan, Mehmet et al., “Human face detection in video using edge projections, Conference: Visual Information Processing XV, http://rlinks2.dialog.com/NASApp/ChannelWEB/DialogProServlet?ChName=engineering”. Proceedings of SPIE—The International Society for Optical Engineering Visual Information Processing, 2006, vol. 6246. |
| Twins Crack Face Recognition Puzzle, Internet article http://www.cnn.com/2003/TECH/ptech/03/10/israel.twins.reut/ index.html, printed Mar. 10, 2003, 3 pages. |
| U.S. Appl. No. 11/554,539, filed Oct. 30, 2006, entitled Digital Image Processing Using Face Detection and Skin Tone Information. |
| Vuylsteke, P. et al., “Range Image Acquisition with a Single Binary-Encoded Light Pattern, abstract printed from http://csdl.computer.org/comp/trans/tp/1990/02/i0148abs.htm”, IEEE Transactions on Pattern Analysis and Machine Intelligence, 1990, 1 page. |
| Wan, S.J. et al., “Variance-based color image quantization for frame buffer display”. S. K. M. Wong Color Research and Application, 1990, pp. 52-58, vol. 15—Issue 1. |
| Yang, Ming-Hsuan et al., “Detecting Faces in Images: A Survey, ISSN:0162-8828, http://portal.acm.org/citation.cfm?id=50562landcoll=GUIDEanddl=GUIDEandCFID=680-9268andCFTOKEN=82843223.”, IEEE Transactions on Pattern Analysis and Machine Intelligence archive, 2002, pp. 34-58, vol. 24—Issue 1, IEEE Computer Society. |
| Zhang, Jun et al., “Face Recognition: Eigenface, Elastic Matching, and Neural Nets”, Proceedings of the IEEE, 1997, pp. 1423-1435, vol. 85—Issue 9. |
| Zhao, W. et al., “Face recognition: A literature survey, ISSN: 0360-0300, http://portal.acm.org/citation.cfm?id=954342andcoll=GUIDEanddl=GUIDEandCFID=680-9268andCFTOKEN=82843223.”, ACM Computing Surveys (CSUR) archive, 2003. pp. 399-458, vol. 35—Issue 4, ACM Press. |
| Bradski Gary et al., “Learning-Based Computer Vision with Intel's Open Source Computer Vision Library”, Intel Technology, 2005, pp. 119-130, vol. 9—Issue 2. |
| Corcoran, P. et al., “Automatic Indexing of Consumer Image Collections Using Person Recognition Techniques”, Digest of Technical Papers, International Conference on Consumer Electronics, 2005, pp. 127-128. |
| Costache, G. et al., “In-Camera Person-Indexing of Digital Images”, Digest of Technical Papers, International Conference on Consumer Electronics, 2006, pp. 339-340. |
| Demirkir, C. et al., “Face detection using boosted tree classifier stages”, Proceedings of the IEEE 12th Signal Processing and Communications Applications Conference, 2004, pp. 575-578. |
| Drimbarean, A.F. et al., “Image Processing Techniques to Detect and Filter Objectionable Images based on Skin Tone and Shape Recognition”, International Conference on Consumer Electronics, 2001, pp. 278-279. |
| Viola, P. et al., “Rapid Object Detection using a Boosted Cascade of Simple Features”, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2001, pp. 1-511-1-518. vol. 1. |
| Viola, P. et al., “Robust Real-Time Face Detection”, International Journal of Computer Vision, 2004, pp. 137-154, vol. 57—Issue 2, Kluwer Academic Publishers. |
| Xin He et al., “Real-Time Human Face Detection in Color Image”, International Conference on Machine Learning and Cybernetics, 2003, pp. 2915-2920, vol. 5. |
| Zhu Qiang et al., “Fast Human Detection Using a Cascade of Histograms of Oriented Gradients”, Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2006, pp. 1491-1498, IEEE Computer Society. |
| Patent Abstracts of Japan, vol. 2000, No. 5, Sep. 14, 2000 & JP 2000 050062 A (Minolta Co Ltd), Feb. 18, 2000, abstract & US 6 792 161 B1 (Hashimoto Keisuke, et al.) Sep. 14, 2004. |
| Favaro P: Depth from Focus/Defocus. Internet Citation, [Online], Jun. 25, 2002, XP002398665, Retrieved from the Internet:URL:http://homepages.inf.ed.ac.uk/rbf, [retrieved on Sep. 12, 2006]. |
| PCT International Preliminary Report on Patentability Chapter I (IB/373), for PCT Application No. PCT/US2008/067746, report dated Dec. 22, 2009, 6 pages. |
| PCT Written Opinion of the International Search Authority, for PCT Application No. PCT/US2008/067746, report dated Sep. 10, 2008, 5 pages. |
| Swain et al. (1995) “Defocus-based image segmentation.” Proc. 1995 Int'l Conf. on Acoustics, Speech, and Signal Processing, vol. 4 pp. 2403-2406. |
| Final Rejection, dated Mar. 28, 2012, for U.S. Appl. No. 12/140,827, filed Jun. 17, 2008. |
| Final Rejection, dated Nov. 21, 2011, for U.S. Appl. No. 12/140,125, filed Jun. 16, 2008. |
| Final Rejection, dated Nov. 9, 2011, for U.S. Appl. No. 12/140,532, filed Jun. 17, 2008. |
| Non-final Rejection, dated Aug. 4, 2011, for U.S. Appl. No. 12/140,827, filed Jun. 17, 2008. |
| Non-final Rejection, dated Dec. 29, 2011, for U.S. Appl. No. 12/140,950, filed Jun. 17, 2008. |
| Non-final Rejection, dated Jul. 5, 2011, for U.S. Appl. No. 12/140,125, filed Jun. 16, 2008. |
| Non-final Rejection, dated Mar. 31, 2011, for U.S. Appl. No. 12/140,532, filed Jun. 17, 2008. |
| Non-final Rejection, dated May 15, 2009, for U.S. Appl. No. 12/141,042, filed Jun. 17, 2008. |
| Notice of Allowance, dated Apr. 19, 2011, for U.S. Appl. No. 12/947,731, filed Nov. 16, 2010. |
| Notice of Allowance, dated Jan. 9, 2012, for U.S. Appl. No. 13/113,648, filed May 23, 2011. |
| Notice of Allowance, dated Sep. 23, 2009, for U.S. Appl. No. 12/141,042, filed Jun. 17, 2008. |
| International Preliminary Report on Patentability Chapter I, for PCT Application No. PCT/US2007/075651, dated Feb. 10, 2009, 7 pages. |
| Written Opinion of the International Search Authority, for PCT Application No. PCT/US2007/075651, dated Oct. 20, 2008, 6 pages. |
| International Preliminary Report on Patentability Chapter I, for PCT Application No. PCT/IB2007/004431, dated Mar. 17, 2009, 8 pages. |
| Written Opinion of the International Search Authority, for PCT Application No. PCT/IB2007/004431, dated Nov. 13, 2008, 7 pages. |
| Patent Abstracts of Japan, publication No. 2004-327485, published Nov. 18, 2004, Method for Removing Dust Particle from Exposure Mask. |
| Forchheimer, R. Astrom, A: Near-sensor image processing: a new paradigm, IEEE Transactions on Image Processing, Nov. 1994, vol. 3, Issue: 6, pp. 736-746, ISSN: 1057-7149, INSPEC Accession No. 4833139, DOI: 10.1109/83.336244, Posted online: Aug. 6, 2002 19:23:28.0. |
| Rafael Dominguez-Castro, Servando Espejo, Angel Rodriguez-Vazquez, Ricardo A. Carmona, Peter Foldesy, Akos Zarandy, Peter Szolgay, Tamas Sziranyi, and Tamas Roska,A 0.8- m CMOS Two-Dimensional Programmable Mixed-Signal Focal-Plane Array Processor with On-Chip Binary Imaging and Instructions Storage, IEEE Journal of Solid-State Circuits, vol. 32, No. 7, Jul. 1997 pp. 1013-1026. |
| Doignon, C.; Cortelazzo, G.; Frezza, R.: A robust camera calibration technique for high resolution image acquisition, Proceedings of the European Conference on Multimedia Applications, Services and Techniques, Part: vol. 1 , p. 267-78, vol. 1. |
| Notice of Allowance, dated Sep. 24, 2012, for U.S. Appl. No. 12/140,125, filed Jun. 16, 2008. |
| Notice of Allowance, dated May 10, 2013, for U.S. Appl. No. 12/619,587, filed Nov. 16, 2009. |
| Final Rejection, dated Feb. 20, 2013, for U.S. Appl. No. 12/140,048, filed Jun. 16, 2008. |
| Non-Final Rejection, dated Feb. 28, 2013, for U.S. Appl. No. 12/140,827, filed Aug. 31, 2009. |
| Non-Final Rejection, dated Oct. 3, 2012, for U.S. Appl. No. 12/619,587, filed Nov. 16, 2009. |
| Notice of Allowance, dated Jul. 16, 2012, for U.S. Appl. No. 12/142,134, filed Jun. 19, 2008. |
| Number | Date | Country | |
|---|---|---|---|
| 20080317378 A1 | Dec 2008 | US |
| Number | Date | Country | |
|---|---|---|---|
| 60945558 | Jun 2007 | US | |
| 60773714 | Feb 2006 | US | |
| 60821956 | Aug 2006 | US | |
| 60776338 | Feb 2006 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 11674650 | Feb 2007 | US |
| Child | 12140048 | US | |
| Parent | 11836744 | Aug 2007 | US |
| Child | 11674650 | US |
