发布求助
文献互助 智能选刊 最新文献

Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing最新文献

筛选
英文 中文
A new approach for efficient Hough transform for circles 圆的高效霍夫变换新方法
Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 1989-06-01 DOI: 10.1109/PACRIM.1989.48315
R. Chan, W. Siu
{"title":"A new approach for efficient Hough transform for circles","authors":"R. Chan, W. Siu","doi":"10.1109/PACRIM.1989.48315","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48315","url":null,"abstract":"A parameter representation scheme is proposed for fast and efficient Hough transform of circles. This approach replaces the conventional three-dimensional accumulator array by a pair of two-dimensional planes. Inverse mapping from the estimated circle parameter sets to a subspace of the original image is used to verify the candidate circles, giving a recognition rate of 95-100%.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128976820","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}
引用次数: 23
Matched field processing gain for vertical and horizontal arrays 垂直和水平阵列的匹配场处理增益
Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 1989-06-01 DOI: 10.1109/PACRIM.1989.48426
R. D. Huston, J. Ozard
{"title":"Matched field processing gain for vertical and horizontal arrays","authors":"R. D. Huston, J. Ozard","doi":"10.1109/PACRIM.1989.48426","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48426","url":null,"abstract":"Array gain and accuracy of source localization from matched field processing (MFP) were determined for a variety of vertical and horizontal arrays (of hydrophones). A stationary source was assumed, and sound propagation was modeled by normal modes. Either white noise or planar isotropic noise was added to the signal to represent uncorrelated or correlated noise environments. MFP was used with either a generalized beamformer or an eigenvector method. Localization and array gain were often better with the eigenvector method. Accurate localization in range, depth and bearing was obtained with two vertical line arrays separated by lambda /2 or with a horizontal line array composed of two short arrays with lambda /2 spacings which are widely separated.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127623013","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}
引用次数: 0
Parameter estimation in chirped signals 啁啾信号中的参数估计
Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 1989-06-01 DOI: 10.1109/PACRIM.1989.48420
C.R. Smith, G. Erickson, P. Neudorfer
{"title":"Parameter estimation in chirped signals","authors":"C.R. Smith, G. Erickson, P. Neudorfer","doi":"10.1109/PACRIM.1989.48420","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48420","url":null,"abstract":"The discrete Fourier transform (DFT) is used almost routinely to analyze sampled time series. A careful formulation of any problem to be solved and a meticulous application of probability theory ought to generate the tools to be used for analyzing the problem. The tools thus arrived at may or may not be closely related to the DFT. In this work, the implementation of such a program is outlined in a well-known problem with its roots in radar and sonar. The transform that is germane to the analysis of a chirped signal is obtained automatically.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121350701","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}
引用次数: 2
Relative vector probabilities in differential chain-coded line-drawings 差分链编码线图中的相对矢量概率
Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 1989-06-01 DOI: 10.1109/PACRIM.1989.48324
R. Prasad, J. W. Vieveen, J. H. Bons, J. Arnbak
{"title":"Relative vector probabilities in differential chain-coded line-drawings","authors":"R. Prasad, J. W. Vieveen, J. H. Bons, J. Arnbak","doi":"10.1109/PACRIM.1989.48324","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48324","url":null,"abstract":"A derivation is given of the probabilities of the relative vectors which represent the approximating segments in a square coding ring for differential chain coding (DCC) of line drawings. These probabilities are required to calculate rate (coding efficiency) and distortion-versus-rate characteristics. The performances of the differential and nondifferential chain codes are compared. It is established that DCC has higher efficiency.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121378326","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}
引用次数: 30
Performance evaluation of prioritized collision-avoidance star local area networks 优先避碰星型局域网性能评价
Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 1989-06-01 DOI: 10.1109/PACRIM.1989.48347
H. Hassanein, A. Kamal
{"title":"Performance evaluation of prioritized collision-avoidance star local area networks","authors":"H. Hassanein, A. Kamal","doi":"10.1109/PACRIM.1989.48347","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48347","url":null,"abstract":"A two-class prioritized collision-avoidance star local area network (CASLAN) protocol is proposed and analyzed. The retry time of a node is used for priority assignment. A three-dimensional Markovian chain is used to model the CASLAN which is represented by a polling system in which the central node chooses at random one of the idle or ready nodes. Numerical results from the analytical model are presented, and these results are compared to results from a simulation model. The simulation results show that the model yields very accurate results at light to medium offered load. At heavy load, however, the analytical results are not always accurate.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128518015","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}
引用次数: 4
Language identification with neural networks: a feasibility study 神经网络语言识别的可行性研究
Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 1989-06-01 DOI: 10.1109/PACRIM.1989.48417
R. Cole, J.W.T. Inouye, Y. Muthusamy, M. Gopalakrishnan
{"title":"Language identification with neural networks: a feasibility study","authors":"R. Cole, J.W.T. Inouye, Y. Muthusamy, M. Gopalakrishnan","doi":"10.1109/PACRIM.1989.48417","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48417","url":null,"abstract":"The feasibility of an approach to automatic language identification that combines recent advances in computer speech recognition and artificial neural networks is discussed. It is shown that artificial neural networks can be used as pattern classifiers that use information about distributions of broad phonetic categories to identify languages. Using artificial languages that differ only by their distribution of stop consonants, feature vectors were extracted from varying amounts of speech from each language. These feature vectors were then used to train an artificial neural network using the back-propagation algorithm. Classification results for two different sets of artificial languages are presented.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129121474","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}
引用次数: 35
The method to identify the inner structure of a kind of nonlinear systems with sinusoid signals 研究一类含正弦信号的非线性系统的内部结构辨识方法
Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 1989-06-01 DOI: 10.1109/PACRIM.1989.48443
Ping Zhang, Yamin Song
{"title":"The method to identify the inner structure of a kind of nonlinear systems with sinusoid signals","authors":"Ping Zhang, Yamin Song","doi":"10.1109/PACRIM.1989.48443","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48443","url":null,"abstract":"A method is described to identify the inner structure of open-loop nonlinear systems using Volterra kernels in the frequency domain. By applying Volterra functional series theory to the systems, one can obtain a criterion for the inner structure of nonlinear systems which contain only one nonlinearity. When the input is a single-frequency sinusoid signal, one can divide this system into five kinds through measuring the Mf loci. After it is shown that the system has an open-loop structure, various models are discussed, and it is proved that the relations between the Volterra kernels of these models can help one to identify the inner structure in more detail.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117054418","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}
引用次数: 0
Analytical methods for the design of 2-D elliptically symmetric digital filters using McClellan transformation 利用麦克莱伦变换设计二维椭圆对称数字滤波器的解析方法
Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 1989-06-01 DOI: 10.1109/PACRIM.1989.48337
N. Nagamuthu, M. Swamy
{"title":"Analytical methods for the design of 2-D elliptically symmetric digital filters using McClellan transformation","authors":"N. Nagamuthu, M. Swamy","doi":"10.1109/PACRIM.1989.48337","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48337","url":null,"abstract":"Some analytical methods are developed for choosing the coefficients of the first-order McClellan transformation for the design of two-dimensional elliptically symmetric digital filters from one-dimensional digital filters. Several extremely simple formulas are presented for both the original and the scaling-free coefficients for all the cases of both the vertical and the horizontal elliptical cutoff contours. The formulas are derived by forcing the lower-order significant terms in the power series expansion of the linear error function to zero. Many examples are given. The results of these methods agree very well with the results of the optimization methods, and the accuracy of the formulas is more than sufficient for many engineering applications. The formulas are very useful for real-time adaptive filter design and filtering by low-cost, stand-alone two-dimensional signal processors. The number of multiplications required to implement the designed filters is shown to be small.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115491463","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}
引用次数: 3
Performance evaluation of a multichannel token bus local area network architecture 多通道令牌总线局域网体系结构的性能评价
Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 1989-06-01 DOI: 10.1109/PACRIM.1989.48345
B. Wong
{"title":"Performance evaluation of a multichannel token bus local area network architecture","authors":"B. Wong","doi":"10.1109/PACRIM.1989.48345","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48345","url":null,"abstract":"A token-based protocol for multichannel local area network architectures is presented. The operation of the multichannel protocol is described, and its performance is evaluated by simulation. The simulation model is briefly described. Through simulation the behavior of the network is analyzed for varying network parameters and traffic load distributions. Discussions on the multichannel protocol's merits relative to the single channel protocol are provided. It is shown that the protocol offers improved throughput-delay performance with respect to the single channel token bus access protocol and that it also provides for high reliability and simpler network maintenance.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115282428","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}
引用次数: 1
Hardware implementation of a VDPCM using parallel processing architecture 采用并行处理架构的VDPCM硬件实现
Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 1989-06-01 DOI: 10.1109/PACRIM.1989.48446
K. Thyagarajan
{"title":"Hardware implementation of a VDPCM using parallel processing architecture","authors":"K. Thyagarajan","doi":"10.1109/PACRIM.1989.48446","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48446","url":null,"abstract":"A parallel processing architecture is described to implement the VDPCM encoder/decoder hardware for real-time image coding applications. The architecture consists of processing elements in modular form, and each module is designed around AT&T's DSP32 chip. The system is flexible and expandable. The hardware was used to encode images at a rate of 0.5 bit pixel, and results are given. The hardware results are in agreement with the computer simulations.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126643392","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}
引用次数: 1
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信