Login| Sign Up| Help| Contact|

Patent Searching and Data


Title:
IMAGE DEMOSAICING SYSTEM AND METHOD
Document Type and Number:
WIPO Patent Application WO/2019/143626
Kind Code:
A1
Abstract:
A method for demosaicing an image captured by an image sensor includes (a) computing, for each of a first plurality of interpolated pixel-values and based on neighboring primary pixel-values, a respective first confidence value; (b) generating a first thresholded mapping from a first coordinate mapping by removing each interpolated pixel-value having a first confidence value less than a threshold value; (c) repeating steps of computing and generating for a second and third sub-plurality of sensor pixels to yield a second and a third thresholded mapping; (d) determining high-confidence array-coordinates as array-coordinates included in all thresholded mappings, remaining array-coordinates being low-confidence array-coordinates; (e) forming a refined image including, at each high-confidence array-coordinate, a respective pixel-value-triplet including one primary pixel-value and two interpolated pixel-values; and (f) filling the refined image by assigning, for each low-confidence array-coordinate, a pixel-value based on pixel-values of neighboring high-confidence array-coordinates.

Inventors:
WARD GREGORY JOHN (US)
Application Number:
PCT/US2019/013682
Publication Date:
July 25, 2019
Filing Date:
January 15, 2019
Export Citation:
Click for automatic bibliography generation   Help
Assignee:
DOLBY LABORATORIES LICENSING CORP (US)
International Classes:
G06T3/40
Other References:
K.-H. CHUNG ET AL: "Color Demosaicing Using Variance of Color Differences", IEEE TRANSACTIONS ON IMAGE PROCESSING., vol. 15, no. 10, 1 October 2006 (2006-10-01), US, pages 2944 - 2955, XP055445249, ISSN: 1057-7149, DOI: 10.1109/TIP.2006.877521
"Deformation Models", vol. 11, 17 December 2013, SPRINGER NETHERLANDS, Dordrecht, ISBN: 978-94-007-5446-1, ISSN: 2212-9391, article JI WON LEE ET AL: "Adaptive Demosaicing Algorithm Using Characteristics of the Color Filter Array Pattern", pages: 29 - 53, XP055476691, DOI: 10.1007/978-94-007-7584-8_2
HORE A ET AL: "An Edge-Sensing Generic Demosaicing Algorithm With Application to Image Resampling", IEEE TRANSACTIONS ON IMAGE PROCESSING, IEEE SERVICE CENTER, PISCATAWAY, NJ, US, vol. 20, no. 11, 1 November 2011 (2011-11-01), pages 3136 - 3150, XP011411919, ISSN: 1057-7149, DOI: 10.1109/TIP.2011.2159229
LOSSON O ET AL: ""Chapter 5 - Comparison of Color Demosaicing Methods"", ADVANCES IN IMAGING AND ELECTRON PHY,, vol. 162, 1 January 2010 (2010-01-01), pages 173 - 265, XP009192124, ISSN: 1076-5670, DOI: 10.1016/S1076-5670(10)62005-8
K.-H. CHUNG ET AL.: "Color Demosaicing Using Variance of Color Differences", IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 15, no. 10, October 2006 (2006-10-01), pages 2944 - 2955, XP055445249, DOI: doi:10.1109/TIP.2006.877521
JI WON LEE ET AL.: "Deformation models", vol. 11, 17 December 2013, SPRINGER, article "Adaptive demosaicing algorithm using characteristics of color filter array pattern", pages: 29 - 53
Attorney, Agent or Firm:
KONSTANTINIDES, Konstantinos et al. (US)
Download PDF:
Claims:
CLAIMS

1. A method for demosaicing an image captured by an image sensor having an arrayed plurality of sensor pixels each located at a respective one of a plurality of array-coordinates, the plurality of sensor pixels including at a first sub-plurality of array-coordinates, a first sub plurality of sensor pixels each filtered by a respective first color filter, at a second sub plurality of array-coordinates, a second sub-plurality of sensor pixels filtered by a respective second color filter, and at a third sub-plurality of array-coordinates, a third sub-plurality of sensor pixels filtered by a respective third color filter, the method comprising:

computing, for each of a first plurality of interpolated pixel- values and based on neighboring primary pixel- values, a respective one of a plurality of first confidence values each corresponding to an array-coordinate of either the second or the third sub-plurality of array-coordinates, the first plurality of interpolated pixel- values being interpolated from neighboring primary pixel- values, of a first plurality of primary pixel- values, generated by the first sub-plurality of sensor pixels;

generating a first thresholded mapping from a first coordinate mapping by removing each interpolated pixel- value, and array-coordinate mapped thereto, having a first confidence value less than a threshold value, the first coordinate mapping including each of the second and the third sub-plurality of array-coordinates mapped to a respective one of a first plurality of interpolated pixel- values;

repeating the steps of computing and generating for the second sub-plurality of sensor pixels to yield a second thresholded mapping;

repeating the steps of computing and generating for the third sub-plurality of sensor pixels to yield a third thresholded mapping;

determining a plurality of high-confidence array-coordinates as array-coordinates, of the plurality of array-coordinates, included in each of the first, second, and third thresholded mappings, remaining array-coordinates being a plurality of low-confidence array-coordinates; forming a refined image that includes, at each of the plurality of high-confidence array- coordinates, a respective pixel- value-triplet including one primary pixel- value and two interpolated pixel-values; and filling the refined image by assigning, for each of the plurality of low-confidence array-coordinates, a pixel-value based on pixel- values of neighboring high-confidence array- coordinates.

2. The method of claim 1, each of the plurality of low-confidence array-coordinates having an associated primary pixel- value of one of the first, second, and third coordinate mapping, the step of filling comprising, for each of the plurality of low-confidence array- coordinates proximate a sub-plurality of the plurality of high-confidence array-coordinates, computing a plurality of weights each corresponding to a respective one of a sub plurality of high-confidence array-coordinates, each of the plurality of weights being determined by at least one of a distance between the high-confidence array-coordinates and the low-confidence array-coordinate and a difference between pixel- values of neighboring high-confidence array-coordinates to the low-confidence array-coordinate's associated primary pixel-value; and

when a sum of the plurality of weights exceeds a predetermined weight-threshold, computing the assigned pixel-value as an average of each pixel- value, of the sub-plurality of high-confidence array-coordinates, multiplied by its corresponding one of the plurality of weights.

3. The method of claim 2, in the step of computing the plurality of weights, each of the plurality of weights being a function of a proximity metric that is a monotonically decreasing function of the distance.

4. The method of claim 2 or claim 3, in the step of computing the plurality of weights, each of the plurality of weights being a function of a similarity metric that is a monotonically decreasing function of the difference.

5. The method of any preceding claim, in the step of computing, each of the plurality of first confidence values being based on at least one of a relative difference and a standard deviation of the neighboring primary-pixel- values.

6. The method of any preceding claim, further comprising generating the first coordinate mapping.

7. The method of any one of claims 2 to 6, the low-confidence array-coordinate's primary pixel-value being associated with the first color filter, and further comprising:

computing a plurality of scaling factors each corresponding to a respective one of the sub-plurality of high-confidence array-coordinates, each of the plurality of scaling factors being proportional to a ratio of the low-confidence array-coordinate's primary pixel-value to the pixel- value at the high-confidence array-coordinate associated with the first color filter; and

when the sum exceeds the predetermined weight-threshold, computing the assigned pixel- value as an average of each pixel-value, of the sub-plurality of high-confidence array- coordinates, multiplied by its corresponding one of the plurality of weights and its corresponding one of the plurality of scaling factors.

8. The method of any one of claims 2 to 7, when the sum of the plurality of weights is less than the predetermined weight-threshold, setting the assigned pixel-value proportional to a pixel-value associated a most proximate of the plurality of neighboring high-confidence array-coordinates that has a first, second, and third pixel- value, corresponding to the first, second, and third color filters respectively, that satisfy a color-neutrality condition.

9. An image demosaicer for processing an image captured by an image sensor having an arrayed plurality of sensor pixels each located at a respective one of a plurality of array- coordinates, the plurality of sensor pixels including at a first sub-plurality of array- coordinates, a first sub-plurality of sensor pixels each filtered by a respective first color filter, at a second sub-plurality of array-coordinates, a second sub-plurality of sensor pixels filtered by a respective second color filter, and at a third sub-plurality of array-coordinates, a third sub-plurality of sensor pixels filtered by a respective third color filter, comprising:

