An Adaptive Weighting Approach for Image Color and Magnitude Interpolation Z. CHEN, G. CHEN

Abstract-- This paper presents a classification based weighting approach for color and magnitude interpolation of Bayer pattern CFA (color filter array) image. The simpleness and effectiveness of this approach facilitate the fixed-point implementation of demosizing solution on image processors.

I. INTRODUCTION Embedded imaging devices, such as digital cameras and video mobile phones are popular and prevalent. Mobility and low cost are demanded from these devices. This means low battery power consumption and low implementation cost. A solution to lower-end image sensors is to unite RGB image magnitude interpolation with Bayer pattern CFA color interpolation (here we call such coalition demosizing). By this mean, a larger-sized RGB color image can be grabbed from a fixed-resolutioned CFA image sensor. For the end users, as if the output image is grabbed from a larger-resolutioned image sensor. Such solution usually contains a pixel or color element interpolation phase, where interpolation weights are calculated. There are some approaches of weights calculation suitable for such case proposed in [1],[2],[3]. However, the high-precision floating-point computations in those approaches may be problematic in fixed-point hardware implementation. Since the two issues of demosizing and image interpolation are so much related, some ideas of the latter can be borrowed for the former’s purpose. For example, the idea of classification in [4]. II. PROPOSED APPROACH

Fig. 2. The flowchart of the proposed weighting approach.

weight coefficients for interpolation according to the case it has determined. The classification criteria and the assignments of weight coefficients are as follows. (ⅰ). If ∑ xi − M 1 < Thershold1 , case 1 is satisfied. Then i

w1 = w2 = w3 = w4 = 1 / 4 .Where i ∈ {1,2,3,4} , M 1 is the mean of x1 , , x 4 , and w1 , w4 are their corresponding weights. (ⅱ). Define d i =

∑x

i

− x j , where i, j ∈ {1,2,3,4} . If both

j

d max − d 2 nd max > Threshold 2

d max + d min ≥ 2d 2 nd max stand, case 2 is asserted. Then w p = 0 , wi = 1 / 3 . Where and

i, p ∈ {1,2,3,4} , p ≠ i . p = arg(max(d i )) , i.e., x p is the one

that makes d p = d max . (ⅲ).

Firstly, set  true x1 , x3 , x5 , x7 > M 2 || x1 , x3 , x5 , x7 < M 2 , flag1 =  else  false  true x 2 , x 4 , x6 , x8 > M 2 || x 2 , x 4 , x6 , x8 < M 2 . flag 2 =  else  false The flag is set equal to ‘true’ only in the case of either all the four elements are less than M 2 or all the four elements are greater than M 2 . Where M 2 is the mean of x1 , , x16 . Secondly, if one and only one flag between flag1 and flag 2 is ‘true’, case 3 is determined. If flag1 is ‘true’, then w1 = w3 = 9 / 16 , w5 = w7 = −1 / 16 , welse = 0 . Otherwise,

w2 = w4 = 9 / 16 , w6 = w8 = −1 / 16 , welse = 0 . Fig. 1. Basic interpolation patterns for the proposed approach.

Figure 1 shows the patterns that this proposed approach deals with. x1 , x 2 ,  , x16 are known color elements (or pixels), while y is the color element (or pixel) to be interpolated. The proposed approach firstly identifies the four cases in sequence as shown in Figure 2. Then it outputs four

(ⅳ). If none of the above cases is chosen, case 4 is defaulted. Then w1 = w2 = w3 = w4 = 1 / 4 . The above two thresholds can be chosen for different sensitivity purpose. III. EXPERIMENTAL RESULTS The quality of resulting images generated by the demosizing solution using different weighting approaches is

