Pub Date : 2005-05-22DOI: 10.1109/EIT.2005.1626994
M. Ramkumar, N. Memon, R. Simha
We present an efficient, scalable, and renewable hierarchical random key predistribution (KPD) scheme as an enabler for a low complexity security infrastructure. As the proposed KPD scheme employs only symmetric cryptographic primitives it permits resource constrained nodes to take part in the deployment. Further, two nodes need to exchange only their IDs before they can establish a shared secret. The proposed KPD scheme provides scalable security for different levels of the hierarchy depending on available resources. In addition higher levels of the hierarchy are protected from security breaches in lower levels
{"title":"A hierarchical key pre-distribution scheme","authors":"M. Ramkumar, N. Memon, R. Simha","doi":"10.1109/EIT.2005.1626994","DOIUrl":"https://doi.org/10.1109/EIT.2005.1626994","url":null,"abstract":"We present an efficient, scalable, and renewable hierarchical random key predistribution (KPD) scheme as an enabler for a low complexity security infrastructure. As the proposed KPD scheme employs only symmetric cryptographic primitives it permits resource constrained nodes to take part in the deployment. Further, two nodes need to exchange only their IDs before they can establish a shared secret. The proposed KPD scheme provides scalable security for different levels of the hierarchy depending on available resources. In addition higher levels of the hierarchy are protected from security breaches in lower levels","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131289070","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}
Pub Date : 2005-05-22DOI: 10.1109/EIT.2005.1626967
A. Chowdhury
In an attempt to re-regulate the distribution segment of an electric power system, public utility commissions (PUCs) are increasingly adopting a reward/penalty framework in order to guarantee acceptable electric supply reliability. This reward/penalty framework is commonly known as performance based ratemaking (PBR). A PBR framework is introduced to provide distribution utilities with incentives for economic efficiency gains in the competitive generation and transmission markets. A distribution utility's historical reliability performance records could be utilized to create practical PBR mechanisms. This paper presents actual reliability performance history from two different Canadian utilities used to develop PBR frameworks for use in a re-regulated environment. An analysis of financial risk related to historic reliability data is presented by including reliability index probability distributions in a PBR plan. In addition, this paper identifies a number of factors and issues that should be considered in generating a PBR plan for a distribution utility. A brief analysis of cause contributions to reliability indices also is performed and presented in this paper. The historic reliability based PBR framework developed in this paper finds practical applications in the emerging deregulated electricity market
{"title":"Distribution system risk assessment based on historical reliability performance","authors":"A. Chowdhury","doi":"10.1109/EIT.2005.1626967","DOIUrl":"https://doi.org/10.1109/EIT.2005.1626967","url":null,"abstract":"In an attempt to re-regulate the distribution segment of an electric power system, public utility commissions (PUCs) are increasingly adopting a reward/penalty framework in order to guarantee acceptable electric supply reliability. This reward/penalty framework is commonly known as performance based ratemaking (PBR). A PBR framework is introduced to provide distribution utilities with incentives for economic efficiency gains in the competitive generation and transmission markets. A distribution utility's historical reliability performance records could be utilized to create practical PBR mechanisms. This paper presents actual reliability performance history from two different Canadian utilities used to develop PBR frameworks for use in a re-regulated environment. An analysis of financial risk related to historic reliability data is presented by including reliability index probability distributions in a PBR plan. In addition, this paper identifies a number of factors and issues that should be considered in generating a PBR plan for a distribution utility. A brief analysis of cause contributions to reliability indices also is performed and presented in this paper. The historic reliability based PBR framework developed in this paper finds practical applications in the emerging deregulated electricity market","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131483719","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}
Pub Date : 2005-05-22DOI: 10.1109/EIT.2005.1627055
Jinwen Xi, Zhaohui Huang, Peixin Zhong
System-on-chip (SoC) is increasingly adopted in VLSI world with the advancing silicon technologies. Integrating multiple functional IPs (intellectual property) onto a single die increases performance and saves power consumption by reducing interconnecting capacitance among these IPs. Embedded microprocessor acts as the central controlling unit of many SoCs to orchestrate all the other IPs to work harmoniously. Low and predictable energy consumption is often required for these systems. This paper proposes an empirical macro-modeling methodology allowing energy modeling at the system level. High-level macro-operations are characterized for energy consumption. This modeling framework is implemented for a MIPS-family microprocessor using SystemC, a system-level modeling and simulation environment. Using the JPEG encoder application as case study, a simulation speed-up of more than 200 times with the relative error of -6.70% on energy estimation is achieved compared to instruction-level simulators. Meanwhile, this model provides support to multiprocessor energy modeling, which is unavailable currently in the instruction-level energy simulators
{"title":"Energy macro-modeling of embedded microprocessor using SystemC","authors":"Jinwen Xi, Zhaohui Huang, Peixin Zhong","doi":"10.1109/EIT.2005.1627055","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627055","url":null,"abstract":"System-on-chip (SoC) is increasingly adopted in VLSI world with the advancing silicon technologies. Integrating multiple functional IPs (intellectual property) onto a single die increases performance and saves power consumption by reducing interconnecting capacitance among these IPs. Embedded microprocessor acts as the central controlling unit of many SoCs to orchestrate all the other IPs to work harmoniously. Low and predictable energy consumption is often required for these systems. This paper proposes an empirical macro-modeling methodology allowing energy modeling at the system level. High-level macro-operations are characterized for energy consumption. This modeling framework is implemented for a MIPS-family microprocessor using SystemC, a system-level modeling and simulation environment. Using the JPEG encoder application as case study, a simulation speed-up of more than 200 times with the relative error of -6.70% on energy estimation is achieved compared to instruction-level simulators. Meanwhile, this model provides support to multiprocessor energy modeling, which is unavailable currently in the instruction-level energy simulators","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"2020 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114073608","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}
Pub Date : 2005-05-22DOI: 10.1109/EIT.2005.1627038
A. Chalechale, F. Safaei, G. Naghdy, P. Premaratne
A new paradigm has been proposed for gesture selection and recognition. The paradigm is based on statistical classification, which has applications in telemedicine, virtual reality, computer games, and sign language studies. The aims of this paper are (1) how to select an appropriate set of gestures having a satisfactory level of discrimination power, and (2) comparison of invariant moments (conventional and Zernike) and geometric properties in recognizing hand gestures. Two-dimensional structures, namely cluster-property and cluster-features matrices, have been employed for gesture selection and to evaluate different gesture characteristics. Moment invariants, Zernike moments, and geometric features are employed for classification and recognition rates are compared. Comparative results confirm better performance of the geometric features
{"title":"Hand gesture selection and recognition for visual-based human-machine interface","authors":"A. Chalechale, F. Safaei, G. Naghdy, P. Premaratne","doi":"10.1109/EIT.2005.1627038","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627038","url":null,"abstract":"A new paradigm has been proposed for gesture selection and recognition. The paradigm is based on statistical classification, which has applications in telemedicine, virtual reality, computer games, and sign language studies. The aims of this paper are (1) how to select an appropriate set of gestures having a satisfactory level of discrimination power, and (2) comparison of invariant moments (conventional and Zernike) and geometric properties in recognizing hand gestures. Two-dimensional structures, namely cluster-property and cluster-features matrices, have been employed for gesture selection and to evaluate different gesture characteristics. Moment invariants, Zernike moments, and geometric features are employed for classification and recognition rates are compared. Comparative results confirm better performance of the geometric features","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122378866","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}
Pub Date : 2005-05-22DOI: 10.1109/EIT.2005.1627020
Huimin Geng, Xutao Deng, H. Ali
We propose a new technique, adaptive feature scaling (AFS), to improve the performance of clustering algorithm applied to gene microarray data. In AFS, every feature is assigned multiple weights, each for an individual cluster, and the weights are adaptively updated during the clustering process so that certain features (signals) are strengthened while others (noises) are diminished. Clustering with AFS results in low-noise clusters focuses on a small set of signal features. Moreover, the contribution of each feature to each cluster can be revealed by using different feature weights. We apply AFS in conjunction with the message passing clustering (MFC) algorithm to colon cancer data set to show the potential use of AFS in genetics research and medical diagnosis
{"title":"Mining gene microarray data with adaptive feature scaling","authors":"Huimin Geng, Xutao Deng, H. Ali","doi":"10.1109/EIT.2005.1627020","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627020","url":null,"abstract":"We propose a new technique, adaptive feature scaling (AFS), to improve the performance of clustering algorithm applied to gene microarray data. In AFS, every feature is assigned multiple weights, each for an individual cluster, and the weights are adaptively updated during the clustering process so that certain features (signals) are strengthened while others (noises) are diminished. Clustering with AFS results in low-noise clusters focuses on a small set of signal features. Moreover, the contribution of each feature to each cluster can be revealed by using different feature weights. We apply AFS in conjunction with the message passing clustering (MFC) algorithm to colon cancer data set to show the potential use of AFS in genetics research and medical diagnosis","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114985460","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}
Pub Date : 2005-05-22DOI: 10.1109/EIT.2005.1627011
W. E. Allen, J. N. Sundermeyer
The Structural Health with Integrated Electronic Life Determination (SHIELD) System is under development by Caterpillar Inc. in conjunction with Motorola Inc., Mictrostrain, Inc., and Native American Technologies. The development is entering its final year of funding from the National Institute of Standards and Technology as part of its Advanced Technology Program. The system is an information management system for earthmoving machines with a focus on structural health. It consists of a suite of wireless strain, load, pressure, and other machine sensors, and a centralized machine processor. The system is designed to analyze the sensor data in near real-time to determine the machine's structural loading, assess its remaining structural life, and identify structural failures early, before damage is severe
结构健康集成电子寿命测定(SHIELD)系统由卡特彼勒公司与摩托罗拉公司、microstrain公司和Native American Technologies公司联合开发。作为美国国家标准与技术研究院先进技术项目的一部分，该项目正进入其获得资助的最后一年。本系统是一个以结构健康为重点的土方机械信息管理系统。它由一套无线应变、负载、压力和其他机器传感器以及一个集中式机器处理器组成。该系统旨在近乎实时地分析传感器数据，以确定机器的结构载荷，评估其剩余结构寿命，并在损坏严重之前及早识别结构故障
{"title":"A structural health monitoring system for earthmoving machines","authors":"W. E. Allen, J. N. Sundermeyer","doi":"10.1109/EIT.2005.1627011","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627011","url":null,"abstract":"The Structural Health with Integrated Electronic Life Determination (SHIELD) System is under development by Caterpillar Inc. in conjunction with Motorola Inc., Mictrostrain, Inc., and Native American Technologies. The development is entering its final year of funding from the National Institute of Standards and Technology as part of its Advanced Technology Program. The system is an information management system for earthmoving machines with a focus on structural health. It consists of a suite of wireless strain, load, pressure, and other machine sensors, and a centralized machine processor. The system is designed to analyze the sensor data in near real-time to determine the machine's structural loading, assess its remaining structural life, and identify structural failures early, before damage is severe","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130213126","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}
Pub Date : 2005-05-22DOI: 10.1142/S0218126609005678
William R. Roberts, D. Velenis
Violations in the timing constraints of a clocked register can cause a synchronous system to malfunction. The effects of parameter variations on the timing characteristics of registers that determine the timing constraints are investigated in this paper. The sensitivity of the setup time and data propagation delay on parameter variations is demonstrated for three different register designs that represent different tradeoff choices between performance and power dissipation. The robustness of each register design under variations in power supply voltage, temperature, and gate oxide thickness is discussed
{"title":"Effects of parameter variations on timing characteristics of clocked registers","authors":"William R. Roberts, D. Velenis","doi":"10.1142/S0218126609005678","DOIUrl":"https://doi.org/10.1142/S0218126609005678","url":null,"abstract":"Violations in the timing constraints of a clocked register can cause a synchronous system to malfunction. The effects of parameter variations on the timing characteristics of registers that determine the timing constraints are investigated in this paper. The sensitivity of the setup time and data propagation delay on parameter variations is demonstrated for three different register designs that represent different tradeoff choices between performance and power dissipation. The robustness of each register design under variations in power supply voltage, temperature, and gate oxide thickness is discussed","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128648421","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}
Pub Date : 2005-05-22DOI: 10.1109/EIT.2005.1627041
A. Evans, J. Sikorski, P. Thomas, Sung-Hyuk Cha, C. Tappert, Jie Zou, A. Gattani, G. Nagy
The distinctive aspect of the CAVIAR technology is a visible, parameterized geometrical model that serves as the human-computer communication channel. Evaluation of CAVIAR flower and face recognition systems shows that their accuracy is much higher than that of the machine alone; their recognition time is much lower than that of the human alone; they can be initialized with a single reference sample per class; and they improve with use. CAVIAR-flower has been ported to stand-alone and to wireless laptop-client personal digital assistants (PDAs)
{"title":"Computer assisted visual interactive recognition (CAVIAR) technology","authors":"A. Evans, J. Sikorski, P. Thomas, Sung-Hyuk Cha, C. Tappert, Jie Zou, A. Gattani, G. Nagy","doi":"10.1109/EIT.2005.1627041","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627041","url":null,"abstract":"The distinctive aspect of the CAVIAR technology is a visible, parameterized geometrical model that serves as the human-computer communication channel. Evaluation of CAVIAR flower and face recognition systems shows that their accuracy is much higher than that of the machine alone; their recognition time is much lower than that of the human alone; they can be initialized with a single reference sample per class; and they improve with use. CAVIAR-flower has been ported to stand-alone and to wireless laptop-client personal digital assistants (PDAs)","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128966432","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}
Pub Date : 2005-05-22DOI: 10.1109/EIT.2005.1627016
Shyi-Tsong Wu, J. Chiu, Bin-Chang Chieu
Multicast communication is an efficient way to send data to a group of participants and its security issue has received a great deal of attention. As members can join or leave a multicast group dynamically, to guarantee confidentiality, it has to have a dynamic key management mechanism. In this paper, we apply the pairings on elliptic curve and propose an efficient and scalable distributed key management protocol for secure multicasting. In our proposed protocol, the communication group is divided into subgroups and the key renewing is confined to local subgroup level while members join or leave the communication group. The inheriting merits of ECC make our protocol result in bandwidth saving, smaller system parameters, lower communication cost and suit to the wireless and mobile communications specially
{"title":"Scalable secure multicasting with distributed key management from pairings","authors":"Shyi-Tsong Wu, J. Chiu, Bin-Chang Chieu","doi":"10.1109/EIT.2005.1627016","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627016","url":null,"abstract":"Multicast communication is an efficient way to send data to a group of participants and its security issue has received a great deal of attention. As members can join or leave a multicast group dynamically, to guarantee confidentiality, it has to have a dynamic key management mechanism. In this paper, we apply the pairings on elliptic curve and propose an efficient and scalable distributed key management protocol for secure multicasting. In our proposed protocol, the communication group is divided into subgroups and the key renewing is confined to local subgroup level while members join or leave the communication group. The inheriting merits of ECC make our protocol result in bandwidth saving, smaller system parameters, lower communication cost and suit to the wireless and mobile communications specially","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116129123","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}
Pub Date : 2005-05-22DOI: 10.1109/EIT.2005.1626986
Z. Arnavut, F. Sahin
Palette images are widely used in World Wide Web (WWW) and game cartridges applications. Many image used in the WWW are stored and transmitted after they are compressed losslessly with the standard graphics interchange format (GIF), or portable network graphic (PNG). Well known two dimensional compression scheme; such as JPEG-LS and CALIC, fails to yield better compression than GIF or PNG, due to the fact that the pixel value represent indices that point to color values in a look-up table. The GIF standard uses Lempel-Ziv compression, which treats the image as a one-dimensional sequence of index values, ignoring two-dimensional nature. Bzip, another universal compressor, yields even better compression gain that the GIF, PNG, JPEG-LS, and CALIC. Variants of block sorting coders, such as Bzip2, utilize Burrows-Wheeler transformation (BWT) by Burrows M. and Wheeler D. J. (1994), followed by move-to-front (MTF) transformation by Bentley J. L. (1986), Elias, P (1987) before using a statistical coder at the final stage. In this paper, we show that the compression performance of block sorting coder can be improved almost 14% on average by utilizing inversion ranks instead of the move-to-front coding
调色板图像广泛用于万维网(WWW)和游戏卡带应用程序。万维网中使用的许多图像都是用标准图形交换格式(GIF)或便携式网络图形(PNG)进行无损压缩后存储和传输的。众所周知的二维压缩格式;如JPEG-LS和CALIC，不能产生比GIF或PNG更好的压缩，因为像素值表示指向查找表中颜色值的索引。GIF标准使用Lempel-Ziv压缩，它将图像视为索引值的一维序列，忽略二维性质。Bzip是另一种通用压缩器，比GIF、PNG、JPEG-LS和CALIC产生更好的压缩效果。块排序编码器的变体，如Bzip2，利用Burrows M.和Wheeler D. J.(1994)的Burrows-Wheeler变换(BWT)，然后是Bentley J. L. (1986)， Elias, P .(1987)的移动到前面(MTF)变换，然后在最后阶段使用统计编码器。在本文中，我们证明了块排序编码器的压缩性能可以通过使用倒排而不是移动到前面的编码平均提高近14%
{"title":"Inversion ranks for lossless compression of color palette images","authors":"Z. Arnavut, F. Sahin","doi":"10.1109/EIT.2005.1626986","DOIUrl":"https://doi.org/10.1109/EIT.2005.1626986","url":null,"abstract":"Palette images are widely used in World Wide Web (WWW) and game cartridges applications. Many image used in the WWW are stored and transmitted after they are compressed losslessly with the standard graphics interchange format (GIF), or portable network graphic (PNG). Well known two dimensional compression scheme; such as JPEG-LS and CALIC, fails to yield better compression than GIF or PNG, due to the fact that the pixel value represent indices that point to color values in a look-up table. The GIF standard uses Lempel-Ziv compression, which treats the image as a one-dimensional sequence of index values, ignoring two-dimensional nature. Bzip, another universal compressor, yields even better compression gain that the GIF, PNG, JPEG-LS, and CALIC. Variants of block sorting coders, such as Bzip2, utilize Burrows-Wheeler transformation (BWT) by Burrows M. and Wheeler D. J. (1994), followed by move-to-front (MTF) transformation by Bentley J. L. (1986), Elias, P (1987) before using a statistical coder at the final stage. In this paper, we show that the compression performance of block sorting coder can be improved almost 14% on average by utilizing inversion ranks instead of the move-to-front coding","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123332589","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：