Constrained Up-Scaling for Direct and Global Image Components

Size: px
Start display at page:

Download "Constrained Up-Scaling for Direct and Global Image Components"

Transcription

1 Constrained Up-Saling for Diret and Global Image Components Julian Bader Martin Pätzold Andreas Kolb Computer Graphis Group, Institute for Vision and Graphis, University of Siegen Hölderlinstraße 3, Siegen, Germany { julian.bader,martin.paetzold,andreas.kolb }@uni-siegen.de Abstrat The separation of diret and global illumination omponents is interesting for many appliations in Computer Graphis and Computer Vision, suh as BRDF estimation or material lassifiation. However, for full-resolution images, a large number of oded images have to be aquired. For many interative appliations, suh as the aquisition of dynami senes or video apturing, this is not feasible. In this paper, a new onstrained up-saling tehnique for separated diret and global illumination images is proposed whih requires two to three oded input images, only. Our approah imposes the boundary ondition that the sum of the diret and global omponents equals the fully illuminated image. We work in a preditive-orretive manner where we first use a single-image up-saling method in order to predit the higher resolution images. Afterwards, the missing higher frequenies are determined using a fully illuminated image. As the distribution of the higher frequenies differs among the various frequeny bands, we apply our approah in an iterative way for small up-saling steps distributing the missing information by minimizing the overall frequenies. We evaluate the up-saling sheme and demonstrate the improvement ompared to single-image approahed. As our method aims at minimizing the strutured light patterns needed for aquisition, we additionally disuss the performane of existing pattern sets in terms of appliability for dynami senes. Keywords Computational Photography, Image Proessing, Global Illumination 1 INTRODUCTION The separation of diret and indiret illumination in a sene is an interesting task for both, Computer Graphis and Computer Vision domains. The diret omponent helps obtaining the distribution of refleted light in a sene. This an be used to derive a model for the bidiretional refletion distribution funtion (BRDF) [GKGN11]. Also, 3D reonstrution methods are more robust when working only on the diret omponent [GKGN11, NG12]. The global omponent gives insight into the sattering behaviour between one or more objets in a sene. This is useful to ahieve more photorealisti renderings of a sene by observing the omplex light flow [MYR10]. Also, objet reognition benefits from suh approahes as the sattering of an objet highly depends on the material [GL12]. In 2006, Nayar et al. [NKGR06] presented an approah for separating the diret and global illumination using a strutured- Permission to make digital or hard opies of all or part of this work for personal or lassroom use is granted without fee provided that opies are not made or distributed for profit or ommerial advantage and that opies bear this notie and the full itation on the first page. To opy otherwise, or republish, to post on servers or to redistribute to lists, requires prior speifi permission and/or a fee. light approah. However, for a high resolution separation, a large number of strutured-light patterns is needed. Thus, this approah is not feasible for dynami senes, suh as apturing biometri information of human faes or mobile navigation, or for video apturing. In their work, an alternative method was proposed where only one strutured light pattern is suffiient. The disadvantage of this method is that the image resolution dereases dramatially. As a onsequene, small sale details of fine textured regions are lost. In this paper, we propose a new onstrained image upsaling tehnique for diret and global omponent images. We employ an iterative predition-orretion approah whih uses a single-image up-saling method in order to predit the higher resolution representation for eah omponent. These up-saled images are then orreted aording to a high resolution fully illuminated image whih has been additionally aquired. Fine strutures in images, suh as textiles or fur, an be reovered although they are not apparent in the low resolution input image. Our ontributions are the following: A general onstrained up-saling sheme for the transfer of high frequeny information. The appliation of the proposed sheme for diret and global omponent images. Volume 21, ISSN

2 An evaluation of various low-resolution separation approahes whih shows that the resulting image quality is not suffiient for the proposed up-saling sheme. To the best of our knowledge, we are the first proposing a onstrained up-saling approah for diret and global omponent images. The rest of the paper is strutured in the following way: Se. 2 gives an overview of existing single-image and multi-modal up-saling tehniques. In Se. 3, the priniples of the separation approah of [NKGR06] is reviewed and the impat of the different strutured light patterns is disussed. Our onstrained up-saling method is desribed in Se. 4. In Se. 5, the results are disussed. Furthermore, the improvement of our approah ompared to the single-image predition is shown. Finally, Se. 6 onludes the paper. 2 RELATED WORK In the past, the problem of image up-saling has been addressed many times during the past 20 years. Here, a brief overview of the major approahes is given whereas we distinguish between the single-image and multi-modal approahes. Single-image methods. The single-image up-saling methods an be divided in to four groups: regionbased interpolation, edge-direted interpolation, edgedireted reonstrution and example-based reonstrution. Region-based interpolation methods apply different interpolation algorithms depending on the region in the image. Thurnhofer and Mitra [TM96] proposed an image interpolation approah whih lassifies image pixels into three different regions (onstant, irregular and oriented). Other methods distinguish only between two regions (oriented, homogeneous) for different interpolation sheme appliation [ABA01, CHL05]. Zi et al. [ZDLL12] proposed a pereptual motivated segmentation of regions. For the general and transition regions, different kinds of interpolation algorithms are used. The attention region is omputed aording to an energy formulation optimizing urvature ontinuity, urvature enhanement and isolevel urve smoothing. Edge-direted interpolation shemes adjust the interpolation aording to the edges present in the image. Li and Orhard [LO01] use the loal ovariane for an edge-direted interpolation. Alternatively, sharp luminane variations and disontinuities are onsidered [BGS02]. Su and Willis [SW04] proposed a pixel triangulation sheme in order to use only pixels for interpolation not separated by an edge. Other methods propose the use of the seond order derivative in order to determine the interpolation diretion [GA08, GA11] and iterative refinement. Edge-direted reonstrution algorithms try to estimate a high-resolution edge image whih is then used to reonstrut the up-saled image. Tai et al. [TTT06] proposed to use tensor voting for high resolution edge reonstrution. In alternative approahes, edge statistis are learned in order to predit enhaned edge images [Fat07, SXS08, YXYC12]. Another kind of approah [YXXY12, WXM + 13] omputes sharp high resolution gradients diretly from the low resolution images. Example-based approahes try to build up a ditionary whih relate low resolution image pathes to missing higher frequenies [YWL + 12]. Freeman et al. propose a nearest neighbour searh in the training set to find the high frequenies for image pathes [FJP02]. Kim and Kwon [KK08] formulated the relationship between low and high frequenies as a linear regression model in order to derive a suitable image path. Alternatively, a single-hidden-layer feed-forward neural network is used for learning the relation between low and high images frequenies [AB12]. A variety of methods are based on self similarity [GADTH97, EV07, SSU08, GBI09, FF11]. Here, the assumption is that an image ontains similar strutures at different sale levels. Multi-modal methods. In [LLK08] and [STDT08], methods are proposed for the ombination of low resolution time-of-flight depths images with high resolution RGB images. However, instead of using the RGB information for a onstrained up-saling, both approahes first do a single-image up-saling of the depth image before fusing with RGB data. Langmann et al. [LHL11, LHL12] desribe a fusion approah of timeof-flight and RGB data where several ross bilateral filtering strategies are ompared. Additionally, a framework for joint segmentation and super-resolution is proposed. They assume the smooth hange of the depth field in homogeneous regions. Fine strutures, suh as in fur or textiles, an therefore not be reovered. Diret-Global Separation methods. In 2006, Nayar et al. [NKGR06] proposed a method for separating the diret and global image omponents using high-frequeny strutured-light patterns. Gu et al. [GKGN11] extended this approah in order to use multiple light soures. In 2012, two approahes were presented whih estimate the light transport in a sene [ORK12, RRC12]. Both are also apable of diret-global separation. However, O Toole et al. use a ompliated setup and long aquisition times. The method of Reddy et al. needs a high number of strutured-light patterns. As we fous on the aquisition of dynami senes, the latter approahes are not suitable. The aim of our approah is the reonstrution of small detail whih get lost during single-oded-image separation proess. As the above mentioned single-image up-saling methods an handle singularities, suh as Volume 21, ISSN

