Pub Date : 1998-05-24DOI: 10.1109/CCECE.1998.682734
K. Ishikawa, O. Nakamura
An efficient video coding algorithm for coding the upper half of a human body is proposed. In the coding system, the facial area, which is a moving object in the image sequence, is extracted from both the sending and receiving side without any control information. The candidate areas of the person are segmented using color information and the moving areas. The color information, which represent skin color, is extracted with a modified HSV color system. The moving areas are estimated using the motion parameters of objects, which are utilized for constructing the previous frame. The face is then extracted by merging the candidate areas based on the hue element of the modified HSV color system. The standard "Claire" video is used for the computer simulation, and facial areas are accurately extracted in all frames. Furthermore, to improve the subjective evaluation, the eyes and mouth are extracted as the most important areas in the face and coded precisely.
{"title":"Very low bit-rate video coding based on a method of facial area specification","authors":"K. Ishikawa, O. Nakamura","doi":"10.1109/CCECE.1998.682734","DOIUrl":"https://doi.org/10.1109/CCECE.1998.682734","url":null,"abstract":"An efficient video coding algorithm for coding the upper half of a human body is proposed. In the coding system, the facial area, which is a moving object in the image sequence, is extracted from both the sending and receiving side without any control information. The candidate areas of the person are segmented using color information and the moving areas. The color information, which represent skin color, is extracted with a modified HSV color system. The moving areas are estimated using the motion parameters of objects, which are utilized for constructing the previous frame. The face is then extracted by merging the candidate areas based on the hue element of the modified HSV color system. The standard \"Claire\" video is used for the computer simulation, and facial areas are accurately extracted in all frames. Furthermore, to improve the subjective evaluation, the eyes and mouth are extracted as the most important areas in the face and coded precisely.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"37 4 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":"114285151","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.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.682534
Yuping Ding, Xining Li
The paper presents the cache performance analysis of the Chronological Garbage Collection algorithm used in the LVM system. The LVM is a new Logic Virtual Machine for Prolog. It adopts one stack policy for all dynamic memory requirements and cooperates with an efficient garbage collection algorithm, Chronological Garbage Collection to recuperate space, not as deliberate garbage collection operation but as a natural activity of the LVM engine to gather useful objects. This algorithm takes advantages of the traditional copying, mark-compact, generational, and incremental garbage collection schemes. In order to determine the improvement of cache performance under our garbage collection algorithm, we developed an emulator to do the trace driven cache simulation. Direct mapped cache and set-associative cache with different cache sizes, block sizes and set associativities are simulated and measured. The objectives of this simulation are to verify and validate our experimental results, and to find important factors which influence the performance of the CGC algorithm.
{"title":"Cache performance of chronological garbage collection","authors":"Yuping Ding, Xining Li","doi":"10.1109/CCECE.1998.682534","DOIUrl":"https://doi.org/10.1109/CCECE.1998.682534","url":null,"abstract":"The paper presents the cache performance analysis of the Chronological Garbage Collection algorithm used in the LVM system. The LVM is a new Logic Virtual Machine for Prolog. It adopts one stack policy for all dynamic memory requirements and cooperates with an efficient garbage collection algorithm, Chronological Garbage Collection to recuperate space, not as deliberate garbage collection operation but as a natural activity of the LVM engine to gather useful objects. This algorithm takes advantages of the traditional copying, mark-compact, generational, and incremental garbage collection schemes. In order to determine the improvement of cache performance under our garbage collection algorithm, we developed an emulator to do the trace driven cache simulation. Direct mapped cache and set-associative cache with different cache sizes, block sizes and set associativities are simulated and measured. The objectives of this simulation are to verify and validate our experimental results, and to find important factors which influence the performance of the CGC algorithm.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"292 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":"117333745","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.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.685612
S. Madusuthanan, V. Filipovic-Gledja, N. Fernandopule, S. Panetta, R. Alden
This paper presents the implementation of a Windows-based interface to a program suite to study transient stability. The improvement to the suite involves developing a better user interface and making the suite portable across multiple operating system platforms that use an ANSI C++ compliant compiler. The original program suite was developed in a UNIX version of C with only a console mode interface.
{"title":"A Windows-based interface for power system transient stability studies","authors":"S. Madusuthanan, V. Filipovic-Gledja, N. Fernandopule, S. Panetta, R. Alden","doi":"10.1109/CCECE.1998.685612","DOIUrl":"https://doi.org/10.1109/CCECE.1998.685612","url":null,"abstract":"This paper presents the implementation of a Windows-based interface to a program suite to study transient stability. The improvement to the suite involves developing a better user interface and making the suite portable across multiple operating system platforms that use an ANSI C++ compliant compiler. The original program suite was developed in a UNIX version of C with only a console mode interface.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"57 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":"121742213","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.685615
N. Chowdhury, B. Zhou
Total blackouts, though rare in a modern power system, could cause huge direct and indirect financial losses. Power system operators should be trained to restore their system from a total or a partial blackout condition in a relatively short period of time. A case-based reasoning approach has been utilized to develop a training simulator for the SaskPower network. System operators can use the simulator in an interactive manner to simulate a restoration process. The simulator can guide system operators through the steps of a restoration process and displays the outcome(s) of a restoration action in terms of system states. The interaction between the simulator and an operator has been achieved through an object-oriented graphical interface.
{"title":"An intelligent training agent for power system restoration","authors":"N. Chowdhury, B. Zhou","doi":"10.1109/CCECE.1998.685615","DOIUrl":"https://doi.org/10.1109/CCECE.1998.685615","url":null,"abstract":"Total blackouts, though rare in a modern power system, could cause huge direct and indirect financial losses. Power system operators should be trained to restore their system from a total or a partial blackout condition in a relatively short period of time. A case-based reasoning approach has been utilized to develop a training simulator for the SaskPower network. System operators can use the simulator in an interactive manner to simulate a restoration process. The simulator can guide system operators through the steps of a restoration process and displays the outcome(s) of a restoration action in terms of system states. The interaction between the simulator and an operator has been achieved through an object-oriented graphical interface.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"38 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":"126067160","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.685631
G. Gilbert, D. Bouchard, A. Chikhani
The state of a power system and the methods of calculating this state are extremely important in evaluating the operation of the power system, the control of this system, and the determination of future expansion for the power system. The state of the power system is determined through load flow analysis that calculates the power flowing in the lines of the system. There are several different methods to determine the load flow of a given system. For the purposes of this paper, only three methods of load flow algorithms are evaluated: Gauss-Seidel, optimal load flow, and the DistFlow method.
{"title":"A comparison of load flow analysis using DistFlow, Gauss-Seidel, and optimal load flow algorithms","authors":"G. Gilbert, D. Bouchard, A. Chikhani","doi":"10.1109/CCECE.1998.685631","DOIUrl":"https://doi.org/10.1109/CCECE.1998.685631","url":null,"abstract":"The state of a power system and the methods of calculating this state are extremely important in evaluating the operation of the power system, the control of this system, and the determination of future expansion for the power system. The state of the power system is determined through load flow analysis that calculates the power flowing in the lines of the system. There are several different methods to determine the load flow of a given system. For the purposes of this paper, only three methods of load flow algorithms are evaluated: Gauss-Seidel, optimal load flow, and the DistFlow method.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"11 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":"131502102","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
扫码关注我们
求助内容：
应助结果提醒方式：