{"title":"Passage Retrieval Using Graph Vertices Comparison","authors":"T. Dkaki, J. Mothe, Q. Truong","doi":"10.1109/SITIS.2007.82","DOIUrl":"https://doi.org/10.1109/SITIS.2007.82","url":null,"abstract":"In this paper, we describe an Information retrieval Model based on graph comparison. It is inspired from previous work such as KleinbergpsilaHits and Blondel et al.psilas model. Unlike previous methods, our model considers different types of nodes: text nodes (elements to retrieve and query) and term nodes, so that the resulting graph is a bipartite graph. The results on passage retrieval task show that high precision is improved using this model.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"289 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":"133599427","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":"Automatic Extending HowNet's Attribute Lexicon on the Web","authors":"Jinglei Zhao, Hui Liu, R. Lu","doi":"10.1109/SITIS.2007.28","DOIUrl":"https://doi.org/10.1109/SITIS.2007.28","url":null,"abstract":"It is well known that lexical knowledge sources as WordNet, HowNet are very important to natural language processing applications in artificial intelligence. This paper proposes a new Web-mining algorithm to automatically extend HowNetpsilas attribute set. Seeded by the original attribute set in HowNet, the algorithm uses a conjunctive lexical pattern plus a validation mechanism called PES (position exchanging search) to extend the lexicon iteratively on the Web. Also, a Web-based attribute classifier is constructed which behaves as a filter to control the level of false positives during each iteration. The algorithm is evaluated using both standard human judgements and HowNet based evaluation. Some experimental results about the performance of the method are provided.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"144 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":"133492921","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":"Semantic Tolerance-Based Image Representation for Large Image/Video Retrieval","authors":"Ying Dai","doi":"10.1109/SITIS.2007.71","DOIUrl":"https://doi.org/10.1109/SITIS.2007.71","url":null,"abstract":"The nature of the concepts regarding multimedia in many domains is imprecise, and the interpretation of finding similar media is also ambiguous and subjective on the level of human perception. To solve these problems, in this paper, semantic categories of images or key frames which are extracted for representing the segments of a video, and the tolerance degree between the categories are defined systematically, and the approach of modeling tolerance relations between the semantic classes is proposed. Furthermore, for removing the induced false tolerance in the produce of using semantic tolerance relation model, the method of un-tolerating is introduced in image/key frame representation. On the other hand, a diagram of semantic tolerance-based image/video automatic representation is described, and the structure of large image/video retrieval using image/video semantic representation is proposed. We apply the proposed approach to the representations of images regarding the nature vs. man-made domain, human vs. non-human domain, and temporal domain, and show the categorization results of using and not using semantic tolerance relation model. Furthermore, the mechanism of the semantic representation and retrieval for large image/video data proposed in this paper is compared with the state-of-the-art methods. The results show the effectiveness of proposed method.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"36 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":"122242697","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":"Timed Modeling of Web Services Composition for Automatic Testing","authors":"M. Lallali, Fatiha Zaïdi, A. Cavalli","doi":"10.1109/SITIS.2007.110","DOIUrl":"https://doi.org/10.1109/SITIS.2007.110","url":null,"abstract":"This paper presents the modeling of BPEL (timed) constructs by using a new formalism WS-TEFSM (Web Service Timed Extended Finite State Machine). A formal mapping of all BPEL constructs is proposed as well as a model that corresponds to the BPEL Web services composition. The WS-TEFSM formalism allows to deal with timing constraints, data variables, clocks and priority on transitions. To perform the transformation, we define a renaming function and an asynchronous product of all partial machine corresponding to the BPEL process sub-activities. This model is enriched by the addition of priorities on transitions, which permit to handle the termination of the BPEL process and its sub-activities, and by global variables, which are used in the management of events and faults. This transformation step is essential to ensure the test of Web services. A rigorous approach is crucial as we have to deal with complex systems that manage distribution, low-coupled nature and asynchronous behaviors.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"17 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":"124789226","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":"Content-Based Shape Search of 3D CAD Models with Relevance Feedback","authors":"Jiale Wang, Hongming Cai, Yuan-jun He, Y. Zhang","doi":"10.1109/SITIS.2007.49","DOIUrl":"https://doi.org/10.1109/SITIS.2007.49","url":null,"abstract":"Engineers and designers often need to search out similar CAD models to make reference to and reuse the previous designs. For most of CAD models, both geometrical information and topological information are important for similarity assessment. We proposed two shape signatures to describe the geometry and the topology of a CAD model respectively. A relevance feedback mechanism is introduced to combine the two dissimilarity distances measured by the two signatures. Experiments are conducted to evaluate the performance of the proposed method.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"25 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":"124948212","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":"Multi-class Boosting with Color-Based Haar-Like Features","authors":"Wen-Chung Chang, Chih-Wei Cho","doi":"10.1109/SITIS.2007.119","DOIUrl":"https://doi.org/10.1109/SITIS.2007.119","url":null,"abstract":"This paper presents a multi-class boosting algorithm employing color-based Haar-like features. Traditional multi-class boosting algorithms basically regard multi-class problems as extensions of two-class problems. In particular, additional strong classifiers must be parallelly extended once the number of target classes increases. The idea in the proposed approach is to develop a single strong classifier which is capable of resolving multi-class problems. To make the multi-class algorithm tractable, the proposed system is required to select a set of weak classifiers which could classify multiple types of targets correctly. In contrast to standard Haar-like features that compute feature values based on gray level images, the seemingly novel Haar-like features require computation based on color images. Since the mapping from color image space to gray level image space is an epimorphism, detection algorithms using standard Haar-like features inevitably disregard color information available in original color images. Strong classifiers adopting the proposed color-based Haar-like features typically appear to have comparable performance, in the aspects of detection and correct classification rates, with fewer weak classifiers when compared with the one employing standard Haar-like features. The proposed boosting algorithm can improve system efficiency and resolve multi-class problems by a single strong classifier, whereas existing approaches are more complicated and the number of two-class classifiers could be relatively large. Our approach has been successfully validated in real traffic environments by performing experiments with a CCD camera mounted onboard a highway vehicle, where the targets are defined as passenger cars and motorcycles.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"33 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":"130226536","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}
Kotaro Araki, Keiichi Tamura, Tomoyuki Kato, Y. Mori, H. Kitakami
{"title":"Extraction of Ambiguous Sequential Patterns with Least Minimum Generalization from Mismatch Clusters","authors":"Kotaro Araki, Keiichi Tamura, Tomoyuki Kato, Y. Mori, H. Kitakami","doi":"10.1109/SITIS.2007.104","DOIUrl":"https://doi.org/10.1109/SITIS.2007.104","url":null,"abstract":"An ambiguous query in sequence databases returns a set of similar subsequences, called a mismatch cluster, to the user. The inherent problem is that it is difficult for users to identify the characteristics of very large similar subsequences in a mismatch cluster. In order to support user comprehension of mismatch clusters, it is important to extract a set of ambiguous sequence patterns with the least minimum generalization in the mismatch cluster. The extraction of the ambiguous sequential pattern set requires an enormous amount of computational time, since we have to discover generalized patterns with minimum covers for the mismatch cluster from candidate generalized patterns. The present paper is a proposal for an iterative refinement method to extract ambiguous sequence patterns with minimum cover for mismatch clusters selected from a sequence database. It includes a proposal to use the method with a domain segmentation method to achieve an efficient pattern extraction. Moreover, a prototype implementing the two proposed methods has been applied to three datasets included in PROSITE in order to evaluate their usefulness. The proposed methods resulted in a high capability to extract ambiguous sequential patterns from mismatch clusters that are provided by an ambiguous query in the sequence database.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"146 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":"127246272","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 Receipt-Free Punch-Hole Ballot Electronic Voting Scheme","authors":"Han Wei, D. Zheng, Kefei Chen","doi":"10.1109/SITIS.2007.15","DOIUrl":"https://doi.org/10.1109/SITIS.2007.15","url":null,"abstract":"The punch-hole ballot electronic voting protocol is a special version of the e-voting paradigms based on homomorphic encryption. Assume that there are L candidates and a voter can select K distinct candidates, the punch-hole ballot is represented as a vector with L elements. The i-th entry of the ballot corresponds to the choice of the voter on the i-th candidate. The tallying authorities sum up components in respective locations of all votes to reveal the votes that are won by each pre-determined candidate. Receipt-freeness is an important security property to protect the election against vote buying and coercion. In this paper a receipt-free punch-hole ballot e-voting scheme is presented. A third party called \"randomizer\" is employed to re-encrypt the first ballot cast by the voter. The randomizer and the voter jointly generate the final ballot for the tally. Our scheme satisfies the requirements for cryptographic secure electronic voting protocols and is efficient for implementation.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"11 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":"127815515","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":"Improved JPEG Scheme Based on Adaptive Block Encoding","authors":"Yuan-Hui Yu, Chinchen Chang, Yu-Chen Hu","doi":"10.1109/SITIS.2007.149","DOIUrl":"https://doi.org/10.1109/SITIS.2007.149","url":null,"abstract":"In this paper, a new adaptive image compression scheme based on JPEG was proposed to improve the image quality of the JPEG baseline sequential image compression codec. In this scheme, the Hough transformation technique is employed as an edge-oriented classifier to categorize image blocks into four classes. Different types of image blocks are processed by different quantization and encoding ways for achieving an effective compression performance. In order to preserve edge information, the adaptive quantization tables based on the human visual system and zig-zag scan sequences are used. For both objective and subjective visual image quality, simulation results show that the performance of the proposed scheme is comparable to that of other compared schemes.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"33 2 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":"130003102","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 Practical Web Testing Model for Web Application Testing","authors":"Zhong-sheng Qian, Huai-kou Miao, Hong-wei Zeng","doi":"10.1109/SITIS.2007.16","DOIUrl":"https://doi.org/10.1109/SITIS.2007.16","url":null,"abstract":"As an important method to ensure the quality of Web applications, Web testing attracts more and more attentions in the academic community and industrial world. Testing Web applications raises new problems and faces very high challenges. This work proposes a Web testing model for Web application testing. It starts from constructing the PFD (Page Flow Diagram) of the Web application. An algorithm is then designed to derive a PTT (Page Test Tree) from the PFD. From the PTT, a test translator is employed to extract the path expression, in order to generate all the test paths and then translates them into a test specification in XML syntax, which is the input of test engine. The test engine generates test cases and then executes them, and finally produces test report. The model presented is an important supplement to the existing Web application testing.","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":"125598625","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}