METHOD AND APPARATUS FOR SCORING AN IMAGE

Abstract

Methods and apparatus for scoring an image based on visual criteria are described. A method includes computing a local blur map for the image, determining a bounding box in the image comprising a largest sharp region in the image based on the local blur map, scoring the image according to at least one of a ratio of bounding box size to image size, a ratio of the bounding box length to the bounding box height, a relative position of the bounding box in the image. Another method includes selecting an image among a plurality of images by scoring each image of the plurality of images according to the scoring method and selecting an image based on the score. The apparatus includes a memory and processor for performing the any of the selecting or the scoring method.

Description

TECHNICAL FIELD

The present disclosure generally relates to a method and apparatus for scoring an image based on visual criteria. More specifically, the present disclosure relates to scoring an image based on a local blur map and selecting an image among a plurality of images based on the score.

DESCRIPTION OF BACKGROUND

This section is intended to introduce the reader to various aspects of art, which may be related to the present embodiments that are described below. This discussion is believed to be helpful in providing the reader with background information to facilitate a better understanding of the various aspects of the present disclosure. Accordingly, it should be understood that these statements are to be read in this light.

The context of the invention is the automatic selection of pictures, among a group of stills (could be all the frames of a video), that represent “interesting” pictures among the group. The notion of interestingness is both subjective and application-dependent, and will be explained hereafter.

In the context of a media service or video content provider, automatic selection can be used to pre-select some stills, among which some will be used to populate a media details page/website/and the like. These images should be visually attractive, should reflect the content (place, actors, atmosphere), but shall not spoil the story.

Alternatively, in the context of a personal media server, automatic selection can be used to pre-select some stills, among which some will be used to represent the content of personal media server.

Therefore, there is a need for an automated scoring of image responsive to visual criteria representative of interestingness.

SUMMARY

The main idea of that disclosure is that “interesting” images correspond to a combination of a vertical sharp portion (ideally, a face or a character) on a blurred background. Examples of such a combination are displayed in FIG. 1 which presents examples of valuable images, where the object of interest is sharp over a blurred background. Advantageously, the sharpness of the object of interest on blurred background accentuates the visual attractiveness of the image. In addition, it can be seen from these pictures that a cinematographer can composite a scene so that an object of interest can be placed in a various section of the picture. The rule of third, the golden ratio, are non-limited examples of various approaches of how to place objects in a scene.

To that determine images responsive to visual criteria representative of interestingness, a method that scores the images according to the sharpness of a region with respect to whole image is therefore disclosed. The disclosed method comprises analyzing the global blur of the image, as well as the local blur. Advantageously, the method allows extracting objects of interest from an image among a sequence of images.

Thus, according to an embodiment of the present disclosure, a method for scoring an image is disclosed. The method comprises computing a local blur map for the image; determining a bounding box in the image comprising the largest sharp region in the image based on the local blur map; scoring the image according to at least one of a ratio of bounding box size to image size, a ratio of the bounding box length to the bounding box height, a position of the bounding box in the image.

According to a particular characteristic, the local blur map includes a blur metric for each pixel of the image. In other words, the local blur map is a spatial indication of blur (inversely sharpness) in the image, each metric of the local blur map associated with a given pixel carrying an indication of a blur level (inversely sharp level) for the given pixel.

According to another particular characteristic, the pixel-wise blur metric is an average sum of singular values determined for a patch centered on the pixel of the image using a Singular Value Decomposition.

According to another particular characteristic, the pixel-wise blur metric is an average sum of singular values determined for a patch centered on the pixel of a processed image using a Singular Value Decomposition, wherein the processed image is a difference image between the image and a blurred version of the image.

According to another particular characteristic, the local blur map is a binary map, for instance obtained by a thresholding method applied to the local blur metrics, and wherein the largest sharp region in the image is obtained by analyzing the connected components of the binary local blur map.

According to another particular characteristic, the scoring further includes a global blur metric of the image.

According to a further embodiment, a method for selecting an image among a plurality of images is described. The method comprises scoring each image of the plurality of images according to the disclosed scoring method in any of its variant and selecting an image based on the scores.

According to a further embodiment, an apparatus implementing the methods, being the scoring method in any of its variant or the selecting method in any of its variant is described.

According to a further embodiment, a computer program product comprising program code instructions to execute of the steps of the methods according to any of the embodiments and variants disclosed when this program is executed on a computer is disclosed.

