{"title":"Combining Face Detection and Novelty to Identify Important Events in a Visual Lifelog","authors":"A. Doherty, A. Smeaton","doi":"10.1109/CIT.2008.WORKSHOPS.31","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.31","url":null,"abstract":"The SenseCam is a passively capturing wearable camera, worn around the neck and takes an average of almost 2,000 images per day, which equates to over 650,000 images per year.It is used to create a personal lifelog or visual recording of the wearer's life and generates information which can be helpful as a human memory aid. For such a large amount of visual information to be of any use, it is accepted that it should be structured into \"events\", of which there are about 8,000 in a wearer's average year. In automatically segmenting SenseCam images into events, it is desirable to automatically emphasise more important events and decrease the emphasis on mundane/routine events. This paper introduces the concept of novelty to help determine the importance of events in a lifelog. By combining novelty with face-to-face conversation detection, our system improves on previous approaches. In our experiments we use a large set of lifelog images, a total of 288,479 images collected by 6 users over a time period of one month each.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"121 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126323911","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}
Lansheng Han, Shuxia Han, Q. Deng, Junqing Yu, Yunfeng He
{"title":"Source Tracing and Pursuing of Network Virus","authors":"Lansheng Han, Shuxia Han, Q. Deng, Junqing Yu, Yunfeng He","doi":"10.1109/CIT.2008.WORKSHOPS.25","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.25","url":null,"abstract":"Recently with the popularity of network, computer virus also enlarger its host into the whole network. However, the current single-computer cleaning method is passive, which cannot cope with the endless network virus. This paper proposes the advantages of the network should be taken in fighting against network virus. When a vertex is found be infected, anti-virus should trace where it come and pursuing where it go, then the spreading path of the virus can be got. By describing the spreading of virus in the network, the paper first constructs a discrete spreading model for the virus. Then, based on the model, the paper presents algorithms for source tracing and pursuing which assure to catch most viruses in a sub-net. At last, the paper also carries on simulation tests for the strategies and the test results confirm the algorithms and also get some useful advice for the real activities.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114221120","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":"Codec System Design for Continuous Color Barcode Symbols","authors":"Songwen Pei, Guobo Li, Baifeng Wu","doi":"10.1109/CIT.2008.WORKSHOPS.9","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.9","url":null,"abstract":"To address the limits of capacity and the disadvantages of motional scanning capability of traditional two-dimensional barcodes, a novel 3-D continuous barcode (3-D CoBe) is proposed. It adds color as a third dimension based on our previous research on 2-D continuous barcodes (2-D CoBe). The novel 3-D CoBe is called 2-D continuous color barcode (CCB) as well. Furthermore, we implemented a codec system including an encoding sub-system and a decoding sub-system for a target application. In the codec system, CCB is generated and printed on papers by an encoding software sub-system, in addition to being recognized and decoded by a hand-held device with a decoding sub-system in real-time. It is verified that the codec system for CCB is practical and effective.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121072992","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":"Clustering Microarray Data by Using a Stochastic Algorithm","authors":"H. Shon, Sunshin Kim, Seung-Jung Shin, K. Ryu","doi":"10.1109/CIT.2008.WORKSHOPS.117","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.117","url":null,"abstract":"The clustering of gene expression data is used to analyze the results of microarray studies. This method is often useful in understanding how a particular class of genes functions together during a biological process. In this study, we attempted to perform clustering using the Markov cluster (MCL) algorithm, a clustering method for graphs based on the simulation of stochastic flow. It is a fast and efficient algorithm that clusters nodes in a graph through simulation by computing probability. First, we converted the raw matrix into a sample matrix using the Euclidean distance of the genes between the samples. Second, we applied the MCL algorithm to the new matrix of Euclidean distance and considered 2 factors, namely, the inflation and diagonal terms of the matrix. We have turned to set the proper factors through massive experiments. In addition, distance thresholds, i.e., the average of each column data elements, were used to clearly distinguish between groups. Our experimental result shows about 70% accuracy in average compared to the class that is known before. We also compared the MCL algorithm with the self-organizing map (SOM) clustering, K-means clustering and hierarchical clustering (HC) algorithms.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121095744","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 Spatial-Temporal Channel for Information Fusion","authors":"Weihua Li, Xiaodong Fu","doi":"10.1109/CIT.2008.WORKSHOPS.17","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.17","url":null,"abstract":"This paper introduces the needs of information fusion on the sensor networks. It proposes the spatial-temporal channel concept based on the channel theory to support information fusion. Intelligent agents are the suitable tools to build the logic sensor. The paper presents the information fusion scheme and shows that the integration of agent communication mechanism and ontology can improve the ability of intelligent agents so that they can improve information fusion.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132597879","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}
Yoohyun Park, Yongju Lee, Hag-Young Kim, Kyongsok Kim
{"title":"Hybrid Segment-Based Transcoding Proxy Caching of Multimedia Streams","authors":"Yoohyun Park, Yongju Lee, Hag-Young Kim, Kyongsok Kim","doi":"10.1109/CIT.2008.WORKSHOPS.67","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.67","url":null,"abstract":"Streaming media has contributed to a significant amount of todaypsilas Internet traffic. Like traditional Web objects, rich media objects can benefit from proxy caching, but caching streaming media is more of challenging than caching simple Web objects, because the streaming media have features such as huge size and high bandwidth. Due to huge size of streaming media, lots of researches manage the contents with segments for efficient storage management. And to support various bandwidth requirements for the heterogeneous ubiquitous devices, a transcoding proxy is usually necessary to provide not only adapting multimedia streams to the client by transcoding, but also caching them for later use. In this paper, we propose the hybrid segmentation strategy for the transcoding proxy that is uniform segmentation in the same version and is also exponential segmentation among the multiple versions. This strategy reduces the replacement count than uniform segmentation and gets the similar performance to uniform segmentation. The performance results show that hybrid segmentation with aggregated profit function have a high delay saving ratio, high byte-hit ratio and less transcoding data.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125216829","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":"Website Data Storage Management during Data Lifecycle Taking into Account of Time Effect","authors":"Zenggui Ou","doi":"10.1109/CIT.2008.WORKSHOPS.47","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.47","url":null,"abstract":"The data lifecycle means the process from datapsilas advent to its disappearance; the data management runs through the whole data lifecycle. Data management aims at providing the data which are complete, accurate and conducts time effect for userspsila data retrieval. At each stage of datapsilas life cycle, different demands exist upon data management, among which data store management is the most important. There are several different strategies and models in store management and to choose the best scheme for it is also fundamental. In fact, it is always hoped that the recent, latest data would be stored in the most accessible device. From the perspective of how the administrator provides effective data for userspsila retrieval, this thesis discusses about the store management based on data time effect within datapsilas life cycle. The main point, however, is to find out a feasible way on a Website towards how to divide the data upon its time effect, what kind of store strategies should be adopted due to the division and finally some suggestions and solution would be proposed.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132257109","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":"Embedded Architectural Design Using Protection Logics to Defend Attack of Buffer Overflow and Unauthorized Access of Code","authors":"C. Yau, Y. Tan, A. Fong, P. L. Mok","doi":"10.1109/CIT.2008.WORKSHOPS.119","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.119","url":null,"abstract":"As security is always a major concern in most of the networked computer systems, embedded systems should provide security features to defend the attack and protect the confidential and sensitive data. Many Trojan Horses and viruses use the security holes of exception to trigger attack, such as buffer overflow attack. Although most embedded systems rely on the programmer, the compiler or the third-party security software to defend and protect the systems against the buffer overflow attack, these techniques could not completely maintain the overall system security. Using a secure programming language is another approach to protect the system, but this approach contains a large security hole that break the overall security. Therefore, this paper proposes a secure Java embedded processor architecture called jHISC with protection logic to protect the system naturally. This new processor realized the natural secure language features of Java in the core architecture to enhance the overall system security. It performs various rigid hardware bound checks and embedded access control checks to avoid the code bypassing. The current implementation phase is under version 4 with 4 KB instruction cache and 8 KB data cache is described by VHDL and implemented and verified in a Xilinx Virtex FPGA.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133737826","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 Independent Component Analysis Approach for Enhancing Camera Based Low Quality Text Images","authors":"Atishay Jain, S. Tapaswi, U. Garain","doi":"10.1109/CIT.2008.WORKSHOPS.111","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.111","url":null,"abstract":"The paper proposes an independent component analysis approach specifically aimed at enhancing low-resolution text images from handheld devices. Three layered Independent components are extracted from the image, checked for the components if missing in any of the layer and then integrated so as the missing component can be mixed. Afterwards the image enhancement techniques such as threshold and dilation are used to produce the final text image. Comparative performance evaluation is presented in the form of OCR results of the super-resolution output.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117038458","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":"Application Research of Dominance Relation Rough Set on Seismology Data","authors":"Shaochun Wu, Yinyin Li, Minfu Fang, Mingjun Xin","doi":"10.1109/CIT.2008.WORKSHOPS.77","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.77","url":null,"abstract":"In this paper, after discussing classical rough set theory based on indiscemibility relation and the problem of its reduction algorithms on Seismology Data, we arrived at a new definition of dominance distinguishing matrix by taking advantage of the unique characteristic of the extended model. Then the corresponding reduction and rule extracting algorithms are accordingly presented to enhance the efficiency of seeking the reduction in some extent. In fact, we use the rough set theory based on Dominance Relation to get the 272 rules with realistic meaning, from 44381 items in the small Seismology Data in China.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115585880","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}