How To Restore A Bue Scratch In Digita Image Sequences
|
|
- Augusta Richardson
- 3 years ago
- Views:
Transcription
1 Consigio Nazionae dee Ricerche Istituto di Cacoo e Reti ad Ate Prestazioni Restoration of bue scratches in digita image sequences Lucia Maddaena, Afredo Petrosino RT-ICAR-NA-05-2 December 2005 Consigio Nazionae dee Ricerche, Istituto di Cacoo e Reti ad Ate Prestazioni (ICAR) Sede di Napoi, Via P. Casteino, 803 Napoi, URL:
2 Consigio Nazionae dee Ricerche Istituto di Cacoo e Reti ad Ate Prestazioni Restoration of bue scratches in digita image sequences Lucia Maddaena 2, Afredo Petrosino 3 Rapporto Tecnico N.: RT-ICAR-NA-05-2 Data: dicembre 2005 Sottomesso per pubbicazione 2 Istituto di Cacoo e Reti ad Ate Prestazioni, ICAR-CNR, Sede di Napoi, Via P. Casteino, 803 Napoi 3 Università di Napoi Parthenope, Dipartimento di Scienze Appicate, Via A. De Gasperi 5, 8033 Napoi I rapporti tecnici de ICAR-CNR sono pubbicati da Istituto di Cacoo e Reti ad Ate Prestazioni de Consigio Nazionae dee Ricerche. Tai rapporti, approntati sotto escusiva responsabiità scientifica degi autori, descrivono attività di ricerca de personae e dei coaboratori de ICAR, in acuni casi in un formato preiminare prima dea pubbicazione definitiva in atra sede. 2
3 Restoration of bue scratches in digita image sequences LUCIA MADDALENA, ALFREDO PETROSINO 2 Nationa Research Counci, ICAR Via P. Casteino, 803 Napes, ITALY, Te.: ; fax: ucia.maddaena@na.icar.cnr.it 2 University Parthenope of Napes, Department of Appied Science Via A. De Gasperi 5, 8033 Napes, ITALY, Te.: ; fax: afredo.petrosino@uniparthenope.it Abstract In this paper we consider the probem of detecting and removing bue scratches from digita image sequences. In particuar, we propose a detection method and a remova method that strongy rey on the specific features of such scratches. Evauation of the proposed methods, in terms of both accuracy and performance timings, and numerica experiments on rea images are reported. Keywords: Coour digita fim restoration; Bue scratch; Scratch detection; Scratch remova. Introduction Digita Fim Restoration is an evoving area of Image Processing aimed at studying methodoogies and techniques that aow to digitay restore damaged movies, in order to preserve their historica, artistic and cutura vaue and to faciitate their diffusion through modern communication media. Severa types of defects can be found in a damaged movie, such as dust and dirt, brightness and positiona instabiity, coour fading, scratches. We are specificay concerned with persistent scratches, intended as vertica ines appearing at the same ocation in subsequent frames of the image sequence. White or back scratches in od movies are mainy due to the abrasion of the fim caused by spurious partices present in the camera, during the sequence acquisition phase, or in the projector, during the fim projection. Instead, bue scratches, which are the subject of our interest, affect many modern coour movies and are due to spurious partices present in the transport mechanism of the equipment used for the deveopment of the fim. Most of the methods reported in iterature that afford this kind of probem are articuated in a detection phase and a remova phase. Submitted for pubication 3
4 The detection phase consists in searching, among a the vertica ines of the images, those that are not natura ines of the scene, which are characterized as defects. Severa methods have been adopted in the case of white or back scratches, such as those based on ow/high pass fiters [7, 8], morphoogica fiters [9, 2-5, 27], adaptive binarization [6], discrete waveet decomposition [5], statistics and MAP techniques [24, 25, 30], or oca gradient measures in the image [, 2] or in the image cross section [6], eventuay couped with techniques such as Hough transform [5, 8, 2] or Kaman fiter [2-5], and possiby foowed by Bayesian refinement strategies [8]. The resut of the detection phase over a sequence frame is a binary image, the scratch mask, of the same size, where white pixes are reated to scratch pixes in the corresponding sequence frame. The remova phase consists in reconstructing corrupted information in the defect area individuated by the scratch mask. Depending on the amount of the defect, information incuded in the scratch area can be either sighty or strongy affected by the defect; thus, the scratch remova probem can be approached either as a partiay corrupted data probem or as a missing data probem, respectivey. Foowing the partiay corrupted data approach, information incuded in the artifact area is taken into account for the remova. In the case of back or white scratches, some authors adopted such approach and obtained remova through morphoogica fiters [27], interpoation or approximation [4, 5, 24], eventuay foowed by the reconstruction of highfrequency components via Fourier series [4] or via MAP techniques [5]. On the other hand, in the missing data approach pixes in the artifact area are considered missing even if they are ony sighty atered. This approach has been adopted for back or white scratches by many authors, who obtained remova through interpoation or approximation [5, 22, 26], the adoption of autoregressive modes [7, 8], morphoogica fiters [9], or mean vector fiters [6], eventuay with the addition of east squares-based grain estimation [22]. Moreover, this approach is the one generay adopted for image inpainting, that is the set of techniques for making undetectabe modifications to images [28]; such techniques are generay used to fi-in missing data or to substitute information contained in sma image regions [32]. Inpainting has been pursued in iterature aso under different names, such as image interpoation (e.g. [29]) and fi-in (e.g. [2, 9]); the probem has been afforded aso as disoccusion, since missing data can be considered as occusions hiding the image region to be reconstructed (e.g. [3, 23]). Finay, inpainting is aso reated to texture synthesis, where the probem consists in generating, given a sampe texture, an unimited amount of image data which wi be perceived by humans as having the same texture []; specificay, inpainting can be considered as a constrained texture synthesis probem [4, 9, 20]. Even though the probem of detection and remova of white or back scratches in digita image sequences has been considered by so many authors and severa commercia software systems incude modues for their restoration (such as the DIAMANT Suite distributed by HS-ART Digita Service GmbH or the Reviva distributed by da Vinci Systems, Inc.), the specific case of bue scratches has not been specificay addressed. As aready mentioned, they generay affect modern coour movies and, therefore, before aunching a new motion picture, the fim must be digitay restored by companies speciaized in digita effects and postprocessing. The need for efficient and automatic toos abe to digitay remove bue scratches has been the 4
5 primary input for the reported research. Specificay, in this paper we propose a method for the detection and remova of bue scratches in digita images that takes into account the specific features of such kind of scratches. The contents of this paper are as foows. In Section 2 the features of bue scratches are anaysed, in order to device suitabe digita restoration techniques. Sections 3 and 4 outine the methods that we propose for bue scratch detection and remova, respectivey, giving detais of the reated agorithms and impementations. In Section 5 we describe quaitative and quantitative resuts achieved by the proposed approach on rea images. Concusions are reported in Section Bue scratch characterisation Bue scratches in a digita image sequence appear as bue strips ocated aong a thin area covering from top to bottom of each sequence frame. Exampes of bue scratches are given in Figs., 3 and 4, which are detais of 24 bits RGB coour images, originay of size 2880x2048, beonging to the movie Animai che attraversano a strada (2000). Contrary to white or back scratches appearing in dated movies, the direction of bue scratches does not deviate too much from the vertica direction, and their position aong the horizonta direction does not change too much (no more than few pixes) from one frame to the next. Therefore usuay bue scratches are not obique and have fixed position in consecutive frames of the image sequence. This is due to the fact that bue scratches are not caused by improper storage conditions or improper handing of the fim, as is usuay the case for ancient movies. They are rather caused by spurious partices present in the transport mechanism of the deveopment equipment; in the case of modern equipment, the transport mechanism stricty contros the sippage of the fim, which cannot move too much from its rectiinear trajectory. Due to this feature, restoration of bue scratches cannot rey on tempora discontinuity of the image intensity function aong the sequence; therefore, in the foowing we concentrate on purey spatia scratch detection and remova in each image. (a) (b) (c) (d) (e) Fig. : Exampe of a bue scratch: (a) coour image; (b) scratch detai; (c) red, (d) green, and (d) bue band of scratch detai. 5
6 Inside the bue scratch area, origina information has been substituted by more or ess intense bue coour. Specificay, considering the RGB coour space, in the bue band there are increased intensity vaues compared with the neighbourhood of the scratch; in the green band some of the pixes are atered in an unpredictabe way, usuay with a sight increase or decrease of intensity vaues; the red band is usuay uncorrupted, athough sometimes there coud be sma fuctuations of intensity vaues in pixes beonging to the scratch area. A detai of a bue scratch and its red, green and bue bands is given in Fig.. In order to have a better understanding of the scratch structure, we have anaysed a corrupted sequences of the above mentioned movie, identifying three types of bue scratches. The most common type incudes bue scratches such as the one appearing in Fig.. Looking at Fig. 2-(a), which shows the intensity curve of each coour band of the image of Fig., taken as horizonta section of the image intensity function at row 00, it ceary appears that the intensity curve of the bue band has a ridge in the scratch area. The described effect is sti more evident in Fig. 2-(b), where the horizonta projection of the intensity curve, taken as the mean over the image coumns of the intensity curve, is shown for the three coour bands. Specificay, in the scratch area the projection of the bue band has a ridge whose width w is about 9 pixes and whose height h is about 25 intensity vaues; the projection of the green band presents a sight decrease of about 5 intensity vaues around the center of the scratch. The projection of the red band does not show cear effects of the scratch, and red band can be therefore considered as uncorrupted. (a) (b) Fig. 2: Profies of the bue scratch in the image of Fig. : (a) intensity curves of the three bands, taken at row 00; (b) horizonta projection of the image intensity curves of the three bands. The second type incudes ess common bue scratches, as the one appearing in Fig. 3. Here we can observe that in the scratch area the projection of the bue band has a ridge accompanied by a shadow on the right; the tota scratch width w is about 5 pixes, whie the ridge height h is about 50 intensity vaues. The projections of the green and red bands show sma fuctuations of about 5 intensity vaues in the scratch area. The third type incudes ess common bue scratches that appear as two scratches cose together, as the one presented in Fig. 4. Here we can observe that in the scratch area the projection of the bue band has two neighboring ridges whose cumuative width is about 29 pixes, and whose heights are about 45 and 35 intensity vaues respectivey; the projection of the green band presents a sight increase of about 0 intensity 6
7 vaues around the center of the eft ridge. The projection of the red band does not show cear effects of the scratch, and red band can be therefore considered as uncorrupted. In Fig. 4 it is aso interesting to observe that the white scratch appearing on the eft of the bue one has coour band horizonta projections different from those of the bue scratch, since for white scratches the ridge affects a three coour bands in the same way. (a) (b) Fig.3: Exampe of a bue scratch: (a) coour image; (b) horizonta projection of the image intensity curves of the three bands. (a) (b) Fig.4: Exampe of a bue scratch: (a) coour image; (b) horizonta projection of the image intensity curves of the three bands. 3. Bue scratch detection 3.. Description of the method The idea at the basis of the bue scratch detection agorithm is that of searching, among a pixes beonging to vertica ines of the image, those having an intense bue coour. Specificay, our method consists in enhancing vertica edges of the image by appying a suitabe oca operator, and, due to the specific features of bue scratches, in restricting the search to vertica ridge edges, whose pixes are oca maxima for intensity curves of the bue band aong the horizonta direction. This 7
8 restriction aows to avoid considering contours of scene objects that appear as vertica ines but that are not image defects. The process eads to a modified version I E of the origina image, where bue vertica ines are particuary emphasized. In order to discriminate between pixes beonging to eventua bue vertica ines of the scene and pixes beonging to the bue scratch, we shoud be abe to determine the intense bue coour that is proper of bue scratches as emphasized in I E. The HSV coour space, which reies on the hue, saturation and vaue properties of each coour, aows to specify coours in a way that is cose to human experience of coours. Therefore, the conversion of the image to the HSV space can be hepfu in finding the bue coour range. Once the range of the bue coour searched has been determined, a binary image I B is obtained from the enhanced image I E, where pixes are marked if their coour is in this range. Finay, we identify the abscissae of vertica ines of image I B (and therefore those of vertica bue scratches of the origina image) as oca maxima of the horizonta projection of I B. Further improvement in the above described procedure can be obtained if the input image is suitaby preprocessed and if the resuting scratch mask is suitaby post-processed. The preprocessing is aimed at reducing noise that coud affect the input image, due to fim grain, dust and dirt, digitisation artifacts, etc.; the postprocessing is aimed at refining the scratch mask BSD agorithm Let I be the RGB image: { I( i, j,k), i =,,N; j =,,M;k,2,3} I = K K =, where N is the image height, M is the image width, and k=, 2, and 3 correspond to red, green, and bue bands respectivey. The proposed Bue Scratch Detection (BSD) agorithm for the detection of bue scratches in a digita image I is the foowing: BSD Agorithm Step. Pre-processing of the input image: noise reduction, with preservation of vertica edges; Step 2. Enhancement of vertica bue ines: a. enhancement of vertica edges; b. eimination of vertica edges not produced by vertica bue ines; Step 3. Binarisation: for each pixe of the image intensity matrix resuting from step 2: a. convert from RGB space to HSV space; b. if HSV vaues correspond to the intense bue coour, set to the corresponding pixe in the binary image I B ; Step 4. Refinement of the scratch mask: detection in the binary image I B of vertica ines that cover amost the whoe image height. 8
9 In our experiments, for Step we appy a one-dimensiona ow-pass fiter aong the coumns of the image intensity function, so that vertica edges are preserved. The fiter adopted is the mean in a pixes vertica neighbourhood of each pixe. The preprocessed image I P resuting from Step appied to the image of Fig. is shown in Fig. 5-(a). For Step 2.a we appy a one-dimensiona high-pass fiter aong the rows of the image intensity function. Supposing that w is the scratch width in the i-th row, for each pixe I P (i, j, ) the fiter adopted for our experiments is the fiter in a 3w pixes neighbourhood whose resut is described as: I j+ 3w / 2 E ( i, j, ) = a I P ( i,, ), = j 3w / 2 where: 2 = j w / 2,..., j + w / 2 a =. otherwise In Step 2.b we want to restrict our attention ony to vertica edges produced by bue vertica ines of width w; that is, we want to consider ony vertica edges whose bue band horizonta profie is a ridge edge of width w. For each pixe I P (i, j, ) we consider the three quantities: S L j w / 2 j+ w / 2 j+ 3w / 2 ( k) = I ( i,,k ), S ( k) = I ( i,,k ), S ( k) = I ( i,,k ), P = j 3w / 2 C P = j w / 2 R P = j+ w / 2+ and, for k=, 2, 3, set I E (i, j, k) = 0 if S C (3)< S L (3) or S C (3) < S R (3). This strong condition, in fact, ensures that the pixe I P (i, j, ) does not beong to a vertica ridge edge of width w of the bue band of image I P. Note that Steps 2.a and 2.b can be merged in a singe step, where for each pixe I P (i, j, ) we compute the above quantities S L (k), S C (k), and S R (k) and we set: I E ( i, j,k ) ( k) + 2 SC ( k) S R ( k) if SC ( 3) > S L ( 3) and SC ( 3) S R ( 3). S L > = 0 otherwise The resut of Step 2 on the image of Fig. is reported in Fig. 5-(b). The conversion from the RGB space to the HSV space adopted in Step 3.a is computed as foows: V = max(r, G, B), 0 S = [ V min( R, G, B)] / V V = 0, V 0 60 H = 60[2 60[4 0 ( G B) /( + ( B R) + ( R G) H S * V ) ] /( S * V ) ] /( S * V ) S = 0 V = R V = G V = B H < 0 where, for each pixe, the input vaues R, G, B are the pixe intensity vaues in the three bands, normaized in [0,], and the output vaues H, S, V are such that H [0,360], S [0,], and V [0,]. The bue coour is searched among pixes having hue H [80,300] (240 being the bue hue), saturation S > 0.45 and vaue V > 9
10 0.; these vaues take into account the transformations performed on the origina image I for obtaining the enhanced image I E, and have been experimentay chosen performing tests on severa different images. The binary image I B resuting from Step 3 on the image of Fig. is reported in Fig. 5-(c). In Step 4 we detect vertica ines of the binary image I B as oca maxima of the horizonta projection P of I B, whose j-th eement beonging to the generic band is defined as: P N ( j, ) = I ( i, j, ), j =, K,M. i= B Since bue scratches usuay cover most of the height of the image, a oca maximum for P in coumn j shoud be obtained for P(j, ) cose to the image height N. Therefore, we eiminate from the scratch mask the whoe coumn j as soon as P(j, ) is ower than a fixed percentage of N. We experimented that, in order to avoid deeting from the mask the scratch contours, obtaining a too sim mask, it is better to fix a percentage vaue ower than 00% of the height. In the genera case, a percentage equa to 50% is a good compromise between ack of fase positives and accurate detection of the bue scratch (see for instance Fig. 5-(d)). (a) (b) (c) (d) Fig. 5: BSD agorithm for the image of Fig. : Resuts of (a) Step ; (b) Step 2; (c) Step 3; (d) Step 4. It shoud be expicity observed that, in order to have an automatic restoration agorithm, the scratch width is preiminary computed using oca minima/maxima of the uminance cross-section, as in [6]. Other techniques, such as those used in [5, 8, 24, 30], coud be aternativey adopted. 0
11 4. Bue scratch remova 4.. Description of the method In anaysing the bue scratch features, we have aready observed in Section 2 that pixes beonging to the scratch have undergone an intensity vaue reduction or increase (depending on the considered coour band) compared with pixes in the scratch neighbourhood, but sti retain usefu information concerning the image structure. Therefore we approach the bue scratch remova probem as a partiay corrupted data probem. Looking more into detais at pots reported in Figs. 2, 3, and 4, we can observe that in uncorrupted areas of the image the dispacements of the bue band intensity vaues from those of the red band are ocay roughy constant; the same hods for dispacements of the green band from the red band. In the scratch area, instead, such dispacements appear strongy varying. Since, as aready observed in Section 2, the red band is usuay uncorrupted, we can restore the green and bue bands bringing their dispacement from the red band inside the scratch area to the same dispacement they have outside the scratch area BSR agorithm The Bue Scratch Remova (BSR) agorithm we have designed can be sketched as foows: BSR Agorithm For each row of the image: Step. preprocessing of the red band; Step 2. compute minimum, maximum and median dispacement of the green and bue bands from the red band in an uncorrupted neighbourhood of the scratch; Step 3. add median dispacement to a pixes of the green and bue bands beonging to the scratch area whose dispacement from the red band is beow minimum or above maximum dispacement. Step, here accompished with rank-order fiters, is required to take into account cases where the red band appears sighty corrupted. For Step 2 of BSR agorithm in the i-th row the neighbourhood N i,k for band k chosen in our experiments consists of three uncorrupted pixes beonging to the same row on the right of the scratch and three on the eft: { I(i, j,k) : j = b 3,b 2,b,b+ w,b+ w+,b+ w 2} N i, k + =, where w is the scratch width and b indicates the first coumn of the scratch. Defining the dispacement in the i-th row of the band k from the red band as: in Step 2 we compute: D { d(i, j,k) = I(i, j,) I(i, j,k) : I(i, j,k) } =, i, k N i,k
12 D max i,k = max d(i, j,k) Di,k min med { d(i, j,k) },D = min { d(i, j,k) },D = median{ D }, i,k d(i, j,k) Di,k i,k i, k and in Step 3 we restore the k-th coour component I(i, j, k) of a pixe as: min max if its vaue is not incuded in [ D, D ]. i,k i,k I med ( i, j,k) = I( i, j,) D i,k 5. Experimenta resuts 5.. Evauation of BSD agorithm BSD agorithm has been tested on severa rea images. From the visua inspection standpoint, the accuracy of the achieved resuts appears quite high, as it is shown by the scratch mask reported in Fig. 5-(d) for the image of Fig.. (a) (b) (c) Fig. 6: Compete cubic interpoating spine modes for bue band horizonta projection of the images in:(a) Fig. ; (b) Fig. 3; (c) Fig. 4. Anyway, the vaidity of the method caims for a more quantitative evauation. To this aim, we have artificiay corrupted rea images with bue scratches. We modeed the horizonta projection of the bue band 2
13 ); in the scratch with a compete cubic spine interpoating extrema of the projection and its maximum point. Such mode is quite adequate for the genera bue scratch, as it is shown in Fig. 6-(a), where the compete cubic spine interpoating points marked as * is superimposed to the rea bue band projection of the image in Fig. -(a). Different bue scratch profies, such as those presented in Figs. 3-(b) and 4-(b), can be anaogousy modeed with a compete cubic spine interpoating suitabe points, as it is shown in Figs. 6-(b) and 6-(c). Moreover, since the behaviour of the green band projection cannot be modeed a priori, to create more reaistic artificia bue scratches for the green band projection we appy a simiar mode, scaed by a factor f. Specificay, we considered L=20 uncorrupted origina RGB images I, =,, L, each of size N M,; they incude we known images (e.g. Lena, Tiffany ) obtained by [7, 8, 3] as we as images taken from uncorrupted areas of aready digitised images of the movie Animai che attraversano a strada (2000). The corresponding images with an artificia bue scratch of odd width w and height h, denoted as I w,h, =,, L; w=5,7,, 5, h=50, 60, 70, have been obtained as: T [ ] if ( i, j) T w w,h T I ( ) ( i, j) + 0,sw,h ( j) /f,sw,h ( j) I i, j = () T I ( i, j) otherwise T where I ( i, j) = [ I ( i, j,),i ( i, j,2),i ( i, )] T w,h T w,h w,h w,h, I ( i, j) = I ( i, j,),i ( i, j,2),i ( i, ) j,3 [ ] T j,3 denotes the scratch domain, that is the rectanguar subset of the image domain of size N w having as first coumn the centre coumn b=m /2 of the image: Ω w ={ (i, j): i = b,, b +w-; j=,, N }, and s w,h (j) denotes the compete cubic spine interpoating points (b-,0), (b+w/2,h), (b+w,0). An exampe of an image I w,h artificiay corrupted with a bue scratch of width w=5 and height h=70 is given in Fig. 7, together with the horizonta projection of the intensity curves for its three bands; a the other artificiay corrupted images I w,h are avaiabe at web page [0], together with corresponding resuts obtained with the proposed agorithms. Knowing a priori the scratch mask for such images, we can then appy BSD agorithm to the corrupted images and have an error estimate. For each mask B w,h computed with BSD agorithm for the artificiay scratched image I w,h described in (), with size N M, we count: C w,h = number of correct detections (scratch pixes that are incuded in the computed scratch mask); F w,h = number of fase aarms (pixes not beonging to the scratch that are incuded in the computed scratch mask), and their rates RC w,h and RF w,h over their respective domains: RC w,h = C w,h /( N w), N w being the number of corrupted pixes (i.e. the dimension of the set w RF w,h = F w,h /(N M - N w)., w 3
14 (a) (b) (c) (d) Fig. 7: Exampe of artificia bue scratch: (a) origina image; (b) horizonta projection of the intensity curves of the three bands of origina image; (c) image corrupted with bue scratch of width w=5 and height h=70; (b) horizonta projection of the intensity curves of the three bands of corrupted image. Given the scratch width w and the height h, the measures adopted for the objective estimation of BSD agorithm are: L w,h mean correct detection rate: RC = RC L = the vaue of RC w,h, the better the detection resut; L w,h mean fase aarm rate: RF = RF L = w,h w,h. Such measure gives vaues in [0,]; the higher. Such measure gives vaues in [0,]; the ower the vaue of RF w,h, the better the detection resut. Vaues for RC w,h obtained with BSD agorithm appied to images I w,h described in (), varying the scratch width w and height h, are reported in Fig. 8. Here we can observe that they are generay quite high, even if they tend to decrease increasing the scratch width w and decreasing height h, in accordance with the increasing difficuty in detecting bue scratches as the width widens and as the height decreases. Corresponding RF w,h vaues are aways cose to zero. 4
15 Fig. 8: Error estimates for BSD agorithm appied to images described in (): mean correct detection rate. The computationa compexity of BSD agorithm, in terms of comparisons and arithmetic operations invoved, for an image of size N M affected by a bue scratch of width w is O(N*M*w). Just to give an idea, execution times of BSD agorithm, impemented in ANSI C on a Pentium IV, 2GHz, 256Mbytes RAM, for 24 bits RGB coour images of size 256*256, 576*720, and 2048*2880, affected by a bue scratch of width w ranging from 5 to 5 pixes are neary 0.03 s, 0.2 s, and 6.9 s, respectivey. We concude that execution times are quite ow for reduced size images; however, they are not sufficienty ow for rea time bue scratch detection in the case of movie resoution images. Paraeisation strategies for BSD agorithm are currenty under examination Evauation of BSR agorithm The resut of BSR agorithm appied to the naturay corrupted images of Figs., 3, and 4 and to the artificiay corrupted image of Fig. 7 is shown in Figs. 9, 0,, and 2, respectivey, together with the horizonta projection of the intensity curves of their three bands. Here we can observe that BSR agorithm performs in a quite satisfactory way from the subjective visua point of view. (a) (b) Fig 9: BSR agorithm for the image of Fig. : (a) restored image; (b) horizonta projection of the intensity curves of the three bands of the restored image. 5
16 (a) (b) Fig 0: BSR agorithm for the image of Fig. 3: (a) restored image; (b) horizonta projection of the intensity curves of the three bands of the restored image. (a) (b) Fig : BSR agorithm for the image of Fig. 4: (a) restored image; (b) horizonta projection of the intensity curves of the three bands of the restored image. (a) (b) Fig 2: BSR agorithm for the image of Fig. 7: (a) restored image; (b) horizonta projection of the intensity curves of the three bands of the restored image. 6
17 ., Our aim now is to evauate the restoration quaity attained by BSR agorithm in terms of some objective measure. Therefore, we have again considered the artificiay corrupted images I w,h of size N M described by () used for the evauation of BSD agorithm. Given the scratch width w and the height h, et be, for =,, L: o the subimage of origina image I containing ony pixes in r the subimage of the restored image R w,h, obtained with BSR agorithm, containing ony pixes in w We consider the foowing objective measures, a computed as the mean over the three bands of each image: MeanMSE: mean, over the L images, of the Mean Square Error (MSE) between the origina and the restored images: w MeanMSE = L L = N w o r 2, where. is intended as vector norm. Such measure gives a nonnegative vaue; the smaer the vaue of MeanMSE, the better the restoration resut; MeanPSNR: mean, over the L images, of the Peak-to-Noise-Ratio between the origina and the restored images obtained considering the MSE: MeanPSNR = L L = 0* og o N w 2 r 2. Such measure gives a nonnegative vaue; the higher the vaue of MeanPSNR, the better the restoration resut; MeanSSIM: mean, over the L images, of the Structura Simiarity Index [33] appied to the origina and the restored images: MeanSSIM = L L ( 2 µ o µ r + C )( o r C ) 2 σ + 2 ( C )( C ), = µ + µ + σ + σ + o r o r 2 where C =(K *A) 2, C 2 =(K 2 *A) 2, K =0.0, K 2 =0.03, and A=255. Such measure gives vaues in [0,]; the higher the vaue of MeanSSIM, the better the restoration resut. Resuts in terms of the described measures obtained by BSR agorithm varying the scratch width w and height h are reported in Fig. 3, and show that statistica properties of the origina images are quite we 7
18 restored. Moreover, it can be observed that resuts obtained with a the considered measures show ower accuracy increasing the scratch width w and height h, in accordance with the increasing reconstruction difficuty as the reconstruction area widens and as the scratch contrast grows. (a) (b) (c) Fig 3: Error measures for BSR agorithm appied to images described in (): (a) MeanMSE; (b) MeanPSNR; (c) MeanSSIM. Such resuts have aso been compared with anaogous resuts obtained with an impementation of the inpainting agorithm (missing data approach) presented in [4], shown in Fig. 4. Here we can observe that a the considered error measures attain vaues worse than those obtained by BSR agorithm. (a) (b) (c) Fig 4: Error measures for the inpainting agorithm presented in [4] appied to images described in (): (a) MeanMSE; (b) MeanPSNR; (c) MeanSSIM. Conscious that, due to the specific features of bue scratches, the defect cannot be perfecty simuated on an uncorrupted image, we performed aso different accuracy measurements. Having at our disposa amost uniform rea images affected by bue scratches (reported in Figs. 5 and 6), we have taken the above measures on subbocks of such images. Specificay, for the image of Fig. 5-(a) showing a bue scratch of average width 9 (from coumn 27 to coumn 35), we have considered as corrupted image, I C, the subimage of the origina image containing a bock of coumns that incude the bue scratch (from coumn 2 to coumn 4), and we have considered two uncorrupted images, I UL and I UR, the first containing a bock of uncorrupted coumns on the eft of I C (from coumn 00 to 20) and the second containing a bock of uncorrupted coumns on the right of I C (from coumn 42 to 62). Appying BSR agorithm to the corrupted image I C, we have obtained the restored image I R. Sub-images I C, I UL,I UR, and I R, of the image of Fig. 5-(a) are reported in Fig. 8
19 5-(e). The mean, the standard deviation, and the L 2 norm for the corrupted image I C, for the uncorrupted images I UL and I UR and for the restored image I R are compared and reported in Tabe. The resuts confirm that BSR agorithm performs quite we for bue scratches of standard width. (a) (b) (c) (d) (e) Fig 5: Exampe of a bue scratch on a uniform background: (a) origina image; (b) horizonta projection of the intensity curves of the three bands of the origina image; (c) restored image; (d) horizonta projection of the intensity curves of the three bands of the restored image; (e) subimages considered for the measures reported in Tabe. 9
20 (a) (b) (c) (d) (e) Fig 6: Exampe of a wide bue scratch on a uniform background: (a) origina image; (b) horizonta projection of the intensity curves of the three bands of the origina image; (c) restored image; (d) horizonta projection of the intensity curves of the three bands of the restored image; (e) subimages considered for the measures reported in Tabe 2. 20
21 Sub-image Mean Std. Dev. L 2 norm I C I UL I UR I R Tabe : Mean, standard deviation and L 2 norm for the corrupted image I C, for the uncorrupted images I UL and I UR, and for the restored image I R reported in Fig. 5. Sub-image Mean Std. Dev. L 2 norm I C I UL I UR I R Tabe 2: Mean, standard deviation and L 2 norm for the corrupted image I C, for the uncorrupted images I UL and I UR, and for the restored image I R reported in Fig. 6. Anaogous measures for the amost uniform image of Fig. 6-(a) are reported in Tabe 2. In this case the average scratch width is 23 pixes; the corrupted image I C, containing a bock of coumns of the image incuding the bue scratch (from coumn to coumn 45), and the two uncorrupted images I UL and I UR, containing the bock from coumn 76 to 0 and from coumn 46 to 80, respectivey, are shown in Fig. 6- (e), together with the restored image I R obtained appying BSR agorithm to I C. The resuts confirm that BSR agorithm performs quite we aso for very arge bue scratches. The computationa compexity of BSR agorithm is quite ow, incuding a number of comparisons ineary proportiona to the size of the image and a number of arithmetic operations ineary proportiona to the number of rows of the image and the scratch width. Execution times of BSR agorithm, in ANSI C on a Pentium IV, 2GHz, 256Mbytes RAM, for 24 bits RGB coour images of size 256*256, 576*720, and 2048*2880, affected by a bue scratch of width w ranging from 5 to 5 pixes are neary s, 0.0 s, and 0.55 s, respectivey. Therefore, we can concude that execution time is generay sufficienty ow for rea time bue scratch remova, even for movie resoution images. 6. Concusions We considered the probem of detecting and removing bue scratches from digita image sequences. In particuar, we anaysed in detai the specific features of such kind of scratches and proposed a detection method and a remova method that strongy rey on these features. A thorough anaysis of the agorithms accuracy, accompanied by severa numerica experiments carried out on both naturay and artificiay corrupted images, show that the proposed detection and remova agorithms produce satisfying resuts. The performance of the agorithms, in terms of execution times, is quite good for TV resoution images; however, for the case of movie resoution images the detection agorithm does not aow rea time computation, 2
22 requiring execution times in the order of tens of seconds. Paraeisation strategies for the detection agorithm are currenty under examination. 7. Acknowedgements The authors woud ike to express their gratitude to the anonymous referees for their usefu suggestions. This work has been partiay supported by the Regiona Competence Centre for the Deveopment and Transfer of Innovation Appied to Cutura and Environmenta Heritage (INNOVA) funded by Regione Campania, Itay. References [] A. Anzaone, A. Machì, A Method for Accurate Detection of Lineary Scratched Areas in Motion Pictures, Proceeding of IASTED-VIIP0, Spain (200) [2] C. Baester, M. Bertamio, V. Casees, G. Sapiro, J. Verdera, Fiing-in by joint interpoation of vector fieds and grey eves, IEEE Transactions on Image Processing 0 (200) [3] C. Baester, V. Casees, J. Verdera, Disoccusion by joint interpoation of vector fieds and grey eves, SIAM Journa Mutiscae Modeing and Simuation 2 (2003) [4] R. Bornard, E. Lecan, L. Laborei, J.-H. Chenot, Missing data correction in sti images and image sequences, Proceedings of ACM Mutimedia (2002) [5] T. Bretscheneider, O. Kao, P.J. Bones, Remova of Vertica Scratches in Digitised Historica Fim Sequences Using Waveet Decomposition, Proceedings of Image and Vision Computing Conference, Hamiton, New Zeaand (2000) [6] V. Bruni, D. Vituano, A Generaized Mode for Scratch Detection, IEEE Transactions on Image Processing 3 (2004) [7] Coor Texture Anaysis, Institut fur Computervisuaistik, Universitat Kobenz-Landau, [8] Computer Vision Laboratory, Computer Science Department, University of Massachussets, [9] E. Decenciere Ferrandiere, Restauration automatique de fims anciens, PhD Thesis, Ecoe Nationae Superieure des Mines de Paris (997). [0] DFR Laboratory, ICAR-CNR, Napes, [] A.A. Efros, W.T. Freeman, Image Quiting for texture synthesis and transfer, Proceedings of 28th Annua Conference on Computer Graphics and Interactive Techniques (200) [2] L. Joyeux, O. Buisson, B. Besserer, S. Boukir, Detection and Remova of Line Scratches in Motion Picture Fims, Proceedings of IEEE Internationa Conference on Computer Vision and Pattern Recognition, Fort Coins, Coorado (999) [3] L. Joyeux, Reconstruction de sequences d'images haute resoution. Appication a a restauration de fims cinematographiques, PhD Thesis, Universitè de La Rochee (2000). 22
23 [4] L. Joyeux, S. Boukir, B. Besserer, O. Buisson, Reconstruction of Degraded Image Sequences. Appication to Fim Restoration, Image and Vision Computing 9 (200) [5] L. Joyeux, S. Boukir, B. Besserer, Tracking and MAP reconstruction of ine scratches in degraded motion pictures, Machine Vision and Appications 3 (2002) [6] O. Kao, J. Engehausen, Scratch Remova in Digitised Fim Sequences, Proceedings of Internationa Conference on Imaging Science, Systems, and Technoogy, CSREA Press (2000) [7] A.C. Kokaram, R. Morris, W. Fitzgerad, P. Rayner, Detection/Interpoation of Missing Data in Image Sequences, IEEE Transactions on Image Processing 4 (995) [8] A.C. Kokaram, Motion Picture Restoration: Digita Agorithms for Artefacts Suppression in Archived Fim and Video, Springer-Verag (998). [9] A.C. Kokaram, A statistica framework for picture reconstruction using AR modes, Proceedings of European Conference of Computer Vision, Workshop on Statistica Methods for Time Varying Image Sequences (2002) [20] A.C. Kokaram, Parametric texture synthesis for fiing hoes in pictures, Proceedings of IEEE Internationa Conference in Image Processing (2002) [2] A. Machì, F. Coura, F. Nicotra, Detection of irreguar inear scratches in aged motion picture frames and restoration using adaptive masks, Proceedings of IASTED Internationa Conference on Image Processing (2002) [22] L. Maddaena, Efficient Methods for Scratch Remova in Image Sequences, Proceedings of th Internationa Conference on Image Anaysis and Processing, IEEE Computer Society (200) [23] S. Masnou, J.-M. More, Leve-ines based disoccusion, Proceedings of 5th IEEE Internationa Conference on Image Processing 3 (998) [24] R.D. Morris, Image Sequence Restoration Using Gibbs Distributions, PhD Thesis, University of Cambridge (995). [25] R.D. Morris, W.J. Fitzgerad, A.C. Kokaram, A samping based approach to ine scratch remova from motion picture frames, Proceedings of IEEE Internationa Conference on Image Processing (996) [26] L. Rosenthaer, A. Wittmann, A. Gunz, R. Gschwind, Restoration of Od Movie Fims by Digita Image Processing, Proceedings of IMAGÈCOM 96, Bordeaux, France (996) [27] T. Saito, T. Komatsu, T. Ohuchi, T. Seto, Image Processing for Restoration of Heaviy-Corrupted Od Fim Sequences, Proceedings of Internationa Conference on Pattern Recognition, Barceona, IEEE Computer Society (2000) [28] G. Sapiro, Image inpainting, SIAM News 35 (2002). [29] J. Shen, Inpainting and the fundamenta probem of image processing, SIAM News 36 (2003). 23
24 [30] D. Tegoo, F. Isgrò, A Genetic Agorithm for Scratch Remova in Static Images, Proceedings of Internationa Conference on Image Anaysis and Processing, IEEE Computer Society (200) [3] USC-SIPI Image Database, Eectrica Engineering Department, Signa & Image Processing Institute, University of Southern Caifornia, [32] J. Verdera, V. Casees, M. Bertamio, G. Sapiro, Inpainting surface hoes, Proceedings of IEEE Internationa Conference on Image Processing (2003), 4-7. [33] Z. Wang, L. Lu, A.C. Bovik, Video quaity assessment based on structura distortion measurement, Signa Processing: Image Communication 9 (2004)
Restoration of blue scratches in digital image sequences
Avaiabe onine at www.sciencedirect.com Image and Vision Computing 26 (2008) 1314 1326 www.esevier.com/ocate/imavis Restoration of bue scratches in digita image sequences Lucia Maddaena a, *, Afredo Petrosino
More informationFace Hallucination and Recognition
Face Haucination and Recognition Xiaogang Wang and Xiaoou Tang Department of Information Engineering, The Chinese University of Hong Kong {xgwang1, xtang}@ie.cuhk.edu.hk http://mmab.ie.cuhk.edu.hk Abstract.
More informationAustralian Bureau of Statistics Management of Business Providers
Purpose Austraian Bureau of Statistics Management of Business Providers 1 The principa objective of the Austraian Bureau of Statistics (ABS) in respect of business providers is to impose the owest oad
More informationSecure Network Coding with a Cost Criterion
Secure Network Coding with a Cost Criterion Jianong Tan, Murie Médard Laboratory for Information and Decision Systems Massachusetts Institute of Technoogy Cambridge, MA 0239, USA E-mai: {jianong, medard}@mit.edu
More informationTeamwork. Abstract. 2.1 Overview
2 Teamwork Abstract This chapter presents one of the basic eements of software projects teamwork. It addresses how to buid teams in a way that promotes team members accountabiity and responsibiity, and
More informationFRAME BASED TEXTURE CLASSIFICATION BY CONSIDERING VARIOUS SPATIAL NEIGHBORHOODS. Karl Skretting and John Håkon Husøy
FRAME BASED TEXTURE CLASSIFICATION BY CONSIDERING VARIOUS SPATIAL NEIGHBORHOODS Kar Skretting and John Håkon Husøy University of Stavanger, Department of Eectrica and Computer Engineering N-4036 Stavanger,
More informationDynamic Pricing Trade Market for Shared Resources in IIU Federated Cloud
Dynamic Pricing Trade Market or Shared Resources in IIU Federated Coud Tongrang Fan 1, Jian Liu 1, Feng Gao 1 1Schoo o Inormation Science and Technoogy, Shiiazhuang Tiedao University, Shiiazhuang, 543,
More informationA Similarity Search Scheme over Encrypted Cloud Images based on Secure Transformation
A Simiarity Search Scheme over Encrypted Coud Images based on Secure Transormation Zhihua Xia, Yi Zhu, Xingming Sun, and Jin Wang Jiangsu Engineering Center o Network Monitoring, Nanjing University o Inormation
More informationCOMPARISON OF DIFFUSION MODELS IN ASTRONOMICAL OBJECT LOCALIZATION
COMPARISON OF DIFFUSION MODELS IN ASTRONOMICAL OBJECT LOCALIZATION Františe Mojžíš Department of Computing and Contro Engineering, ICT Prague, Technicá, 8 Prague frantise.mojzis@vscht.cz Abstract This
More informationA New Statistical Approach to Network Anomaly Detection
A New Statistica Approach to Network Anomay Detection Christian Caegari, Sandrine Vaton 2, and Michee Pagano Dept of Information Engineering, University of Pisa, ITALY E-mai: {christiancaegari,mpagano}@ietunipiit
More information3.3 SOFTWARE RISK MANAGEMENT (SRM)
93 3.3 SOFTWARE RISK MANAGEMENT (SRM) Fig. 3.2 SRM is a process buit in five steps. The steps are: Identify Anayse Pan Track Resove The process is continuous in nature and handed dynamicay throughout ifecyce
More informationMulti-Robot Task Scheduling
Proc of IEEE Internationa Conference on Robotics and Automation, Karsruhe, Germany, 013 Muti-Robot Tas Scheduing Yu Zhang and Lynne E Parer Abstract The scheduing probem has been studied extensivey in
More informationCERTIFICATE COURSE ON CLIMATE CHANGE AND SUSTAINABILITY. Course Offered By: Indian Environmental Society
CERTIFICATE COURSE ON CLIMATE CHANGE AND SUSTAINABILITY Course Offered By: Indian Environmenta Society INTRODUCTION The Indian Environmenta Society (IES) a dynamic and fexibe organization with a goba vision
More informationBetting Strategies, Market Selection, and the Wisdom of Crowds
Betting Strategies, Market Seection, and the Wisdom of Crowds Wiemien Kets Northwestern University w-kets@keogg.northwestern.edu David M. Pennock Microsoft Research New York City dpennock@microsoft.com
More informationFast Robust Hashing. ) [7] will be re-mapped (and therefore discarded), due to the load-balancing property of hashing.
Fast Robust Hashing Manue Urueña, David Larrabeiti and Pabo Serrano Universidad Caros III de Madrid E-89 Leganés (Madrid), Spain Emai: {muruenya,darra,pabo}@it.uc3m.es Abstract As statefu fow-aware services
More informationLearning from evaluations Processes and instruments used by GIZ as a learning organisation and their contribution to interorganisational learning
Monitoring and Evauation Unit Learning from evauations Processes and instruments used by GIZ as a earning organisation and their contribution to interorganisationa earning Contents 1.3Learning from evauations
More informationEarly access to FAS payments for members in poor health
Financia Assistance Scheme Eary access to FAS payments for members in poor heath Pension Protection Fund Protecting Peope s Futures The Financia Assistance Scheme is administered by the Pension Protection
More information(12) Patent Application Publication (10) Pub. N0.: US 2006/0105797 A1 Marsan et al. (43) Pub. Date: May 18, 2006
(19) United States US 20060105797A (12) Patent Appication Pubication (10) Pub. N0.: US 2006/0105797 A1 Marsan et a. (43) Pub. Date: (54) METHOD AND APPARATUS FOR (52) US. C...... 455/522 ADJUSTING A MOBILE
More informationONE of the most challenging problems addressed by the
IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, VOL. 44, NO. 9, SEPTEMBER 2006 2587 A Mutieve Context-Based System for Cassification of Very High Spatia Resoution Images Lorenzo Bruzzone, Senior Member,
More informationNetwork/Communicational Vulnerability
Automated teer machines (ATMs) are a part of most of our ives. The major appea of these machines is convenience The ATM environment is changing and that change has serious ramifications for the security
More informationCONTRIBUTION OF INTERNAL AUDITING IN THE VALUE OF A NURSING UNIT WITHIN THREE YEARS
Dehi Business Review X Vo. 4, No. 2, Juy - December 2003 CONTRIBUTION OF INTERNAL AUDITING IN THE VALUE OF A NURSING UNIT WITHIN THREE YEARS John N.. Var arvatsouakis atsouakis DURING the present time,
More informationA Latent Variable Pairwise Classification Model of a Clustering Ensemble
A atent Variabe Pairwise Cassification Mode of a Custering Ensembe Vadimir Berikov Soboev Institute of mathematics, Novosibirsk State University, Russia berikov@math.nsc.ru http://www.math.nsc.ru Abstract.
More informationThe width of single glazing. The warmth of double glazing.
Therma Insuation CI/SfB (31) Ro5 (M5) September 2012 The width of singe gazing. The warmth of doube gazing. Pikington Spacia Revoutionary vacuum gazing. Image courtesy of Lumen Roofight Ltd. Pikington
More informationCreat-Poreen Power Electronics Co., Ltd
(STOCK CODE) 002350 Creat-Poreen Power Eectronics Co., Ltd Address: 4F, Xue Zhi Xuan Mansion, NO.16 Xue Qing Road, Hasidian District, Beijing, 100083 Te: +86 (010) 82755151 Fax: +86 (010) 82755268 Website:
More informationA Supplier Evaluation System for Automotive Industry According To Iso/Ts 16949 Requirements
A Suppier Evauation System for Automotive Industry According To Iso/Ts 16949 Requirements DILEK PINAR ÖZTOP 1, ASLI AKSOY 2,*, NURSEL ÖZTÜRK 2 1 HONDA TR Purchasing Department, 41480, Çayırova - Gebze,
More informationNordic Ecolabelling of Copy and printing paper - supplementary module
rdic Ecoabeing of Copy and printing paper - suppementary modue Version 4.1 22 June 2011 30 June 2016 rdic Ecoabeing Content What is rdic Ecoabeed copy and printing paper? 3 Why choose the rdic Ecoabe?
More informationPREFACE. Comptroller General of the United States. Page i
- I PREFACE T he (+nera Accounting Office (GAO) has ong beieved that the federa government urgenty needs to improve the financia information on which it bases many important decisions. To run our compex
More informationFinance 360 Problem Set #6 Solutions
Finance 360 Probem Set #6 Soutions 1) Suppose that you are the manager of an opera house. You have a constant margina cost of production equa to $50 (i.e. each additiona person in the theatre raises your
More informationWHITE PAPER UndERsTAndIng THE VAlUE of VIsUAl data discovery A guide To VIsUAlIzATIons
Understanding the Vaue of Visua Data Discovery A Guide to Visuaizations WHITE Tabe of Contents Executive Summary... 3 Chapter 1 - Datawatch Visuaizations... 4 Chapter 2 - Snapshot Visuaizations... 5 Bar
More informationGWPD 4 Measuring water levels by use of an electric tape
GWPD 4 Measuring water eves by use of an eectric tape VERSION: 2010.1 PURPOSE: To measure the depth to the water surface beow and-surface datum using the eectric tape method. Materias and Instruments 1.
More informationRisk Margin for a Non-Life Insurance Run-Off
Risk Margin for a Non-Life Insurance Run-Off Mario V. Wüthrich, Pau Embrechts, Andreas Tsanakas February 2, 2011 Abstract For sovency purposes insurance companies need to cacuate so-caed best-estimate
More informationLet s get usable! Usability studies for indexes. Susan C. Olason. Study plan
Let s get usabe! Usabiity studies for indexes Susan C. Oason The artice discusses a series of usabiity studies on indexes from a systems engineering and human factors perspective. The purpose of these
More informationVirtual trunk simulation
Virtua trunk simuation Samui Aato * Laboratory of Teecommunications Technoogy Hesinki University of Technoogy Sivia Giordano Laboratoire de Reseaux de Communication Ecoe Poytechnique Federae de Lausanne
More informationCLOUD service providers manage an enterprise-class
IEEE TRANSACTIONS ON XXXXXX, VOL X, NO X, XXXX 201X 1 Oruta: Privacy-Preserving Pubic Auditing for Shared Data in the Coud Boyang Wang, Baochun Li, Member, IEEE, and Hui Li, Member, IEEE Abstract With
More informationRisk Margin for a Non-Life Insurance Run-Off
Risk Margin for a Non-Life Insurance Run-Off Mario V. Wüthrich, Pau Embrechts, Andreas Tsanakas August 15, 2011 Abstract For sovency purposes insurance companies need to cacuate so-caed best-estimate reserves
More informationBooks on Reference and the Problem of Library Science
Practicing Reference... Learning from Library Science * Mary Whisner ** Ms. Whisner describes the method and some of the resuts reported in a recenty pubished book about the reference interview written
More informationREADING A CREDIT REPORT
Name Date CHAPTER 6 STUDENT ACTIVITY SHEET READING A CREDIT REPORT Review the sampe credit report. Then search for a sampe credit report onine, print it off, and answer the questions beow. This activity
More informationl l ll l l Exploding the Myths about DETC Accreditation A Primer for Students
Expoding the Myths about DETC Accreditation A Primer for Students Distance Education and Training Counci Expoding the Myths about DETC Accreditation: A Primer for Students Prospective distance education
More informationEnhanced continuous, real-time detection, alarming and analysis of partial discharge events
DMS PDMG-RH DMS PDMG-RH Partia discharge monitor for GIS Partia discharge monitor for GIS Enhanced continuous, rea-time detection, aarming and anaysis of partia discharge events Unrivaed PDM feature set
More informationAdvanced ColdFusion 4.0 Application Development - 3 - Server Clustering Using Bright Tiger
Advanced CodFusion 4.0 Appication Deveopment - CH 3 - Server Custering Using Bri.. Page 1 of 7 [Figures are not incuded in this sampe chapter] Advanced CodFusion 4.0 Appication Deveopment - 3 - Server
More informationDistribution of Income Sources of Recent Retirees: Findings From the New Beneficiary Survey
Distribution of Income Sources of Recent Retirees: Findings From the New Beneficiary Survey by Linda Drazga Maxfied and Virginia P. Rena* Using data from the New Beneficiary Survey, this artice examines
More informationDetection and Restoration of Vertical Non-linear Scratches in Digitized Film Sequences
Detection and Restoration of Vertical Non-linear Scratches in Digitized Film Sequences Byoung-moon You 1, Kyung-tack Jung 2, Sang-kook Kim 2, and Doo-sung Hwang 3 1 L&Y Vision Technologies, Inc., Daejeon,
More informationFixed income managers: evolution or revolution
Fixed income managers: evoution or revoution Traditiona approaches to managing fixed interest funds rey on benchmarks that may not represent optima risk and return outcomes. New techniques based on separate
More informationA Description of the California Partnership for Long-Term Care Prepared by the California Department of Health Care Services
2012 Before You Buy A Description of the Caifornia Partnership for Long-Term Care Prepared by the Caifornia Department of Heath Care Services Page 1 of 13 Ony ong-term care insurance poicies bearing any
More informationTERM INSURANCE CALCULATION ILLUSTRATED. This is the U.S. Social Security Life Table, based on year 2007.
This is the U.S. Socia Security Life Tabe, based on year 2007. This is avaiabe at http://www.ssa.gov/oact/stats/tabe4c6.htm. The ife eperiences of maes and femaes are different, and we usuay do separate
More informationSELECTING THE SUITABLE ERP SYSTEM: A FUZZY AHP APPROACH. Ufuk Cebeci
SELECTING THE SUITABLE ERP SYSTEM: A FUZZY AHP APPROACH Ufuk Cebeci Department of Industria Engineering, Istanbu Technica University, Macka, Istanbu, Turkey - ufuk_cebeci@yahoo.com Abstract An Enterprise
More informationChapter 1 Structural Mechanics
Chapter Structura echanics Introduction There are many different types of structures a around us. Each structure has a specific purpose or function. Some structures are simpe, whie others are compex; however
More informationTraffic classification-based spam filter
Traffic cassification-based spam fiter Ni Zhang 1,2, Yu Jiang 3, Binxing Fang 1, Xueqi Cheng 1, Li Guo 1 1 Software Division, Institute of Computing Technoogy, Chinese Academy of Sciences, 100080, Beijing,
More informationPrecise assessment of partial discharge in underground MV/HV power cables and terminations
QCM-C-PD-Survey Service Partia discharge monitoring for underground power cabes Precise assessment of partia discharge in underground MV/HV power cabes and terminations Highy accurate periodic PD survey
More informationBetting on the Real Line
Betting on the Rea Line Xi Gao 1, Yiing Chen 1,, and David M. Pennock 2 1 Harvard University, {xagao,yiing}@eecs.harvard.edu 2 Yahoo! Research, pennockd@yahoo-inc.com Abstract. We study the probem of designing
More informationIntroduction the pressure for efficiency the Estates opportunity
Heathy Savings? A study of the proportion of NHS Trusts with an in-house Buidings Repair and Maintenance workforce, and a discussion of eary experiences of Suppies efficiency initiatives Management Summary
More informationABSTRACT. Categories and Subject Descriptors. General Terms. Keywords 1. INTRODUCTION. Jun Yin, Ye Wang and David Hsu
Jun Yin, Ye Wang and David Hsu ABSTRACT Prompt feedback is essentia for beginning vioin earners; however, most amateur earners can ony meet with teachers and receive feedback once or twice a week. To hep
More informationNCH Software MoneyLine
NCH Software MoneyLine This user guide has been created for use with MoneyLine Version 2.xx NCH Software Technica Support If you have difficuties using MoneyLine pease read the appicabe topic before requesting
More informationNormalization of Database Tables. Functional Dependency. Examples of Functional Dependencies: So Now what is Normalization? Transitive Dependencies
ISM 602 Dr. Hamid Nemati Objectives The idea Dependencies Attributes and Design Understand concepts normaization (Higher-Leve Norma Forms) Learn how to normaize tabes Understand normaization and database
More informationGREEN: An Active Queue Management Algorithm for a Self Managed Internet
: An Active Queue Management Agorithm for a Sef Managed Internet Bartek Wydrowski and Moshe Zukerman ARC Specia Research Centre for Utra-Broadband Information Networks, EEE Department, The University of
More informationWith the arrival of Java 2 Micro Edition (J2ME) and its industry
Knowedge-based Autonomous Agents for Pervasive Computing Using AgentLight Fernando L. Koch and John-Jues C. Meyer Utrecht University Project AgentLight is a mutiagent system-buiding framework targeting
More informationSimultaneous Routing and Power Allocation in CDMA Wireless Data Networks
Simutaneous Routing and Power Aocation in CDMA Wireess Data Networks Mikae Johansson *,LinXiao and Stephen Boyd * Department of Signas, Sensors and Systems Roya Institute of Technoogy, SE 00 Stockhom,
More informationDOING BUSINESS WITH THE REGION OF PEEL A GUIDE FOR NEW AND CURRENT VENDORS
DOING BUSINESS WITH THE REGION OF PEEL A GUIDE FOR NEW AND CURRENT VENDORS TABLE OF CONTENTS INTRODUCTION... 1 GOVERNANCE... 1 COMMONLY PURCHASED GOODS AND SERVICES... 1 HOW TO REGISTER YOUR COMPANY...
More informationASYMPTOTIC DIRECTION FOR RANDOM WALKS IN RANDOM ENVIRONMENTS arxiv:math/0512388v2 [math.pr] 11 Dec 2007
ASYMPTOTIC DIRECTION FOR RANDOM WALKS IN RANDOM ENVIRONMENTS arxiv:math/0512388v2 [math.pr] 11 Dec 2007 FRANÇOIS SIMENHAUS Université Paris 7, Mathématiques, case 7012, 2, pace Jussieu, 75251 Paris, France
More informationVendor Performance Measurement Using Fuzzy Logic Controller
The Journa of Mathematics and Computer Science Avaiabe onine at http://www.tjmcs.com The Journa of Mathematics and Computer Science Vo.2 No.2 (2011) 311-318 Performance Measurement Using Fuzzy Logic Controer
More informationHow To Deiver Resuts
Message We sha make every effort to strengthen the community buiding programme which serves to foster among the peope of Hong Kong a sense of beonging and mutua care. We wi continue to impement the District
More informationArt of Java Web Development By Neal Ford 624 pages US$44.95 Manning Publications, 2004 ISBN: 1-932394-06-0
IEEE DISTRIBUTED SYSTEMS ONLINE 1541-4922 2005 Pubished by the IEEE Computer Society Vo. 6, No. 5; May 2005 Editor: Marcin Paprzycki, http://www.cs.okstate.edu/%7emarcin/ Book Reviews: Java Toos and Frameworks
More informationOligopoly in Insurance Markets
Oigopoy in Insurance Markets June 3, 2008 Abstract We consider an oigopoistic insurance market with individuas who differ in their degrees of accident probabiities. Insurers compete in coverage and premium.
More informationChapter 2 Traditional Software Development
Chapter 2 Traditiona Software Deveopment 2.1 History of Project Management Large projects from the past must aready have had some sort of project management, such the Pyramid of Giza or Pyramid of Cheops,
More informationInternational classification of financial reporting
3 Internationa cassification of financia reporting Christopher Nobes CONTENTS 3.1 Introduction 3.2 The nature of cassification 3.3 Cassifications by socia scientists 3.4 Cassifications in accounting 3.5
More informationThe guaranteed selection. For certainty in uncertain times
The guaranteed seection For certainty in uncertain times Making the right investment choice If you can t afford to take a ot of risk with your money it can be hard to find the right investment, especiay
More informationAutomatic Structure Discovery for Large Source Code
Automatic Structure Discovery for Large Source Code By Sarge Rogatch Master Thesis Universiteit van Amsterdam, Artificia Inteigence, 2010 Automatic Structure Discovery for Large Source Code Page 1 of 130
More informationAn Idiot s guide to Support vector machines (SVMs)
An Idiot s guide to Support vector machines (SVMs) R. Berwick, Viage Idiot SVMs: A New Generation of Learning Agorithms Pre 1980: Amost a earning methods earned inear decision surfaces. Linear earning
More informationIntegrating Risk into your Plant Lifecycle A next generation software architecture for risk based
Integrating Risk into your Pant Lifecyce A next generation software architecture for risk based operations Dr Nic Cavanagh 1, Dr Jeremy Linn 2 and Coin Hickey 3 1 Head of Safeti Product Management, DNV
More informationAN APPROACH TO THE STANDARDISATION OF ACCIDENT AND INJURY REGISTRATION SYSTEMS (STAIRS) IN EUROPE
AN APPROACH TO THE STANDARDSATON OF ACCDENT AND NJURY REGSTRATON SYSTEMS (STARS) N EUROPE R. Ross P. Thomas Vehice Safety Research Centre Loughborough University B. Sexton Transport Research Laboratory
More informationIntroduction to XSL. Max Froumentin - W3C
Introduction to XSL Max Froumentin - W3C Introduction to XSL XML Documents Stying XML Documents XSL Exampe I: Hamet Exampe II: Mixed Writing Modes Exampe III: database Other Exampes How do they do that?
More informationThis paper considers an inventory system with an assembly structure. In addition to uncertain customer
MANAGEMENT SCIENCE Vo. 51, No. 8, August 2005, pp. 1250 1265 issn 0025-1909 eissn 1526-5501 05 5108 1250 informs doi 10.1287/mnsc.1050.0394 2005 INFORMS Inventory Management for an Assemby System wh Product
More informationBreakeven analysis and short-term decision making
Chapter 20 Breakeven anaysis and short-term decision making REAL WORLD CASE This case study shows a typica situation in which management accounting can be hepfu. Read the case study now but ony attempt
More informationOn Capacity Scaling in Arbitrary Wireless Networks
On Capacity Scaing in Arbitrary Wireess Networks Urs Niesen, Piyush Gupta, and Devavrat Shah 1 Abstract arxiv:07112745v3 [csit] 3 Aug 2009 In recent work, Özgür, Lévêque, and Tse 2007) obtained a compete
More informationQualifications, professional development and probation
UCU Continuing Professiona Deveopment Quaifications, professiona deveopment and probation Initia training and further education teaching quaifications Since September 2007 a newy appointed FE ecturers,
More informationFast Image Acquisition in Pulse-Echo Ultrasound Imaging Using Compressed Sensing
Fast Image Acquisition in Puse-Echo Utrasound Imaging Using Compressed Sensing Martin F. Schiffner and Georg Schmitz Chair of Medica Engineering, Ruhr-Universität Bochum, D-4481 Bochum, Germany Copyright
More informationLeakage detection in water pipe networks using a Bayesian probabilistic framework
Probabiistic Engineering Mechanics 18 (2003) 315 327 www.esevier.com/ocate/probengmech Leakage detection in water pipe networks using a Bayesian probabiistic framework Z. Pouakis, D. Vaougeorgis, C. Papadimitriou*
More informationPassive Fire Protection
Acceptance Criteria for Damaged and Repaired Passive Fire Protection Diane Kerr 1,*, Deborah Wioughby 1, Simon Thurbeck 2 and Stephen Connoy 3 1 Heath and Safety Laboratory, Process Safety Section, UK
More informationNCH Software FlexiServer
NCH Software FexiServer This user guide has been created for use with FexiServer Version 1.xx NCH Software Technica Support If you have difficuties using FexiServer pease read the appicabe topic before
More informationBusiness schools are the academic setting where. The current crisis has highlighted the need to redefine the role of senior managers in organizations.
c r o s os r oi a d s REDISCOVERING THE ROLE OF BUSINESS SCHOOLS The current crisis has highighted the need to redefine the roe of senior managers in organizations. JORDI CANALS Professor and Dean, IESE
More informationMarket Design & Analysis for a P2P Backup System
Market Design & Anaysis for a P2P Backup System Sven Seuken Schoo of Engineering & Appied Sciences Harvard University, Cambridge, MA seuken@eecs.harvard.edu Denis Chares, Max Chickering, Sidd Puri Microsoft
More informationSTRUCTURING WAYFINDING TASKS WITH IMAGE SCHEMATA
STRUCTURING WAYFINDING TASKS WITH IMAGE SCHEMATA By Martin M. Rauba A THESIS Submitted in Partia Fufiment of the Requirements for the Degree of Master of Science (in Spatia Information Science and Engineering)
More information3.5 Pendulum period. 2009-02-10 19:40:05 UTC / rev 4d4a39156f1e. g = 4π2 l T 2. g = 4π2 x1 m 4 s 2 = π 2 m s 2. 3.5 Pendulum period 68
68 68 3.5 Penduum period 68 3.5 Penduum period Is it coincidence that g, in units of meters per second squared, is 9.8, very cose to 2 9.87? Their proximity suggests a connection. Indeed, they are connected
More informationComparison of Traditional and Open-Access Appointment Scheduling for Exponentially Distributed Service Time
Journa of Heathcare Engineering Vo. 6 No. 3 Page 34 376 34 Comparison of Traditiona and Open-Access Appointment Scheduing for Exponentiay Distributed Service Chongjun Yan, PhD; Jiafu Tang *, PhD; Bowen
More informationThe BBC s management of its Digital Media Initiative
The BBC s management of its Digita Media Initiative Report by the Comptroer and Auditor Genera presented to the BBC Trust s Finance and Compiance Committee, 13 January 2011 Department for Cuture, Media
More informationWHITE PAPER BEsT PRAcTIcEs: PusHIng ExcEl BEyond ITs limits WITH InfoRmATIon optimization
Best Practices: Pushing Exce Beyond Its Limits with Information Optimization WHITE Best Practices: Pushing Exce Beyond Its Limits with Information Optimization Executive Overview Microsoft Exce is the
More informationEducation sector: Working conditions and job quality
European Foundation for the Improvement of Living and Working Conditions sector: Working conditions and job quaity Work pays a significant roe in peope s ives, in the functioning of companies and in society
More informationNCH Software BroadCam Video Streaming Server
NCH Software BroadCam Video Streaming Server This user guide has been created for use with BroadCam Video Streaming Server Version 2.xx NCH Software Technica Support If you have difficuties using BroadCam
More informationIndustry guidance document Checkout workstations in retail - safe design and work practices
Industry guidance document Checkout workstations in retai - safe design and work practices Industry guidance document Checkout workstations in retai - safe design and work practices WorkSafe Contents Foreword...
More informationCorporate Governance f o r M a i n M a r k e t a n d a i M C o M p a n i e s
Corporate Governance f o r M a i n M a r k e t a n d a i M C o M p a n i e s 23. Corporate governance towards best-practice corporate reporting John Patterson, PricewaterhouseCoopers LLP Reporting is
More informationEFFICIENT CLUSTERING OF VERY LARGE DOCUMENT COLLECTIONS
Chapter 1 EFFICIENT CLUSTERING OF VERY LARGE DOCUMENT COLLECTIONS Inderjit S. Dhion, James Fan and Yuqiang Guan Abstract An invauabe portion of scientific data occurs naturay in text form. Given a arge
More informationAA Fixed Rate ISA Savings
AA Fixed Rate ISA Savings For the road ahead The Financia Services Authority is the independent financia services reguator. It requires us to give you this important information to hep you to decide whether
More informationResearch Report 04. Key implications. The impact of the Licensing Act 2003 on levels of crime and disorder: an evaluation
Research Report 04 Key impications The impact of the Licensing Act 2003 on eves of crime and disorder: an evauation Mike Hough, Giian Hunter, Jessica Jacobson, Stefano Cossater ICPR, King s Coege London
More informationOn target: ensuring geometric accuracy in radiotherapy
On target: ensuring geometric accuracy in radiotherapy The Roya Coege of Radioogists Institute of Physics and Engineering in Medicine Society and Coege of Radiographers Contents Foreword 6 Executive summary
More informationPricing Internet Services With Multiple Providers
Pricing Internet Services With Mutipe Providers Linhai He and Jean Warand Dept. of Eectrica Engineering and Computer Science University of Caifornia at Berkeey Berkeey, CA 94709 inhai, wr@eecs.berkeey.edu
More informationThe Comparison and Selection of Programming Languages for High Energy Physics Applications
The Comparison and Seection of Programming Languages for High Energy Physics Appications TN-91-6 June 1991 (TN) Bebo White Stanford Linear Acceerator Center P.O. Box 4349, Bin 97 Stanford, Caifornia 94309
More informationChapter 3: e-business Integration Patterns
Chapter 3: e-business Integration Patterns Page 1 of 9 Chapter 3: e-business Integration Patterns "Consistency is the ast refuge of the unimaginative." Oscar Wide In This Chapter What Are Integration Patterns?
More informationHigh-order balanced M-band multiwavelet packet transform-based remote sensing image denoising
Wang et a. EURASIP Journa on Advances in Signa Processing (2016) 2016:10 DOI 10.1186/s13634-015-0298-7 RESEARCH High-order baanced M-band mutiwaveet packet transform-based remote sensing image denoising
More informationOrder-to-Cash Processes
TMI170 ING info pat 2:Info pat.qxt 01/12/2008 09:25 Page 1 Section Two: Order-to-Cash Processes Gregory Cronie, Head Saes, Payments and Cash Management, ING O rder-to-cash and purchase-topay processes
More informationInsertion and deletion correcting DNA barcodes based on watermarks
Kracht and Schober BMC Bioinformatics (2015) 16:50 DOI 10.1186/s12859-015-0482-7 METHODOLOGY ARTICLE Open Access Insertion and deetion correcting DNA barcodes based on watermarks David Kracht * and Steffen
More information