{"title":"A hidden Markov model fingerprint classifier","authors":"A. Senior","doi":"10.1109/ACSSC.1997.680212","DOIUrl":"https://doi.org/10.1109/ACSSC.1997.680212","url":null,"abstract":"Fingerprint classification is an important indexing method for any fingerprint database or recognition system. Fingerprints are classified based on overall characteristics. This paper describes a novel method of classification using hidden Markov models to recognize the ridge structure of the print. The paper also describes a method for achieving any level of accuracy required by the system by sacrificing the efficiency of the classifier. Results are presented on a NIST fingerprint database.","PeriodicalId":240431,"journal":{"name":"Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)","volume":"340 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122749923","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":"A comparison of PSP-based array processors using structured and unstructured stochastic gradient estimators","authors":"G. Paparisto, K. Chugg","doi":"10.1109/ACSSC.1997.680043","DOIUrl":"https://doi.org/10.1109/ACSSC.1997.680043","url":null,"abstract":"We describe two algorithms for performing data detection and tracking of a multipath fading channel based on array measurements. Both of these algorithms are based on array measurements. Both of these algorithms are based on the concept of per-survivor processing and integrate the array combining and channel parameter estimation tasks into the trellis-based data detection process. One algorithm is based on explicitly estimating the angles of arrival and the multipath coefficients, while the other algorithm estimates only the overall array impulse response. Simulation results are presented that suggest that significant gains in the ability to track channel dynamics are realized using arrays-in addition to a significant SNR gain. An approximate analysis is developed to evaluate the performance of these algorithms. The robustness of both algorithms to variation in the modeled and actual channel conditions is also investigated.","PeriodicalId":240431,"journal":{"name":"Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122193360","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":"A wavelet zerotree-based hybrid compressed/uncompressed framework for wireless image transmission","authors":"I. Kozintsev, K. Ramchandran","doi":"10.1109/ACSSC.1997.679061","DOIUrl":"https://doi.org/10.1109/ACSSC.1997.679061","url":null,"abstract":"We consider the problem of efficient image transmission over noisy time-varying channels subject to a low transmission energy constraint (and fixed bandwidth/delay constraints). We examine the limits of desirability of a highly compressed representation using a joint source-channel coding (JSCC) framework. Specifically, invoking as a platform a state-of-the-art wavelet image coder, we demonstrate how the resulting highly compressed digital stream, appropriately protected against channel noise, is not always the best solution. We show how a hybrid scheme based on simple partitioning of the wavelet image representation into \"compressed\" and \"uncompressed\" components can lead to significantly improved performance (of the order of 3 dB in PSNR for Rayleigh channels) over popular JSCC schemes which are based on compressed, entropy-coded, and appropriately unequal error-protected (UEP) source representations.","PeriodicalId":240431,"journal":{"name":"Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123301893","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":"Visualising reconfigurable libraries for FPGAs","authors":"W. Luk, S. Guo","doi":"10.1109/ACSSC.1997.680263","DOIUrl":"https://doi.org/10.1109/ACSSC.1997.680263","url":null,"abstract":"This paper describes a framework and tools for visualising hardware libraries for field-programmable gate arrays (FPGAs), which should also be useful for circuit design in general. Our approach integrates the visualisation of design behaviour and structure, supports various simulation modes, and assists the development of run-time reconfigurable designs in FPGAs such as Xilinx 6200 devices. Our tools can automatically generate a block diagram from a concise parametrised description. Design operations are animated by projecting a dataflow model on the block diagram. The user can select to view data valves on specific input and output ports and internal paths. Numerical, symbolic and bit-level simulation and their combination are supported, and the animation speed can be adjusted. The tools should benefit both library users and suppliers, since they can be used (a) to show the internal structure of a design, (b) to illustrate effective usage of library components, and (c) to present the consequences of parametrising designs in different ways.","PeriodicalId":240431,"journal":{"name":"Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126253834","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":"Design of low power, high density gallium arsenide asynchronous primitives for multimedia computing","authors":"K. Eshraghian, S. Lachowicz, D. Lucas, A. Rassau","doi":"10.1109/ACSSC.1997.679156","DOIUrl":"https://doi.org/10.1109/ACSSC.1997.679156","url":null,"abstract":"The present trend to use VLSI DSP for multimedia computing and communications imposes new, very high level of performance requirements for the underlying technology. The concept of personal interactive mobile multimedia communicator (M/sup 3/C) requires very high performance in terms of processing speed and the associated power-area product. Portability of the system imposes further complexity in terms of the need for low voltage operation. This paper presents the design methodology for highly pipelined, asynchronous primitives suitable for multimedia applications using gallium arsenide MESFET, as the base technology implementation of latched logic design style (PDLL, LCFL). The use of latched logic together with the absence of the global clock provides for low power dissipation while maintaining the very high speed of the system. The application of the modified ring notation to layout the pipelined system allows circuit densities in excess of 10000 active devices per mm/sup 2/ in 0.6 /spl mu/m GaAs MESFET technology and operating at less than 1 volt power supply.","PeriodicalId":240431,"journal":{"name":"Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131845810","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":"Locally adaptive orientation Wiener image filter with local noise estimate","authors":"Y. Prieto, C. Lindquist","doi":"10.1109/ACSSC.1997.680231","DOIUrl":"https://doi.org/10.1109/ACSSC.1997.680231","url":null,"abstract":"The restoration of images degraded by additive noise has been addressed previously by several authors. In this work, to overcome the consequences that arise from cascading filters sequentially (namely, the fact that the noise behavior changes more and more the deeper into the cascade), while still preserving edges and maintaining low computational requirements, we propose a modified locally adaptive orientation Wiener filter (MAOW). Different masks are applied at each pixel to a local region and the mask yielding a minimum variance is the selected one; thus mask orientations can vary locally. In addition to improve the operation of the AOW, we need a noise estimation that is locally varying. This is obtained by using the information that is already available to us from the quantizer prior to filtering.","PeriodicalId":240431,"journal":{"name":"Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120815511","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":"Locally-adaptive perceptual quantization without side information for DCT coefficients","authors":"I. Hontsch, Lina Karam","doi":"10.1109/ACSSC.1997.679056","DOIUrl":"https://doi.org/10.1109/ACSSC.1997.679056","url":null,"abstract":"Existing JPEG/MPEG compliant perceptual coding methods do not fully exploit the local variation of perceptual masking thresholds. This work demonstrates that, for natural images with the same perceptual quality, the first-order entropy of the quantizer outputs can be reduced by 15 to 40 percent when optimal locally-adaptive perceptual quantization is used. Locally-adaptive perceptual quantization requires the perceptual thresholds to be available at the decoder. However, transmitting the thresholds is prohibited by the large amount of side information required. In this paper, a DCT-based method is introduced that performs locally-adaptive perceptual quantization without side information based on estimates of the perceptual thresholds from the already quantized data. Since no additional side information is required, this method is compliant with the bit stream syntax of the above mentioned standards.","PeriodicalId":240431,"journal":{"name":"Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130722035","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":"Statistical performance analysis of the adaptive sidelobe blanker detection algorithm","authors":"C. Richmond","doi":"10.1109/ACSSC.1997.680568","DOIUrl":"https://doi.org/10.1109/ACSSC.1997.680568","url":null,"abstract":"A method was proposed for reducing the high false alarm rate of the adaptive matched filter (AMF) under non-homogeneous conditions. It consists of sequentially following the AMF test with the adaptive cosine estimator (ACE) which determines what fraction of the total energy present in a test cell originates from the target direction. The overall detection algorithm, called the adaptive sidelobe blanker (ASB), is two dimensional and has exhibited significant potential in experimental settings. The goal of this paper is to provide a theoretical analysis of this 2-D algorithm.","PeriodicalId":240431,"journal":{"name":"Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)","volume":"620 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134453451","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":"Zero-crossing contour construction for scale-space filtering","authors":"H. Dehghan","doi":"10.1109/ACSSC.1997.679150","DOIUrl":"https://doi.org/10.1109/ACSSC.1997.679150","url":null,"abstract":"The description of a signal or an image is only meaningful over a limited range of resolutions. The interest in and perception of different features of a signal depends not only on the signal, but on the scale of observation. Witkin (1983) has developed a multi-resolution method that looks at a signal over a continuum of scales in the course of describing it by finding the zero-crossing contour of a signal-fingerprint-and plotting the signal's scale-space image. In this paper we present a fast and adaptive procedure for constructing the zero-crossing contours of a signal. We present two algorithms for finding the optimum smoothing scales and relating the zero-crossing of adjacent scales by our developed similarity measure.","PeriodicalId":240431,"journal":{"name":"Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132728461","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":"Robust DMR and multi-rate adaptive beamforming","authors":"H. Cox, R. Pitre","doi":"10.1109/ACSSC.1997.680577","DOIUrl":"https://doi.org/10.1109/ACSSC.1997.680577","url":null,"abstract":"Dominant mode rejection (DMR) is an approach to adaptive beamforming in which only the large eigenvalues of the correlation matrix and their eigenvectors are used. It requires fewer snapshots due to the reduced degrees-of-freedom. Once the partial eigendecomposition has been performed, a variety of opportunities arise to adjust the algorithms on a beam-by-beam basis without significant additional computations. A modification is developed to improve the robustness to signal mismatch. An approach to controlling the quiescent beam pattern that works for ocean acoustic noise is also presented. The standard approaches fail because source array elements are usually spaced closer than one-half wavelength so that the noise is correlated. Finally a two stage adaptive approach is introduced. It involves a slowly adapting algorithm optimized for nearly stationary conditions followed by a thresholded DMR that rapidly adapts to dynamic interference, but only when the interference is strong.","PeriodicalId":240431,"journal":{"name":"Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)","volume":"194 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132485203","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}