Pub Date : 2000-10-29DOI: 10.1109/ACSSC.2000.911303
Chun-Hsiang Huang, Ja-Ling Wu, Ding-Yun Chen
Watermarking techniques that need no original information during watermark detection, the so-called blind (public) watermarking, are more desirable than others for practical usage and convenience in watermark extraction. We convert a non-blind (private) image watermarking algorithm into a blind one by carefully removing and changing some function units of the original approach. As compared to the original algorithm, these modifications result in little quality degradation but do extend the practical usage of it. As an example, we applied the revised watermarking algorithm to a panorama picture construction tool, the VideoVR system, in which only blind watermarking algorithms can be used. The experimental results show that almost no perceptible distortions are found in the embedded pictures, and the retrieved watermarks can clearly indicate the ownership of the system constructor.
{"title":"A blind watermarking algorithm with semantic meaningful watermarks","authors":"Chun-Hsiang Huang, Ja-Ling Wu, Ding-Yun Chen","doi":"10.1109/ACSSC.2000.911303","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.911303","url":null,"abstract":"Watermarking techniques that need no original information during watermark detection, the so-called blind (public) watermarking, are more desirable than others for practical usage and convenience in watermark extraction. We convert a non-blind (private) image watermarking algorithm into a blind one by carefully removing and changing some function units of the original approach. As compared to the original algorithm, these modifications result in little quality degradation but do extend the practical usage of it. As an example, we applied the revised watermarking algorithm to a panorama picture construction tool, the VideoVR system, in which only blind watermarking algorithms can be used. The experimental results show that almost no perceptible distortions are found in the embedded pictures, and the retrieved watermarks can clearly indicate the ownership of the system constructor.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"41 1","pages":"1827-1830 vol.2"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85559066","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 : 2000-10-29DOI: 10.1109/ACSSC.2000.911057
V. De Brunner, M. Allali
A method for placing points (code vectors) on the unit sphere is presented. This method is based on a Ramanujan set of rotations, and generates an equidistributed system of points. An upper bound for Ramanujan spherical code is presented. This method is flexible and easy to implement as it needs only few transformations to cover the whole unit sphere with spherical caps.
{"title":"A Ramanujan spherical code","authors":"V. De Brunner, M. Allali","doi":"10.1109/ACSSC.2000.911057","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.911057","url":null,"abstract":"A method for placing points (code vectors) on the unit sphere is presented. This method is based on a Ramanujan set of rotations, and generates an equidistributed system of points. An upper bound for Ramanujan spherical code is presented. This method is flexible and easy to implement as it needs only few transformations to cover the whole unit sphere with spherical caps.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"66 1","pages":"777-780 vol.1"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83935881","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 : 2000-10-29DOI: 10.1109/ACSSC.2000.910649
G. Fan, X. Xia
Wavelet-domain hidden Markov models (HMMs), in particular the hidden Markov tree (HMT), have been proposed and applied to image processing, e.g. denoising and segmentation. In this paper texture analysis and classification using wavelet-domain HMMs are studied. In order to achieve more accurate texture characterization, we propose a new tree-structured HMM, called the 2-D HMT-3, where the wavelet coefficients from three subbands are grouped together. Besides the interscale dependencies, the proposed 2-D HMT-3 can also capture the dependencies across the wavelet subbands that are found useful for texture analysis. The experimental results show that the 2-D HMT-3 provides a nearly 20% improvement over the method using wavelet energy signatures, and the overall percentage of correct classification is over 95% upon a set of 55 Brodatz (1966) textures.
{"title":"Maximum likelihood texture analysis and classification using wavelet-domain hidden Markov models","authors":"G. Fan, X. Xia","doi":"10.1109/ACSSC.2000.910649","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.910649","url":null,"abstract":"Wavelet-domain hidden Markov models (HMMs), in particular the hidden Markov tree (HMT), have been proposed and applied to image processing, e.g. denoising and segmentation. In this paper texture analysis and classification using wavelet-domain HMMs are studied. In order to achieve more accurate texture characterization, we propose a new tree-structured HMM, called the 2-D HMT-3, where the wavelet coefficients from three subbands are grouped together. Besides the interscale dependencies, the proposed 2-D HMT-3 can also capture the dependencies across the wavelet subbands that are found useful for texture analysis. The experimental results show that the 2-D HMT-3 provides a nearly 20% improvement over the method using wavelet energy signatures, and the overall percentage of correct classification is over 95% upon a set of 55 Brodatz (1966) textures.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"1 1","pages":"921-925 vol.2"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82874433","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 : 2000-10-29DOI: 10.1109/ACSSC.2000.910688
M. Rangaswamy, B. Himed, J. Michels
We consider the statistical analysis of the recently proposed nonhomogeneity detector for Gaussian interference statistics. We show that a more stringent test can be constructed by accounting for the statistics of the generalized inner product (GIP) test under the condition of finite training data support. In particular, exact theoretical expressions for the GIP probability density function (PDF) and GIP mean are derived. Additionally, we show that for Gaussian interference statistics, the GIP admits a simple representation as the ratio of two statistically independent chi-square distributed random variables. Performance analysis of the more stringent GIP based test is presented.
{"title":"Statistical analysis of the nonhomogeneity detector","authors":"M. Rangaswamy, B. Himed, J. Michels","doi":"10.1109/ACSSC.2000.910688","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.910688","url":null,"abstract":"We consider the statistical analysis of the recently proposed nonhomogeneity detector for Gaussian interference statistics. We show that a more stringent test can be constructed by accounting for the statistics of the generalized inner product (GIP) test under the condition of finite training data support. In particular, exact theoretical expressions for the GIP probability density function (PDF) and GIP mean are derived. Additionally, we show that for Gaussian interference statistics, the GIP admits a simple representation as the ratio of two statistically independent chi-square distributed random variables. Performance analysis of the more stringent GIP based test is presented.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"12 4 1","pages":"1117-1121 vol.2"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90232315","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 : 2000-10-29DOI: 10.1109/ACSSC.2000.910934
J. Wu, G. Arslan, B. Evans
The minimum intersymbol interference (min-ISI) method yields time-domain equalizer (TEQ) designs for discrete multitone (DMT) modulation transceivers that are close to channel capacity. For eight standard ADSL channels, the min-ISI design method reaches within 1% of the matched filter bound at the TEQ output. However, the min-ISI method relies several computationally expensive matrix multiplications. We develop low-complexity algorithms for these multiplications to allow for real-time implementation of the min-ISI method on programmable digital signal processors.
{"title":"Efficient matrix multiplication methods to implement a near-optimum channel shortening method for discrete multitone transceivers","authors":"J. Wu, G. Arslan, B. Evans","doi":"10.1109/ACSSC.2000.910934","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.910934","url":null,"abstract":"The minimum intersymbol interference (min-ISI) method yields time-domain equalizer (TEQ) designs for discrete multitone (DMT) modulation transceivers that are close to channel capacity. For eight standard ADSL channels, the min-ISI design method reaches within 1% of the matched filter bound at the TEQ output. However, the min-ISI method relies several computationally expensive matrix multiplications. We develop low-complexity algorithms for these multiplications to allow for real-time implementation of the min-ISI method on programmable digital signal processors.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"37 1","pages":"152-157 vol.1"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90458337","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 : 2000-10-29DOI: 10.1109/ACSSC.2000.910926
E. Onggosanusi, B. V. Van Veen, A. Sayeed
Optimal multi-antenna wideband signaling schemes are derived for multipath channels assuming perfect channel state information at the transmitter. The scheme that minimizes the bit-error-probability in the single-user case is a rank-one space-time beamformer which focuses the signal transmission in the direction of the most dominant channel mode. Several sub-optimal variations are discussed for multiuser applications. Simulation results are given to compare the schemes proposed.
{"title":"Optimal wideband transmit antenna diversity utilizing channel state information","authors":"E. Onggosanusi, B. V. Van Veen, A. Sayeed","doi":"10.1109/ACSSC.2000.910926","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.910926","url":null,"abstract":"Optimal multi-antenna wideband signaling schemes are derived for multipath channels assuming perfect channel state information at the transmitter. The scheme that minimizes the bit-error-probability in the single-user case is a rank-one space-time beamformer which focuses the signal transmission in the direction of the most dominant channel mode. Several sub-optimal variations are discussed for multiuser applications. Simulation results are given to compare the schemes proposed.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"11 1","pages":"106-110 vol.1"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91553876","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 : 2000-10-29DOI: 10.1109/ACSSC.2000.911294
M. Green, A. Zoubir
We consider the system identification problem using a time-varying quadratic Volterra model. To enable identification a set of known basis sequences are used in the model to approximate the time-variation of the true system. To reduce the number of parameters in the model we wish to determine which individual sequences are significant in this approximation. Multiple hypothesis testing procedures are employed to select significant sequences. The tests include the Bonferroni test, Holm's (1979) sequentially rejective Bonferroni test, and Hommel's (1988) extension to Simes' (1986) procedure [5].
{"title":"Selection of a time-varying Volterra model using multiple hypothesis testing","authors":"M. Green, A. Zoubir","doi":"10.1109/ACSSC.2000.911294","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.911294","url":null,"abstract":"We consider the system identification problem using a time-varying quadratic Volterra model. To enable identification a set of known basis sequences are used in the model to approximate the time-variation of the true system. To reduce the number of parameters in the model we wish to determine which individual sequences are significant in this approximation. Multiple hypothesis testing procedures are employed to select significant sequences. The tests include the Bonferroni test, Holm's (1979) sequentially rejective Bonferroni test, and Hommel's (1988) extension to Simes' (1986) procedure [5].","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"59 1","pages":"1782-1785 vol.2"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84909804","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 : 2000-10-29DOI: 10.1109/ACSSC.2000.911221
K. Oweiss, D.J. Anderson
We present a novel approach for suppressing additive noise in multichannel signal processing environments. Inspired by a neurophysiological data environment, where an array of recording electrodes is surrounded by multiple neural cell sources, significant spatial correlation of source signals motivated the need for an efficient technique for reliable multichannel signal estimation. The technique described is based on thresholding an array discrete wavelet transform (ADWT) representation of the multichannel data. We show that by spatially decorrelating the ADWT, spatially correlated noise components in each frequency subband spanned by the corresponding wavelet orthonormal bases are converted to uncorrelated ones that are eventually suppressed by the thresholding stage. Recorrelation and reconstruction of the resulting ADWT is then performed yielding a significant improvement in SNR on all channels. The advantage of this technique lies in the fact that no apriori assumptions are required about the signal parameters or the noise process. Results of applying the technique to simulated and real multiunit neural recordings are presented and compared to existing techniques.
{"title":"A new approach to array denoising","authors":"K. Oweiss, D.J. Anderson","doi":"10.1109/ACSSC.2000.911221","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.911221","url":null,"abstract":"We present a novel approach for suppressing additive noise in multichannel signal processing environments. Inspired by a neurophysiological data environment, where an array of recording electrodes is surrounded by multiple neural cell sources, significant spatial correlation of source signals motivated the need for an efficient technique for reliable multichannel signal estimation. The technique described is based on thresholding an array discrete wavelet transform (ADWT) representation of the multichannel data. We show that by spatially decorrelating the ADWT, spatially correlated noise components in each frequency subband spanned by the corresponding wavelet orthonormal bases are converted to uncorrelated ones that are eventually suppressed by the thresholding stage. Recorrelation and reconstruction of the resulting ADWT is then performed yielding a significant improvement in SNR on all channels. The advantage of this technique lies in the fact that no apriori assumptions are required about the signal parameters or the noise process. Results of applying the technique to simulated and real multiunit neural recordings are presented and compared to existing techniques.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"36 1","pages":"1403-1407 vol.2"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78278733","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 : 2000-10-29DOI: 10.1109/ACSSC.2000.910769
M. Lenardi, A. Medles, D. Slock
The RAKE receiver is a matched filter (MF), matched to the operations of spreading, pulse shape filtering and channel filtering. An SINR maximizing linear receiver may perform much better. In the downlink, in which the channel is the same for all intracell signals, and with orthogonal codes and cell-dependent scrambling, good SINR performance can be attained with a RAKE-like receiver. In particular we replace the pulse-shape MF by another filter, and the sparse channel MF by another sparse filter. The first filter is chosen to facilitate the design/adaptation of the sparse filter, the coefficients of which are optimized for maximum SINR. In the presence of intercell interference (other base stations), but using multiple receiver antennas and/or oversampling with respect to the chip rate, good SINR performance can be attained with these structured linear receivers.
{"title":"A SINR maximizing RAKE receiver for DS-CDMA downlinks","authors":"M. Lenardi, A. Medles, D. Slock","doi":"10.1109/ACSSC.2000.910769","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.910769","url":null,"abstract":"The RAKE receiver is a matched filter (MF), matched to the operations of spreading, pulse shape filtering and channel filtering. An SINR maximizing linear receiver may perform much better. In the downlink, in which the channel is the same for all intracell signals, and with orthogonal codes and cell-dependent scrambling, good SINR performance can be attained with a RAKE-like receiver. In particular we replace the pulse-shape MF by another filter, and the sparse channel MF by another sparse filter. The first filter is chosen to facilitate the design/adaptation of the sparse filter, the coefficients of which are optimized for maximum SINR. In the presence of intercell interference (other base stations), but using multiple receiver antennas and/or oversampling with respect to the chip rate, good SINR performance can be attained with these structured linear receivers.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"30 1","pages":"1283-1287 vol.2"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78980141","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 : 2000-10-29DOI: 10.1109/ACSSC.2000.910673
Zhihai He, Tian-Hu Yu, S. Mitra
By introducing the concepts of characteristic rate curves and rate curve decomposition, a novel framework for rate-distortion (R-D) analysis and source modeling is developed in this work. With this framework, a fast algorithm is proposed to accurately estimate the R-D curve before quantization and coding for wavelet-based image coders. The proposed algorithm is applied to the SPIHT (set partitioning in hierarchical trees) and stack-run (SR) encoders. Our extensive experimental results show that the relative R-D curve estimation error is less than 5%.
{"title":"Fast and accurate rate prediction and picture quality control for wavelet image coding","authors":"Zhihai He, Tian-Hu Yu, S. Mitra","doi":"10.1109/ACSSC.2000.910673","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.910673","url":null,"abstract":"By introducing the concepts of characteristic rate curves and rate curve decomposition, a novel framework for rate-distortion (R-D) analysis and source modeling is developed in this work. With this framework, a fast algorithm is proposed to accurately estimate the R-D curve before quantization and coding for wavelet-based image coders. The proposed algorithm is applied to the SPIHT (set partitioning in hierarchical trees) and stack-run (SR) encoders. Our extensive experimental results show that the relative R-D curve estimation error is less than 5%.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"103 1","pages":"1040-1044 vol.2"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76560579","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
扫码关注我们
求助内容：
应助结果提醒方式：