Fast and robust wavelet-based dynamic range compression with local contrast enhancement

Size: px
Start display at page:

Download "Fast and robust wavelet-based dynamic range compression with local contrast enhancement"

Transcription

1 Fast an robust waveet-base ynamic range compression with oca contrast enhancement Numan UNLDI a,b, Vijayan K. sari a,zia-ur Rahman a a Department of Eectrica an Computer Engineering, ODU, Norfo V, US b eronautics an Space Technoogies Institute, HHO, Yesiyurt, Istanbu, Turkey {nuna001, vasari, zrahman}@ou.eu BSTRCT In this paper, a new waveet-base ynamic range compression agorithm is propose to improve the visua quaity of igita images capture in the high ynamic range scenes with non-uniform ighting conitions. Waveet transform is use especiay for imension reuction such that a ynamic range compression with oca contrast enhancement agorithm is appie ony to the approximation coefficients which are obtaine by ow-pass fitering an own-samping the origina intensity image. The normaize approximation coefficients are transforme using a hyperboic sine curve an the contrast enhancement is reaize by tuning the magnitue of the each coefficient with respect to surrouning coefficients. The transforme coefficients are then e-normaize to their origina range. The etai coefficients are aso moifie to prevent the ege eformation. The inverse waveet transform is carrie out resuting in a ow ynamic range an contrast enhance intensity image. coor restoration process base on reationship between spectra bans an the uminance of the origina image is appie to convert the enhance intensity image back to a coor image. Keywors: Waveet base image enhancement, ynamic range compression, oca contrast enhancement. 1. INTRODUCTION It is we known that human eyes perform much better than cameras when imaging rea wor scenes, which generay presents high ynamic range that can span more than six orers of magnitue. Human eyes have about 10 8 :1 absoute range from fuy aapte ark vision to fuy aapte ighting conitions at noon on the equator. They can see about :1 range of uminance when aapte to a norma working range. This is achieve through a series of aaptive mechanisms for brightness perception. First, the size of pupi is variabe to accommoate ifferent eves of raiance from ifferent regions in a scene whie the camera aperture is fixe when capturing the scene. When staring at a highybright region in the scene, the pupi wi shrink to compress the ynamic range so that the eyes can ea with it. Secony, an more importanty, the major ynamic range compression process is taking pace via the atera processing at the retina eve [1]. Finay, the eary visua cortex is aso foun participating in some of the ynamic range processing. Currenty avaiabe imaging evices can measure ony about three orers of magnitue. In aition, image ispay evices, ike monitors an printers, aso emonstrate imite ynamic range. s a resut, images capture in high ynamic ranges scenes commony suffer from poor visibiity ue to either overexposure causing saturation or unerexposure resuting in ow contrast ark images in which some important features are ost or become har to etect by human eyes. Computer vision agorithms aso have ifficuty processing those images. To cope with the high ynamic range scenes given the imite ynamic ranges of cameras, monitors an printers, various image processing techniques which compress the ynamic range have been eveope. Some of those are goba histogram moification techniques, such as gamma ajustment, ogarithmic compression, an eves/curves methos. However, those conventiona methos generay have very imite performance such that some features may be ost uring the image processing, or some cannot be sufficienty enhance. The resuting images suffer from egrae goba an oca contrast which is reate with the visua quaity an the fine features. Visua Information Processing XVII, eite by Zia-ur Rahman, Stephen E. Reichenbach, Mark en Neife, Proc. of SPIE Vo. 6978, , (2008) X/08/$18 oi: / SPIE Digita Library -- Subscriber rchive Copy Proc. of SPIE Vo

