Yang-Ta Kao, T. Shih, Hsing-Ying Zhong, Ben C. Tsai, Wen-Ju Tsai
{"title":"Defects Detection on Aged Films","authors":"Yang-Ta Kao, T. Shih, Hsing-Ying Zhong, Ben C. Tsai, Wen-Ju Tsai","doi":"10.1109/SITIS.2007.66","DOIUrl":"https://doi.org/10.1109/SITIS.2007.66","url":null,"abstract":"Aged motion pictures may contain different types of defects, such as spikes and scratch lines. Each type of defect has its different properties. It is relatively hard to precisely detect these defects on aged films by using only a single solution. This paper proposes two techniques to detect spikes and scratch lines on aged films. The results of defect detection have good accuracy as compared to two well-known approaches. Application of our technique can be used in the recovery of damaged aged films.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121575274","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}
Radhouane Guermazi, Mohamed Hammami, A. B. Hamadou
{"title":"Using a Semi-automatic Keyword Dictionary for Improving Violent Web Site Filtering","authors":"Radhouane Guermazi, Mohamed Hammami, A. B. Hamadou","doi":"10.1109/SITIS.2007.137","DOIUrl":"https://doi.org/10.1109/SITIS.2007.137","url":null,"abstract":"The development of the Web has been paralleled by the emergence of harmful Web pages content such as pornography, violence, racism,etc.This emergence involved the necessity of providing filtering systems designed to secure the internet access. In this paper, we propose a violent Web content detection and filtering system called \"WebAngels filter\" which uses textual and structural content-based analysis. These analysis are based on a violent keyword dictionary. We focus our attention on the keyword dictionary preparation, and we demonstrate that a semi-automatic keyword dictionary can be used to improve the filtering efficiency of violent Web pages.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122495808","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":"FPGA-Based Quadrature Mirror Filters for DSP Applications","authors":"A. Al-Haj","doi":"10.1109/SITIS.2007.90","DOIUrl":"https://doi.org/10.1109/SITIS.2007.90","url":null,"abstract":"One of the most efficient multi-rate digital signal decomposition structures is the quadrature mirror filter (QMF) bank.It has been used successfully to implement subband coding applications such as speech coding and image compression. In this paper, we report on several efficient FPGA-based implementations of the basic quadrature mirror filter bank. The implementations are based on transforming the basic filter bank structure using ployphase decomposition and distributed arithmetic techniques. The two techniques reduce computational time dramatically by enabling maximum exploitation of the ample parallelism inherent in the filter bank. Performance results demonstrate the effectiveness of FPGA implementations of ployphase and distributed arithmetic quadrature mirror filter bank.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130247109","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":"Statistical Filtering of Raster Map Images Using a Context Tree Model","authors":"A. Podlasov, P. Kopylov, P. Fränti","doi":"10.1109/SITIS.2007.121","DOIUrl":"https://doi.org/10.1109/SITIS.2007.121","url":null,"abstract":"We propose a statistical filter using a context tree modeling. The idea of context tree is to perform selective context expansion including only those pixel combinations that really appear in the image. This makes it possible to use much larger spatial neighborhood. The proposed context tree filtering is evaluated for a set of indexed-color raster map images corrupted with generated impulsive and content-dependent noise. The objective evaluation shows improvement of 15% for content-dependent noise and up to 30% for impulsive noise comparing to the closest competitor. Visual comparisons show that the spatial structures are preserved better than by vector median, morphological and peer group averaging filter.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121826422","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}
Soudeh Kasiri Bidhendi, A. S. Shirazi, Narges Fotoohi, M. Ebadzadeh
{"title":"Material Classification of Hyperspectral Images Using Unsupervised Fuzzy Clustering Methods","authors":"Soudeh Kasiri Bidhendi, A. S. Shirazi, Narges Fotoohi, M. Ebadzadeh","doi":"10.1109/SITIS.2007.113","DOIUrl":"https://doi.org/10.1109/SITIS.2007.113","url":null,"abstract":"This paper presents a novel approach in classifying materials in Hyperspectral images. In particular, unlike other similar approaches in which every pixel in the image is mapped to one of the reference spectra, the proposed methods use the data itself to create clusters of pixels with the same material. This is done by using unsupervised fuzzy clustering methods. Here, two fuzzy clustering approaches have been addressed: Fuzzy C-Means clustering (FCM) and fuzzy relational clustering (FRC). The proposed methods can also solve the problem of identifying the objects for which the radiance of light makes it barely hard to identify them as a single object e.g., a pitched roof. The proposed methods have been applied on the CASI image and the results show that they can successfully classify the materials in the image.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121863792","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":"Lossless Information Hiding Scheme Based on Pixels Complexity Analysis","authors":"T. Lu, Cheng-Chun Huang","doi":"10.1109/SITIS.2007.60","DOIUrl":"https://doi.org/10.1109/SITIS.2007.60","url":null,"abstract":"This paper proposes an effective lossless information hiding scheme, in which a host image is quantized firstly to generate spare spaces for hiding secret messages. The proposed scheme applies the complexity analysis of neighboring pixels to predict the number of secret message bits concealed in a pixel. In addition, it reserves the differences between the host image and the quantized image for completely restoring the host image. According to the experimental results, the information capacity of the proposed scheme is 0.9 bpp for the standard Lena while that of Maniccam and Bourbakispsilas scheme is 0.3 bpp.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126658520","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":"Texture Synthesis for Digital Restoration in the Bit-Plane Representation","authors":"E. Ardizzone, H. Dindo, G. Mazzola","doi":"10.1109/SITIS.2007.84","DOIUrl":"https://doi.org/10.1109/SITIS.2007.84","url":null,"abstract":"In this paper we propose a new approach to handle the problem of restoration of grayscale textured images. The purpose is to recovery missing data of a damaged area. The key point is to decompose an image in its bit-planes, and to process bits rather than pixels. We propose two texture synthesis methods for restoration. The first one is a random generation process, based on the conditional probability of bits in the bit-planes. It is designed for images with stochastic textures. The second one is a best-matching method, running on each bit-plane, that is well suited to synthesize periodic patterns. Results are compared with a state-of-the-art restoration algorithm.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127831530","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":"Interactive Mining of Functional MRI Data","authors":"J. Korczak","doi":"10.1109/SITIS.2007.151","DOIUrl":"https://doi.org/10.1109/SITIS.2007.151","url":null,"abstract":"Discovery of the image voxels of the brain that represent real activity is, in general, very difficult because of a weak signal-to-noise ratio and the presence of artifacts. The first tests of the classical data mining algorithms in this field showed low performances and weak quality of recognition. In this article, a new interactive data-driven approach to functional magnetic resonance imagery mining is presented, allowing the observation of cerebral activity. Several non-supervised classification algorithms have been developed and tested on sequences of fMRI images. The results of the tests have shown that the number of classes, signal-to-noise ratio, and volumes of activated and explored zones have a strong influence on the classifier performances.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126443116","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 High-Efficiency Super-Resolution Reconstruction Algorithm from Image/Video Sequences","authors":"Chuangbai Xiao, Jing Yu, Yi Xue","doi":"10.1109/SITIS.2007.48","DOIUrl":"https://doi.org/10.1109/SITIS.2007.48","url":null,"abstract":"The topic of super-resolution image reconstruction has recently received considerable attention within the research area. Super-resolution image reconstruction methods attempt to create a single high-resolution image from a number of low-resolution images (or a video sequence). The Bayesian maximum a posteriori (MAP) estimation method is widely used for super-resolution image reconstruction. So far, existing super-resolution reconstruction methods are all confronted with the problem of slow convergence and expensive computation. To satisfy the requirement of real-time application, we propose a high-efficiency super-resolution reconstruction algorithm that solves two key bottlenecks in the multi-frame MAP framework. The first breakthrough is to select the Armijo rule to identify the step length instead of the exact line search. The second one is to approximately compute the gradient of the MAP objective function using analytic representation instead of numerical calculation. Experimental results show that the proposed algorithm is applicable to real-time super-resolution reconstruction of low-resolution image sequences.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115404092","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":"Cryptanalysis of SPA Protocol","authors":"Hong Lei, Tianjie Cao","doi":"10.1109/SITIS.2007.51","DOIUrl":"https://doi.org/10.1109/SITIS.2007.51","url":null,"abstract":"In this paper, we analyze the security vulnerabilities of SPA, a Strong and lightweight RFID private authentication protocol proposed by Li Lu et al. We present an effective de-synchronization attack against the protocol, which permanently disables the authentication capability of a RFID tag by destroying synchronization between the tag and the reader. The de-synchronization attack can be carried out in just two rounds of interaction in SPA. Then we improved their scheme to protect against DoS attack.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116183503","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}