Pub Date : 2006-10-15DOI: 10.1093/ietisy/e89-d.10.2682
Kebin An, Jun Sun, Weina Du
This paper proposes a fast and reliable image objective quality evaluation technique. This method takes into account the local homogeneous property of the image and uses the local luminance and homogeneity estimation based on high-pass operators to evaluate the image quality. The proposed method provides better consistency with the perceived image quality and is suitable for real applications to control the processed image quality.
{"title":"Homogeneity based image objective quality metric","authors":"Kebin An, Jun Sun, Weina Du","doi":"10.1093/ietisy/e89-d.10.2682","DOIUrl":"https://doi.org/10.1093/ietisy/e89-d.10.2682","url":null,"abstract":"This paper proposes a fast and reliable image objective quality evaluation technique. This method takes into account the local homogeneous property of the image and uses the local luminance and homogeneity estimation based on high-pass operators to evaluate the image quality. The proposed method provides better consistency with the perceived image quality and is suitable for real applications to control the processed image quality.","PeriodicalId":385759,"journal":{"name":"2005 International Symposium on Intelligent Signal Processing and Communication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128603038","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-12-13DOI: 10.1109/ISPACS.2005.1595513
Zhongwei Zhang, D. Lai, Shan Suthaharan
The layering technique has divided TCP/IP protocols into a few layers and assigned each layer with some special functionality. The mechanism of flow and congestion control in TCP at the transport layer can be dispersed to IP at the network layer where there used to be a simple strategy (ie. drop-tail) of managing the router's buffer. Active queue management can improve network efficiency by detecting impending congestions in Internet routers. The first such effort was random early detection (RED) introduced in the early 1990s, and a number of active queue management algorithms have been developed since then. The essence of AQMs is to adjust the packet dropping rate before the buffer becomes completely full. The dropping probability is a determining factor in affecting the overall throughput and transmission delay. Various AQM algorithms have been developed to produce a just-right dropping rate largely based on the statistical data. Unfortunately, all these algorithms possess some drawbacks in one way or another. In this paper, we devise a unified approach to determining the packet dropping possibility, which is sensitive to all factors that might have some ultimate effect on the buffer's occupancy. The proposed approach has been tested on a simple network using OMNET++ [A. Varga].
{"title":"A unified approach to ameliorate active queue management of network routers","authors":"Zhongwei Zhang, D. Lai, Shan Suthaharan","doi":"10.1109/ISPACS.2005.1595513","DOIUrl":"https://doi.org/10.1109/ISPACS.2005.1595513","url":null,"abstract":"The layering technique has divided TCP/IP protocols into a few layers and assigned each layer with some special functionality. The mechanism of flow and congestion control in TCP at the transport layer can be dispersed to IP at the network layer where there used to be a simple strategy (ie. drop-tail) of managing the router's buffer. Active queue management can improve network efficiency by detecting impending congestions in Internet routers. The first such effort was random early detection (RED) introduced in the early 1990s, and a number of active queue management algorithms have been developed since then. The essence of AQMs is to adjust the packet dropping rate before the buffer becomes completely full. The dropping probability is a determining factor in affecting the overall throughput and transmission delay. Various AQM algorithms have been developed to produce a just-right dropping rate largely based on the statistical data. Unfortunately, all these algorithms possess some drawbacks in one way or another. In this paper, we devise a unified approach to determining the packet dropping possibility, which is sensitive to all factors that might have some ultimate effect on the buffer's occupancy. The proposed approach has been tested on a simple network using OMNET++ [A. Varga].","PeriodicalId":385759,"journal":{"name":"2005 International Symposium on Intelligent Signal Processing and Communication Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123385726","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 : 1900-01-01DOI: 10.1109/ISPACS.2005.1595423
Xiaojing Huang
This paper presents simple software and hardware implementations for a class of mutually orthogonal complementary sets of sequences based on its closed-form construction formula. Following a brief review of the Golay-paired Hadamard matrix concept, the flow graph for constructing mutually orthogonal Golay-paired Hadamard matrices, which represent the scalable complete complementary sets of sequences, is proposed. Then, their superb scalability and completeness are summarized. Finally, the C and Matlab functions and a logic schematic diagram are given to easily generate these complementary sequences.
{"title":"Simple implementations of mutually orthogonal complementary sets of sequences","authors":"Xiaojing Huang","doi":"10.1109/ISPACS.2005.1595423","DOIUrl":"https://doi.org/10.1109/ISPACS.2005.1595423","url":null,"abstract":"This paper presents simple software and hardware implementations for a class of mutually orthogonal complementary sets of sequences based on its closed-form construction formula. Following a brief review of the Golay-paired Hadamard matrix concept, the flow graph for constructing mutually orthogonal Golay-paired Hadamard matrices, which represent the scalable complete complementary sets of sequences, is proposed. Then, their superb scalability and completeness are summarized. Finally, the C and Matlab functions and a logic schematic diagram are given to easily generate these complementary sequences.","PeriodicalId":385759,"journal":{"name":"2005 International Symposium on Intelligent Signal Processing and Communication Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121234435","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 : 1900-01-01DOI: 10.1109/ISPACS.2005.1595424
N. Wong, Venkataramanan Balakrishnan
Algebraic Riccati equations (AREs) spread over many branches of signal processing and system design problems. Solution of large scale AREs, however, can be computationally prohibitive. This paper introduces a novel second order extension to the alternating direction implicit (ADI) iteration, called quadratic ADI or QADI, for the efficient solution of an ARE. QADI is simple to code and exhibits fast convergence. A Cholesky factor variant of QADI, called CFQADI, further accelerates computation by exploiting low rank matrices commonly found in physical system modeling. Application examples show remarkable efficiency and scalability of the QADI algorithms over conventional ARE solvers.
{"title":"Quadratic alternating direction implicit iteration for the fast solution of algebraic Riccati equations","authors":"N. Wong, Venkataramanan Balakrishnan","doi":"10.1109/ISPACS.2005.1595424","DOIUrl":"https://doi.org/10.1109/ISPACS.2005.1595424","url":null,"abstract":"Algebraic Riccati equations (AREs) spread over many branches of signal processing and system design problems. Solution of large scale AREs, however, can be computationally prohibitive. This paper introduces a novel second order extension to the alternating direction implicit (ADI) iteration, called quadratic ADI or QADI, for the efficient solution of an ARE. QADI is simple to code and exhibits fast convergence. A Cholesky factor variant of QADI, called CFQADI, further accelerates computation by exploiting low rank matrices commonly found in physical system modeling. Application examples show remarkable efficiency and scalability of the QADI algorithms over conventional ARE solvers.","PeriodicalId":385759,"journal":{"name":"2005 International Symposium on Intelligent Signal Processing and Communication Systems","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126358063","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 : 1900-01-01DOI: 10.1109/ISPACS.2005.1595475
Xianhua Dai, Zhiming Dai
The motif detection problem has been well studied and several algorithms have been developed in the past few years. Although some are better than the others in a sense, yet not a single one is recognized to be the best. However, since Pevzner and Sze defined a "challenge problem" in motif detection, most of the algorithms, which were considered to be good, have showed their inability to solve this problem. Then some new algorithms have been proposed to solve this "challenge problem", but the computation cost is a big problem all the same. In this paper, we present a new method based on multiple pairwise alignment to solve the "challenge problem" with less computation cost than the existing methods. This new method combines profile-driven method with pattern-driven method. So it has the advantages of both profile-driven method and pattern-driven method. It has high success rate in finding the motif and less computation cost. We refer to the new method as FMMPA (finding motif based on multiple pairwise alignment).
{"title":"Finding transcription factor binding sites based on multiple pairwise alignment","authors":"Xianhua Dai, Zhiming Dai","doi":"10.1109/ISPACS.2005.1595475","DOIUrl":"https://doi.org/10.1109/ISPACS.2005.1595475","url":null,"abstract":"The motif detection problem has been well studied and several algorithms have been developed in the past few years. Although some are better than the others in a sense, yet not a single one is recognized to be the best. However, since Pevzner and Sze defined a \"challenge problem\" in motif detection, most of the algorithms, which were considered to be good, have showed their inability to solve this problem. Then some new algorithms have been proposed to solve this \"challenge problem\", but the computation cost is a big problem all the same. In this paper, we present a new method based on multiple pairwise alignment to solve the \"challenge problem\" with less computation cost than the existing methods. This new method combines profile-driven method with pattern-driven method. So it has the advantages of both profile-driven method and pattern-driven method. It has high success rate in finding the motif and less computation cost. We refer to the new method as FMMPA (finding motif based on multiple pairwise alignment).","PeriodicalId":385759,"journal":{"name":"2005 International Symposium on Intelligent Signal Processing and Communication Systems","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122877039","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 : 1900-01-01DOI: 10.1109/ispacs.2005.1595473
Hyowon Kim, Bongsoo Lee, Suhyun Kim, S. Shin, Joungchul Ahn
The efficient Viterbi decoder that supports full data-rate output of DMB system was proposed. In this paper, SST scheme was adopted for Viterbi decoder with puncturing to reduce the power consumption. Puncturing vector tables are modified and re-arranged to be designed by hardwired logic to save the system area. New re-scaling scheme is proposed and the proposed re-scaling scheme optimizes the wordlength of path metric memory and greatly reduces the computational load for re-scaling by controlling MSB of path metric memory. Another saving of computation is done by proposed algorithm for branch metric calculation, which makes use of pre-calculated metric values. The designed Viterbi decoder was synthesized using SAMSUNG 0.35u standard cell library and occupied small area and showed low power consumption.
{"title":"An efficient Viterbi decoder design for DMB receiver","authors":"Hyowon Kim, Bongsoo Lee, Suhyun Kim, S. Shin, Joungchul Ahn","doi":"10.1109/ispacs.2005.1595473","DOIUrl":"https://doi.org/10.1109/ispacs.2005.1595473","url":null,"abstract":"The efficient Viterbi decoder that supports full data-rate output of DMB system was proposed. In this paper, SST scheme was adopted for Viterbi decoder with puncturing to reduce the power consumption. Puncturing vector tables are modified and re-arranged to be designed by hardwired logic to save the system area. New re-scaling scheme is proposed and the proposed re-scaling scheme optimizes the wordlength of path metric memory and greatly reduces the computational load for re-scaling by controlling MSB of path metric memory. Another saving of computation is done by proposed algorithm for branch metric calculation, which makes use of pre-calculated metric values. The designed Viterbi decoder was synthesized using SAMSUNG 0.35u standard cell library and occupied small area and showed low power consumption.","PeriodicalId":385759,"journal":{"name":"2005 International Symposium on Intelligent Signal Processing and Communication Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128115533","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 : 1900-01-01DOI: 10.1109/ispacs.2005.1595390
S. Koike
In this paper, we first present mathematical models for two types of impulse noise in adaptive filtering systems; one in additive observation noise and another at filter input. To combat such impulse noise, a new algorithm named signed regressor adaptive threshold nonlinear algorithm (SR-ATNA) is proposed. Through analysis and experiment, we demonstrate effectiveness of the SR-ATNA in making adaptive filters highly robust in the presence of both types of impulse noise while realizing fast convergence. Good agreement between simulated and theoretical convergence behavior in transient phase, and in steady state as well, proves the validity of the analysis.
{"title":"Combating impulse noise in adaptive filters with signed regressor adaptive threshold nonlinear algorithm","authors":"S. Koike","doi":"10.1109/ispacs.2005.1595390","DOIUrl":"https://doi.org/10.1109/ispacs.2005.1595390","url":null,"abstract":"In this paper, we first present mathematical models for two types of impulse noise in adaptive filtering systems; one in additive observation noise and another at filter input. To combat such impulse noise, a new algorithm named signed regressor adaptive threshold nonlinear algorithm (SR-ATNA) is proposed. Through analysis and experiment, we demonstrate effectiveness of the SR-ATNA in making adaptive filters highly robust in the presence of both types of impulse noise while realizing fast convergence. Good agreement between simulated and theoretical convergence behavior in transient phase, and in steady state as well, proves the validity of the analysis.","PeriodicalId":385759,"journal":{"name":"2005 International Symposium on Intelligent Signal Processing and Communication Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127049134","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 : 1900-01-01DOI: 10.1109/ISPACS.2005.1595535
Y. Zhou, S. Chan, K. Ho
This paper studies a wavelet based partial update fast LMS/Newton algorithm. Different from the conventional fast LMS/Newton algorithm, the proposed algorithm first uses a shorter-order, partial Haar transform-based NLMS adaptive filter to estimate the peak position of the long, sparse channel impulse response, and then employs the fast LMS/Newton algorithm integrated with partial update technique to fulfil the rest convergence task. The experimental results demonstrate the proposed algorithm outperforms its conventional counterpart in convergence performance and possesses a significantly lower computational complexity.
{"title":"A wavelet based partial update fast LMS/Newton algorithm","authors":"Y. Zhou, S. Chan, K. Ho","doi":"10.1109/ISPACS.2005.1595535","DOIUrl":"https://doi.org/10.1109/ISPACS.2005.1595535","url":null,"abstract":"This paper studies a wavelet based partial update fast LMS/Newton algorithm. Different from the conventional fast LMS/Newton algorithm, the proposed algorithm first uses a shorter-order, partial Haar transform-based NLMS adaptive filter to estimate the peak position of the long, sparse channel impulse response, and then employs the fast LMS/Newton algorithm integrated with partial update technique to fulfil the rest convergence task. The experimental results demonstrate the proposed algorithm outperforms its conventional counterpart in convergence performance and possesses a significantly lower computational complexity.","PeriodicalId":385759,"journal":{"name":"2005 International Symposium on Intelligent Signal Processing and Communication Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124200025","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 : 1900-01-01DOI: 10.1109/ISPACS.2005.1595402
G. Jong, Shih-Ming Chen, T. Su, Gro-Jium Horng
In this paper, we present the method which is combined least mean square (LMS) algorithm with real-parameter genetic algorithm (RGA) for optimizing the coefficients of adaptive filter in the amplitude-locked loop (ALL) separation system. The proposed algorithm is adopted to control the value of the step size in order to improve the slow rate of convergence. Therefore, the mean-square error (MSE) could be minimized under the channel signal-to-noise ratio (SNRc). Another purpose is to successfully separate the co-channel signals by eliminating signal distortion and noise interferences. Finally, we compared the simulation results of proposed algorithm to the traditional LMS algorithm. We obtained the performance of LMS+RGA is better than adaptive LMS algorithm.
{"title":"A combined LMS with RGA algorithm of the co-channel separation system","authors":"G. Jong, Shih-Ming Chen, T. Su, Gro-Jium Horng","doi":"10.1109/ISPACS.2005.1595402","DOIUrl":"https://doi.org/10.1109/ISPACS.2005.1595402","url":null,"abstract":"In this paper, we present the method which is combined least mean square (LMS) algorithm with real-parameter genetic algorithm (RGA) for optimizing the coefficients of adaptive filter in the amplitude-locked loop (ALL) separation system. The proposed algorithm is adopted to control the value of the step size in order to improve the slow rate of convergence. Therefore, the mean-square error (MSE) could be minimized under the channel signal-to-noise ratio (SNRc). Another purpose is to successfully separate the co-channel signals by eliminating signal distortion and noise interferences. Finally, we compared the simulation results of proposed algorithm to the traditional LMS algorithm. We obtained the performance of LMS+RGA is better than adaptive LMS algorithm.","PeriodicalId":385759,"journal":{"name":"2005 International Symposium on Intelligent Signal Processing and Communication Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124389909","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 : 1900-01-01DOI: 10.1109/ISPACS.2005.1595456
H. Cheng, S. Chan
In this paper, we present a robust decorrelating multiuser detector to suppress multiple access interference (MAI) and narrowband interference (NBI) in wireless multicarrier code-division multiple access (MC-CDMA) systems. The linear decorrelating multiuser detector is a simple and efficient method to mitigate the MAI. However, its performance degrades substantially in the presence of NBI. A robust weighted least M-estimate (WLM) algorithm based on the robust statistics and weighted least-squares (WLS) is therefore proposed for combating the NBI. Numerical results illustrate the significant improvement of the proposed robust decorrelating detection over the conventional linear decorrelator in the presence of NBI.
{"title":"Robust multiuser detection for wireless MC-CDMA systems under narrowband interference","authors":"H. Cheng, S. Chan","doi":"10.1109/ISPACS.2005.1595456","DOIUrl":"https://doi.org/10.1109/ISPACS.2005.1595456","url":null,"abstract":"In this paper, we present a robust decorrelating multiuser detector to suppress multiple access interference (MAI) and narrowband interference (NBI) in wireless multicarrier code-division multiple access (MC-CDMA) systems. The linear decorrelating multiuser detector is a simple and efficient method to mitigate the MAI. However, its performance degrades substantially in the presence of NBI. A robust weighted least M-estimate (WLM) algorithm based on the robust statistics and weighted least-squares (WLS) is therefore proposed for combating the NBI. Numerical results illustrate the significant improvement of the proposed robust decorrelating detection over the conventional linear decorrelator in the presence of NBI.","PeriodicalId":385759,"journal":{"name":"2005 International Symposium on Intelligent Signal Processing and Communication Systems","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132007204","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
扫码关注我们
求助内容：
应助结果提醒方式：