TABLE I COMPARISON OF QUALITY OF RESULTING IMAGES. Image (Aooroach) PSNR MAE NCD Window (AW) 25.7157 7.6116 0.0748 Window (DBW) 27.4715 5.8253 0.0629 Window (Proposed) 27.3030 5.6553 0.0605 House (AW) 23.7616 8.9337 0.0856 House (DBW) 25.2184 7.5674 0.0755 House (Proposed) 25.1213 7.4488 0.0736 Girls (AW) 26.3925 6.5352 0.0556 Girls (DBW) 28.0742 5.2255 0.0484 Girls (Proposed) 28.1010 5.0407 0.0463 Boy (AW) 30.2927 4.3352 0.0373 Boy (DBW) 31.0258 3.9565 0.0357 Boy (Proposed) 31.3694 3.7529 0.0335 River (AW) 22.8512 11.5143 0.2113 River (DBW) 23.5350 10.8365 0.2017 River (Proposed) 23.2871 10.9454 0.2025 Parrots (AW) 26.8094 5.1034 0.0456 Parrots (DBW) 28.0523 4.3430 0.0407 Parrots (Proposed) 27.8323 4.2703 0.0400 TABLE II COMPARISON OF CYCLES ON TMS320DM642. Approach Case Cycles DBW (Not Applicable) 1681 Proposed approach Case 1 (Smooth) 31 Case 2 (Singular) 89 Case 3 (Edgy) 136 Case 4 (Default) 143

Fig. 3. Original images for testing. Upper-left: Window; upper-right: House; middle-left: Girls; middle-right: Boy; lower-left: River; lower-right: Parrots.

Figure 3. ‘AW’ denotes the average weighting approach (all of the four weights are always equal to 1 / 4 ). ‘DBW’ denotes the division based weighting approach proposed in [1]. The two thresholds in the proposed approach are constantly set equal to 12 in this experiment. Also, a case map generated by the proposed approach is shown in Figure 4. In that case map, white pixels denote either case 1 or ‘not applicable’. While green, red, and blue pixels denote case 2, case 3, and case 4, respectively. Table 2 lists the average cycles consumed in computing each set of weights on TMS320DM642 fixed-point DSP. IV. CONCLUSION

Fig. 4. Case map of Window.

An adaptive weighting approach is proposed for image demosizing solution. This weighting approach is more suitable for fixed-point hardware implementation while it maintains the quality of resulting image and even makes resulting image more pleasant in perception. REFERENCES [1]

[2]

Fig. 5. Portions from resulting images of Girls. Left: by AW; center: by DBW; right: by proposed approach.

compared in table 1. In this experiment, 256× 256 Bayer pattern CFA images are interpolated into 512× 512 RGB images. The original images for testing are illustrated in

[3]

[4]

R. Lukac, K. Martin, and K.N. Plataniotis, “Digital camera zooming based on unified CFA image processing steps”, IEEE Trans. Consumer Electronics, vol. 50, no. 1, pp. 15-24, Feb. 2004. R. Lukac, K.N. Plataniotis, D. Hatzinakos, and M. Aleksic “A novel cost effective demosaicing approach”, IEEE Trans. Consumer Electronics, vol. 50, no. 1, pp. 256-261, Feb. 2004. R. Lukac, K. Martin, K.N.Plataniotis, and B. Smolka “Bayer pattern demosaicking using data-dependent adaptive filters”, in proceedings 22nd Biennial Symposium on Communications, Queen's University, 2004, May 2004, pp. 207-209. Simant Dube, and Li Hong, “An adaptive algorithm for image resolution enhancement”, Signals, Systems and Computers, 2000, Vol. 2, pp. 17311734.

∑ − An Adaptive Weighting Approach for Image Color and Magnitude ...

