Pub Date : 2008-12-08DOI: 10.1109/ICOSP.2008.4697098
Xiumin Shi, Yanbing Ju
This paper presents a method for high-resolution estimation of the angles of arrival of multiple narrowband plane waves. The technique bases on interpolation and virtual array from an array of sensors. The algorithm principle is presented, and followed by simulation examples. The basic idea of the proposed approach is to increase the number of sensors to virtually reducing the sensor spacing of the original antenna array and then to construct the steering matrix of the virtual array, and to form covariance matrix of the virtual sensor vector. The performance of the technique is contrasted with other methods in terms of the determination of the correct number of sources, estimation of direction of arrival.
{"title":"A new approach to estimate DOA using virtual interpolation technique","authors":"Xiumin Shi, Yanbing Ju","doi":"10.1109/ICOSP.2008.4697098","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697098","url":null,"abstract":"This paper presents a method for high-resolution estimation of the angles of arrival of multiple narrowband plane waves. The technique bases on interpolation and virtual array from an array of sensors. The algorithm principle is presented, and followed by simulation examples. The basic idea of the proposed approach is to increase the number of sensors to virtually reducing the sensor spacing of the original antenna array and then to construct the steering matrix of the virtual array, and to form covariance matrix of the virtual sensor vector. The performance of the technique is contrasted with other methods in terms of the determination of the correct number of sources, estimation of direction of arrival.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"24 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":"116694155","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.4697598
Shan-qing Hu, Teng Long
Designing high-performance universal radar processing system is the method of solving the problem of increasing task needs of new radar system and that of different arithmetic requiring different system structure. Based on the theoretical analysis on the shared bus type and distributed type parallel structure, and according the characteristic of the radar signal processing, one high-performance universal radar signal processing system was designed and realized. The system has the characteristics of standardization, modularization, scalability, restructure, hybrid parallel processing, and multi-layer interconnection. And through using the system to design and realize typical radar signal processing system, the high-performance and the universality of the system were proved.
{"title":"Design and realization of high-performance universal radar signal processing system","authors":"Shan-qing Hu, Teng Long","doi":"10.1109/ICOSP.2008.4697598","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697598","url":null,"abstract":"Designing high-performance universal radar processing system is the method of solving the problem of increasing task needs of new radar system and that of different arithmetic requiring different system structure. Based on the theoretical analysis on the shared bus type and distributed type parallel structure, and according the characteristic of the radar signal processing, one high-performance universal radar signal processing system was designed and realized. The system has the characteristics of standardization, modularization, scalability, restructure, hybrid parallel processing, and multi-layer interconnection. And through using the system to design and realize typical radar signal processing system, the high-performance and the universality of the system were proved.","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":"117266312","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.4697132
Kai-Jyun Chen, Jing Lu, Zhaolong Jin, Shan Jiang
The fast affine projection (FAP) algorithm is widely used in many applications for its advantages of low computational complexity and high convergence rate. The acoustic echo cancellation (AEC) system is one of the typical applications. In this paper, a novel system of subband AEC (SAEC) based on FAP algorithm is proposed. The proposed SAEC structure employs several subband adaptive filters to determine the status of AEC, and the level of the near end speech and the ambient noise can be estimated automatically. The step-size of the FAP algorithms in each subband can be controlled by an efficient mechanism combining all the available information. The simulation results show that the proposed subband AEC structure can keep high convergence rate when echo path change (EPC) occurs while stability can be guaranteed in double talk (DT) situation, which make the proposed structure a competitive candidate as a practical system.
{"title":"A novel subband acoustic echo cancellation system based on fast affine projection algorithm","authors":"Kai-Jyun Chen, Jing Lu, Zhaolong Jin, Shan Jiang","doi":"10.1109/ICOSP.2008.4697132","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697132","url":null,"abstract":"The fast affine projection (FAP) algorithm is widely used in many applications for its advantages of low computational complexity and high convergence rate. The acoustic echo cancellation (AEC) system is one of the typical applications. In this paper, a novel system of subband AEC (SAEC) based on FAP algorithm is proposed. The proposed SAEC structure employs several subband adaptive filters to determine the status of AEC, and the level of the near end speech and the ambient noise can be estimated automatically. The step-size of the FAP algorithms in each subband can be controlled by an efficient mechanism combining all the available information. The simulation results show that the proposed subband AEC structure can keep high convergence rate when echo path change (EPC) occurs while stability can be guaranteed in double talk (DT) situation, which make the proposed structure a competitive candidate as a practical system.","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":"129594602","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.4697304
Lin Honghua, Yang Xuan, Pei Jihong
Key-frames are representative frames in a shot. Key frame extraction is one of the basic procedures relating to video retrieval and indexing. In view of the surveillance video characteristic and the user attention focus, this paper proposed a key frame extraction method based on multi-scale phase-based local features. Prior to key frame extraction, the video should be segmented into shots. Then, find the interest points in the head of the moving target extracted by adaptive background mixture Gaussian models, mark the candidate key frame which has a certain number of interest points matching with the given target model. Lastly, for each shot, extract key frame which has the best similar match. Experimental results demonstrate that the proposed method is feasible and effective.
{"title":"Key frame extraction based on multi-scale phase-based local features","authors":"Lin Honghua, Yang Xuan, Pei Jihong","doi":"10.1109/ICOSP.2008.4697304","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697304","url":null,"abstract":"Key-frames are representative frames in a shot. Key frame extraction is one of the basic procedures relating to video retrieval and indexing. In view of the surveillance video characteristic and the user attention focus, this paper proposed a key frame extraction method based on multi-scale phase-based local features. Prior to key frame extraction, the video should be segmented into shots. Then, find the interest points in the head of the moving target extracted by adaptive background mixture Gaussian models, mark the candidate key frame which has a certain number of interest points matching with the given target model. Lastly, for each shot, extract key frame which has the best similar match. Experimental results demonstrate that the proposed method is feasible and effective.","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":"129665972","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.4697165
Huang Letian, Liao Guangjun
Commonality of various algorithms is analyzed based on the research of algorithms commonly used digital signal processing and a reconfigurable cell is proposed. A reconfigurable system with the cells is designed, which is widely used in a variety of digital signal processing. The principle and method of using this system are discussed with the basic algorithms of digital signal processing - multiplication and adder - as example. By means of simulation and implementation, it is found that this system has much higher processing speed and efficiency, compared with other kinds of GM multipliers.
{"title":"A reconfigurable system for digital signal processing","authors":"Huang Letian, Liao Guangjun","doi":"10.1109/ICOSP.2008.4697165","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697165","url":null,"abstract":"Commonality of various algorithms is analyzed based on the research of algorithms commonly used digital signal processing and a reconfigurable cell is proposed. A reconfigurable system with the cells is designed, which is widely used in a variety of digital signal processing. The principle and method of using this system are discussed with the basic algorithms of digital signal processing - multiplication and adder - as example. By means of simulation and implementation, it is found that this system has much higher processing speed and efficiency, compared with other kinds of GM multipliers.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"16 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":"128250522","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.4697290
Z. Shan, Zhan-wei Hou
In order to effectively introduce existing text-retrieval methods into content-based image retrieval, a novel image retrieval method based on key-block was presented incorporating the different sensitivity along variant directions of human visual system and block truncation coding (BTC). The key-block was firstly extracted by use of the principle of BTC according to the different direction of the texture distribution. After that, a model based on the weighted histogram was proposed combining the influence of the frequency for different kinds of key-block on the image. The method can achieved a higher efficiency because of integrating spatial distribution information and edge distribution information into image descriptor. Experimental results show that the proposed method has sound and robust retrieval performance especially for the images with the abundant texture information and edge information.
{"title":"Image retrieval based on key-blocks","authors":"Z. Shan, Zhan-wei Hou","doi":"10.1109/ICOSP.2008.4697290","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697290","url":null,"abstract":"In order to effectively introduce existing text-retrieval methods into content-based image retrieval, a novel image retrieval method based on key-block was presented incorporating the different sensitivity along variant directions of human visual system and block truncation coding (BTC). The key-block was firstly extracted by use of the principle of BTC according to the different direction of the texture distribution. After that, a model based on the weighted histogram was proposed combining the influence of the frequency for different kinds of key-block on the image. The method can achieved a higher efficiency because of integrating spatial distribution information and edge distribution information into image descriptor. Experimental results show that the proposed method has sound and robust retrieval performance especially for the images with the abundant texture information and edge information.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"17 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":"128579966","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.4697410
Li Jia, M. Zhenjiang, Wang Chengkai
In this paper, we present an approach for markerless model-based full human-body motion capture using multi-view images as input. We extract volume data (voxels) representation from the silhouettes extracted from multiple-view video images by the method of shape from Silhouettes (SFS), and match our predefined human body model to the volume data. We construct an energy field in the volume of interest based on the volume data and human body model with pose parameters, and transform the matching to an energy minimizing problem. By dynamic graph cut, we get the minimum energy of certain pose parameters, and at last we optimize the pose parameters using Powell algorithm with a novel approach that uses the linear prediction guiding the optimization process and get the pose recovered. Through the test results on several video sequences of human body movements in an unaugmented office environment, we demonstrate the effectiveness and robustness of our approach.
在本文中，我们提出了一种使用多视图图像作为输入的基于无标记模型的全身运动捕捉方法。我们利用SFS (shape from silhouette)方法从多视图视频图像中提取的轮廓中提取体数据(体素)表示，并将我们预定义的人体模型与体数据进行匹配。基于体数据和具有位姿参数的人体模型，在感兴趣的体上构造能量场，并将匹配问题转化为能量最小化问题。通过动态图切得到某一姿态参数的最小能量，最后利用Powell算法对姿态参数进行优化，提出了一种利用线性预测指导优化过程并得到姿态恢复的新方法。通过在非增强办公环境中对几个人体运动视频序列的测试结果，我们证明了我们的方法的有效性和鲁棒性。
{"title":"Markerless human body motion capture using multiple cameras","authors":"Li Jia, M. Zhenjiang, Wang Chengkai","doi":"10.1109/ICOSP.2008.4697410","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697410","url":null,"abstract":"In this paper, we present an approach for markerless model-based full human-body motion capture using multi-view images as input. We extract volume data (voxels) representation from the silhouettes extracted from multiple-view video images by the method of shape from Silhouettes (SFS), and match our predefined human body model to the volume data. We construct an energy field in the volume of interest based on the volume data and human body model with pose parameters, and transform the matching to an energy minimizing problem. By dynamic graph cut, we get the minimum energy of certain pose parameters, and at last we optimize the pose parameters using Powell algorithm with a novel approach that uses the linear prediction guiding the optimization process and get the pose recovered. Through the test results on several video sequences of human body movements in an unaugmented office environment, we demonstrate the effectiveness and robustness of our approach.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"17 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":"128601893","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.4697138
Wu Xiao-dong, Wu Si-liang, Wang Ju, Liang Jia-qi
Aimed at the movement model of Three Beidou Geostationary Satellites passive dynamic positioning receiver and the noise characteristics of the receiving signal, the turn model is applied to represent exactly the movement pattern of the receiver, and a Kalman filter algorithm based on turn model is presented in this paper. By filtering the Three Beidou Geostationary Satellites passive dynamic positioning results, the emulation experiment shows that the algorithm can eliminate most random errors in the dynamic positioning. Compared with the traditional Kalman filter algorithms, the algorithm presented in this paper is charactered with easy realization, well application and high positioning precision, and a good result is obtained in the practical application.
{"title":"Application of Kalman filter in Three Beidou Geostationary Satellites passive dynamic positioning","authors":"Wu Xiao-dong, Wu Si-liang, Wang Ju, Liang Jia-qi","doi":"10.1109/ICOSP.2008.4697138","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697138","url":null,"abstract":"Aimed at the movement model of Three Beidou Geostationary Satellites passive dynamic positioning receiver and the noise characteristics of the receiving signal, the turn model is applied to represent exactly the movement pattern of the receiver, and a Kalman filter algorithm based on turn model is presented in this paper. By filtering the Three Beidou Geostationary Satellites passive dynamic positioning results, the emulation experiment shows that the algorithm can eliminate most random errors in the dynamic positioning. Compared with the traditional Kalman filter algorithms, the algorithm presented in this paper is charactered with easy realization, well application and high positioning precision, and a good result is obtained in the practical application.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"33 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":"128620213","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.4697672
Haisen S. Li, Bin Yao, Ningning Weng, Chao Xu, Baowei Chen
In this paper, a posteriori QR decomposition (QRD) least squares (LS) lattice-ladder algorithm without square root based on Givens rotation is derived from the posteriori LS lattice-ladder algorithm and the tracking performance is analyzed in nonstationary signal operation environment (SOE). The simulation results using system identification model show that the posteriori algorithm can track the time-varying coefficients with small coefficient deviation and have steady numerical characteristic. The application of the algorithm in Multi-beam bathymetry sonar for side lobe interference is given and the processing results of port and starboard beams prove that it can effectively eliminate the interference in underwater acoustic signal returns.
{"title":"Performance analysis and application of posteriori lattice-ladder algorithm based on Givens rotation","authors":"Haisen S. Li, Bin Yao, Ningning Weng, Chao Xu, Baowei Chen","doi":"10.1109/ICOSP.2008.4697672","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697672","url":null,"abstract":"In this paper, a posteriori QR decomposition (QRD) least squares (LS) lattice-ladder algorithm without square root based on Givens rotation is derived from the posteriori LS lattice-ladder algorithm and the tracking performance is analyzed in nonstationary signal operation environment (SOE). The simulation results using system identification model show that the posteriori algorithm can track the time-varying coefficients with small coefficient deviation and have steady numerical characteristic. The application of the algorithm in Multi-beam bathymetry sonar for side lobe interference is given and the processing results of port and starboard beams prove that it can effectively eliminate the interference in underwater acoustic signal returns.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"41 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":"124547571","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.4697237
H. Sajedi, M. Jamzad
In this paper, a new adaptive steganographic scheme based on contourlet transform is presented that provides large embedding capacity. In this method, embedding is done in contourlet transform domain. The contourlet coefficients with larger magnitude that correspond to the edges are selected for embedding. This selection is due to less sensitivity of human eyes to non-smooth regions. Each bit of secret data is embedded by exchanging the value of two coefficients in a 4 times 4 block of a contourlet subband. The proposed method is examined with two strong steganalysis algorithms and the results show that we could successfully embed data in a cover image with the capacity of 0.05 bits per pixel. Experiments and comparative studies showed the effectiveness of the proposed technique in generating stego images. In addition, its superiority is shown by comparison with a similar wavelet-based steganography approach.
{"title":"Adaptive steganography method based on contourlet transform","authors":"H. Sajedi, M. Jamzad","doi":"10.1109/ICOSP.2008.4697237","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697237","url":null,"abstract":"In this paper, a new adaptive steganographic scheme based on contourlet transform is presented that provides large embedding capacity. In this method, embedding is done in contourlet transform domain. The contourlet coefficients with larger magnitude that correspond to the edges are selected for embedding. This selection is due to less sensitivity of human eyes to non-smooth regions. Each bit of secret data is embedded by exchanging the value of two coefficients in a 4 times 4 block of a contourlet subband. The proposed method is examined with two strong steganalysis algorithms and the results show that we could successfully embed data in a cover image with the capacity of 0.05 bits per pixel. Experiments and comparative studies showed the effectiveness of the proposed technique in generating stego images. In addition, its superiority is shown by comparison with a similar wavelet-based steganography approach.","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":"129613066","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
扫码关注我们
求助内容：
应助结果提醒方式：