{"title":"Classification of X-Ray Images Using Grid Approach","authors":"Bertalya, Prihandoko, D. Kerami, T. M. Kusuma","doi":"10.1109/SITIS.2008.76","DOIUrl":"https://doi.org/10.1109/SITIS.2008.76","url":null,"abstract":"The process of medical image classification is still carried out manually using the knowledge of the physician or radiologist, which leads to inaccurate and slow process of object identification. Thus, we need an automatic system that can classify medical images, accurately and faster from query images into one of the pre-defined classes. In this research, we are dealing with the classification of medical image to the image classes that are defined in the database. We focus on managing the shape of X-ray image to perform the classification process and use the Euclidean distance and Jeffrey Divergence techniques to obtain image similarity.We use Freeman Code to represent the shape of X-ray images. This paper shows the development of the Freeman Code representation by simplifying the shape of X-ray image conducts to obtain the best recognition rate.","PeriodicalId":202698,"journal":{"name":"2008 IEEE International Conference on Signal Image Technology and Internet Based Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121285411","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 Case Study of Open Source Software Development in Proteomic Area: The LIMS ePims","authors":"Pierre Naubourg, V. Lopes, Laurent Bossu","doi":"10.1109/SITIS.2008.83","DOIUrl":"https://doi.org/10.1109/SITIS.2008.83","url":null,"abstract":"The objective of this paper is to provide an illustrative feedback on development of Open Source software among several partners. We describe the first stage of the design of a specific software package, namely a customized Laboratory Information Management System (LIMS) for biology applications. This software package is structured in several modules which are reusable and can be customized for other applications. In this paper, we address the problem of multi-licensing for the same software tools due to the participation of several partners, the reuse of code source, and the subsequent distribution of this produced software.","PeriodicalId":202698,"journal":{"name":"2008 IEEE International Conference on Signal Image Technology and Internet Based Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114698695","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":"Identifying Proxy Nodes in a Tor Anonymization Circuit","authors":"Sambuddho Chakravarty, A. Stavrou, A. Keromytis","doi":"10.1109/SITIS.2008.93","DOIUrl":"https://doi.org/10.1109/SITIS.2008.93","url":null,"abstract":"We present a novel, practical, and effective mechanism that exposes the identity of Tor relays participating in a given circuit. Such an attack can be used by malicious or compromised nodes to identify the rest of the circuit, or as the first step in a follow-on trace-back attack. Our intuition is that by modulating the bandwidth of an anonymous connection (e.g. when the destination server, its router, or an entry point is under our control), we create observable fluctuations that propagate through the Tor network and the Internet to the end-user's host. To that end, we employ LinkWidth, a novel bandwidth-estimation technique. LinkWidth enables network edge-attached entities to estimate the available bandwidth in an arbitrary Internet link without a cooperating peer host, router, or ISP. Our approach also does not require compromise of any Tor nodes. In a series of experiments against the Tor network, we show that we can accurately identify the network location of most participating Tor relays.","PeriodicalId":202698,"journal":{"name":"2008 IEEE International Conference on Signal Image Technology and Internet Based Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126122640","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}
Mohammad K. Fallah, S. Moghari, E. Nazemi, M. M. Zahedi
{"title":"Fuzzy Ontology Based Document Feature Vector Modification Using Fuzzy Tree Transducer","authors":"Mohammad K. Fallah, S. Moghari, E. Nazemi, M. M. Zahedi","doi":"10.1109/SITIS.2008.90","DOIUrl":"https://doi.org/10.1109/SITIS.2008.90","url":null,"abstract":"Recently, an emphasis has been placed on the content based Information Retrieval Systems (IRS). Finding documents based on content similarity using background knowledge is becoming an increasingly important task. This paper aims for two main tasks in order to high quality document retrieval; first, we present our formulation of fuzzy ontology and then, by this formulation, propose a method which uses two functions for manipulating document feature vector. We describe encoding a fuzzy ontology into a Fuzzy Tree Transducer (FIT) and then, define two simple functions for applying attained FIT on document feature vector. By using the first function, elements of document feature vector are modified to reduce distance between current document and relevant documents in the vector space. This reduction is so important for categorization of documents in index repository of IRSs. The second function uses the injection of relevant context into query term. The injected context causes relocation of query term in vector space, and reduces its distance from some semantically related documents.","PeriodicalId":202698,"journal":{"name":"2008 IEEE International Conference on Signal Image Technology and Internet Based Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126593255","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":"The Local Fractional Derivative of Fractal Curves","authors":"Hicham Bensoudane, C. Gentil, M. Neveu","doi":"10.1109/SITIS.2008.37","DOIUrl":"https://doi.org/10.1109/SITIS.2008.37","url":null,"abstract":"Fractal curves described by iterated function system (IFS) are generally non-integer derivative. For that we use fractional derivative to investigate differentiability of this curves. We propose a method to calculate local fractional derivative of a curve from IFS property. Also we give some examples of IFS representing the slopes of the right and left half-tangent of the fractal curves.","PeriodicalId":202698,"journal":{"name":"2008 IEEE International Conference on Signal Image Technology and Internet Based Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126491850","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":"Correction of Insertions and Deletions in Selective Watermarking","authors":"M. Schlauweg, Dima Pröfrock, E. Müller","doi":"10.1109/SITIS.2008.26","DOIUrl":"https://doi.org/10.1109/SITIS.2008.26","url":null,"abstract":"Common forward error correction is designed to correct substitution errors only. There is no detection of insertions/deletions. Such systems are usually employed in digital watermarking schemes. If watermark data is embedded selectively based on content features where desynchronization can occur during extraction, common error correction can result in bursts of errors. But there are a few techniques that are able to handle this kind of error. We analyze these techniques, which can be separated into three approaches, namely concatenated coding, dynamic programming, and punctured channel coding. As demonstrated, the latter one fails to correct de-synchronization in second generation watermarking schemes, if the number of selected embedding locations is much smaller than the number of host signal samples. In this paper, we propose a new method that outperforms all other methods presented so far concerning insertion/deletion error correction in second generation watermarking schemes.","PeriodicalId":202698,"journal":{"name":"2008 IEEE International Conference on Signal Image Technology and Internet Based Systems","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116498987","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}
Yoshitaka Sakurai, T. Onoyama, S. Kubota, S. Tsuruta
{"title":"Locally-Selfish-Gene Tolerant Dynamic Control GA for Time Constraint Delivery Problem","authors":"Yoshitaka Sakurai, T. Onoyama, S. Kubota, S. Tsuruta","doi":"10.1109/SITIS.2008.89","DOIUrl":"https://doi.org/10.1109/SITIS.2008.89","url":null,"abstract":"Building ¿just in time¿ distribution systems to improve the delivery efficiency requires solving at least several tens to hundred cities time-constraint Traveling Salesman Problems (TSP) within interactive response time, with practicable optimality. To meet these requirements, a Locally-Selfish-gene Tolerant Dynamic Control GA is proposed. Here, each gene of an individual satisfies only its constraints selfishly, disregarding the constraints of other genes in the same individual. Further, to some extent, even individuals that violate constraints can survive over generations and are given the chance of improvement. Moreover, evolution is promoted by dynamically changing the degree of the tolerance and GA operations. Our experiment proved that this method provides expert-level solutions for several tens to hundred cities time constraint TSPs within a few seconds.","PeriodicalId":202698,"journal":{"name":"2008 IEEE International Conference on Signal Image Technology and Internet Based Systems","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133769301","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":"Expectation-Maximization x Self-Organizing Maps for Image Classification","authors":"T. Korting, Leila Maria Garcia Fonseca, F. Bação","doi":"10.1109/SITIS.2008.35","DOIUrl":"https://doi.org/10.1109/SITIS.2008.35","url":null,"abstract":"To deal with the huge volume of information provided by remote sensing satellites, which produce images used for agriculture monitoring, urban planning, deforestation detection and so on, several algorithms for image classification have been proposed in the literature. This article compares two approaches, called Expectation-Maximization (EM) and Self-Organizing Maps (SOM) applied to unsupervised image classification, i.e. data clustering without direct intervention of specialist guidance. Remote sensing images are used to test both algorithms, and results are shown concerning visual quality, matching rate and processing time.","PeriodicalId":202698,"journal":{"name":"2008 IEEE International Conference on Signal Image Technology and Internet Based Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129971234","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":"Identifying Equivalent URLs Using URL Signatures","authors":"Lay-Ki Soon, Sang Ho Lee","doi":"10.1109/SITIS.2008.21","DOIUrl":"https://doi.org/10.1109/SITIS.2008.21","url":null,"abstract":"In the standard URL normalization mechanism, URLs are normalized syntactically by a set of predefined steps. In this paper, we propose to enhance the standard URL normalization by incorporating the semantically meaningful metadata of the Web pages. The metadata taken into account are the body texts of the Web pages, which can be extracted during HTML parsing. Given a URL which has undergone the standard normalization mechanism, we construct its URL signature by hashing or fingerprinting the body text of the associated Web page using Message-Digest algorithm 5. URLs which share identical signatures are considered to be equivalent in our scheme. The experimental results show that our proposed method helps to further reduce redundant Web information retrieval by 34.57% in comparison with the standard URL normalization mechanism.","PeriodicalId":202698,"journal":{"name":"2008 IEEE International Conference on Signal Image Technology and Internet Based Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130216144","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":"Multiple Videos Broadcasting Scheme for Near Video-on-Demand Services","authors":"Yu-Wei Chen, K. Huang","doi":"10.1109/SITIS.2008.50","DOIUrl":"https://doi.org/10.1109/SITIS.2008.50","url":null,"abstract":"This work proposes a multiple-video broadcasting scheme to reduce the subscriber startup latency by applying the finite bandwidth. The basic concept is taking the harmonic serious permutation, and popularizing to the multiple videos consider. The performance of the proposed method is better than the previous VOD broadcasting schemes in terms of startup latency.","PeriodicalId":202698,"journal":{"name":"2008 IEEE International Conference on Signal Image Technology and Internet Based Systems","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133657884","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}