A processor readable medium having stored therein instructions for causing a processor to perform at least the steps of the methods according to any of the embodiments and variants is disclosed.

A non-transitory program storage device is disclosed that is readable by a computer, tangibly embodies a program of instructions executable by the computer to perform the methods according to any of the embodiments and variants is disclosed.

The above presents a simplified summary of the subject matter in order to provide a basic understanding of some aspects of subject matter embodiments. This summary is not an extensive overview of the subject matter. It is not intended to identify key/critical elements of the embodiments or to delineate the scope of the subject matter. Its sole purpose is to present some concepts of the subject matter in a simplified form as a prelude to the more detailed description that is presented later.

BRIEF SUMMARY OF THE DRAWINGS

These and other aspects, features, and advantages of the present disclosure will be described or become apparent from the following detailed description of the preferred embodiments, which is to be read in connection with the accompanying drawings.

FIG. 1 represents images displaying a combination of sharp portion on a blurred background in accordance with the present disclosure;

FIG. 2 represents the local blur map and bounding box for images of FIG. 1 in accordance with the present disclosure;

FIG. 3 is a block diagram of an apparatus for implementing any of the methods in accordance with the present disclosure;

FIG. 4 is a flowchart of a method for selecting an image in accordance with the present disclosure;

FIG. 5 is a flowchart of a method for scoring an image in accordance with the present disclosure; and

FIG. 6 represents a piecewise linear cost function for a score representative of the rule of third in accordance with the present disclosure.

It should be understood that the drawing(s) are for purposes of illustrating the concepts of the disclosure and are not necessarily the only possible configuration for illustrating the disclosure.

DETAILED DESCRIPTION

It should be understood that the elements shown in the figures may be implemented in various forms of hardware, software or combinations thereof. Preferably, these elements are implemented in a combination of hardware and software on one or more appropriately programmed general-purpose devices, which may include a processor, memory and input/output interfaces. Herein, the phrase “coupled” is defined to mean directly connected to or indirectly connected with through one or more intermediate components. Such intermediate components may include both hardware and software based components.

The present description illustrates the principles of the present disclosure. It will thus be appreciated that those skilled in the art will be able to devise various arrangements that, although not explicitly described or shown herein, embody the principles of the disclosure and are included within its scope.

All examples and conditional language recited herein are intended for educational purposes to aid the reader in understanding the principles of the disclosure and the concepts contributed by the inventor to furthering the art, and are to be construed as being without limitation to such specifically recited examples and conditions.

Moreover, all statements herein reciting principles, aspects, and embodiments of the disclosure, as well as specific examples thereof, are intended to encompass both structural and functional equivalents thereof. Additionally, it is intended that such equivalents include both currently known equivalents as well as equivalents developed in the future, i.e., any elements developed that perform the same function, regardless of structure.

Thus, for example, it will be appreciated by those skilled in the art that the block diagrams presented herein represent conceptual views of illustrative circuitry embodying the principles of the disclosure. Similarly, it will be appreciated that any flow charts, flow diagrams, state transition diagrams, pseudocode, and the like represent various processes which may be substantially represented in computer readable media and so executed by a computer or processor, whether or not such computer or processor is explicitly shown.

The functions of the various elements shown in the figures may be provided through the use of dedicated hardware as well as hardware capable of executing software in association with appropriate software. When provided by a processor, the functions may be provided by a single dedicated processor, by a single shared processor, or by a plurality of individual processors, some of which may be shared. Moreover, explicit use of the term “processor” or “controller” should not be construed to refer exclusively to hardware capable of executing software, and may implicitly include, without limitation, digital signal processor (DSP) hardware, read only memory (ROM) for storing software, random access memory (RAM), and nonvolatile storage.

Other hardware, conventional and/or custom, may also be included. Similarly, any switches shown in the figures are conceptual only. Their function may be carried out through the operation of program logic, through dedicated logic, through the interaction of program control and dedicated logic, or even manually, the particular technique being selectable by the implementer as more specifically understood from the context.

In the claims hereof, any element expressed as a means for performing a specified function is intended to encompass any way of performing that function including, for example, a) a combination of circuit elements that performs that function or b) software in any form, including, therefore, firmware, microcode or the like, combined with appropriate circuitry for executing that software to perform the function. The disclosure as defined by such claims resides in the fact that the functionalities provided by the various recited means are combined and brought together in the manner which the claims call for. It is thus regarded that any means that can provide those functionalities are equivalent to those shown herein.

