240

IEEE Transactions on Consumer Electronics, Vol. 56, No. 1, FEBRUARY 2010

A Clipping Reduction Algorithm Using Backlight Luminance Compensation for Local Dimming Liquid Crystal Displays Jong-Ju Hong, Seong-Eun Kim, Student Member, IEEE, Woo-Jin Song, Member, IEEE

Abstract — Local dimming techniques cause clipping artifacts in liquid crystal displays. To overcome the problems associated with the artifacts, the backlight luminance should be adjusted, but this process increases power consumption. In this paper we propose a novel backlight luminance compensation algorithm to reduce clipping artifacts by minimizing the increment of backlight luminance.1 Index Terms — Clipping artifacts, local dimming, backlight luminance, power saving

I. INTRODUCTION Liquid crystal displays (LCDs) have been increasingly used in displays due to their low cost, lack of radiation emission, high video quality playback and light weight. In conventional LCDs, the backlight provides a constant light source and liquid crystals control the pixel brightness by changing their transmittance. However, the backlight is fully turned on to provide constant luminance on the whole panel. This means that the backlight is a significant source of power consumption. Moreover, light leakage and low contrast ratio (CR) are also serious problems because the light cannot be obstructed completely when displaying very dark images. The local dimming backlight technique enables LCDs to present images with high CR and low power consumption [1]- [9] by dividing the backlight into several local blocks and modulating them individually according to the input image, thus providing reduced backlight luminance for the display. In the process of a local dimming backlight technique (Fig. 1) the pixel data of the input image are used to modulate the backlight dimming duty signals which determine the backlight luminance to reduce light leakage and power consumption. Backlight modulation reduces the luminance of the displayed image by reducing backlight luminance. To compensate for the reduced luminance of the displayed image, the pixel data of the input image must be adjusted according to the backlight luminance [1]. 1 This work was supported by LG Display, the IT R&D Program of MKE/MCST/IITA (2008-F-031-01), the HY-SDR Research Center at Hanyang University under the ITRC Program of MKE, and the Brain Korea (BK) 21 Program funded by Ministry of Education, Science and Technology, Korea. The authors are with Division of Electrical and Computer Engineering, Pohang University of Science and Technology, Pohang, 790-784, Korea (email: [email protected]).

Manuscript received January 15, 2010

Fig. 1. The process of a local dimming backlight technique.

After the pixel data are adjusted, the displayed image is not exactly the same as the input image because the luminance of the displayed image cannot exceed the backlight luminance [2]. Therefore, the luminance at some high gray levels cannot be compensated and the gray levels are clipped. This is called the clipping artifact [1]. Images with clipped pixels look unnatural and sometimes exhibit several contours [10]. Therefore, in the local dimming backlight technique, the clipping artifact must be reduced. Conventional backlight modulation algorithms focus on reducing either the backlight luminance or the clipping artifact. In the average [4] and square root [5] algorithms, the backlight luminance is determined by the average luminance and square root of the average luminance of the input image respectively; thus the backlight luminance is effectively reduced in the dark region of the image. However, the reduction in the backlight luminance is extremely large, so the clipping artifact in the bright region increases. In the max algorithm [4], the backlight luminance is determined by the maximum luminance of the input image; thus the backlight luminance is bright enough to cover the clipping artifact in the bright region. However, the backlight luminance is too sensitive to the noise from high gray levels and the benefits of the local dimming backlight, i.e. low CR and power consumption, are reduced. Clipping can be reduced by increasing the backlight luminance, but this increase results in additional power consumption and a decrease in CR. Therefore, we propose a novel backlight luminance compensation (BLC) algorithm to reduce the clipping artifact by using the smallest possible backlight increase.

0098 3063/10/$20.00 © 2010 IEEE

Authorized licensed use limited to: POSTECH. Downloaded on March 30,2010 at 00:49:50 EDT from IEEE Xplore. Restrictions apply.

J.-J. Hong et al.: A Clipping Reduction Algorithm Using Backlight Luminance Compensation for Local Dimming Liquid Crystal Displays

II. PROPOSED ALGORITHM

241

control the backlight luminance when an input image is displayed on the LCD.

