发布求助
文献互助 智能选刊 最新文献

2007 International Symposium on Intelligent Signal Processing and Communication Systems最新文献

筛选
英文 中文
An IHS fusion algorithm based on the correlation of panchromatic and intensity images 基于全色图像与强图像相关性的IHS融合算法
2007 International Symposium on Intelligent Signal Processing and Communication Systems Pub Date : 2007-11-01 DOI: 10.1109/ISPACS.2007.4445980
Hak Chang Kim, J. Kuk, H. S. Song, N. Cho
{"title":"An IHS fusion algorithm based on the correlation of panchromatic and intensity images","authors":"Hak Chang Kim, J. Kuk, H. S. Song, N. Cho","doi":"10.1109/ISPACS.2007.4445980","DOIUrl":"https://doi.org/10.1109/ISPACS.2007.4445980","url":null,"abstract":"A trade-off parameter approach was recently introduced for the reduction of spectral distortion inherent in the conventional intensity-hue-saturation (IHS) based image fusion algorithm. The parameter controls the contributions of spectral and spatial resolution in order to reduce the spectral distortion while keeping the spatial resolution. In this paper, we attempt to improve the trade-off parameter approach by developing an area dependent piecewise linear control model, whereas the existing method determines the global parameter by trial and error. Block based correlation of panchromatic and intensity images is used to acquire an optimized tradeoff parameters to control the spatial and spectral resolution of the image. Experimental results show that the proposed method provides satisfying results both objectively and subjectively.","PeriodicalId":220276,"journal":{"name":"2007 International Symposium on Intelligent Signal Processing and Communication Systems","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128950485","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}
引用次数: 0
Differential immune clonal selection algorithm 差分免疫克隆选择算法
2007 International Symposium on Intelligent Signal Processing and Communication Systems Pub Date : 2007-11-01 DOI: 10.1109/ISPACS.2007.4445975
Maoguo Gong, Lining Zhang, L. Jiao, Wenping Ma
{"title":"Differential immune clonal selection algorithm","authors":"Maoguo Gong, Lining Zhang, L. Jiao, Wenping Ma","doi":"10.1109/ISPACS.2007.4445975","DOIUrl":"https://doi.org/10.1109/ISPACS.2007.4445975","url":null,"abstract":"Based on the antibody clonal selection theory of immunology and differential evolution paradigm, we put forward a novel artificial immune system algorithm, differential immune clonal selection algorithm, termed as DICSA. The DICSA evolves and improves the population by clonal proliferation operator, differential mutation operator, differential crossover operator and (mu+lambda)-selection operator. In experiments, six composition functions are used to validate the performance of the DICSA. The results confirm its potential to solve the global optimization problems.","PeriodicalId":220276,"journal":{"name":"2007 International Symposium on Intelligent Signal Processing and Communication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116790961","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}
引用次数: 16
A detail-preserving filtering module based on mathematical morphology 基于数学形态学的保细节滤波模块
2007 International Symposium on Intelligent Signal Processing and Communication Systems Pub Date : 2007-11-01 DOI: 10.1109/ISPACS.2007.4445838
Wu Wei, Zhu Guangxi, C. Yunfeng
{"title":"A detail-preserving filtering module based on mathematical morphology","authors":"Wu Wei, Zhu Guangxi, C. Yunfeng","doi":"10.1109/ISPACS.2007.4445838","DOIUrl":"https://doi.org/10.1109/ISPACS.2007.4445838","url":null,"abstract":"Morphological filtering is a new and developing nonlinear filtering technique. The filtering principle of traditional morphological filters based on fitting the appointed structuring element to each objects of an image, which lead to damage image details seriously. So, this paper proposed a CS filtering model based on multiple structuring elements. Firstly use a contour-structuring element to extract the noise areas, and then use a connected structuring element to eliminate all the pixels in the noise areas at one time. This model distinguishes noise and valid objects by measuring objects' morphological extension. Many tests have been done to compare the filtering effect between the CS filtering model, the traditional morphological filters, Wiener filter and median filter. Experimental results indicate that the CS filtering model is really a detail-preserving filter.","PeriodicalId":220276,"journal":{"name":"2007 International Symposium on Intelligent Signal Processing and Communication Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132727661","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 high-speed fair scalable scheduling architecture 一种高速、公平、可扩展的调度架构
2007 International Symposium on Intelligent Signal Processing and Communication Systems Pub Date : 2007-11-01 DOI: 10.1109/ISPACS.2007.4445823
Qingsheng Hu, Chen Liu, Hua-An Zhao
{"title":"A high-speed fair scalable scheduling architecture","authors":"Qingsheng Hu, Chen Liu, Hua-An Zhao","doi":"10.1109/ISPACS.2007.4445823","DOIUrl":"https://doi.org/10.1109/ISPACS.2007.4445823","url":null,"abstract":"This paper proposes a high-speed fair scalable scheduling architecture (FSSA) based on input queued switches, which can be implemented on a 64 x 64 scheduler. Compare with the ordinary SSA, the FSSA evenly distributes the starts of new scheduling rounds to different cell times in guarantee of a more balanced scheduling pattern. The simulation results show that the FSSA has a better performance in latency than SSA especially under low traffic load and the synthesis and post simulation results indicate that the data rate of each channel can be up to 800 Mbps. Therefore, the implementation of FSSA is applicable to high-speed scalable switches.","PeriodicalId":220276,"journal":{"name":"2007 International Symposium on Intelligent Signal Processing and Communication Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132740628","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}
引用次数: 0
Two dimensional high-resolution spectral estimator with singular covariance matrix 具有奇异协方差矩阵的二维高分辨率谱估计
2007 International Symposium on Intelligent Signal Processing and Communication Systems Pub Date : 2007-11-01 DOI: 10.1109/ISPACS.2007.4445878
K. Zhang, Zhigang Su, R. Wu
{"title":"Two dimensional high-resolution spectral estimator with singular covariance matrix","authors":"K. Zhang, Zhigang Su, R. Wu","doi":"10.1109/ISPACS.2007.4445878","DOIUrl":"https://doi.org/10.1109/ISPACS.2007.4445878","url":null,"abstract":"Employing singular covariance matrix, spectral estimation methods can give high resolution results. In this paper, the original one-dimensional (1-D) spectral estimation method, which is based on singular covariance matrix, is extended to the case of two-dimensional (2-D). With the few snapshots, forward-backward method is utilized to calculate the sample covariance matrix. Owing to the better estimate of the sample covariance matrix, the new method can give good performance on the estimation accuracy of the 2-D spectrum. Simulation results show that the proposed method is superior to other similar methods for spectral estimation.","PeriodicalId":220276,"journal":{"name":"2007 International Symposium on Intelligent Signal Processing and Communication Systems","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133421282","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}
引用次数: 0
Sparse approximation using fast matching pursuit 基于快速匹配追踪的稀疏逼近
2007 International Symposium on Intelligent Signal Processing and Communication Systems Pub Date : 2007-11-01 DOI: 10.1109/ISPACS.2007.4445907
T. Gan, Yanmin He, Weile Zhu
{"title":"Sparse approximation using fast matching pursuit","authors":"T. Gan, Yanmin He, Weile Zhu","doi":"10.1109/ISPACS.2007.4445907","DOIUrl":"https://doi.org/10.1109/ISPACS.2007.4445907","url":null,"abstract":"Matching pursuit based on geometric dictionary has shown to be a powerful tool for sparse image representation. The main obstacle to its application in real world is the computational complexity. In this paper, a modified algorithm is presented to address this issue. The dictionary with anisotropic refinement atoms is used to provide the approximation ability. Meanwhile the pursuit implementation is significantly speeded up by employing both sequential and parallel techniques. Experimental results show that compared to the latest matching pursuit approach, the proposed algorithm offers a speedup of 27.7-36.7 while maintaining the approximation quality. It is very promising for flexible image coding at low bit rate.","PeriodicalId":220276,"journal":{"name":"2007 International Symposium on Intelligent Signal Processing and Communication Systems","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124083625","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}
引用次数: 4
Transition analysis for moderate feedback self-mixing interferometry 中等反馈自混合干涉的过渡分析
2007 International Symposium on Intelligent Signal Processing and Communication Systems Pub Date : 2007-11-01 DOI: 10.1109/ISPACS.2007.4446014
Lu Wei, J. Xi, Yanguang Yu, J. Chicharo
{"title":"Transition analysis for moderate feedback self-mixing interferometry","authors":"Lu Wei, J. Xi, Yanguang Yu, J. Chicharo","doi":"10.1109/ISPACS.2007.4446014","DOIUrl":"https://doi.org/10.1109/ISPACS.2007.4446014","url":null,"abstract":"We present a theoretical analysis on the locations of transition points in moderate feedback self-mixing signal which is a fundamental issue to be addressed in preprocessing experimentally acquired data. Locations for the start and end points for upward and downward switchings are calculated based on the Lang-Kobayashi model and discussions are given, which provides guidance in achieving more accurate signal normalization.","PeriodicalId":220276,"journal":{"name":"2007 International Symposium on Intelligent Signal Processing and Communication Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127976791","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}
引用次数: 0
Turbo equalization for OFDM with time-varying channels by new modified Kalman filter 基于改进卡尔曼滤波的时变信道OFDM Turbo均衡
2007 International Symposium on Intelligent Signal Processing and Communication Systems Pub Date : 2007-11-01 DOI: 10.1109/ISPACS.2007.4445869
Jia Tu, Wei Wu, Yueming Cai
{"title":"Turbo equalization for OFDM with time-varying channels by new modified Kalman filter","authors":"Jia Tu, Wei Wu, Yueming Cai","doi":"10.1109/ISPACS.2007.4445869","DOIUrl":"https://doi.org/10.1109/ISPACS.2007.4445869","url":null,"abstract":"Time-varying channels lead to the loss of orthogonality among sub-carriers, resulting in inter-carrier interference (ICI) in OFDM systems. To compensate for this ICI, we give a turbo equalization based on new Kalman filter for OFDM with time-varying channels. This algorithm uses soft mapping and soft de-mapping to realize information exchange via turbo iteration, realizes the update of channel response, and mitigates the ICI partly. Theoretical analysis and simulation results indicate that the method in this paper can effectively track channel and mitigate ICI. It has good BER performance even the channels are fast varying.","PeriodicalId":220276,"journal":{"name":"2007 International Symposium on Intelligent Signal Processing and Communication Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129151401","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}
引用次数: 4
Depth image segmentation for improved virtual view image quality in 3-DTV 三维数字电视中提高虚拟视场图像质量的深度图像分割
2007 International Symposium on Intelligent Signal Processing and Communication Systems Pub Date : 2007-11-01 DOI: 10.1109/ISPACS.2007.4445883
Wei Wang, Longshe Huo, Wei Zeng, Qingming Huang, Wen Gao
{"title":"Depth image segmentation for improved virtual view image quality in 3-DTV","authors":"Wei Wang, Longshe Huo, Wei Zeng, Qingming Huang, Wen Gao","doi":"10.1109/ISPACS.2007.4445883","DOIUrl":"https://doi.org/10.1109/ISPACS.2007.4445883","url":null,"abstract":"A new 3-D data representation format consisting of monoscopic color video and its associated per-pixel depth information is a most promising technique applied in future three-dimensional television system. Despite many advantages of this representation, a large problem which is so-called disocclusion still exists when synthesizing one or more virtual views of a real-world scene by means of depth image based rendering technique. In this paper, we first give an interpretation to the occurrence of disocclusion from a mathematical view, and then analyze the reasons why smoothing depth image can have some effects on disocclusion and its several drawbacks. Finally, we propose a global processing method using depth image segmentation to solve the disocclusion. Analytical and experiment results show that our proposed method can improve the quality of virtual view images to a large extent, and no geometric distortion arises.","PeriodicalId":220276,"journal":{"name":"2007 International Symposium on Intelligent Signal Processing and Communication Systems","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116918170","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}
引用次数: 10
A macroblock level adaptive search range algorithm for variable block size motion estimation in H.264/AVC H.264/AVC中可变块大小运动估计的宏块级自适应搜索范围算法
2007 International Symposium on Intelligent Signal Processing and Communication Systems Pub Date : 2007-11-01 DOI: 10.1109/ISPACS.2007.4445958
Zhenxing Chen, Yang Song, T. Ikenaga, S. Goto
{"title":"A macroblock level adaptive search range algorithm for variable block size motion estimation in H.264/AVC","authors":"Zhenxing Chen, Yang Song, T. Ikenaga, S. Goto","doi":"10.1109/ISPACS.2007.4445958","DOIUrl":"https://doi.org/10.1109/ISPACS.2007.4445958","url":null,"abstract":"Compared with previous video standards, the computational complexity of H.264/AVC is extraordinarily high due to newly adopted tools such as variable block size motion estimation (VBSME). In VBSME, to each macroblock (MB) there are at all 41 blocks corresponded. These 41 blocks are sized from 4x4 through 16x16. As each block of these 41 blocks accounts for one independent search window (SW), thus to each MB there exist 41 SWs corresponded. In the other hand, adaptive search range (ASR) algorithms are defined as algorithms which adaptively adjust the search ranges (SRs) and hence result in dynamically reduced SWs. While considering whether 41 SWs got changed in the same way or not, \"macroblock level ASR (MB-ASR) algorithms\" are defined as algorithms which adaptively change the search range all- in-once and hence result in the 41 SWs got changed in the same way. \"41 blocks level ASR (block-ASR) algorithms\" are defined as algorithms that the changing ways of the SRs are specific to each block of the 41 blocks. Since in MB-ASR algorithms for each MB the SR is changed in same way, it is reasonable to consider that the control overhead of MB-ASR is less than that of block-ASR. In this paper, a MB-ASR algorithm is proposed and assessed from being compared with a previously proposed block-ASR algorithm. According to experimental results, it is proved the proposed algorithm provides almost the same encoding quality and even a little better SW reducing efficiency (SW-RE). Meanwhile, as a MB-ASR one, the proposed algorithm is considered having less control overhead than block-ASR one.","PeriodicalId":220276,"journal":{"name":"2007 International Symposium on Intelligent Signal Processing and Communication Systems","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115570146","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}
引用次数: 18
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信