The present disclosure addresses issues related extraction of objects of interest from an image, the image belonging to a sequence of video frames or to a database of still pictures.

Turning to FIG. 3, a block diagram of an apparatus 300 used for processing images in accordance with the present disclosure is shown. The apparatus or electronic device 300 includes one or more processors (PROCESSOR) coupled to video or image database (VIDEO DATABASE, IMAGE DATABASE), a memory (MEMORY), and communication interface (COMMUNICATION INTERFACE). Each of these elements will be discussed in more detail below. Additionally, certain elements necessary for complete operation of electronic device 300 will not be described here in order to remain concise as those elements are well known to those skilled in the art.

Images are received in electronic device 300 from a content source via the communication interface, stored in the database and provided to processor(s). According to non-limitative examples, the images are still pictures, for instance personal pictures captured by a user with a camera and stored in the image database, or are frames extracted from a video content, for instance frames of a video trailer. According to different embodiments of the present principles, the content source belongs to a set comprising:

• • a local memory, e.g. a video memory, a RAM, a flash memory, a hard disk;
  • a storage interface, e.g. an interface with a mass storage, a ROM, an optical disc or a magnetic support;
  • a communication interface, e.g. a wireline interface (for example a bus interface, a wide area network interface, a local area network interface) or a wireless interface (such as a IEEE 802.11 interface or a Bluetooth interface); and
  • a picture capturing circuit (e.g. a sensor such as, for example, a CCD (or Charge-Coupled Device) or CMOS (or Complementary Metal-Oxide-Semiconductor)).

The processor(s) controls the operation of the electronic device 300. The processor(s) runs the software that operates electronic device 300 and further provides the functionality associated with managing image/video database such as, but not limited to, processing, scoring, selecting and displaying. The processor(s) also handles the transfer and processing of information between image/video database, memory, and communication interface. The processor(s) may be one or more general purpose processors, such as microprocessors, that operate using software stored in memory. Processor(s) may alternatively or additionally include one or more dedicated signal processors that include a specific functionality (e.g., decoding).

Optionality, the electronic device 300 may include one or more dedicated hardware (module, functional means) that performs the scoring or selecting method according to any of their variants as described with FIG. 5.

The memory stores software instructions and data to be executed by processor(s). Memory may also store temporary intermediate data and results as part of the processing of the images (local blur map, score), either by processor(s) or dedicated hardware. The memory may be implemented using volatile memory (e.g., static RAM), non-volatile memory (e.g., electronically erasable programmable ROM), or other suitable media.

The video database and image database store the data/video/images used and processed by the processor in executing the scoring or the selection of images. In some cases, the resulting scores or selected images may be stored for later use, for instance, as part of a later request by the user. Video database and image database may include, but is not limited to magnetic media (e.g., a hard drive), optical media (e.g., a compact disk (CD)/digital versatile disk (DVD)), or electronic flash memory based storage.

The communication interface further allows the electronic device 300 to provide the content (video/images) and associated scores or selected images to other devices over a wired or wireless network. Examples of suitable networks include broadcast networks, Ethernet networks, Wi-Fi enabled networks, cellular networks, and the like. It is important to note that more than one network may be used to deliver data to the other devices.

In operation, the processor(s) or dedicated hardware processes an image from the content (video/image) to produce a score based on the analysis of local blur conformant to the concepts as described with FIG. 5. The score, in conjunction with other data, may be provided to and used by a processing circuit in a user device to further process the content.

In one embodiment, the score based on the analysis of local blur may be used to select an image among a set of images. The set of images may be obtained for a content from various embodiments:

• • extraction of frames from a video (such frames being key frames, sampled frames, frames of a trailer),
  • selection in an image database for instance based on a semantic information (images of user selected person, images containing an object, a face),
  • selection of an image in a plurality of image databases (social media context),
  • selection among a database comprising pictures and videos.Each image of the set of images is scored based on local blur map in any of its variants. Then the score is used to select one or more images: image whose score is above a threshold; image with the highest score . . . . In another variant, the global blur may be used for a preliminary selection of images: among the set of images, a subset is determined with the images presenting a low global blur metric, then among this subset, the image(s) with the highest score is output. In another variant, an image is selected according to the present principles for a section or shot in the video content. A section or shot may include a group of visually-consistent and semantically-coherent frames in the video.