A. Backlight Dimming and Backlight Luminance LCDs are set to meet an ideal target luminance at each gray level (or ideal pixel luminance) when the backlight is fully turned on (Fig. 2, dashed line). However, LCDs have a light leakage problem due to the imperfect nature of liquid crystals, so the actual luminance is affected by the pixel transmittance which causes light leakage at low gray levels (Fig. 2, circles).

Fig. 4. Dimmed pixel luminance and reduced light leakage according to the dimmed backlight luminance. Dashed line: ideal target luminance; empty rectangles, circles and empty triangles: dimmed pixel luminance of Fig. 3 a, b and c, respectively.

In general, assuming that the backlight luminance B(i,j) of block (i,j) is uniform, the dimming duties, d, of several surrounding blocks and their influences can be evaluated as [6]. Fig. 2. Luminance vs. gray-level, dashed line: ideal target luminance; empty circles: pixel transmittance.

As a result, light cannot be obstructed perfectly when displaying very dark pixels, so the dark image does not look dark enough [6]. Moreover, in conventional LCDs the backlight is always turned on at maximum luminance. Consequently, a huge percentage of the power consumption can be attributed to the backlight. To reduce light leakage and power consumption, the backlight can be divided into local blocks and the backlight luminance of each block can be modulated independently according to the local image content (Fig. 3), but this strategy reduces luminance of all pixels (Fig. 4).

Fig. 3. Example of local image blocks: (a): bright; (b): middle; (c): dark.

Pixel luminance is determined by pixel transmittance in addition to backlight luminance. Improving pixel transmittance is not considered here. We are interested in devising the most appropriate method of controlling backlight luminance to reduce light leakage and backlight power consumption. Therefore, we need a mechanism to

B (i, j )

¦

m r m

¦

m s m

cr , s ˜ d (i  r , j  s ),

(1)

where m = (M-1)/2, M is the size of the block mask including neighboring blocks, cr,s is the backlight block spread function (BSF) coefficient which reflects the influence between the block (i,j) and each neighboring block; cr,s depends on the backlight structure and it is determined experimentally. B. Pixel Compensation and Clipping artifacts After the backlight is dimmed and the dimmed backlight luminance is evaluated, the pixel values are compensated to achieve the ideal target luminance. In the ideal target luminance, the maximum luminance is 1 which is the backlight luminance when the backlight is fully turned on. However in pixel luminance after backlight dimming, the maximum luminance is decreased to the level of the dimmed backlight luminance. In other words, after pixel values are compensated, the displayed image and input image are not exactly the same because the luminance of the displayed image cannot exceed the backlight luminance [2]. Therefore, the luminance at some high gray levels cannot achieve the target luminance and the high gray levels are clipped to a value of 255. As shown in Fig. 5, gray levels between gc+1 and 255 are clipped. gc is the critical gray level, which is the maximum gray level to be compensated as the ideal target luminance. If gc becomes higher, the clipped pixels are reduced so that the compensated luminance approaches the ideal target luminance as shown in Fig. 6. Therefore, gc determines the clipping level which means that a low value of gc has the potential to make serious

Authorized licensed use limited to: POSTECH. Downloaded on March 30,2010 at 00:49:50 EDT from IEEE Xplore. Restrictions apply.

242

IEEE Transactions on Consumer Electronics, Vol. 56, No. 1, FEBRUARY 2010

N (i , j )

Fig. 5. Clipping: high gray levels are clipped when the pixel value are compensated.

¦

255 g g c ( i , j ) 1

n i, j , g ,

(4)

where n(i,j,g) is a histogram of block (i,j) at gray level g in the given input image. The clipping measure can be different between two local blocks even if the critical gray levels are identical. This is because the critical gray level is determined by several surrounding blocks from the evaluated backlight luminance in (1) and (3) while the histogram is only determined by the (i,j) block. As shown in Fig. 7 and Fig. 8, the two local blocks of the image have the same critical gray level, but one of the blocks has a large portion of pixels whose gray levels are above the critical gray level. In this case, the clipping measure of the block could be larger than that of another block.

Fig. 6. Reduced clipping as a result of increased gc.