3 Here L + (i) refers to the intensity value of a sene element at position i = (x,y) T whih is diretly illuminated, whereas L (i) represent the intensity when the element is not diretly illuminated. L d and L g refer to the diret and global part of the illumination and α is the fration of projetor soure elements whih are lit. Sine digital projetors annot be tuned ompletely dark, b aounts for the fration of a white soure element emitted by a "blak" projeted pixel with 0 b 1. For a more detailed desription of the separation method, the reader is referred to the paper of Nayar et al. [NKGR06]. Figure 1: Light an reah the amera in different ways. Light being diretly refleted to the amera is alled diret illumination. Global illumination denotes light that is sattered in the sene and travels an indiret path to the amera. edges or joints, quite well, fine homogeneous strutures, suh as fur or threads in textiles, annot be reonstruted. Due to the smoothness assumption of depth data, the multi-modal super-resolution methods for fusion of time-of-flight data also annot over these kind of fine details. In ontrast, our proposed method uses a single-image up-saling predition for the diret and global omponent images and enfores the sum of these two to be equal to a fully illuminated image. 3 SEPARATION OF DIRECT AND GLOBAL ILLUMINATION The illumination in a sene an be deomposed into two parts. The first part is the so alled diret illumination. This overs all the light whih is emitted by a light soure and is refleted diretly to the sene observer (usually a amera or the human eye). The seond part addresses all the light whih is first sattered or otherwise redireted and reahes the observer in an indiret path. This is onsidered as global illumination (f. Fig. 1). 3.1 Separation Sheme In 2006, Nayar et. al [NKGR06] proposed a method to separate the diret and global illumination in a sene using strutured light. Here, the underlying assumption is that the sattering of light, whih is responsible for the global illumination effets, ats as a kind of low-pass filter, i.e. there are no high frequenies present in the global omponent. Thus, by projeting different high frequeny patterns onto the sene, the following relations an be formulated depending on whether a part of the sene is hit by a light or dark soure element: L + (i) = L d (i) + αl g (i) + b(1 α)l g (i), (1) L (i) = bl d (i) + (1 α)l g (i) + αbl g (i). (2) 3.2 Strutured-Light Patterns Nayar et al. [NKGR06] proposed several highfrequeny strutured-light patterns in order to aquire L + (i) and L (i) for a sene. Cheker-board. The sene is illuminated by a sequene of shifted heker-board patterns. For eah pixel in a sene the brightest and the darkest intensity value among all the aquisitions is hosen. With this kind of patterns, one an ompute the diret and global omponent diretly at the amera s resolution. However, due to the aquisition of multiple soure images, this method is not feasible for the fast aquisition of senes. Phase shifted sinusoidal. Eah pixel of the pattern an be expressed as p 0 = 0.5(1 + sinφ) for φ [0,2π]. Analogue to the first pattern, two more are generated where φ is phase shifted by 2π 3 and 4π 3. In general, the pixels of the first pattern an be hosen arbitrarily, but in order to ensure high frequeny, a sinusoidal funtion whih varies in both, x- and y-diretion, should be hosen. Using these patterns, only three aquisitions are neessary. However, Gu et al. [GKGN11]stated that this method suffers from serious image artefats. Therefore, it is not suitable if the apturing of fine details is required. Stripes. By using a horizontal or vertial stripe pattern, only one aquisition is neessary. Here, the brightest and darkest pixels are determined in small retangular pathes whih are aligned perpendiular to the stripes. These extrema are interpolated and averaged in order to generate the minimum L + (i) and maximum L (i). Then, the diret and global omponents are omputed. As only one pattern needs to be aquired, this method is suitable for apturing dynami senes. However, due to the averaging proess, the resolution of the resulting images is dereased by a fration of four [NKGR06]. 4 A CONSTRAINED UP-SCALING METHOD The aim of our approah is the onstrained up-saling of diret and loal omponent images aording to one Volume 21, ISSN

4 Figure 2: Overview of the omplete system. The left side (green) shows the separation of global and diret omponents aording to [NKGR06]. The right side (blue) desribes our onstrained up-saling tehnique. high-resolution fully illuminated image whereas we fous on the reonstrution on fine strutures in homogeneous regions. Before the details are disussed in the following two setions, a rough system overview is given. As input images, we take the two low resolution global and diret omponent images retrieved by the stripe pattern separation approah proposed by Nayar et al. [NKGR06]. Additionally we use a high resolution image whih is aquired with full illumination. The proposed up-saling sheme onsists of two steps whih are applied iteratively until we reah the target resolution (f. Fig. 2): 1. In the predition step, we estimate the higher resolution image using a single-image up-saling tehnique. The first iteration takes the low-resolution diret and global omponent images as input. For all following iterations, the orreted images from the previous iteration are used. 2. The orretion step orrets the predited images aording to the main ondition that the sum of diret and global images results in the fully illuminated image. In order to derease the noise level in the up-saled image, the error to the full image is distributed in suh a way that the overall intensity of higher frequenies is minimized. 4.1 Predition In general, there are no limitations regarding the predition step in our up-saling sheme. As the orretion works on the predited image diretly, every singleimage up-saling method ould be used. In our experiments, we used the so-alled Loal Self-Examples approah proposed by Freedman and Fattal [FF11]. This method has two advantages. On the one hand, it an predit the objet boundaries quite well. This improves the performane of the orretion step, as there are lower intensity errors. On the other hand, the approah inreases the resolution of the input images iteratively by nondyadi sales (eg. 5:4 or 3:2). Therefore, in eah iteration only a small higher frequeny band is added to the image, leading to a more robust orretion in terms of frequeny distribution. 4.2 Corretion After the predition step, the image is orreted aording to the onstraint L f (i) = L p d (i) + Lp g(i) (3) where L f (i) is the pixel at position i under full illumination. L p d (i) and Lp g(i) orrespond to the (unonstrained) predited diret and global pixels respetively. Taking the differene of the sum of the diret and global images and the fully illuminated image D(i) = L f (i) (L p d (i) + Lp g(i)), (4) we get the error introdued by the predition step. Please note that, similar to the Differene of Gaussians, D(i) only ontains the missing higher frequenies whih ould not be reovered by the single-image up-saling approah. In order to orret the predited images, we distribute the error via two funtions f d (i,l p d,d), f g(i,l p g,d) so that D i = ( f d (i,l p d,d) + Lp d (i)) + ( f g(i,l p g,d) + L p g(i)) (5) holds. These funtions should be designed in suh a way that they selet these higher frequenies whih are missing in the orresponding predited image. If we now assume f d and f g to be linear with respet to D, we express our orreted images as follows L d (i) = Lp d (i) + α d(i) D(i), (6) L g(i) = L p g(i) + α g (i) D(i) (7) where L d and L g are the orreted diret and global omponent images, respetively. Here, α d, α g represent the weights of distributing the predition error D Volume 21, ISSN

5 Journal of WSCG Sene 1 orr. unorr RMSE (d) RMSE (g) `1 -Norm (d) `1 -Norm (g) `2 -Norm (d) `2 -Norm (g) Sene 2 orr. unorr Sene 3 orr. unorr Sene 4 orr. unorr Sene 5 orr. unorr Table 1: Comparison of five test senes with different error metris (root mean square error (RMSE), `1 - and `2 norm): Low resolution images with separated diret(d) and global(g) illumination were saled up by a fator of 2 with the approah of [FF11]. The values of the orreted image an be ompared with the unorreted image for eah sene. a single-lens reflex amera (Nikon D300) was used. Strutured-Light patterns are projeted into the sene that is imaged by the amera. The diret and global illumination for the given sene are separated by the approah of Nayar et al. [NKGR06]. In order to get a reliable ground truth, 25 shifted heker-board patterns were used. to both images on a per-pixel level. Now, we need a ondition how to set the α-values. As the wrong distribution tends to inrease the noise level, a reasonable ondition is to hoose the weights in suh a way that the present high frequenies are minimized. Thus, we an formulate a minimization problem where the sum of the squared Laplaian ( ) of both images is minimized on a per-pixel level: 2 2 (αd (i), αd (i)) = arg min {( Ld ) + ( Lg ) }. αd,αg In Se. 5.1, we evaluate our up-saling sheme. Therefore, we sampled down the ground truth and used these low-resolution images as input. Five test senes were reated for evaluating the influenes of different sene properties, the impat of our orretion for several preditors and the influene of the up-saling fator. Se. 5.2 shows how our up-saling sheme performs on low-resolution diret and global omponent images produed diretly using different strutured-light patterns. We foussed on patterns whih require up to three aquisitions, only. (8) Furthermore, we satisfy the onstrains 0 αd, αg 1 and αd + αg = 1 in order to eliminate the predition error D. Solving for αf = 0 and αfg = 0 with F = d ( Ld )2 + ( Lg )2 yields αd (i) = Ldp (i) Lgp (i), αg (i) =. D(i) D(i) (9) The onstraints an easily be satisfied by normalizing eah αd, αg with the sum αd + αg. Thus, the resulting orretion terms for diret and global omponent images an be expressed as Ld (i) = Ld (i) = Ldp (i) p Ld (i) + Lgp (i) Lgp (i) Ldp (i) + Lgp (i) D(i) + Ldp (i), (10) D(i) + Lgp (i). (11) 5.1 Tab. 1 shows different error values for the test senes and the separated illumination. The error of the orreted image an be ompared with the error of the unorreted image for eah test ase. The error values in sene 1 look similar while the error values in sene 3 are redued by half. Depending on the properties of the sene, the error varies. It is observable that a more detailed sene an be orreted better than a sene with large homogeneous areas. The diret and global omponent images Ld, Lg are then given as input for the predition step of the next iteration until the target resolution is reahed. 5 Influene of the Sene Properties RESULTS In the Figs. 3, 4 and 5, we show the influene of different kinds of luttered regions on our up-saling sheme. We used the approah of Freedman and Fattal [FF11] as the preditor and ompare the predited image with In order to evaluate our up-saling sheme and the lowresolution separation methods, a measurement setup onsisting of a projetor (Panasoni PT-LC76E) and Volume 21, 2013 Evaluation of the Up-Saling Sheme 73 ISSN

