{"title":"Occlusion artifact removal in video frame rate up-conversion","authors":"Burak Cizmeci, H. Ateş","doi":"10.1109/SIU.2009.5136386","DOIUrl":"https://doi.org/10.1109/SIU.2009.5136386","url":null,"abstract":"In the past, frame rate up-conversion (FRC) methods were commonly used in standards conversion. Today, FRC methods are used for digital video temporal resolution enhancement to improve the visual quality in large screen LCD and plasma TV sets. The increase in processing power of DSPs, FPGAs and ASICs enables high complexity algorithms in the design of FRC systems. In this paper, we propose a multi-stage motion vector (MV) post-processing algorithm with occlusion adaptive overlapped block motion compensation, which increases the temporal resolution without loss of spatial resolution and consistency. Hexagonal search block matching yields us unreliable MVs which are post-processed in the refinement stages in order to get a consistent MV field in spatial domain. Relations between neighboring MVs and the MV fields of 4 consecutive frames are utilized to detect occlusion regions. Overlapped Block Motion Compensation (OBMC) is adapted to these problematic regions in order to reduce artifacts due to occlusion. Compared to existing methods, the developed algorithm achieves FRC with reduced loss of spatial resolution and reduced amount of artifacts.","PeriodicalId":219938,"journal":{"name":"2009 IEEE 17th Signal Processing and Communications Applications Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132581278","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Expectation-Maximization type receiver for uplink of a hopping system with time sharing","authors":"G. Cam, Erdogan Aydin, N. Kabaoğlu","doi":"10.1109/SIU.2009.5136363","DOIUrl":"https://doi.org/10.1109/SIU.2009.5136363","url":null,"abstract":"In this work, Expectation-Maximization type receiver for uplink of an MC-CDMA system based on a time sharing hopped communication technique is proposed in order to cope with the multipath fading effect in a wireless communication system. In the proposed time-sharing hopped communication method, managing mechanism determines each user channel quality knowledge by controlling the quality of the channels between users and it. In order to present a higher quality transmission for the users with low quality channels, managing mechanism gives an opportunity to them to send their message over the users with high quality channels in time sharing mode. Thus, transmission quality for the users with low quality channel is improved. The performance of the proposed receiver, with/without hopping and with cooperative communication technique, is analysed for multipath flat fading channels by computer simulation, and results are presented.","PeriodicalId":219938,"journal":{"name":"2009 IEEE 17th Signal Processing and Communications Applications Conference","volume":"227 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133521985","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Decentralized random-field estimation under communication constraints","authors":"Murat Uney, M. Çetin","doi":"10.1109/SIU.2009.5136448","DOIUrl":"https://doi.org/10.1109/SIU.2009.5136448","url":null,"abstract":"We consider the problem of decentralized estimation of a random-field under communication constraints in a Bayesian setting. The underlying system is composed of sensor nodes which collect measurements due to random variables they are associated with and which can communicate through finite-rate channels in accordance with a directed acyclic topology. After receiving the incoming messages if any, each node evaluates its local rule given its measurement and these messages, producing an estimate as well as outgoing messages to child nodes. A rigorous problem definition is achieved by constraining the feasible set through this structure in order to optimize a Bayesian risk function that captures the costs due to both communications and estimation errors. We adopt an iterative solution through a Team Decision Theoretic treatment previously proposed for decentralized detection. However, for the estimation problem, the iterations contain expressions with integral operators that have no closed form solutions in general. We propose approximations to these expressions through Monte Carlo methods. The result is an approximate computational scheme for optimization of distributed estimation networks under communication constraints. In an example scenario, we increase the price of communications and present the degrading estimation performance of the converged rules.","PeriodicalId":219938,"journal":{"name":"2009 IEEE 17th Signal Processing and Communications Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133639921","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"3D object recognition by geometric hashing","authors":"Omer Eskizara, E. Akagunduz, ilkay Ulusoy","doi":"10.1109/SIU.2009.5136550","DOIUrl":"https://doi.org/10.1109/SIU.2009.5136550","url":null,"abstract":"Using transform invariant 3D fatures obtained from a database of 3D range images, geometric hashing is applied for the purpose of 3D object recognition. Mean (H) and Gaussian (K) curvature values within a scale-space of the surface is used. Since H and K values are used and a scale-space of the surface is constructed the method is independent of transformation and resolution. The method is tested on the Stuttgart 3D range image databe [1].","PeriodicalId":219938,"journal":{"name":"2009 IEEE 17th Signal Processing and Communications Applications Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132292127","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A theoretical analysis of feature fusion in Stacked Generalization","authors":"M. Ozay, Fatoş T. Yarman Vural","doi":"10.1109/SIU.2009.5136454","DOIUrl":"https://doi.org/10.1109/SIU.2009.5136454","url":null,"abstract":"In the present work, a theoretical framework in order to define the general performance of stacked generalization learning algorithm is developed. Analytical relationships between the performance of the Stacked Generalization classifier relative to the individual classifiers are constructed by the proposed theorems and the practical techniques are developed in order to optimize the performance of stacked generalization algorithm based on these relationships.","PeriodicalId":219938,"journal":{"name":"2009 IEEE 17th Signal Processing and Communications Applications Conference","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134331552","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Discrete wavelet transform based approach for current transformer saturation problem","authors":"O. Ozgonenel, E. Kılıç, U. K. Terzi","doi":"10.1109/SIU.2009.5136429","DOIUrl":"https://doi.org/10.1109/SIU.2009.5136429","url":null,"abstract":"This work is about the possible effects of protection devices and schemes during current transformer saturation. If current transformer specifications are not selected properly, saturation may occur and affect relay response or even fail to trip. Hence, the performance of the protection devices such as differential and impedance relays is mainly based on the operating condition of the current transformers. An accurate knowledge of current signal is essential for protection devices. In this paper, a different approach is represented for current transformer saturation problem. The proposed technique is based on the discrete wavelet transform. The energy levels of the detail coefficients after the transformation present distinctive features during current transformer saturation.","PeriodicalId":219938,"journal":{"name":"2009 IEEE 17th Signal Processing and Communications Applications Conference","volume":"552 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134359987","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Video content analysis using dominant sets","authors":"U. Sakarya, Z. Telatar","doi":"10.1109/SIU.2009.5136549","DOIUrl":"https://doi.org/10.1109/SIU.2009.5136549","url":null,"abstract":"In this paper, a graph-based method for video content analysis is proposed. The characteristics of the detected shots are investigated for news, commercial, animated cartoon, basketball and documentary videos and experimental studies are realized on these videos. The maximum clique on the weighted and undirected graph, which is constructed according to visual content, is tried being detected. It is inferred that specially in news and commercials, the proposed method can be used for temporal video segmentation.","PeriodicalId":219938,"journal":{"name":"2009 IEEE 17th Signal Processing and Communications Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130320506","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Score matrix optimization for quartz binding peptides using evolutionary strategy","authors":"Baris Senliol, Z. Cataltepe","doi":"10.1109/SIU.2009.5136414","DOIUrl":"https://doi.org/10.1109/SIU.2009.5136414","url":null,"abstract":"Finding new peptides that can bind to some inorganic materials with high affinity and specificity is an active research problem with many application areas ranging from medicine to electronics. While it is easier to design peptides in-silico, in-vitro testing of binding is a slow and expensive process. Peptides with similar structure usually have similar functions. Score matrices, such as Blosum, PAM and Gonnet are used to score amino acid replacements in alignment algorithms such as Needleman-Wunsch or Smith-Waterman which measure similarity between two sequences. These score matrices may not represent the frequency of amino-acids replacement for experimental data. Score matrices which are optimized for specific peptide class or function have an important effect on accurate classification of artificial or newly discovered peptides. In this paper, score matrices that are specific to quartz binding peptides are derived using an evolutionary strategy (ES) and performance of these matrices are compared with the Quartz I matrix of Oren et.al. (2007). Results show that the matrices which obtained from the ES have better performance than Quartz I matrix when TSS (total similarity score) is used as a performance measurement criterion. Using ES scoring matrices and TSS for classifying peptides as strong, moderate or weak has performed 30% better in terms of accuracy and 40% better in terms of the number of inversions of affinity ordering of peptides than Quartz I matrix.","PeriodicalId":219938,"journal":{"name":"2009 IEEE 17th Signal Processing and Communications Applications Conference","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115238153","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Resource allocation for OFDMA systems","authors":"C. Turgu, C. Toker","doi":"10.1109/SIU.2009.5136458","DOIUrl":"https://doi.org/10.1109/SIU.2009.5136458","url":null,"abstract":"In an OFDMA (Orthogonal Frequency Division Multiple Access) scenario in which the users of a multiuser system share the common channel simulataneously, the issue of allocating the shared channel resources (subcarrier and power) among the users is called the resource allocation problem. This problem, which is nonlinear due to its nature, also has a discrete structure. In this paper, a fast algorithm based on linear programming is proposed. The algorithm is composed of two phases. In the first one, the original integer programming problem is first linearized and then after relaxing the integer constraints a solution is obtained by the aid of the Simplex Algorithm. In the second phase, by exploiting the sub-carrier allocation obtained in first phase, bits are allocated to each user independently using the Greedy Algorithm. The simulation results have demonstrated that, the proposed algorithm can achieve a performance very close to that of the integer programming techniques while being significantly faster.","PeriodicalId":219938,"journal":{"name":"2009 IEEE 17th Signal Processing and Communications Applications Conference","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115906126","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Alignment based extraction of isolated signs from sign language videos","authors":"P. Santemiz, O. Aran, M. Saraçlar, L. Akarun","doi":"10.1109/SIU.2009.5136450","DOIUrl":"https://doi.org/10.1109/SIU.2009.5136450","url":null,"abstract":"This paper presents a method to extract isolated signs from continuous sign language videos. We use sequences that approximately contain the sign that we are interested in and align the sequences to find the exact start and end frames. We compare different feature extraction methods, different alignment methods, and assess the performance of our system on a database from Turkish sign language.","PeriodicalId":219938,"journal":{"name":"2009 IEEE 17th Signal Processing and Communications Applications Conference","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115454839","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}