clipping artifacts but high one does not. As mentioned above, the dimmed backlight causes clipping and the relationship between the critical gray level and backlight luminance after dimming can be expressed using the ideal target luminance. B (i, j )

§ g (i, j ) · f g c (i, j ) ¨ c ¸ © 255 ¹

Fig. 7. Example of normalized histogram and smaller clipping measure in a block.

J

(2)

where f(g) is the mapping function from the gray level g to the ideal target, which is a monotonically increasing function and usually a gamma function as shown in (2), and gc(i,j) is the critical gray level of the (i,j) block when the backlight luminance is B(i,j) as evaluated in (1). As a result, the critical gray level of a block is highly related to the backlight luminance of the block. From (2), the critical gray level can be derived as: g c (i , j )

f 1 B(i, j )

B(i, j )1/ J u 255.

(3)

D. Clipping Measure and Optimum Backlight Luminance Now, we can quantify the clipping artifacts by defining a clipping measure N as the number of clipped pixels as follows:

Fig. 8. Example of normalized histogram and larger clipping measure in a block.

We can reduce the clipping artifacts at block (i,j) by restricting the clipping measure N(i,j) to be less than a threshold (TH). TH is the maximum number of allowable clipped pixels in a block which can be a predefined parameter depending on the manufacturer’s requirements. To

Authorized licensed use limited to: POSTECH. Downloaded on March 30,2010 at 00:49:50 EDT from IEEE Xplore. Restrictions apply.

J.-J. Hong et al.: A Clipping Reduction Algorithm Using Backlight Luminance Compensation for Local Dimming Liquid Crystal Displays

satisfy the restriction, the critical gray level should be increased because N(i,j) decreases when gc(i,j) is increased as shown in (4). As the critical gray level and the backlight luminance are closely related as shown in (2), the backlight luminance also increases when the critical gray level is increased. However, the incremental change in backlight luminance causes additional light leakage and additional backlight power consumption. Therefore the increment of the critical gray level or the backlight luminance should be minimized. Using this logic, gc(i,j) is increased until N(i,j) is less than TH. In other words, the optimum gc(i,j) is obtained by maximizing N(i,j) in (4) subject to N(i,j) d TH such that: 255

opt

g c (i, j ) arg max

g c (i , j )

subject to

¦ n i, j, g ,

g g c ( i , j ) 1

255

¦ n i, j, g d TH .

(5)

g g c ( i , j ) 1

The solution for gcopt(i,j) is iteratively obtained. gc(i,j) is controllable by adjusting B(i,j) as shown in (3). Therefore, the valid solution that we want is related to backlight luminance. A compatible matched backlight luminance Bopt(i,j) corresponding to gcopt(i,j) can be obtained by using (2). The final result, Bopt(i,j) is the optimum backlight luminance at block (i,j) on the clipping constraint. Specifically, the backlight luminance should be larger than the optimum backlight luminance to prevent the gray levels from being clipped but the values should be as close as possible. C. Backlight Luminance Compensation (BLC) The final stage is to compensate for backlight luminance by adjusting the dimming duties of entire local blocks in the display to satisfy the optimum backlight luminance condition, Bopt(i,j) at each block. This process is called backlight luminance compensation (BLC). To satisfy the Bopt(i,j) requirement, all the dimming duties of M×M neighboring blocks surrounding (i,j) should be compensated in cooperation because the backlight luminance is influenced by neighboring blocks at the same time as shown in (1). Multiplying the dimming duties by some scaling factors can compensate for the backlight luminance. In this paper, we are interested in just increasing in cases where the scaling factor should be larger than or equal to 1. d opt (i  r , j  s ) D r , s (i, j ) ˜ d (i  r , j  s ),

D r , s (i, j ) t 1

(6)

where Dr,s(i,j) is the scaling factor that determines the ratio by which dimming duty d(i+r,j+s) is increased and the resultant dopt(i+r,j+s) is the optimum dimming duty of the BLC. To compensate for the backlight luminance of block (i,j), not only the dimming duty of block (i,j) but also the surrounding (i+r,j+s) blocks should be increased as shown in (1). Therefore, our objective is to determine the scaling factors

243

that minimize the increment of the dimming duties while satisfying the requirement that the compensated backlight luminance should be larger than or equal to the optimum backlight. The aim of the BLC is to find the optimum scaling factors as follows: opt