6 (a) Ground Truth (b) Predition () Corretion (a) Ground Truth (b) Predition () Corretion (d) Zoom out (e) RMSE (f) RMSE Figure 3: Diret omponent of a stuffed toy in front of a homogeneous bakground. The high frequenies of the fur are orreted more than the low frequenies of the bakground. the results of the proposed orretion sheme. Fig. 3 shows a lose-up of a stuffed toy in front of a homogeneous bakground. As an be seen, our sheme reprodues the fine fur struture more detailed while in the predited image this region looks smeared out. The homogeneous bakground is reprodued well with both methods. In Fig. 4, two piees of halk wrapped in paper in front of a printed box are shown. Here, in ontrast to the stuffed toy, the fine details are not due to fine 3- dimensional strutures. The letters on the box and the printed patterns of the paper wrapping the halk are reonstruted in more detail with our orretion. Fig. 5 shows small wooden figures with small sale painting and thin ornamentations. The edges an be reprodued more preisely with the orretion sheme ompared to the predition. These three examples show that the quality of the orretion is independent of the sene objets. Only the frequenies in the resulting image of the sene objets are responsible for the impat of the improvement. Fine strutures, i.e. high frequenies, in the image lead to a large improvement in quality while areas with low frequenies annot be orreted muh more. Improvement of the Corretion The up-saling of the five exemplary senes was done with three different methods to evaluate the influene of the predition to the orretion. Nearest neighbour interpolation, biubi interpolation and loal selfexamples from [FF11] were used as preditors for the up-saling sheme. Fig. 6 shows a omparison between the RMSE for the different predition methods and the afterwards orreted images. It an be seen that the orretion always improves the predited image, but depending on the quality of the predition the orretion (d) Zoom out (e) RMSE (f) RMSE Figure 4: Global omponent of two piees of halk wrapped in paper in front of a printed box. Independent of the 3D objet struture, the high frequenies are orreted muh better. (a) Ground Truth (b) Predition () Corretion (d) Zoom out (e) RMSE (f) RMSE Figure 5: Diret omponent of small wooden figures in front of a printed box. The orretion between different objets is orreted very good. High frequenies are orreted independently of the objets. annot ompensate the larger error. For example, the orretion of the nearest neighbour interpolation, whih has the largest error in all senes, improves the error but still has a larger absolute error than a better predition without a orretion for the global illumination in sene 3 and 5. An additional onlusion is that our proposed orretion improves prospetive preditions that will have less errors. Please note that the loal self-examples approah produes a higher predition error than biubi interpolation for senes 2 to 5. In ontrast to sene 1, these senes ontain luttered regions. As stated by Freedman and Fattal, their approah is not able of handling these kind of image region and the algorithm spuriously reonstruts edges there [FF11]. This behaviour auses larger error than biubi interpolation with its smoothing ability. Volume 21, ISSN

7 a b S. 1 a b b a a b Diret Illumination a b a orreted predition unorreted predition S. 2 S. 3 S. 4 S. 5 S. 1 S. 2 S. 3 S. 4 S. 5 b a b b a a b Global Illumination Figure 6: The sorted RMSE for (a) biubi interpolation, (b) Loal Self-Examples [FF11] and () nearest neighbour interpolation as preditors shows that the quality of the predition influenes the quality of the orretion. The orretion improves the quality of the predition for diret and global illumination in all five senes. a b x 3x 2x 4x 3x 2x 4x 3x 2x 4x 3x 2x error differene orretion error 4x 3x 2x Sene 1 Sene 2 Sene 3 Sene 4 Sene 5 Figure 7: The dependeny of the up-saling fators is shown. For eah sene the fators 4x, 3x, 2x are ompared (left to right bar). A higher saling fator leads to a higher error differene between predition and orretion. The global illumination images of the five test senes are upsaled using [FF11]. Influene of the Up-Saling Fator The up-saling fator is another parameter of influene. Fig. 7 ompares the RMSE for the saling fators of 4x, 3x and 2x from left to right for eah global illumination image of the five senes. The single-image up-saling method of [FF11] is used as preditor for this omparison. The absolute error introdued by the predition is higher for larger saling. But, it an be seen that the improvement of the reonstrution error by our orretion sheme gets better for higher saling fators in all senes. As our algorithm works in an iterative manner, for higher up-saling fators, more refinement steps are done. As in eah step the predited image is orreted we are able to better guide the up-saling proess. 5.2 Evaluation of Patterns We used different strutured-light patterns for the separation of the illumination omponent in order to evaluate their appliability regarding our up-saling sheme. As the fous is on low aquisition time, only patterns were hosen where up to three aquisition (inluding the fully illuminated image) are needed. Thus, we tested vertial stripes, horizontal stripes, a ombination of both stripe patterns and a high-frequeny hekerboard pattern where eah square had the same dimensions as the width of the stripes. The single-image separation approah proposed by Nayar et al. [NKGR06] was used in order to determine the low-resolution diret and global image omponents (f. left part of Fig. 2). As for the stripes patterns a blurring of edges within the diretion of the stripes our, we ombined the separation results of both patterns in order to ompensate for this effet. However, for this proedure an additional aquisition is required. Therefore, we introdued the high-frequeny heker-board pattern. Here, the same separation methods were applied as for horizontal Volume 21, ISSN

8 Journal of WSCG (a) Global Cheker Board (ground truth) (b) Global Stripes (up-saled) () Global Stripes (low resolution) Figure 8: Comparison of the separation methods using heker-board (a) and stripes strutured-light patterns (b). As an be seen, the stripes separation () suffers severe artefats. Our up-saling sheme is not apable of properly reonstruting the high-resolution images. vert. hor. omb. vert. hor. omb. down-sampled stripes stripes stripes heker heker heker ground truth RMSE (LSE) `1 -Norm (LSE) `2 -Norm (LSE) RMSE (BC) `1 -Norm (BC) `2 -Norm (BC) Table 2: Different kind of patterns were used for a fast separation. The resulting images were fed into our upsaling sheme with loal self-examples (LSE) and biubi interpolation (BC) as preditor. 6 and vertial stripes. In order to improve blurring artefats, the separation results were ombined, also. Tab. 2 shows the reonstrution error of our up-saling sheme for eah of these separation methods ompared to the down-sample ground truth. As preditors we used biubi interpolation and loal self-examples [FF11]. Our experiments show that the reonstrution results differ depending on whether the down-sampled ground truth or the low-resolution images resulting from the stripes or heker-board patterns are used. As an be seen in Fig. 8, the stripes-pattern separation suffers severe reonstrution artefats. Besides the wrong olor reprodution in homogeneous regions, at diagonal edges stair-ase artefats are present. Furthermore, luttered regions are subjeted to noise. Although our up-saling sheme is apable of reduing the artefats in brighter image regions, it annot reover the fine details. In general, the up-saling error for the stripes patterns is smaller as for the heker-board. The hoie of the preditor does not influene the up-saling result signifiantly. Also, the ombination of horizontal and vertial stripes ould not improve the quality of the input images. By monitoring the weights for the predition error distribution αd, αg, we realized that they were lose to 0.5 for all pixels of the diret and global images. This is no surprise, as the noise in both images annot be redued signifiantly by distributing the predition error. Volume 21, 2013 CONCLUSIONS We presented a new onstrained up-saling approah for diret an global omponent images. Preditions based on single-image up-saling tehniques are orreted using a high resolution fully illuminated image. It an be seen that our method an visually improve luttered regions of an image suh as fur or fine strutured ornamentations. The experiments showed that our algorithm sales with the quality of the predition as even well predited images an be improved further. The iterative manner of the method is also apable of improving single-image up-saling approahes for large up-saling fators. Our method is appliable when the aquisition full resolution images using many strutured-light patterns is not possible due to limited time-onstraints. This is the ase for apturing dynami senes in Computer Vision tasks, suh as biometry of human faes or mobile autonomous navigation. Here, only two images are required. However, by aquiring more than one image our method is prone to motion artefats and misalignment of the two images. Thus, it might be neessary to apply optial flow or motion ompensation. Also, our up-saling sheme poses additional omputational omplexity whih might not be suitable for real-time analysis of the aquired data. 76 ISSN

