{"title":"Forward error correction techniques suitable for the utilization in the PLC technology","authors":"Stanislav Dlhá, Fei Stu Bratislava","doi":"10.1109/IWSSIP.2008.4604362","DOIUrl":"https://doi.org/10.1109/IWSSIP.2008.4604362","url":null,"abstract":"Todaypsilas PLC systems are mostly limited in transmission speeds to several kilobits per seconds. Such speeds are certainly not sufficient for running popular services like a broadband Internet, a teleworking or the Video on Demand. This fact is reducing a chance of the PLC technologypsilas deployment in a wide range. One way how to overcome this problem could be in introduction of optimal errors correcting techniques into the PLC technology. In this contribution, different types of coding techniques are discussed, including RS, Turbo or Convolutional codes. Theoretical analyses are focused on their positive and negative features visible in case of their deployment in the PLC transmission environment. Special attention is pointed to their robustness against noises, which is analyzed also practically in form of the simulations. Analyses and simulations are done for individual codes as well as combination of codes.","PeriodicalId":322045,"journal":{"name":"2008 15th International Conference on Systems, Signals and Image Processing","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115359480","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":"Correlation optimized scanning of segmented images","authors":"R. Pračko, J. Polec","doi":"10.1109/IWSSIP.2008.4604354","DOIUrl":"https://doi.org/10.1109/IWSSIP.2008.4604354","url":null,"abstract":"Submitted paper deals with scanning of segmented gray-scale images using two-dimensional space filling curves. A new image processing approach based on image segmentation and correlation optimization of space-filling curves is presented. The concatenation of resulting individual segments 1-dimensional representation provides higher adjacent pixel similarity than the 1-dimensional representation of the original image. The final segments concatenated 1-dimensional representation can provide improved base for applying lossless or lossy compression methods, such as the entropic coding or predictive coding respectively. The paper analyses the adjacent pixel differences in the final 1-dimensional image representations gained using the traditional and the proposed scanning method from the entropy and prediction gain point of view to indicate the applicability of the described approach.","PeriodicalId":322045,"journal":{"name":"2008 15th International Conference on Systems, Signals and Image Processing","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115671671","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":"Image registration based on physical forces","authors":"A. Sadri, A. Beheshti","doi":"10.1109/IWSSIP.2008.4604402","DOIUrl":"https://doi.org/10.1109/IWSSIP.2008.4604402","url":null,"abstract":"In this paper, we proposed a new method for image registration which the registration parameters are translation and rotation. This method is based on physical forces. A unique feature of the proposed method is that it assumes images like charged materials that attract each other. We can also assume one of the images like a hole and another one like a material that fill the hole. In both cases one of the images moves in the same direction as the applied force and the other one is still. It moves consequently until the resultant force is equal to zero. This approach does not estimate these parameters separately. They are estimated simultaneously leading to a better optimized set of registration parameters. We compute the order of this algorithm on 2D and 3D Images. We show that the approach is successful and yields to better results than MI and correlation-like methods.","PeriodicalId":322045,"journal":{"name":"2008 15th International Conference on Systems, Signals and Image Processing","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115683311","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":"Analysis of HARQ schemes using Reed-Solomon codes","authors":"K. Kotuliaková, J. Polec","doi":"10.1109/IWSSIP.2008.4604432","DOIUrl":"https://doi.org/10.1109/IWSSIP.2008.4604432","url":null,"abstract":"Presented paper deals with the problem of using ARQ (automatic repeat request) schemes. In particular, we focus on the subset of hybrid ARQ methods. We analyse the throughput performance of pure and hybrid ARQ techniques, further on we present the throughput analysis of hybrid ARQ schemes in binary symmetric channel (BSC) and land mobile satellite (LMS) channel environment based on simulation results. Forward error correction (FEC) used in hybrid ARQ schemes is provided by Reed-Solomon (RS) codes.","PeriodicalId":322045,"journal":{"name":"2008 15th International Conference on Systems, Signals and Image Processing","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116887782","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":"Emulation of mobile payment system","authors":"J. Mohorko, A. Chowdhury, P. Planinsic","doi":"10.1109/IWSSIP.2008.4604357","DOIUrl":"https://doi.org/10.1109/IWSSIP.2008.4604357","url":null,"abstract":"Margento is a mobile payment system, enabling customers to purchase products from vending machines or in retail stores, using their mobile phones. It is designed to complement existing credit and debit card systems, by enabling all mobile phone users to turn their phones into the payment instruments of their choice. This system is based on Ultrapsilas patented mobile payment terminal using the one and only mature feature found with any of todaypsilas phones - voice. It is very important to ensure secure and stable operation of such a system, under various loading conditions. For these reasons, we designed the Margento emulator equipment as the tool, which enables functional testing, performance testing, load testing and stress testing, of the Margento system.","PeriodicalId":322045,"journal":{"name":"2008 15th International Conference on Systems, Signals and Image Processing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121242717","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 new adaptive Kalman filtering method for block-based motion estimation","authors":"Yi-Shiou Luo, M. Celenk","doi":"10.1109/IWSSIP.2008.4604374","DOIUrl":"https://doi.org/10.1109/IWSSIP.2008.4604374","url":null,"abstract":"This paper presents a new adaptive Kalman filtering method to improve the performance of block-based motion estimation. In our work, measured motion vectors are obtained by a conventional block-matching algorithm (BMA). A first order autoregressive model is employed to fit the motion correlation between neighboring blocks and then to achieve the predicted motion information. To further improve the performance, a new approach is proposed for adaptively adjust the state parameters of the Kalman filter during each filtering iteration according to the statistics of the motion vector (MV) measurements. The experimental results indicate the effectiveness of the proposed method in terms of peak-signal-to-noise-ratio (PSNR) of the motion compensated images with smoother motion vector fields. Furthermore, since the Kalman filtering is independent of motion estimation, it can be applied to any block matching motion estimation algorithm for performance improvement with little modification. Another benefit from the Kalman filtering is the fraction pixel accuracy of motion vectors with no additional bits to transmit for MV.","PeriodicalId":322045,"journal":{"name":"2008 15th International Conference on Systems, Signals and Image Processing","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127306648","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":"Optimum path forest classifier applied to laryngeal pathology detection","authors":"J. Papa, A. A. Spadotto, A. Falcão, J. Pereira","doi":"10.1109/IWSSIP.2008.4604414","DOIUrl":"https://doi.org/10.1109/IWSSIP.2008.4604414","url":null,"abstract":"Optimum path forest-based classifiers are a novel approach for supervised pattern recognition. The OPF classifier differs from traditional approaches by not estimating probability density functions of the classes neither assuming samples linearity, and creates a discrete optimal partition of the feature space, in which the decision boundary is obtained by the influence zones of the most representative samples of the training set. Due to the large number of applications in biomedical signal processing involving pattern recognition techniques, specially voice disorders identification, we propose here the laryngeal pathology detection by means of OPF. Experiments were performed in three public datasets against SVM, and a comparison in terms of accuracy rates and execution times was also regarded.","PeriodicalId":322045,"journal":{"name":"2008 15th International Conference on Systems, Signals and Image Processing","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127457344","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 new simple context lossless image coding algorithm based on adaptive context arithmetic coder","authors":"G. Ulacha, R. Stasinski","doi":"10.1109/IWSSIP.2008.4604363","DOIUrl":"https://doi.org/10.1109/IWSSIP.2008.4604363","url":null,"abstract":"In the paper an effective context based lossless coding technique is presented. Three principal and one auxiliary contexts are defined. Cumulated predictor error combining 8 bias estimators is calculated. An adaptive context arithmetic coder is introduced. It is shown experimentally that the new technique is time-effective while it outperforms the well known methods having reasonable time complexity, and is inferior only to extremely computationally complex ones.","PeriodicalId":322045,"journal":{"name":"2008 15th International Conference on Systems, Signals and Image Processing","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115543156","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}
D. Besiris, F. Fotopoulou, G. Economou, S. Fotopoulos
{"title":"Video summarization by a graph-theoretic FCM based algorithm","authors":"D. Besiris, F. Fotopoulou, G. Economou, S. Fotopoulos","doi":"10.1109/IWSSIP.2008.4604478","DOIUrl":"https://doi.org/10.1109/IWSSIP.2008.4604478","url":null,"abstract":"In this work, we propose a unified approach for video summarization based on the analysis of the video structure. The method originates from a data learning technique that uses the membership values produced by an over-partitioning mode of the FCM algorithm to find the connection strength between the resulting set of prototype centers. The final clustering stage is implemented by using the minimal spanning tree produced by the connectivity matrix. Based on the MST edge weights value, the clusters are derived straightforwardly and without supervision. The algorithm is finalized by the detection of video shots and the selection of key frames from each one. The method is evaluated by using objective and subjective criteria and its applicability to elongated video data set structures is very satisfactory.","PeriodicalId":322045,"journal":{"name":"2008 15th International Conference on Systems, Signals and Image Processing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129541453","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 residual modeling extension of HNM model for prosodic modification of Slovak speech","authors":"M. Nagy, G. Rozinaj","doi":"10.1109/IWSSIP.2008.4604464","DOIUrl":"https://doi.org/10.1109/IWSSIP.2008.4604464","url":null,"abstract":"This article describes an extension of HNM model used for prosodic modification of speech. HNM model represents speech signals as a sum of harmonic and noise part. The decomposition of speech signal into these two parts allows more natural sounding modifications of the signal. The parametric representation of speech provides a straightforward way of changing prosodic features of the speech. Our algorithm, as an addition to HNM, models a residual (difference between original and HNM modeled signal) of the speech signal by method that allows us to modify the whole speech signal in better quality.","PeriodicalId":322045,"journal":{"name":"2008 15th International Conference on Systems, Signals and Image Processing","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128203830","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}