a memory storing non-transitory computer-readable instructions and adapted to store the image;

a microprocessor adapted to execute the instructions to:

compute, for each of a first plurality of interpolated pixel-values and based on neighboring primary pixel- values, a respective one of a plurality of first confidence values each corresponding to an array-coordinate of either the second or the third plurality of array-coordinates, the first plurality of interpolated pixel- values being interpolated from neighboring primary pixel- values, of a first plurality of primary pixel-values, generated by the first sub-plurality of sensor pixels;

generate a first thresholded mapping from a first coordinate mapping by removing each interpolated pixel- value, and array-coordinate mapped thereto, having a first confidence value less than a threshold value, the first coordinate mapping including each of the second and the third plurality of array-coordinates mapped to a respective one of a first plurality of interpolated pixel-values;

repeat the steps of computing and generating for the second sub-plurality of sensor pixels to yield a second thresholded mapping;

repeat the steps of computing and generating for the third sub-plurality of sensor pixels to yield a third thresholded mapping;

determine a plurality of high-confidence array-coordinates as array- coordinates, of the plurality of array-coordinates, included in each of the first, second, and third thresholded mappings, the remaining array-coordinates being a plurality of low-confidence array-coordinates ;

form a refined image that includes, at each of the plurality of high-confidence array-coordinates, a respective pixel-value-triplet including one primary pixel- value and two interpolated pixel-values; and

fill the refined image by assigning, for each of the plurality of low-confidence array-coordinates, a pixel-value based on pixel- values of neighboring high-confidence array-coordinates.

10. The image demosaicer of claim 9, each of the plurality of low-confidence array- coordinates having an associated primary pixel-value of one of the first, second, and third coordinate mapping, the microprocessor being further configured to, in the step of filling and for each of the plurality of low-confidence array-coordinates proximate a sub-plurality of the plurality of high-confidence array-coordinates,

compute a plurality of weights each corresponding to a respective one of a sub plurality of high-confidence array-coordinates, each of the plurality of weights being determined by at least one of: a distance between the high-confidence array-coordinates and the low-confidence array-coordinate and similarity of pixel- values of neighboring high- confidence array-coordinates to the low-confidence array-coordinate's associated primary pixel-value; and

when a sum of the plurality of weights exceeds the predetermined weight-threshold, compute the assigned pixel-value as a weighted average of pixel- values of the sub-plurality of high-confidence array-coordinates.

11. The image demosaicer of claim 9 or claim 10, in the step of computing, each of the plurality of first confidence values being based on at least one of a relative difference and a standard deviation of the neighboring primary-pixel-values.

12. The image demosaicer of any one of claims 10 to 11, each of the plurality of weights being a function of a proximity metric that is a monotonically decreasing function of the distance.

13. The image demosaicer of any one of claims 10 to 12, each of the plurality of weights being a function of a similarity metric that is a monotonically decreasing function of the difference.

14. The image demosaicer of any one of claims 9 to 13, the microprocessor being further adapted to, when the plurality of high-confidence array-coordinates includes an isolated high- confidence array-coordinate completely surrounded by low-confidence array-coordinates, designate the isolated high-confidence array-coordinate as a low-confidence array-coordinate.

15. The image demosaicer of any one of claims 10 to 14, the microprocessor being further adapted to, when the sum of the plurality of weights is less than the predetermined weight- threshold, set the assigned pixel- value proportional to a pixel-value associated a most proximate of the plurality of neighboring high-confidence array-coordinates that has, a first, second, and third pixel- value, corresponding to the first, second, and third color filters respectively, that satisfy a color-neutrality condition.

Description:
IMAGE DEMOSAICING SYSTEM AND METHOD

CROSS REFERENCE TO RELATED APPLICATIONS

[0001] This application claims priority to U.S. Provisional Application No.

62/617,709 and European Patent Application No. 18151852.3, both filed on January 16,

2018; and each of which is incorporated by reference in its entirety.

BACKGROUND

[0002] Accurate rendering of high-dynamic range (HDR) images and video requires an image processor configured to demosaic a raw image received by a camera such that the resulting image is free of artifacts introduced by the demosaicing process. Color artifacts is a common problem in existing demosaicing processes.

In K.-H. Chung et al“Color Demosaicing Using Variance of Color Differences” IEEE Transactions on Image Processing, volume 15, issue 10, October 2006, pages 2944-2955, an adaptive demosaicing algorithm is presented. Missing green samples are first estimated based on the variances of the color differences along different edge directions. The missing red and blue components are then estimated based on the interpolated green plane. This algorithm may preserve the details in texture regions and, at the same time, it may reduce the color artifacts. Further, in Ji Won Lee et al“Adaptive demosaicing algorithm using characteristics of color filter array pattern” in“Deformation models”, 17 December 2013, Springer Netherlands, Dordrecht, volume 11, pages 29-53, the color filter array (CFA) image is interpolated considering the correlation between color channels. The proposed method estimates the horizontal and vertical interchannel differences directly in the CFA image to determine the direction of interpolation. Then, three color components (R/G/B) are interpolated along the estimated horizontal and vertical directions considering the differences of absolute interchannel differences and a post-processing is included to improve the interpolated image.

SUMMARY OF THE EMBODIMENTS

[0003] Embodiments disclosed herein remedy the aforementioned color artifacts problem of existing demosaicing processes. A method for demosaicing an image captured by an image sensor is disclosed. The image sensor has an arrayed plurality of sensor pixels each located at a respective one of a plurality of array-coordinates. The plurality of sensor pixels includes (i) at a first sub-plurality of array-coordinates, a first sub-plurality of sensor pixels each filtered by a respective first color filter, (ii) at a second sub-plurality of array- coordinates, a second sub-plurality of sensor pixels filtered by a respective second color filter, and (iii) at a third sub-plurality of array-coordinates, a third sub-plurality of sensor pixels filtered by a respective third color filter. The method includes steps of computing, generating, determining, forming, and filling.

[0004] The step of computing includes computing, for each of a first plurality of interpolated pixel-values and based on neighboring primary pixel- values, a respective one of a plurality of first confidence values each corresponding to an array-coordinate of either the second or the third plurality of array-coordinates. The first plurality of interpolated pixel- values is interpolated from neighboring primary pixel- values, of a first plurality of primary pixel- values, generated by the first sub-plurality of sensor pixels.

[0005] The step of generating includes generating a first thresholded mapping from a first coordinate mapping by removing each interpolated pixel-value, and array- coordinate mapped thereto, having a first confidence value less than a threshold value. The first coordinate mapping includes each of the second and the third plurality of array- coordinates mapped to a respective one of a first plurality of interpolated pixel-values.

[0006] The method also includes repeating the steps of computing and generating for the second sub-plurality of sensor pixels to yield a second thresholded mapping. The method also includes repeating the steps of computing and generating for the third sub plurality of sensor pixels to yield a third thresholded mapping.

[0007] The step of determining includes determining a plurality of high- confidence array-coordinates as array-coordinates, of the plurality of array-coordinates, included in each of the first, second, and third thresholded mappings, remaining array- coordinates being a plurality of low-confidence array-coordinates. The step of forming includes forming a refined image that includes, at each of the plurality of high-confidence array-coordinates, a respective pixel-value-triplet including one primary pixel- value and two interpolated pixel-values. The step of filling includes filling the refined image by assigning, for each of the plurality of low-confidence array-coordinates, a pixel- value based on pixel- values of neighboring high-confidence array-coordinates.

[0008] An image demosaicer for processing an image captured by an image sensor in disclosed. The image demosaicer includes a memory and a microprocessor. The memory stores non-transitory computer-readable instructions and adapted to store the image. The microprocessor adapted to execute the instructions to perform the aforementioned method.

BRIEF DESCRIPTION OF THE FIGURES

[0009] FIG. 1 depicts an HDR scene imaged by a camera onto an image sensor thereof.

[0010] FIG. 2A is a schematic plan view of a region of the image sensor of FIG. 1, and a corresponding region of a raw image generated therefrom, in an embodiment.

[0011] FIGs. 2B, 2C, and 2D are, respectively, example schematic views of a red channel, green channel, and blue channel generated from the raw image of FIG. 2.

[0012] FIG. 2E is a schematic view of a demosaiced image, which is a combination of the channels of FIGs. 2B-2D.

[0013] FIG. 3 is a schematic diagram of an image demosaicer configured to generate, from the raw image of FIG. 2, an output image that lacks edge-artifacts, in an embodiment.

