Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.最新文献_第3页

2D spatial-frequency processing based audio coding for real time wireless transmission 基于二维空频处理的实时无线传输音频编码

Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005. Pub Date : 2005-12-21 DOI: 10.1109/ISSPIT.2005.1577071

G. Luo

{"title":"2D spatial-frequency processing based audio coding for real time wireless transmission","authors":"G. Luo","doi":"10.1109/ISSPIT.2005.1577071","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577071","url":null,"abstract":"Wireless systems are often subject to bandwidth or cost constraints which are incompatible with high data rates. The key enabling technology for digital audio wireless products is data compression. For real time wireless transmission, very low encoding and decoding delay has become an essential prerequisite. In live productions, the tolerable total delay time is less than a few milliseconds. Current audio coding schemes like MPEG standards or wavelet techniques can hardly reach such a threshold by using overlapping frames of input signal with psychoacoustic model. This paper presents a two dimensional (2D) spatial-frequency processing based audio coder with ultra low delay for real time wireless applications using non-overlapping short block processing and embedded coding. 2D fast lifting wavelet transform with boundary effects minimized is developed for further exploring the correlation of the audio signal. A modified 2D SPIHT (set partitioning in hierarchical trees) algorithm with more bits used to encode the wavelet coefficients and transmitting fewer bits in the sorting pass, is implemented to reduce the correlation between the coefficients at different decomposition levels and inside each band at scalable bit rates. The experiment shows the proposed coder is efficient and has low complexity with less memory requirements in implementation","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"206 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116607849","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}

引用次数: 1

A robust steganography algorithm based on texture similarity using Gabor filter 基于纹理相似度的Gabor滤波鲁棒隐写算法

Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005. Pub Date : 2005-12-21 DOI: 10.1109/ISSPIT.2005.1577161

Z.Z. Kermani, M. Jamzad