{D r , s (i, j )}r , s arg

[  m,m ]

min

{D r ,s ( i , j )}r ,s

[  m ,m ]

¦

m r m

¦

m s

d (i  r , j  s ) ˜ D r , s (i, j )  1 , m

(7)

subject to

¦

m r m

¦

m s m

cr , s ˜ D r , s (i, j ) ˜ d (i  r , j  s ) t B opt (i, j ).

To minimize the increment of the dimming duties, they should be increased according to the magnitudes of the BSF coefficients. In other words, the optimum scenario is to increase the dimming duty of a block which has a larger BSF coefficient because its increment is smaller than one that has a smaller BSF coefficient. Therefore, the index of the BSF coefficient (r,s) should be simplified and this index simplification results in index rebuilding of the scaling factors and dimming duties. We use the following index rebuilding method which is a different positional representation of the M×M blocks that surround (i,j). Indices r and s are rebuilt as k and u. First, the blocks are sorted in the decreasing order of the BSF coefficient. k is the block’s index in this list, thus cr,s is simply rebuilt as ck. In this paper, k is calculated on the assumption that M is a value of 3 and each cr,s has the same value when both r and s are not zero. Then, for blocks that have the same BSF coefficient ck, the blocks are sorted in a decreasing order according to dimming duty. u is the block’s index in this list (as in Fig. 9). A summary of index rebuilding definition is shown in Table I.

Fig. 9. Example of index rebuilt BSF coefficients and the dimming duties of the surrounding blocks. The block’s positional notation in the dimming duty is omitted, i.e. d0,0 in the figure means d0,0(i,j). TABLE I DEFINITION OF INDEX REBUILDING Index BSF coefficient Dimming duty Scaling factor Index range

(r,s)

cr,s d(i+r, j+s) Dr,s(i,j) r(=s)=0,s1,ಹ,sm

(k,u) ck dk,u(i,j) Dk,u(i,j) k=0,1,…,m u=0,1,…,(2k+1)2-(2k-1)2=8k

By using the rebuilt indices, the constrained optimization problem in (7) can be rewritten by

Authorized licensed use limited to: POSTECH. Downloaded on March 30,2010 at 00:49:50 EDT from IEEE Xplore. Restrictions apply.

244

IEEE Transactions on Consumer Electronics, Vol. 56, No. 1, FEBRUARY 2010 opt

{D k ,u (i, j )}k

[ 0 , m ],u [ 0 , 8 k ] m

arg

min

{D k ,u ( i , j )}k

[ 0 ,m ],u [ 0 , 8 k ]

8k

¦¦ d

k ,u

(i, j ) ˜ D k ,u (i, j )  1

(8)

¦

k

B opt (i, j )  B(i, j ) . c0 ˜ d 0, 0 (i, j )

(9)

k 0u 0

subject to m

D 0,0 opt (i, j ) 1 

8k

c D (i, j ) ˜ d k ,u (i, j ) t B opt (i, j ). 0 k ¦u 0 k , u

Hence, the optimum scaling factors are obtained by solving the reformulated constraint optimization problem. The backlight luminance can be viewed as the area of a rectangle with a value of 1 in width and B(i,j) in height (Fig. 10 (a)). As shown in (1), the backlight luminance is evaluated by summing the BSF coefficient weighted by dimming duties and the area in the diagram is equal to the total area of the 3 separate long rectangles whose width is the BSF coefficient and height is the dimming duty (Fig. 10 (b)). Now, the optimization problem is to find the minimum increment in total heights that satisfies the area, Bopt(i,j). The increment of height is generated when the dimming duty is multiplied by the scaling factor.

However, this increased height, D0,0opt(i,j).d0,0(i,j), might exceed the maximum value of dmax(=255). If this happens, the increased height is fixed as dmax and the surplus, c0.[D0,0opt(i,j).d0,0(i,j)-dmax], is compensated for by adjusting the neighboring rectangles in step 2. The surplus is added as a supplement of rectangles with a width of c1, as shown as in Fig. 11 (c). The ratio of heights in the supplement is D1,0(i,j)-1 and its area is c1.[D1,0opt(i,j)-1].[d1,0(i,j)+d2,2(i,j)]. As the areas of the surplus and supplement in step 2 are equal, D1,0opt(i,j) is acquired by using the equality. In this way, the general solution of the optimum scaling factor Doptk,0(i,j) in step 2 can be acquired as:

