{"title":"Image coding using vector quantization in LP/sub /spl infin// space","authors":"M. Ghassemian, A. Venetsanopoulos","doi":"10.1109/ADFSP.1998.685684","DOIUrl":"https://doi.org/10.1109/ADFSP.1998.685684","url":null,"abstract":"This paper presents a vector quantization scheme, based on the current understanding of early vision. This allows one to capture more details around the region of interest, and less details farther from that region, which can be achieved by a variable resolution in the feature domain. A cone beam form, nonuniform, multidimensional sampling strategy has been introduced, where the size of each cell increases proportionally to the inverse of the cell's distance from the region of interest. To simplify the actual realization, a discrete-ray-distance has been introduced in the LP/sub /spl infin// space, generating hyper-cubic cells. This approach can be used in MRI image representation, the 3-D Radon transformation, and volumetric image reconstruction.","PeriodicalId":424855,"journal":{"name":"1998 IEEE Symposium on Advances in Digital Filtering and Signal Processing. Symposium Proceedings (Cat. No.98EX185)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127792077","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}
{"title":"Peak-constrained least-squares design of IIR digital filters","authors":"S. L. Netto, P. Diniz","doi":"10.1109/ADFSP.1998.685694","DOIUrl":"https://doi.org/10.1109/ADFSP.1998.685694","url":null,"abstract":"An approach for approximating infinite duration impulse response (IIR) digital filters is proposed. The method is able to compromise maximum stopband attenuation and minimum stopband energy requirements. The approach is based on the weighted-least-squares (WLS) method with a weight function which is made constant within a given frequency interval at each iteration. In that sense, IIR digital filters with partially WLS-like and partially equiripple stopbands are efficiently designed.","PeriodicalId":424855,"journal":{"name":"1998 IEEE Symposium on Advances in Digital Filtering and Signal Processing. Symposium Proceedings (Cat. No.98EX185)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128514796","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}
{"title":"Effects of finite word length in two-channel QMF banks","authors":"E. Abdel-Raheem, A. Tawfik, F. El-Guibaly","doi":"10.1109/ADFSP.1998.685713","DOIUrl":"https://doi.org/10.1109/ADFSP.1998.685713","url":null,"abstract":"Finite word-length effects in multirate two-channel quadrature mirror filter (QMF) banks are presented. Aliasing cancellation, amplitude and/or phase distortions, and the perfect-reconstruction property due to finite-precision effects are investigated. A finite-precision model is applied to several types of QMF banks and the results are reported.","PeriodicalId":424855,"journal":{"name":"1998 IEEE Symposium on Advances in Digital Filtering and Signal Processing. Symposium Proceedings (Cat. No.98EX185)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125422685","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}
{"title":"Comparison of the use of neural networks versus statistical models in fault detection for cable television networks","authors":"N. P. Kourounakis, S. Neville, N. Dimopoulos","doi":"10.1109/ADFSP.1998.685710","DOIUrl":"https://doi.org/10.1109/ADFSP.1998.685710","url":null,"abstract":"In this work, we present a model-based method for reliably detecting reverse pilot faults within cable amplifier networks. This method has the advantage over traditional fixed bound fault detection techniques in that it is able to track changes in the environmental conditions and accurately detect changes in signal behaviour. The resulting method offers increased fault detection sensitivity and reduced false alarms rate. We have implemented a general approach based on the use of a modeling engine which is capable of capturing the behaviour of the reverse pilot of cable television amplifiers. Two modeling engines were developed for this purpose. The first one is based on the use of feedforward neural networks, and the second one is based on the use of statistical analysis techniques. The resulting fault detection system, employing either modeling engine, was able to provide good temporal localization of the start of fault conditions and a clear indication of the presence of the fault through its occurrence.","PeriodicalId":424855,"journal":{"name":"1998 IEEE Symposium on Advances in Digital Filtering and Signal Processing. Symposium Proceedings (Cat. No.98EX185)","volume":"190 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131434858","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}
A. Clausen, T. Painter, A. Xavier, M. Tampi, Tuyet-Trang Lam, A. Constantinou, A. Spanias
{"title":"J-DSP: an Internet-based educational tool for digital filter experiments","authors":"A. Clausen, T. Painter, A. Xavier, M. Tampi, Tuyet-Trang Lam, A. Constantinou, A. Spanias","doi":"10.1109/ADFSP.1998.685695","DOIUrl":"https://doi.org/10.1109/ADFSP.1998.685695","url":null,"abstract":"An Internet-based online laboratory for educational investigations of both FIR and IIR digital filters is presented. The online laboratory includes facilities for simulations of one- and two-dimensional, separable and non-separable filters. The software is written as a Java applet that can be accessed over the Internet. Object oriented programming allows users to construct and simulate a variety of systems. The system offers users a library of objects for many operations, including one- and two-dimensional input generation, as well as one- and two-dimensional IIR and FIR filtering. Moreover, J-DSP contains objects for processing of sound files. The program uses a graphical user interface that is easy to learn and provides a visualization of the system and signal flow. The software is currently being used at Arizona State University to support an online software laboratory for senior and first-year graduate level courses on digital signal processing. Additionally, the paper summarizes experiences in a classroom setting, and discusses new laboratory exercises which were developed with the simulation tool.","PeriodicalId":424855,"journal":{"name":"1998 IEEE Symposium on Advances in Digital Filtering and Signal Processing. Symposium Proceedings (Cat. No.98EX185)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116342516","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}
{"title":"Hardware implementation of a wavelet based image compression coder","authors":"J. Singh, A. Antoniou, D. Shpak","doi":"10.1109/ADFSP.1998.685718","DOIUrl":"https://doi.org/10.1109/ADFSP.1998.685718","url":null,"abstract":"A VLSI architecture designed to perform real-time image compression using wavelets is described. The two basic modules of the architecture are a 2-D wavelet transform generator and a coder based on the SPIHT algorithm for lossy image compression. A folded architecture is proposed for computing the 2-D wavelet transform. The architecture uses 3 parallel computational units and 2 storage units. The hardware for the SPIHT coder uses 2 content addressable memories and 3 random access memories. The designs are modular and can easily be extended for different levels of wavelet decomposition and filter lengths. The derived architecture has been functionally verified for an 8/spl times/8 image size by simulating its VHDL code using Mentor Graphics.","PeriodicalId":424855,"journal":{"name":"1998 IEEE Symposium on Advances in Digital Filtering and Signal Processing. Symposium Proceedings (Cat. No.98EX185)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131491022","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}
{"title":"Composite squared-error algorithm for training feedforward neural networks","authors":"D. Gonzaga, M. de Campos, S. L. Netto","doi":"10.1109/ADFSP.1998.685707","DOIUrl":"https://doi.org/10.1109/ADFSP.1998.685707","url":null,"abstract":"A new algorithm, the so-called composite squared-error (CSE) algorithm, for training neural networks is presented. The CSE algorithm, whose roots lie in the field of adaptive IIR filtering, is able to avoid suboptimal solutions and associated saddle points, thus achieving lower values of the associated mean-squared-error function in a fewer number of iterations. For that matter, the CSE algorithm can regularly outperform other existing training schemes in most applications where neural networks are employed.","PeriodicalId":424855,"journal":{"name":"1998 IEEE Symposium on Advances in Digital Filtering and Signal Processing. Symposium Proceedings (Cat. No.98EX185)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121442218","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}
{"title":"Fast algorithms for orthogonal and biorthogonal modulated lapped transforms","authors":"Henrique S. Malvar","doi":"10.1109/ADFSP.1998.685716","DOIUrl":"https://doi.org/10.1109/ADFSP.1998.685716","url":null,"abstract":"New algorithms for the computation of orthogonal and biorthogonal modulated lapped transforms (MLTs) are presented. The new structures are obtained by combining the MLT window operators with stages from a previously introduced structure for the type-IV discrete cosine transform (DCT-IV). The net result is fewer multiplications and additions than previously reported algorithms. For the orthogonal MLT, in particular, the new structure requires the computation of a slightly modified DCT-IV and some extra additions, but no further multiplications; so it demonstrates that the multiplicative complexity of the orthogonal MLT is the same as that of the DCT-IV.","PeriodicalId":424855,"journal":{"name":"1998 IEEE Symposium on Advances in Digital Filtering and Signal Processing. Symposium Proceedings (Cat. No.98EX185)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132079764","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}