[0014] FIGs. 4, 5, and 6 illustrate, respectively, example regions of a red, a green, and a blue confidence map corresponding to the red, green, and blue channel of FIGs. 2B,

2C, and 2D, respectively.

[0015] FIGs. 7, 8, and 9 depict example thresholded mappings of the red, green, and the blue confidence map of FIGs. 4, 5, and 6, respectively.

[0016] FIG. 10 illustrates examples of high-confidence array-coordinates that are, collectively, an example of high-confidence array-coordinates generated by the image demosaicer of FIG. 3.

[0017] FIG. 11 illustrates an example refined image generated from the color channels of FIGs. 2B-2D and the high-confidence array-coordinates of FIG. 10, in an embodiment.

[0018] FIG. 12 depicts an example of an output image generated from the refined image of FIG. 11 by the image demosaicer of FIG. 3, in an embodiment.

[0019] FIG. 13 is a flowchart illustrating a method for demosaicing an image captured by an image sensor, in an embodiment.

[0020] FIG. 14 is a flowchart illustrating a method for filling the refined image formed by the method of FIG. 13, in an embodiment. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0021] As an example illustrating advantages of embodiments presented herein, FIG. 1 depicts a camera 130 imaging a scene 120 having a high dynamic range of luminance. Scene 120 includes a plan view of a key 121 on a top surface 122T of a light box 122, which emits light. Camera 130 includes an imaging lens (not shown), an image sensor 132, a memory 110, and a microprocessor 102 communicatively coupled to image sensor 132.

Image sensor 132 includes a pixel array 134A, which may have a color filter array (CFA) 136 thereon. Pixel array 134A includes a plurality of pixels 134, not shown in FIG. 1 for clarity of illustration. Each color filter of CFA 136 is aligned with a respective pixel 134 of pixel array 134A. The imaging lens images scene 120 onto image sensor 132. Image sensor 132 also includes circuitry 138 that includes at least one analog-to-digital converter.

[0022] Each pixel 134 has a respective pixel charge corresponding to a respective intensity of light from a scene 120 imaged onto pixel array 134A. Circuitry 138 converts each pixel charge to a respective one of a plurality of pixel- values, which are stored in memory 110 as a raw image 194. Camera 130 may include a display 139 configured to display raw image 194 as a demosaiced image 196.

[0023] In scene 120, light box 122 emits light through top surface 122T. Key 121 is opaque and appears black, such that key 121 and top surface 122T have substantially different luminosities, and hence scene 120 has a high dynamic range of luminosity. Key 121 has an edge 121E, represented as a non-dashed curve about the perimeter of key 121. An accurate HDR image of scene 120 would include, at edge 121E, pixels with pixel-values corresponding to only black, white, or gray-scale pixel- values. However, a standard HDR imaging, demosaiced image 196 includes false-color edge artifacts, in which the image of edge 121E includes pixels having pixel-values corresponding to colors, rather than a gray- level. Embodiments presented herein, e.g., of image demosaicing methods and systems implementing these methods, produce a demosaiced image 196 without the aforementioned image artifacts.

[0024] FIG. 2A is a schematic plan view of a region of an image sensor 200 and a corresponding region of a raw image 202 generated by image sensor 200. Image sensor 200 and raw image 202 are positioned with respect to an x-y coordinate system 298.

[0025] Image sensor 200 is an example of image sensor 132, in which CFA 136 includes a plurality of red (R), green (G), and blue (B) color filters arranged in a Bayer pattern. Coordinates (x,y) denote locations of each color filter and pixel therebeneath. For example, image sensor 200 includes a red color filter at coordinate (ij), where i and j are integers. For example, G(i+l ,j) refers to the green color filter at coordinate (i+l,j). CFA 136 may include different color filters without departing from the scope hereof. For example,

CFA 136 may include arrays of at least one of cyan, magenta, yellow, and clear color filters. A clear color filter is transparent to at least one of visible and near-infrared light.

[0026] Raw image 202 is an example of raw image 194, and includes a plurality of primary pixel-values P r , a plurality of primary pixel- values P g , and a plurality of primary pixel- values P b . Raw image 202 may include an imaged-edge 204, which is, for example, an image of a region of edge 121E. FIG. 2 A illustrates imaged-edge 204 schematically as a skew line with respect to row and columns of pixel array 134A and CFA 136.

[0027] Each primary pixel-value P r is generated by a respective pixel 134 beneath a red color filter of CFA 136. Each primary pixel- value P g is generated by a respective pixel 134 beneath a green color filter of CFA 136. Each primary pixel-value P b is generated by a respective pixel 134 beneath a blue color filter of CFA 136. For example, primary pixel- values P r , P g , and P b at respective coordinates (i,j), (i,j+ 1), and ( i+ 1 ,j+ 1 ) are generated by respective pixels of image sensor 200 at the same respective coordinates (i,j), (i,j+ 1), and (i+l +l). Expressed more concisely, and introducing a notational convention used herein, primary pixel-values P r (i,j), P g (i,j+ 1), and P b (i+l,j+l) are generated by respective pixels of image sensor 200 beneath color filters R (i,j), G(i,j+ \ ), and B( i+ l j+ l ).

[0028] FIGs. 2B, 2C, and 2D are, respectively, schematic views of a red channel 210, a green channel 220, and a blue channel 230 generated from raw image 194. Channels 210, 220, and 230 are positioned with respect to x-y coordinate system 298.

[0029] Red channel 210 includes primary pixel- values P r of raw image 194 at locations corresponding to red pixels of CFA 136. Red channel 210 also includes, for each primary pixel-value P r , three interpolated pixel-values p r , which are interpolated from neighboring primary pixel- values P r . Each interpolated pixel-value p r is mapped to a respective coordinate (x,y), such that red channel 210 includes a coordinate mapping of a plurality of coordinates (x,y) to one of a respective plurality of interpolated pixel- values p r .

[0030] Green channel 220 includes primary pixel- values P g of raw image 194 at locations corresponding to green color filters of CFA 136. Green channel 220 also includes, for each primary pixel- value P g , two interpolated pixel-values p g , which are interpolated from neighboring primary pixel-values P G . Each interpolated pixel- value p g is mapped to a respective coordinate (x,y), such that green channel 220 includes a coordinate mapping of a plurality of coordinates (x,y) to one of a respective plurality of interpolated pixel- values p g .

[0031] Blue channel 230 includes primary pixel- values P b of raw image 194 at locations corresponding to blue pixels of CFA 136. Blue channel 230 also includes, for each primary pixel-value P b , three interpolated pixel- values p b , which are interpolated from neighboring primary pixel- values P b . Each interpolated pixel-value p b is mapped to a respective coordinate (x,y), such that blue channel 230 includes a coordinate mapping of a plurality of coordinates (x,y) to one of a respective plurality of interpolated pixel- values p b .

[0032] FIG. 2E is a schematic view of a demosaiced image 240, which is a combination of red channel 210, green channel 220, and blue channel 230. Demosaiced image 240 includes a plurality of display pixels each associated with a pixel- value triplet that includes one primary pixel-value (P r , P g , or P b ) and two interpolated pixel-values (p r , p g , or p b ). Demosaiced image 240 may include edge artifacts similar to those in demosaiced image 196 at edge 121E.

[0033] FIG. 3 is a schematic diagram of an image demosaicer 300 configured to generate, from raw image 202, a demosaiced image 339 that lacks edge- artifacts. Image demosaicer 300 includes a microprocessor 302 and a memory 310 that stores software 320 that includes computer-readable instructions. Microprocessor 302 may be a digital signal processor such as an image processor. Memory 310 may be transitory and/or non-transitory and may include one or both of volatile memory (e.g., SRAM, DRAM, VRAM, or any combination thereof) and nonvolatile memory (e.g., FLASH, ROM, magnetic media, optical media, or any combination thereof).

[0034] Memory 310 and microprocessor 302 may function as memory 110 and microprocessor 102, respectively, of camera 130, FIG. 1. Microprocessor 302 is adapted to execute the instructions to perform functions of image demosaicer 300 as described herein. Memory 310 may store at least one of primary pixel- values 311, a confidence threshold 312, a weight threshold 319T, coordinate mappings 331, confidence values 333, thresholded mappings 335, low-confidence array-coordinates 337L, high-confidence array-coordinates 337H, refined image 338, and demosaiced image 339. Computer-readable instructions of software 320 includes an interpolator 321, a confidence assessor 323, a thresholder 325, a conjunction operator 327, an image generator 328, and an image filler 329. Image filler 329 may include at least one of a scaling function 318 and a weight function 319, either of which may be stored as a look-up table. Pixels located at low-confidence array-coordinates 337L and high-confidence array-coordinates 337H may be referred to as low-confidence pixels and high-confidence pixels respectively.