D k , 0 opt (i, j ) 1  ck 1 / ck ˜

8k

¦

t 0

(a) (b) Fig. 10. 1-dimensional diagram of the constrained optimization problem in (8).

(10)

opt

[D k 1,8( k 1) (i, j ) ˜ d k 1,8( k 1) (i, j )  d max ]

.

d k ,t (i, j )

Here, the height of the supplemental rectangles can also exceed dmax. In contrast to the adjustment of neighboring rectangles to compensate for the surplus in step 2, the surplus in step 3 is compensated for in rectangles that have width because it is more effective than covering the surplus in the next rectangles that have a smaller width. The area of the surplus and supplement are c1.[D1,0opt(i,j).d1,0(i,j)-dmax] and c1.[D1,1opt(i,j)- D1,0opt(i,j)].d1,1(i,j), respectively. In a similar way to step 2, the general solution of the optimum scaling factor Doptk,u(i,j) in step 3 can be acquired as:

D k ,u opt (i, j ) D k ,u 1opt (i, j ) 

D k ,u 1opt (i, j ) ˜ d k ,u 1 (i, j )  d max 8k

¦

t u

,

(11)

d k ,t (i, j )

u 1,2,  ,8k .

If the height of the supplemental rectangle does not exceed dmax, the rest of the scaling factors are as shown below: (a)

(b)

(c)

(d)

Fig. 11. Solution of the constrained optimization problem in (8) in 1dimensional diagram.

To minimize the increment change of the total height, the best approach is to only increase the height of the center rectangle because its width c0 is the largest among the BSF coefficients. Therefore, in step 1, the shortfall of the backlight luminance relative to the optimum is relieved by adding a supplemental rectangle of c0 in width, as shown in Fig. 11 (a) and (b). As the value of the shortfall in backlight luminance, Bopt(i,j)-B(i,j), and the supplemental area of the rectangle, c0[D0,0opt(i,j)-1].d0,0(i,j), are equal, the solution of the optimum scaling factor in step 1 is acquired by:

D k ,t opt (i, j ) D k ,u opt (i, j ), t u  1, u  2, ,8k .

(12)

The scaling factors whose first index are larger than k are unity (=1). III. EXPERIMENTAL RESULTS We have tested the proposed algorithm using three sample images. Sample images with a 1920 u 1080 resolution were simulated with a local dimming backlight system of 16 u 8 blocks using MATLAB R2008a. The images were simulated by using APL, Max [5] and the proposed algorithm

Authorized licensed use limited to: POSTECH. Downloaded on March 30,2010 at 00:49:50 EDT from IEEE Xplore. Restrictions apply.

J.-J. Hong et al.: A Clipping Reduction Algorithm Using Backlight Luminance Compensation for Local Dimming Liquid Crystal Displays

(TH=0.0001) shown in Fig. 12. The backlight power consumption percentage, total clipping measurement (sum of clipping measures of each local block) and clipping ratios of images in Fig. 12 are shown in Table II and Table III, respectively. The clipping ratio is derived as: Clipping ratio

Total clipping measure u100 (%). Total number of pixels

TABLE II POWER CONSUMPTIONS OF IMAGES TO PERCENTAGE IN FIG. 12

Images Input image APL Max Proposed

(a) 100 % - exact 57.07 76.87 63.35

(b) 100% - exact 17.54 39.98 24.01

(c) 100% - exact 7.79 51.60 41.10

(13)

For a bright image (a countryside shot), the backlight power consumption was 57.07, 76.87 and 63.35% and the clipping ratio was 1.8918, 0.0172 and 0.0038% when using APL, Max and the proposed algorithm, respectively as shown in Table II (a) and Table III (a). The APL algorithm is effective for reducing power consumption but it causes a serious clipping artifact. The Max algorithm is effective in reducing the clipping artifact but it increases power consumption. On the other hand, the proposed algorithm is more effective in reducing the power consumption than the Max algorithm, despite the fact that it is still effective at clipping reduction. For a dark image (a storehouse), the proposed algorithm saves on power consumption considerably compared to the Max algorithm and reduces the clipping artifact when compared to the APL algorithm as shown in Table II (b) and Table III (b).