9 Furthermore, when using strutured-light patterns or variations known in literature for fast aquisition, the quality of the resulting low-resolution images is not suffiient. Obviously, these separation methods are strongly influened by wrong olor reprodution and stair-ase artefats. Thus, these kind of patterns produe fundamentally different diret and global omponent images than methods whih work diretly at the resolution of the aquired images. In future work, we study the impat of different light patterns on the separation results. This will give us useful insight about how to solve the above mentioned disrepanies between low-resolution images and groundtruth data. 7 ACKNOWLEDGMENTS This work was funded by the German Researh Foundation (DFG) as part of the researh training group GRK 1564 Imaging New Modalities. 8 REFERENCES [AB12] L. An and B. Bhanu. Image superresolution by extreme learning mahine. In Pro. IEEE Int. Conf. Image Proessing (ICIP), pages , [ABA01] C. Atkins, C. Bouman, and J. Allebah. Optimal image saling using pixel lassifiation. In Pro. Int. Conf. Image Proessing, volume 3, pages , [BGS02] S. Battiato, G. Gallo, and F. Stano. A loally adaptive zooming algorithm for digital images. Image and Vision Computing, 20(11): , [CHL05] M.-J. Chen, C.-H. Huang, and W.-L. Lee. A fast edge-oriented algorithm for image interpolation. Image and Vision Computing, 23(9): , [EV07] M. Ebrahimi and E. Vrsay. Solving the inverse problem of image zooming using self-examples. In M. Kamel and A. Campilho, editors, Image Analysis and Reognition, volume 4633 of Leture Notes in Computer Siene, pages Springer Berlin Heidelberg, [Fat07] R. Fattal. Image upsampling via imposed edge statistis. ACM Trans. Graph., 26(3), [FF11] G. Freedman and R. Fattal. Image and video upsaling from loal self-examples. ACM Trans. Graph., 30(2):12:1 12:11, [FJP02] W. Freeman, T. Jones, and E. Pasztor. Example-based super-resolution. IEEE Computer Graphis and Appliations, 22(2):56 65, [GA08] A. Giahetti and N. Asuni. Fast artifat free image interpolation. In Pro. BMVC 2008, [GA11] A. Giahetti and N. Asuni. Real-time artifat-free image upsaling. IEEE Trans. Image Proessing, 20(10): , [GADTH97] M. Gharavi-Alkhansari, R. DeNardo, Y. Tenda, and T. S. Huang. Resolution enhanement of images using fratal oding. Pro. SPIE 3024, Visual Communiations and Image Proessing, 3024: , [GBI09] D. Glasner, S. Bagon, and M. Irani. Super-resolution from a single image. In Pro. IEEE Int. Conf. Computer Vision, pages , [GKGN11] J. Gu, T. Kobayashi, M. Gupta, and S. K. Nayar. Multiplexed illumination for sene reovery in the presene of global illumination. In Pro. IEEE Int. Conf. Computer Vision (ICCV), pages 1 8, [GL12] J. Gu and C. Liu. Disriminative illumination: Per-pixel lassifiation of raw materials based on optimal projetions of spetral brdf. In Pro. IEEE Conf. Computer Vision and Pattern Reognition (CVPR), pages , [KK08] K. Kim and Y. Kwon. Examplebased learning for single-image superresolution. In G. Rigoll, editor, Pattern Reognition, volume 5096 of Leture Notes in Computer Siene, pages Springer Berlin Heidelberg, [LHL11] B. Langmann, K. Hartmann, and O. Lof- [LHL12] [LLK08] feld. Comparison of depth superresolution methods for 2d/3d images. Int. Journal of Computer Information Systems and Industrial Management Appliations, 3: , B. Langmann, K. Hartmann, and O. Loffeld. A modular framework for 2d/3d and multi-modal segmentation with joint super-resolution. In A. Fusiello, V. Murino, and R. Cuhiara, editors, Computer Vision - ECCV Workshops and Demonstrations, volume 7584 of Leture Notes in Computer Siene, pages Springer Berlin Heidelberg, M. Lindner, M. Lambers, and A. Kolb. Volume 21, ISSN

10 Data fusion and edge-enhaned distane refinement for 2d rgb and 3d range images. Int. J. on Intell. Systems and Tehn. and App. (IJISTA), Issue on Dynami 3D Imaging, 5(1): , [LO01] X. Li and M. Orhard. New edgedireted interpolation. IEEE Trans. Image Proessing, 10(10): , [MYR10] Y. Mukaigawa, Y. Yagi, and R. Raskar. Analysis of light transport in sattering media. In Pro. IEEE Conf. Computer Vision and Pattern Reognition (CVPR), pages , [NG12] S. K. Nayar and M. Gupta. Diffuse strutured light. In Pro. IEEE Int. Conf. Computational Photography, pages 1 8, [NKGR06] S. K. Nayar, G. Krishnan, M. D. Grossberg, and R. Raskar. Fast separation of diret and global omponents of a sene using high frequeny illumination. ACM Trans. Graph., 25(3): , [ORK12] M. O Toole, R. Raskar, and K. N. Kutulakos. Primal-dual oding to probe light transport. ACM Trans. Graph., 31:39:1 39:11, [RRC12] D. Reddy, R. Ramamoorthi, and B. Curless. Frequeny-spae deomposition and aquisition of light transport under spatially varying illumination. In Computer Vision - ECCV Springer Berlin Heidelberg, [SSU08] N. Suetake, M. Sakano, and E. Uhino. Image super-resolution based on loal self-similarity. Optial Review, 15:26 30, [STDT08] S. Shuon, C. Theobalt, J. Davis, and S. Thrun. High-quality sanning using time-of-flight depth superresolution. In Pro. IEEE Conf. on Comp. Vis. & Patt. Reogn.; Workshops (CVPRW), pages 1 7, [SW04] D. Su and P. Willis. Image interpolation by pixel-level data-dependent triangulation. Computer Graphis Forum, 23(2): , [SXS08] J. Sun, Z. Xu, and H.-Y. Shum. Image super-resolution using gradient profile prior. In Pro. IEEE Conf. Computer Vision and Pattern Reognition (CVPR), pages 1 8, [TM96] S. Thurnhofer and S. K. Mitra. Edgeenhaned image zooming. Optial Engi- [TTT06] [WXM + 13] [YWL + 12] [YXXY12] [YXYC12] [ZDLL12] neering, 35(7): , Y.-W. Tai, W.-S. Tong, and C.-K. Tang. Pereptually-inspired and edge-direted olor image super-resolution. In Pro. IEEE Conf. Computer Vision and Pattern Reognition (CVPR), volume 2, pages , L. Wang, S. Xiang, G. Meng, H.-y. Wu, and C. Pan. Edge-direted single image super-resolution via adaptive gradient magnitude self-interpolation. IEEE Trans. Ciruits and Systems for Video Tehnology, PP(99):1, J. Yang, Z. Wang, Z. Lin, S. Cohen, and T. Huang. Coupled ditionary training for image super-resolution. IEEE Trans. Image Proessing, 21(8): , L. Yu, H. Xu, Y. Xu, and X. Yang. Robust single image super-resolution based on gradient enhanement. In Pro. Signal Information Proessing Assoiation Annual Summit and Conferene (APSIPA ASC), pages 1 6, Q. Yan, Y. Xu, X. Yang, and K. Chen. Image super-resolution based on a novel edge sharpness prior. In Pro. Int. Conf. Pattern Reognition (ICPR), pages , L. Zi, J. Du, M. Liang, and J. Lee. A pereption-motivated image interpolation algorithm. In Pro. World Congress on Intelligent Control and Automation (WCICA), pages , Volume 21, ISSN

Performance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application