[0035] Primary pixel-values P r , P g , and P b of raw image 202, FIG. 2, are examples of primary pixel-values 311. Coordinate mappings 331(1,2,3) include respective interpolated pixel-values 332(1,2,3). Interpolated pixel-values p r , p g , and p b of channels 210, 220, and 230 are examples of interpolated pixel-values 332(1,2,3), respectively. Accordingly, channels 210, 220, and 230, which include interpolated pixel-values mapped to coordinates, are, respectively examples of coordinate mappings 331(1), 331(2), and 331(3).

[0036] Primary pixel-values 311 and demosaiced image 339 may be stored in memory 310 in either an image file format, such as JPEG and TIFF, or a raw image format, such as TIFF/EP and Digital Negative (DNG). Pixel-values 311, 332 and demosaiced image 339 may be stored in a same format or a different format. In an embodiment, at least one of pixel- values 311, 332 and demosaiced image 339 are stored in a volatile memory of memory 310, and demosaiced image 339 is stored in a nonvolatile memory of memory 310.

[0037] FIGs. 4-6 illustrate regions of, respectively, a red confidence map 410, a green confidence map 510, and a blue confidence map 610. Confidence maps 410, 510, and

610 include, respectively, a plurality of confidence values 411, 511, and 611. Confidence values 411 are, collectively, an example of confidence value 333(1) generated by confidence assessor 323 and stored in memory 310 of image demosaicer 300. Confidence values 511 are, collectively, an example of confidence value 333(2). Confidence values 611 are, collectively, an example of confidence value 333(3).

[0038] As shown in FIG. 4, each of the plurality of confidence values 411 are mapped to a respective coordinate (x,y) of red channel 210. For example, confidence value 41135 is mapped to (x,y) coordinate (3,5). Red confidence map 410 is shown with respect to a coordinate system 498, which is an example of coordinate system 298 with i = 2 and j = 3.

[0039] As shown in FIG. 5, each of the plurality of confidence values 511 are mapped to a respective coordinate (x,y) of green channel 220. For example, confidence value 51123 is mapped to (x,y) coordinate (2,3). Green confidence map 510 is shown with respect to coordinate system 498.

[0040] As shown in FIG. 6, each of the plurality of confidence values 611 are mapped to a respective coordinate (x,y) of blue channel 230. For example, confidence value

61123 is mapped to (x,y) coordinate (2,3). Blue confidence map 610 is shown with respect to coordinate system 498. [0041] In general, each confidence value 411^, 5l l xy , 611 xy may be indicative of a spatial similarity (e.g. a pixel intensity evolution in a region) or a spectral similarity (e.g. a correlation of different spectral bands) of neighboring primary-pixel-values from which the interpolated pixel-value at coordinate (x,y) was computed. Each confidence value 4l l xy , 511 611 y may be, for example, indicative of the degree of uniformity of neighboring primary- pixel- values from which the interpolated pixel- value at coordinate (x,y) was computed. Such uniformity may be, for example, a relative difference or standard deviation of neighboring primary-pixel- values. In confidence map 410, FIG. 4, confidence value 411 24 is, for example, a relative difference of side-adjacent primary pixel-values P r at coordinates (2,3) and (2,5). Confidence value 41134 is , for example, a standard deviation of corner-adjacent primary pixel- values P r at coordinates (2,3), (2,5) (4,3), and (4,5). In confidence map 510, FIG. 5, confidence value 51 134 is, for example, a standard deviation of side-adjacent primary pixel- values P g at coordinates (2,4), (3,3) (3,5), and (4,4). In confidence map 610, FIG. 6, confidence value 6I I24 is, for example, a relative difference of side-adjacent primary pixel- values P b at coordinates (1,4) and (3,4). Confidence value 6II23 is, for example, a standard deviation of corner-adjacent primary pixel-values P b at coordinates (1,2), (1,4) (3,2), and (3,4).

[0042] Image demosaicer 300 may implement thresholder 325 to compare each confidence value of confidence maps 410, 510, and 610 to confidence threshold 312. Such a comparison results, for example, in thresholded mappings 735, 835, and 935 of FIGs. 7, 8, and 9, respectively. Thresholded mappings 735, 835, and 935 are examples of thresholded mapping 335(1), 335(2), and 335(3), respectively. Confidence threshold 312 is, for example, a decreasing function of a relative difference or standard deviation of primary pixel- values, such that confidence value monotonically increases as either the relative difference or standard deviation decreases.

[0043] Thresholded mappings 735, 835, and 935 are, respectively, confidence maps 410, 510, and 610 with removal of confidence values 411, 511, and 611 that are less than confidence threshold 312. Confidence values 411, 511, and 611 that are less than confidence threshold 312 are those corresponding to pixels located near imaged-edge 204, and are marked with an x-mark ( X ) in FIGs. 7-9. For example, confidence value 41133 is likely to be less than confidence threshold 312 because the interpolated red pixel- value at coordinate (3,3) is computed from primary pixel-values P r ( 2,3) and P r( 4,3) (at respective coordinates (2,3) and (4,3)), which are on opposite sides of imaged-edge 204, and hence have pixel- values that differ significantly. For similar reasons, other confidence values 41 l y in shaded regions are also likely to be less than confidence threshold 312, depending on the specific value of confidence threshold 312. For example, confidence value 41135 may be determined as a relative difference between primary pixel-values P r ( 2,5) and P r (4,5). Since the sensor pixel at coordinate (2,5) is mostly on the same side as the sensor pixel at coordinate (4,5), the respective pixel- values may be sufficiently close such that confidence value 41135 exceeds confidence threshold 312.

[0044] FIG. 10 illustrates high-confidence array-coordinates 1037H, which are an example of high-confidence array-coordinates 337H generated by conjunction operator 327 of image demosaicer 300. High-confidence array-coordinates 1037H include those coordinates marked with ordered pairs, and does not include low-confidence array- coordinates 1037L, marked with X , which are examples of low-confidence array-coordinates 337L.

[0045] A coordinate of thresholded mappings 735, 835, and 935 qualifies for inclusion in high-confidence array-coordinates 1037H only if, for each of thresholded mappings 735, 835, and 935, either (a) the coordinate's confidence value exceeds confidence threshold 312 or (b) the coordinate corresponds to a primary pixel-value. Otherwise, the coordinate is one of low-confidence array-coordinates 1037L, e.g., those marked with X in FIG. 10. For example, high-confidence array-coordinates 1037H include coordinate (2,2) because confidence values 411 22 and 6I I22 exceed confidence threshold 312 and coordinate (2,2) corresponds to a primary pixel- value P g ( 2,2).

[0046] A high-confidence coordinate may be an isolated high-confidence array coordinate, e.g., one having no immediate neighboring high-confidence coordinates 1037H and/or being completely surrounded by low-confidence array coordinates. An isolated high- confidence coordinate may be reassigned or designated, e.g., by conjunction operator 327, as a low-confidence array-coordinate 1037L. Examples of an immediate neighboring coordinate include at least of a side-adjacent coordinate and a comer- adjacent coordinate.

[0047] FIG. 11 illustrates a refined image 1100, which is an example of refined image 338 generated by image generator 328 of image demosaicer 300 from high-confidence array-coordinates 1037H and channels 210, 220, and 230. Refined image 1100 is demosaiced image 240, FIG. 2, after removal of interpolated pixel-values corresponding to low- confidence array-coordinates 1037L. Removed interpolated pixel-values are designated by an X . Low-confidence array-coordinates 1037L with two X marks have only one high- confidence pixel- value. Low-confidence array-coordinates 1037L marked just one X mark include two high-confidence pixel-values: one primary pixel- value P a and one non-primary pixel- value p a . Examples of such low-confidence array-coordinates 1037L with two high- confidence pixel-values include coordinates (2,3), (3,2), and (3,5).