TABLE III TOTAL CLIPPING MEASURES AND CLIPPING RATIOS OF IMAGES IN FIG. 12 Images (a) (b) (c) Input image 0 (0%)-exact 0 (0%)- exact 0 (0%)- exact APL 39228(1.8918) 11335(0.5466) 153858(7.4198) Max 356(0.0172) 3765(0.1816) 46(0.0022) Proposed 79(0.0038) 37(0.0018) 71(0.0034)

For a high contrast image (a street vendor), the APL algorithm reduces the backlight luminance by too much which results in severe clipping artifact as shown in Fig. 12 (c) and Table III (c). To compensate the backlight luminance, the proposed algorithm increases the backlight luminance enough to constrain the clipping artifact, thus the power consumption is increased significantly. However, the proposed algorithm still has the advantage on power consumption when compared to the Max algorithm as shown in Table II (c). The proposed

INPUT IMAGE

APL [5]

MAX [5]

PROPOSED

(a)

245

(b)

(c)

Fig. 12. Sample image: (a) dark image (storehouse), (b) bright image (countryside) (c) high contrast image (street vendor).

Authorized licensed use limited to: POSTECH. Downloaded on March 30,2010 at 00:49:50 EDT from IEEE Xplore. Restrictions apply.

246

IEEE Transactions on Consumer Electronics, Vol. 56, No. 1, FEBRUARY 2010

algorithm is optimized to reduce the clipping artifact subject to minimize the increment of the backlight luminance. Considering all aspects, we did not want to exclude the method of determining the threshold (TH) from the proposed framework because another threshold could produce better results according to the brightness of the input image, and we leave the investigation of this as a future work.

[8]

[9]

T. Shiga, S. Kuwahara, N. Takeo and S. Mikoshiba, “Adaptive Dimming Technique with Optically Isolated Lamp Groups,” SID2005 Digest of Technical papers, pp. 992-995, 2005. W-C. Cheng and M. Pedram, “Power minimization in a backlit TFTLCD display by concurrent brightness and contrast scaling”, IEEE Trans.

Consumer ElectronicsYROQRSS, )HE [10] Y. Kim, “Contrast enhancement using brightness preserving bihistogram equalization”, IEEE Trans. Consumer Electronics, vol. 43, no. 1, pp. 1-8, Feb. 1997.

IV. CONCLUSION We have proposed a novel BLC algorithm which determines the optimal increment of backlight luminance by solving the proposed constraint minimization problem to reduce the clipping artifact. Experimental results show that the proposed algorithm reduces the clipping artifact in a costeffective manner compared to the “Max” algorithm. ACKNOWLEDGMENT The authors would like to thank the researchers of LG Display Korea for their support. REFERENCES [1]

[2]

[3]

[4]

[5]

[6]

[7]

C.-C. Lai and C.-C. Tsai, “Backlight Power Reduction and Image Contrast Enhancement Using Adaptive Dimming for Global Backlight Applications” IEEE Trans. Consumer Electronics, vol. 54, no. 2, pp. 669-674, May 2008. H. Cho and O.-K. Kwon, “A Backlight Dimming Algorithm for Low Power and High Image Quality LCD Applications”, IEEE Trans. Consumer Electronics, vol. 55, no. 2, pp. 839-844, May 2009. T. Funamoto, T. Kobayashi, and T. Murao, “High-Picture-Quality Technique for LCD Television: LCD-AI,” Proc. International Display Workshop, pp. 1157-1158, 2000. H. Seetzen, W. Heidrich, W. Stuerzlinger, G. Ward, L. Whitehead, M. Trentacoste, A. Ghosh, and A. Vorozcovy, “High Dynamic Range Display Systems,” ACM Transactions on Graphics, pp. 760-768, 2004. H. Chen, J. Sung, T. Ha and Y. Park, “Locally Pixel-Compensated Backlight Dimming for Improving Static Contrast on LED Backlight LCDs,” SID2007 Digest of Technical papers, May 20-25, 2007, pp. 1339-1342. C.-C. Lai and C.-C. Tsai, “Backlight Power Reduction and Image Contrast Enhancement Using Adaptive Dimming for Global Backlight Applications,” IEEE Trans. Consumer Electronics, vol. 54, no. 2, pp. 669-674, May 2008. T. Lee, J. Lee, C. Kim, S. Kang, “An optical feedback system for local dimming backlight with RGB LEDs”, IEEE Trans. Consumer Electronics, vol. 55, no. 4, pp. 2178-2183, Nov. 2009.