In another embodiment, the processor, memory, and software of FIG. 3 are programmed in an appropriate manner and implement the present principles to extract the interesting frames of a movie, or trailer, by a simple method:

• • Rank all frames with the score described previously;
  • Identify groups of interesting frames (frame whose score is above a threshold);
  • Cluster this group according to their time index, in order to retain only one frame per group. One option is for instance to compute the global blur metric described hereafter, and retain the sharpest image in the group.

In another embodiment, the processor, memory, and software of FIG. 3 are programmed in an appropriate manner and implement the present principles to have the concepts as described with FIG. 4 of a method or apparatus that extracts pictures from video by:

• • selecting a picture from a plurality of pictures comporting to a video sequence;
  • selecting a region of the picture based on a visual criteria; and
  • outputting an area from the region that comports to a dimensional criteria and the visual criteria.

In addition, the present principles can be implemented where copyright information can be added and/or extracted from a picture, metadata, and the like and added to the extracted image.

According to exemplary and non-limitative embodiments, the apparatus 300 is an apparatus, which belongs to a set comprising:

• • a mobile device;
  • a communication device;
  • a game device;
  • a set top box;
  • a TV set;
  • a Blu-Ray disc player;
  • a player;
  • a tablet (or tablet computer);
  • a laptop;
  • a display;
  • a camera.

It should be understood that the elements set forth in FIG. 3 are illustrative. The apparatus 300 can include any number of elements and certain elements can provide part or all of the functionality of other elements. Other possible implementations will be apparent to one skilled in the art given the benefit of the present disclosure.

Turning to FIG. 5, a flowchart of a method 500 for scoring an image in accordance with the present disclosure is shown.

At step 510, an image to process denoted as u is input. According to various application of the scoring method as described with FIG. 3, the image is obtained from, but non-limited to, a video or a database storing still pictures.

At step 520, a local blur map is computed. In an optional variant, a global blur metric is further computed. FIG. 2 shows results of the obtained local blur maps 210. According to a particular characteristic, the local blur map includes a blur metric for each pixel of the image.

The pixel blur metric value may be specifically computed using the luminance information in the image. A specific implementation for a pixel-wise blur metric having properties that are beneficial for use in some situations, such as for extraction of interesting object, is described below.

The blur metric is based on a Singular Value Decomposition (SVD) of the image u as disclosed in “A consistent pixel-wise blur measure for partially blurred images” by X. Fang, F. Shen, Y. Guo, C. Jacquemin, J. Zhou, and S. Huang (IEEE International Conference on Image Processing 2014). The metric is computed on the luminance information, which is basically the average of the three video signal components.

The Multi-resolution Singular Value (MSV) local blur metric is given by

$\begin{array}{cc}u=\sum _{i=1}^n{\lambda }_ie_i& \left(\mathrm{equation}1\right)\end{array}$

where λ_i (1≦i≦n) are the eigen values in decreasing order and the e_i (1≦i≦n) are rank-1 matrices called the eigen-images.

The idea is that the first most significant eigen-images encode low-frequency shape structures while less significant eigen-images encode the image details. Furthermore for a blurred block, the high frequency details are lost much more significantly in comparison with its low frequency shape structures. Then only the high frequency of the image will be studied, through a Haar wavelet transformation. On the high frequency sub-bands, the metric will be the average singular value, also called Multi-resolution Singular Value (MSV).

As the metric is local or pixel-wise, the description of the code will stand for a patch of size k×k around the current pixel. Let's us denote by P the current patch.

First, the patch P is decomposed by Haar wavelet transform where only horizontal low-pass/vertical high-pass (LH), horizontal high-pass/vertical low-pass (HL) and horizontal high-pass/vertical high-pass (HH) sub-bands or P_lh; P_hi and P_hh of size k/2×k/2 are considered. Patchs or P_ln; P_hi and P_hh are obtained by:

$\begin{array}{cc}\forall \left(i,j\right)\in {1,\frac{\kappa }{2}}^2,P_{\mathrm{lh}}\left(i,j\right)=\frac{1}{2}\left(P\left(2i,2j\right)-P\left(2i,2j+1\right)+P\left(2i+1,2j\right)-P\left(2i+1,2j+1\right)\right)P_{\mathrm{hl}}\left(i,j\right)=\frac{1}{2}\left(P\left(2i,2j\right)+P\left(2i,2j+1\right)-P\left(2i+1,2j\right)-P\left(2i+1,2j+1\right)\right)P_{\mathrm{hh}}\left(i,j\right)=\frac{1}{2}\left(P\left(2i,2j\right)-P\left(2i,2j+1\right)-P\left(2i+1,2j\right)+P\left(2i+1,2j+1\right)\right)& \left(\mathrm{equation}2\right)\end{array}$