[0048] FIG. 12 illustrates a demosaiced image 1200, which is example of demosaiced image 339 generated by image filler 329 of image demosaicer 300. Demosaiced image 1200 is refined image 1100 with the addition of assigned pixel- values V a at low- confidence array-coordinates 1037L. In the following discussion, (x 1 ,y ) denotes the low- confidence array coordinate, which is also referred to as a target coordinate. Target coordinate (x 1 ,y 1 ) has an associated primary pixel- value P a( x 1 ,y x ) and may also have a non primary pixel-value p a (x x ,y t ). Hereinafter, high-confidence target coordinate P a ( x ,y ) denotes either P a (x t ,yi) or p a (xi Ai)· Subscript a denotes one of r, g, and b, and assigned pixel- values V r , V g , and V b are red, green, and blue pixel-values respectively.

[0049] Image filler 329 may employ weight function 319 to compute assigned pixel- value V a from neighboring high-confidence pixel-values: primary pixel- values P a and/or neighboring non-primary pixel- values p a . Herein, a target pixel's neighboring pixel- values are also referred to as source pixel- values corresponding to source coordinates ( x , y). Hereinafter, a (x,y) denotes either primary pixel- value P a (x,y ) or non-primary pixel-value p a (x,y). Weight function 319, herein also referred to as weight w a (x, y), may produce a weighted average of neighboring pixel-values within a radius R of a target pixel. Weight w a( x, y) may be a combination of a proximity metric P(c, y) and similarity metric s a (c, y). For example, weight w a (x, y) is a product or linear combination of proximity metric P(c, y) and similarity metric o a( x, y).