2 mong the contrast enhancement techniques, histogram equaization (HE) an its moifie versions are commony use for enhancement. though HE works we for scenes that have uni-moa or weaky bi-moa histograms; its performance is poor for scenes with strongy bi-moa histograms. To make it work for muti-moa histograms, aaptive histogram equaization (HE) was introuce [2]. In HE which is aso cae ocaize or winowe HE, histogram equaization is performe ocay within an ajustabe size winow. HE provies oca contrast enhancement an performs better than norma HE. However, HE suffers from intensive noise enhancement in fat regions an ring artifacts at strong eges ue to its strong contrast enhancement [3]. In contrast imiting HE (CLHE [4]), unesire noise ampification is reuce by seecting the cipping eve of the histogram an controing oca contrast enhancement. Boun artifacts in CLHE can be eiminate by performing backgroun subtraction [5]. Muti-scae HE (MHE)[6] is the most avance variation of HE. Unike traitiona singe scae techniques, waveet-base MHE is capabe of moifying/enhancing the image components aaptivey base on their spatia-frequency properties. Those avance HE variations generay have very strong contrast enhancement, which is especiay usefu in feature extraction appications ike meica imaging for iagnosis. They are not commony use in processing coor images probaby because their strong contrast enhancement may ea to excessive noise or artifacts an cause the image to ook unnatura. In orer to obtain better performance, more avance image enhancement techniques to compress the ynamic range maintaining or even boosting oca contrast have been eveope. Retinex base agorithms are exampes of such techniques base on E. Lan s theory [7] of human visua perception of ightness an coor. Since the introuction of Retinex, severa variants [8]-[11] on the origina metho have been eveope mainy to improve the computationa efficiency whie preserving the basic principes. MSRCR (Mutiscae Retinex with Coor Restoration) [12]-[14], propose by Jobson, et a, a wiey cite image processing technique which is a Retinex base agorithm. MSRCR uses ogarithmic compression an spatia convoution to impement the iea of Retinex. It aims to synthesize oca contrast enhancement, coor constancy, an ightness/coor renition for igita coor image enhancement. MSRCR works we with a arge variety of images. INDNE (aptive an Integrate Neighborhoo Depenent pproach for Noninear Enhancement) [15] an IRME (Iuminance-Refectance Moe for Noninear Enhancement) [16] are two other nove techniques propose by Li et a. They are both constitute by two separate processes viz. aaptive uminance enhancement an aaptive contrast enhancement to provie more fexibiity an better contro over image enhancement. INDNE prouces better resuts for most natura images when compare to IRME, whie IRME is the fastest of the a retinex-base agorithms incuing INDNE an it was primariy esigne for rea-time vieo enhancement on PC patforms. In this paper, we introuce a nove fast an robust Waveet-base Dynamic Range Compression with Loca Contrast Enhancement (WDRC) agorithm base on the principes introuce by MSRCR an INDNE to improve the visibiity of igita images capture uner non-uniform ighting conitions. The scheme of the propose agorithm is shown in Fig.1. We give the etais of the propose agorithm in section 2. The experimenta resuts an iscussion are presente in sections 3, an the concusions in section LGORITHM The propose enhancement agorithm consists of four main stages, three of which are appie in iscrete waveet omain: 1. Luminance enhancement via ynamic range compression of approximation coefficients. 2. Loca contrast enhancement using average uminance information of neighboring pixes which is inherite to approximation coefficients 3. Detai coefficients moification. 4. Coor restoration. For input coor images, the intensity image I(x, is obtaine by empoying the foowing transformation: I (x, = max[r(x,, g(x,, b(x, ] (1) where r, g an b are the RGB components of coor image in the RGB coor space. This is the efinition of the vaue (V) component in HSV coor space. The enhancement agorithm is appie on this intensity image. Proc. of SPIE Vo

3 Input Image Intensity Image pproximation Coeff.- Detai Coef.-D LPF Normaize Coeff.- new Moifie Detai Coeff. Dnew Mappe Coef.-Ã Loca verage f f Loca Contrast Enhancement Enhance Intensity Image De-normaize Coeff.-new Output Coor Image Fig. 1. The propose agorithm 2.1 Dynamic Range Compression ccoring to orthonorma waveet transform, the uminance vaues are ecompose by Eq. (2): I( x, = + a z J, j J z Φ J, v j, ( x, + Ψ v j, j J z ( x, + h j, Ψ j J z h j, j, ( x, Ψ j, ( x, (2) where a J, are the approximation coefficients at scae J with corresponing scaing functions Φ J, ( x,, an j, are the etai coefficients at each scae with corresponing waveet functions Ψ j, ( x,. Whie the first term on the right-han sie of (2) represents the coarse-scae approximation to I ( x,, the secon, the thir, an the fourth terms represent the etai components in horizonta, vertica an iagona irections, respectivey. Base on some assumptions about image formation an human vision behavior, the image intensity I(x, can be simpifie as a prouct of the refectance R(x, an the iuminance L(x, at each point (x,. The iuminance L is assume to be containing the ow frequency component of the image whie the refectance R mainy incues the high frequency component, since R generay varies much faster than L oes in most parts of an image with a few exceptions, ike shaow bounaries. In most cases the iuminance has severa orers arger ynamic range when compare to Proc. of SPIE Vo

4 refectance. By compressing ony the ynamic range of the iuminance an preserving the refectance, ynamic range compression of the image can be achieve. ccurate estimation of iuminance, which is ifficut to be etermine, can be approximate by ow pass fitering the image. The waveet transform with which any image can be expane as a sum of its approximate image at some scae J aong with corresponing etai components at scae J an at finer scaes is use especiay for imension reuction in our agorithm. Besies, we use the approximate image represente by normaize approximation coefficients, which can be obtaine by ow pass fitering an own-samping the origina image in the waveet transform, to estimate the ownsampe version of the iuminance. raise hyperboic sine function given in (4) which maps the normaize range [0,1] of a J, to the same range is use for compressing the ynamic range represente by the coefficients. We have chosen hyperboic sine function for ynamic range compression since the function is two-sie that aows us to pu-up sma coefficients an pu-own arge coefficients to some extent at the same time. This is consistent with the human visua system that has mechanisms through which it can aapt itsef aowing goo visua iscrimination in a ighting conitions. The normaize an compresse coefficients at eve J can be obtaine by a r sinh( a J, ) + 5 J, = (3) 10 where a J, are normaize coefficients given by (4) an r is the curvature parameter which ajusts the shape of the hyperboic sine function. aj, a J, = (4) J In Fig 2. the hyperboic sine function with ifferent curvature parameters is shown. To ease the comparison, ientity transformation (r=0, a J, = a J, ) is aso given. For vaues of r ess than 1, sma pixe vaues are pue up much more than arge pixe vaues are pue own, an for vaues greater than 1 vice versa. We etermine r=0.5 as a efaut vaue, which provies goo range compression especiay in shaowe scenes. We foun the greater vaues of r usefu for bright scenes with no ark regions an for scientific appications such as meica image enhancement especiay when the region of interest is too bright. moifie sinh(x) Fig. 2. Raise hyperboic sine function fter appying the mapping operator to the coefficients, if we e-normaize the new coefficients an take the inverse waveet transform, the resut wi show a compresse ynamic range with a significant oss of contrast. The new image wi ook washe-out. Such an exampe is shown in Fig 3.(b) Thus, we nee to increase the oca contrast to get a high visua quaity. Proc. of SPIE Vo

5 '4 Fig. 3. Resuts of the propose agorithm at each step Top, eft: Origina image; right: Range compresse image; bottom eft: Loca contrast enhance image; right: Image with moifie etai coefficients. 2.2 Loca Contrast Enhancement The goba contrast enhancement techniques which moify the histogram of the image by stretching it or boosting the bright pixes an ecreasing the vaue of ark pixes gobay can not generay prouce satisfying resuts. Those methos have imite performance in enhancing fine etais especiay when there are sma uminance ifferences between ajacent pixes. Therefore, the surrouning pixes shou be taken into account when one pixe is being processe. We use the centre/surroun ratio introuce by Lan [8], an efficienty moifie by Rahman et. a.[13] to achieve the compresse ynamic range preserving or even enhancing the oca contrast. The center/surroun ratio is use as a variabe gain matrix, by simpy mutipying with the moifie coefficients when the ratio is ess than 1 an by appying inverse of this matrix as a power transform to the coefficients when the ratio is greater than 1. In such a way, the resut images wi not suffer either hao artifacts, or saturation cause by over-enhancement. In this metho, epening on their surrouning pixe intensity, pixes with the same uminance can have ifferent outputs. When surroune by arker or brighter pixes, the uminance of the pixe being processe (the center pixe) wi be booste or owere respectivey. In such a way, image contrast an fine etais can be sufficienty enhance whie ynamic range expansion can be controe without egraing image quaity. The oca average image represente by moifie approximation coefficients is obtaine by fitering the normaize coefficients obtaine from the waveet ecomposition of the origina image with a Gaussian kerne. We have chosen Gaussian kerne ike in MSRCR which prove to give goo resuts over a wie range of space constants. The stanar eviation (aso cae scae or space constant) of the 2D Gaussian istribution etermines the size of the surroun. The 2D Gaussian function G(x, is given by, 2 2 ( ) x + y 2 (, ) = σ G x y κe (5) where κ is etermine by Proc. of SPIE Vo

6 x y G ( x, = 1 (6) an σ is the surroun space constant. Surrouning intensity information is obtaine by 2D convoution of (5) with image, whose eements are the normaize approximation coefficients a J, given by (4) such as M 1 N 1 f ( x, = ( x, G( x, = ( x', y') G( x x', y y') (7) x' = 0 y' = 0 The ratio between an f etermines whether the center coefficient is higher than the average surrouning intensity or not. If it is higher, the corresponing coefficient wi be increase, otherwise it wi be owere. s state above, the size of the surrouning which has a irect effect on the contrast enhancement resut is controe by the space constant σ of the surroun function G. The oca contrast enhancement is carrie out as foows: J. R * 255* 2 = 1 ( ) R * 255* 2 J for R < 1 new (8) for R > 1 where, R is the centre/surroun ratio, is the matrix whose eements are the output of the hyperboic sine function given by (3) an new is the new coefficient matrix which wi repace the approximation coefficients a J, obtaine by the ecomposition of the origina image at eve J. R is given by R = (9) f with the parameter which is an enhancement strength constant with a efaut vaue of 1. It can be tune for an optima resut. When it is greater than 1, the resut contrast wi be high with a cost of increase noise. When it is ess than 1, the resuting image wi have ess contrast with ess noise. In Fig.3(c) the resut of the contrast enhancement agorithm after taking the inverse waveet transform of the moifie coefficients an appying a inear coor restoration process is given. In Fig.4, 1D comparison of the range compression an the contrast enhancement resuts are shown. The curves show the pixe vaues in the mie row of the origina, ynamic range compresse an enhance intensity images, respectivey IOU IOU 60 Fig. 4. Resut of the propose agorithm. Intensity variations aong the ine passing through the center of an image. The contrast enhancement transformation given in (8) consists of two ifferent equations: The first one is an aaptive mutipicative gain an it is use when the centre/surroun ratio is ess than 1. Mutipication with such a number wi ower the coefficients. The secon equation is aaptive power transform with ifferent vaues for each coefficient an is vai when the center coefficient is greater than the oca average. Since the coefficients are normaize to [0,1] an the Proc. of SPIE Vo

7 term ( R 1 <1 ) is aways satisfie, the power transform given in (8) wi aways prouce a higher vaue but ess than or equa to 1. This prevents saturation an hao errors that wou occur if the first equation in (8) was use instea. The secon equation cou be use instea of the first one as in INDNE, but it wou not provie as much contrast enhancement as the mutipicative gain. Using a singe scae is incapabe of simutaneousy proviing sufficient ynamic range compression an tona renition[13]-[14], therefore ifferent scae constants (e.g. sma, meium, arge) of the Gaussian kerne can be use to gather surroun information an the contrast enhancement process given by (5)-(9) is repeate for each scae. The fina output is a inear combination of the new coefficients cacuate using these mutipe scaes. This nees three times more cacuations compare to using ony one scae. Instea of using three convoutions, the same resut can be approximate using a specificay esigne Gaussian kerne. Such kerne which we name Combine-scae Gaussian (CG) is a inear combination of three kernes with three ifferent scaes. with W k 2 2 ( x y ) σ G( x, = W k k κ k e (10) k= 1 1 =. The CG kerne obtaine using three scaes (2, 40, 120) is shown in Fig.5. 3 O OU Fig. 5. Spatia form of CG operator. Left: 3-D representation, right: Cross-section to iustrate the surroun (Both representation are istorte to visuaize the surroun) 2.3 Detai Coefficient Moification Contrast enhancement through etai coefficient moification is a we-estabishe technique an a arge variety of appication can be seen in iterature [17]-[18]. In such a contrast enhancement technique generay sma vaue coefficients, which aso represent the noise content are weakene or eft untouche whie arge vaue ones are strengthene by inear or non-inear curve mapping operators. Determining the thresho that separates the sma an arge coefficients is sti merit of interest. Moifying these coefficients is very susceptibe an may ea to unesire noise magnification or unpreictabe ege eterioration such as jaggy eges. Thus, the inverse waveet transform with the moifie approximation coefficients wi suffer from ege eterioration if the etai coefficient is not moifie in an appropriate way. To meet this requirement, the etai coefficients are moifie using the ratio between the enhance an origina approximation coefficients. This ratio is appie as an aaptive gain mask such as: D = h new h v new v new new = D D new = D D new D (11) where an new are the origina an enhance approximation coefficients at eve 1, respectivey. D, D, D are h v the etai coefficient matrices for horizonta, vertica an iagona etais at eve 1, an D, D, D are new h new v new Proc. of SPIE Vo

8 the corresponing moifie matrices, respectivey. If the waveet ecomposition is carrie out for more than one eve, equation (12) is use instea. D h new, j h v new, j v new, j new, j = D j D new, j = D j D new, j = D j (12) j j j with j=j,j-1,.2,1. Here j an new, j is etermine by 1 eve reconstruction using j+1 an D j+ 1 for j ; new, j+1 an Dnew, j+ 1 for new, j at each step. ppying the waveet agorithm more than 1 step wi be computationa inefficient. In our impementations 1 eve ecomposition for iumination estimation yiee fast resuts with high visua quaity. In Fig.3(c) () resut obtaine without an with etai coefficient moification is given. The nee for this step is more apparent in the exampes given in Fig. 6. Fig 6. Exampes showing the effect of etai moification. Origina images eft, enhancement without an with etai coefficient moification mie an right images, respectivey. 2.4 Coor Restoration Coor restoration process is straight forwar. For converting the enhance intensity image to RGB coor image, the ratio between origina an enhance intensity image aong with the chromatic information of the origina image are empoye. The RGB vaues ( r enh, genh, benh ) of the restore coor image are obtaine by, Ienh Ienh Ienh renh = r genh = g benh = b (13) I I I Here I is given by (1) an I enh is the resuting enhance intensity image erive from the inverse waveet transform of the moifie coefficients. Thus, the coor consistency between the origina coor image an the enhance coor image can be achieve. 3. RESULTS ND DISCUSSION The propose agorithm has been appie to process numerous coor images capture uner varying ighting conitions. From our observations we can concue that the agorithm is capabe of removing shaes in the high ynamic range images whie preserving or even enhancing the oca contrast we. Besies, the prouce coors are consistent with the coors of the origina images. In this section more resuts obtaine by the propose agorithm to show its abiity in Proc. of SPIE Vo

9 proucing ynamic range compresse images preserving the oca contrast an goo renition wi be given. Exampes given in Fig. 7. show that the propose enhancement agorithm is capabe of removing the shaes an proviing better resuts in terms of visua quaity. The oca contrast is preserve, even improve in a these exampes. The processe images are sharper than the origina ones. Fig 8. shows two exampes of the rea-wor scenes that vioate the gray-wor assumption. though the scenes are ominate by one coor channe (mosty-green), the propose enhancement agorithm can provie resuts that have very appeaing coor renition an the resuts o not suffer from graying-out of the uniform areas. 2v Fig 7. Image enhancement resuts by propose agorithm. Top: Origina images, bottom: Enhance Images 4 H 4 :. 48 fj4 Fig 8. Image enhancement resuts by propose agorithm. Left: Origina images, right: Enhance Images Proc. of SPIE Vo

10 Fig 9. Image enhancement resuts by propose agorithm. Left: Origina images, right: Enhance Images Two exampes for scenes that have very rich coor mixture are given in Fig 9. The iumination is aso baance in both scenes. Both enhancement resuts preserve the coor information we, proviing sharper resuts. The backgroun that has ow iumination in the first image becomes more visibe with reaistic an baance coors in the enhance image. Both enhance images are brighter than the origina ones. The main avantage of the propose agorithm is its spee. Since the convoutions which take most of the processing time are ony appie to approximation coefficients, the processing time is reuce to amost haf the processing time require for IRME which is known to be esigne for rea time vieo processing on PC patforms. The propose agorithm successfuy accompishes coor renition, ynamic range compression with oca contrast enhancement simutaneousy except for some pathoogica scenes that have very strong spectra characteristics in a singe ban. Two exampes for such scenes are given in Fig 10. though the enhance resuts are sharper than the origina images an the coors of the enhance resuts are consistent with the coors in the origina images, they are not the coors observe in rea-ife scenes. This rawback of the propose agorithm is share with INDNE an IRME as we, since these agorithms, ike the propose one, expoit ony the uminance component of the image to be enhance. The pathoogy in the origina image is inherite to the enhance image via inear coor restoration process. The agorithm is not coor constant. Coor constancy impies the observe scene is inepenent of the spectra characteristics of the iumination to some extent. The observe scenes in given exampes wou et the rea-wor coors be more visibe. 4. CONCLUSIONS waveet base fast image enhancement agorithm which provies ynamic range compression preserving the oca contrast an tona renition has been eveope to improve the visua quaity of the igita images. It is aso a goo caniate for rea time vieo processing appications. though the coors of the enhance images prouce by the Proc. of SPIE Vo

11 propose agorithm are consistent with the coors of the origina image, the propose agorithm fais to prouce coor constant resuts for some pathoogica scenes that have very strong spectra characteristics in a singe ban. The inear coor restoration process is the main reason for this rawback. Hence, a ifferent approach is require for the fina coor restoration process. new version of the propose agorithm which eas with this issue is presenty being eveope..1 I' iz Fig 12. Enhancement resuts of the Pathoogica images. Left: Origina images, right: Enhance Images REFERENCES [1] H. Kob, How the retina works, merican Scientist, Vo 91, No. 1, 2003, pp [2] S. M. Pizer, J. B. Zimmerman, an E. Staab, aptive grey eve assignment in CT scanispay, Journa of Computer ssistant Tomography, vo. 8, pp ,1984. [3] J. B. Zimmerman, S. B. Cousins, K. M. Hartze, M. E. Frisse, an M. G. Kahn, psychophysica comparison of two methos for aaptive histogram equaization, Journa of Digita Imaging, vo. 2, pp (1989). [4] S. M. Pizer an E. P. mburn, aptive histogram equaization an its variations, Computer Vision, Graphics, an Image Processing, vo. 39, pp ,1987. [5] K. Rehm an W. J. Daas, rtifact suppression in igita chest raiographs enhance with aaptive histogram equaization, SPIE: Meica Imaging III,1989. [6] Y. Jin, L. M. Faya, an. F. Laine, Contrast enhancement by mutiscae aaptive histogram equaization, Proc. SPIE, vo. 4478, pp , [7] E. Lan an J. McCann, Lightness an Retinex theory, Journa of the Optica Society of merica, vo.61, pp. 1-11, [8] E. Lan, n aternative technique for the computation of the esignator in the Retinex theory of coor vision, Proc. of the Nationa caemy of Science US, vo. 83, pp , [9] J. McCann, Lessons earne from monrians appie to rea images an coor gamuts, Proc. IS&T/SID Seventh Coor Imaging Conference, pp. 1-8, Proc. of SPIE Vo

12 [10] R. Sobo, Improving the Retinex agorithm for renering wie ynamic range photographs, Proc. SPIE 4662, pp , [11]. Rizzi, C. Gatta, an D. Marini, From Retinex to CE: Issues in eveoping a new agorithm for unsupervise coor equaization, Journa of EectronicImaging, vo. 13, pp , 2004 [12] D. Jobson, Z. Rahman an G.. Wooe, Properties an performance of a center/surroun retinex, IEEE Transactions on Image Processing: Specia Issue on Coor Processing, No. 6, 1997, pp [13] Z. Rahman, D. Jobson, an G.. Wooe, Mutiscae retinex for coor image enhancement, Proc. IEEE Internationa. Conference. on Image Processing, [14] D. Jobson, Z. Rahman, an G.. Wooe, muti-scae retinex for briging the gap between coor images an the human observation of scenes, IEEE Transactions on Image Processing, Vo. 6, 1997, pp [15] L. Tao an K.V. sari, n aaptive an integrate neighborhoo epenent approach for noninear enhancement of coor images, SPIE Journa of Eectronic Imaging, Vo. 14, No. 4, 2005, pp [16] L. Tao, R.C. Tompkins, an K.V. sari, n iuminance-refectance moe for noninear enhancement of vieo stream for homean security appications, IEEE Internationa Workshop on ppie Imagery an Pattern Recognition, IPR , Washington DC, October 19-21, [17] K. V. Vee, Muti-scae coor image enhancement, in Proc. Int. Conf. Image Processing, vo. 3, 1999, pp [18] J.-L. Starc F. Murtagh, E. Canès, an D.L. Donoho. Gray an coor image contrast enhancement by the curveet transform. IEEE Transactions on Image Processing, 12(6): , Proc. of SPIE Vo

An Automatic Wavelet-based Nonlinear Image Enhancement Technique for Aerial Imagery

An Automatic Wavelet-based Nonlinear Image Enhancement Technique for Aerial Imagery An Automatic Waveet-base Noninear Image Enhancement Technique for Aeria Imagery Numan UNALDI an Sami TEMEL Turkish Air Force Acaemy Istanbu, Turkey n.unai@hho.eu.tr an s.teme@hho.eu.tr Vijayan K.ASARI

More information

Digital Image Watermarking Algorithm Based on Fast Curvelet Transform

Digital Image Watermarking Algorithm Based on Fast Curvelet Transform J. Software Engineering & Appications, 010, 3, 939-943 doi:10.436/jsea.010.310111 Pubished Onine October 010 (http://www.scirp.org/journa/jsea) 939 igita Image Watermarking Agorithm Based on Fast Curveet

More information

Quality Assessment using Tone Mapping Algorithm

Quality Assessment using Tone Mapping Algorithm Quaity Assessment using Tone Mapping Agorithm Nandiki.pushpa atha, Kuriti.Rajendra Prasad Research Schoar, Assistant Professor, Vignan s institute of engineering for women, Visakhapatnam, Andhra Pradesh,

More information

Hiding secrete data in compressed images using histogram analysis

Hiding secrete data in compressed images using histogram analysis University of Woongong Research Onine University of Woongong in Dubai - Papers University of Woongong in Dubai 2 iding secrete data in compressed images using histogram anaysis Farhad Keissarian University

More information

Research on UAV Fixed Area Inspection based on Image Reconstruction

Research on UAV Fixed Area Inspection based on Image Reconstruction Research on UAV Fixed Area Inspection based on Image Reconstruction Kun Cao a, Fei Wu b Schoo of Eectronic and Eectrica Engineering, Shanghai University of Engineering Science, Abstract Shanghai 20600,

More information

Sensitivity Analysis of Hopfield Neural Network in Classifying Natural RGB Color Space

Sensitivity Analysis of Hopfield Neural Network in Classifying Natural RGB Color Space Sensitivity Anaysis of Hopfied Neura Network in Cassifying Natura RGB Coor Space Department of Computer Science University of Sharjah UAE rsammouda@sharjah.ac.ae Abstract: - This paper presents a study

More information

Endoscopic Motion Compensation of High Speed Videoendoscopy

Endoscopic Motion Compensation of High Speed Videoendoscopy Endoscopic Motion Compensation of High Speed Videoendoscopy Bharath avuri Department of Computer Science and Engineering, University of South Caroina, Coumbia, SC - 901. ravuri@cse.sc.edu Abstract. High

More information

Fuzzy Perceptual Watermarking For Ownership Verification

Fuzzy Perceptual Watermarking For Ownership Verification Fuzzy Perceptua Watermarking For Ownership Verification Mukesh Motwani 1 and Frederick C. Harris, Jr. 1 1 Computer Science & Engineering Department, University of Nevada, Reno, NV, USA Abstract - An adaptive

More information

Nearest Neighbor Learning

Nearest Neighbor Learning Nearest Neighbor Learning Cassify based on oca simiarity Ranges from simpe nearest neighbor to case-based and anaogica reasoning Use oca information near the current query instance to decide the cassification

More information

JOINT IMAGE REGISTRATION AND EXAMPLE-BASED SUPER-RESOLUTION ALGORITHM

JOINT IMAGE REGISTRATION AND EXAMPLE-BASED SUPER-RESOLUTION ALGORITHM JOINT IMAGE REGISTRATION AND AMPLE-BASED SUPER-RESOLUTION ALGORITHM Hyo-Song Kim, Jeyong Shin, and Rae-Hong Park Department of Eectronic Engineering, Schoo of Engineering, Sogang University 35 Baekbeom-ro,

More information

AUTOMATIC IMAGE RETARGETING USING SALIENCY BASED MESH PARAMETERIZATION

AUTOMATIC IMAGE RETARGETING USING SALIENCY BASED MESH PARAMETERIZATION S.Sai Kumar et a. / (IJCSIT Internationa Journa of Computer Science and Information Technoogies, Vo. 1 (4, 010, 73-79 AUTOMATIC IMAGE RETARGETING USING SALIENCY BASED MESH PARAMETERIZATION 1 S.Sai Kumar,

More information

Application of Image Fusion Techniques on Medical Images

Application of Image Fusion Techniques on Medical Images Internationa Journa of Current Engineering and Technoogy E-ISS 77 406, P-ISS 347 56 07 IPRESSCO, A Rights Reserved Avaiabe at http://inpressco.com/category/icet Research Artice Appication of Image usion

More information

Further Optimization of the Decoding Method for Shortened Binary Cyclic Fire Code

Further Optimization of the Decoding Method for Shortened Binary Cyclic Fire Code Further Optimization of the Decoding Method for Shortened Binary Cycic Fire Code Ch. Nanda Kishore Heosoft (India) Private Limited 8-2-703, Road No-12 Banjara His, Hyderabad, INDIA Phone: +91-040-3378222

More information

A study of comparative evaluation of methods for image processing using color features

A study of comparative evaluation of methods for image processing using color features A study of comparative evauation of methods for image processing using coor features FLORENTINA MAGDA ENESCU,CAZACU DUMITRU Department Eectronics, Computers and Eectrica Engineering University Pitești

More information

EE 122 Final Exam - Solution Date: December 14, 2002

EE 122 Final Exam - Solution Date: December 14, 2002 Name: SID: ee ogin: Day/Time of section you atten: EE Fina Exam - Soution Date: December 4, 00 Probem Points /0 /0 3 /0 4 /0 5 /0 6 /0 7 /0 8 /0 9 /0 0 /0 Tota /00 . Question (0 pt) (a) (5 pt) Expain briefy

More information

Outline. Parallel Numerical Algorithms. Forward Substitution. Triangular Matrices. Solving Triangular Systems. Back Substitution. Parallel Algorithm

Outline. Parallel Numerical Algorithms. Forward Substitution. Triangular Matrices. Solving Triangular Systems. Back Substitution. Parallel Algorithm Outine Parae Numerica Agorithms Chapter 8 Prof. Michae T. Heath Department of Computer Science University of Iinois at Urbana-Champaign CS 554 / CSE 512 1 2 3 4 Trianguar Matrices Michae T. Heath Parae

More information

Performance Enhancement of 2D Face Recognition via Mosaicing

Performance Enhancement of 2D Face Recognition via Mosaicing Performance Enhancement of D Face Recognition via Mosaicing Richa Singh, Mayank Vatsa, Arun Ross, Afze Noore West Virginia University, Morgantown, WV 6506 {richas, mayankv, ross, noore}@csee.wvu.edu Abstract

More information

In Proceedings of the 1996 International Conference on Intelligent Robots and Systems (IROS '96) Virtual Actuator Control

In Proceedings of the 1996 International Conference on Intelligent Robots and Systems (IROS '96) Virtual Actuator Control In Proceeings of the 1996 Internationa Conference on Inteigent Robots an Systems (IROS '96) Virtua ctuator Contro Jerry Pratt, nn Torres, Peter Diworth, Gi Pratt MIT Leg Laboratory, Cambrige, M 19 http://wwwaimiteu/projects/egab/

More information

On-Chip CNN Accelerator for Image Super-Resolution

On-Chip CNN Accelerator for Image Super-Resolution On-Chip CNN Acceerator for Image Super-Resoution Jung-Woo Chang and Suk-Ju Kang Dept. of Eectronic Engineering, Sogang University, Seou, South Korea {zwzang91, sjkang}@sogang.ac.kr ABSTRACT To impement

More information

Image Segmentation Using Semi-Supervised k-means

Image Segmentation Using Semi-Supervised k-means I J C T A, 9(34) 2016, pp. 595-601 Internationa Science Press Image Segmentation Using Semi-Supervised k-means Reza Monsefi * and Saeed Zahedi * ABSTRACT Extracting the region of interest is a very chaenging

More information

FACE RECOGNITION WITH HARMONIC DE-LIGHTING. s: {lyqing, sgshan, wgao}jdl.ac.cn

FACE RECOGNITION WITH HARMONIC DE-LIGHTING.  s: {lyqing, sgshan, wgao}jdl.ac.cn FACE RECOGNITION WITH HARMONIC DE-LIGHTING Laiyun Qing 1,, Shiguang Shan, Wen Gao 1, 1 Graduate Schoo, CAS, Beijing, China, 100080 ICT-ISVISION Joint R&D Laboratory for Face Recognition, CAS, Beijing,

More information

Response Surface Model Updating for Nonlinear Structures

Response Surface Model Updating for Nonlinear Structures Response Surface Mode Updating for Noninear Structures Gonaz Shahidi a, Shamim Pakzad b a PhD Student, Department of Civi and Environmenta Engineering, Lehigh University, ATLSS Engineering Research Center,

More information

Mobile App Recommendation: Maximize the Total App Downloads

Mobile App Recommendation: Maximize the Total App Downloads Mobie App Recommendation: Maximize the Tota App Downoads Zhuohua Chen Schoo of Economics and Management Tsinghua University chenzhh3.12@sem.tsinghua.edu.cn Yinghui (Catherine) Yang Graduate Schoo of Management

More information

Language Identification for Texts Written in Transliteration

Language Identification for Texts Written in Transliteration Language Identification for Texts Written in Transiteration Andrey Chepovskiy, Sergey Gusev, Margarita Kurbatova Higher Schoo of Economics, Data Anaysis and Artificia Inteigence Department, Pokrovskiy

More information

Real-Time Feature Descriptor Matching via a Multi-Resolution Exhaustive Search Method

Real-Time Feature Descriptor Matching via a Multi-Resolution Exhaustive Search Method 297 Rea-Time Feature escriptor Matching via a Muti-Resoution Ehaustive Search Method Chi-Yi Tsai, An-Hung Tsao, and Chuan-Wei Wang epartment of Eectrica Engineering, Tamang University, New Taipei City,

More information

Research of Classification based on Deep Neural Network

Research of  Classification based on Deep Neural Network 2018 Internationa Conference on Sensor Network and Computer Engineering (ICSNCE 2018) Research of Emai Cassification based on Deep Neura Network Wang Yawen Schoo of Computer Science and Engineering Xi

More information

High-Quality Unstructured Volume Rendering on the PC Platform

High-Quality Unstructured Volume Rendering on the PC Platform Graphics Hardware (2002), pp. 1 8 Thomas Ert, Wofgang Heidrich, and Michae Doggett (Editors) High-Quaity Unstructured Voume Rendering on the PC Patform Stefan Guthe Stefan Roettger Andreas Schieber Wofgang

More information

WHILE estimating the depth of a scene from a single image

WHILE estimating the depth of a scene from a single image JOURNAL OF L A T E X CLASS FILES, VOL. 4, NO. 8, AUGUST 05 Monocuar Depth Estimation using Muti-Scae Continuous CRFs as Sequentia Deep Networks Dan Xu, Student Member, IEEE, Eisa Ricci, Member, IEEE, Wani

More information

THE PERCENTAGE OCCUPANCY HIT OR MISS TRANSFORM

THE PERCENTAGE OCCUPANCY HIT OR MISS TRANSFORM 17th European Signa Processing Conference (EUSIPCO 2009) Gasgow, Scotand, August 24-28, 2009 THE PERCENTAGE OCCUPANCY HIT OR MISS TRANSFORM P. Murray 1, S. Marsha 1, and E.Buinger 2 1 Dept. of Eectronic

More information

Filtering. Yao Wang Polytechnic University, Brooklyn, NY 11201

Filtering. Yao Wang Polytechnic University, Brooklyn, NY 11201 Spatia Domain Linear Fitering Yao Wang Poytechnic University Brookyn NY With contribution rom Zhu Liu Onur Gueryuz and Gonzaez/Woods Digita Image Processing ed Introduction Outine Noise remova using ow-pass

More information

A Design Method for Optimal Truss Structures with Certain Redundancy Based on Combinatorial Rigidity Theory

A Design Method for Optimal Truss Structures with Certain Redundancy Based on Combinatorial Rigidity Theory 0 th Word Congress on Structura and Mutidiscipinary Optimization May 9 -, 03, Orando, Forida, USA A Design Method for Optima Truss Structures with Certain Redundancy Based on Combinatoria Rigidity Theory

More information

Load Balancing by MPLS in Differentiated Services Networks

Load Balancing by MPLS in Differentiated Services Networks Load Baancing by MPLS in Differentiated Services Networks Riikka Susitaiva, Jorma Virtamo, and Samui Aato Networking Laboratory, Hesinki University of Technoogy P.O.Box 3000, FIN-02015 HUT, Finand {riikka.susitaiva,

More information

A Fast Block Matching Algorithm Based on the Winner-Update Strategy

A Fast Block Matching Algorithm Based on the Winner-Update Strategy In Proceedings of the Fourth Asian Conference on Computer Vision, Taipei, Taiwan, Jan. 000, Voume, pages 977 98 A Fast Bock Matching Agorithm Based on the Winner-Update Strategy Yong-Sheng Chenyz Yi-Ping

More information

Neural Network Enhancement of the Los Alamos Force Deployment Estimator

Neural Network Enhancement of the Los Alamos Force Deployment Estimator Missouri University of Science and Technoogy Schoars' Mine Eectrica and Computer Engineering Facuty Research & Creative Works Eectrica and Computer Engineering 1-1-1994 Neura Network Enhancement of the

More information

Joint disparity and motion eld estimation in. stereoscopic image sequences. Ioannis Patras, Nikos Alvertos and Georgios Tziritas y.

Joint disparity and motion eld estimation in. stereoscopic image sequences. Ioannis Patras, Nikos Alvertos and Georgios Tziritas y. FORTH-ICS / TR-157 December 1995 Joint disparity and motion ed estimation in stereoscopic image sequences Ioannis Patras, Nikos Avertos and Georgios Tziritas y Abstract This work aims at determining four

More information

FREE-FORM ANISOTROPY: A NEW METHOD FOR CRACK DETECTION ON PAVEMENT SURFACE IMAGES

FREE-FORM ANISOTROPY: A NEW METHOD FOR CRACK DETECTION ON PAVEMENT SURFACE IMAGES FREE-FORM ANISOTROPY: A NEW METHOD FOR CRACK DETECTION ON PAVEMENT SURFACE IMAGES Tien Sy Nguyen, Stéphane Begot, Forent Ducuty, Manue Avia To cite this version: Tien Sy Nguyen, Stéphane Begot, Forent

More information

Multi-level Shape Recognition based on Wavelet-Transform. Modulus Maxima

Multi-level Shape Recognition based on Wavelet-Transform. Modulus Maxima uti-eve Shape Recognition based on Waveet-Transform oduus axima Faouzi Aaya Cheikh, Azhar Quddus and oncef Gabbouj Tampere University of Technoogy (TUT), Signa Processing aboratory, P.O. Box 553, FIN-33101

More information

Design for Optimizability Traffic Management for a Future Internet

Design for Optimizability Traffic Management for a Future Internet Design for Optimizabiity Traffic Management for a Future Internet Jiayue He, Jennifer Rexfor an Mung Chiang Abstract : As networs grow in size an compexity, networ management has become an increasingy

More information

A Comparison of a Second-Order versus a Fourth- Order Laplacian Operator in the Multigrid Algorithm

A Comparison of a Second-Order versus a Fourth- Order Laplacian Operator in the Multigrid Algorithm A Comparison of a Second-Order versus a Fourth- Order Lapacian Operator in the Mutigrid Agorithm Kaushik Datta (kdatta@cs.berkeey.edu Math Project May 9, 003 Abstract In this paper, the mutigrid agorithm

More information

Special Edition Using Microsoft Excel Selecting and Naming Cells and Ranges

Special Edition Using Microsoft Excel Selecting and Naming Cells and Ranges Specia Edition Using Microsoft Exce 2000 - Lesson 3 - Seecting and Naming Ces and.. Page 1 of 8 [Figures are not incuded in this sampe chapter] Specia Edition Using Microsoft Exce 2000-3 - Seecting and

More information

A Fast-Convergence Decoding Method and Memory-Efficient VLSI Decoder Architecture for Irregular LDPC Codes in the IEEE 802.

A Fast-Convergence Decoding Method and Memory-Efficient VLSI Decoder Architecture for Irregular LDPC Codes in the IEEE 802. A Fast-Convergence Decoding Method and Memory-Efficient VLSI Decoder Architecture for Irreguar LDPC Codes in the IEEE 82.16e Standards Yeong-Luh Ueng and Chung-Chao Cheng Dept. of Eectrica Engineering,

More information

Absolute three-dimensional shape measurement with two-frequency square binary patterns

Absolute three-dimensional shape measurement with two-frequency square binary patterns 871 Vo. 56, No. 31 / November 1 217 / Appied Optics Research Artice Absoute three-dimensiona shape measurement with two-frequency square binary patterns CHUFAN JIANG AND SONG ZHANG* Schoo of Mechanica

More information

Automatic Hidden Web Database Classification

Automatic Hidden Web Database Classification Automatic idden Web atabase Cassification Zhiguo Gong, Jingbai Zhang, and Qian Liu Facuty of Science and Technoogy niversity of Macau Macao, PRC {fstzgg,ma46597,ma46620}@umac.mo Abstract. In this paper,

More information

DETECTION OF OBSTACLE AND FREESPACE IN AN AUTONOMOUS WHEELCHAIR USING A STEREOSCOPIC CAMERA SYSTEM

DETECTION OF OBSTACLE AND FREESPACE IN AN AUTONOMOUS WHEELCHAIR USING A STEREOSCOPIC CAMERA SYSTEM DETECTION OF OBSTACLE AND FREESPACE IN AN AUTONOMOUS WHEELCHAIR USING A STEREOSCOPIC CAMERA SYSTEM Le Minh 1, Thanh Hai Nguyen 2, Tran Nghia Khanh 2, Vo Văn Toi 2, Ngo Van Thuyen 1 1 University of Technica

More information

An Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc.

An Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc. [Type text] [Type text] [Type text] ISSN : 0974-7435 Voume 10 Issue 16 BioTechnoogy 014 An Indian Journa FULL PAPER BTAIJ, 10(16), 014 [999-9307] Study on prediction of type- fuzzy ogic power system based

More information

Non-linear adaptive image enhancement in wireless sensor networks based on nonsubsampled

Non-linear adaptive image enhancement in wireless sensor networks based on nonsubsampled Tong and Chen EURASIP Journa on Wireess Communications and Networking (2017) 2017:46 DOI 10.1186/s13638-017-0829-z RESEARCH Non-inear adaptive image enhancement in wireess sensor networks based on nonsubsamped

More information

Multiple Plane Phase Retrieval Based On Inverse Regularized Imaging and Discrete Diffraction Transform

Multiple Plane Phase Retrieval Based On Inverse Regularized Imaging and Discrete Diffraction Transform Mutipe Pane Phase Retrieva Based On Inverse Reguaried Imaging and Discrete Diffraction Transform Artem Migukin, Vadimir Katkovnik, and Jaakko Astoa Department of Signa Processing, Tampere University of

More information

Human Action Recognition Using Key Points Displacement

Human Action Recognition Using Key Points Displacement Human Action Recognition Using Key Points Dispacement Kuan-Ting Lai,, Chaur-Heh Hsieh 3, Mao-Fu Lai 4, and Ming-Syan Chen, Research Center for Information Technoogy Innovation, Academia Sinica, Taiwan

More information

Fastest-Path Computation

Fastest-Path Computation Fastest-Path Computation DONGHUI ZHANG Coege of Computer & Information Science Northeastern University Synonyms fastest route; driving direction Definition In the United states, ony 9.% of the househods

More information

file://j:\macmillancomputerpublishing\chapters\in073.html 3/22/01

file://j:\macmillancomputerpublishing\chapters\in073.html 3/22/01 Page 1 of 15 Chapter 9 Chapter 9: Deveoping the Logica Data Mode The information requirements and business rues provide the information to produce the entities, attributes, and reationships in ogica mode.

More information

Image Segmentation using K-means clustering and Thresholding

Image Segmentation using K-means clustering and Thresholding Image Segmentation using Kmeans clustering an Thresholing Preeti Panwar 1, Girhar Gopal 2, Rakesh Kumar 3 1M.Tech Stuent, Department of Computer Science & Applications, Kurukshetra University, Kurukshetra,

More information

Complex Human Activity Searching in a Video Employing Negative Space Analysis

Complex Human Activity Searching in a Video Employing Negative Space Analysis Compex Human Activity Searching in a Video Empoying Negative Space Anaysis Shah Atiqur Rahman, Siu-Yeung Cho, M.K.H. Leung 3, Schoo of Computer Engineering, Nanyang Technoogica University, Singapore 639798

More information

A Petrel Plugin for Surface Modeling

A Petrel Plugin for Surface Modeling A Petre Pugin for Surface Modeing R. M. Hassanpour, S. H. Derakhshan and C. V. Deutsch Structure and thickness uncertainty are important components of any uncertainty study. The exact ocations of the geoogica

More information

Topology-aware Key Management Schemes for Wireless Multicast

Topology-aware Key Management Schemes for Wireless Multicast Topoogy-aware Key Management Schemes for Wireess Muticast Yan Sun, Wade Trappe,andK.J.RayLiu Department of Eectrica and Computer Engineering, University of Maryand, Coege Park Emai: ysun, kjriu@gue.umd.edu

More information

A New Supervised Clustering Algorithm Based on Min-Max Modular Network with Gaussian-Zero-Crossing Functions

A New Supervised Clustering Algorithm Based on Min-Max Modular Network with Gaussian-Zero-Crossing Functions 2006 Internationa Joint Conference on Neura Networks Sheraton Vancouver Wa Centre Hote, Vancouver, BC, Canada Juy 16-21, 2006 A New Supervised Custering Agorithm Based on Min-Max Moduar Network with Gaussian-Zero-Crossing

More information

A Memory Grouping Method for Sharing Memory BIST Logic

A Memory Grouping Method for Sharing Memory BIST Logic A Memory Grouping Method for Sharing Memory BIST Logic Masahide Miyazai, Tomoazu Yoneda, and Hideo Fuiwara Graduate Schoo of Information Science, Nara Institute of Science and Technoogy (NAIST), 8916-5

More information

Backing-up Fuzzy Control of a Truck-trailer Equipped with a Kingpin Sliding Mechanism

Backing-up Fuzzy Control of a Truck-trailer Equipped with a Kingpin Sliding Mechanism Backing-up Fuzzy Contro of a Truck-traier Equipped with a Kingpin Siding Mechanism G. Siamantas and S. Manesis Eectrica & Computer Engineering Dept., University of Patras, Patras, Greece gsiama@upatras.gr;stam.manesis@ece.upatras.gr

More information

A Robust Sign Language Recognition System with Sparsely Labeled Instances Using Wi-Fi Signals

A Robust Sign Language Recognition System with Sparsely Labeled Instances Using Wi-Fi Signals A Robust Sign Language Recognition System with Sparsey Labeed Instances Using Wi-Fi Signas Jiacheng Shang, Jie Wu Center for Networked Computing Dept. of Computer and Info. Sciences Tempe University Motivation

More information

Optimization and Application of Support Vector Machine Based on SVM Algorithm Parameters

Optimization and Application of Support Vector Machine Based on SVM Algorithm Parameters Optimization and Appication of Support Vector Machine Based on SVM Agorithm Parameters YAN Hui-feng 1, WANG Wei-feng 1, LIU Jie 2 1 ChongQing University of Posts and Teecom 400065, China 2 Schoo Of Civi

More information

A Two-Step Approach for Interactive Pre-Integrated Volume Rendering of Unstructured Grids

A Two-Step Approach for Interactive Pre-Integrated Volume Rendering of Unstructured Grids A Two-Step Approach for Interactive Pre-Integrated Voume Rendering of Unstructured Grids Stefan Roettger and Thomas Ert Visuaization and Interactive Systems Group University of Stuttgart Abstract In the

More information

Learning Dynamic Guidance for Depth Image Enhancement

Learning Dynamic Guidance for Depth Image Enhancement Learning Dynamic Guidance for Depth Image Enhancement Shuhang Gu 1, Wangmeng Zuo 2, Shi Guo 2, Yunjin Chen 3, Chongyu Chen 4,1, Lei Zhang 1, 1 The Hong Kong Poytechnic University, 2 Harbin Institute of

More information

Shading. Slides by Ulf Assarsson and Tomas Akenine-Möller Department of Computer Engineering Chalmers University of Technology

Shading. Slides by Ulf Assarsson and Tomas Akenine-Möller Department of Computer Engineering Chalmers University of Technology Shading Sides by Uf Assarsson and Tomas Akenine-Möer Department of Computer Engineering Chamers University of Technoogy Overview of today s ecture A simpe most basic rea-time ighting mode It is aso OpenGL

More information

Computer Graphics. - Shading & Texturing -

Computer Graphics. - Shading & Texturing - Computer Graphics - Shading & Texturing - Empirica BRDF Approximation Purey heuristic mode Initiay without units (vaues [0,1] r = r,a + r,d + r,s ( + r,m + r,t r,a : Ambient term Approximate indirect iumination

More information

Automatic Grouping for Social Networks CS229 Project Report

Automatic Grouping for Social Networks CS229 Project Report Automatic Grouping for Socia Networks CS229 Project Report Xiaoying Tian Ya Le Yangru Fang Abstract Socia networking sites aow users to manuay categorize their friends, but it is aborious to construct

More information

Handling Outliers in Non-Blind Image Deconvolution

Handling Outliers in Non-Blind Image Deconvolution Handing Outiers in Non-Bind Image Deconvoution Sunghyun Cho 1 Jue Wang 2 Seungyong Lee 1,2 sodomau@postech.ac.kr juewang@adobe.com eesy@postech.ac.kr 1 POSTECH 2 Adobe Systems Abstract Non-bind deconvoution

More information

Forgot to compute the new centroids (-1); error in centroid computations (-1); incorrect clustering results (-2 points); more than 2 errors: 0 points.

Forgot to compute the new centroids (-1); error in centroid computations (-1); incorrect clustering results (-2 points); more than 2 errors: 0 points. Probem 1 a. K means is ony capabe of discovering shapes that are convex poygons [1] Cannot discover X shape because X is not convex. [1] DBSCAN can discover X shape. [1] b. K-means is prototype based and

More information

Contrast Enhancement of Multi-Displays Using Human Contrast Sensitivity

Contrast Enhancement of Multi-Displays Using Human Contrast Sensitivity Contrast Enhancement of Muti-ispays Using Human Contrast Sensitivity Abstract Study of contrast sensitivity of the human eye shows that we are more sensitive to brightness differences at ow intensity eves

More information

WATERMARKING GIS DATA FOR DIGITAL MAP COPYRIGHT PROTECTION

WATERMARKING GIS DATA FOR DIGITAL MAP COPYRIGHT PROTECTION WATERMARKING GIS DATA FOR DIGITAL MAP COPYRIGHT PROTECTION Shen Tao Chinese Academy of Surveying and Mapping, Beijing 100039, China shentao@casm.ac.cn Xu Dehe Institute of resources and environment, North

More information

Image Processing Technology of FLIR-based Enhanced Vision System

Image Processing Technology of FLIR-based Enhanced Vision System 25 TH INTERNATIONAL CONGRESS OF THE AERONAUTICAL SCIENCES Image Processing Technoogy of FLIR-based Enhanced Vision System Ding Quan Xin, Zhu Rong Gang,Zhao Zhen Yu Luoyang Institute of Eectro-optica Equipment

More information

Path-Based Protection for Surviving Double-Link Failures in Mesh-Restorable Optical Networks

Path-Based Protection for Surviving Double-Link Failures in Mesh-Restorable Optical Networks Path-Based Protection for Surviving Doube-Link Faiures in Mesh-Restorabe Optica Networks Wensheng He and Arun K. Somani Dependabe Computing and Networking Laboratory Department of Eectrica and Computer

More information

DETERMINING INTUITIONISTIC FUZZY DEGREE OF OVERLAPPING OF COMPUTATION AND COMMUNICATION IN PARALLEL APPLICATIONS USING GENERALIZED NETS

DETERMINING INTUITIONISTIC FUZZY DEGREE OF OVERLAPPING OF COMPUTATION AND COMMUNICATION IN PARALLEL APPLICATIONS USING GENERALIZED NETS DETERMINING INTUITIONISTIC FUZZY DEGREE OF OVERLAPPING OF COMPUTATION AND COMMUNICATION IN PARALLEL APPLICATIONS USING GENERALIZED NETS Pave Tchesmedjiev, Peter Vassiev Centre for Biomedica Engineering,

More information

AUTOMATIC gender classification based on facial images

AUTOMATIC gender classification based on facial images SUBMITTED TO IEEE TRANSACTIONS ON NEURAL NETWORKS 1 Gender Cassification Using a Min-Max Moduar Support Vector Machine with Incorporating Prior Knowedge Hui-Cheng Lian and Bao-Liang Lu, Senior Member,

More information

Identifying and Tracking Pedestrians Based on Sensor Fusion and Motion Stability Predictions

Identifying and Tracking Pedestrians Based on Sensor Fusion and Motion Stability Predictions Sensors 2010, 10, 8028-8053; doi:10.3390/s100908028 OPEN ACCESS sensors ISSN 1424-8220 www.mdpi.com/journa/sensors Artice Identifying and Tracking Pedestrians Based on Sensor Fusion and Motion Stabiity

More information

Stereo. CS 510 May 2 nd, 2014

Stereo. CS 510 May 2 nd, 2014 Stereo CS 510 May 2 nd, 2014 Where are we? We are done! (essentiay) We covered image matching Correation & Correation Fiters Fourier Anaysis PCA We covered feature-based matching Bag of Features approach

More information

As Michi Henning and Steve Vinoski showed 1, calling a remote

As Michi Henning and Steve Vinoski showed 1, calling a remote Reducing CORBA Ca Latency by Caching and Prefetching Bernd Brügge and Christoph Vismeier Technische Universität München Method ca atency is a major probem in approaches based on object-oriented middeware

More information

A METHOD FOR GRIDLESS ROUTING OF PRINTED CIRCUIT BOARDS. A. C. Finch, K. J. Mackenzie, G. J. Balsdon, G. Symonds

A METHOD FOR GRIDLESS ROUTING OF PRINTED CIRCUIT BOARDS. A. C. Finch, K. J. Mackenzie, G. J. Balsdon, G. Symonds A METHOD FOR GRIDLESS ROUTING OF PRINTED CIRCUIT BOARDS A C Finch K J Mackenzie G J Basdon G Symonds Raca-Redac Ltd Newtown Tewkesbury Gos Engand ABSTRACT The introduction of fine-ine technoogies to printed

More information

Estimating Velocity Fields on a Freeway from Low Resolution Video

Estimating Velocity Fields on a Freeway from Low Resolution Video Estimating Velocity Fiels on a Freeway from Low Resolution Vieo Young Cho Department of Statistics University of California, Berkeley Berkeley, CA 94720-3860 Email: young@stat.berkeley.eu John Rice Department

More information

University of Illinois at Urbana-Champaign, Urbana, IL 61801, /11/$ IEEE 162

University of Illinois at Urbana-Champaign, Urbana, IL 61801, /11/$ IEEE 162 oward Efficient Spatia Variation Decomposition via Sparse Regression Wangyang Zhang, Karthik Baakrishnan, Xin Li, Duane Boning and Rob Rutenbar 3 Carnegie Meon University, Pittsburgh, PA 53, wangyan@ece.cmu.edu,

More information

Efficient method to design RF pulses for parallel excitation MRI using gridding and conjugate gradient

Efficient method to design RF pulses for parallel excitation MRI using gridding and conjugate gradient Origina rtice Efficient method to design RF puses for parae excitation MRI using gridding and conjugate gradient Shuo Feng, Jim Ji Department of Eectrica & Computer Engineering, Texas & M University, Texas,

More information

Community-Aware Opportunistic Routing in Mobile Social Networks

Community-Aware Opportunistic Routing in Mobile Social Networks IEEE TRANSACTIONS ON COMPUTERS VOL:PP NO:99 YEAR 213 Community-Aware Opportunistic Routing in Mobie Socia Networks Mingjun Xiao, Member, IEEE Jie Wu, Feow, IEEE, and Liusheng Huang, Member, IEEE Abstract

More information

Multi-Scale Continuous CRFs as Sequential Deep Networks for Monocular Depth Estimation

Multi-Scale Continuous CRFs as Sequential Deep Networks for Monocular Depth Estimation Muti-Scae Continuous CRFs as Sequentia Deep Networks for Monocuar Depth Estimation Dan Xu 1, Eisa Ricci 4,5, Wani Ouyang 2,3, Xiaogang Wang 2, Nicu Sebe 1 1 University of Trento, 2 The Chinese University

More information

Quality Assessment for Stereoscopic Images by Distortion Separation

Quality Assessment for Stereoscopic Images by Distortion Separation JOURNAL OF SOFTWARE, VOL. 9, NO. 1, JANUARY 14 37 Quaity Assessment for Stereoscopic Images by Distortion Separation Chaozheng Hu, Feng Shao*, Gangyi Jiang, Mei Yu, Fucui Li, Zongju Peng Facuty of Information

More information

Deformation-based interactive texture design using energy optimization

Deformation-based interactive texture design using energy optimization Visua Comput (2007) 23: 631 639 DOI 10.1007/s00371-007-0154-3 ORIGINAL ARTICLE Jianbing Shen Xiaogang Jin Xiaoyang Mao Jieqing Feng Deformation-based interactive texture design using energy optimization

More information

A Two-Step Approach to Hallucinating Faces: Global Parametric Model and Local Nonparametric Model

A Two-Step Approach to Hallucinating Faces: Global Parametric Model and Local Nonparametric Model A Two-Step Approach to aucinating Faces: Goba Parametric Mode and Loca Nonparametric Mode Ce Liu eung-yeung Shum Chang-Shui Zhang State Key Lab of nteigent Technoogy and Systems, Dept. of Automation, Tsinghua

More information

Distance Weighted Discrimination and Second Order Cone Programming

Distance Weighted Discrimination and Second Order Cone Programming Distance Weighted Discrimination and Second Order Cone Programming Hanwen Huang, Xiaosun Lu, Yufeng Liu, J. S. Marron, Perry Haaand Apri 3, 2012 1 Introduction This vignette demonstrates the utiity and

More information

Grating cell operator features for oriented texture segmentation

Grating cell operator features for oriented texture segmentation Appeared in in: Proc. of the 14th Int. Conf. on Pattern Recognition, Brisbane, Austraia, August 16-20, 1998, pp.1010-1014. Grating ce operator features for oriented texture segmentation P. Kruizinga and

More information

Comparison of Methods for Increasing the Performance of a DUA Computation

Comparison of Methods for Increasing the Performance of a DUA Computation Comparison of Methos for Increasing the Performance of a DUA Computation Michael Behrisch, Daniel Krajzewicz, Peter Wagner an Yun-Pang Wang Institute of Transportation Systems, German Aerospace Center,

More information

LCD Video Controller. LCD Video Controller. Introduction Safety Precautions Indentifying the Components... 5

LCD Video Controller. LCD Video Controller. Introduction Safety Precautions Indentifying the Components... 5 LCD Video Controer LCD Video Controer Introduction... 3 Safety Precautions... 4 Indentifying the Components... 5 Main Board... 5 Main Board ASIC Features... 6 LVDS Transmitter... 8 Backight Inverter...

More information

M. Badent 1, E. Di Giacomo 2, G. Liotta 2

M. Badent 1, E. Di Giacomo 2, G. Liotta 2 DIEI Dipartimento di Ingegneria Eettronica e de informazione RT 005-06 Drawing Coored Graphs on Coored Points M. Badent 1, E. Di Giacomo 2, G. Liotta 2 1 University of Konstanz 2 Università di Perugia

More information

A VLSI Architecture of JPEG2000 Encoder

A VLSI Architecture of JPEG2000 Encoder A VLSI Architecture of JPEG2000 Encoder Leibo LIU, Ning CHEN, Hongying MENG, Li ZHANG, Zhihua WANG, and Hongyi CHEN Abstract This paper proposes a VLSI architecture of JPEG2000 encoder, which functionay

More information

Lossless Authentication Watermarking Based on Adaptive Modular Arithmetic

Lossless Authentication Watermarking Based on Adaptive Modular Arithmetic 5 HENGFU YANG, ET AL, LOSSLESS AUTHENTICATION WATERMARKING BASED ON ADAPTIVE MODULAR ARITHMETIC Lossess Authentication Watermarking Based on Adaptive Moduar Arithmetic Hengfu YANG 1,, Xingming SUN 1, Guang

More information

Adaptive 360 VR Video Streaming: Divide and Conquer!

Adaptive 360 VR Video Streaming: Divide and Conquer! Adaptive 360 VR Video Streaming: Divide and Conquer! Mohammad Hosseini *, Viswanathan Swaminathan * University of Iinois at Urbana-Champaign (UIUC) Adobe Research, San Jose, USA Emai: shossen2@iinois.edu,

More information

Mixture Model Analysis of DNA Microarray Images

Mixture Model Analysis of DNA Microarray Images IEEE TANSACTIONS ON MEDICAL IMAIN, VOL.??, NO.??,?? 2005 1 Mixture Mode Anaysis of DNA Microarray Images K. Bekas, N. P. aatsanos, A. Likas and I. E. Lagaris Abstract In this paper we propose a new methodoogy

More information

MULTITASK MULTIVARIATE COMMON SPARSE REPRESENTATIONS FOR ROBUST MULTIMODAL BIOMETRICS RECOGNITION. Heng Zhang, Vishal M. Patel and Rama Chellappa

MULTITASK MULTIVARIATE COMMON SPARSE REPRESENTATIONS FOR ROBUST MULTIMODAL BIOMETRICS RECOGNITION. Heng Zhang, Vishal M. Patel and Rama Chellappa MULTITASK MULTIVARIATE COMMON SPARSE REPRESENTATIONS FOR ROBUST MULTIMODAL BIOMETRICS RECOGNITION Heng Zhang, Visha M. Pate and Rama Cheappa Center for Automation Research University of Maryand, Coage

More information

Modelling and Performance Evaluation of Router Transparent Web cache Mode

Modelling and Performance Evaluation of Router Transparent Web cache Mode Emad Hassan A-Hemiary IJCSET Juy 2012 Vo 2, Issue 7,1316-1320 Modeing and Performance Evauation of Transparent cache Mode Emad Hassan A-Hemiary Network Engineering Department, Coege of Information Engineering,

More information

GPU Implementation of Parallel SVM as Applied to Intrusion Detection System

GPU Implementation of Parallel SVM as Applied to Intrusion Detection System GPU Impementation of Parae SVM as Appied to Intrusion Detection System Sudarshan Hiray Research Schoar, Department of Computer Engineering, Vishwakarma Institute of Technoogy, Pune, India sdhiray7@gmai.com

More information

The Classification of Stored Grain Pests based on Convolutional Neural Network

The Classification of Stored Grain Pests based on Convolutional Neural Network 2017 2nd Internationa Conference on Mechatronics and Information Technoogy (ICMIT 2017) The Cassification of Stored Grain Pests based on Convoutiona Neura Network Dexian Zhang1, Wenun Zhao*, 1 1 Schoo

More information

Intro to Programming & C Why Program? 1.2 Computer Systems: Hardware and Software. Why Learn to Program?

Intro to Programming & C Why Program? 1.2 Computer Systems: Hardware and Software. Why Learn to Program? Intro to Programming & C++ Unit 1 Sections 1.1-3 and 2.1-10, 2.12-13, 2.15-17 CS 1428 Spring 2018 Ji Seaman 1.1 Why Program? Computer programmabe machine designed to foow instructions Program a set of

More information

Geometrical and Statistical Properties of Vision Models obtained via Maximum Differentiation

Geometrical and Statistical Properties of Vision Models obtained via Maximum Differentiation To appear in: Proc. SPIE, Conf. on Human Vision and Eectronic Imaging, XX Vo. 9394, Eds. B Rogowitz, TN Pappas, H de Ridder, San Francisco, CA, 9-12 Feb 2015. Geometrica and Statistica Properties of Vision

More information

QoS-Aware Data Transmission and Wireless Energy Transfer: Performance Modeling and Optimization

QoS-Aware Data Transmission and Wireless Energy Transfer: Performance Modeling and Optimization QoS-Aware Data Transmission and Wireess Energy Transfer: Performance Modeing and Optimization Dusit Niyato, Ping Wang, Yeow Wai Leong, and Tan Hwee Pink Schoo of Computer Engineering, Nanyang Technoogica

More information