Performance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application World Aademy of Siene, Engineering and Tehnology 8 009 Performane of Histogram-Based Skin Colour Segmentation for Arms Detetion in Human Motion Analysis Appliation Rosalyn R. Porle, Ali Chekima, Farrah

More information

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and

More information

A radiometric analysis of projected sinusoidal illumination for opaque surfaces

A radiometric analysis of projected sinusoidal illumination for opaque surfaces University of Virginia tehnial report CS-21-7 aompanying A Coaxial Optial Sanner for Synhronous Aquisition of 3D Geometry and Surfae Refletane A radiometri analysis of projeted sinusoidal illumination

More information

NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman

NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION Ken Sauer and Charles A. Bouman Department of Eletrial Engineering, University of Notre Dame Notre Dame, IN 46556, (219) 631-6999 Shool of

More information

A {k, n}-secret Sharing Scheme for Color Images

A {k, n}-secret Sharing Scheme for Color Images A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University

More information

Graph-Based vs Depth-Based Data Representation for Multiview Images

Graph-Based vs Depth-Based Data Representation for Multiview Images Graph-Based vs Depth-Based Data Representation for Multiview Images Thomas Maugey, Antonio Ortega, Pasal Frossard Signal Proessing Laboratory (LTS), Eole Polytehnique Fédérale de Lausanne (EPFL) Email:

More information

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. Improvement of low illumination image enhancement algorithm based on physical mode

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. Improvement of low illumination image enhancement algorithm based on physical mode [Type text] [Type text] [Type text] ISSN : 0974-7435 Volume 10 Issue 22 BioTehnology 2014 An Indian Journal FULL PAPER BTAIJ, 10(22), 2014 [13995-14001] Improvement of low illumination image enhanement

More information

Extracting Partition Statistics from Semistructured Data

Extracting Partition Statistics from Semistructured Data Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk

More information

A Novel Validity Index for Determination of the Optimal Number of Clusters

A Novel Validity Index for Determination of the Optimal Number of Clusters IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers

More information

Comparing Images Under Variable Illumination

Comparing Images Under Variable Illumination ( This paper appeared in CVPR 8. IEEE ) Comparing Images Under Variable Illumination David W. Jaobs Peter N. Belhumeur Ronen Basri NEC Researh Institute Center for Computational Vision and Control The

More information

Drawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0;

Drawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0; Naïve line drawing algorithm // Connet to grid points(x0,y0) and // (x1,y1) by a line. void drawline(int x0, int y0, int x1, int y1) { int x; double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx;

More information

Detection and Recognition of Non-Occluded Objects using Signature Map

Detection and Recognition of Non-Occluded Objects using Signature Map 6th WSEAS International Conferene on CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Cairo, Egypt, De 9-31, 007 65 Detetion and Reognition of Non-Oluded Objets using Signature Map Sangbum Park,

More information

Introduction to Seismology Spring 2008

Introduction to Seismology Spring 2008 MIT OpenCourseWare http://ow.mit.edu 1.510 Introdution to Seismology Spring 008 For information about iting these materials or our Terms of Use, visit: http://ow.mit.edu/terms. 1.510 Leture Notes 3.3.007

More information

特集 Road Border Recognition Using FIR Images and LIDAR Signal Processing

特集 Road Border Recognition Using FIR Images and LIDAR Signal Processing デンソーテクニカルレビュー Vol. 15 2010 特集 Road Border Reognition Using FIR Images and LIDAR Signal Proessing 高木聖和 バーゼル ファルディ Kiyokazu TAKAGI Basel Fardi ヘンドリック ヴァイゲル Hendrik Weigel ゲルド ヴァニーリック Gerd Wanielik This paper

More information

Cluster-Based Cumulative Ensembles

Cluster-Based Cumulative Ensembles Cluster-Based Cumulative Ensembles Hanan G. Ayad and Mohamed S. Kamel Pattern Analysis and Mahine Intelligene Lab, Eletrial and Computer Engineering, University of Waterloo, Waterloo, Ontario N2L 3G1,

More information

ASSESSMENT OF TWO CHEAP CLOSE-RANGE FEATURE EXTRACTION SYSTEMS

ASSESSMENT OF TWO CHEAP CLOSE-RANGE FEATURE EXTRACTION SYSTEMS ASSESSMENT OF TWO CHEAP CLOSE-RANGE FEATURE EXTRACTION SYSTEMS Ahmed Elaksher a, Mohammed Elghazali b, Ashraf Sayed b, and Yasser Elmanadilli b a Shool of Civil Engineering, Purdue University, West Lafayette,

More information

Chromaticity-matched Superimposition of Foreground Objects in Different Environments

Chromaticity-matched Superimposition of Foreground Objects in Different Environments FCV216, the 22nd Korea-Japan Joint Workshop on Frontiers of Computer Vision Chromatiity-mathed Superimposition of Foreground Objets in Different Environments Yohei Ogura Graduate Shool of Siene and Tehnology

More information

Discrete sequential models and CRFs. 1 Case Study: Supervised Part-of-Speech Tagging

Discrete sequential models and CRFs. 1 Case Study: Supervised Part-of-Speech Tagging 0-708: Probabilisti Graphial Models 0-708, Spring 204 Disrete sequential models and CRFs Leturer: Eri P. Xing Sribes: Pankesh Bamotra, Xuanhong Li Case Study: Supervised Part-of-Speeh Tagging The supervised

More information

Plot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar

Plot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar Plot-to-trak orrelation in A-SMGCS using the target images from a Surfae Movement Radar G. Golino Radar & ehnology Division AMS, Italy ggolino@amsjv.it Abstrat he main topi of this paper is the formulation

More information

Dr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq

Dr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq Volume 4 Issue 6 June 014 ISSN: 77 18X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om Medial Image Compression using

More information

A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks

A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks Abouberine Ould Cheikhna Department of Computer Siene University of Piardie Jules Verne 80039 Amiens Frane Ould.heikhna.abouberine @u-piardie.fr

More information

Gradient based progressive probabilistic Hough transform

Gradient based progressive probabilistic Hough transform Gradient based progressive probabilisti Hough transform C.Galambos, J.Kittler and J.Matas Abstrat: The authors look at the benefits of exploiting gradient information to enhane the progressive probabilisti

More information

Simulation of Crystallographic Texture and Anisotropie of Polycrystals during Metal Forming with Respect to Scaling Aspects

Simulation of Crystallographic Texture and Anisotropie of Polycrystals during Metal Forming with Respect to Scaling Aspects Raabe, Roters, Wang Simulation of Crystallographi Texture and Anisotropie of Polyrystals during Metal Forming with Respet to Saling Aspets D. Raabe, F. Roters, Y. Wang Max-Plank-Institut für Eisenforshung,

More information

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating Capturing Large Intra-lass Variations of Biometri Data by Template Co-updating Ajita Rattani University of Cagliari Piazza d'armi, Cagliari, Italy ajita.rattani@diee.unia.it Gian Lua Marialis University

More information

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and

More information

the data. Structured Principal Component Analysis (SPCA)

the data. Structured Principal Component Analysis (SPCA) Strutured Prinipal Component Analysis Kristin M. Branson and Sameer Agarwal Department of Computer Siene and Engineering University of California, San Diego La Jolla, CA 9193-114 Abstrat Many tasks involving

More information

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer

More information

KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION

KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION Cuiui Kang 1, Shengai Liao, Shiming Xiang 1, Chunhong Pan 1 1 National Laboratory of Pattern Reognition, Institute of Automation, Chinese

More information

Color Image Fusion for Concealed Weapon Detection

Color Image Fusion for Concealed Weapon Detection In: E.M. Carapezza (Ed.), Sensors, and ommand, ontrol, ommuniations, and intelligene (C3I) tehnologies for homeland defense and law enforement II, SPIE-571 (pp. 372-379). Bellingham, WA., USA: The International

More information

Shape Outlier Detection Using Pose Preserving Dynamic Shape Models

Shape Outlier Detection Using Pose Preserving Dynamic Shape Models Shape Outlier Detetion Using Pose Preserving Dynami Shape Models Chan-Su Lee Ahmed Elgammal Department of Computer Siene, Rutgers University, Pisataway, NJ 8854 USA CHANSU@CS.RUTGERS.EDU ELGAMMAL@CS.RUTGERS.EDU

More information

A Coarse-to-Fine Classification Scheme for Facial Expression Recognition

A Coarse-to-Fine Classification Scheme for Facial Expression Recognition A Coarse-to-Fine Classifiation Sheme for Faial Expression Reognition Xiaoyi Feng 1,, Abdenour Hadid 1 and Matti Pietikäinen 1 1 Mahine Vision Group Infoteh Oulu and Dept. of Eletrial and Information Engineering