[0050] In an embodiment, for a target pixel located at target coordinate (x 1 ,y 1 ), an assigned pixel-value 1 ( ,yi) is a weighted average of neighboring high-confidence pixel- values a (x,y) ( P a (x,y ) and/or p a (x, y)) where each neighboring pixel-value is weighted by weight w a (x, y) and (x,y) ¹ (x t Note that, for a given color a, only one of a primary pixel- value P a (x,y ) and an interpolated pixel-value p a (x, y) is associated with a given coordinate (x,y). Assigned pixel- value 1 (A L A I ) ma y t> e expressed as V a (x 1 ,y 1 ) = may equal U a (x, g)s a (x, y) .

[0051] Proximity metric P(c, y) may be expressed as a monotonically decreasing function of distance d, where distance d = g (x— x x ) 2 + (y— y t ) 2 is the distance between source coordinates (x,y) and target coordinates (x 1 ,y 1 ) . For example, Il(x, y) = exp(— c/ 2 /(2p 2 )), where p = R/r 0 . Constant r 0 may be chosen such that proximity metric P(c, y) is between 0.20, and 0.25 when d=R. Radius R is, for example, seven sensor- pixel widths and r 0 = 1.3+0.1. Proximity metric 11(d) may equal zero for d > R.

[0052] Similarity metric s a (c, y) may decrease as a function of an increasing relative difference between a primary pixel-value P a (xi,yi) at target coordinate (xi,yi) and the same-color pixel-value T a (x,y) (either pixel- value p a (x,y) or primary pixel- value P a (x,y), depending on (x, y)) at the source coordinate (x,y). For example, a similarity metric may be expressed by s a (c, y) = c 1 /(c 1 + A m ), where A m > 0. Difference D is, for example, a relative difference between source pixel-value a (x,y) and a high-confidence target pixel- value, e.g., primary pixel-value P a (xi,yi) or, when applicable, non-primary pixel-value P a (xi > yi)· The ratio of constant c x to a maximum value of proximity metric Il(x, y) is, for example, 0.02 ± 0.01. Exponent m equals two, for example.

[0053] To match brightness of an assigned pixel-value V a with its neighboring pixel- values (P a , p a ), image filler 329 may implement scaling function 318 to scale assigned pixel- value V a by a scaling factor K. That is, K(X, y)w a (x, y)T a (x, y) . A first example of scaling factor k applies to an assigned pixel- value V a corresponding to a low- confidence array coordinate (xi,yi) with just one high-confidence pixel- value

R a ( c i > Ύi) = P < x( x i > i)· In suc h a case, the scaling factor k at a source coordinate (x,y) is the ratio of the target pixel's high-confidence pixel-value (at (xi,yi)) to the same-color pixel- value at the source pixel (at (x, y)). For example, at x t =2 and y x = 4 in FIG. 11, the high- confidence pixel- value is P r (2,4) (red). At (x 1 ,y 1 )=(2,4), scaling factor K(X, y) may be expressed as /c(x, y) = (P r (2,4) + c K )/ (P r (x, y) + c K ).

[0054] Constant c K prevents scaling factor k from having extremely large or small values as a result one or both of P r (2,4) and P r (x, y) being near the noise floor of primary pixel- values 311 , in which case the ratio P r (2,4)/ P r (x, y) is not meaningful for determining assigned pixel-values V r , V g , and V b . For pixel- values having a bit depth equal to sixteen, where the maximum pixel-values are 2 16 constant c K may be in the range of 2 2 to 2 4 , c K = 10, for example. In general, constant c K may exceed the noise floor of primary pixel- values 311 and be less than ten times the noise floor. Alternatively, constant c K may equal zero.

[0055] A second example of scaling factor k applies to an assigned pixel- value V a corresponding to a target low-confidence array coordinate (xi,yi) with two high-confidence pixel-values, e.g., a first and a second high-confidence pixel-value. In such a case, the scaling factor K at a source coordinate (x,y) is a sum of (a) a ratio of the first high-confidence pixel- value to the same-color pixel-value at the source pixel and (b) a ratio of the second high- confidence pixel- value to the same-color pixel- value at the source pixel. For example, at x x =2 and y 1 =3 in FIG. 11, the high-confidence pixel- values are P r ( 2,3) (red) and p g ( 2,3). At ( i, y 1 )=(2,3), scaling factor K(X, y) at source coordinate (x,y) is an average of two ratios:

[0056] Whether assigned pixel-value 1 ( c iAi) i s a weighted average of neighboring pixel- values may depend a sum å of weights w a (x, y ) exceeding a predetermined threshold t, which is example of weight threshold 319T. For example, when R = 7 ± 1, threshold t = 0.2 ± 0.1. The sum of weights w a (x, y) may be computed, e.g., by image filler 329, for all values of d, or be limited to d < R.

[0057] In a first embodiment, when sum å does not exceed threshold t, image filler 329 may set assigned pixel-value 1 ( c iAi) to equal to the primary pixel- value at (xi,yi). For example, at coordinate (4,2) in demosaiced image 1200, the primary pixel-value is P g( 4,2). If sum å of weights w r (x, y) and/or w b (x, y) does not exceed threshold t, then image filler 329 may set 1(44,2) and/or 14(4,2) to equal P g ( 4,2). Setting both values of 1(44,2) and 14(4,2) in this way contributes to demosaiced image 1200 having a neutral color (e.g., a shade of gray) at coordinate (4,2), and hence avoids introducing the aforementioned color artifacts at imaged edges. The following two embodiments include alternative means of avoiding said artifacts.

[0058] In a second embodiment, when sum å does not exceed threshold t, and target array-coordinate ( i,yi) has a high-confidence pixel-value R b (c1 ,g 1 ) , where b is first color channel of raw image 194, image filler 329 may determine assigned pixel-value V a (xi,yi) as equal to a high-confidence pixel-value P a (x s , y s ), where Pf j (x s , y s ) is closest to b(c 1 ,g 1 ) of all source array-coordinates (x, y) within a predetermined distance, e.g., radius R, from target array-coordinate (x 1 ,y 1 ). In this example, a is a second color channel of raw image 194 differing from the first channel corresponding to b.

[0059] In a third embodiment, when sum å does not exceed threshold t, image filler 329 may determine assigned pixel-value 1 ( c iAi) according to a neutral source pixel- value P " a (x n , y n ). Neutral array-coordinate (x n , y n ) corresponds to the high-confidence array- coordinate (x,y) within a predetermined distance, e.g., radius R, of the target array-coordinate (xi,yi) that has the most neutral pixel-value. Neutral pixel-values may correspond to a shade of gray. When pixel- value triplet P r,g,b (X y) satisfies the metric, image filler 329 may deem it "neutral." Image filler 329 may determine deem a plurality of pixel-value triplets as sufficiently neutral, and determine neutral source pixel-value T a (x n , y n ) as the one of the plurality of pixel-value triplets most proximate to target array-coordinate (x 1 ,y 1 ). To match brightness of the high-confidence target pixel-value, scaling function 318 may scale neutral source pixel- value a (x n , y n ) according to the known primary pixel- value at target array-coordinate (x 1 ,y 1 ).

[0060] For example, at coordinate (4,2) in demosaiced image 1200, the primary pixel- value is P g ( 4,2), and the most neutral neighboring pixel may be at array-coordinate (4,4). If sum å of weights w r (x, y) and/or w b ( x, y) does not exceed threshold t, then image filler 329 may set 14(4,2) equal to p r (4,4) multiplied by scaling factor K g =

{P g ( 4,2) + c fe )/(P g (4,4) + c fc ) and 14(4,2) equal to p b ( 4,4) multiplied by scaling factor K b = (J¾( 4,2) + c fc )/(P 6 (4,4) + c k .

[0061] Embodiments disclosed herein may employ one or more metrics for quantifying the neutrality of a pixel- value. For example, a metric for pixel- value neutrality at coordinate (x,y) includes standard deviation or variance of the average of three pixel-values P r ,g,b (X ) · A metric may include saturation of P r g b (x, y) , where neutrality is inversely correlated to saturation. Saturation is as expressed, for example, by a quantity

(l— min P r , P g , 3 3 b )/Y), where relative luminance

cr+c g + c b = 1. Coefficients c r , c g , and c b are respectively, 0.3, 0.6, and 0.1, for example. Saturation may also be quantified from a pixel- value triplet ?V„ g,& (X y) > according to definitions of saturation of a color space, such as HSL or HSV.

[0062] FIG. 13 is a flowchart illustrating a method 1300 for demosaicing an image captured by an image sensor. The image sensor includes an arrayed plurality of sensor pixels each located at a respective one of a plurality of array-coordinates. The plurality of sensor pixels includes (i) at a first sub-plurality of array-coordinates, a first sub-plurality of sensor pixels each filtered by a respective first color filter, (ii) at a second sub-plurality of array-coordinates, a second sub-plurality of sensor pixels filtered by a respective second color filter, and (iii) at a third sub-plurality of array-coordinates, a third sub-plurality of sensor pixels filtered by a respective third color filter. [0063] Method 1300 is, for example, implemented within one or more aspects of image demosaicer 300. For example, method 1300 is implemented by microprocessor 302 executing computer-readable instructions of software 320. Method 1300 includes at least one of steps 1310, 1320, 1330, 1340, 1350, 1360, 1370, and 1380.

[0064] Step 1310 includes generating a first coordinate mapping including each of the second and third plurality of array-coordinates mapped to a respective one of a first plurality of interpolated pixel- values interpolated from neighboring primary pixel- values. The neighboring primary pixel- values are a sub-plurality of a first plurality of primary pixel- values generated by the first sub-plurality of sensor pixels. In an example of step 1310, interpolator 321 generates, from primary pixel- values 311(1), coordinate mapping 331(1), which includes interpolated pixel-values 332(1). Red channel 210, FIG. 2B, is example of coordinate mapping 331(1).

[0065] Step 1320 includes computing, for each of the first plurality of interpolated pixel- values and based on neighboring primary pixel- values, a respective one of a plurality of first confidence values. Each of the plurality of first confidence values corresponds to an array-coordinate of either the second or third plurality of array-coordinates. In an example of step 1320, confidence assessor 323 computes confidence values 333(1) from interpolated pixel-values 332(1) and neighboring pixel-values of primary pixel-values 311(1). Confidence values 411, FIG. 4, are examples of confidence values 333(1).

[0066] Step 1330 includes generating a first thresholded mapping from the first coordinate mapping by removing each interpolated pixel- value, and array-coordinate mapped thereto, having a first confidence value less than a threshold value. In an example of step 1330, thresholder 325 generates thresholded mapping 335(1), of which thresholded mapping 735 is an example, FIG. 7.

[0067] Step 1340 includes repeating the steps 1310, 1320, and 1330 for the second sub-plurality of sensor pixels to yield a second thresholded mapping. In an example of step 1310, as executed within step 1340, interpolator 321 generates, from primary pixel- values 311(2), coordinate mapping 331(2), which includes interpolated pixel- values 332(2). Green channel 220, FIG. 2C, is an example of coordinate mapping 331(2). In an example of step 1320, as executed within step 1340, confidence assessor 323 computes confidence values 333(2) from interpolated pixel-values 332(2) and neighboring pixel-values of primary pixel- values 311(2). Confidence values 511, FIG. 5, are examples of confidence values 333(2). In an example of step 1330, as executed within step 1340, thresholder 325 generates thresholded mapping 335(2), of which thresholded mapping 835 is an example, FIG. 8. [0068] Step 1350 includes repeating the steps 1310, 1320, and 1330 for the second sub-plurality of sensor pixels to yield a third thresholded mapping. In an example of step 1310, as executed within step 1350, interpolator 321 generates, from primary pixel- values 311(3), coordinate mapping 331(3), which includes interpolated pixel-values 332(3). Blue channel 230, FIG. 2D, is an example of coordinate mapping 331(3). In an example of step 1320, as executed within step 1340, confidence assessor 323 computes confidence values 333(3) from interpolated pixel-values 332(3) and neighboring pixel-values of primary pixel- values 311(3). Confidence values 611, FIG. 6, are examples of confidence values 333(3). In an example of step 1330, as executed within step 1340, thresholder 325 generates thresholded mapping 335(3), of which thresholded mapping 935 is an example, FIG. 9.

[0069] Step 1360 includes determining a plurality of high-confidence array- coordinates as array-coordinates, of the plurality of array-coordinates, included in each of the first, second, and third thresholded mappings. The remaining array-coordinates, of the plurality of array-coordinates, not determined as high-confidence array-coordinates, are a plurality of low-confidence array-coordinates. In an example of step 1360, conjunction operator 327 determines high-confidence array-coordinates 337H from array-coordinates of coordinate mappings 331 included in each of thresholded mappings 335. The remaining coordinates are low-confidence array-coordinates 337L. High-confidence array-coordinates 1037H and low-confidence array-coordinates 1037L, FIG. 10, are respective examples of high-confidence array-coordinates 337H and low-confidence array-coordinates 337L.

[0070] Step 1370 includes forming a refined image that includes, at each of the plurality of high-confidence array-coordinates, a respective pixel- value-triplet including one primary pixel-value and two interpolated pixel-values. In an example of step 1370, image generator 328 forms refined image 338, of which refined image 1100, FIG. 11, is an example.

[0071] Step 1380 includes filling the refined image by assigning, for each of the plurality of low-confidence array-coordinates, a pixel- value based on pixel-values of neighboring high-confidence array-coordinates. In an example of step 1380, image filler 329 fills refined image 338 to yield demosaiced image 339, of which demosaiced image 1200 is an example. Demosaiced image 1200 includes assigned pixel- values V a at low-confidence array-coordinates 1037L.

[0072] FIG. 14 is a flowchart illustrating a method 1400 for filling the refined image formed by step 1370 of method 1300. Step 1380 may implement method 1400, which includes step 1410 and at least one of steps 1420 and 1430. [0073] Step 1410 includes, for each of the plurality of low-confidence array- coordinates, computing a plurality of weights each corresponding to a respective one of a sub-plurality of the plurality of high-confidence array-coordinates. Each of the plurality of weights is determined by at least one of (i) a distance between the high-confidence array- coordinates and the low-confidence array-coordinate and (ii) similarity of pixel-values of neighboring high-confidence array-coordinates to the low-confidence array-coordinate's associated primary pixel-value. In an example of step 1410, for each low-confidence array- coordinate 1037L, FIG. 10, image filler 329 computes weights w a (x, y).

[0074] Step 1420 includes, when a sum of the plurality of weights, associated with one low-confidence array-coordinate, is less than a predetermined weight-threshold, setting the assigned pixel-value proportional to a pixel- value associated a most proximate of the plurality of neighboring high-confidence array-coordinates that has, a first, second, and third pixel-value, corresponding to the first, second, and third color filters respectively, that satisfy a color-neutrality condition. In an example of step 1420, image filler 329 sets V r (4,2) equal to p r (4,4) multiplied by scaling factor K g = (P g 4,2) + c fe )/(P g (4,4) + c fc ) and 14(4,2) equal to p b ( 4,4) multiplied by scaling factor tc b = (P b (4,2) + c k )/(P b ( 4,4) + c k ).

[0075] Step 1430 includes, when the sum of the plurality of weights, associated with one low-confidence array-coordinate, exceeds the predetermined weight-threshold, computing the assigned pixel-value as the weighted average of pixel-values. In an example of step 1430, image filler 329 computes assigned pixel-value V a( x 1 ,y ) of demosaiced image 1200, FIG. 12.

