{"title":"Time Delay Estimation of Reverberant Meeting Speech: On the Use of Multichannel Linear Prediction","authors":"E. Cheng, I. Burnett, C. Ritz","doi":"10.1109/SITIS.2007.96","DOIUrl":"https://doi.org/10.1109/SITIS.2007.96","url":null,"abstract":"Effective and efficient access to multiparty meeting recordings requires techniques for meeting analysis and indexing. Since meeting participants are generally stationary, speaker location information may be used to identify meeting events e.g., detect speaker changes. Time-delay estimation (TDE) utilizing cross-correlation of multichannel speech recordings is a common approach for deriving speech source location information. Research improved TDE by calculating TDE from linear prediction (LP) residual signals obtained from LP analysis on each individual speech channel. This paper investigates the use of LP residuals for speech TDE, where the residuals are obtained from jointly modeling the multiple speech channels. Experiments conducted with a simulated reverberant room and real room recordings show that jointly modeled LP better predicts the LP coefficients, compared to LP applied to individual channels. Both the individually and jointly modeled LP exhibit similar TDE performance, and outperform TDE on the speech alone, especially with the real recordings.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"38 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":"123308988","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 Robust Watermarking Scheme for Color Image in Spatial Domain","authors":"I. Nasir, Ying Weng, Jianmin Jiang","doi":"10.1109/SITIS.2007.67","DOIUrl":"https://doi.org/10.1109/SITIS.2007.67","url":null,"abstract":"This paper presents a new robust watermarking scheme for color image based on a block probability inspatial domain. A binary watermark image is permutated using sequence numbers generated by a secret key and Gray code, and then embedded four times in different positions by a secret key. Each bit of the binary encoded watermark is embedded by modifying the intensities of anon-overlapping block of 8*8 of the blue component ofthe host image. The extraction of the watermark is bycomparing the intensities of a block of 8*8 of the watermarked and the original images and calculating the probability of detecting '0' or '1'. Tested by benchmark Stirmark 4.0, the experimental results show that the proposed scheme is robust and secure against a widerange of image processing operations.","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":"115222612","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 Analysis Using Data Range Aware Seeding and Agglomerative Expectation Maximization","authors":"Hongwei Zhu, Honglei Zhu","doi":"10.1109/SITIS.2007.61","DOIUrl":"https://doi.org/10.1109/SITIS.2007.61","url":null,"abstract":"Expectation maximization (EM) is a local maximization method of the mixture model. When applied to clustering analysis, it generates good results only with reasonably good initialization, which can be produced by hierarchical agglomeration. However, hierarchical agglomeration has poor scalability due to its computational complexity. This paper presents a novel method, called ISOEM, to overcome this limitation. It uses a data range aware seeding algorithm to create an initial classification to initialize an iterative self-organizing process. The process alternates between EM and agglomeration coupled with classification EM. Evaluation using two imagery datasets showed the method had very good performance. The paper also presents the results of using a skewness measure and a separation-cohesion index as indicators for determining the number of clusters in the data.","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":"126430478","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 Analysis of Constructed Categories for Textual Classification Using Fuzzy Similarity and Agglomerative Hierarchical Methods","authors":"M. V. C. Guelpeli, A. C. Garcia","doi":"10.1109/SITIS.2007.109","DOIUrl":"https://doi.org/10.1109/SITIS.2007.109","url":null,"abstract":"Ambiguity is a challenge faced by systems that handle natural language. To assuage the issue of linguistic ambiguities found in text classification, this work proposes a text categorizer using the methodology of Fuzzy Similarity. The grouping algorithms Stars and Cliques are adopted in the Agglomerative Hierarchical method and they identify the groups of texts by specifying some time of relationship rule to create categories based on the similarity analysis of the textual terms. The proposal is that based on the methodology suggested, categories can be created from the analysis of the degree of similarity of the texts to be classified, without needing to determine the number of initial categories. The combination of techniques proposed in the categorizerpsilas phases brought satisfactory results, proving to be efficient in textual classification.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"44 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":"132588051","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":"Non-negative Increment Feature Detection of the Traffic Throughput for Early DDoS Attack","authors":"Ying Huang, Huizhong Sun, H. J. Chao, Xiong Chao","doi":"10.1109/SITIS.2007.122","DOIUrl":"https://doi.org/10.1109/SITIS.2007.122","url":null,"abstract":"One of the major threats to cyber security is distributed denial of service (DDoS) attacks. In this paper, we reveal the non-negative and cumulative increment effect of DDoS traffic throughput that is the feature accurately distinguished DDoS attacking traffic from normal flash crowd traffic. Our scheme can detect a DDoS attack in its early stages based on these feature. It can differentiate DDoS from flash crowd traffic effectively even if DDoS is potential. This scheme detects DDoS attacks with on-line and distributed characteristics. Simulation shows the algorithm's validity and accuracy.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"397 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":"132912196","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":"On Constructing and Pruning SVM Ensembles","authors":"Bing-Yu Sun, Xiaoming Zhang, Rujing Wang","doi":"10.1109/SITIS.2007.19","DOIUrl":"https://doi.org/10.1109/SITIS.2007.19","url":null,"abstract":"This paper proposes an effective method for constructing and pruning support vector machine ensembles for improved classification performance. Firstly we propose a novel method for constructing SVM ensembles. Traditionally an SVM ensemble is constructed by the data sampling method; In our method, however,each individual SVM classifier is trained by using the same original training set, but with different kernel parameters.Compared to traditional SVM ensemble methods, our method need not to tune the kernel parameters for each individual SVM, thus the training of the SVM ensemble can be simplified considerably. Furthermore, we also propose several efficient method for pruning the constructed SVM ensembles. The proposed pruning methods cannot only simplify the SVM ensemble, but also improve its performance. A set of experiments were conducted to prove the efficiency and affectivity of our proposed approaches.","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":"134578986","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-view Ear Shape Feature Extraction and Reconstruction","authors":"Heng Liu, Jingqi Yan","doi":"10.1109/SITIS.2007.42","DOIUrl":"https://doi.org/10.1109/SITIS.2007.42","url":null,"abstract":"Due to ear's complex structure, particular position, and preferable stability, ear biometrics has attracted increasingly attention recently. In this paper, we present a new multi-view based ear feature extraction strategy. We utilize not only front view ear image but backside view ear image to extract 2D ear shape four kinds of rich features for ear recognition. In addition, we utilize multi-view ear images to reconstruct 3D ear shape, and a neural network 3D ear registration method is introduced also. Experimental results and comparison analysis show our multi-view based strategy will be a promising approach for ear biometrics.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"118 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":"131995759","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 Colour Correlation-Based Stereo Matching Using 1D Windows","authors":"S. Lefebvre, S. Ambellouis, F. Cabestaing","doi":"10.1109/SITIS.2007.25","DOIUrl":"https://doi.org/10.1109/SITIS.2007.25","url":null,"abstract":"In this paper, we propose an original approach to colour correlation-based stereo matching with mono-dimensional windows. The result of the algorithm is a quasi-dense disparity map associated with its confidence map. For each pixel, correlation indices are computed for several widths of windows and several positions of the current pixel. Three criteria, extracted from each correlation curve, are combined by a fuzzy filter to define a confidence measure. A basic decision rule computes the disparity value and its associated confidence for most of the image pixels. A first study shows results obtained on grey level images with our 1D method and a classical 2D method. The method is applied to the RGB colour space: three disparity maps are computed and fused to compute the final disparity map. The method is validated on the Tsukuba image pair. On the first hand, we show that our method presents lower error rates with the RGB colour space than with the grey level image for identical density rates. On the other hand, our results are compared with those obtained using similar colour 2D methods (presented on the Middlebury Website). Our algorithm is ranked in the first places for each area of the image.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"44 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":"128115030","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 Study on the Dynamic Time Warping in Kernel Machines","authors":"H. Lei, Bing-Yu Sun","doi":"10.1109/SITIS.2007.112","DOIUrl":"https://doi.org/10.1109/SITIS.2007.112","url":null,"abstract":"The dynamic time warping (DTW) is state-of-the-art distance measure widely used in sequential pattern matching and it outperforms Euclidean distance in most cases because its matching is elastic and robust. It is tempting to substitute DTW distance for Euclidean distance in the Gaussian RBF kernel and plug it into the state-of-the art classifier support vector machines (SVMs) for sequence classification. However, it is not straightforward that DTW also outperforms Euclidean distance in kernel machines. While counter-examples can be found to numerically prove that DTW is not positive definite symmetric (PDS)acceptable by SVM, little is known why it can not be PDS theoretically. We analyze the DTW kernel and complete a theoretical proof via the connection between PDS kernel and reproducing kernel Hilbert space (RKHS). Our analysis leads to a better understanding that all Hilbertian metrics can be be converted to a PDS kernel in the Gaussian form, while the reverse is not true. The proof can be extended to conclude that elastic matching distance is not eligible to construct PDS kernels (e.g., Edit distance). Experiments were conducted to compare the RBF-kernel and DTW kernel in SVM classifications and the results show that simple Euclidean distance outperforms DTW in kernel machines.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"27 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":"123570403","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 Semantic Framework for Spatiotemporal Data Representation","authors":"Peiquan Jin, Shouhong Wan, Lihua Yue","doi":"10.1109/SITIS.2007.31","DOIUrl":"https://doi.org/10.1109/SITIS.2007.31","url":null,"abstract":"Spatiotemporal databases have received much attention since more and more applications, such as environment management and land management, have shown urgent requirements on the management of spatiotemporal information. But different applications have different requirements on describing spatiotemporal objects and spatiotemporal changes, and there is no systematic foundation for the modeling of spatiotemporal data. In this paper, we first study the characteristics of spatiotemporal changes. And then we build a semantic framework for the representation of spatiotemporal data. Spatiotemporal changes are classified into six types. We use three elements to represent these spatiotemporal changes, which are called lifecycle, descriptor and transformation. Through the three elements, a fundamental framework to model spatiotemporal data is achieved.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"4 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":"124782665","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}