More information

FUZZY WATERSHED FOR IMAGE SEGMENTATION

FUZZY WATERSHED FOR IMAGE SEGMENTATION FUZZY WATERSHED FOR IMAGE SEGMENTATION Ramón Moreno, Manuel Graña Computational Intelligene Group, Universidad del País Vaso, Spain http://www.ehu.es/winto; {ramon.moreno,manuel.grana}@ehu.es Abstrat The

More information

arxiv: v1 [cs.cv] 20 Jan 2015

arxiv: v1 [cs.cv] 20 Jan 2015 A Light Transport Model for Mitigating Multipath Interferene in TOF Sensors Nikhil Naik 1,2 Ahuta Kadambi 1 Christoph Rhemann 2 Shahram Izadi 2 Ramesh Raskar 1 Sing Bing Kang 2 1 MIT Media Lab, 2 Mirosoft

More information

Acoustic Links. Maximizing Channel Utilization for Underwater

Acoustic Links. Maximizing Channel Utilization for Underwater Maximizing Channel Utilization for Underwater Aousti Links Albert F Hairris III Davide G. B. Meneghetti Adihele Zorzi Department of Information Engineering University of Padova, Italy Email: {harris,davide.meneghetti,zorzi}@dei.unipd.it

More information

Abstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1.

Abstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1. Fuzzy Weighted Rank Ordered Mean (FWROM) Filters for Mixed Noise Suppression from Images S. Meher, G. Panda, B. Majhi 3, M.R. Meher 4,,4 Department of Eletronis and I.E., National Institute of Tehnology,

More information

Phasor Imaging: A Generalization of Correlation-Based Time-of-Flight Imaging

Phasor Imaging: A Generalization of Correlation-Based Time-of-Flight Imaging Phasor Imaging: A Generalization of Correlation-Based Time-of-Flight Imaging MOHIT GUPTA and SHREE K. NAYAR Columbia University and MATTHIAS B. HULLIN and JAIME MARTIN University of Bonn In orrelation-based

More information

Pipelined Multipliers for Reconfigurable Hardware

Pipelined Multipliers for Reconfigurable Hardware Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,

More information

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2 On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,

More information

Outline: Software Design

Outline: Software Design Outline: Software Design. Goals History of software design ideas Design priniples Design methods Life belt or leg iron? (Budgen) Copyright Nany Leveson, Sept. 1999 A Little History... At first, struggling

More information

Multi-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality

Multi-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality INTERNATIONAL CONFERENCE ON MANUFACTURING AUTOMATION (ICMA200) Multi-Piee Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality Stephen Stoyan, Yong Chen* Epstein Department of

More information

Smooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints

Smooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints Smooth Trajetory Planning Along Bezier Curve for Mobile Robots with Veloity Constraints Gil Jin Yang and Byoung Wook Choi Department of Eletrial and Information Engineering Seoul National University of

More information

And, the (low-pass) Butterworth filter of order m is given in the frequency domain by

And, the (low-pass) Butterworth filter of order m is given in the frequency domain by Problem Set no.3.a) The ideal low-pass filter is given in the frequeny domain by B ideal ( f ), f f; =, f > f. () And, the (low-pass) Butterworth filter of order m is given in the frequeny domain by B

More information

3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT?

3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? 3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? Bernd Girod, Peter Eisert, Marus Magnor, Ekehard Steinbah, Thomas Wiegand Te {girod eommuniations Laboratory, University of Erlangen-Nuremberg

More information

timestamp, if silhouette(x, y) 0 0 if silhouette(x, y) = 0, mhi(x, y) = and mhi(x, y) < timestamp - duration mhi(x, y), else

timestamp, if silhouette(x, y) 0 0 if silhouette(x, y) = 0, mhi(x, y) = and mhi(x, y) < timestamp - duration mhi(x, y), else 3rd International Conferene on Multimedia Tehnolog(ICMT 013) An Effiient Moving Target Traking Strateg Based on OpenCV and CAMShift Theor Dongu Li 1 Abstrat Image movement involved bakground movement and

More information

Using Augmented Measurements to Improve the Convergence of ICP

Using Augmented Measurements to Improve the Convergence of ICP Using Augmented Measurements to Improve the onvergene of IP Jaopo Serafin, Giorgio Grisetti Dept. of omputer, ontrol and Management Engineering, Sapienza University of Rome, Via Ariosto 25, I-0085, Rome,

More information

Detecting Moving Targets in Clutter in Airborne SAR via Keystoning and Multiple Phase Center Interferometry

Detecting Moving Targets in Clutter in Airborne SAR via Keystoning and Multiple Phase Center Interferometry Deteting Moving Targets in Clutter in Airborne SAR via Keystoning and Multiple Phase Center Interferometry D. M. Zasada, P. K. Sanyal The MITRE Corp., 6 Eletroni Parkway, Rome, NY 134 (dmzasada, psanyal)@mitre.org

More information

Rotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors

Rotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors Eurographis Symposium on Geometry Proessing (003) L. Kobbelt, P. Shröder, H. Hoppe (Editors) Rotation Invariant Spherial Harmoni Representation of 3D Shape Desriptors Mihael Kazhdan, Thomas Funkhouser,

More information

Lecture 02 Image Formation

Lecture 02 Image Formation Institute of Informatis Institute of Neuroinformatis Leture 2 Image Formation Davide Saramuzza Outline of this leture Image Formation Other amera parameters Digital amera Perspetive amera model Lens distortion

More information

Accurate Image Based Relighting through Optimization

Accurate Image Based Relighting through Optimization Thirteenth Eurographis Workshop on Rendering (2002) P. Debeve and S. Gibson (Editors) Aurate Image Based Relighting through Optimization Pieter Peers Philip Dutré Department of Computer Siene, K.U.Leuven,

More information

Exploring the Commonality in Feature Modeling Notations

Exploring the Commonality in Feature Modeling Notations Exploring the Commonality in Feature Modeling Notations Miloslav ŠÍPKA Slovak University of Tehnology Faulty of Informatis and Information Tehnologies Ilkovičova 3, 842 16 Bratislava, Slovakia miloslav.sipka@gmail.om

More information

A scheme for racquet sports video analysis with the combination of audio-visual information

A scheme for racquet sports video analysis with the combination of audio-visual information A sheme for raquet sports video analysis with the ombination of audio-visual information Liyuan Xing a*, Qixiang Ye b, Weigang Zhang, Qingming Huang a and Hua Yu a a Graduate Shool of the Chinese Aadamy

More information

Improving the Perceptual Uniformity of a Gloss Space

Improving the Perceptual Uniformity of a Gloss Space Improving the Pereptual Uniformity of a Gloss Spae Adria Fores, 1 Mark D. Fairhild, 1 Ingeborg Tastl 2 1 Munsell Color Siene Laboratory, Rohester Institute of Tehnology 2 Hewlett-Pakard Laboratories Abstrat

More information

Video Data and Sonar Data: Real World Data Fusion Example

Video Data and Sonar Data: Real World Data Fusion Example 14th International Conferene on Information Fusion Chiago, Illinois, USA, July 5-8, 2011 Video Data and Sonar Data: Real World Data Fusion Example David W. Krout Applied Physis Lab dkrout@apl.washington.edu

More information

Approximate logic synthesis for error tolerant applications

Approximate logic synthesis for error tolerant applications Approximate logi synthesis for error tolerant appliations Doohul Shin and Sandeep K. Gupta Eletrial Engineering Department, University of Southern California, Los Angeles, CA 989 {doohuls, sandeep}@us.edu

More information

Algorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking

Algorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking Algorithms for External Memory Leture 6 Graph Algorithms - Weighted List Ranking Leturer: Nodari Sithinava Sribe: Andi Hellmund, Simon Ohsenreither 1 Introdution & Motivation After talking about I/O-effiient

More information

3D Model Based Pose Estimation For Omnidirectional Stereovision

3D Model Based Pose Estimation For Omnidirectional Stereovision 3D Model Based Pose Estimation For Omnidiretional Stereovision Guillaume Caron, Eri Marhand and El Mustapha Mouaddib Abstrat Robot vision has a lot to win as well with wide field of view indued by atadioptri

More information

System-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications

System-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications System-Level Parallelism and hroughput Optimization in Designing Reonfigurable Computing Appliations Esam El-Araby 1, Mohamed aher 1, Kris Gaj 2, arek El-Ghazawi 1, David Caliga 3, and Nikitas Alexandridis

More information

PARAMETRIC SAR IMAGE FORMATION - A PROMISING APPROACH TO RESOLUTION-UNLIMITED IMAGING. Yesheng Gao, Kaizhi Wang, Xingzhao Liu

PARAMETRIC SAR IMAGE FORMATION - A PROMISING APPROACH TO RESOLUTION-UNLIMITED IMAGING. Yesheng Gao, Kaizhi Wang, Xingzhao Liu 20th European Signal Proessing Conferene EUSIPCO 2012) Buharest, Romania, August 27-31, 2012 PARAMETRIC SAR IMAGE FORMATION - A PROMISING APPROACH TO RESOLUTION-UNLIMITED IMAGING Yesheng Gao, Kaizhi Wang,

