{"title":"Front and back cover","authors":"B. Zovko-Cihlar, N. Behlilovic","doi":"10.1109/pacificvis.2011.5742395","DOIUrl":"https://doi.org/10.1109/pacificvis.2011.5742395","url":null,"abstract":"","PeriodicalId":300049,"journal":{"name":"2011 18th International Conference on Systems, Signals and Image Processing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127824647","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 generalization of quad-trees applied to shape coding","authors":"R. Kutil","doi":"10.3233/ICA-2012-0405","DOIUrl":"https://doi.org/10.3233/ICA-2012-0405","url":null,"abstract":"Quad-trees are restricted to combined horizontal and vertical decomposition of tiles. If this restriction is dropped, anisotropic rectangular tiles result which can be arranged in a previously developed graph structure called “bush”. A new tiling algorithm is able to reduce the number of tiles by a factor of about two. Together with an existing efficient coding scheme for this graph, a lossless coding algorithm for bi-level and indexed color images is developed. It is compared to JBIG2 and PNG, and turns out to be efficient for situations with large uniform regions and high color payload.","PeriodicalId":300049,"journal":{"name":"2011 18th International Conference on Systems, Signals and Image Processing","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132294540","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":"Reconstruction of occluded facial images using asymmetrical Principal Component Analysis","authors":"Mohammad Al-Naser, Ulrik Söderström","doi":"10.3233/ICA-2012-0406","DOIUrl":"https://doi.org/10.3233/ICA-2012-0406","url":null,"abstract":"When face images are occluded it becomes difficult or impossible to make a correct recognition based on only the non-occluded parts. With asymmetrical Principal Component Analysis (aPCA) it is possible to estimate occluded regions based on the content of the non-occluded pixels. Entire faces can be reconstructed from images where some parts are occluded with the occluded region being estimated based on the relation to the non-occluded region. We show the result with 3 different occlusion cases and compare two reconstruction methods. The results are measured both objectively and subjectively and it is shown that a clear and sharp image part should be used even if the resulting image have edges in it.","PeriodicalId":300049,"journal":{"name":"2011 18th International Conference on Systems, Signals and Image Processing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116184978","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}