{"title":"Parallel implementation for image rotation using parallel virtual machine (PVM)","authors":"J. Hinks, S. Amin","doi":"10.1109/CCECE.2001.933631","DOIUrl":"https://doi.org/10.1109/CCECE.2001.933631","url":null,"abstract":"Many image processing algorithms are particularly suited to distributed computing because these images are difficult and time consuming to analyse. Furthermore, existing algorithms contain explicit parallelism, which can be efficiently exploited by processing arrays. A good example of an image processing operation is the geometric rotation of a rectangular bitmap. This paper shows how this can be implemented on a distributed system using a parallel virtual machine, by splitting images into number of parts and sending each to a separate computing node. Each node performs a rotation on its partial image before returning it to the master node to be recombined in a single image. A variety of image sizes and number of distributed computing nodes were used to determine the efficiency of this technique, and whether it offers enough speed improvement to justify its complexity. Whilst rotating large images benefited enormously using this algorithm, small images rotated more slowly than they would have done on a single processor. This is of particular importance in the case of large digital images, which may consist of millions of pixels.","PeriodicalId":184523,"journal":{"name":"Canadian Conference on Electrical and Computer Engineering 2001. Conference Proceedings (Cat. No.01TH8555)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114480960","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":"20 GHz ultra-short optical pulse source generated by DFB-LD and pulse compression technology","authors":"J. Dai, Xiaohong Ma, Jinlong Yu, E. Yang","doi":"10.1109/CCECE.2001.933728","DOIUrl":"https://doi.org/10.1109/CCECE.2001.933728","url":null,"abstract":"This paper studies that generation of 20 GHz ultra-short optical pulse series by 10 GHz DFB-LD with OTDM and pulse compression technology. A novel three-stage compression technology is brought forward, including compensation in normal dispersion fiber, compressing in anomalous dispersion fiber followed normal dispersion fiber and in comb-like dispersion profile fiber (CDPF). In the experiment, the compressed pulse of 3.3 ps pulse width was obtained and the total compress factor is 7.6. This technique is important for implementing an 80 Gb/s OTDM system.","PeriodicalId":184523,"journal":{"name":"Canadian Conference on Electrical and Computer Engineering 2001. Conference Proceedings (Cat. No.01TH8555)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114701461","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":"The use of conceptual models during the design of new telecommunication services","authors":"A. Roshannejad, A. Eberlein","doi":"10.1109/CCECE.2001.933606","DOIUrl":"https://doi.org/10.1109/CCECE.2001.933606","url":null,"abstract":"The increasing demand for new telecommunication services encourages service providers to extend their service offerings. However, the development of such services and their deployment on the public network are non-trivial tasks. Experience has shown that the use of conceptual models can assist in the development of new systems. This paper investigates the usefulness of conceptual models containing information on the telecommunications domain and development process models, during the development of new telecommunication services. After an introduction to conceptual models, telecommunication services and requirements engineering, informal, semi-formal and formal conceptual models are discussed. Then Telos, an object-oriented knowledge-representation language that is well suited for conceptual modeling, is introduced. Some examples of the application and integration of informal, semi-formal and formal conceptual models in the Requirements Assistant for Telecommunication Services (RATS) are given.","PeriodicalId":184523,"journal":{"name":"Canadian Conference on Electrical and Computer Engineering 2001. Conference Proceedings (Cat. No.01TH8555)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125395382","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":"Efficient recognition of continuously-spoken numbers","authors":"D. O'Shaughnessy, M. Gabrea","doi":"10.1109/CCECE.2001.933735","DOIUrl":"https://doi.org/10.1109/CCECE.2001.933735","url":null,"abstract":"Automatic recognition of continuously-spoken numbers (e.g., telephone or credit card digit sequences) is possible with excellent accuracy, even in applications using telephone lines and serving a large population. However, even such simple recognition tasks suffer decreased performance in adverse conditions, e.g., significant background noise or fading on portable telephone channels. If we further impose significant limitations on the computing resources for the recognition task, then robust efficient speech recognition is still a significant challenge, even for a vocabulary as simple as the digits. Since connected-digit recognition over telephone lines has very practical applications. The amount of computer resources needed for a given level of recognition accuracy is investigated. Rather than use a traditional hidden Markov model approach with cepstral analysis, which is computationally intensive and does not always work well under adverse acoustic conditions, a simpler spectral analysis is used, combined with a segmental approach. The restricted nature of the digit vocabulary allows this simpler approach. High recognition accuracy can be maintained despite a large decrease in both memory and computation.","PeriodicalId":184523,"journal":{"name":"Canadian Conference on Electrical and Computer Engineering 2001. Conference Proceedings (Cat. No.01TH8555)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121926044","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 high speed add-compare-select for Viterbi decoders","authors":"R. Pillai, P. D'Arcy","doi":"10.1109/CCECE.2001.933611","DOIUrl":"https://doi.org/10.1109/CCECE.2001.933611","url":null,"abstract":"Add-compare-select (ACS) operations form the kernel of Viterbi algorithms. Owing to the ostensibly sequential nature of the ACS algorithm, hardware implementations often used to be slower. We propose a concurrent add-compare scheme that completes addition and comparison almost simultaneously. Power delay models that reflect the algorithmic, circuit and technological limitations of the target realization are developed. With radix 2 and 4 ACSs involving 16 bit operands, the proposed schemes offer a worst case delay reduction of better than 10% for sub 0.2 micron CMOS processes.","PeriodicalId":184523,"journal":{"name":"Canadian Conference on Electrical and Computer Engineering 2001. Conference Proceedings (Cat. No.01TH8555)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131282194","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 study of microscopic images of human breast disease using competitive neural networks","authors":"R. Allan, W. Kinsner","doi":"10.1109/CCECE.2001.933698","DOIUrl":"https://doi.org/10.1109/CCECE.2001.933698","url":null,"abstract":"Competitive neural networks offer a unique opportunity to extract features from medical images objectively. An advantage of this approach is that medical image analysis could be automated or semi-automated. This automation could lead to improved precision and accuracy of diagnostic interpretation, while semi-automation could achieve much the same goal and would serve as a natural stepping-stone to full automation. This paper shows that all types of competitive neural networks can extract general features from images obtained through a microscope of four types of human breast disease, two benign and two malignant. Assessed qualitatively, the features broadly encompass thresholding and edge detection. These features are extracted regardless of supervision or lack of supervision. To visual inspection, there are no obvious sharp distinctions between benign and malignant diagnoses, the most important distinction in tissue diagnosis.","PeriodicalId":184523,"journal":{"name":"Canadian Conference on Electrical and Computer Engineering 2001. Conference Proceedings (Cat. No.01TH8555)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131424871","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 structured versus unstructured 2D hierarchical mesh for video object motion tracking","authors":"Wael Badawy","doi":"10.1109/CCECE.2001.933570","DOIUrl":"https://doi.org/10.1109/CCECE.2001.933570","url":null,"abstract":"This paper presents the performance of the hierarchical adaptive structured mesh (HASM). HASM can be used for limited power and limited bandwidth applications since it reduces the power consumption and the required bandwidth. The proposed technique can be used in MPEG-4 applications. The encoder generates the mesh using HASM and estimates the motion vectors for the mesh nodes, then it sends the mesh code and the nodes' motion vector to the decoder. The decoder uses the mesh topology and the nodes' motion vector to predict the frame by tracking the deformation of the mesh. The performance analysis is conducted and it shows that HASM outperforms the unstructured mesh techniques since it reduces the mesh code and reduces the power consumption for the receiver.","PeriodicalId":184523,"journal":{"name":"Canadian Conference on Electrical and Computer Engineering 2001. Conference Proceedings (Cat. No.01TH8555)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132691402","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":"Multirate signal estimation","authors":"O. Jahromi, B. Francis, R. Kwong","doi":"10.1109/CCECE.2001.933674","DOIUrl":"https://doi.org/10.1109/CCECE.2001.933674","url":null,"abstract":"This article introduces a technique for estimating samples of a random signal based on observations made by several observers and at different sampling rates. We consider a discrete-time mathematical model where an observer sees the original random signal x(n) through a bank of sensors which we model by linear filters and downsamplers. Each sensor, therefore, outputs a measurement signal v/sub i/(n) whose sampling rate is only a fraction of the sampling rate assumed for the original signal under observation. It is straightforward to show that the optimal least-mean-squares estimator for our problem is a linear operator F operating on v/sub i/(n)s. We observe, however, that to find F we need to know the power spectral density P/sub x/(e/sup jw/) of x(n) which is itself not observable. This motivates us to consider the possibility of estimating P/sub x/(e/sup jw/) using the observable low-rate data. We show that the statistical inference problem which addresses estimation of P/sub x/(e/sup jw/) given certain statistics of v/sub i/(n) is mathematically ill-posed. We resolve this ill-posed inference problem using the principle of maximum entropy. We show, moreover, that the proposed maximum entropy inference technique is a continuous mapping. Therefore, one might safely use it to estimate P/sub x/(e/sup jw/) based on approximate statistics of v/sub i/(n) obtained from the samples.","PeriodicalId":184523,"journal":{"name":"Canadian Conference on Electrical and Computer Engineering 2001. Conference Proceedings (Cat. No.01TH8555)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132994901","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}
R. Billinton, M. Fotuhi‐Firuzabad, S. Faried, S. Aboreshaid
{"title":"Power system adequacy evaluation incorporating a unified power flow controller","authors":"R. Billinton, M. Fotuhi‐Firuzabad, S. Faried, S. Aboreshaid","doi":"10.1109/CCECE.2001.933711","DOIUrl":"https://doi.org/10.1109/CCECE.2001.933711","url":null,"abstract":"This paper examines the impact of a UPFC on power system reliability. The UPFC is employed in the system to control the bus voltage (V/sub s/) and the power flow (P and Q). The effect on the system reliability of using such a controller is measured using different reliability indices. A reliability model is developed for the transmission system where the UPFC is installed in one of the transmission lines. The capabilities and application of the technique and models presented in the paper are illustrated using a test system.","PeriodicalId":184523,"journal":{"name":"Canadian Conference on Electrical and Computer Engineering 2001. Conference Proceedings (Cat. No.01TH8555)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134354278","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 iris detection using neural nets","authors":"H. El-Bakry","doi":"10.1109/CCECE.2001.933664","DOIUrl":"https://doi.org/10.1109/CCECE.2001.933664","url":null,"abstract":"In this paper, a combination of fast and cooperative modular neural nets to enhance the performance of the detection process is introduced. We have applied such approach successfully to detect human faces in cluttered scenes (El-Bakry et al. 2000). Here, this technique is used to identify human irises automatically in a given image. In the detection phase, neural nets are used to test whether a window of 20/spl times/20 pixels contains an iris or not. The major difficulty in the learning process comes from the large database required for iris/non-iris images. A simple design for cooperative modular neural nets is presented to solve this problem by dividing these data into three groups. Such division results in reduction of computational complexity and thus decreasing the time and memory needed during the test of an image. Simulation results for the proposed algorithm show a good performance.","PeriodicalId":184523,"journal":{"name":"Canadian Conference on Electrical and Computer Engineering 2001. Conference Proceedings (Cat. No.01TH8555)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129830974","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}