{"title":"Spatial Clustering of Wireless Sensor Network Nodes Based on Packet Loss","authors":"Ahmed Y. Tawfik, R. El-Marakby","doi":"10.1109/ISSPIT.2007.4458042","DOIUrl":"https://doi.org/10.1109/ISSPIT.2007.4458042","url":null,"abstract":"This paper examines the problem of grouping wireless sensor nodes forming a network into a set of spatial clusters. The technique for grouping the nodes proposed here, exploits the spatial degradation in wireless signals to group the nodes into regions based on the packet loss rate. The technique is validated on datasets obtained from actual wireless sensor networks. The obtained results support the validity of the proposed approach.","PeriodicalId":299267,"journal":{"name":"2007 IEEE International Symposium on Signal Processing and Information Technology","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124368938","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}
Amal Abdel-Karim, Aboul-Hassan, Amin Fahmy Shoukry, Bibliotheca Alexandrina
{"title":"A New Motion-Texture Graph for Generating Real-time Realistic Human Motions","authors":"Amal Abdel-Karim, Aboul-Hassan, Amin Fahmy Shoukry, Bibliotheca Alexandrina","doi":"10.1109/ISSPIT.2007.4458208","DOIUrl":"https://doi.org/10.1109/ISSPIT.2007.4458208","url":null,"abstract":"Motion-Texture synthesis is a new field of research which aims at generating new human motions from a given motion capture (MoCap) data. The success of such techniques depends on the right selection of interpolation and distance functions among the motion data. Although the quaternion representation is the most mathematically accurate one, it is usually avoided due to the heavy computations needed. This paper proposes a fast technique for Motion-Texture synthesis using qauternions and based on Markov Random Fields Model (MRF) model. The current work proposes a new Motion-Texture Graph called Quaternions MRF Motion- Texture Graph (QMMTG). QMMTG technique uses quaternions to devise a proposed fast matching criterion and a proposed simple method for smoother transitions among QMMTG nodes. QMMTG technique manages to generate a wider range of new motions and even better results in some cases. Besides, the smoothing algorithm has perceptually enhanced the resulting motions in comparison to the previous works. The authors envision QMMTG as a start for benefiting from the quaternions accuracy in real-time Motion- Texture synthesis applications.","PeriodicalId":299267,"journal":{"name":"2007 IEEE International Symposium on Signal Processing and Information Technology","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116921880","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}
K. Nishitani, G. Sugimura, H. Kobayashi, K. Fukuda, A. Kawanaka
{"title":"Efficient Synthesis of Arbitrary Viewpoint Images Using 3-D Geometric Model and Mesh-Based Specular Reflection Tracing","authors":"K. Nishitani, G. Sugimura, H. Kobayashi, K. Fukuda, A. Kawanaka","doi":"10.1109/ISSPIT.2007.4458151","DOIUrl":"https://doi.org/10.1109/ISSPIT.2007.4458151","url":null,"abstract":"A novel image synthesis method of an object at arbitrary viewpoint by using the 3-D geometric model and several camera images is proposed. Although the image-based rendering synthesizes the relatively accurate diffuse reflection component from the camera images from different viewpoints, it can not synthesize the specular reflection component with sufficient accuracy as the movement of the specular reflection component as the changes in viewpoints are not taken into consideration. In order to overcome this problem, we propose a method for synthesizing the arbitrary viewpoint images with the use of the displacement vectors of the specular reflection components. The displacement vectors are estimated by a hexagonal matching algorithm based on the triangle mesh model which was modified for arbitrary shaped images. In the hexagonal matching, the images synthesized from 3-D geometric model of a real object and camera images are used as reference image. The experiments show that the proposed method reconstructs the specular reflection components more accurately and also improves the coding performance compared to the conventional methods.","PeriodicalId":299267,"journal":{"name":"2007 IEEE International Symposium on Signal Processing and Information Technology","volume":"130 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113953570","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}
Hyunki Baik, Kue-Hwan Sihn, Yun-il Kim, Sehyun Bae, Najeong Han, H. Song
{"title":"Analysis and Parallelization of H.264 decoder on Cell Broadband Engine Architecture","authors":"Hyunki Baik, Kue-Hwan Sihn, Yun-il Kim, Sehyun Bae, Najeong Han, H. Song","doi":"10.1109/ISSPIT.2007.4458128","DOIUrl":"https://doi.org/10.1109/ISSPIT.2007.4458128","url":null,"abstract":"Emerging video coding technology like H.264/AVC achieves high compression efficiency, which enables high quality video at the same or lower bitrate. However, those advanced coding techniques come at the cost of more computational power. Developed with such multimedia applications in mind, the CELL broadband engine (BE) processor was designed as a heterogeneous on-chip multicore processor to meet the required high performance. In this paper, we analyze the computational requirements of H.264 decoder per-module basis and implement parallelized H.264 decoder on the CELL processor based on the profile result. We propose and implement a hybrid partitioning technique that combines both functional and data partitioning to avoid the dependencies imposed by H.264 decoder, and optimize it using SIMD instructions. Through experiments, the parallelized H.264 decoder runs about 3.5 times faster than the single core (PPE only) decoder, by using 1 PPE and 4 SPEs.","PeriodicalId":299267,"journal":{"name":"2007 IEEE International Symposium on Signal Processing and Information Technology","volume":"391 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123962046","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":"Detecting Digital Image Forgeries Through Weighted Local Entropy","authors":"Chi Zhang, Hongbin Zhang","doi":"10.1109/ISSPIT.2007.4458021","DOIUrl":"https://doi.org/10.1109/ISSPIT.2007.4458021","url":null,"abstract":"In this paper, we propose a new method that could reveal some traces that were left in the tampered digital images without using watermarking technique. Our method is based on detecting the presence of feather operation, which is particularly useful to create a smooth transition between the selected region and its surroundings. The similarity of pixel neighborhood is used as weight coefficient to modulate local entropy value. The forged region can be determined by the value of weighted local entropy precisely. Results of experiments on tampered images will be given.","PeriodicalId":299267,"journal":{"name":"2007 IEEE International Symposium on Signal Processing and Information Technology","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127068150","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}
N. Sgouros, I. Constantinou, G. Loudos, S.A. Kossida
{"title":"Use of the MPEG-4 ALS Architecture and Inter-channel Prediction for Multi-channel ECG Coding","authors":"N. Sgouros, I. Constantinou, G. Loudos, S.A. Kossida","doi":"10.1109/ISSPIT.2007.4458176","DOIUrl":"https://doi.org/10.1109/ISSPIT.2007.4458176","url":null,"abstract":"The electrocardiogram (ECG) is one of the most well studied medical signals. A large number of ECG processing algorithms have being proposed over the years covering the areas of ECG noise filtering, automated diagnostic interpretation and coding. In this work, we propose a robust multi-channel ECG encoder architecture, which operates on 12-channel ECG data. The encoder utilizes highly efficient multi-linear patient specific models for inter-channel prediction and the MPEG-4 audio lossless coding (ALS) architecture for intra-channel prediction and coding. The results of the algorithm show improved performance over standard encoding techniques.","PeriodicalId":299267,"journal":{"name":"2007 IEEE International Symposium on Signal Processing and Information Technology","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121949713","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":"Fast Digital Image Colorization Technique","authors":"Przemyslaw Lagodzinski, Bogdan Smolka, Przemyslaw Lagodzinski@polsl Pl, Pl","doi":"10.1109/ISSPIT.2007.4458137","DOIUrl":"https://doi.org/10.1109/ISSPIT.2007.4458137","url":null,"abstract":"Colorization is a term used to describe a computerized process for adding color to black and white pictures, movies or TV programs. This process involves replacing a scalar value stored at each pixel of the gray scale image that represents its intensity or luminance by a vector in a three dimensional color space with luminance, saturation and hue or simply RGB. Since mapping between intensity and color has no inherently \"correct\" solution, human interaction and/or external information usually play a large role. In this paper we present a novel colorization method that takes advantage of the morphological distance transformation and image structures to propagate color within the gray scale image. The proposed method does not need precise segmentation, since the color is provided simply by scribbles which are next automatically propagated within the image. The effectiveness of the algorithm allows the user to work interactively and to obtain the desired results promptly after providing the color scribbles. In the paper we show that the proposed method allows for high quality colorization results for still images.","PeriodicalId":299267,"journal":{"name":"2007 IEEE International Symposium on Signal Processing and Information Technology","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127099819","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}
N. Tahir, A. Hussain, M. Mustafa, S. Samad, Hafizah Husin
{"title":"Fourier Descriptor for Pedestrian Shape Recognition using Support Vector Machine","authors":"N. Tahir, A. Hussain, M. Mustafa, S. Samad, Hafizah Husin","doi":"10.1109/ISSPIT.2007.4458054","DOIUrl":"https://doi.org/10.1109/ISSPIT.2007.4458054","url":null,"abstract":"The main objective of this study is to analyse Fourier Descriptor (FD) as feature vectors for pedestrian shape representation and recognition. FD is chosen since it is the best known boundary based shape descriptor and has proven to outperform most other boundary based methods in terms of accuracy. FD is also invariant to geometric transformations and has good noise tolerance. Initial results showed that using 10 descriptors of both low and high frequency components of pedestrian and vehicle shapes are sufficient for recognition based on high classification rate achieved. Moreover, the tremendous performance of Support Vector Machine (SVM) as classifier is confirmed based on the Kappa Score calculated. These findings have proven that our method is an effective approach for pedestrian recognition.","PeriodicalId":299267,"journal":{"name":"2007 IEEE International Symposium on Signal Processing and Information Technology","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126950665","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":"Closed frequent itemsets mining and structuring association rules based on Q-analysis","authors":"A. Boulmakoul, Abdelfatah Idri, R. Marghoubi","doi":"10.1109/ISSPIT.2007.4458017","DOIUrl":"https://doi.org/10.1109/ISSPIT.2007.4458017","url":null,"abstract":"Association rule discovering is one of the most important procedures in data mining. Lattice theory paradigm has been successfully used for the association rule mining. In particular, the theoretical foundation based on the field of Galois lattice has been used in the design of efficient algorithm for mining the frequent itemsets in transactional database. In this paper we describe a formal framework for the problem of mining closed frequent itemsets, where theoretical foundation is based on the algebraic topology. By means of Q-analysis and according to intrinsic q-values, an approximative closed frequent itemsets can be extracted. In data mining process, a large number of association rules are discovered. In this paper we also show how the algebraic topology-theoretic framework can be used to organize association rules by means of metarules.","PeriodicalId":299267,"journal":{"name":"2007 IEEE International Symposium on Signal Processing and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130049653","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}
Abhishek Agarwal, T. El-Ghazawi, Hesham El-Askary, Jacquline Le-Moigne
{"title":"Efficient Hierarchical-PCA Dimension Reduction for Hyperspectral Imagery","authors":"Abhishek Agarwal, T. El-Ghazawi, Hesham El-Askary, Jacquline Le-Moigne","doi":"10.1109/ISSPIT.2007.4458191","DOIUrl":"https://doi.org/10.1109/ISSPIT.2007.4458191","url":null,"abstract":"Hyperspectral systems have improved significantly through recent advancements in sensor technology, which have made possible to acquire data with several hundred channels. These advances provide the possible benefit of not only collecting more detailed information than previously possible, but also of producing more accurate data. Some of the major challenges in handling such large data sets are removing redundant information and assuring the continued relevance of vital information to the application at hand. For example, conventional methods for land use and land cover classifications may not be applicable, due to the large data volumes used to characterize hyperspectral cubes. Therefore, these conventional methods may require a preprocessing step, namely dimension reduction. Dimension reduction can be seen as a transformation from a high order dimension to a low order dimension in order to conquer the so- called \"curse of the dimensionality,\" which eliminates data redundancy. Principal Component Analysis (PCA) is one such data reduction technique, which is often used when analyzing remotely sensed data. In computing the principal components, the eigenvalues of the covariance matrix of the 3-D image must be computed. Since this is a global operation it requires high computational resources and requires whole image to be stored which increases memory requirements. This paper reports an hierarchical algorithm, which can effectively reduce the hyperspectral data to intrinsic dimensionality. In the hierarchical PCA, we break the image into various parts and then perform PCA on each part separately and then combine the results. The classification results over the original and the resulting reduced data have been compared. The results show that reduced data obtained by hierarchical PCA can compare favorably to the results obtained from original data.","PeriodicalId":299267,"journal":{"name":"2007 IEEE International Symposium on Signal Processing and Information Technology","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116609791","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}