Combinations of features

[0076] Features described above as well as those claimed below may be combined in various ways without departing from the scope hereof. The following examples illustrate some possible, non- limiting combinations:

[0077] (Al) denotes a method for demosaicing an image captured by an image sensor. The image sensor has an arrayed plurality of sensor pixels each located at a respective one of a plurality of array-coordinates. The plurality of sensor pixels includes (i) at a first sub-plurality of array-coordinates, a first sub-plurality of sensor pixels each filtered by a respective first color filter, (ii) at a second sub-plurality of array-coordinates, a second sub plurality of sensor pixels filtered by a respective second color filter, and (iii) at a third sub plurality of array-coordinates, a third sub-plurality of sensor pixels filtered by a respective third color filter. The method includes steps of computing, generating, determining, forming, and filling.

[0078] The step of computing includes computing, for each of a first plurality of interpolated pixel-values and based on neighboring primary pixel- values, a respective one of a plurality of first confidence values each corresponding to an array-coordinate of either the second or the third plurality of array-coordinates. The first plurality of interpolated pixel- values is interpolated from neighboring primary pixel- values, of a first plurality of primary pixel- values, generated by the first sub-plurality of sensor pixels.

[0079] The step of generating includes generating a first thresholded mapping from a first coordinate mapping by removing each interpolated pixel-value, and array- coordinate mapped thereto, having a first confidence value less than a threshold value. The first coordinate mapping includes each of the second and the third plurality of array- coordinates mapped to a respective one of a first plurality of interpolated pixel-values.

[0080] The method also includes repeating the steps of computing and generating for the second sub-plurality of sensor pixels to yield a second thresholded mapping. The method also includes repeating the steps of computing and generating for the third sub plurality of sensor pixels to yield a third thresholded mapping.

[0081] The step of determining includes determining a plurality of high- confidence array-coordinates as array-coordinates, of the plurality of array-coordinates, included in each of the first, second, and third thresholded mappings, remaining array- coordinates being a plurality of low-confidence array-coordinates. The step of forming includes forming a refined image that includes, at each of the plurality of high-confidence array-coordinates, a respective pixel-value-triplet including one primary pixel- value and two interpolated pixel-values. The step of filling includes filling the refined image by assigning, for each of the plurality of low-confidence array-coordinates, a pixel- value based on pixel- values of neighboring high-confidence array-coordinates.

[0082] (A2) In the method denoted (Al), wherein each of the plurality of low- confidence array-coordinates has an associated primary pixel- value of one of the first, second, and third coordinate mapping, the step of filling may include, for each of the plurality of low-confidence array-coordinates proximate a sub-plurality of the plurality of high- confidence array-coordinates: (a) computing a plurality of weights each corresponding to a respective one of a sub-plurality of high-confidence array-coordinates, each of the plurality of weights being determined by at least one of (i) a distance between the high-confidence array- coordinates and the low-confidence array-coordinate and (ii) a difference between of pixel- values of neighboring high-confidence array-coordinates to the low-confidence array- coordinate’s associated primary pixel- value; and (b) when the sum exceeds a predetermined weight-threshold, computing the assigned pixel-value as an average of each pixel-value, of the sub-plurality of high-confidence array-coordinates, multiplied by its corresponding one of the plurality of weights.

[0083] (A3) In the method denoted (A2) in the step of computing the plurality of weights, each of the plurality of weights may be a function of a proximity metric that is a monotonically decreasing function of the distance.

[0084] (A4) In any method denoted by one of (A2) and (A3), in the step of computing the plurality of weights, each of the plurality of weights may be a function of a similarity metric that is a monotonically decreasing function of the difference.

[0085] (A5) In any method denoted by one of (Al) through (A4), in the step of computing, each of the plurality of first confidence values may be based on at least one of a relative difference and a standard deviation of the neighboring primary-pixel- values.

[0086] (A6) Any method denoted by one of (Al) through (A5) may further include generating the first coordinate mapping.

[0087] (A7) Any method denoted by one of (Al) through (A6) may further include, when the plurality of high-confidence array-coordinates includes an isolated high- confidence array-coordinate completely surrounded by low-confidence array-coordinates, designating the isolated high-confidence array-coordinate as a low-confidence array- coordinate.

[0088] (A8) Any method denoted by one of (Al) through (A7), may further include, when the low-confidence array-coordinate's primary pixel-value is associated with the first color filter: (a) computing a plurality of scaling factors each corresponding to a respective one of the sub-plurality of high-confidence array-coordinates, each of the plurality of scaling factors being proportional to a ratio of the low-confidence array-coordinate's primary pixel-value to the pixel- value at the high-confidence array-coordinate associated with the first color filter; and (b) when the sum exceeds the predetermined weight-threshold, computing the assigned pixel-value as an average of each pixel- value, of the sub-plurality of high-confidence array-coordinates, multiplied by its corresponding one of the plurality of weights and its corresponding one of the plurality of scaling factors.

[0089] (A9) Any method denoted by one of (Al) through (A8) may further include, when the sum of the plurality of weights is less than the predetermined weight- threshold, setting the assigned pixel- value proportional to a pixel- value associated a most proximate of the plurality of neighboring high-confidence array-coordinates that has a first, second, and third pixel- value, corresponding to the first, second, and third color filters respectively, that satisfy a color-neutrality condition.

[0090] (A 10) Any method denoted by one of (Al) through (A9), when each of the plurality of sensor pixels has a pixel charge corresponding to a respective intensity of light from a scene incident thereon, may further include capturing image by: converting, with an analog-to-digital converter, each pixel charge to a respective one of the primary pixel- values; and storing the primary pixel-values in a memory communicatively coupled to a

microprocessor configured to execute the steps of generating, computing, determining, forming, and filling.

[0091] (Bl) An image demosaicer includes a memory and a microprocessor and is configured to process an image captured by an image sensor. The memory stores non- transitory computer-readable instructions and adapted to store the image. The microprocessor adapted to execute the instructions to perform the any of the methods (Al) through (A10).

[0092] Changes may be made in the above demosaicing methods and demosaicing systems without departing from the scope hereof. It should thus be noted that the matter contained in the above description or shown in the accompanying drawings should be interpreted as illustrative and not in a limiting sense. Herein, and unless otherwise indicated, the adjective "exemplary" means serving as an example, instance, or illustration. The following claims are intended to cover all generic and specific features described herein, as well as all statements of the scope of the present demosaicing method and system, which, as a matter of language, might be said to fall therebetween.

[0093] Various aspects of the present invention may be appreciated from the following enumerated example embodiments (EEEs):

1. A method for demosaicing an image captured by an image sensor having an

arrayed plurality of sensor pixels each located at a respective one of a plurality of array-coordinates, the plurality of sensor pixels including (i) at a first sub-plurality of array-coordinates, a first sub-plurality of sensor pixels each filtered by a respective first color filter, (ii) at a second sub-plurality of array-coordinates, a second sub-plurality of sensor pixels filtered by a respective second color filter, and (iii) at a third sub-plurality of array-coordinates, a third sub-plurality of sensor pixels filtered by a respective third color filter, the method comprising: computing, for each of a first plurality of interpolated pixel- values and based on

neighboring primary pixel- values, a respective one of a plurality of first confidence values each corresponding to an array-coordinate of either the second or the third plurality of array-coordinates, the first plurality of interpolated pixel-values being interpolated from neighboring primary pixel- values, of a first plurality of primary pixel- values, generated by the first sub plurality of sensor pixels;

generating a first thresholded mapping from a first coordinate mapping by removing each interpolated pixel- value, and array-coordinate mapped thereto, having a first confidence value less than a threshold value, the first coordinate mapping including each of the second and the third plurality of array-coordinates mapped to a respective one of a first plurality of interpolated pixel-values; repeating the steps of computing and generating for the second sub-plurality of sensor pixels to yield a second thresholded mapping;

repeating the steps of computing and generating for the third sub-plurality of sensor pixels to yield a third thresholded mapping;

determining a plurality of high-confidence array-coordinates as array-coordinates, of the plurality of array-coordinates, included in each of the first, second, and third thresholded mappings, remaining array-coordinates being a plurality of low-confidence array-coordinates ;

forming a refined image that includes, at each of the plurality of high-confidence array-coordinates, a respective pixel-value-triplet including one primary pixel- value and two interpolated pixel- values; and