BIOGRAPHIES Jong-Ju Hong was born in Hadong, Korea, on November 27, 1985. He received his B.S. degree in electronic and electrical engineering from Pohang University of Science Technology (POSTECH), Korea, in 2008. Since 2008, he has been a Research Assistant at the Department of Electronic and Electrical Engineering, POSTECH, where he is currently working toward his MS degree. His research interests include multimedia signal processing for display and image signal processing. Seong-Eun Kim (S’08) was born in Changwon, Korea, on August 9, 1980. He received his B.S. degree in electronic and electrical engineering from Pohang University of Science and Technology (POSTECH), Korea, in 2004. Since 2004, he has been a Research Assistant at the Department of Electronic and Electrical Engineering, POSTECH, where he is currently working toward the Ph.D. degree. His research interests include multimedia signal processing, signal processing for display, and adaptive signal processing.

Woo-Jin Song (M’86) was born in Seoul, Korea, on October 23, 1956. He received his B.S. and M.S. degrees in electronics engineering from Seoul National University in 1979 and 1981, respectively and his PhD degree in electrical engineering from Rensselaer Polytechnic Institute in 1986. During 1981–1982, he worked at Electronics and Telecommunication Research Institute (ETRI), Korea. In 1986, he was employed by Polaroid Corporation as a senior engineer, working on digital image processing. In 1989, he was promoted to principal engineering at Polaroid. In 1989, he joined the faculty at Pohang University of Science and Technology (POSTECH), Korea, where he is a professor of electronic and electrical engineering. His current research interests are in the area of digital signal processing, in particular, radar signal processing, signal processing for digital television and multimedia products, and adaptive signal processing.

Authorized licensed use limited to: POSTECH. Downloaded on March 30,2010 at 00:49:50 EDT from IEEE Xplore. Restrictions apply.

A Clipping Reduction Algorithm Using Backlight ...

Jan 15, 2010 - The authors are with Division of Electrical and Computer Engineering,. Pohang ..... Electronics and Telecommunication Research Institute.

1MB Sizes 1 Downloads 223 Views

Recommend Documents

A Simple, Fast, and Effective Polygon Reduction Algorithm - Stan Melax
Special effects in your game modify the geometry of objects, bumping up your polygon count and requiring a method by which your engine can quickly reduce polygon counts at run time. G A M E D E V E L O P E R. NOVEMBER 1998 http://www.gdmag.com. 44. R

A Heuristic Correlation Algorithm for Data Reduction ...
autonomously monitoring, analysing and optimizing network behaviours. One of the main challenges operators face in this regard is the vast amount of data ...

COLLABORATIVE NOISE REDUCTION USING COLOR-LINE MODEL ...
pose a noise reduction technique by use of color-line assump- .... N is the number of pixels in P. We then factorize MP by sin- .... IEEE Conference on. IEEE ...

Complex Lattice Reduction Algorithm for Low ...
Jul 17, 2006 - which is naturally defined by a complex-valued channel matrix. ... C. Ling ([email protected]) is with the Department of Electronic Engineering,.

A Mesh Meaningful Segmentation Algorithm Using Skeleton ... - Kai Xu
turning space region, as real critical points, since the straight absorption would lead to .... Latin American Conference on Robotics and Automation, pp. 91–97 ...

A Survey on Brain Tumour Detection Using Data Mining Algorithm
Abstract — MRI image segmentation is one of the fundamental issues of digital image, in this paper, we shall discuss various techniques for brain tumor detection and shall elaborate and compare all of them. There will be some mathematical morpholog

