{"title":"A new class of nonlinearly constrained linear estimator","authors":"S. Konyk, M. Amin","doi":"10.1109/ICASSP.1988.197089","DOIUrl":"https://doi.org/10.1109/ICASSP.1988.197089","url":null,"abstract":"The problem of model parameter estimation subject to a simple class of nonlinear constraints in the time domain is addressed. The model parameters correspond to tap-delay filter weights and are used to approximate, within the constraints, a desired signal in the mean-square sense. The class of nonlinear constraints consists of convex quadratic functions with one-dimensional null space. This class, which includes the variance of the weight vector, allows the constrained optimization problem to be carried out by two successive unconstrained optimization algorithms implemented in multidimensional and unidimensional spaces. When the least-mean-squares (LMS) technique is used in both spaces, it is shown that the overall convergence time is not influenced by the constraint, i.e. it is primarily determined by the constraint-free LMS algorithm in the multidimensional space.<<ETX>>","PeriodicalId":448544,"journal":{"name":"ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114777295","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 16 kb/s APC system with adaptive postfilter and evaluation of its performance","authors":"D. J. Zarkadis, B. Evans","doi":"10.1109/ICASSP.1988.196664","DOIUrl":"https://doi.org/10.1109/ICASSP.1988.196664","url":null,"abstract":"An adaptive predictive coder (APC) with backward adaptive short-term predictor is presented for operation at 16 kb/s. Adaptive postfiltering is applied in the output of the decoder. The performance of the coder is evaluated both objectively and subjectively for fixed and switched degrees of postfiltering. Based on a stimulus-response model for the subjective testing method the performance of the coder is expressed in terms of Q-equivalent values.<<ETX>>","PeriodicalId":448544,"journal":{"name":"ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114883978","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 comparative performance evaluation of adaptive ARMA spectral estimation methods for noisy speech","authors":"A. Basu, K. Paliwal","doi":"10.1109/ICASSP.1988.196680","DOIUrl":"https://doi.org/10.1109/ICASSP.1988.196680","url":null,"abstract":"The problem of adaptive estimation of linear prediction (LP) coefficients from noisy speech is considered. Performance of three adaptive ARMA spectral estimation algorithms are studied for this purpose: the recursive extended least squares (RELS) algorithm, the recursive maximum likelihood (RML) algorithm, and the overdetermined recursive instrumental variable (ORIV) algorithm. To put them in proper perspective, the normalized LMS (NLMS) has also been considered. The ORIV algorithm is found to be the best in terms of Itakura distance from the ideal LP coefficients and the power spectral density estimation. The RML algorithm is found to be robust in highly noisy cases.<<ETX>>","PeriodicalId":448544,"journal":{"name":"ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114631328","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":"Tree coding of image sub-bands","authors":"S. Nanda, W. Pearlman","doi":"10.1109/ICASSP.1988.196698","DOIUrl":"https://doi.org/10.1109/ICASSP.1988.196698","url":null,"abstract":"It is proved that optimal coding of image subbands achieves the ultimate rate-distortion performance for Gaussian sources with squared-error distortion. Optimal performance is achieved only asymptotically with infinite-size source sequences. The approach of the rate-distortion function of finite-size sequences to its limit is investigated and a bound is derived that shows a potentially closer approach for coding subbands that for the full band. A suboptimal realization of an optimal tree coding method is used to encode both the full-band image and its subbands at 1.0 bit per pixel. The subband tree-coded image is more than 2 dB better in SNR and its overall performance is nearly comparable to that of the best schemes known to date.<<ETX>>","PeriodicalId":448544,"journal":{"name":"ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116845893","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":"More on optimality of EVD methods for bearing estimation","authors":"S. Tressens, H. Clergeot, A. Ouamri, M. Bouvet","doi":"10.1109/ICASSP.1988.197255","DOIUrl":"https://doi.org/10.1109/ICASSP.1988.197255","url":null,"abstract":"A general expression is developed for the variance of bearing estimates of M sources obtained by EVD and the MUSIC algorithm (or an extension of it already introduced by the authors in the case of partially correlated sources). Comparison with a suitable form of the Cramer-Rao bounds demonstrates that optimality is reached only if all signal eigenvalues are much greater than the noise level. The analysis is extended to specific improvements such as spatial averaging or multiple frequency averaging, the effect of which is to avoid the occurrence of very small eigenvalues in the case of correlated sources.<<ETX>>","PeriodicalId":448544,"journal":{"name":"ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117114133","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":"On uniform one-chip VLSI design considerations for some discrete orthogonal transforms","authors":"Kui Liu, K. Yao","doi":"10.1109/ICASSP.1988.197054","DOIUrl":"https://doi.org/10.1109/ICASSP.1988.197054","url":null,"abstract":"One-chip VLSI design consideration for AT/sup 2/ optimal fast Fourier transform (FFT) shuffle-exchange architecture is considered, and a systolic-network architecture for the computation of the FFT is presented. This architecture has the same asymptotically optimal theoretical O(N/sup 2/log/sup 2/N) AT/sup 2/ complexity as the FFT shuffle-exchange architecture, but is more suitable for one-chip VLSI design. Architectures which are feasible for a one-chip FFT design, as well as for shuffle-exchange-type fast discrete orthogonal transforms such as the generalized transform, cosine transform, and slant transform are also discussed.<<ETX>>","PeriodicalId":448544,"journal":{"name":"ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117250375","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":"Automated 3D reconstruction of tree-like structures from two orthogonal views","authors":"Ying Sun, Eric Bergerson","doi":"10.1109/ICASSP.1988.196840","DOIUrl":"https://doi.org/10.1109/ICASSP.1988.196840","url":null,"abstract":"The common use of orthogonal X-ray images for the diagnosis of vascular abnormalities provides a natural motivation for three dimensional reconstruction from two perpendicular views. Reconstruction from two projections is a problem with a non-unique solution. Ambiguity in the 3D reconstruction has previously been resolved by manually matching feature points between the two views. In this study, a priori knowledge of the object's tree-like structure was incorporated into a rule-base in order to help automate the reconstruction process. The procedure for reconstruction of a tree-like structure from two orthogonal images contains three stages: extraction of the skeletal knowledge in each image, determination of the correspondence of tree segments between views by application of a heuristic rule-base, and algorithmic 3D reconstruction from the corresponding segment pairs.<<ETX>>","PeriodicalId":448544,"journal":{"name":"ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing","volume":"190 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117354420","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":"An approach towards improving the efficiency of sonar projector arrays","authors":"P. Joseph, P. Pillai","doi":"10.1109/ICASSP.1988.197206","DOIUrl":"https://doi.org/10.1109/ICASSP.1988.197206","url":null,"abstract":"One of the high-power limitations encountered in modern sonar systems is caused by the mutual interaction effect among the densely packed elements of projector arrays. This causes severe and complex effects at higher drive levels. This effect can be minimized by restructuring the array format with suitable selection of appropriate interelement spacing. The design considerations of uniform linear projector array formats that minimize the mutual interaction effect are presented. The radiation pattern and array gain of the proposed array are found to be improved, as far as certain signal and noise models are concerned.<<ETX>>","PeriodicalId":448544,"journal":{"name":"ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122115328","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":"Variable-rate multi-stage vector quantization for image coding","authors":"Yo-Sung Ho, A. Gersho","doi":"10.1109/ICASSP.1988.196802","DOIUrl":"https://doi.org/10.1109/ICASSP.1988.196802","url":null,"abstract":"A hierarchical approach to encoding of images using vector quantization (VQ) is described which allows VQ of large blocks with a tolerable computational complexity and permits progressive image reconstruction at bit rates as low as 0.3 bit/pixel. The technique used, multi-stage hierarchical VQ (MSHVQ), is a successive approximation approach for quantization that is based on recursive decomposition of larger image blocks into smaller subblocks. The encoder of MSHVQ consists of several stages, each of which encodes the quantization error generated from the previous stage. Digital decimation and interpolation techniques are used to convert between different vector dimensions in the higher level stages and to reduce the otherwise highly noticeable blocking effect in the reconstructed image. Variable-rate encoding increases the compression efficiency by allocating greater resolution to high-detail regions and provides a perceptually more consistent image quality throughout all areas of the decoded image. Experimental results show that MSHVQ yields a significantly improved image quality over conventional VQ of equivalent complexity.<<ETX>>","PeriodicalId":448544,"journal":{"name":"ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing","volume":"49 18","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120817326","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 simple algorithm for broadband detection and sorting","authors":"D. Ohlms, E. Kroman, W. Bradford","doi":"10.1109/ICASSP.1988.197236","DOIUrl":"https://doi.org/10.1109/ICASSP.1988.197236","url":null,"abstract":"A discussion is presented of an approach for automating the detection and sorting of multiple contacts in a multibeam, broadband detection system. The algorithm uses an ambiguity surface that is generated by integrating the existing broadband detection outputs according to predefined hypotheses of potential contact bearing and bearing rate. Thresholding the surface and grouping points above the threshold identifies the contacts. The sorting algorithm eliminates multiple detections of the same contact and generates a track history based on the centroid bearing and the bearing rate of the detected contacts.<<ETX>>","PeriodicalId":448544,"journal":{"name":"ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123900318","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}