filling the refined image by assigning, for each of the plurality of low-confidence array-coordinates, a pixel-value based on pixel- values of neighboring high- confidence array-coordinates.

2. The method EEE 1, each of the plurality of low-confidence array-coordinates having an associated primary pixel-value of one of the first, second, and third coordinate mapping, the step of filling comprising, for each of the plurality of low-confidence array-coordinates proximate a sub-plurality of the plurality of high-confidence array-coordinates,

computing a plurality of weights each corresponding to a respective one of a sub plurality of high-confidence array-coordinates, each of the plurality of weights being determined by at least one of (i) a distance between the high-confidence array-coordinates and the low-confidence array-coordinate and (ii) a difference between of pixel-values of neighboring high-confidence array- coordinates to the low-confidence array-coordinate's associated primary pixel- value; and

when the sum exceeds a predetermined weight-threshold, computing the assigned pixel- value as an average of each pixel-value, of the sub-plurality of high- confidence array-coordinates, multiplied by its corresponding one of the plurality of weights.

3. The method of EEE 2, in the step of computing the plurality of weights, each of the plurality of weights being a function of a proximity metric that is a monotonically decreasing function of the distance.

4. The method of EEE 2, in the step of computing the plurality of weights, each of the plurality of weights being a function of a similarity metric that is a monotonically decreasing function of the difference.

5. The method EEE 1, in the step of computing, each of the plurality of first

confidence values being based on at least one of a relative difference and a standard deviation of the neighboring primary-pixel-values.

6. The method EEE 1, further comprising generating the first coordinate mapping.

7. The method EEE 1, further comprising, when the plurality of high-confidence array-coordinates includes an isolated high-confidence array-coordinate completely surrounded by low-confidence array-coordinates, designating the isolated high-confidence array-coordinate as a low-confidence array-coordinate.

8. The method EEE 2, the low-confidence array-coordinate's primary pixel-value being associated with the first color filter, and further comprising:

computing a plurality of scaling factors each corresponding to a respective one of the sub-plurality of high-confidence array-coordinates, each of the plurality of scaling factors being proportional to a ratio of the low-confidence array- coordinate's primary pixel- value to the pixel-value at the high-confidence array-coordinate associated with the first color filter; and

when the sum exceeds the predetermined weight-threshold, computing the assigned pixel- value as an average of each pixel-value, of the sub-plurality of high- confidence array-coordinates, multiplied by its corresponding one of the plurality of weights and its corresponding one of the plurality of scaling factors. The method EEE 2, when the sum of the plurality of weights is less than the predetermined weight-threshold, setting the assigned pixel-value proportional to a pixel-value associated a most proximate of the plurality of neighboring high- confidence array-coordinates that has a first, second, and third pixel-value, corresponding to the first, second, and third color filters respectively, that satisfy a color-neutrality condition. The method EEE 1, each of the plurality of sensor pixels having a pixel charge corresponding to a respective intensity of light from a scene incident thereon, and further comprising capturing image by:

converting, with an analog-to-digital converter, each pixel charge to a respective one of the primary pixel-values; and

storing the primary pixel-values in a memory communicatively coupled to a

microprocessor configured to execute the steps of generating, computing, determining, forming and filling. An image demosaicer for processing an image captured by an image sensor having an arrayed plurality of sensor pixels each located at a respective one of a plurality of array-coordinates, the plurality of sensor pixels including (i) at a first sub-plurality of array-coordinates, a first sub-plurality of sensor pixels each filtered by a respective first color filter, (ii) at a second sub-plurality of array- coordinates, a second sub-plurality of sensor pixels filtered by a respective second color filter, and (iii) at a third sub-plurality of array-coordinates, a third sub plurality of sensor pixels filtered by a respective third color filter, comprising: a memory storing non-transitory computer-readable instructions and adapted to store the image; a microprocessor adapted to execute the instructions to:

compute, for each of a first plurality of interpolated pixel-values and based on neighboring primary pixel- values, a respective one of a plurality of first confidence values each corresponding to an array-coordinate of either the second or the third plurality of array-coordinates, the first plurality of interpolated pixel- values being interpolated from neighboring primary pixel- values, of a first plurality of primary pixel- values, generated by the first sub-plurality of sensor pixels;

generate a first thresholded mapping from a first coordinate mapping by removing each interpolated pixel- value, and array-coordinate mapped thereto, having a first confidence value less than a threshold value, the first coordinate mapping including each of the second and the third plurality of array-coordinates mapped to a respective one of a first plurality of interpolated pixel- values;

repeat the steps of computing and generating for the second sub-plurality of sensor pixels to yield a second thresholded mapping; repeat the steps of computing and generating for the third sub-plurality of sensor pixels to yield a third thresholded mapping;

determine a plurality of high-confidence array-coordinates as array- coordinates, of the plurality of array-coordinates, included in each of the first, second, and third thresholded mappings, the remaining array- coordinates being a plurality of low-confidence array-coordinates; form a refined image that includes, at each of the plurality of high-confidence array-coordinates, a respective pixel-value-triplet including one primary pixel-value and two interpolated pixel- values; and fill the refined image by assigning, for each of the plurality of low-confidence array-coordinates, a pixel-value based on pixel- values of neighboring high-confidence array-coordinates. 12. The image demosaicer of EEE 11, each of the plurality of low-confidence array- coordinates having an associated primary pixel- value of one of the first, second, and third coordinate mapping, the microprocessor being further configured to, in the step of filling and for each of the plurality of low-confidence array-coordinates proximate a sub-plurality of the plurality of high-confidence array-coordinates, compute a plurality of weights each corresponding to a respective one of a sub

plurality of high-confidence array-coordinates, each of the plurality of weights being determined by at least one of: (i) a distance between the high-confidence array-coordinates and the low-confidence array-coordinate and (ii) similarity of pixel- values of neighboring high-confidence array-coordinates to the low- confidence array-coordinate's associated primary pixel-value; and when the sum exceeds the predetermined weight-threshold, compute the assigned pixel- value as a weighted average of pixel-values of the sub-plurality of high- confidence array-coordinates.

13. The image demosaicer of EEE 11, in the step of computing, each of the plurality of first confidence values being based on at least one of a relative difference and a standard deviation of the neighboring primary-pixel-values.

14. The image demosaicer of EEE 11, each of the plurality of weights being a

function of a proximity metric that is a monotonically decreasing function of the distance.

15. The image demosaicer of EEE 11, each of the plurality of weights being a

function of a similarity metric that is a monotonically decreasing function of the difference.

16. The image demosaicer of EEE 11, the microprocessor being further adapted to generate the first coordinate mapping.

17. The image demosaicer of EEE 11, the microprocessor being further adapted to, when the plurality of high-confidence array-coordinates includes an isolated high- confidence array-coordinate completely surrounded by low-confidence array- coordinates, designate the isolated high-confidence array-coordinate as a low- confidence array-coordinate. 18. The image demosaicer of EEE 11, the low-confidence array-coordinate's primary pixel-value being associated with the first color filter, and the microprocessor being further adapted to:

compute a plurality of scaling factors each corresponding to a respective one of the sub-plurality of high-confidence array-coordinates, each of the plurality of scaling factors being proportional to a ratio of the low-confidence array- coordinate's primary pixel- value to the pixel-value at the high-confidence array-coordinate associated with the first color filter; and

when the sum exceeds the predetermined weight-threshold, compute the assigned pixel- value as an average of each pixel-value, of the sub-plurality of high- confidence array-coordinates, multiplied by its corresponding one of the plurality of weights and its corresponding one of the plurality of scaling factors.

19. The image demosaicer of EEE 11, the microprocessor being further adapted to, when the sum of the plurality of weights is less than the predetermined weight- threshold, set the assigned pixel-value proportional to a pixel- value associated a most proximate of the plurality of neighboring high-confidence array-coordinates that has, a first, second, and third pixel- value, corresponding to the first, second, and third color filters respectively, that satisfy a color-neutrality condition.

20. The image demosaicer of EEE 11, each of the plurality of sensor pixels having a pixel charge corresponding to a respective intensity of light from a scene incident thereon, the microprocessor being further adapted to, when capturing the image: convert, with an analog-to-digital converter, each pixel charge to a respective one of the primary pixel- values; and

store the primary pixel-values in the memory.

21. A computer program product comprising computer readable instructions which, when executed by one or more microprocessors of an image demosaicer, cause the image demosaicer to perform the method of any one of EEEs 1 to 10.

22. A computer-readable medium on which is stored the computer program product of EEE 21.