video mobile phones are popular and prevalent. Mobility and low cost are demanded from these ... deals with. 16. 2. 1 ,,, x xx . are known color elements (or.

171KB Sizes 1 Downloads 49 Views

Recommend Documents

An Adaptive Weighting Approach for Image Color ... - Semantic Scholar
video mobile phones are popular and prevalent. Mobility and ... interpolation (here we call such coalition demosizing). By this .... Left: by AW; center: by. DBW ...

An Adaptive Weighting Approach for Image Color ... - Semantic Scholar
Embedded imaging devices, such as digital cameras and .... enhancement”, Signals, Systems and Computers, 2000, Vol. 2, pp. 1731- ... House (Proposed).

Image Retrieval: Color and Texture Combining Based on Query-Image*
into account a particular query-image without interaction between system and .... groups are: City, Clouds, Coastal landscapes, Contemporary buildings, Fields,.

An Adaptive, Knowledge-Driven Medical Image Search ...
multi-class offline feature selection method; and, (3) a novel image search engine framework for detecting DPLD. Very promising ..... ked by the rad tial VOI exam.

Importance Weighting Without Importance Weights: An Efficient ...
best known regret bounds for FPL in online combinatorial optimization with full feedback, closing the perceived performance gap between FPL and exponential weights in this setting. ... Importance weighting is a crucially important tool used in many a

Importance Weighting Without Importance Weights: An Efficient ...
best known regret bounds for FPL in online combinatorial optimization with full feedback, closing ... Importance weighting is a crucially important tool used in many areas of ...... Regret bounds and minimax policies under partial monitoring.

An Adaptive Projected Subgradient Approach to ...
agriculture, disaster relief management, radar, and acoustic source localization ... also be used to approximate the solution of a (fixed) convex optimization ... 1The study in [4] further divides diffusion networks into two types: diffusion and prob

Heterogeneous variances and weighting - GitHub
Page 1. Heterogeneous variances and weighting. Facundo Muñoz. 2017-04-14 breedR version: 0.12.1. Contents. Using weights. 1. Estimating residual ...

an approach to lossy image compression using 1 ... - Semantic Scholar
images are composed by 256 grayscale levels (8 bits- per-pixel resolution), so an analysis for color images can be implemented using this method for each of ...

An Adaptive Hybrid Multiprocessor Technique for ... - Kaust
must process large amounts of data which may take a long time. Here, we introduce .... and di are matched, or -4 when qi and di are mismatched. To open a new ...

An Adaptive Fusion Algorithm for Spam Detection
adaptive fusion algorithm for spam detection offers a general content- based approach. The method can be applied to non-email spam detection tasks with little ..... Table 2. The (1-AUC) percent scores of our adaptive fusion algorithm AFSD and other f

an approach to lossy image compression using 1 ... - Semantic Scholar
In this paper, an approach to lossy image compression using 1-D wavelet transforms is proposed. The analyzed image is divided in little sub- images and each one is decomposed in vectors following a fractal Hilbert curve. A Wavelet Transform is thus a

A Soft Edge Smoothness Prior for Color Image Super-Resolution
Apr 10, 2009 - borhood system represented by a set of vectors. , where is the neighborhood order, and the. 's are chosen as the relative position (taking integer values as its components, and the unit is the grid interval) of the nearest neighbors wi

SoftCuts: A Soft Edge Smoothness Prior for Color Image Super ...
May 21, 2009 - trical Engineering and Computer Science, Northwestern University, Evanston,. IL 60208 USA ... Color versions of one or more of the figures in this paper are available online ..... The top left image is the input, the other five ...

SoftCuts: A Soft Edge Smoothness Prior for Color Image Super ...
May 21, 2009 - trical Engineering and Computer Science, Northwestern University, Evanston, ...... Ph.D. degree in the Electrical Engineering and Com-.

A Soft Edge Smoothness Prior for Color Image Super-Resolution
May 21, 2009 - and unsupervised solution for by the spectral clustering tech- nique. Thus ...... from the Georgia Institute of Technology, Atlanta, in. 1981 and ...

combining wavelets with color information for content-based image ...
Keywords: Content-Based Image Retrieval, Global Color Histogram, Haar Wavelets, ..... on Pattern Recognition (ICPR), Quebec City, QC, Canada, August 11-.

APPLICATION OF AN ADAPTIVE BACKGROUND MODEL FOR ...
Analysis and Machine Intelligence, 11(8), 1989, 859-872. [12] J. Sklansky, Measuring concavity on a rectangular mosaic. IEEE Transactions on Computing, ...