Pub Date : 2008-12-08DOI: 10.1109/ICOSP.2008.4697749
Xu Linzhang, Han Zhen, Zhang Yanning
Selection of taxation attributes is one difficult question in analyzing the sources of taxation. This paper introduces genetic-algorithm-based rough set attribute reduction algorithm into the job of taxation attribute reduction. By referring to the concept of dependability in rough set, this method optimizes the configuration of fitness function, improves the convergence of original algorithm and changes the limitation of current attribute reduction in genetic algorithm. This algorithm fundamentally realizes the selection of comparatively small attribute sets with the presupposition that the data classification ability is not changed. It is valid after being tested.
{"title":"A Taxation attribute reduction based on genetic algorithm and rough set theory","authors":"Xu Linzhang, Han Zhen, Zhang Yanning","doi":"10.1109/ICOSP.2008.4697749","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697749","url":null,"abstract":"Selection of taxation attributes is one difficult question in analyzing the sources of taxation. This paper introduces genetic-algorithm-based rough set attribute reduction algorithm into the job of taxation attribute reduction. By referring to the concept of dependability in rough set, this method optimizes the configuration of fitness function, improves the convergence of original algorithm and changes the limitation of current attribute reduction in genetic algorithm. This algorithm fundamentally realizes the selection of comparatively small attribute sets with the presupposition that the data classification ability is not changed. It is valid after being tested.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129878137","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 : 2008-12-08DOI: 10.1109/ICOSP.2008.4697351
T. Lu, Yunhui Shi, Dehui Kong, Baocai Yin
This paper proposes a novel and efficient two-description image coding scheme in the wavelet domain. Here, each description includes one basic description produced by pairwise correlating transform (PCT) and one enhanced description formed by quincunx sub-sampling. First, we partition the low-frequency wavelet coefficients into two groups. Then the PCT was applied between the two groups to generate two new correlated groups as two basic descriptions, which are coded and transmitted through two separate channels. Second, we can get two enhanced descriptions from the high-frequency wavelet coefficients of the highest-level decomposition by quincunx sub-sampling. And the Wavelet Domain Interpolation for tree Reconstruction (WDIR) is used to conceal coefficients loss in Wavelet-Trees when one enhanced description lost during transmission. Experimental results demonstrate that the proposed MDC scheme can achieve good coding performance.
{"title":"A wavelet-based multiple-description coding combining pairwise correlating transform with quincunx sub-sampling","authors":"T. Lu, Yunhui Shi, Dehui Kong, Baocai Yin","doi":"10.1109/ICOSP.2008.4697351","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697351","url":null,"abstract":"This paper proposes a novel and efficient two-description image coding scheme in the wavelet domain. Here, each description includes one basic description produced by pairwise correlating transform (PCT) and one enhanced description formed by quincunx sub-sampling. First, we partition the low-frequency wavelet coefficients into two groups. Then the PCT was applied between the two groups to generate two new correlated groups as two basic descriptions, which are coded and transmitted through two separate channels. Second, we can get two enhanced descriptions from the high-frequency wavelet coefficients of the highest-level decomposition by quincunx sub-sampling. And the Wavelet Domain Interpolation for tree Reconstruction (WDIR) is used to conceal coefficients loss in Wavelet-Trees when one enhanced description lost during transmission. Experimental results demonstrate that the proposed MDC scheme can achieve good coding performance.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"223 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129890414","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 : 2008-12-08DOI: 10.1109/ICOSP.2008.4697072
Xutao Li, Zetao Chen, Shouyong Wang
As a non-Gaussian statistic model, alpha stable distribution has gained much attention due to its generality to represent heavy-tailed and impulsive interference. Unfortunately, there is no closed form expression for the probability density function of alpha-stable distributions. Hereby, finding the approximate expressions is of importance for signal detection and denoising. In this paper, we present a novel approximate expression, which is a simplified version of Cauchy-Gaussian mixture (CGM) for symmetric alpha-stable (SalphaS) distribution, called Bi-parameter CGM (BCGM). Such a model has a complete closed-form expression, and hence is more tractable than classical GMM and CGM.
{"title":"An approximate representation of heavy-tailed noise: Bi-parameter Cauchy-Gaussian mixture model","authors":"Xutao Li, Zetao Chen, Shouyong Wang","doi":"10.1109/ICOSP.2008.4697072","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697072","url":null,"abstract":"As a non-Gaussian statistic model, alpha stable distribution has gained much attention due to its generality to represent heavy-tailed and impulsive interference. Unfortunately, there is no closed form expression for the probability density function of alpha-stable distributions. Hereby, finding the approximate expressions is of importance for signal detection and denoising. In this paper, we present a novel approximate expression, which is a simplified version of Cauchy-Gaussian mixture (CGM) for symmetric alpha-stable (SalphaS) distribution, called Bi-parameter CGM (BCGM). Such a model has a complete closed-form expression, and hence is more tractable than classical GMM and CGM.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130371810","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 : 2008-12-08DOI: 10.1109/ICOSP.2008.4697100
Liang Bing, Yang Diange, Lian Xiaomin
To locate the moving sound sources with microphone arrays, with the random sparse arrays we could get equal results but much less microphones than the complete arrays; then the measuring system could be inexpensive and less complicated. The traditional technique to identify sound source with random sparse array is usually based on the beamforming principle, its resolution at low frequencies is not very good. An acoustic holography method with random sparse microphone array is proposed; an incomplete holography plane is constructed with the sound pressure data collected by the sparse array, then the sound pressure distribution of the radiating plane is computed with the acoustic holography method based on the principle of phase-conjugate waves focusing. The simulation indicates that the results of random sparse array have lower side lobes and better identifying performance than those of regular array with equal microphones. The experiment result shows that the sound sources in a moving car can be located correctly with this method.
{"title":"An acoustic holography method with random sparse microphone array to locate moving sound sources","authors":"Liang Bing, Yang Diange, Lian Xiaomin","doi":"10.1109/ICOSP.2008.4697100","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697100","url":null,"abstract":"To locate the moving sound sources with microphone arrays, with the random sparse arrays we could get equal results but much less microphones than the complete arrays; then the measuring system could be inexpensive and less complicated. The traditional technique to identify sound source with random sparse array is usually based on the beamforming principle, its resolution at low frequencies is not very good. An acoustic holography method with random sparse microphone array is proposed; an incomplete holography plane is constructed with the sound pressure data collected by the sparse array, then the sound pressure distribution of the radiating plane is computed with the acoustic holography method based on the principle of phase-conjugate waves focusing. The simulation indicates that the results of random sparse array have lower side lobes and better identifying performance than those of regular array with equal microphones. The experiment result shows that the sound sources in a moving car can be located correctly with this method.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130386128","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 : 2008-12-08DOI: 10.1109/ICOSP.2008.4697189
Ji-hua Niu, C. Bao
This paper proposes an efficient method for frame erasure concealment in G.722.1 coding algorithm, which can mitigate the adverse impact of frame erasure on the reconstruction quality. The lost frame is reconstructed in the modulated lapped transform (MLT) domain in terms of magnitude and sign of the coefficients. The method of interpolation is employed for the magnitude estimation. Some sign information is recovered by extra information from encoder. Listening test results indicate that improved quality is produced by the proposed algorithm.
{"title":"An improvement of frame erasure concealment for G.722.1 coding algorithm","authors":"Ji-hua Niu, C. Bao","doi":"10.1109/ICOSP.2008.4697189","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697189","url":null,"abstract":"This paper proposes an efficient method for frame erasure concealment in G.722.1 coding algorithm, which can mitigate the adverse impact of frame erasure on the reconstruction quality. The lost frame is reconstructed in the modulated lapped transform (MLT) domain in terms of magnitude and sign of the coefficients. The method of interpolation is employed for the magnitude estimation. Some sign information is recovered by extra information from encoder. Listening test results indicate that improved quality is produced by the proposed algorithm.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123894096","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 : 2008-12-08DOI: 10.1109/ICOSP.2008.4697695
K. Hayama
Numerical relativistic simulations of a supernova core collapse indicate that a gravitational waveform from the supernova core collapse has several types. The gravitational waveform is strongly related to the stellar structure such as a rotation of the supernova core and an equation of state. Knowing the distribution of the types of the gravitational waveforms is an probe to elucidate the story of evolution of the supernova. In this paper, we propose a clustering method to determine the distribution. We performed Monte Carlo simulations of classification of simulated gravitational waves from supernovae using the affinity propagation and showed the efficiency of the method. We found that the classification by the affinity propagation worked well if a supernova core collapse occurs in our Galaxy.
{"title":"Classification of gravitational waves from supernova core collapses using affinity propagation","authors":"K. Hayama","doi":"10.1109/ICOSP.2008.4697695","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697695","url":null,"abstract":"Numerical relativistic simulations of a supernova core collapse indicate that a gravitational waveform from the supernova core collapse has several types. The gravitational waveform is strongly related to the stellar structure such as a rotation of the supernova core and an equation of state. Knowing the distribution of the types of the gravitational waveforms is an probe to elucidate the story of evolution of the supernova. In this paper, we propose a clustering method to determine the distribution. We performed Monte Carlo simulations of classification of simulated gravitational waves from supernovae using the affinity propagation and showed the efficiency of the method. We found that the classification by the affinity propagation worked well if a supernova core collapse occurs in our Galaxy.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123314897","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 : 2008-12-08DOI: 10.1109/ICOSP.2008.4697529
Xiaoyu Sun, Can Sun, Chenyang Yang
In this paper, we analyze the performance of beamforming and its combination with link adaptive technologies in the presence of co-channel interference (CCI) of downlink multiple-input multiple-output (MIMO) - code division multiple access (CDMA) cellular systems. The results show that the performance of MIMO systems with beamforming will mainly be degraded by the bursty nature of the CCI.
{"title":"Performance analysis of spatial precoding in adaptive cellular systems","authors":"Xiaoyu Sun, Can Sun, Chenyang Yang","doi":"10.1109/ICOSP.2008.4697529","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697529","url":null,"abstract":"In this paper, we analyze the performance of beamforming and its combination with link adaptive technologies in the presence of co-channel interference (CCI) of downlink multiple-input multiple-output (MIMO) - code division multiple access (CDMA) cellular systems. The results show that the performance of MIMO systems with beamforming will mainly be degraded by the bursty nature of the CCI.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123485568","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 : 2008-12-08DOI: 10.1109/ICOSP.2008.4697105
Guo Jinku, Li Guangbin, Yang Xiaojun
Sparse decomposition of a signal can be obtained by decomposing the signal in an over complete dictionary. Matching Pursuit (MP) is a greedy algorithm to realize such decompositions, and has been widely studied in many signal processing researches. Through exploiting the structure shared by these so-called adaptive decomposition dictionaries, we propose a novel MP algorithm which can reduce computation and storage requirement dramatically.
{"title":"A novel Matching Pursuit algorithm with adaptive subdictionary","authors":"Guo Jinku, Li Guangbin, Yang Xiaojun","doi":"10.1109/ICOSP.2008.4697105","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697105","url":null,"abstract":"Sparse decomposition of a signal can be obtained by decomposing the signal in an over complete dictionary. Matching Pursuit (MP) is a greedy algorithm to realize such decompositions, and has been widely studied in many signal processing researches. Through exploiting the structure shared by these so-called adaptive decomposition dictionaries, we propose a novel MP algorithm which can reduce computation and storage requirement dramatically.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"13 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121004864","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 : 2008-12-08DOI: 10.1109/ICOSP.2008.4697608
Shu-feng Li, Jie Chen, Lvqian Zhang, Yinqing Zhou
Multiple input multiple output (MIMO) radar systems employ the orthogonal signals to improve the system performance. Some results show that there are no complete orthogonal signals in the single code field, even refer to the binary, polyphase and the plural sequences, the maximum of both the auto-correlation function (ACF) and the cross-correlation function (CCF) can not equal to zero at the all delays. The paper utilizes the recursive algorithm to construct a class complete complementary pairs (CC-pairs) based on complementary pair in the dual codes field. The conclusion implies that the CC-pairs satisfy the complete orthogonality required for MIMO radar systems and open a new direction in orthogonal signal design.
{"title":"Construction of quadri-phase complete complementary pairs applied in MIMO radar systems","authors":"Shu-feng Li, Jie Chen, Lvqian Zhang, Yinqing Zhou","doi":"10.1109/ICOSP.2008.4697608","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697608","url":null,"abstract":"Multiple input multiple output (MIMO) radar systems employ the orthogonal signals to improve the system performance. Some results show that there are no complete orthogonal signals in the single code field, even refer to the binary, polyphase and the plural sequences, the maximum of both the auto-correlation function (ACF) and the cross-correlation function (CCF) can not equal to zero at the all delays. The paper utilizes the recursive algorithm to construct a class complete complementary pairs (CC-pairs) based on complementary pair in the dual codes field. The conclusion implies that the CC-pairs satisfy the complete orthogonality required for MIMO radar systems and open a new direction in orthogonal signal design.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124062634","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 : 2008-12-08DOI: 10.1109/ICOSP.2008.4697231
Zhe Zhang, Lixing Huang, J. Tao
In this paper, we proposed and realized a corpus pruning method using decision tree. In the process of clustering, instead of conventional method, we measure the distance of pitch contours by feature vector composed by slope mean. The subjective and objective evaluation results showed that synthetic outputs based on corpus pruned through our method are close to outputs based on no-pruning corpus and are superior to conventional method with the same storage size.
{"title":"Unit feature based pruning of large-scale speech corpus using decision tree","authors":"Zhe Zhang, Lixing Huang, J. Tao","doi":"10.1109/ICOSP.2008.4697231","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697231","url":null,"abstract":"In this paper, we proposed and realized a corpus pruning method using decision tree. In the process of clustering, instead of conventional method, we measure the distance of pitch contours by feature vector composed by slope mean. The subjective and objective evaluation results showed that synthetic outputs based on corpus pruned through our method are close to outputs based on no-pruning corpus and are superior to conventional method with the same storage size.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124080626","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
扫码关注我们
求助内容：
应助结果提醒方式：