Pub Date : 1998-05-24DOI: 10.1109/CCECE.1998.682737
H. Chen, P. Yahampath, W. Kinsner
This paper presents a study of the application of multifractal measures in the segmentation of a video sequence image for object-oriented video coding through the generalized Renyi entropy. Grey-level sequence images are analyzed from the point of view of strange attractors. Multifractal feature maps are used to extract the features from the video sequence image. The nonuniform property of the image is reflected in the singularity spectrum and the Mandelbrot spectrum. Each video-object plane (VOP) specifies a particular image sequence content and the textures in the different contents can be separated because similar textures generally will have an homogeneous property which can be characterized by the singularity and Mandelbrot dimension of the fractal sets. Consequently, we can achieve not only image segmentation, but also a separation of the video-object layers (VOLs).
{"title":"Segmentation using multifractals for object-oriented video coding","authors":"H. Chen, P. Yahampath, W. Kinsner","doi":"10.1109/CCECE.1998.682737","DOIUrl":"https://doi.org/10.1109/CCECE.1998.682737","url":null,"abstract":"This paper presents a study of the application of multifractal measures in the segmentation of a video sequence image for object-oriented video coding through the generalized Renyi entropy. Grey-level sequence images are analyzed from the point of view of strange attractors. Multifractal feature maps are used to extract the features from the video sequence image. The nonuniform property of the image is reflected in the singularity spectrum and the Mandelbrot spectrum. Each video-object plane (VOP) specifies a particular image sequence content and the textures in the different contents can be separated because similar textures generally will have an homogeneous property which can be characterized by the singularity and Mandelbrot dimension of the fractal sets. Consequently, we can achieve not only image segmentation, but also a separation of the video-object layers (VOLs).","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117193051","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}
Pub Date : 1998-05-24DOI: 10.1109/CCECE.1998.685540
S. Kannan, S. Jayaram, M. Salama
The static synchronous series compensator (SSSC) have been gaining a lot of consideration in power systems with respect to increase and control of power flow in transmission lines. In this paper, a fuzzy logic based supplementary controller has been designed for SSSC to improve power system dynamic performance. A signal based on transmission line current has been used as a supplementary signal to the controller. The performance of the fuzzy logic based supplementary controller has been studied on a multi-machine system and the results have been presented.
{"title":"Fuzzy logic based supplementary controller for static synchronous series compensator","authors":"S. Kannan, S. Jayaram, M. Salama","doi":"10.1109/CCECE.1998.685540","DOIUrl":"https://doi.org/10.1109/CCECE.1998.685540","url":null,"abstract":"The static synchronous series compensator (SSSC) have been gaining a lot of consideration in power systems with respect to increase and control of power flow in transmission lines. In this paper, a fuzzy logic based supplementary controller has been designed for SSSC to improve power system dynamic performance. A signal based on transmission line current has been used as a supplementary signal to the controller. The performance of the fuzzy logic based supplementary controller has been studied on a multi-machine system and the results have been presented.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115045706","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}
Pub Date : 1998-05-24DOI: 10.1109/CCECE.1998.685575
J. Kieffer, E. Yang
This paper presents a class of new lossless data compression algorithms. Each algorithm in this class first transforms the original data to be compressed into an irreducible table representation and then uses an arithmetic code to compress the irreducible table representation. From the irreducible table representation, one can fully reconstruct the original data by performing multistage parallel substitution. A set of rules is described on how to perform hierarchical transformations from the original data to irreducible table representations. Theoretically, it is proved that all these algorithms outperform any finite state sequential compression algorithm and hence achieve the ultimate compression rate for any stationary and ergodic source. Furthermore, experiments on several standard images show that even a simple algorithm in this class, the so-called multi-level pattern matching algorithm, outperforms the Lempel-Ziv algorithms and arithmetic codes.
{"title":"Lossless data compression algorithms based on substitution tables","authors":"J. Kieffer, E. Yang","doi":"10.1109/CCECE.1998.685575","DOIUrl":"https://doi.org/10.1109/CCECE.1998.685575","url":null,"abstract":"This paper presents a class of new lossless data compression algorithms. Each algorithm in this class first transforms the original data to be compressed into an irreducible table representation and then uses an arithmetic code to compress the irreducible table representation. From the irreducible table representation, one can fully reconstruct the original data by performing multistage parallel substitution. A set of rules is described on how to perform hierarchical transformations from the original data to irreducible table representations. Theoretically, it is proved that all these algorithms outperform any finite state sequential compression algorithm and hence achieve the ultimate compression rate for any stationary and ergodic source. Furthermore, experiments on several standard images show that even a simple algorithm in this class, the so-called multi-level pattern matching algorithm, outperforms the Lempel-Ziv algorithms and arithmetic codes.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114690896","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}
Pub Date : 1998-05-24DOI: 10.1109/CCECE.1998.685630
D. Bouchard, G. S. Knight, A. Chikhani
Power distribution systems provide the final link between a utility and its customers. System components, and the functions that provide the analysis of those systems, can be represented by software objects. Design patterns can then be used to simplify the design of software for analysis and control of power distribution systems.
{"title":"Representing power distribution systems using objects and patterns","authors":"D. Bouchard, G. S. Knight, A. Chikhani","doi":"10.1109/CCECE.1998.685630","DOIUrl":"https://doi.org/10.1109/CCECE.1998.685630","url":null,"abstract":"Power distribution systems provide the final link between a utility and its customers. System components, and the functions that provide the analysis of those systems, can be represented by software objects. Design patterns can then be used to simplify the design of software for analysis and control of power distribution systems.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124786087","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}
Pub Date : 1998-05-24DOI: 10.1109/CCECE.1998.685638
K. Kwok, C. Selvakumar
We report the boron diffusion characteristics in Ge/sup +/-implanted Si with a peak Ge fraction of 12% and a B dose of 10/sup 12/ cm/sup -2/, annealed at 900/spl deg/C for 80 mins in a N/sub 2/ ambient. The boron diffusivity is four times lower than that in Si implanted with the same dose of B and annealed under identical conditions. TEM studies and SIMS results confirm the presence of extended defects in the surface region, end-of-range (EOR) defective region beyond the amorphous/crystalline interface (X/sub a/c/), and threading dislocations in between. The retardation is partially due to the trapping of B atoms and/or self-interstitials by extended defects remaining after the solid phase epitaxy. Future work is required if the dominant cause is to be determined.
{"title":"Boron diffusion in high-dose germanium-implanted silicon","authors":"K. Kwok, C. Selvakumar","doi":"10.1109/CCECE.1998.685638","DOIUrl":"https://doi.org/10.1109/CCECE.1998.685638","url":null,"abstract":"We report the boron diffusion characteristics in Ge/sup +/-implanted Si with a peak Ge fraction of 12% and a B dose of 10/sup 12/ cm/sup -2/, annealed at 900/spl deg/C for 80 mins in a N/sub 2/ ambient. The boron diffusivity is four times lower than that in Si implanted with the same dose of B and annealed under identical conditions. TEM studies and SIMS results confirm the presence of extended defects in the surface region, end-of-range (EOR) defective region beyond the amorphous/crystalline interface (X/sub a/c/), and threading dislocations in between. The retardation is partially due to the trapping of B atoms and/or self-interstitials by extended defects remaining after the solid phase epitaxy. Future work is required if the dominant cause is to be determined.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121385848","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}
Pub Date : 1998-05-24DOI: 10.1109/CCECE.1998.685594
L.F. Johnson
It is difficult to study industrial programmer productivity because of the extreme variance seen among individual programmers and the difficulty of performing controlled experiments. As an alternative to studying individual programmers, we examine the group productivity of programmer teams. We postulate that there is such a thing as average programmer productivity, in a given context. By studying programmer teams, we can eventually obtain measures of the expected performance of an average programmer in a defined context. Differences in project productivity can then be attributed to process characteristics. Existing project data is examined to see how data could be collected to support the idea of a standard programmer.
{"title":"On measuring programmer team productivity","authors":"L.F. Johnson","doi":"10.1109/CCECE.1998.685594","DOIUrl":"https://doi.org/10.1109/CCECE.1998.685594","url":null,"abstract":"It is difficult to study industrial programmer productivity because of the extreme variance seen among individual programmers and the difficulty of performing controlled experiments. As an alternative to studying individual programmers, we examine the group productivity of programmer teams. We postulate that there is such a thing as average programmer productivity, in a given context. By studying programmer teams, we can eventually obtain measures of the expected performance of an average programmer in a defined context. Differences in project productivity can then be attributed to process characteristics. Existing project data is examined to see how data could be collected to support the idea of a standard programmer.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121506103","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}
Pub Date : 1998-05-24DOI: 10.1109/CCECE.1998.682735
R. Dansereau, W. Kinsner
This paper explores the quality of successive steps in a wavelet based progressive image transmission, using the Renyi generalized dimension D/sub q/. The Renyi generalized dimension is used to measure the multifractal complexity within an image giving us a tool for evaluating image quality other than the traditional PSNR. We apply this to a wavelet based progressive image transmission scheme through denoising, zerotree coding, and adaptive arithmetic coding to see how D/sub q/ changes as the image is reconstructed.
{"title":"Progressive transmission of images using wavelets: evaluation using the Renyi generalized entropy","authors":"R. Dansereau, W. Kinsner","doi":"10.1109/CCECE.1998.682735","DOIUrl":"https://doi.org/10.1109/CCECE.1998.682735","url":null,"abstract":"This paper explores the quality of successive steps in a wavelet based progressive image transmission, using the Renyi generalized dimension D/sub q/. The Renyi generalized dimension is used to measure the multifractal complexity within an image giving us a tool for evaluating image quality other than the traditional PSNR. We apply this to a wavelet based progressive image transmission scheme through denoising, zerotree coding, and adaptive arithmetic coding to see how D/sub q/ changes as the image is reconstructed.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115735587","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}
Pub Date : 1998-05-24DOI: 10.1109/CCECE.1998.685621
N. Amjady
An adaptive version of the finite element method, FEM, is presented which can discretize the solution region according to calculation errors. The method is applied for the solution of Laplace and Poisson equations arising in static electromagnetic problems. It is shown that the efficiency of the proposed adaptive method is much better than the normal application of the FEM and some other methods.
{"title":"Solution of static electromagnetic problems by an adaptive finite element method","authors":"N. Amjady","doi":"10.1109/CCECE.1998.685621","DOIUrl":"https://doi.org/10.1109/CCECE.1998.685621","url":null,"abstract":"An adaptive version of the finite element method, FEM, is presented which can discretize the solution region according to calculation errors. The method is applied for the solution of Laplace and Poisson equations arising in static electromagnetic problems. It is shown that the efficiency of the proposed adaptive method is much better than the normal application of the FEM and some other methods.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"615 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122697033","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}
Pub Date : 1998-05-24DOI: 10.1109/CCECE.1998.685564
F. Mo, W. Kinsner
This paper presents a new power line fault classification scheme using a probabilistic neural network (PNN). One of the major features of PNN stems from its modular architecture design and can be easily extended to adapt to a changing environment by incremental learning. Another distinguishing advantage of PNN comes from its fast training speed as compared to backpropagation. An explicit confidence measure can also be obtained which directly supports the decision made by the PNN. Preliminary experimental classification results of various AC power system faults and transients indicate that the PNN is suitable for power line fault classification.
{"title":"Probabilistic neural networks for power line fault classification","authors":"F. Mo, W. Kinsner","doi":"10.1109/CCECE.1998.685564","DOIUrl":"https://doi.org/10.1109/CCECE.1998.685564","url":null,"abstract":"This paper presents a new power line fault classification scheme using a probabilistic neural network (PNN). One of the major features of PNN stems from its modular architecture design and can be easily extended to adapt to a changing environment by incremental learning. Another distinguishing advantage of PNN comes from its fast training speed as compared to backpropagation. An explicit confidence measure can also be obtained which directly supports the decision made by the PNN. Preliminary experimental classification results of various AC power system faults and transients indicate that the PNN is suitable for power line fault classification.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130375681","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}
Pub Date : 1998-05-24DOI: 10.1109/CCECE.1998.685609
J. Mouine, A. B. Hamida, Z. Chtourou, N. Lakhoua, M. Samet
This paper describes the implementation of an FFT based stimulation algorithm. This one is used to stimulate properly the auditive nerve of a totally or profoundly deaf person. Unlike other similar algorithms, this one is endowed with a great flexibility to choose basic speech characteristics to be considered or to adapt special stimulation parameters to a specific patient. This was made possible owing to the flexibility of the cochlear prosthesis used.
{"title":"Implementation of an FFT based stimulation algorithm on a fully programmable cochlear prosthesis","authors":"J. Mouine, A. B. Hamida, Z. Chtourou, N. Lakhoua, M. Samet","doi":"10.1109/CCECE.1998.685609","DOIUrl":"https://doi.org/10.1109/CCECE.1998.685609","url":null,"abstract":"This paper describes the implementation of an FFT based stimulation algorithm. This one is used to stimulate properly the auditive nerve of a totally or profoundly deaf person. Unlike other similar algorithms, this one is endowed with a great flexibility to choose basic speech characteristics to be considered or to adapt special stimulation parameters to a specific patient. This was made possible owing to the flexibility of the cochlear prosthesis used.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128823095","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：