{"title":"New Adaptive Postprocessing to Remove Blocking Artifacts for DCT Coded Image","authors":"Jin Wang, Jongho Kim, Jechang Jeong","doi":"10.1109/SITIS.2008.61","DOIUrl":"https://doi.org/10.1109/SITIS.2008.61","url":null,"abstract":"To remove blocking artifacts, this paper proposes a novel adaptive postprocessing method in block-based discrete cosine transform (BDCT) coded images and presents a framework, which is a serial-concatenation of a simple deblocking filter and a constraint set based on the POCS algorithm. At first, we classify the simple deblocking filter by an adaptive threshold depending on local statistical properties, and in the meantime, update block types appropriately by a simple rule, which affects the performance of deblocking progresses decisively. Secondly, a quantization constraint set (QCS) based on the projection onto convex sets (POCS) algorithm is introduced. At last, comprehensive experiments indicate that the proposed algorithm outperforms a large number of deblocking methods in the literature, in terms of evaluation of PSNR and subjective visual qualities.","PeriodicalId":202698,"journal":{"name":"2008 IEEE International Conference on Signal Image Technology and Internet Based Systems","volume":"52 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":"130710577","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":"An Efficient Extraction of On-Road Object and Lane Information Using Representation Method","authors":"Jaehyoung Yu, Youngjoon Han, H. Hahn","doi":"10.1109/SITIS.2008.19","DOIUrl":"https://doi.org/10.1109/SITIS.2008.19","url":null,"abstract":"Robust and reliable lane detection is an important issue for driver assistance systems and self-guided systems. Input images acquired from a camera on moving vehicle need to be processed for lane and vehicular traffic detection. We propose an algorithm that uses a chain code detector for detecting lanes and detects vehicles using the horizontal lines formed by the vehicles at the edge of the images. In the first step, a vanishing point is obtained from both sides of the lane, which are obtained from the chain code analysis using the canny edge operator. In the second step, the driveways are decided by combining the vanishing point and the lane information on both sides of the moving vehicle. We define the lane properties and the limiting conditions for reliable lane detection. The robustness of proposed algorithm has been verified from experimental results of complex background images.","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":"129687728","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":"Supporting Informational Web Search with Interactive Explorations","authors":"Tai-Wei Chen, Ping-Lin Chang, Wei-Guang Teng","doi":"10.1109/SITIS.2008.103","DOIUrl":"https://doi.org/10.1109/SITIS.2008.103","url":null,"abstract":"As information technologies advance, the data amount gathered on the Internet increases at an incredible rapid speed. To ease the data overloading problem, people commonly use search engines to reach required information in seconds. Nevertheless, depending on different user goals in Web search, users occasionally get lost in the large number of search results when trying to explore them. In this paper, we propose an interactive scheme to support users to conduct such informational Web searches in the similar way of map explorations. Specifically, two main concepts, i.e., refocusing and refinement, are devised to constitute the interactive exploration processes. With a proper design and implementation, case studies utilizing our prototype system show that the proposed approach is feasible in improving usability of current search engines.","PeriodicalId":202698,"journal":{"name":"2008 IEEE International Conference on Signal Image Technology and Internet Based Systems","volume":"15 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":"124046500","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 Web Support for Open-Source Software Development","authors":"T. Dillon, Gregory L. Simmons","doi":"10.1109/SITIS.2008.114","DOIUrl":"https://doi.org/10.1109/SITIS.2008.114","url":null,"abstract":"Open-source software is unique in that the development of the product is performed in public over the Internet by developers who elect to contribute to the project and rarely if ever meet face-to-face. Software development is a knowledge intensive process and the information generated in open-source software development projects is typically housed in a central Internet repository. Open-source repositories typically contains vast amounts of information, much of it unstructured, meaning that even if a question has previously been discussed and dealt with it is not a trivial task to locate it, leading to rework, confusion amongst developers and possibly deterring new developers from getting involved. This paper develops an ontology based software development architecture for open-source software development. Such an architecture would enable better categorisation of information, communication, co-ordination and the development of sophisticated search agents.","PeriodicalId":202698,"journal":{"name":"2008 IEEE International Conference on Signal Image Technology and Internet Based Systems","volume":"150 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":"134410601","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":"Building a Scalable Collaborative Web Filter with Free and Open Source Software","authors":"Michael G. Noll, C. Meinel","doi":"10.1109/SITIS.2008.27","DOIUrl":"https://doi.org/10.1109/SITIS.2008.27","url":null,"abstract":"In this case study, we describe the design and architecture of a scalable collaborative web filtering service, TaggyBear, which is powered by free and open source software. We will introduce the reader to the ideas and concepts behind TaggyBear, and discuss why we picked the software components that form the basis of the service. We will talk about how we combined or extended their functionality to build the TaggyBear service, and provide some initial benchmarking results and performance figures.","PeriodicalId":202698,"journal":{"name":"2008 IEEE International Conference on Signal Image Technology and Internet Based Systems","volume":"41 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":"132272795","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":"Using a Novel Variable Block Size Image Compression Algorithm for Hiding Secret Data","authors":"F. Keissarian","doi":"10.1109/SITIS.2008.82","DOIUrl":"https://doi.org/10.1109/SITIS.2008.82","url":null,"abstract":"This paper presents a data hiding scheme that hides the data in the compression domain of a digital image. A quadtree decomposition algorithm decomposes the host image into blocks of variable sizes according to histogram analysis of the block residuals. Variable block sizes are then encoded at different rates based on their visual activity levels. The majority of secrete data are embedded into the smooth area of the image, while a small portion of the secret data are hidden in the compression codes of the high detailed blocks. Experimental results confirm that the proposed scheme can embed a large amount of data in the compressed file while maintaining satisfactory image quality.","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":"127832447","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 Distance Computation Technique for Query-by-Multiple-Example System","authors":"Jianqiao Feng, Haifeng Zhao, Wenhua Jia","doi":"10.1109/SITIS.2008.20","DOIUrl":"https://doi.org/10.1109/SITIS.2008.20","url":null,"abstract":"Query-by-one-example (QBOE) is the traditional way of querying in content-based image retrieval (CBIR) system. However, as some recent research points out, QBOE method cannot get accurate result because only one image is not sufficient to express its semantics of the intended query. Therefore, query-by-multiple-example (QBME) method is proposed and adopted, in which query images are divided into groups according to relevance to target image class. In order to maximize major features and minimize minor ones, previous researches have introduced adaptive distance computation in QBME. These methods optimize query result compared to QBOE, but still have some defects. This paper proposes a new adaptive distance computation technique for QBME, which achieves higher performance than previous methods.","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":"131243135","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":"Universal Multi-Factor Authentication Using Graphical Passwords","authors":"Alireza Pirayesh Sabzevar, A. Stavrou","doi":"10.1109/SITIS.2008.92","DOIUrl":"https://doi.org/10.1109/SITIS.2008.92","url":null,"abstract":"In this paper, we present a series of methods to authenticate a user with a graphical password. To that end, we employ the user¿s personal handheld device as the password decoder and the second factor of authentication. In our methods, a service provider challenges the user with an image password. To determine the appropriate click points and their order, the user needs some hint information transmitted only to her handheld device. We show that our method can overcome threats such as key-loggers, weak password, and shoulder surfing. With the increasing popularity of handheld devices such as cell phones, our approach can be leveraged by many organizations without forcing the user to memorize different passwords or carrying around different tokens.","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":"116494733","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, Shoko Hashida, S. Tsuruta, H. Ihara
{"title":"Reliable Web-Based CSCW Systems Using Information Fusion of Various Multiple Biological Sensors","authors":"Yoshitaka Sakurai, Shoko Hashida, S. Tsuruta, H. Ihara","doi":"10.1109/SITIS.2008.100","DOIUrl":"https://doi.org/10.1109/SITIS.2008.100","url":null,"abstract":"In Web-based CSCW (Computer-Supported Cooperative Work) often including cooperative learning, remote members communicate their intentions in cyberspace, using textual sentences, pictures and voice. However, often, communication between members cannot be correctly done and interface errors occur. Different from face-to-face communication, partners' situations including their interest, concentration, boredom, and tiredness cannot be easily transmitted. Oversight and mishearing of remote partners is often overlooked. Besides, it is further difficult to understand their real intentions sufficiently. To overcome these problems, ¿Augmented Cyberspace¿ for dependable Web-based CSCW Systems, is proposed, which is also applicable to system such as e-learning. This assesses situations of remote users through fusing information of multiple biological sensors and the related general contexts. By transmitting and using information of such users¿ situations, the system augments the cyberspace through stressing or providing warnings in conventional media such as text, image, and voice.Experimental results showed the necessity and feasibility for information fusion of multiple sensors.","PeriodicalId":202698,"journal":{"name":"2008 IEEE International Conference on Signal Image Technology and Internet Based Systems","volume":"174 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":"116133136","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 Information Routing and Retrieval in Cluster-Based P2P Overlay Networks","authors":"Mouna Kacimi, K. Yétongnon","doi":"10.1109/SITIS.2008.105","DOIUrl":"https://doi.org/10.1109/SITIS.2008.105","url":null,"abstract":"Similarity searching is particularly important in distributed networks such as P2P systems, which use various routing schemes to submit queries to relevant peers. We investigate content-based information routing and retrieval using similarity search in clustered P2P overlay networks and focus on their maintenance cost models and performance issues. We present a query model for a cluster based P2P overlay network, called HON, where data and peers are organized in high dimensional feature spaces. We show through extensive simulations that HON has a low maintenance cost and is resilient to peers' failures. In addition it achievesan efficient similarity search with a high success rate.","PeriodicalId":202698,"journal":{"name":"2008 IEEE International Conference on Signal Image Technology and Internet Based Systems","volume":"149 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":"124157408","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}