A Framework for Dialogue Detection in Movies
|
|
- Stanley McGee
- 5 years ago
- Views:
Transcription
1 A Framework for Dialogue Detection in Movies Margarita Kotti, Constantine Kotropoulos, Bartosz Ziólko, Ioannis Pitas, an Vassiliki Moschou Department of Informatics, Aristotle University of Thessaloniki Box 452, Thessaloniki 5424, Greece Abstract. In this paper, we investigate a novel framework for ialogue etection that is base on inicator functions. An inicator function efines that a particular actor is present at each time instant. Two ialogue etection rules are evelope an assesse. The first rule relies on the value of the cross-correlation function at zero time lag that is compare to a threshol. The secon rule is base on the cross-power in a particular frequency ban that is also compare to a threshol. Experiments are carrie out in orer to valiate the feasibility of the aforementione ialogue etection rules by using groun-truth inicator functions etermine by human observers from six ifferent movies. A total of 25 ialogue scenes an another 8 non-ialogue scenes are employe. The probabilities of false alarm an etection are estimate by cross-valiation, where 7% of the available scenes are use to learn the threshols employe in the ialogue etection rules an the remaining 3% of the scenes are use for testing. An almost perfect ialogue etection is reporte for every istinct threshol. Introuction Digital movie archives have become a commonplace nowaays. Research on movie content analysis has been very active. A ialogue scene can be efine as a set of consecutive shots which contain conversations of people []. However, there is a possibility of having shots in a ialogue scene that o not contain any conversation or even any person. The elements of a ialogue scene are: the people, the conversation an the location is taking place in [2]. The basic shots in a ialogue scene are: (i) Type A shot: Shot of actor A s face; (ii) Type B shot: Shot of actor B s face; (iii) Type C shot: Shot with both faces visible. A set of recognizable ialogue acts accoring to semantic content is propose in [3]: (i) Statements; (ii) Questions; (iii) Backchannels; (iv) Incomplete utterance; (v) Agreements; Appreciations. Dialogue etection in movies follows specific rules since movie making is a kin of art [5]. Lehane states that in a 2-person ialogue there is usually a A-B-A-B structure of camera angles, thus making ialogue etection feasible [4]. However, the person who speaks at any given time is not always the one isplaye. Shots of other participants reactions are frequently inserte. In aition, the shot of the speaker may not inclue his face, i.e. the rear view of his hea might be This work has been supporte by the FP6 European Union Network of Excellence MUSCLE Multimeia Unerstaning through Semantics, Computation an LEarning (FP ).
2 epicte. Furthermore, shots of other persons or objects might be inserte in the ialogue scene. Eviently, these shots a to the complexity of the ialogue etection problem, ue to their noneterministic nature. Numerous methos for ialogue etection have been propose, because such a preprocessing step is useful for vieo analysis, inexing, browsing, searching, an summarization. Both vieo an auio information channels coul be exploite for efficient ialogue etection. For example, automatically extracte low-level an mi-level visual features are use to etect ifferent types of scenes, focusing on ialogue sequences [4]. Emotional stages as a means for segmenting vieo are propose in [6]. The etection of monologues base on auio-visual information is iscusse in [7] where a noticeably high average ecision performance is reporte. Relate topics to ialogue etection are face etection an tracking [8], speaker turn etection [9], an speaker tracking []. The aforementione research is compliant with the MPEG-7 stanar. In this paper, we propose a novel framework for ialogue etection that is base on inicator functions. In practice, inicator functions can be obtaine by speaker turn etection followe by speaker clustering or by face etection followe by a similar clustering proceure. However, in this paper we are intereste in setting up the etection framework in the ieal situation where the inicator functions are error free. Towars this goal groun truth inicator functions are employe. Two ialogue etection rules are evelope. The first rule employs the value of the cross-correlation function at zero time-lag an the secon one is base on the cross-power in specific frequency ban. Both quantities are compare to corresponing threshols. Experiments are carrie out using the auio streams extracte from six ifferent movies while the groun-truth inicator functions are efine by human observers. To valiate the feasibility of the ialogue etection rules, the cross-valiation approach is utilize, where 7% of the auio streams is use to efine the two threshols, an the remaining 3% is use for testing. Experimental results inicate that an almost perfect ialogue etection is achievable. The outline of the paper is as follows. The propose ialogue etection rules are iscusse in Section 2. In Section 3, the ialogue scenes use for the experimental evaluation of the propose metho an the training proceure are escribe. In Section 4, performance evaluation is presente an finally conclusions are rawn in Section 5. 2 Dialogue etection 2. Inicator Functions Inicator functions are frequently use in statistical signal processing. They are closely relate to zero-one ranom variables use in the erivation of the probabilities of events through expecte values []. In maximum entropy probability estimation, inicator functions are use to insert constrains quantifying facts stemming from the training ata that constitute our knowlege about the ranom experiment. An example is language moeling [2]. Inicator functions have also been use in the analysis of the DNA sequences [3]. Let us suppose that we have an auio recoring of N samples, where N is the prouct of uration of the auio recoring multiplie by the sampling frequency an
3 we know exactly when a particular actor (i.e. speaker) appears. Such information can be quantifie by the inicator function of say actor A, I A (n), efine as: { when actor A is present at sample n I A (n) = () otherwise. For a ialogue, at least two actors shoul be present. Let us call them A an B with corresponing inicator functions I A (n) an I B (n), respectively. Besies their presence, the actors shoul be active, that is their inicator functions shoul not be zero uring the entire scene uration. To avoi such irregularities, we can measure a proper norm of the inicator function, e.g. the L norm or the L 2 norm, etc. Since the inicator functions amit non-negative values, their L norm is simply the sum of the inicator function values: N S A = I A (n). (2) n= Two characteristic inicator functions for a ialogue scene are plotte in Figure (a). There are several possibilities for a ialogue scene. For example, there might be auio.8.8 IA(n).6.4 IA(n) n, time (msec) n, time (msec).8.8 IB(n).6.4 IB(n) n, time (msec) (a) n, time (msec) (b) Fig.. (a) Inicator functions of two actors in a ialogue scene. (b) Inicator functions of two actors in a non-ialogue scene (i.e. monologue). frames where both actors speak. Auio frames corresponing to short silences shoul be tolerate. In aition, the auio backgroun in ialogue scenes might contain music or environment noise that shoul not prevent ialogue etection. For the time-being, since optimal (i.e. groun-truth) inicator functions are employe, such cases are not ealt with explicitly. An example of a scene where there is no ialogue is shown in Figure (b). It is seen that I B (n) is zero for all n. This is the case of an inactive actor for whom S B =. 2.2 Cross-Correlation The cross-correlation is a measure of similarity between two signals. It is efine as: N c AB () ={ N n= I A(n + )I B (n) if N c BA ( ) if (N ) (3)
4 where N is the total number of samples in the auio stream an is the time-lag. For =, the cross-correlation is equal to the prouct of the two inicator functions I A (n) an I B (n). Practically, this means that the greater the value of c AB () is, the longer time the two actors speak simultaneously. The cross-correlation for the ialogue shown in Figure (a) is epicte in Figure 2(a). It can be seen that c AB () > cab().5. φab(f) ,lag 4 (a) f (Hz) (b) Fig. 2. (a) Cross-correlation of the inicator functions for two actors participating in a ialogue. (b) Cross-power spectrum for two actors participating in a ialogue. For the scene corresponing to the two inicator functions plotte in Figure (b), the cross-correlation is zero throughout its omain. From the aforementione observations, a plausible ialogue etection rule is: where ϑ is an appropriately chosen threshol. c AB () ϑ (4) 2.3 Cross-Power Spectrum Another useful notion to be exploite for ialogue etection is the cross-power spectrum, i.e., the iscrete-time Fourier transform of the cross-correlation: φ AB (f) = N = (N ) c AB () exp( j2π f) (5) where f [.5,.5] is the frequency in cycles per sampling interval. In orer to robustify the ialogue etection, we propose to examine the cross-power p in the frequency ban [.65, 5] that has been etermine by analyzing the measure cross-power spectra p = 5.65 φ AB (f) 2 f. (6) When there is a ialogue, p amits a value that epens on the area uner the crosspower spectrum φ AB (f). Figure 2(b) shows the cross-power spectrum ensity over
5 the frequencies [,.5]. For negative frequencies, φ AB ( f) =φ AB (f). On the other han, in the non-ialogue scene corresponing to the two inicator functions plotte in Figure (b), the cross-power spectrum is ientically zero. Accoringly, the secon ialogue etection rule propose is: where ϑ 2 is clearly an appropriately chosen threshol. p ϑ 2 (7) 3 Data Set an Training Proceure In total, 33 recorings were extracte from the following six movies: Analyze That, Col Mountain, Jackie Brown, Lor of the Rings I, Platoon, an Secret Winow. The total uration of the 33 recorings is 3 min an 7 sec. The auio track was igitize in PCM at a sampling rate of 48 khz an the quantize sample length was 6 bit two-channel. 25 out of the 33 recorings correspon to ialogue scenes, while the remaining 8 o not contain any ialogue. For each recoring, the groun-truth inicator function of the actors appearing in the scene is etermine an for each pair of inicator functions their cross-correlation sequence is calculate. In orer to check the efficiency of the propose etection rules (4) an (7), we nee to estimate for each rule the probability of etection an the probability of false alarm. The aforementione probabilities stem from the binary hypothesis etection problem where the null hypothesis is H : the scene is not a ialogue an the alternative hypothesis H : the scene is a ialogue. Then, the probability of etection is for rule (4): P () = Prob(rule (4) ecies the scene is ialogue H ) (8) an the probability of false alarm is given by: P () f = Prob(rule (4) ecies the scene is ialogue H ). (9) P (2) an P (2) f are efine similarly for rule (7). To estimate P (i) an P (i) f, i =, 2, cross-valiation is employe. The available cross-correlation sequences an their cross-power spectrum ensities are ivie into two isjoint subsets. The first subset is use for training an the secon subset is use for testing. 7% of the available ata are use for training an the remaining 3% for testing. This means that the 23 ranomly selecte cross-correlation sequences an their corresponing cross-power spectrum ensities are use for training an the remaining 9 are use for testing. When selecting the 23 training sequences we simultaneously preserve the ratio between ialogue an non ialogue scenes, i.e. 8 cross-correlation sequences corresponing to ialogue scenes an another 6 corresponing to non ialogue scenes. Similarly, the testing cross-correlation sequences were forme by 7 auio streams corresponing to ialogue scenes an another 2 corresponing to non ialogue scenes. Because of the relatively small amount of the training sequences we applie the leave-one-out metho to estimate the probability of etection. That is 22 out of the 23
6 training sequences are use to estimate the probability of etection an the estimation is repeate by leaving a ifferent training sequence out for all training sequences (i.e. 23 times). Let P (i;r) (ϑ r i ) be the probability of etection for the ith rule that employs the threshol ϑ r i when the rth training sequence is left out. Figure 3(a) shows the average P () (ϑ ) versus ϑ. The curve is estimate by averaging the probabilities measure in the 23 repetitions. The corresponing plot of the average P (2) (ϑ 2) versus ϑ 2 is epicte in Figure 3(b) P () (ϑ).5 P (2) (ϑ2) ϑ ϑ2 (a) (b) Fig. 3. (a) The average P () (2) (ϑ) versus ϑ for the first rule. (b) The average P (ϑ2) versus ϑ2 for the secon rule. Let ϑ i be chosen as the minimum threshol value such that P (i;r) (ϑ r i )=. Table a summarizes the threshols etermine for each training sequence left out. By applying the minimum threshol value an using the entries of Table a, we fin that ϑ = an ϑ 2 =.4, respectively. 4 Performance Evaluation During Testing For the 9 auio streams left out for testing, their corresponing cross-correlations an cross-power spectrum ensities are compute an the values of c AB () an p are collecte in Table b. The first seven rows in Table b correspon to ialogue scenes an the last two correspon to non-ialogues. From the inspection of Table b, it is seen that only the 6th cross-correlation sequence is not etecte as corresponing to a ialogue scene by applying the etection rule (4), although it is. It is also seen that there are no false alarms. The secon etection rule (7) can rectify the just escribe miss-etection. A simple OR rule, i.e. c AB () ϑ OR p ϑ 2. () can yiel a perfect ialogue etection. To compensate the lack of real inicator functions, a number of synthetic inicator functions amitting real values within [, ] have been create an incluing in the test phase. The nature of syntectic inicator functions create an the performance of rule () is summarize in Table 2.
7 Table. (a) The 23 pairs of ϑ an ϑ 2 uring the training proceure. (b) The 9 pairs of crosscorrelation value at zero lag an cross-power in the frequency ban f [.65, 5] for the test recorings. sequence left out, r ϑ r ϑ r test auio cab() p stream inex Conclusions In this paper, we have propose a novel framework for ialogue etection in movies base on inicator functions. Experiments are carrie out using inicator function groun truth extracte from real movies. Cross-valiation was use to estimate the probabilities of etection an false alarm. The experimental results emonstrate the feasibility of the propose etection rules in 33 movie segments. In the future, we plan to exten our movie atabase. Moreover, the groun truth inicator functions will be replace by actual ones erive by either speaker turn etection followe by speaker tracking or face etection followe by face tracking by their combination. References. A. A. Alatan an A. N. Akansu, Multi-moal ialog scene etection using hien-markov moels for content-base multimeia inexing, J. Multimeia Tools an Applications, vol. 4, pp. 37-5, L. Chen an M. T. Özsu, Rule-base extraction from vieo, in Proc. 22 IEEE Int. Conf. Image Processing, vol. II, pp , P. Král, C. Cerisara, an J. Kleckova, Combination of classifiers for automatic recognition of ialogue acts, in Proc. 9th European Conf. Speech Communication an Technology, pp , B. Lehane, N. O Connor, an N. Murphy, Dialogue scene etection in movies using low an mi-level visual features, in Proc. Int. Conf. Image an Vieo Retrieval, pp , 25.
8 Table 2. Synthetic inicator functions, their corresponing c AB() an p values, an final ecision. Nature of the inicator function c AB() p Dialogue etection Aing Gaussian noise N(,.5) inepenently to both inicator functions an har limiting to [, ] correct Aing a consierable amount of silence between correct speaker turn points (here 33.3% of the average ialogue uration is silence). Aing a consierable amount of overlap between correct speaker activities (the overlap amounts to 33.3% of the average ialogue uration). Moeling between-speaker silence as a Gaussian ranom correct variable N(.5,.5) Moeling between-speaker silence as a uniform ranom variable correct Moeling between-speaker silence/music/noise as constant correct value of. 5. D. Arijon, Grammar of the Film Language. Silman-James Press, A. Vassiliou, A. Salway, an D.Pitt, Formalising stories: sequences of events an state changes, in Proc. 24 IEEE Int. Conf. Multimeia an Expo, vol. I, pp , Hong- Kong, Taiwan G. Iyengal, H. J. Nock, an C. Neti, Auio-visual synchrony for etection of monologues in vieo archives, in Proc. 23 IEEE lnt. Conf. Acoustics, Speech, an Signal Processing, vol. I, pp , April 23, Hong Kong. 8. K. Sobottka an I.Pitas, A novel metho for automatic face segmentation, facial feature extraction an tracking, Image Communication an Signal Processing, vol. 2, no. 3, pp , June M. Kotti, E. Benetos, an C. Kotropoulos, Automatic speaker change etection with the bayesian information criterion using MPEG-7 features an a fusion scheme, in Proc. 26 IEEE Int. Symp. Circuits an Systems, May 26, Kos, Greece.. L. Lu an H. Zhang, Speaker change etection an tracking in real-time news broacast analysis, in Proc. 24 IEEE Int. Conf. Acoustics, Speech, an Signal Processing, vol. I, pp , June 24.. A. Papoulis an S. V. Pillai, Probabilities, Ranom Variables, an Stochastic Processes, 4/e. N.Y.: McGraw-Hill, F. Jelinek, Statistical Methos for Speech Recognition. Cambrige, Massachusetts: The MIT Press, R. J. Boys an D. A. Henerson, A Bayesian approach to DNA sequence segmetation, in Proc. 24 Biometrics, vol. 6, no 3, pp. 573, September 24.
City, University of London Institutional Repository
City Research Online City, University of London Institutional Repository Citation: Kotti, M, Benetos, E., Kotropoulos, C. & Pitas, I (27). A neural network approach to audio-assisted movie dialogue detection.
More informationOnline Appendix to: Generalizing Database Forensics
Online Appenix to: Generalizing Database Forensics KYRIACOS E. PAVLOU an RICHARD T. SNODGRASS, University of Arizona This appenix presents a step-by-step iscussion of the forensic analysis protocol that
More informationCoupling the User Interfaces of a Multiuser Program
Coupling the User Interfaces of a Multiuser Program PRASUN DEWAN University of North Carolina at Chapel Hill RAJIV CHOUDHARY Intel Corporation We have evelope a new moel for coupling the user-interfaces
More informationImage Segmentation using K-means clustering and Thresholding
Image Segmentation using Kmeans clustering an Thresholing Preeti Panwar 1, Girhar Gopal 2, Rakesh Kumar 3 1M.Tech Stuent, Department of Computer Science & Applications, Kurukshetra University, Kurukshetra,
More informationClassifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means
Classifying Facial Expression with Raial Basis Function Networks, using Graient Descent an K-means Neil Allrin Department of Computer Science University of California, San Diego La Jolla, CA 9237 nallrin@cs.ucs.eu
More informationBayesian localization microscopy reveals nanoscale podosome dynamics
Nature Methos Bayesian localization microscopy reveals nanoscale poosome ynamics Susan Cox, Ewar Rosten, James Monypenny, Tijana Jovanovic-Talisman, Dylan T Burnette, Jennifer Lippincott-Schwartz, Gareth
More informationTHE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE
БСУ Международна конференция - 2 THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE Evgeniya Nikolova, Veselina Jecheva Burgas Free University Abstract:
More informationA FUZZY FRAMEWORK FOR SEGMENTATION, FEATURE MATCHING AND RETRIEVAL OF BRAIN MR IMAGES
A FUZZY FRAMEWORK FOR SEGMENTATION, FEATURE MATCHING AND RETRIEVAL OF BRAIN MR IMAGES Archana.S 1 an Srihar.S 2 1 Department of Information Science an Technology, College of Engineering, Guiny archana.santhira@gmail.com
More informationNEW METHOD FOR FINDING A REFERENCE POINT IN FINGERPRINT IMAGES WITH THE USE OF THE IPAN99 ALGORITHM 1. INTRODUCTION 2.
JOURNAL OF MEDICAL INFORMATICS & TECHNOLOGIES Vol. 13/009, ISSN 164-6037 Krzysztof WRÓBEL, Rafał DOROZ * fingerprint, reference point, IPAN99 NEW METHOD FOR FINDING A REFERENCE POINT IN FINGERPRINT IMAGES
More informationA Classification of 3R Orthogonal Manipulators by the Topology of their Workspace
A Classification of R Orthogonal Manipulators by the Topology of their Workspace Maher aili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S.
More informationRandom Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation
DEIM Forum 2018 I4-4 Abstract Ranom Clustering for Multiple Sampling Units to Spee Up Run-time Sample Generation uzuru OKAJIMA an Koichi MARUAMA NEC Solution Innovators, Lt. 1-18-7 Shinkiba, Koto-ku, Tokyo,
More informationHandling missing values in kernel methods with application to microbiology data
an Machine Learning. Bruges (Belgium), 24-26 April 2013, i6oc.com publ., ISBN 978-2-87419-081-0. Available from http://www.i6oc.com/en/livre/?gcoi=28001100131010. Hanling missing values in kernel methos
More informationYet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien
Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama an Hayato Ohwaa Faculty of Sci. an Tech. Tokyo University of Science, 2641 Yamazaki, Noa-shi, CHIBA, 278-8510, Japan hiroyuki@rs.noa.tus.ac.jp,
More informationModifying ROC Curves to Incorporate Predicted Probabilities
Moifying ROC Curves to Incorporate Preicte Probabilities Cèsar Ferri DSIC, Universitat Politècnica e València Peter Flach Department of Computer Science, University of Bristol José Hernánez-Orallo DSIC,
More informationA Neural Network Model Based on Graph Matching and Annealing :Application to Hand-Written Digits Recognition
ITERATIOAL JOURAL OF MATHEMATICS AD COMPUTERS I SIMULATIO A eural etwork Moel Base on Graph Matching an Annealing :Application to Han-Written Digits Recognition Kyunghee Lee Abstract We present a neural
More informationQueueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks
Queueing Moel an Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Marc Aoun, Antonios Argyriou, Philips Research, Einhoven, 66AE, The Netherlans Department of Computer an Communication
More informationArchitecture Design of Mobile Access Coordinated Wireless Sensor Networks
Architecture Design of Mobile Access Coorinate Wireless Sensor Networks Mai Abelhakim 1 Leonar E. Lightfoot Jian Ren 1 Tongtong Li 1 1 Department of Electrical & Computer Engineering, Michigan State University,
More informationA Multi-scale Boosted Detector for Efficient and Robust Gesture Recognition
A Multi-scale Booste Detector for Efficient an Robust Gesture Recognition Camille Monnier, Stan German, Anrey Ost Charles River Analytics Cambrige, MA, USA Abstract. We present an approach to etecting
More informationOn Effectively Determining the Downlink-to-uplink Sub-frame Width Ratio for Mobile WiMAX Networks Using Spline Extrapolation
On Effectively Determining the Downlink-to-uplink Sub-frame With Ratio for Mobile WiMAX Networks Using Spline Extrapolation Panagiotis Sarigianniis, Member, IEEE, Member Malamati Louta, Member, IEEE, Member
More informationFast Window Based Stereo Matching for 3D Scene Reconstruction
The International Arab Journal of Information Technology, Vol. 0, No. 3, May 203 209 Fast Winow Base Stereo Matching for 3D Scene Reconstruction Mohamma Mozammel Chowhury an Mohamma AL-Amin Bhuiyan Department
More informationKinematic Analysis of a Family of 3R Manipulators
Kinematic Analysis of a Family of R Manipulators Maher Baili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S. 6597 1, rue e la Noë, BP 92101,
More informationEFFICIENT ON-LINE TESTING METHOD FOR A FLOATING-POINT ADDER
FFICINT ON-LIN TSTING MTHOD FOR A FLOATING-POINT ADDR A. Droz, M. Lobachev Department of Computer Systems, Oessa State Polytechnic University, Oessa, Ukraine Droz@ukr.net, Lobachev@ukr.net Abstract In
More informationMulti-camera tracking algorithm study based on information fusion
International Conference on Avance Electronic Science an Technolog (AEST 016) Multi-camera tracking algorithm stu base on information fusion a Guoqiang Wang, Shangfu Li an Xue Wen School of Electronic
More informationA shortest path algorithm in multimodal networks: a case study with time varying costs
A shortest path algorithm in multimoal networks: a case stuy with time varying costs Daniela Ambrosino*, Anna Sciomachen* * Department of Economics an Quantitative Methos (DIEM), University of Genoa Via
More informationObject Recognition Using Colour, Shape and Affine Invariant Ratios
Object Recognition Using Colour, Shape an Affine Invariant Ratios Paul A. Walcott Centre for Information Engineering City University, Lonon EC1V 0HB, Englan P.A.Walcott@city.ac.uk Abstract This paper escribes
More informationA Plane Tracker for AEC-automation Applications
A Plane Tracker for AEC-automation Applications Chen Feng *, an Vineet R. Kamat Department of Civil an Environmental Engineering, University of Michigan, Ann Arbor, USA * Corresponing author (cforrest@umich.eu)
More informationAIIA shot boundary detection at TRECVID 2006
AIIA shot boundary detection at TRECVID 6 Z. Černeková, N. Nikolaidis and I. Pitas Artificial Intelligence and Information Analysis Laboratory Department of Informatics Aristotle University of Thessaloniki
More informationNew Geometric Interpretation and Analytic Solution for Quadrilateral Reconstruction
New Geometric Interpretation an Analytic Solution for uarilateral Reconstruction Joo-Haeng Lee Convergence Technology Research Lab ETRI Daejeon, 305 777, KOREA Abstract A new geometric framework, calle
More informationCharacterizing Decoding Robustness under Parametric Channel Uncertainty
Characterizing Decoing Robustness uner Parametric Channel Uncertainty Jay D. Wierer, Wahee U. Bajwa, Nigel Boston, an Robert D. Nowak Abstract This paper characterizes the robustness of ecoing uner parametric
More informationMultimodal Stereo Image Registration for Pedestrian Detection
Multimoal Stereo Image Registration for Peestrian Detection Stephen Krotosky an Mohan Trivei Abstract This paper presents an approach for the registration of multimoal imagery for peestrian etection when
More informationParticle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 17, No 3 Sofia 017 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-017-0030 Particle Swarm Optimization Base
More informationA Convex Clustering-based Regularizer for Image Segmentation
Vision, Moeling, an Visualization (2015) D. Bommes, T. Ritschel an T. Schultz (Es.) A Convex Clustering-base Regularizer for Image Segmentation Benjamin Hell (TU Braunschweig), Marcus Magnor (TU Braunschweig)
More informationNon-homogeneous Generalization in Privacy Preserving Data Publishing
Non-homogeneous Generalization in Privacy Preserving Data Publishing W. K. Wong, Nios Mamoulis an Davi W. Cheung Department of Computer Science, The University of Hong Kong Pofulam Roa, Hong Kong {wwong2,nios,cheung}@cs.hu.h
More informationSoftware Reliability Modeling and Cost Estimation Incorporating Testing-Effort and Efficiency
Software Reliability Moeling an Cost Estimation Incorporating esting-effort an Efficiency Chin-Yu Huang, Jung-Hua Lo, Sy-Yen Kuo, an Michael R. Lyu -+ Department of Electrical Engineering Computer Science
More informationSMART IMAGE PROCESSING OF FLOW VISUALIZATION
SMAR IMAGE PROCESSING OF FLOW VISUALIZAION H Li (A Rinoshika) 1, M akei, M Nakano 1, Y Saito 3 an K Horii 4 1 Department of Mechanical Systems Engineering, Yamagata University, Yamagata 99-851, JAPAN Department
More informationThe Reconstruction of Graphs. Dhananjay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune , India. Abstract
The Reconstruction of Graphs Dhananay P. Mehenale Sir Parashurambhau College, Tila Roa, Pune-4030, Inia. Abstract In this paper we iscuss reconstruction problems for graphs. We evelop some new ieas lie
More informationLecture 1 September 4, 2013
CS 84r: Incentives an Information in Networks Fall 013 Prof. Yaron Singer Lecture 1 September 4, 013 Scribe: Bo Waggoner 1 Overview In this course we will try to evelop a mathematical unerstaning for the
More informationWLAN Indoor Positioning Based on Euclidean Distances and Fuzzy Logic
WLAN Inoor Positioning Base on Eucliean Distances an Fuzzy Logic Anreas TEUBER, Bern EISSFELLER Institute of Geoesy an Navigation, University FAF, Munich, Germany, e-mail: (anreas.teuber, bern.eissfeller)@unibw.e
More informationExercises of PIV. incomplete draft, version 0.0. October 2009
Exercises of PIV incomplete raft, version 0.0 October 2009 1 Images Images are signals efine in 2D or 3D omains. They can be vector value (e.g., color images), real (monocromatic images), complex or binary
More informationTexture Defect Detection System with Image Deflection Compensation
Texture Defect Detection System with Image Deflection Compensation CHUN-CHENG LIN CHENG-YU YEH Department of Electrical Engineering National Chin-Yi University of Technology 35, Lane 15, Sec. 1, Chungshan
More informationText Particles Multi-band Fusion for Robust Text Detection
Text Particles Multi-ban Fusion for Robust Text Detection Pengfei Xu, Rongrong Ji, Hongxun Yao, Xiaoshuai Sun, Tianqiang Liu, an Xianming Liu School of Computer Science an Engineering Harbin Institute
More informationAN INVESTIGATION OF FOCUSING AND ANGULAR TECHNIQUES FOR VOLUMETRIC IMAGES BY USING THE 2D CIRCULAR ULTRASONIC PHASED ARRAY
AN INVESTIGATION OF FOCUSING AND ANGULAR TECHNIQUES FOR VOLUMETRIC IMAGES BY USING THE D CIRCULAR ULTRASONIC PHASED ARRAY S. Monal Lonon South Bank University; Engineering an Design 103 Borough Roa, Lonon
More informationFeature Extraction and Rule Classification Algorithm of Digital Mammography based on Rough Set Theory
Feature Extraction an Rule Classification Algorithm of Digital Mammography base on Rough Set Theory Aboul Ella Hassanien Jafar M. H. Ali. Kuwait University, Faculty of Aministrative Science, Quantitative
More informationRough Set Approach for Classification of Breast Cancer Mammogram Images
Rough Set Approach for Classification of Breast Cancer Mammogram Images Aboul Ella Hassanien Jafar M. H. Ali. Kuwait University, Faculty of Aministrative Science, Quantitative Methos an Information Systems
More informationRobust Camera Calibration for an Autonomous Underwater Vehicle
obust Camera Calibration for an Autonomous Unerwater Vehicle Matthew Bryant, Davi Wettergreen *, Samer Aballah, Alexaner Zelinsky obotic Systems Laboratory Department of Engineering, FEIT Department of
More informationAn Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources
An Algorithm for Builing an Enterprise Network Topology Using Wiesprea Data Sources Anton Anreev, Iurii Bogoiavlenskii Petrozavosk State University Petrozavosk, Russia {anreev, ybgv}@cs.petrsu.ru Abstract
More informationMANJUSHA K.*, ANAND KUMAR M., SOMAN K. P.
Journal of Engineering Science an echnology Vol. 13, No. 1 (2018) 141-157 School of Engineering, aylor s University IMPLEMENAION OF REJECION SRAEGIES INSIDE MALAYALAM CHARACER RECOGNIION SYSEM BASED ON
More informationVideo-based Characters Creating New Human Performances from a Multi-view Video Database
Vieo-base Characters Creating New Human Performances from a Multi-view Vieo Database Feng Xu Yebin Liu? Carsten Stoll? James Tompkin Gaurav Bharaj? Qionghai Dai Hans-Peter Seiel? Jan Kautz Christian Theobalt?
More informationMultilevel Linear Dimensionality Reduction using Hypergraphs for Data Analysis
Multilevel Linear Dimensionality Reuction using Hypergraphs for Data Analysis Haw-ren Fang Department of Computer Science an Engineering University of Minnesota; Minneapolis, MN 55455 hrfang@csumneu ABSTRACT
More informationPolitehnica University of Timisoara Mobile Computing, Sensors Network and Embedded Systems Laboratory. Testing Techniques
Politehnica University of Timisoara Mobile Computing, Sensors Network an Embee Systems Laboratory ing Techniques What is testing? ing is the process of emonstrating that errors are not present. The purpose
More informationLearning Subproblem Complexities in Distributed Branch and Bound
Learning Subproblem Complexities in Distribute Branch an Boun Lars Otten Department of Computer Science University of California, Irvine lotten@ics.uci.eu Rina Dechter Department of Computer Science University
More informationEXACT SIMULATION OF A BOOLEAN MODEL
Original Research Paper oi:10.5566/ias.v32.p101-105 EXACT SIMULATION OF A BOOLEAN MODEL CHRISTIAN LANTUÉJOULB MinesParisTech 35 rue Saint-Honoré 77305 Fontainebleau France e-mail: christian.lantuejoul@mines-paristech.fr
More informationEstimating Velocity Fields on a Freeway from Low Resolution Video
Estimating Velocity Fiels on a Freeway from Low Resolution Vieo Young Cho Department of Statistics University of California, Berkeley Berkeley, CA 94720-3860 Email: young@stat.berkeley.eu John Rice Department
More informationUsing Vector and Raster-Based Techniques in Categorical Map Generalization
Thir ICA Workshop on Progress in Automate Map Generalization, Ottawa, 12-14 August 1999 1 Using Vector an Raster-Base Techniques in Categorical Map Generalization Beat Peter an Robert Weibel Department
More informationA Block-Based Blind Source Separation Approach With Equilateral Triangular Microphone Array
APSIPA ASC 2011 Xi an A Block-Base Blin Source Separation Approach With Equilateral Triangular Microphone Array Jian Zhang, Zhonghua Fu an Lei Xie Shaanxi Provincial Key Laboratory of Speech an Image Information
More informationCAMERAS AND GRAVITY: ESTIMATING PLANAR OBJECT ORIENTATION. Zhaoyin Jia, Andrew Gallagher, Tsuhan Chen
CAMERAS AND GRAVITY: ESTIMATING PLANAR OBJECT ORIENTATION Zhaoyin Jia, Anrew Gallagher, Tsuhan Chen School of Electrical an Computer Engineering, Cornell University ABSTRACT Photography on a mobile camera
More informationProperties of the Derivative Lecture 9.
Properties of the Derivative Lecture 9. Recall that the average rate of change of a function y = f(x) over the interval from a to a + h, with h 0, is the slope of the line between y x f(a + h) f(a) =,
More informationSupporting Fully Adaptive Routing in InfiniBand Networks
XIV JORNADAS DE PARALELISMO - LEGANES, SEPTIEMBRE 200 1 Supporting Fully Aaptive Routing in InfiniBan Networks J.C. Martínez, J. Flich, A. Robles, P. López an J. Duato Resumen InfiniBan is a new stanar
More informationDigital Logic Design. Midterm #1
The University of Toleo f7ms_il7.fm - EES: Digital Logic Design Stuent Name_ Digital Logic Design Miterm # Problems Points. 3. 4 3. 6 4. Total 5 Was the eam fair? yes no //7 The University of Toleo f7ms_il7.fm
More informationDigital Logic Design. Midterm #1
The University of Toleo s7ms_il7.fm - EECS: igital Logic esign r. nthony. Johnson Stuent Name_ igital Logic esign Miterm # Problems Points. 3. 4 3. 6 4. Total 5 Was the eam fair? yes no /6/7 The University
More informationRefinement of scene depth from stereo camera ego-motion parameters
Refinement of scene epth from stereo camera ego-motion parameters Piotr Skulimowski, Pawel Strumillo An algorithm for refinement of isparity (epth) map from stereoscopic sequences is propose. The metho
More informationA Revised Simplex Search Procedure for Stochastic Simulation Response Surface Optimization
272 INFORMS Journal on Computing 0899-1499 100 1204-0272 $05.00 Vol. 12, No. 4, Fall 2000 2000 INFORMS A Revise Simplex Search Proceure for Stochastic Simulation Response Surface Optimization DAVID G.
More informationFast Fractal Image Compression using PSO Based Optimization Techniques
Fast Fractal Compression using PSO Base Optimization Techniques A.Krishnamoorthy Visiting faculty Department Of ECE University College of Engineering panruti rishpci89@gmail.com S.Buvaneswari Visiting
More informationAnyTraffic Labeled Routing
AnyTraffic Labele Routing Dimitri Papaimitriou 1, Pero Peroso 2, Davie Careglio 2 1 Alcatel-Lucent Bell, Antwerp, Belgium Email: imitri.papaimitriou@alcatel-lucent.com 2 Universitat Politècnica e Catalunya,
More informationAn Investigation in the Use of Vehicle Reidentification for Deriving Travel Time and Travel Time Distributions
An Investigation in the Use of Vehicle Reientification for Deriving Travel Time an Travel Time Distributions Carlos Sun Department of Civil an Environmental Engineering, University of Missouri-Columbia,
More informationThe Journal of Systems and Software
The Journal of Systems an Software 83 (010) 1864 187 Contents lists available at ScienceDirect The Journal of Systems an Software journal homepage: www.elsevier.com/locate/jss Embeing capacity raising
More informationState Indexed Policy Search by Dynamic Programming. Abstract. 1. Introduction. 2. System parameterization. Charles DuHadway
State Inexe Policy Search by Dynamic Programming Charles DuHaway Yi Gu 5435537 503372 December 4, 2007 Abstract We consier the reinforcement learning problem of simultaneous trajectory-following an obstacle
More informationA Comparative Evaluation of Iris and Ocular Recognition Methods on Challenging Ocular Images
A Comparative Evaluation of Iris an Ocular Recognition Methos on Challenging Ocular Images Vishnu Naresh Boeti Carnegie Mellon University Pittsburgh, PA 523 naresh@cmu.eu Jonathon M Smereka Carnegie Mellon
More informationOn the Role of Multiply Sectioned Bayesian Networks to Cooperative Multiagent Systems
On the Role of Multiply Sectione Bayesian Networks to Cooperative Multiagent Systems Y. Xiang University of Guelph, Canaa, yxiang@cis.uoguelph.ca V. Lesser University of Massachusetts at Amherst, USA,
More informationA Versatile Model-Based Visibility Measure for Geometric Primitives
A Versatile Moel-Base Visibility Measure for Geometric Primitives Marc M. Ellenrieer 1,LarsKrüger 1, Dirk Stößel 2, an Marc Hanheie 2 1 DaimlerChrysler AG, Research & Technology, 89013 Ulm, Germany 2 Faculty
More informationInuence of Cross-Interferences on Blocked Loops: to know the precise gain brought by blocking. It is even dicult to determine for which problem
Inuence of Cross-Interferences on Blocke Loops A Case Stuy with Matrix-Vector Multiply CHRISTINE FRICKER INRIA, France an OLIVIER TEMAM an WILLIAM JALBY University of Versailles, France State-of-the art
More informationEDOVE: Energy and Depth Variance-Based Opportunistic Void Avoidance Scheme for Underwater Acoustic Sensor Networks
sensors Article EDOVE: Energy an Depth Variance-Base Opportunistic Voi Avoiance Scheme for Unerwater Acoustic Sensor Networks Safar Hussain Bouk 1, *, Sye Hassan Ahme 2, Kyung-Joon Park 1 an Yongsoon Eun
More informationCONTENT-BASED RETRIEVAL OF DEFECT IMAGES. Jukka Iivarinen and Jussi Pakkanen
Proceeings of ACIVS 2002 (Avance Concepts for Intelligent Vision Systems), Ghent, Belgium, September 9-11, 2002 CONTENT-BASED RETRIEVAL OF DEFECT IMAGES Jukka Iivarinen an Jussi Pakkanen jukka.iivarinen@hut.fi,
More informationAlmost Disjunct Codes in Large Scale Multihop Wireless Network Media Access Control
Almost Disjunct Coes in Large Scale Multihop Wireless Network Meia Access Control D. Charles Engelhart Anan Sivasubramaniam Penn. State University University Park PA 682 engelhar,anan @cse.psu.eu Abstract
More informationDense Disparity Estimation in Ego-motion Reduced Search Space
Dense Disparity Estimation in Ego-motion Reuce Search Space Luka Fućek, Ivan Marković, Igor Cvišić, Ivan Petrović University of Zagreb, Faculty of Electrical Engineering an Computing, Croatia (e-mail:
More informationShift-map Image Registration
Shift-map Image Registration Linus Svärm Petter Stranmark Centre for Mathematical Sciences, Lun University {linus,petter}@maths.lth.se Abstract Shift-map image processing is a new framework base on energy
More informationd 3 d 4 d d d d d d d d d d d 1 d d d d d d
Proceeings of the IASTED International Conference Software Engineering an Applications (SEA') October 6-, 1, Scottsale, Arizona, USA AN OBJECT-ORIENTED APPROACH FOR MANAGING A NETWORK OF DATABASES Shu-Ching
More informationSkyline Community Search in Multi-valued Networks
Syline Community Search in Multi-value Networs Rong-Hua Li Beijing Institute of Technology Beijing, China lironghuascut@gmail.com Jeffrey Xu Yu Chinese University of Hong Kong Hong Kong, China yu@se.cuh.eu.h
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
TR-IIS-05-021 Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu, Pangfeng Liu, Da-Wei Wang, Jan-Jan Wu December 2005 Technical Report No. TR-IIS-05-021 http://www.iis.sinica.eu.tw/lib/techreport/tr2005/tr05.html
More informationDiscrete Markov Image Modeling and Inference on the Quadtree
390 IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 9, NO. 3, MARCH 2000 Discrete Markov Image Moeling an Inference on the Quatree Jean-Marc Laferté, Patrick Pérez, an Fabrice Heitz Abstract Noncasual Markov
More informationEstimation of large-amplitude motion and disparity fields: Application to intermediate view reconstruction
c 2000 SPIE. Personal use of this material is permitte. However, permission to reprint/republish this material for avertising or promotional purposes or for creating new collective works for resale or
More informationVision-based Multi-Robot Simultaneous Localization and Mapping
Vision-base Multi-Robot Simultaneous Localization an Mapping Hassan Hajjiab an Robert Laganière VIVA Research Lab School of Information Technology an Engineering University of Ottawa, Ottawa, Canaa, K1N
More informationDesign of Controller for Crawling to Sitting Behavior of Infants
Design of Controller for Crawling to Sitting Behavior of Infants A Report submitte for the Semester Project To be accepte on: 29 June 2007 by Neha Priyaarshini Garg Supervisors: Luovic Righetti Prof. Auke
More informationA Discrete Search Method for Multi-modal Non-Rigid Image Registration
A Discrete Search Metho for Multi-moal on-rigi Image Registration Alexaner Shekhovtsov Juan D. García-Arteaga Tomáš Werner Center for Machine Perception, Dept. of Cybernetics Faculty of Electrical Engineering,
More informationLearning convex bodies is hard
Learning convex boies is har Navin Goyal Microsoft Research Inia navingo@microsoftcom Luis Raemacher Georgia Tech lraemac@ccgatecheu Abstract We show that learning a convex boy in R, given ranom samples
More informationResearch Article Research on Law s Mask Texture Analysis System Reliability
Research Journal of Applie Sciences, Engineering an Technology 7(19): 4002-4007, 2014 DOI:10.19026/rjaset.7.761 ISSN: 2040-7459; e-issn: 2040-7467 2014 Maxwell Scientific Publication Corp. Submitte: November
More informationFuzzy Clustering in Parallel Universes
Fuzzy Clustering in Parallel Universes Bern Wisweel an Michael R. Berthol ALTANA-Chair for Bioinformatics an Information Mining Department of Computer an Information Science, University of Konstanz 78457
More informationMessage Transport With The User Datagram Protocol
Message Transport With The User Datagram Protocol User Datagram Protocol (UDP) Use During startup For VoIP an some vieo applications Accounts for less than 10% of Internet traffic Blocke by some ISPs Computer
More information4.2 Implicit Differentiation
6 Chapter 4 More Derivatives 4. Implicit Differentiation What ou will learn about... Implicitl Define Functions Lenses, Tangents, an Normal Lines Derivatives of Higher Orer Rational Powers of Differentiable
More information0607 CAMBRIDGE INTERNATIONAL MATHEMATICS
CAMBRIDGE INTERNATIONAL EXAMINATIONS International General Certificate of Seconary Eucation MARK SCHEME for the May/June 03 series 0607 CAMBRIDGE INTERNATIONAL MATHEMATICS 0607/4 Paper 4 (Extene), maximum
More information0607 CAMBRIDGE INTERNATIONAL MATHEMATICS
PAPA CAMBRIDGE CAMBRIDGE INTERNATIONAL EXAMINATIONS International General Certificate of Seconary Eucation MARK SCHEME for the May/June 0 series CAMBRIDGE INTERNATIONAL MATHEMATICS /4 4 (Extene), maximum
More informationEXTRACTION OF MAIN AND SECONDARY ROADS IN VHR IMAGES USING A HIGHER-ORDER PHASE FIELD MODEL
EXTRACTION OF MAIN AND SECONDARY ROADS IN VHR IMAGES USING A HIGHER-ORDER PHASE FIELD MODEL Ting Peng a,b, Ian H. Jermyn b, Véronique Prinet a, Josiane Zerubia b a LIAMA & PR, Institute of Automation,
More informationComputer Organization
Computer Organization Douglas Comer Computer Science Department Purue University 250 N. University Street West Lafayette, IN 47907-2066 http://www.cs.purue.eu/people/comer Copyright 2006. All rights reserve.
More informationStudy of Network Optimization Method Based on ACL
Available online at www.scienceirect.com Proceia Engineering 5 (20) 3959 3963 Avance in Control Engineering an Information Science Stuy of Network Optimization Metho Base on ACL Liu Zhian * Department
More informationParticle Swarm Optimization with Time-Varying Acceleration Coefficients Based on Cellular Neural Network for Color Image Noise Cancellation
Particle Swarm Optimization with Time-Varying Acceleration Coefficients Base on Cellular Neural Network for Color Image Noise Cancellation Te-Jen Su Jui-Chuan Cheng Yang-De Sun 3 College of Information
More informationMORA: a Movement-Based Routing Algorithm for Vehicle Ad Hoc Networks
: a Movement-Base Routing Algorithm for Vehicle A Hoc Networks Fabrizio Granelli, Senior Member, Giulia Boato, Member, an Dzmitry Kliazovich, Stuent Member Abstract Recent interest in car-to-car communications
More informationCS 106 Winter 2016 Craig S. Kaplan. Module 01 Processing Recap. Topics
CS 106 Winter 2016 Craig S. Kaplan Moule 01 Processing Recap Topics The basic parts of speech in a Processing program Scope Review of syntax for classes an objects Reaings Your CS 105 notes Learning Processing,
More informationWaleed K. Al-Assadi. Anura P. Jayasumana. Yashwant K. Malaiya y. February Colorado State University
Dierential I DDQ Testable Static RAM Architecture Walee K. Al-Assai Anura P. Jayasumana Yashwant K. Malaiya y Technical Report CS-96-102 February 1996 Department of Electrical Engineering/ y Department
More informationChapter 5 Proposed models for reconstituting/ adapting three stereoscopes
Chapter 5 Propose moels for reconstituting/ aapting three stereoscopes - 89 - 5. Propose moels for reconstituting/aapting three stereoscopes This chapter offers three contributions in the Stereoscopy area,
More informationFrequency Domain Parameter Estimation of a Synchronous Generator Using Bi-objective Genetic Algorithms
Proceeings of the 7th WSEAS International Conference on Simulation, Moelling an Optimization, Beijing, China, September 15-17, 2007 429 Frequenc Domain Parameter Estimation of a Snchronous Generator Using
More information