Xheal: A Localized Self-healing Algorithm using ...
we define Ai = Bi if |Bi|≤|Ci|/2, otherwise, we define Ai = ... i=1 |Ai|)h(G)+(∑x ..... 16.html. 3. Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, and Michael. Saks ...

An Evolutionary Algorithm Using a Cellular Population ...
University of Technology and of the Academic Board of ... (GECCO), Lecture Notes in Computer Science, 2004,. 3102, 1162- ... The University of Michigan Press.

A Mesh Meaningful Segmentation Algorithm Using Skeleton ... - Kai Xu
would not be taken account into subsequent computation of critical points. Basically, .... treat all selected points found by before checking procedure (Fig. 4.b), lying in the ..... International Journal of Robotics Research 5(4),. 38–55 (1986).

A Mesh Meaningful Segmentation Algorithm Using Skeleton ... - Kai Xu
sion, mesh editing, mesh deformation [7], collision detection [8], shape analysis and matching [9][10]. Especially, the process that decomposes a model into visually meaningful components is called part-type segmentation [1][2] (shape decomposition o

A Simple Linear Ranking Algorithm Using Query ... - Research at Google
we define an additional free variable (intercept, or benchmark) for each ... We call this parameter .... It is immediate to apply the ideas here within each category. ... international conference on Machine learning, pages 129–136, New York, NY, ..

Dynamic Channel Allocation Using a Genetic Algorithm ...
methods for a broadband fixed wireless access (BFWA) network. The existing ..... Systems,” IEEE Transactions on Vehicular Technology, pp. 1676-. 1687, vol.

A Fast Line Segment Based Dense Stereo Algorithm Using Tree ...
correspondence algorithm using tree dynamic programming (LSTDP) is ..... Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame.

TestFul: using a hybrid evolutionary algorithm for testing stateful systems
This paper introduces TestFul, a framework for testing state- ful systems and focuses on object-oriented software. TestFul employs a hybrid multi-objective evolutionary algorithm, to explore the space of feasible tests efficiently, and novel qual- it

A Feature Tracking Algorithm Using Neighborhood ...
computer vision, etc. The minimum .... should be a good degree of motion similarities between the neigh- .... IEEE Workshop on Neural Networks for Signal Processing,. (Kyoto ... Security Purposes,” Proceedings of IEEE Annual Int'l Car-.

1 feature subset selection using a genetic algorithm - Semantic Scholar
Department of Computer Science. 226 Atanaso Hall. Iowa State ...... He holds a B.S. in Computer Science from Sogang University (Seoul, Korea), and an M.S. in ...

A Mesh Meaningful Segmentation Algorithm Using Skeleton ... - Kai Xu
cluding texture mapping [4], shape manipulation[5][6], simplification and compres- sion, mesh ... 1.e) of a mesh is computed by using a repulsive force field. (Fig.

A greedy algorithm for sparse recovery using precise ...
The problem of recovering ,however, is NP-hard since it requires searching ..... The top K absolute values of this vector is same as minimizing the .... In this section, we investigate the procedure we presented in Algorithm 1 on synthetic data.

Clipping 01.06.2016.pdf
Se construídos a partir das perguntas certas, os. sistemas de big data podem representar instrumentos importantes para indicar tendências a partir.

Clipping 19.01.2016.pdf
como o HapMap, 1000 Genomes e CancerGenome Atlas. HOJE EM DIA (19/01). Minas pode ter 2 usinas nucleares em 14 anos nas margens do rio São.

TCP Retransmission Timeout Algorithm Using ...
Jan 2, 2010 - and HTTP) running on different hosts on the Internet [2, p. 82]. It is critical for TCP to have ... Manuscript received July 10, 2003; revised October 10, 2003. This work was .... cursive WM RTT estimates, produces the best results. Let

Lightpath Protection using Genetic Algorithm ... - Semantic Scholar
virtual topology onto the physical topology so as to minimize the failure ... applications and high speed computer networks because of huge bandwidth of optical ...

Lightpath Protection using Genetic Algorithm ... - Semantic Scholar
connectivity between two nodes in the network following a failure by mapping ... applications and high speed computer networks because of huge bandwidth of ...