Then a Singular Values Decomposition is applied on each sub-bands Ps to get the K/2 singular values {λ_Si}_i

Then the local blur metric associated to the patch P is

$\begin{array}{cc}{B}_P=\frac{2}{3\kappa }\sum _{s=1}^3\sum _{i=1}^{\kappa /2}{\lambda }_{\mathrm{si}}& \left(\mathrm{equation}3\right)\end{array}$

As the local metric is obtained for a whole patch, we need to decide to which pixel this measure will be associated. As the Haar decomposition need a power of two side blocks, the patch can't be centered around one pixel. Then two variants are disclosed:

• • B_P is associated to the top left pixel. The metric remains exactly local, but is shifted;
  • B_P is associated to all the pixels belonging to this patch. Then one pixel will have k² measures that are averaged to get one local metric for each pixel.

According to this latest variant, the blur metric is an average sum of singular values determined for a patch centered on the pixel of the image using a Singular Value Decomposition.

The skilled in the art will appreciate that the most time consuming process is the computation of the SVD. However as the size of the patches is fixed to k=8, then the SVD is performed on 4×4 matrices. Theoretically the singular values are the square roots of the eigen values of the symmetrized matrices MM^t (where M is the matrix of one sub-band patch Ps). The singular values are the roots of the characteristic polynomial of the symmetrized matrices.

As one can have the explicit solution of the roots of a 4th degree polynom, this solution is way much faster. The simplification is done as following:

• • Compute the symmetric matrix MM^t;
  • Get its characteristic polynomial P;
  • Get the four real positive roots of P {r_i}_i
  • Average the singular values λ_i=√r_i

According to a variant of the thresholding of the local blur map described with respect to step 530, the local blur map is filtered to remove spurious and small activations. To do so, a simple Gaussian filter is used. For instance, a Gaussian filter with σ=2.5 is applied to the blur map.

According to another variant, the Gaussian filter is applied to the image itself. Indeed, the blurred edges are detected much sharper than they should be. As the difference between a blur region and a blurred blur region is small while on the contrary the difference between a sharp region and a blurred sharp region is large, the image to get the local MVS based metric is the difference image between the input image and a blurry input image. For instance, the blurry image is obtained by applying a Gaussian blur of σ=2.5.

According to this latest variant, the blur metric is an average sum of singular values determined for a patch centered on the pixel of the image using a Singular Value Decomposition, wherein the processed image is a difference image between the image and a blurred version of the image.

Advantageously, in the obtained local blur map, low values of the local blur metric for a pixel correspond to sharp pixels while high values of the local blur metric correspond to blurred pixels. Thus based on the local blur metric, a pixel in the image is labelled as “not blurred” (ie sharp) or “blurred” as described hereafter. According to this convention, the pixels with low values of the local blur are kept after thresholding as sharp pixels.

At step 530, a bounding box 220 is determined in the image, the bounding box including the largest sharp region, the largest sharp region being determined in the image based on the local blur map. Indeed an area such as a rectangle aligned with the image shape is determined. According to a variant, only the 2 vertical borders of the rectangle are determined, the horizontal borders of the rectangle corresponding with the border of the image, as shown on the right most picture of FIG. 2. A sharp region is obtained for the pixels having a local blur metric representative of a sharp pixel and labelled as “not blurred”. Accordingly, the bounding box may also include blur pixels surrounding the largest sharp region. The skilled in the art of image processing will appreciate that various technics can be used to achieve the determination of a sharp region based on the local blur map.

According to a variant, the local blur map is first filtered by thresholding. Different variants of thresholding methods are for instance described by M. Sezgin and B. Sankur in a “Survey over image thresholding techniques and quantitative performance evaluation” (2004, in Journal of Electronic Imaging 13, 146-165). According to non-limiting examples, the thresholding uses a fixed threshold value or an adaptive thresholding operator as in the Otsu method (described by Nobuyuki Otsu in “A threshold selection method from gray-level histograms”, IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS, VOL. SMC-9, NO. 1, JANUARY 1979, 62-66). Advantageously, the filtered local blur map is a binary map. The binary value attached to a pixel in the image is thus naturally representative of the label “not blurred” (ie sharp, for instance associated to the value ‘0’) or “blurred” (for instance associated to the value ‘1’). Yet in other variant which is combined or used instead of the thresholding, the local blur map is filtered with Gaussian filter as previously described so as to obtain to binary map.