More information

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425) Automati Physial Design Tuning: Workload as a Sequene Sanjay Agrawal Mirosoft Researh One Mirosoft Way Redmond, WA, USA +1-(425) 75-357 sagrawal@mirosoft.om Eri Chu * Computer Sienes Department University

More information

Analysis of input and output configurations for use in four-valued CCD programmable logic arrays

Analysis of input and output configurations for use in four-valued CCD programmable logic arrays nalysis of input and output onfigurations for use in four-valued D programmable logi arrays J.T. utler H.G. Kerkhoff ndexing terms: Logi, iruit theory and design, harge-oupled devies bstrat: s in binary,

More information

Parametric Abstract Domains for Shape Analysis

Parametric Abstract Domains for Shape Analysis Parametri Abstrat Domains for Shape Analysis Xavier RIVAL (INRIA & Éole Normale Supérieure) Joint work with Bor-Yuh Evan CHANG (University of Maryland U University of Colorado) and George NECULA (University

More information

New Fuzzy Object Segmentation Algorithm for Video Sequences *

New Fuzzy Object Segmentation Algorithm for Video Sequences * JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 521-537 (2008) New Fuzzy Obet Segmentation Algorithm for Video Sequenes * KUO-LIANG CHUNG, SHIH-WEI YU, HSUEH-JU YEH, YONG-HUAI HUANG AND TA-JEN YAO Department

More information

Fast Rigid Motion Segmentation via Incrementally-Complex Local Models

Fast Rigid Motion Segmentation via Incrementally-Complex Local Models Fast Rigid Motion Segmentation via Inrementally-Complex Loal Models Fernando Flores-Mangas Allan D. Jepson Department of Computer Siene, University of Toronto {mangas,jepson}@s.toronto.edu Abstrat The

More information

INTERPOLATED AND WARPED 2-D DIGITAL WAVEGUIDE MESH ALGORITHMS

INTERPOLATED AND WARPED 2-D DIGITAL WAVEGUIDE MESH ALGORITHMS Proeedings of the COST G-6 Conferene on Digital Audio Effets (DAFX-), Verona, Italy, Deember 7-9, INTERPOLATED AND WARPED -D DIGITAL WAVEGUIDE MESH ALGORITHMS Vesa Välimäki Lab. of Aoustis and Audio Signal

More information

Defect Detection and Classification in Ceramic Plates Using Machine Vision and Naïve Bayes Classifier for Computer Aided Manufacturing

Defect Detection and Classification in Ceramic Plates Using Machine Vision and Naïve Bayes Classifier for Computer Aided Manufacturing Defet Detetion and Classifiation in Cerami Plates Using Mahine Vision and Naïve Bayes Classifier for Computer Aided Manufaturing 1 Harpreet Singh, 2 Kulwinderpal Singh, 1 Researh Student, 2 Assistant Professor,

More information

Measurement of the stereoscopic rangefinder beam angular velocity using the digital image processing method

Measurement of the stereoscopic rangefinder beam angular velocity using the digital image processing method Measurement of the stereosopi rangefinder beam angular veloity using the digital image proessing method ROMAN VÍTEK Department of weapons and ammunition University of defense Kouniova 65, 62 Brno CZECH

More information

Gray Codes for Reflectable Languages

Gray Codes for Reflectable Languages Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings

More information

Calculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem

Calculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem Calulation of typial running time of a branh-and-bound algorithm for the vertex-over problem Joni Pajarinen, Joni.Pajarinen@iki.fi Otober 21, 2007 1 Introdution The vertex-over problem is one of a olletion

More information

An Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index

An Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index IJCSES International Journal of Computer Sienes and Engineering Systems, ol., No.4, Otober 2007 CSES International 2007 ISSN 0973-4406 253 An Optimized Approah on Applying Geneti Algorithm to Adaptive

More information

CUTTING FORCES AND CONSECUTIVE DEFORMATIONS AT MILLING PARTS WITH THIN WALLS

CUTTING FORCES AND CONSECUTIVE DEFORMATIONS AT MILLING PARTS WITH THIN WALLS Proeedings of the International Conferene on Manufaturing Systems ICMaS Vol. 4, 2009, ISSN 1842-3183 University POLITEHNICA of Buharest, Mahine and Manufaturing Systems Department Buharest, Romania CUTTING

More information

A Unified Subdivision Scheme for Polygonal Modeling

A Unified Subdivision Scheme for Polygonal Modeling EUROGRAPHICS 2 / A. Chalmers and T.-M. Rhyne (Guest Editors) Volume 2 (2), Number 3 A Unified Subdivision Sheme for Polygonal Modeling Jérôme Maillot Jos Stam Alias Wavefront Alias Wavefront 2 King St.

More information

Evolutionary Feature Synthesis for Image Databases

Evolutionary Feature Synthesis for Image Databases Evolutionary Feature Synthesis for Image Databases Anlei Dong, Bir Bhanu, Yingqiang Lin Center for Researh in Intelligent Systems University of California, Riverside, California 92521, USA {adong, bhanu,

More information

A PROTOTYPE OF INTELLIGENT VIDEO SURVEILLANCE CAMERAS

A PROTOTYPE OF INTELLIGENT VIDEO SURVEILLANCE CAMERAS INTERNATIONAL JOURNAL OF INFORMATION AND SYSTEMS SCIENCES Volume 1, 3, Number 1, 3, Pages 1-22 365-382 2007 Institute for Sientifi Computing and Information A PROTOTYPE OF INTELLIGENT VIDEO SURVEILLANCE

More information

Semi-Supervised Affinity Propagation with Instance-Level Constraints

Semi-Supervised Affinity Propagation with Instance-Level Constraints Semi-Supervised Affinity Propagation with Instane-Level Constraints Inmar E. Givoni, Brendan J. Frey Probabilisti and Statistial Inferene Group University of Toronto 10 King s College Road, Toronto, Ontario,

More information

Boosted Random Forest

Boosted Random Forest Boosted Random Forest Yohei Mishina, Masamitsu suhiya and Hironobu Fujiyoshi Department of Computer Siene, Chubu University, 1200 Matsumoto-ho, Kasugai, Aihi, Japan {mishi, mtdoll}@vision.s.hubu.a.jp,

More information

Compressed Sensing mm-wave SAR for Non-Destructive Testing Applications using Side Information

Compressed Sensing mm-wave SAR for Non-Destructive Testing Applications using Side Information Compressed Sensing mm-wave SAR for Non-Destrutive Testing Appliations using Side Information Mathias Bequaert 1,2, Edison Cristofani 1,2, Gokarna Pandey 2, Marijke Vandewal 1, Johan Stiens 2,3 and Nikos

More information

Unsupervised color film restoration using adaptive color equalization

Unsupervised color film restoration using adaptive color equalization Unsupervised olor film restoration using adaptive olor equalization A. Rizzi 1, C. Gatta 1, C. Slanzi 1, G. Cioa 2, R. Shettini 2 1 Dipartimento di Tenologie dell Informazione Università degli studi di

More information

We don t need no generation - a practical approach to sliding window RLNC

We don t need no generation - a practical approach to sliding window RLNC We don t need no generation - a pratial approah to sliding window RLNC Simon Wunderlih, Frank Gabriel, Sreekrishna Pandi, Frank H.P. Fitzek Deutshe Telekom Chair of Communiation Networks, TU Dresden, Dresden,

More information

Weak Dependence on Initialization in Mixture of Linear Regressions

Weak Dependence on Initialization in Mixture of Linear Regressions Proeedings of the International MultiConferene of Engineers and Computer Sientists 8 Vol I IMECS 8, Marh -6, 8, Hong Kong Weak Dependene on Initialization in Mixture of Linear Regressions Ryohei Nakano

More information

WIRELESS CAPSULE ENDOSCOPY IMAGES ENHANCEMENT BASED ON ADAPTIVE ANISOTROPIC DIFFUSION

WIRELESS CAPSULE ENDOSCOPY IMAGES ENHANCEMENT BASED ON ADAPTIVE ANISOTROPIC DIFFUSION WIRELESS CAPSULE ENDOSCOPY IMAGES ENHANCEMENT BASED ON ADAPTIVE ANISOTROPIC DIFFUSION Lei Li 1, Y. X. ZOU 1* and Yi Li 1 ADSPLAB/ELIP, Shool of ECE, Peking Universit, Shenzhen 518055, China Shenzhen JiFu

More information

Exploiting Enriched Contextual Information for Mobile App Classification

Exploiting Enriched Contextual Information for Mobile App Classification Exploiting Enrihed Contextual Information for Mobile App Classifiation Hengshu Zhu 1 Huanhuan Cao 2 Enhong Chen 1 Hui Xiong 3 Jilei Tian 2 1 University of Siene and Tehnology of China 2 Nokia Researh Center

More information

Algorithms, Mechanisms and Procedures for the Computer-aided Project Generation System

Algorithms, Mechanisms and Procedures for the Computer-aided Project Generation System Algorithms, Mehanisms and Proedures for the Computer-aided Projet Generation System Anton O. Butko 1*, Aleksandr P. Briukhovetskii 2, Dmitry E. Grigoriev 2# and Konstantin S. Kalashnikov 3 1 Department

More information

Learning Discriminative and Shareable Features. Scene Classificsion

Learning Discriminative and Shareable Features. Scene Classificsion Learning Disriminative and Shareable Features for Sene Classifiation Zhen Zuo, Gang Wang, Bing Shuai, Lifan Zhao, Qingxiong Yang, and Xudong Jiang Nanyang Tehnologial University, Singapore, Advaned Digital

More information

The Implementation of RRTs for a Remote-Controlled Mobile Robot

The Implementation of RRTs for a Remote-Controlled Mobile Robot ICCAS5 June -5, KINEX, Gyeonggi-Do, Korea he Implementation of RRs for a Remote-Controlled Mobile Robot Chi-Won Roh*, Woo-Sub Lee **, Sung-Chul Kang *** and Kwang-Won Lee **** * Intelligent Robotis Researh

More information

Chemical, Biological and Radiological Hazard Assessment: A New Model of a Plume in a Complex Urban Environment

Chemical, Biological and Radiological Hazard Assessment: A New Model of a Plume in a Complex Urban Environment hemial, Biologial and Radiologial Haard Assessment: A New Model of a Plume in a omplex Urban Environment Skvortsov, A.T., P.D. Dawson, M.D. Roberts and R.M. Gailis HPP Division, Defene Siene and Tehnology

More information

An Approach to Physics Based Surrogate Model Development for Application with IDPSA

An Approach to Physics Based Surrogate Model Development for Application with IDPSA An Approah to Physis Based Surrogate Model Development for Appliation with IDPSA Ignas Mikus a*, Kaspar Kööp a, Marti Jeltsov a, Yuri Vorobyev b, Walter Villanueva a, and Pavel Kudinov a a Royal Institute

More information

arxiv: v1 [cs.db] 13 Sep 2017

arxiv: v1 [cs.db] 13 Sep 2017 An effiient lustering algorithm from the measure of loal Gaussian distribution Yuan-Yen Tai (Dated: May 27, 2018) In this paper, I will introdue a fast and novel lustering algorithm based on Gaussian distribution

More information

An Alternative Approach to the Fuzzifier in Fuzzy Clustering to Obtain Better Clustering Results

An Alternative Approach to the Fuzzifier in Fuzzy Clustering to Obtain Better Clustering Results An Alternative Approah to the Fuzziier in Fuzzy Clustering to Obtain Better Clustering Results Frank Klawonn Department o Computer Siene University o Applied Sienes BS/WF Salzdahlumer Str. 46/48 D-38302

More information

Fitting conics to paracatadioptric projections of lines

Fitting conics to paracatadioptric projections of lines Computer Vision and Image Understanding 11 (6) 11 16 www.elsevier.om/loate/viu Fitting onis to paraatadioptri projetions of lines João P. Barreto *, Helder Araujo Institute for Systems and Robotis, Department

More information

HEXA: Compact Data Structures for Faster Packet Processing

HEXA: Compact Data Structures for Faster Packet Processing Washington University in St. Louis Washington University Open Sholarship All Computer Siene and Engineering Researh Computer Siene and Engineering Report Number: 27-26 27 HEXA: Compat Data Strutures for

More information

Polyhedron Volume-Ratio-based Classification for Image Recognition

Polyhedron Volume-Ratio-based Classification for Image Recognition Polyhedron Volume-Ratio-based Classifiation for Image Reognition Qingxiang Feng, Jeng-Shyang Pan, Senior Member, IEEE, Jar-Ferr Yang, Fellow, IEEE and Yang-ing Chou Abstrat In this paper, a novel method,

More information

Chapter 2: Introduction to Maple V

Chapter 2: Introduction to Maple V Chapter 2: Introdution to Maple V 2-1 Working with Maple Worksheets Try It! (p. 15) Start a Maple session with an empty worksheet. The name of the worksheet should be Untitled (1). Use one of the standard

More information

Superpixel Tracking. School of Information and Communication Engineering, Dalian University of Technology, China 2

Superpixel Tracking. School of Information and Communication Engineering, Dalian University of Technology, China 2 Superpixel Traking Shu Wang1, Huhuan Lu1, Fan Yang1, and Ming-Hsuan Yang2 1 Shool of Information and Communiation Engineering, Dalian University of Tehnology, China 2 Eletrial Engineering and Computer

More information

Face and Facial Feature Tracking for Natural Human-Computer Interface

Face and Facial Feature Tracking for Natural Human-Computer Interface Fae and Faial Feature Traking for Natural Human-Computer Interfae Vladimir Vezhnevets Graphis & Media Laboratory, Dept. of Applied Mathematis and Computer Siene of Mosow State University Mosow, Russia

More information

Wide-baseline Multiple-view Correspondences

Wide-baseline Multiple-view Correspondences Wide-baseline Multiple-view Correspondenes Vittorio Ferrari, Tinne Tuytelaars, Lu Van Gool, Computer Vision Group (BIWI), ETH Zuerih, Switzerland ESAT-PSI, University of Leuven, Belgium {ferrari,vangool}@vision.ee.ethz.h,

More information

SVC-DASH-M: Scalable Video Coding Dynamic Adaptive Streaming Over HTTP Using Multiple Connections

SVC-DASH-M: Scalable Video Coding Dynamic Adaptive Streaming Over HTTP Using Multiple Connections SVC-DASH-M: Salable Video Coding Dynami Adaptive Streaming Over HTTP Using Multiple Connetions Samar Ibrahim, Ahmed H. Zahran and Mahmoud H. Ismail Department of Eletronis and Eletrial Communiations, Faulty

More information

Improved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules

Improved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules Improved Vehile Classifiation in Long Traffi Video by Cooperating Traker and Classifier Modules Brendan Morris and Mohan Trivedi University of California, San Diego San Diego, CA 92093 {b1morris, trivedi}@usd.edu

More information

Image Steganography Scheme using Chaos and Fractals with the Wavelet Transform

Image Steganography Scheme using Chaos and Fractals with the Wavelet Transform International Journal of Innovation, Management and Tehnology, Vol. 3, o. 3, June Image Steganography Sheme using Chaos and Fratals with the Wavelet Transform Yue Wu and Joseph P. oonan bstrat This paper

More information

BENDING STIFFNESS AND DYNAMIC CHARACTERISTICS OF A ROTOR WITH SPLINE JOINTS

BENDING STIFFNESS AND DYNAMIC CHARACTERISTICS OF A ROTOR WITH SPLINE JOINTS Proeedings of ASME 0 International Mehanial Engineering Congress & Exposition IMECE0 November 5-, 0, San Diego, CA IMECE0-6657 BENDING STIFFNESS AND DYNAMIC CHARACTERISTICS OF A ROTOR WITH SPLINE JOINTS

More information

Adaptive Implicit Surface Polygonization using Marching Triangles

Adaptive Implicit Surface Polygonization using Marching Triangles Volume 20 (2001), Number 2 pp. 67 80 Adaptive Impliit Surfae Polygonization using Marhing Triangles Samir Akkouhe Eri Galin L.I.G.I.M L.I.G.I.M Eole Centrale de Lyon Université Claude Bernard Lyon 1 B.P.

More information