Pub Date : 2008-12-08DOI: 10.1109/ICOSP.2008.4697374
Dong-Min Woo, Q. Nguyen, Dong-Chul Park
This paper presents a new building rooftop extraction method from aerial images. In our approach, we extract the useful building location information from the generated disparity map to segment the interested objects and consequently reduce unnecessary line segments extracted in low level feature extraction step. Hypothesis selection is carried out by using undirected graph, in which close cycles represent complete rooftops hypotheses. We test the proposed method with the synthetic images generated from Avenches dataset of Ascona aerial images. The experiment result shows that the extracted 3D line segments of the reconstructed buildings reflect the actual building structure and our method can be efficiently used for the task of building detection and reconstruction from aerial images.
{"title":"3D rooftop extraction using perceptual organization based on fast graph search","authors":"Dong-Min Woo, Q. Nguyen, Dong-Chul Park","doi":"10.1109/ICOSP.2008.4697374","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697374","url":null,"abstract":"This paper presents a new building rooftop extraction method from aerial images. In our approach, we extract the useful building location information from the generated disparity map to segment the interested objects and consequently reduce unnecessary line segments extracted in low level feature extraction step. Hypothesis selection is carried out by using undirected graph, in which close cycles represent complete rooftops hypotheses. We test the proposed method with the synthetic images generated from Avenches dataset of Ascona aerial images. The experiment result shows that the extracted 3D line segments of the reconstructed buildings reflect the actual building structure and our method can be efficiently used for the task of building detection and reconstruction from aerial images.","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":"123416143","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.4697426
Ruicong Zhi, Q. Ruan
This paper proposes a feature extraction algorithm, called supervised spectral analysis (SSA) which is motivated by spectral clustering. The algorithm is interesting from a number of perspectives: (a) utilize the class information of the data points to construct the affinity matrix, which can enhance the discriminant power of the features; (b) solve the small-sample-size problem which is often confronted in the practical application; (c) effectively discover the nonlinear structure hidden in the data. We analysis the properties of the SSA and apply it to facial expression recognition. Experiments on JAFFE and Cohn-Kanade databases show the effectiveness of the SSA algorithm.
{"title":"Feature extraction using supervised spectral analysis","authors":"Ruicong Zhi, Q. Ruan","doi":"10.1109/ICOSP.2008.4697426","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697426","url":null,"abstract":"This paper proposes a feature extraction algorithm, called supervised spectral analysis (SSA) which is motivated by spectral clustering. The algorithm is interesting from a number of perspectives: (a) utilize the class information of the data points to construct the affinity matrix, which can enhance the discriminant power of the features; (b) solve the small-sample-size problem which is often confronted in the practical application; (c) effectively discover the nonlinear structure hidden in the data. We analysis the properties of the SSA and apply it to facial expression recognition. Experiments on JAFFE and Cohn-Kanade databases show the effectiveness of the SSA algorithm.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"47 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":"123761213","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.4697770
Nahla A. Flayh, Syed I. Ahson
In this paper we present a new approach to encrypt digital image. It is Wavelet Based Image Encryption Schemes by Hiding Processing Steps of the Wavelet Transform, we present two schemes, the first scheme is Hiding Filter Types Encryption Scheme(HFT), and the second is Hiding Wavelet Packet Tree Encryption Scheme (HWPT).
{"title":"Wavelet Based Image Encryption","authors":"Nahla A. Flayh, Syed I. Ahson","doi":"10.1109/ICOSP.2008.4697770","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697770","url":null,"abstract":"In this paper we present a new approach to encrypt digital image. It is Wavelet Based Image Encryption Schemes by Hiding Processing Steps of the Wavelet Transform, we present two schemes, the first scheme is Hiding Filter Types Encryption Scheme(HFT), and the second is Hiding Wavelet Packet Tree Encryption Scheme (HWPT).","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":"123768868","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.4697576
S. Jiao, R. Goutte
Recent research has considered DNA an interesting medium for long-term and ultra compact information storage and a stegomedium for hidden messages. Artificial components of DNA with encoded information can be added to the genome of living organisms, such as common bacteria. With this approach, a medium for very height-densities information storage, watermarks for protection patents of genetically modified organisms (GMOs) and secure public keys for decrypting hidden information in steganocryptography, can be obtained. In this paper, we have selected a Bacillus subtilis gene (tatAD ) and use the specific properties of silent mutations to obtain a biologically innocuous product. An adapted code for the message insertion in this gene is proposed.
{"title":"Code for encryption hiding data into genomic DNA of living organisms","authors":"S. Jiao, R. Goutte","doi":"10.1109/ICOSP.2008.4697576","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697576","url":null,"abstract":"Recent research has considered DNA an interesting medium for long-term and ultra compact information storage and a stegomedium for hidden messages. Artificial components of DNA with encoded information can be added to the genome of living organisms, such as common bacteria. With this approach, a medium for very height-densities information storage, watermarks for protection patents of genetically modified organisms (GMOs) and secure public keys for decrypting hidden information in steganocryptography, can be obtained. In this paper, we have selected a Bacillus subtilis gene (tatAD ) and use the specific properties of silent mutations to obtain a biologically innocuous product. An adapted code for the message insertion in this gene is proposed.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"2 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":"125260634","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.4697686
B. Liu, Xiaochuan Ma, C. Hou
This paper addresses the problem of tracking a ldquosmartrdquo target, wherein the issue of the observerpsilas concealment against the target should be taken into account, as a smart target is able to detect when it is under surveillance and react in a manner that makes future surveillance more difficult. This work proposes a sensor scheduling strategy (SSS), which balances the tracking performance and the concealing quality of the observer. This SSS uses an approach known as covariance control, to reduce the use of the active sensor whilst guaranteeing the estimation accuracy. A robust unscented particle filtering (UPF) method is utilized to deal with the nonlinear and non-Gaussian problem. Meanwhile, a Rao-Blackwellised technique is adopted to improve the estimation performance and reduce the computational burdens. Results based on experiments with synthetic data are reported.
{"title":"Smart target tracking using sensor scheduling and particle filter","authors":"B. Liu, Xiaochuan Ma, C. Hou","doi":"10.1109/ICOSP.2008.4697686","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697686","url":null,"abstract":"This paper addresses the problem of tracking a ldquosmartrdquo target, wherein the issue of the observerpsilas concealment against the target should be taken into account, as a smart target is able to detect when it is under surveillance and react in a manner that makes future surveillance more difficult. This work proposes a sensor scheduling strategy (SSS), which balances the tracking performance and the concealing quality of the observer. This SSS uses an approach known as covariance control, to reduce the use of the active sensor whilst guaranteeing the estimation accuracy. A robust unscented particle filtering (UPF) method is utilized to deal with the nonlinear and non-Gaussian problem. Meanwhile, a Rao-Blackwellised technique is adopted to improve the estimation performance and reduce the computational burdens. Results based on experiments with synthetic data are reported.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"3 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":"125550507","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.4697673
Dan-dan Liu, Jingsheng Tang, Li Yang, Xin Chen, Z. Wang
In this paper, a new sonar imaging mode different from the cases of synthetic aperture sonar (SAS) imaging and inverse synthetic aperture sonar (ISAS) is presented, and its signal processing of imaging is mainly discussed. This new imaging mode can be used to get the 2D scattering characteristics of underwater targets, such as submarines, at low cost. It belongs to synthetic aperture imaging also, but the target moves cooperatively along a straight line while the sonar array is stationary. Firstly, the echo signal model is established. Secondly, the echo is processed in range and azimuth by the back-projection algorithm. Finally, a simulation result is given. The imaging result validates the feasibility of this sonar imaging mode and that of the algorithm of signal processing mentioned in the paper.
{"title":"A new mode of target-motion-induced sonar imaging and processing","authors":"Dan-dan Liu, Jingsheng Tang, Li Yang, Xin Chen, Z. Wang","doi":"10.1109/ICOSP.2008.4697673","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697673","url":null,"abstract":"In this paper, a new sonar imaging mode different from the cases of synthetic aperture sonar (SAS) imaging and inverse synthetic aperture sonar (ISAS) is presented, and its signal processing of imaging is mainly discussed. This new imaging mode can be used to get the 2D scattering characteristics of underwater targets, such as submarines, at low cost. It belongs to synthetic aperture imaging also, but the target moves cooperatively along a straight line while the sonar array is stationary. Firstly, the echo signal model is established. Secondly, the echo is processed in range and azimuth by the back-projection algorithm. Finally, a simulation result is given. The imaging result validates the feasibility of this sonar imaging mode and that of the algorithm of signal processing mentioned in the paper.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"121 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":"122334495","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.4697747
Jun Zhang, Wei Hu, Feng Gao
In this paper, first, the technology of virtual private network (VPN) is presented, and a comparison of several tunnel technology is given. Secondly the structure of IPSec protocol is introduced, and FreeS/WAN software realization IPSec protocol based Linux is made a particular analysis. At last, the VPN gateway is realized by applying FreeS/WAN soft under Linux.
{"title":"Construction of VPN gateway based on FreeS/WAN under Linux","authors":"Jun Zhang, Wei Hu, Feng Gao","doi":"10.1109/ICOSP.2008.4697747","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697747","url":null,"abstract":"In this paper, first, the technology of virtual private network (VPN) is presented, and a comparison of several tunnel technology is given. Secondly the structure of IPSec protocol is introduced, and FreeS/WAN software realization IPSec protocol based Linux is made a particular analysis. At last, the VPN gateway is realized by applying FreeS/WAN soft under Linux.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"203 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":"122770506","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.4697246
B. Smolka
In this paper a new filtering scheme for impulsive noise reduction in color images is proposed. The novel method is based on the evaluation of the statistical properties of a sorted sequence of aggregated distances used for the estimation of the vector median of samples from the filtering window. The filter is based on the Fisherpsilas linear discriminant, which enables the detection of outliers injected into the image by the by the noise process. The new filtering design enables the extension of the peer group filtering concept into color image denoising.
{"title":"Peer group filtering of noisy color images","authors":"B. Smolka","doi":"10.1109/ICOSP.2008.4697246","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697246","url":null,"abstract":"In this paper a new filtering scheme for impulsive noise reduction in color images is proposed. The novel method is based on the evaluation of the statistical properties of a sorted sequence of aggregated distances used for the estimation of the vector median of samples from the filtering window. The filter is based on the Fisherpsilas linear discriminant, which enables the detection of outliers injected into the image by the by the noise process. The new filtering design enables the extension of the peer group filtering concept into color image denoising.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"25 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":"114480038","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.4697118
A. Montazeri, J. Poshtan
In this paper a new robust adaptive IIR filter is designed for active noise and vibration control system. The developed adaptive algorithm has the capability to remain stable, when an upper bound of the uncertainties in the estimated model of the secondary path is known beforehand. It is proved that by using a nonlinear function of the measured error signal in the adaptation process the algorithm will exhibit a robustness property with respect to possible uncertainties in the secondary path model. This algorithm belongs to the class of RLS-type adaptive IIR filters in the modified filtered-x structure, and its stability is analyzed using Lyapanov theory.
{"title":"A new robust adaptive IIR filter for compensating uncertainties in the secondary path estimation model in ANVC systems","authors":"A. Montazeri, J. Poshtan","doi":"10.1109/ICOSP.2008.4697118","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697118","url":null,"abstract":"In this paper a new robust adaptive IIR filter is designed for active noise and vibration control system. The developed adaptive algorithm has the capability to remain stable, when an upper bound of the uncertainties in the estimated model of the secondary path is known beforehand. It is proved that by using a nonlinear function of the measured error signal in the adaptation process the algorithm will exhibit a robustness property with respect to possible uncertainties in the secondary path model. This algorithm belongs to the class of RLS-type adaptive IIR filters in the modified filtered-x structure, and its stability is analyzed using Lyapanov theory.","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":"121984584","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.4697059
Lv Yao, Li Shuangtian
This paper focuses on the problem of Under-determined Blind Source Separation (BSS) of anechoic speech mixtures. Our algorithm uses the idea of binary Time-Frequency (TF) mask employed in the Degenerate Unmixing Estimation Technique (DUET), but relaxes the strict sparsity assumption in DUET by allowing the sources to overlap in the TF domain to a certain extent. In particular, the number of active sources at any TF point does not exceed the number of sensors. We use the Unsupervised Robust C-Prototypes (URCP) algorithm to estimate the mixing parameters, and then divide the TF points into disjoint groups and overlapped groups to treat them separately. Experimental results show that the proposed method indicates a substantial increase in the Signal-to-Interference Ratio (SIR) comparing with DUET.
{"title":"Underdetermined Blind Source Separation of anechoic speech mixtures in the Time-Frequency domain","authors":"Lv Yao, Li Shuangtian","doi":"10.1109/ICOSP.2008.4697059","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697059","url":null,"abstract":"This paper focuses on the problem of Under-determined Blind Source Separation (BSS) of anechoic speech mixtures. Our algorithm uses the idea of binary Time-Frequency (TF) mask employed in the Degenerate Unmixing Estimation Technique (DUET), but relaxes the strict sparsity assumption in DUET by allowing the sources to overlap in the TF domain to a certain extent. In particular, the number of active sources at any TF point does not exceed the number of sensors. We use the Unsupervised Robust C-Prototypes (URCP) algorithm to estimate the mixing parameters, and then divide the TF points into disjoint groups and overlapped groups to treat them separately. Experimental results show that the proposed method indicates a substantial increase in the Signal-to-Interference Ratio (SIR) comparing with DUET.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"19 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":"122173117","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
扫码关注我们
求助内容：
应助结果提醒方式：