Then according to a particular characteristic, the connected components of the binary map are analyzed so as to find out the sets of spatially connected pixels of the binary map. Any algorithm can be used at that stage. For instance, in “Fast and Memory Efficient 2-D Connected Components Using Linked Lists of Line Segments” (IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 19, NO. 12, DECEMBER 2010, 3222-3231) J. De Bock and W. Philips present an efficient approach to the problem of finding the connected components in binary images.

Finally, a bounding box encompassing the main connected component, i.e. the whole largest connected component, is computed. The bounding box thus includes the largest sharp region of the image.

At step 540, a score is computed for the image. According to different variants, three features, computed for the bounding box, are used in any combination to determine the image score. According to a further variant, a global blur metric is also used to compute the image score.

According to a first characteristic, the feature is the size of the bounding box. Then the ratio between the bounding box size and the image size is computed. From this ratio r_s, a score is computed as s_s=−4×r_s²+4*τ_s. The score is maximum for r_s=0.5, and is zero for r_s=u or r_s=1.

According to a second characteristic, the feature is the aspect ratio of the bounding box. The aspect ratio, being the ratio of the bounding box length to the bounding box height, is used directly as the score S_u.

According to a third characteristic, the feature is the horizontal position of the bounding box. The quality of this position is inferred from the rule of third. The rule of the third states that an image should be imagined as divided into nine equal parts by two equally spaced horizontal lines and two equally spaced vertical lines, and that important compositional elements should be placed along these lines or their intersections. Thus, the score is expected to be maximal when the center of the bounding box is positioned on those lines vertical lines at ⅓ or ⅔ of the image as illustrated on FIG. 2. For this score S_p, a piecewise linear cost can be used, as displayed in FIG. 6.

According to a further fourth characteristic, the global blur metric B is determined so as to be included in the score computation.

The generation of a global blur metric is also based on the analysis of input image. The blur metric may be specifically computed using the luminance information in the image.

According to a particular variant, a separate blur metric for the horizontal direction and vertical direction, denoted as B_h and B_v are computed. The final blur metric is given by the following:

B=max(B_h,B_y).  (equation 4)

For the sake of conciseness, only the computation of B_h will be described as the computation of B_v is the same procedure in a vertical instead of horizontal direction.

With the original input image denoted as u, processing (as described in processing block 520 described in FIG. 5 or in processor(s) described in FIG. 3) produces a blurred image in the chosen direction. The blurry image is denoted as ũ and denoted by the following equation:

$\begin{array}{cc}\forall \left(i,j\right),\tilde{u}\left(i,j\right)=\frac{1}{2\kappa +1}\sum _{k=-\kappa }^{\kappa }u\left(i,j+k\right).& \left(\mathrm{equation}5\right)\end{array}$

The gradient, denoted as Du, is computed for both the original image u and the blurry image ũ in the chosen direction as:

∀(i,j),Du(i,j)=|u(i,j+1)−u(i,j−1)|,  (equation 6)

and

∀(i,j),Dũ(i,j)=|ũ(i,j+1)−ũ(i,j−1)|.  (equation 7)

The sum of the gradients of the image, denoted as Su, is computed and the sum of the variance of the gradients, denoted as Sv, is computed. It is important to note that the variance is evaluated only when the absolute differences between the gradient of the original image and the gradient of the blurry image are greater than zero. The condition may be denoted by the following:

