Pub Date : 1993-11-01DOI: 10.1109/ACSSC.1993.342579
A. El-Fallah, G. Ford
We introduce a new theory relating the magnitude of the image surface normal to an inhomogeneous diffusion that solely diffuses (averages) the mean curvature of the image surface. We discuss the remarkable properties of this diffusion stressing the regularity it imposes on regions and boundaries while preserving the locality of edges and lines. Experiments demonstrating the excellent performance of the algorithms in the areas of noise removal and enhancement are presented.<>
{"title":"Structure preserving inhomogeneous diffusion in image filtering","authors":"A. El-Fallah, G. Ford","doi":"10.1109/ACSSC.1993.342579","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342579","url":null,"abstract":"We introduce a new theory relating the magnitude of the image surface normal to an inhomogeneous diffusion that solely diffuses (averages) the mean curvature of the image surface. We discuss the remarkable properties of this diffusion stressing the regularity it imposes on regions and boundaries while preserving the locality of edges and lines. Experiments demonstrating the excellent performance of the algorithms in the areas of noise removal and enhancement are presented.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"276 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117349191","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 : 1993-11-01DOI: 10.1109/ACSSC.1993.342516
D. Kewley
Data fusion systems are being proposed for a wide variety of applications around the world to obtain the maximum benefit from expensive sensors and information systems. Examining surveys of data fusion work, it is apparent that while much activity has been devoted to implementing Level 1 systems with rigour derived from existing knowledge, implementation of Level 2 and 3 systems is often ad-hoc. Various testbeds are being developed to evaluate methods at all Levels. Methods of testing them are needed. This paper attempts to make a contribution to the general problem of performance measures for data fusion systems by presenting a general model. The model describes the data structures, processing stages and measures from generalised information theory. This theory includes measures of imprecision and ambiguity that are not represented by probability theory. Some intuitive results are shown to be qualitatively predicted.<>
{"title":"A model for evaluating data fusion systems","authors":"D. Kewley","doi":"10.1109/ACSSC.1993.342516","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342516","url":null,"abstract":"Data fusion systems are being proposed for a wide variety of applications around the world to obtain the maximum benefit from expensive sensors and information systems. Examining surveys of data fusion work, it is apparent that while much activity has been devoted to implementing Level 1 systems with rigour derived from existing knowledge, implementation of Level 2 and 3 systems is often ad-hoc. Various testbeds are being developed to evaluate methods at all Levels. Methods of testing them are needed. This paper attempts to make a contribution to the general problem of performance measures for data fusion systems by presenting a general model. The model describes the data structures, processing stages and measures from generalised information theory. This theory includes measures of imprecision and ambiguity that are not represented by probability theory. Some intuitive results are shown to be qualitatively predicted.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116178693","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 : 1993-11-01DOI: 10.1109/ACSSC.1993.342566
T. L. Dixon, L. Sibul
This paper shows that a distributed object can be actively imaged using wideband processing and wavelet transform theory. The object considered is a uniform, rough, rotating sphere. The new wideband spreading function (WBSF) model of the sphere is developed by extending the theory of the existing narrowband scattering function model. Both models have singularities that have not been addressed in the literature. The processing method discussed uniquely accounts for these singularities using the wavelet transform. The support of the wideband spreading function model is discussed and related to the parameters of the sphere. Finally, an estimate of the wideband spreading function is found by computing the wavelet transform of the received signal with respect to the transmitted signal.<>
{"title":"Wideband imaging of the rotating sphere: a wavelet transform approach","authors":"T. L. Dixon, L. Sibul","doi":"10.1109/ACSSC.1993.342566","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342566","url":null,"abstract":"This paper shows that a distributed object can be actively imaged using wideband processing and wavelet transform theory. The object considered is a uniform, rough, rotating sphere. The new wideband spreading function (WBSF) model of the sphere is developed by extending the theory of the existing narrowband scattering function model. Both models have singularities that have not been addressed in the literature. The processing method discussed uniquely accounts for these singularities using the wavelet transform. The support of the wideband spreading function model is discussed and related to the parameters of the sphere. Finally, an estimate of the wideband spreading function is found by computing the wavelet transform of the received signal with respect to the transmitted signal.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116310448","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 : 1993-11-01DOI: 10.1109/ACSSC.1993.342380
J.W. Adams, P. Kruethong, R. Hashemi, J. L. Sullivan, D. Gleeson
The Parks-McClellan algorithm (1973) is very popular for designing FIR digital filters. It is based on a linear programming algorithm called the Remez exchange. Our new algorithm is based on quadratic programming, which includes linear programming as a special case. The filters in this paper permit the designer to control the tradeoff between the peak error and the total squared error. These filters are designed according to the peak-constrained least-squares (PCLS) optimality criterion.<>
{"title":"New quadratic programming algorithms for designing FIR digital filters","authors":"J.W. Adams, P. Kruethong, R. Hashemi, J. L. Sullivan, D. Gleeson","doi":"10.1109/ACSSC.1993.342380","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342380","url":null,"abstract":"The Parks-McClellan algorithm (1973) is very popular for designing FIR digital filters. It is based on a linear programming algorithm called the Remez exchange. Our new algorithm is based on quadratic programming, which includes linear programming as a special case. The filters in this paper permit the designer to control the tradeoff between the peak error and the total squared error. These filters are designed according to the peak-constrained least-squares (PCLS) optimality criterion.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124069603","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 : 1993-11-01DOI: 10.1109/ACSSC.1993.342543
S. Lautenschlager, S. Mitra
Simplifying methods for tuning the frequency response of FIR digital filters realized using the structural subband decomposition are described. Based on numerous optimal filter designs, a linear approximation for the filter coefficients as a function of the cutoff frequency has been derived. In many cases, a number of filter coefficients can be replaced with zero values without significantly altering the frequency response characteristics. The frequency response of the filters are variable within narrow frequency ranges around the nominal cutoff frequency. The proposed methods do not change the filter length since the filter coefficients are directly controlled.<>
{"title":"A simplified tuning algorithm for FIR digital filters using subband decomposition","authors":"S. Lautenschlager, S. Mitra","doi":"10.1109/ACSSC.1993.342543","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342543","url":null,"abstract":"Simplifying methods for tuning the frequency response of FIR digital filters realized using the structural subband decomposition are described. Based on numerous optimal filter designs, a linear approximation for the filter coefficients as a function of the cutoff frequency has been derived. In many cases, a number of filter coefficients can be replaced with zero values without significantly altering the frequency response characteristics. The frequency response of the filters are variable within narrow frequency ranges around the nominal cutoff frequency. The proposed methods do not change the filter length since the filter coefficients are directly controlled.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125979576","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 : 1993-11-01DOI: 10.1109/ACSSC.1993.342331
I. Sodagar, K. Nayebi, T. Barnwell, M.J.T. Smith
Perfect reconstruction (PR) time-varying analysis-synthesis filter banks are those in which the filters are allowed to change from one set of PR filter banks to another as the input signal is being processed. Such systems have the property that, in the absence of coding, they faithfully reconstruct every sample of the input. This paper introduces a new approach to perfect reconstruction time-varying analysis-synthesis filter banks. The new method requires neither the redesign of the analysis sections, nor the use of any intermediate analysis filters during transition periods. It provides a simple procedure for designing time-varying filter banks without the disadvantages of the previous methods.<>
{"title":"A new approach to time-varying FIR filter banks","authors":"I. Sodagar, K. Nayebi, T. Barnwell, M.J.T. Smith","doi":"10.1109/ACSSC.1993.342331","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342331","url":null,"abstract":"Perfect reconstruction (PR) time-varying analysis-synthesis filter banks are those in which the filters are allowed to change from one set of PR filter banks to another as the input signal is being processed. Such systems have the property that, in the absence of coding, they faithfully reconstruct every sample of the input. This paper introduces a new approach to perfect reconstruction time-varying analysis-synthesis filter banks. The new method requires neither the redesign of the analysis sections, nor the use of any intermediate analysis filters during transition periods. It provides a simple procedure for designing time-varying filter banks without the disadvantages of the previous methods.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124811846","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 : 1993-11-01DOI: 10.1109/ACSSC.1993.342598
S. V. Schell, W. Gardner
In wireless communications, including cellular communication systems, spread spectrum overlay systems, and signals intelligence applications, the degradation caused by rapidly time-varying multipath and unknown co-channel interference can be reduced by adaptive spatial filtering using adaptive antenna arrays. The authors propose a flexible framework for adapting a spatial filter without using a training signal, array calibration data, or knowledge of spatial characteristics of the desired or interfering signals. The framework exploits one or more user-selected statistical properties to adapt the array. Simulation results illustrate the performance of algorithms developed within the new framework.<>
{"title":"Programmable canonical correlation analysis: a flexible framework for blind adaptive spatial filtering","authors":"S. V. Schell, W. Gardner","doi":"10.1109/ACSSC.1993.342598","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342598","url":null,"abstract":"In wireless communications, including cellular communication systems, spread spectrum overlay systems, and signals intelligence applications, the degradation caused by rapidly time-varying multipath and unknown co-channel interference can be reduced by adaptive spatial filtering using adaptive antenna arrays. The authors propose a flexible framework for adapting a spatial filter without using a training signal, array calibration data, or knowledge of spatial characteristics of the desired or interfering signals. The framework exploits one or more user-selected statistical properties to adapt the array. Simulation results illustrate the performance of algorithms developed within the new framework.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"46 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129779644","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 : 1993-11-01DOI: 10.1109/ACSSC.1993.342626
L. DeBrunner, S.A. Ahmed, V. DeBrunner, W.D. Ballew
The paper presents a completely pipelined regular array processor implementation of a direction of arrival estimator. The estimator employs the recursive/iterative eigenspace decomposition (RITE) of a hermitian Toeplitz spatial correlation matrix. In addition to the recursive and iterative nature of the algorithm, various dependencies are strongly connected. The eigenvalue computations are based on the secular equation, and the eigenvector computations are based on the Schur algorithm. A new concept of a flushing processor is employed to integrate the Schur implementation of lower and upper triangular matrices with asymptotic processor efficiency of 100%.<>
{"title":"A completely pipelined regular array processor implementation of the RITE algorithm","authors":"L. DeBrunner, S.A. Ahmed, V. DeBrunner, W.D. Ballew","doi":"10.1109/ACSSC.1993.342626","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342626","url":null,"abstract":"The paper presents a completely pipelined regular array processor implementation of a direction of arrival estimator. The estimator employs the recursive/iterative eigenspace decomposition (RITE) of a hermitian Toeplitz spatial correlation matrix. In addition to the recursive and iterative nature of the algorithm, various dependencies are strongly connected. The eigenvalue computations are based on the secular equation, and the eigenvector computations are based on the Schur algorithm. A new concept of a flushing processor is employed to integrate the Schur implementation of lower and upper triangular matrices with asymptotic processor efficiency of 100%.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127281022","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 : 1993-11-01DOI: 10.1109/ACSSC.1993.342490
Metin Gunsay, B. Jeffs
We address the problem of resolving and localizing blurred point sources in intensity images. A new approach to image restoration is introduced which is a 2-D generalization of techniques originating from the field of direction of arrival estimation (DOA). It is shown that in the frequency domain, blurred point source images can be modeled with a structure analogous to the response of linear sensor arrays to coherent sources. Thus the problem may be cast into the form of DOA estimation, and modern eigenvector based subspace decomposition algorithms, such as MUSIC, may be adapted to search for these point sources. A generalization of array smoothing based on a regularization operator is introduced for 2-D arrays in order to achieve rank enhancement in the signal space of the covariance matrix.<>
我们解决了强度图像中模糊点源的解决和定位问题。提出了一种新的图像恢复方法，该方法是对DOA方向估计(direction of arrival estimation, DOA)技术的二维推广。结果表明，在频域，模糊的点源图像可以用类似线性传感器阵列对相干源的响应的结构来建模。因此，该问题可以转化为DOA估计的形式，并且可以采用基于特征向量的子空间分解算法(如MUSIC)来搜索这些点源。为了在协方差矩阵的信号空间中实现秩增强，提出了一种基于正则化算子的二维阵列平滑的推广方法。
{"title":"An eigenvector based method for point source localization in blurred images","authors":"Metin Gunsay, B. Jeffs","doi":"10.1109/ACSSC.1993.342490","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342490","url":null,"abstract":"We address the problem of resolving and localizing blurred point sources in intensity images. A new approach to image restoration is introduced which is a 2-D generalization of techniques originating from the field of direction of arrival estimation (DOA). It is shown that in the frequency domain, blurred point source images can be modeled with a structure analogous to the response of linear sensor arrays to coherent sources. Thus the problem may be cast into the form of DOA estimation, and modern eigenvector based subspace decomposition algorithms, such as MUSIC, may be adapted to search for these point sources. A generalization of array smoothing based on a regularization operator is introduced for 2-D arrays in order to achieve rank enhancement in the signal space of the covariance matrix.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130141118","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 : 1993-11-01DOI: 10.1109/ACSSC.1993.342420
R. Duda
Head related transfer functions (HRTFs) characterize the transformation of a sound source to the sounds reaching the eardrums, and are central to binaural hearing. Because they are the result of wave propagation and diffraction, they can only be approximated by finitely parameterized filters. The functional dependence of the HRTF on azimuth and elevation is described, the requirements for a model are discussed, and existing models are reviewed.<>
{"title":"Modeling head related transfer functions","authors":"R. Duda","doi":"10.1109/ACSSC.1993.342420","DOIUrl":"https://doi.org/10.1109/ACSSC.1993.342420","url":null,"abstract":"Head related transfer functions (HRTFs) characterize the transformation of a sound source to the sounds reaching the eardrums, and are central to binaural hearing. Because they are the result of wave propagation and diffraction, they can only be approximated by finitely parameterized filters. The functional dependence of the HRTF on azimuth and elevation is described, the requirements for a model are discussed, and existing models are reviewed.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132176407","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
扫码关注我们
求助内容：
应助结果提醒方式：