Unsupervised color film restoration using adaptive color equalization
|
|
- Brianna Beasley
- 5 years ago
- Views:
Transcription
1 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 Milano - Polo di Crema via Bramante, 65, Crema (CR), Italy {rizzi,gatta}@dti.unimi.it slanzi@rema.unimi.it 2 DISCo (Dipartimento di Informatia, Sistemistia e Comuniazione), Edifiio 7 Università degli Studi di Milano-Bioa, Via Bioa degli Arimboldi 8, Milano, Italy {ioa, shettini}@diso.unimib.it Abstrat. Chemial proessing of elluloid based inemati film, beomes unstable with time, unless they are stored at low temperatures. Some defets, suh as bleahing on olor movies, are diffiult to solve using photohemial restoration methods. In these ases, a digital restoration tool an be a very onvenient solution. Unfortunately, for old movies olor and dynami range digital restoration is usually dependent on the skill of trained tehniians who are able to ontrol the parameters through olor adjustment, and may be different for a sequene or group of frames. This leads to a long and frustrating restoration proess. As an alternative solution, we present in this paper, an innovative tehnique based on a model of human olor pereption:, to orret olor and dynami range with no need of user supervision and with a very limited number of parameters. The method is ombined with a tehnique that is able to split the movie into different shots and to selet representative frames (key frames) from eah shot. By default, key frames are used to set the olor orretion method parameters that are then applied to the whole shot. Due to the robustness of the olor orretion method the setting used for the key frame is used suessfully for all the frames of the same shot. 1. Introdution Movie hemial materials are the result of a hemially unstable proess, and is subjet to fading with time. This fading is irreversible and in several ases photohemial restoration of faded prints is risky and not always possible. In these ases, digital olor restoration an solve the problem. In this paper, we propose a tehnique for olor digital restoration of faded movies based on a pereptual approah, inspired by some adaptation mehanisms of the human visual system (HVS), in partiular, lightness onstany and olor onstany. The lightness onstany adaptation enables pereption of the sene regardless of hanges in the mean luminane intensity and the olor onstany adaptation enables pereption of a sene regardless of hanges in olor of the illuminant.
2 2 A. Rizzi1, C. Gatta1, C. Slanzi1, G. Cioa 2, R. Shettini2 Restoring film fading and/or olor bleahing an be seen as a problem of hromati noise removal, suh as olor onstany mehanisms [1][2]. Consequently an algorithm is hosen for digital images that performs unsupervised enhanement, alled ACE (Automati Color Equalization) [3][4]. It provides experimental evidene in an automati orretion of the olor balane of an image. Although the number of ACE parameters is very small and their tuning not ritial, their setting an vary widely aording to the image ontent and to the kind of final rendering hosen by the film diretor (e.g. low or high key, artisti olor distortion, et..). 2. Towards unsupervised restoring parameters tuning To implement a standard tuning proedure, we need to extrat a set of still images (key frames) that summarize the video ontent in a rapid and ompat way. Different methods an be used to selet key frames. In general these methods assume that the video has already been segmented into shots by a shot detetion algorithm, and extrat the key-frames from within eah shot deteted. One of the possible approahes to key frame seletion is to hoose the first frame in the shot as the key frame [5]. Ueda et al [6] and Rui et al. [7] use the first and last frames of eah shot. Other approahes inlude time sampling of shots at regular intervals. As an alternative approah [7], the video is time sampled regardless of shot boundaries. In [8][9] the entire shot is ompated into a small number of frames, grouping onseutive frames together, or taking frames from a predefined loation within the shot. Other approahes, suh as [10][11], ompute the differenes between onseutive frames in a shot using olor histograms, or other visual desriptions, to measure the visual omplexity of the shot; the key frames are seleted by analyzing the values obtained. In [12][13] the frames are lassified in lusters, and the key frames are seleted from the larger lusters, or by hierarhial lustering redution. The drawbaks to most of these approahes is the number of representative frames must be fixed in some a priori method, for example, depending on the length of the video shots. This annot guarantee that the seleted frames will not be highly orrelated. It is also diffiult to set a suitable interval of time, or frames: large intervals mean a large number of frames will be hosen, while small intervals may not apture enough representative frames, or those hosen may not be in the right plaes. We apply here a new algorithm that dynamially selets a variable number of keyframes depending on the shot s visual ontent and omplexity. After the extration of key frames, these images are used as a set for the parameter tuning of ACE, the hosen algorithm for olor orretion. By default the key frames are used to set the olor orretion method parameters, whih are then applied to the whole shot. Due to the robustness of the olor orretion method the setting used for the key frames is used suessfully for all the frames of the same shot.
3 Unsupervised olor film restoration using adaptive olor equalization 3 3. ACE: Automati Color Equalization ACE is an algorithm for unsupervised enhanement of digital images. It is based on a omputational approah that merges the "Gray World" and "White Path" equalization mehanisms, while taking into aount the spatial distribution of olor information. Inspired by some adaptation mehanisms of the human visual system, ACE is able to adapt to widely varying lighting onditions, and to extrat visual information from the environment effiiently. The implementation of ACE follows the sheme as shown in Fig. 1: first stage: hromati spatial adaptation (responsible for olor orretion); and seond stage: dynami tone reprodution saling, to onfigure the output range, and implement aurate tone mapping. No user supervision, no statistis and no data preparation are required to run the algorithm. Fig. 1. ACE basi sheme. In Fig. 1 I is the input image, R is an intermediate result and O is the output image; subsript denotes the hromati hannel. The first stage, the Chromati/Spatial adaptation, produes an output image R in whih every pixel is reomputed aording to the image ontent, approximating the visual appearane of the image. Eah pixel p of the output image R is omputed separately for eah hromati hannel as shown in equation (1). R( p) = j Im, j p r j Im, j p ( I( p) I( j) ) d( p, j) Ymax d( p, j) (1) Fig. 2 displays the used r( ) funtion.
4 4 A. Rizzi1, C. Gatta1, C. Slanzi1, G. Cioa 2, R. Shettini2 Fig. 2. r( ) funtion. The seond stage maps the intermediate pixels array R into the final output image O. In this stage, a balane between gray world and white path is added, saling linearly the values in R with the following formula O ( p) = round[127.5 s R ( p)] (2) + where s is the slope of the segment [(m,0),(m,255)], with M m = = max[ R ( p)] p min[ R ( p)] p using M as white referene and the zero value in R as an estimate for the medium gray referene point to ompute the slope s. A more detailed desription of the algorithm an be found in [3][4]. The appliation of ACE for movie restoration, is not a straight forward proess; several aspets have been modified or introdued in order to fulfill the tehnial needs of the film restoration field. (3) 4. Color frame restoration The prinipal harateristi of ACE is its loal data driven olor orretion; ACE is able to adapt to unknown hromati dominants, to solve the olor onstany problem and to perform an image dynami data driven strething. Moreover, ACE algorithm is unsupervised and needs little involvement of the user. These properties make it suitable for film restoration, a problem in whih usually there is no referene olor to ompare the results of the filtering, subjetivity is used to determine the pleasantness and naturalness of the final image. Faded movie images are dull, have poor saturation and an overall olor ast. This is due to the bleahing of one or two hromati layers of the film. Sine it is neessary to deal with lost hromati information, restoring the olor of faded movies is more omplex than a simple olor balane. The tehnique, presented here, is not just an
5 Unsupervised olor film restoration using adaptive olor equalization 5 appliation of ACE on movie images, but an enhanement of ACE priniples to meet the requirements of digital film restoration pratie. ACE is used to remove possible olor asts, to balane olors and to orret ontrast of every single frame of the movie. This preliminary tool does not use any inter-frame orrelation to improve its performane. This will be a subjet for future researh. In this instane, ACE parameters have to be properly tuned and new funtions have been added to ahieve image naturalness, to preserve the natural histogram shape and to add new funtions for the restoration proess. These new funtions an obtain satisfatory results even though the input frame is exessively orrupted. The new funtions are: Keep Original Gray (KOG): This funtion is devised to relax the GW mehanism in the seond stage. Instead of entering the hromati hannels around the medium gray, keep original gray funtion preserves the original mean values (independently in R, G and B hannels). This results in histograms more similar in shape with the original. Relaxing GW mehanism in the seond stage does not affet the ACE olor onstany property, ahieved in the first stage. This prevents to muh modifiation of a low or high key images. This funtion is also important for the fade-in and fade-out sequenes. Keep Original olor Cast (KOC):In some instanes, to reate a more artisti quality, film diretors use unnatural olor in a sequene, (e.g. Nosferatu, 1922 direted by F.W. Murnau 1 ). Even though the first stage of ACE removes the olor ast, an estimation an first be undertaken of the olor ast and then replae bak the olor ast at the seond stage. Keep Original Dynami Range (KODR): Sometimes film diretors use a limited dynami range of the film to obtain speifi visual effets and low or high key pitures. In these ases, the use of KODR respets the original intention of the diretor. This funtion an also be used to manage frames that are exessively orrupted. In Summary, ACE parameters an be tuned to ahieve : The SLOPE of the r( ) funtion: greater the slope the more the final ontrast. KOG: retains the original mean lightness of the frame. KOC: retains the original olor ast. KODR: retains the original dynami range. All these parameters need to be set aording to the harateristis of eah single shot. To omplete a restoration of the entire movie, a set of representative frames need to be extrated. 1 [ ] Many senes featuring Graf Orlok were filmed during the day, and when viewed in blak and white, this beomes extremely obvious. This potential blooper??is orreted when the "offiial" versions of the movie are tinted blue to represent night. [ ] from Internet Film Database (
6 6 A. Rizzi1, C. Gatta1, C. Slanzi1, G. Cioa 2, R. Shettini2 5. Choosing the representative frames The video is segmented into shots (a ontinuous sequene of frames taken over a short period of time) by deteting abrupt hanges and fades between them, sine these are more ommon than other editing effets. For abrupt hanges, a threshold-based algorithm is implemented, oupled with a frame differene measurement omputed from histograms and textures desriptors. To detet fades a modified version of the algorithm proposed by Fernando et al. [14] is implemented. The results obtained by these algorithms are submitted for evaluation to a deision module, whih gives the final response. This opes with onfliting results, or with groups of frames that are not meaningful, suh as those between the end of a fade-out and the start of a fade-in, by inreasing the robustness of the detetion phase. A gradual transition detetion algorithm is urrently being developed; it will be integrated in a similar manner. The key-frames seletion algorithm proposed, dynamially selets the representative frames by analyzing the omplexity of the events depited in the shot. The frame differene values initially obtained are used to onstrut a umulative graph that desribes how the frames visual ontent hanges over the entire shot, an indiation of the shot s omplexity: sharp slopes indiate signifiant hanges in the visual ontent due to a moving objet, amera motion or the registration of highly dynami event. These ases are onsidered interesting event points that must be taken into aount in seleting the key frames to inlude in the final shot summary. Event points are identified in the umulative graph of ontiguous frame differenes by seleting those points at the sharpest urve of the graph (urvature points). The representative frames are those orresponding to the mid points between eah pair of onseutive urvature points. In more detail: Three different desriptors are omputed: a olor histogram, an edge diretion histogram, and wavelet statistis. The use of various visual desriptors provides a more preise representation of the frame and aptures small variations between the frames in a shot. The olor histogram used is omposed of 64 bins determined by sampling groups of meaningful olors in the HSV olor spae [15]. The edge diretion histogram is omposed of 72 bins orresponding to intervals of 2.5 degrees. Two Sobel filters are applied to obtain the gradient of the horizontal and the vertial edges of the luminane frame image. These values are used to ompute the gradient of eah pixel and those pixels that exhibit a gradient over a predefined threshold are taken to ompute the gradient angle and then the histogram. Multiresolution wavelet analysis an provide information about the overall texture of the image at different levels of detail. At eah step in the multiresolution wavelet analysis four sub-images (or sub-bands) are obtained with the appliation of a low-pass filter (L) and high-pass filter (H) in the four possible ombinations of LL, LH, HL and HH. These bands orrespond to a smoothed version of the original image (the LL band) and the three oeffiient matries of details (the LH, HL and HH bands). We apply the multiresolution wavelet analysis on the luminane frame image, using three-step Daubehies multiresolution wavelet expansion to produe ten sub-bands. Two energy features, the mean and the variane, are omputed on eah sub-band, resulting in a 20- valued desriptor.
7 Unsupervised olor film restoration using adaptive olor equalization 7 To ompare two frame desriptors a differene measure is used to evaluate the olor histograms, wavelet statistis and edge histograms. The differene between two olor histograms (d H ) is based on the intersetion measure. The differene between two edge diretion histograms (d D ) is omputed using the Eulidean distane as suh in the ase of two wavelet statistis (d W ). The three resulting values are then ombined to form the final frame differene measure (d HWD ) as follow: d HWD ( d d ) + ( d d ) + ( d d ) = (4) H W W Signifiant differenes are obtained only if at least two of the single differenes exhibit high values. By weighing eah differene against the other, the measure detets signifiant hanges, ignoring the smaller differenes due to the moving amera, or aquisition and ompression noise. If we were to use, for example, only the olor histogram, a highly dynami frame sequene (i.e. one ontaining fast moving or panning effets) but with the same olor ontents, would result in a sequene of small frame differene values. On the ontrary, if the frame sequene ontained a flash, or some olor effets, the orresponding frame differene value would be greater than the real ontents of the sequenes all for. With the use of three desriptors, only if the hanges in the sequene are signifiant in terms of olor, texture and overall edges, will d hwd result in high values. The algorithm proposed by Chetverikov et al. [16] is used to detet the high urvature points. The algorithm defines as a orner a loation where a triangle of speified size and opening angle an be insribed in a urve. Using eah urve point P as a fixed vertex point, the algorithm tries to insribe a triangle in the urve, and then determines the opening angle in orrespondene of P. Different triangles are onsidered using points that fall within a window of a given size entered in P, and the sharpest angle, under a predefined threshold θ max, is retained as a possible high urvature point. Finally, those points in the set of andidates high urvature points that are sharper than their neighbors (within a ertain distane) are lassified as high urvature points. The algorithm does not require proessing the whole video, unlike some earlier methods that extrat, for example, key frames based on the length of the shots. Another advantage of our algorithm is that it an be easily adapted in order to extrat the key frames on-the-fly: to detet a high urvature point we an limit our analysis to a fixed number of frame differenes within a predefined window. Thus the urvature points an be determined while omputing the frame differenes, and the key frames an be extrated as soon as a seond high urvature point has been deteted. It must be noted that the first and last frames of the shot are impliitly assumed to orrespond to high urvature points. If a shot does not present a dynami behavior, i.e. the frames within the shot are highly orrelated, the graph does not show evident urvature points, signify that the shot an be summarized by a single representative frame: The middle frame in the sequene is hosen as the key frame. D D H
8 8 A. Rizzi1, C. Gatta1, C. Slanzi1, G. Cioa 2, R. Shettini2 6. Experimental results In this setion results are presented with omments regarding the ACE parameter tuning. All the pitures are key frames seleted with the previously desribed method. We also present results on different key frames of the movie La iudad en la playa (direted by Ferruio Musitelli) an Uruguayan short movie of the 60 s. Color ast removal: Fig. 3a shows a frame from La iudad en la playa with a bluish olor ast. Fig. 3b shows the ability of ACE filtering to remove the olor ast without a priori information. ACE eliminates the bluish olor ast restoring the olor of the wall inside the window. Fig. 3. ACE removal of the olor ast. a) Original frame from La iudad en la playa. b) Frame filtered with SLOPE=2.5 Controlling the ontrast tuning the slope: Fig. 4 shows the effet of ACE filtering with different values of SLOPE. Fig. 4a shows a frame without a strong olor asts. Fig. from 4b to 4d show ACE filtering results of Fig. 4a, with inreasing SLOPE value (1, 2, 2.5). As it an be notie the ontrast inrease as the SLOPE inrease. Fig. 4. Effet of ACE filtering. a) Original frame from La iudad en la playa. b) Frame filtered with SLOPE=2.
9 Unsupervised olor film restoration using adaptive olor equalization 9 ) d) Fig. 4. (ont.) Effet of ACE filtering. ) Frame filtered with SLOPE=2.5. d) Frame filtered with SLOPE=5. Keeping seleted properties of the input image: Fig. 5 shows the behavior of the KOC funtion. The algorithm hanges ontrast and mean lightness keeping its olor ast. Fig. 5. Behavior of the KOC funtion. a) Original frame from Nosferatu. b) Frame filtered with SLOPE=10 and KOC. Fig. 6 shows the behavior of the KOG and the KODR funtions. Fig. 6b shows the filtering without any funtions. While KOG (Fig. 6) keeps the same mean lightness, KODR (Fig. 6d) keeps the dynami range and thus the reddish olor ast.
10 10 A. Rizzi1, C. Gatta1, C. Slanzi1, G. Cioa 2, R. Shettini2 Fig. 6. Behavior of the KOG and the KODR funtions. a) Original frame from La iudad en la playa. b) Frame filtered with SLOPE=3.3. ) Frame filtered with SLOPE=3.3 and KOG. d) Frame filtered with SLOPE=3.3 and KODR. Finally, Fig. 7 shows the appliation of ACE on a blak and white film in order to restore its original dynami range. The example is from TOM TIGHT ET DUM DUM by Georges Méliès (1903). Fig. 7. Appliation of ACE on a blak and white film. a) Original frame from Tom tight et dum dum. b) : Frame filtered with SLOPE=20.
11 Unsupervised olor film restoration using adaptive olor equalization 11 More Examples Fig. 8. Examples of key frames filtering. On the left (a,, e) the original key frames from La iudad en la playa. On the right (b, d, f) the filtered key frames.
12 12 A. Rizzi1, C. Gatta1, C. Slanzi1, G. Cioa 2, R. Shettini2 7. Conlusions This paper has presented a tehnique for digital olor and dynami range restoration of faded movies ombining a method that identifies different shots and automatially selets key frames from a movie. The olor and dynami range restoration uses an unsupervised olor equalization algorithm, based on a pereptual approah. To meet the requirements in the digital restoration field new funtions have been added and results are satisfatory and suggest potential researh. The objetive for future researh will onsider the problem of ACE parameter fine tuning, by investigating improvements to the speed of film proessing and optimizing and aelerating the algorithm. Aknowledgments The authors want to thank Ferruio Musitelli for the permission to use the film and his preious and enouraging friendship. Referenes [1] M. Chambah, B. Besserer, P. Courtellemont, Reent Progress in Automati Digital Restoration of Color Motion Pitures, SPIE Eletroni Imaging 2002, San Jose, CA, USA, January 2002, vol. 4663, pp [2] M. Chambah, B. Besserer, P. Courtellemont, Latest Results in Digital Color Film Restoration, Mahine Graphis and Vision (MG&V) Journal, Vol. 11 no. 2/3, [3] A. Rizzi, C. Gatta, D. Marini, A New Algorithm for Unsupervised Global and Loal Color Corretion, Pattern Reognition Letters, Vol 24 (11), pp , July [4] A. Rizzi, C. Gatta, D. Marini, From Retinex to Automati Color Equalization: issues in developing a new algorithm for unsupervised olor equalization, Journal of Eletroni Imaging, Vol 13 (1), pp , January [5] Y. Tonomura, A. Akutsu, K. Otsugi, and T. Sadakata, VideoMAP and VideoSpaeIon: Tools for automatizing video ontent, Pro. ACM INTERCHI 93 Conferene, pp , [6] H. Ueda, T. Miyatake, and S. Yoshizawa, An interative natural-motion-piture dediated multimedia authoring system, Pro. ACM CHI 91 Conferene, pp , [7] Y. Rui, T. S. Huang and S. Mehrotra, Exploring Video Struture Beyond the Shots, appeared in Pro. of IEEE Int. Conf. on Multimedia Computing and Systems (ICMCS), Texas USA, [8] F. Arman, A. Hsu and M.Y. Chiu, Image Proessing on Compressed Data for Large Video Databases, Pro. ACM Multimedia '93, Annaheim, CA, pp , 1993.
13 Unsupervised olor film restoration using adaptive olor equalization 13 [9] A. Pentland, R. Piard, G. Davenport and K. Haase, Video and Image Semantis: Advaned Tools for Teleommuniations, IEEE MultiMedia 1(2), pp , [10] S. Han, K. Yoon, and I. Kweon, A New Tehnique for Shot Detetion and Key Frames Seletion in Histogram Spae. Pro. 12 th Workshop on Image Proessing and Image Understanding, [11] A. Hanjali, R. Lagendijk, and J. Biemond, A New Method for Key Frame based Video Content Representation. Pro. First International Workshop on Image Databases and Multimedia Searh, [12] Zhuang Y., Rui Y., Huang T.S., Mehrotra S.: Key Frame Extration Using Unsupervised Clustering, in Pro. of ICIP 98, Chiago, USA, [13] A. Girgensohn, J. Borezky, Time-Constrained Keyframe Seletion Tehnique, Multimedia Tools and Appliation, vol. 11, pp , [14] A. C. Fernando, C. N. Canaharajah, D. R. Bull, Fade-In and Fade-Out Detetion in Video Sequenes Using Histograms, Pro. ISCAS 2000 IEEE International Symposium on Ciruits and System, IV , May 28-31, Geneva, Switzerland, [15] G. Cioa, I. Gagliardi, R. Shettini, Quiklook 2 : An Integrated Multimedia System, International Journal of Visual Languages and Computing, Speial issue on Querying Multiple Data Soures, Vol. 12, pp , [16] D. Chetverikov and Zs. Szabo, A Simple and Effiient Algorithm for Detetion of High Curvature Points in Planar Curves, Pro. 23rd Workshop of the Austrian Pattern Reognition Group, pp , 1999.
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 informationDetection 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 informationUnsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks
Unsupervised Stereosopi Video Objet Segmentation Based on Ative Contours and Retrainable Neural Networks KLIMIS NTALIANIS, ANASTASIOS DOULAMIS, and NIKOLAOS DOULAMIS National Tehnial University of Athens
More informationNONLINEAR 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 informationPerformance 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 informationExtracting 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 informationA 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 informationAbstract. 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 informationBioTechnology. 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 informationOn - 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 informationCapturing 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 informationTransition Detection Using Hilbert Transform and Texture Features
Amerian Journal of Signal Proessing 1, (): 35-4 DOI: 1.593/.asp.1.6 Transition Detetion Using Hilbert Transform and Texture Features G. G. Lashmi Priya *, S. Domni Department of Computer Appliations, National
More informationGraph-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 informationThe 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 informationA {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 informationthe 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 informationtimestamp, 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 informationFUZZY 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 informationLearning 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 informationA 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 informationAlgorithms, 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 informationCluster-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 informationAn 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 informationGradient 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 informationA 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 informationDr.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 informationNew 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 informationCleanUp: Improving Quadrilateral Finite Element Meshes
CleanUp: Improving Quadrilateral Finite Element Meshes Paul Kinney MD-10 ECC P.O. Box 203 Ford Motor Company Dearborn, MI. 8121 (313) 28-1228 pkinney@ford.om Abstrat: Unless an all quadrilateral (quad)
More information3-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 informationStable Road Lane Model Based on Clothoids
Stable Road Lane Model Based on Clothoids C Gakstatter*, S Thomas**, Dr P Heinemann*, Prof Gudrun Klinker*** *Audi Eletronis Venture GmbH, **Leibniz Universität Hannover, ***Tehnishe Universität Münhen
More informationChromaticity-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 informationUsing 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 informationKERNEL 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 informationSmooth 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 informationDrawing 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 informationFOREGROUND OBJECT EXTRACTION USING FUZZY C MEANS WITH BIT-PLANE SLICING AND OPTICAL FLOW
FOREGROUND OBJECT EXTRACTION USING FUZZY C EANS WITH BIT-PLANE SLICING AND OPTICAL FLOW SIVAGAI., REVATHI.T, JEGANATHAN.L 3 APSG, SCSE, VIT University, Chennai, India JRF, DST, Dehi, India. 3 Professor,
More informationAlgorithms 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 informationPipelined 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 informationGray 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 informationA 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 informationVideo 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 informationA Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks
International Journal of Advanes in Computer Networks and Its Seurity IJCNS A Load-Balaned Clustering Protool for Hierarhial Wireless Sensor Networks Mehdi Tarhani, Yousef S. Kavian, Saman Siavoshi, Ali
More informationPlumber: a method for a multi-scale decomposition of 3D shapes into tubular primitives and bodies
ACM Symposium on Solid Modeling and Appliations (2004) P. Brunet, N. Patrikalakis (Editors) Plumber: a method for a multi-sale deomposition of 3D shapes into tubular primitives and bodies M. Mortara G.
More informationarxiv: 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 informationOutline: 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 informationApproximate 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 informationAutomatic 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 informationDETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT
DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT 1 ZHANGGUO TANG, 2 HUANZHOU LI, 3 MINGQUAN ZHONG, 4 JIAN ZHANG 1 Institute of Computer Network and Communiation Tehnology,
More informationExploring 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 informationSelf-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization
Self-Adaptive Parent to Mean-Centri Reombination for Real-Parameter Optimization Kalyanmoy Deb and Himanshu Jain Department of Mehanial Engineering Indian Institute of Tehnology Kanpur Kanpur, PIN 86 {deb,hjain}@iitk.a.in
More informationBoosted 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 informationDefect 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 informationSystem-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 informationFace 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 informationWhat are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study
What are Cyle-Stealing Systems Good For? A Detailed Performane Model Case Study Wayne Kelly and Jiro Sumitomo Queensland University of Tehnology, Australia {w.kelly, j.sumitomo}@qut.edu.au Abstrat The
More informationEvolutionary 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 informationA Novel Bit Level Time Series Representation with Implication of Similarity Search and Clustering
A Novel Bit Level Time Series Representation with Impliation of Similarity Searh and lustering hotirat Ratanamahatana, Eamonn Keogh, Anthony J. Bagnall 2, and Stefano Lonardi Dept. of omputer Siene & Engineering,
More informationHEXA: 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 informationAccommodations of QoS DiffServ Over IP and MPLS Networks
Aommodations of QoS DiffServ Over IP and MPLS Networks Abdullah AlWehaibi, Anjali Agarwal, Mihael Kadoh and Ahmed ElHakeem Department of Eletrial and Computer Department de Genie Eletrique Engineering
More informationFigure 1. LBP in the field of texture analysis operators.
L MEHODOLOGY he loal inary pattern (L) texture analysis operator is defined as a gray-sale invariant texture measure, derived from a general definition of texture in a loal neighorhood. he urrent form
More informationTorpedo Trajectory Visual Simulation Based on Nonlinear Backstepping Control
orpedo rajetory Visual Simulation Based on Nonlinear Bakstepping Control Peng Hai-jun 1, Li Hui-zhou Chen Ye 1, 1. Depart. of Weaponry Eng, Naval Univ. of Engineering, Wuhan 400, China. Depart. of Aeronautial
More informationTUMOR DETECTION IN MRI BRAIN IMAGE SEGMENTATION USING PHASE CONGRUENCY MODIFIED FUZZY C MEAN ALGORITHM
TUMOR DETECTION IN MRI BRAIN IMAGE SEGMENTATION USING PHASE CONGRUENCY MODIFIED FUZZY C MEAN ALGORITHM M. Murugeswari 1, M.Gayathri 2 1 Assoiate Professor, 2 PG Sholar 1,2 K.L.N College of Information
More informationWide-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 informationColor 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 informationTime delay estimation of reverberant meeting speech: on the use of multichannel linear prediction
University of Wollongong Researh Online Faulty of Informatis - apers (Arhive) Faulty of Engineering and Information Sienes 7 Time delay estimation of reverberant meeting speeh: on the use of multihannel
More informationMulti-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 informationPerformance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification
erformane Improvement of TC on Wireless Cellular Networks by Adaptive Combined with Expliit Loss tifiation Masahiro Miyoshi, Masashi Sugano, Masayuki Murata Department of Infomatis and Mathematial Siene,
More information特集 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 informationMean Deviation Similarity Index: Efficient and Reliable Full-Reference Image Quality Evaluator
1 Mean Deviation Similarity Index: Effiient and Reliable Full-Referene Image Quality Evaluator Hossein Ziaei Nafhi, Atena Shahkolaei, Rahid Hedjam, and Mohamed Cheriet, Senior Member, IEEE two images of
More informationImproved 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 informationComparing 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 informationParametric 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 informationImproved flooding of broadcast messages using extended multipoint relaying
Improved flooding of broadast messages using extended multipoint relaying Pere Montolio Aranda a, Joaquin Garia-Alfaro a,b, David Megías a a Universitat Oberta de Catalunya, Estudis d Informàtia, Mulimèdia
More informationMachine Vision. Laboratory Exercise Name: Student ID: S
Mahine Vision 521466S Laoratory Eerise 2011 Name: Student D: General nformation To pass these laoratory works, you should answer all questions (Q.y) with an understandale handwriting either in English
More informationRotation 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 informationWe P9 16 Eigenray Tracing in 3D Heterogeneous Media
We P9 Eigenray Traing in 3D Heterogeneous Media Z. Koren* (Emerson), I. Ravve (Emerson) Summary Conventional two-point ray traing in a general 3D heterogeneous medium is normally performed by a shooting
More informationA 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 informationComparative Analysis of two Types of Leg-observation-based Visual Servoing Approaches for the Control of a Five-bar Mechanism
Proeedings of Australasian Conferene on Robotis and Automation, 2-4 De 2014, The University of Melbourne, Melbourne, Australia Comparative Analysis of two Types of Leg-observation-based Visual Servoing
More informationDynamic Backlight Adaptation for Low Power Handheld Devices 1
Dynami Baklight Adaptation for ow Power Handheld Devies 1 Sudeep Pasriha, Manev uthra, Shivajit Mohapatra, Nikil Dutt and Nalini Venkatasubramanian 444, Computer Siene Building, Shool of Information &
More informationMultiple-Criteria Decision Analysis: A Novel Rank Aggregation Method
3537 Multiple-Criteria Deision Analysis: A Novel Rank Aggregation Method Derya Yiltas-Kaplan Department of Computer Engineering, Istanbul University, 34320, Avilar, Istanbul, Turkey Email: dyiltas@ istanbul.edu.tr
More informationReading Object Code. A Visible/Z Lesson
Reading Objet Code A Visible/Z Lesson The Idea: When programming in a high-level language, we rarely have to think about the speifi ode that is generated for eah instrution by a ompiler. But as an assembly
More informationDetecting 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 informationDubins Path Planning of Multiple UAVs for Tracking Contaminant Cloud
Proeedings of the 17th World Congress The International Federation of Automati Control Dubins Path Planning of Multiple UAVs for Traking Contaminant Cloud S. Subhan, B.A. White, A. Tsourdos M. Shanmugavel,
More informationBoundary Correct Real-Time Soft Shadows
Boundary Corret Real-Time Soft Shadows Bjarke Jakobsen Niels J. Christensen Bent D. Larsen Kim S. Petersen Informatis and Mathematial Modelling Tehnial University of Denmark {bj, nj, bdl}@imm.dtu.dk, kim@deadline.dk
More informationWIRELESS 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 informationPartial Character Decoding for Improved Regular Expression Matching in FPGAs
Partial Charater Deoding for Improved Regular Expression Mathing in FPGAs Peter Sutton Shool of Information Tehnology and Eletrial Engineering The University of Queensland Brisbane, Queensland, 4072, Australia
More informationReading Object Code. A Visible/Z Lesson
Reading Objet Code A Visible/Z Lesson The Idea: When programming in a high-level language, we rarely have to think about the speifi ode that is generated for eah instrution by a ompiler. But as an assembly
More informationAcoustic 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 informationAnalysis 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 informationCompilation Lecture 11a. Register Allocation Noam Rinetzky. Text book: Modern compiler implementation in C Andrew A.
Compilation 0368-3133 Leture 11a Text book: Modern ompiler implementation in C Andrew A. Appel Register Alloation Noam Rinetzky 1 Registers Dediated memory loations that an be aessed quikly, an have omputations
More informationAn 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 informationA 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 informationDeep Rule-Based Classifier with Human-level Performance and Characteristics
Deep Rule-Based Classifier with Human-level Performane and Charateristis Plamen P. Angelov 1,2 and Xiaowei Gu 1* 1 Shool of Computing and Communiations, Lanaster University, Lanaster, LA1 4WA, UK 2 Tehnial
More informationParticle Swarm Optimization for the Design of High Diffraction Efficient Holographic Grating
Original Artile Partile Swarm Optimization for the Design of High Diffration Effiient Holographi Grating A.K. Tripathy 1, S.K. Das, M. Sundaray 3 and S.K. Tripathy* 4 1, Department of Computer Siene, Berhampur
More informationASSESSMENT 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 informationTrajectory Tracking Control for A Wheeled Mobile Robot Using Fuzzy Logic Controller
Trajetory Traking Control for A Wheeled Mobile Robot Using Fuzzy Logi Controller K N FARESS 1 M T EL HAGRY 1 A A EL KOSY 2 1 Eletronis researh institute, Cairo, Egypt 2 Faulty of Engineering, Cairo University,
More informationContour Box: Rejecting Object Proposals Without Explicit Closed Contours
Contour Box: Rejeting Objet Proposals Without Expliit Closed Contours Cewu Lu, Shu Liu Jiaya Jia Chi-Keung Tang The Hong Kong University of Siene and Tehnology Stanford University The Chinese University
More informationSpace- and Time-Efficient BDD Construction via Working Set Control
Spae- and Time-Effiient BDD Constrution via Working Set Control Bwolen Yang Yirng-An Chen Randal E. Bryant David R. O Hallaron Computer Siene Department Carnegie Mellon University Pittsburgh, PA 15213.
More informationAdaptive 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 informationThe 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