$\begin{array}{cc}v\left(i,j\right)=\{\begin{array}{ccc}\mathrm{Du}\left(i,j\right)-D\tilde{u}\left(i,j\right)& \mathrm{if}& \mathrm{Du}\left(i,j\right)-D\tilde{u}\left(i,j\right)>0\\ 0& \mathrm{otherwise}& \end{array}& \left(\mathrm{equation}8\right)\end{array}$

As a result, Su and Sv may be represented by the following:

$\begin{array}{cc}\mathrm{Su}=\sum _{i,j}\mathrm{Du}\left(i,j\right)\mathrm{Sv}=\sum _{i,j}v\left(i,j\right).& \left(\mathrm{equation}9\right)\end{array}$

Finally, the result is normalized between [0, 1] to obtain the following:

$\begin{array}{cc}{B}_h=\{\begin{array}{ccc}\frac{\mathrm{Su}-\mathrm{Sv}}{\mathrm{Su}}& \mathrm{if}& \mathrm{Su}>0\\ 1& \mathrm{otherwise}& \end{array}& \left(\mathrm{equation}10\right)\end{array}$

The computation of the blur metric may alternatively be determined by simplifying the computation of the gradient for the blurred image as described in the following sets of equations:

$\left(\mathrm{equation}11\right)$ $\begin{array}{c}D\tilde{u}\left(i,j\right)=\tilde{u}\left(i,j+1\right)-\tilde{u}\left(i,j-1\right)\\ =\frac{1}{2\kappa +1}\sum _{k=-\kappa }^{k=\kappa }u\left(i,j+1+k\right)-\sum _{k=-\kappa }^{k=\kappa }u\left(i,j-1+k\right)\left(\mathrm{equation}12\right)\\ =\frac{1}{2\kappa +1}\sum _{k=-\kappa +1}^{k=\kappa +1}u\left(i,j+k\right)-\sum _{k=-\kappa -1}^{k=\kappa -1}u\left(i,j+k\right)\left(\mathrm{equation}13\right)\\ =\frac{1}{2\kappa +1}u\left(i,j+\kappa +1\right)+u\left(i,j+\kappa \right)-\left(\mathrm{equation}14\right)\\ u\left(i,j-\kappa \right)-u\left(i,j-\kappa -1\right)\end{array}$

The determination of the blur metric may alternatively be realized by computing the sum of the gradient of image and variation of the gradients and taking into account only the pixels for which the gradient of the original image is greater than the gradient of the blurred image resulting in the following:

$\begin{array}{cc}\mathrm{Su}=\sum _{i,j\mathrm{such}\mathrm{that}\mathrm{Du}\left(i,j\right)>D\tilde{u}\left(i,j\right)}\mathrm{Du}\left(i,j\right)\mathrm{Sv}=\sum _{i,j\mathrm{such}\mathrm{that}\mathrm{Du}\left(i,j\right)>D\tilde{u}\left(i,j\right)}v\left(i,j\right).& \left(\mathrm{equation}15\right)\end{array}$

The computation of the blur metric may include linearization of the blur metric over the range of [0,1] in order to have better subjectivity (i.e., that the interval of confidence to identify the amount of blurriness from the blur metric is better). The blur metric may be linearized by adjusting the curve to be more linear and monotonic over a wider range of the interval [0,1] for a range of Gaussian blur. In order to achieve this, a polynomial function P is applied to the computed blur metric B (e.g., the combination of B_h and B_v).

For example, one possible polynomial P is found from the minimization of the following:

$\begin{array}{cc}\underset{a,b,c,d,e}{\min }{\left(\sum _n\left({\mathrm{ay}}_n^4+{\mathrm{by}}_n^3+{\mathrm{cy}}_n^2+{\mathrm{dy}}_n+e-x_n\right)\right)}^2.& \left(\mathrm{equation}16\right)\end{array}$

The resulting polynomial is shown as the following:

$\begin{array}{cc}\left(\begin{array}{ccccc}{\sum }_ny_n^8& {\sum }_ny_n^7& {\sum }_ny_n^6& {\sum }_ny_n^5& {\sum }_ny_n^4\\ {\sum }_ny_n^7& {\sum }_ny_n^6& {\sum }_ny_n^5& {\sum }_ny_n^4& {\sum }_ny_n^3\\ {\sum }_ny_n^6& {\sum }_ny_n^5& {\sum }_ny_n^4& {\sum }_ny_n^3& {\sum }_ny_n^2\\ {\sum }_ny_n^5& {\sum }_ny_n^4& {\sum }_ny_n^3& {\sum }_ny_n^2& {\sum }_ny_n\\ {\sum }_ny_n^4& {\sum }_ny_n^3& {\sum }_ny_n^2& {\sum }_ny_n& {\sum }_n1\end{array}\right)\left(\begin{array}{c}a\\ b\\ c\\ d\\ e\end{array}\right)=\left(\begin{array}{c}{\sum }_nx_ny_n^4\\ {\sum }_nx_ny_n^3\\ {\sum }_nx_ny_n^2\\ {\sum }_nx_ny_n\\ {\sum }_nx_n\end{array}\right)& \left(\mathrm{equation}17\right)\end{array}$

The polynomial P may be determined experimentally, or otherwise learned by processing a set of different images and different values of blur. The coefficients for polynomial P may be fixed for the computation based on the determination. An exemplary set of coefficients is shown below:

a=−18.6948447

b=34.97138362

c=−18.30364716

d=10.22577058

e=−0.09037105

As a result, a global metric for blur, as described earlier, may be determined or otherwise determined by first obtaining the blur measure B as described in above (e.g., equation 10). An offset value equal to 2/(2K+1) is subtracted from the blur measure B in order to obtain a minimal value that is close to zero for perfectly sharp images, where K is related to a property of the video processing filter. The shifted value for the blur measure B is linearized by applying a polynomial function to the shifted value for the blur measure B in order to get a maximal value close to one for highly blurred images (e.g., Gaussian blur >5).

Then, a score representative of an “interestingness” value is determined for the image being a combination of the scores S_s, S_a and S_p. Any function f of the scores S_s, S_a and S_p increasing with the scores, is compliant with the present principles. For instance, the total score can be simply defined as

S=S _s or,

S=S _a or,

S=S _p or,

S=S _s +S _a +S _p

In yet another variant, the score is normalized with the measure of the global blur. Accordingly, the total score is defined as:

$S=\frac{s_s+s_a+s_P}{B}.$

Although the embodiments which incorporate the teachings of the present disclosure have been shown and described in detail herein, those skilled in the art can readily devise many other varied embodiments that still incorporate these teachings. Having described preferred embodiments for an apparatus and method for scoring an image using a spatial indication of blurring, it is noted that modifications and variations can be made by persons skilled in the art in light of the above teachings. It is therefore to be understood that changes may be made in the particular embodiments disclosed which are within the scope of the teachings as outlined by the appended claims.

Claims

1. A method for scoring an image comprising: computing a local blur map for the image;determining a bounding box in the image comprising a largest sharp region in the image based on the local blur map; andscoring the image according to at least one of a ratio of bounding box size to image size, a ratio of the bounding box length to the bounding box height, a relative position of the bounding box in the image.

2. The method of claim 1, wherein the local blur map includes a blur metric for each pixel of the image.

3. The method of claim 2, wherein the blur metric is an average sum of singular values determined for a patch centered on said pixel of said image using a Singular Value Decomposition.

4. The method of claim 2, wherein the blur metric is an average sum of singular values determined for a patch centered on said pixel of a processed image using a Singular Value Decomposition, wherein the processed image is a difference image between said image and a blurred version of said image.

5. The method of claim 1, wherein the local blur map is a binary map and wherein the largest sharp region in the image is obtained by analyzing the connected components of the binary local blur map.

6. The method of claim 1, wherein scoring further comprises a global blur metric of the image.

7. A method for selecting an image among a plurality of images comprising scoring each image of said plurality of images according to the method of claim 1; and selecting an image based on the scores.

8. An apparatus comprising a processor, coupled to a memory, configured to compute a local blur map for the image; determine a bounding box in the image comprising a largest sharp region in the image based on the local blur map; andcompute a score of the image according to at least one of a ratio of bounding box size to image size, a ratio of the bounding box length to the bounding box height, a relative position of the bounding box in the image.

9. The apparatus according to claim 8, wherein said apparatus belongs to a set comprising: a mobile device;a communication device;a game device;a set top box;a TV set;a Blu-Ray disc player;a player;a tablet;a laptop;a display; anda camera.

10. An apparatus for scoring an image comprising: a module for computing a local blur map for the image;a module for determining a bounding box in the image comprising a largest sharp region in the image based on the local blur map; anda module for computing a score of the image according to at least one of a ratio of bounding box size to image size, a ratio of the bounding box length to the bounding box height, a relative position of the bounding box in the image.

11. A non-transitory program storage device, readable by a computer, tangibly embodying a program of instructions executable by the computer to perform a method comprising: computing a local blur map for the image;determining a bounding box in the image comprising a largest sharp region in the image based on the local blur map; andscoring the image according to at least one of a ratio of bounding box size to image size, a ratio of the bounding box length to the bounding box height, a relative position of the bounding box in the image.