{"title":"A robust steganography algorithm based on texture similarity using Gabor filter","authors":"Z.Z. Kermani, M. Jamzad","doi":"10.1109/ISSPIT.2005.1577161","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577161","url":null,"abstract":"The main concern of steganography (image hiding) methods is to embed a secret image into a host image in such a way that the host should remain as similar as possible to its original version. In addition the host image should remain robust with respect to usual attacks. In this paper we present a method that tries to cover all above mentioned concerns. The secret and host images are divided into blocks of size 4 times 4. Each block in secret image is taken as a texture pattern for which the most similar block is found among the blocks of the host image. The embedding procedure is carried on by replacing these small blocks of the secret image with blocks in host image in such a way that least distortion would be imposed on it. We have used Gabor filter to measure the similarity between texture patterns. The location addresses of blocks in host image which are replaced by blocks of secret image are saved. This data is converted to a bit string and then modified by Hamming code. This bit string is embedded in DCT coefficients of the modified host image using a key which is the seed of a random number generator. Our experimental results showed a high level of capacity, robustness and minimum distortion on standard images","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133592711","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}

引用次数: 32

Wyner-Ziv coding of three correlated Gaussian sources using punctured turbo codes 使用穿孔涡轮码的三个相关高斯源的Wyner-Ziv编码

Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005. Pub Date : 2005-12-21 DOI: 10.1109/ISSPIT.2005.1577122

K. Lajnef, C. Guillemot, P. Siohan

引用次数: 3

A new WOFDM design for high data rates in the case of trains communications 一种新的WOFDM设计，用于列车通信的高数据速率

Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005. Pub Date : 2005-12-21 DOI: 10.1109/ISSPIT.2005.1577171

T. Boukour, M. Chennaoui, A. Rivenq, J. Rouvaen, M. Berbineau

引用次数: 4

Blind restoration of images blurred by complex camera motion and simultaneous recovery of 3D scene structure 复杂摄像机运动模糊图像的盲恢复和三维场景结构的同步恢复

Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005. Pub Date : 2005-12-21 DOI: 10.1109/ISSPIT.2005.1577190

M. Šorel, J. Flusser

引用次数: 9

MRI left ventricle segmentation and reconstruction for the study of the heart dynamics MRI左心室分割与重建用于心脏动力学研究

Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005. Pub Date : 2005-12-21 DOI: 10.1109/ISSPIT.2005.1577098

S. Colantonio, D. Moroni, O. Salvetti

引用次数: 6

Should MIMO orthogonal space-time coding be preferred to non-orthogonal coding with iterative detection? MIMO正交空时编码是否优于迭代检测的非正交编码?

Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005. Pub Date : 2005-12-21 DOI: 10.1109/ISSPIT.2005.1577120

M. Khalighi, J. Hélard

引用次数: 8

On learning performance evaluation for some psycho-learning experimental work versus an optimal swarm intelligent system 基于最优群体智能系统的心理学习实验学习绩效评价

Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005. Pub Date : 2005-12-21 DOI: 10.1109/ISSPIT.2005.1577175

H. M. Hassan

{"title":"On learning performance evaluation for some psycho-learning experimental work versus an optimal swarm intelligent system","authors":"H. M. Hassan","doi":"10.1109/ISSPIT.2005.1577175","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577175","url":null,"abstract":"Some models closely related to animal psycho-learning, and a swarm intelligent system, are comparatively presented. More specifically, three introduced models are inspired by creatures' behavioral learning phenomenon, observed in nature. Two of presented models based on Pavlov's and Thorndike's excremental work. Pavlov's dog learns how to associate two inputs sensory stimuli (audible, and visual signals). Thorndike's cat behavioral learning that to get out from a cage for obtaining food. Each of behavioral learning models improves its performance by minimizing response time period. Additionally, other third model motivated by ant colony system (ACS). optimized performance. That model simulates a swarm (ant) intelligent system used for solving optimally traveling salesman problem (TSP). That by bringing food from different food sources to store (in cycles) at ant's nest. Moreover, three other learning models based on pulsed neurons criterion, parallel genetic algorithmic programming, and modified Hebbian learning paradigm (Oja's rule). Interestingly, those models shown to behave analogously to previously suggested: Pavlov's, Thorndike's and ACS models","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116161801","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}

引用次数: 14

On requirements and challenges of future network nodes 论未来网络节点的需求与挑战

Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005. Pub Date : 2005-12-21 DOI: 10.1109/ISSPIT.2005.1577099

G. Hjálmtýsson, H. Sverrisson

{"title":"On requirements and challenges of future network nodes","authors":"G. Hjálmtýsson, H. Sverrisson","doi":"10.1109/ISSPIT.2005.1577099","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577099","url":null,"abstract":"In spite of substantial amount of work on rapid service creation, active networking and modular routers, the convergence of routers and computers has not taken place. Instead, network nodes continue to be built either as routers or as end-systems, with new network services pushed even further out of routers and being offered over application layer overlays between end-systems. We conjecture that the inherent simplicity that end-system based overlays offer the network service creator (programmer) will continue to drive network services to end-systems. Still, end-system based overlays introduce significant management complexity, and fail to exploit underlying (hardware) capabilities, both specific hardware support and increasing agility of the lower layers. In this paper, we describe our work on router architectures and the requirements that we foresee future network nodes must satisfy to provide the simplicity that service programmers desire while effectively exploiting capabilities of the lower layers. The architecture incorporates end-systems, boundary gateways, and routers, however, isolating the details of nodal facilities from application and service programmers. The architecture is designed to self-configure and self-optimize each node, fully exploiting the hardware facilities at each node and across a network of nodes, without explicit instructions from network programmers. We discuss the elements of the architecture, the components we have constructed, and the challenges in realizing the remaining elements and ultimately in assembling them into an integrated networking system","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116162708","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}

引用次数: 1

Evaluation of dynamic tree-based data gathering algorithms for wireless sensor networks 基于动态树的无线传感器网络数据采集算法评估

Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005. Pub Date : 2005-12-21 DOI: 10.1109/ISSPIT.2005.1577090

M. Moh, M. Dumont, Teng-Sheng Moh

{"title":"Evaluation of dynamic tree-based data gathering algorithms for wireless sensor networks","authors":"M. Moh, M. Dumont, Teng-Sheng Moh","doi":"10.1109/ISSPIT.2005.1577090","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577090","url":null,"abstract":"One major challenge in sensor networks is to maximize network life under the constraint of extremely limited power supply. Thus, two important design issues of routing and data-gathering protocols are 1) minimizing energy consumption in sensor nodes and 2) adapting to node failures. This paper studies two tree-based data gathering protocols, based on distributed versions of shortest path tree (SPT) and maximum leaf tree (MLT) algorithms. Furthermore, the two distributed algorithms are extended to be dynamic and robust. A localized tree-reconstruction scheme, localized flooding algorithm, is added to handle joining and leaving (death) of sensor nodes. Accurate energy consumption has been modeled for both leaf-nodes and intermediate nodes, when sending and receiving control and data packets. The resulting dynamic algorithms are fast to adapt network changes. Performance is evaluated through detailed simulation. Comparing with MLT, due to its simplicity and smaller number of control message exchanges, SPT achieves better energy efficiency and less delay in tree constructions, data transmissions, and dynamic tree reconstructions","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116420083","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}

引用次数: 13