Pub Date : 2000-03-27DOI: 10.1109/ITCC.2000.844207
S. Encheva, G. Cohen
If C is a p-ary code of length n and a/sup (1)/ and a/sup (2)/ are two codewords, then a/sup (3)/ is called a descendant of a/sup (1)/ and a/sup (2)/ if a/sub i//sup (3)//spl isin/{a/sub i//sup (1)/, a/sub i//sup (2)/} for i=1,..., n. We are interested in codes C with the property that if a/sup (1)/, a/sup (2)//spl isin/C then a/sup (3)/ is not a codeword in C. This way a coalition of 2 users a/sup (1)/ and a/sup (2)/ cannot frame a 3rd user a/sub i//sup (3)/. Intersecting codes over GF(p) with the above mentioned property are found.
{"title":"Tracing and proving ownership of digital objects","authors":"S. Encheva, G. Cohen","doi":"10.1109/ITCC.2000.844207","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844207","url":null,"abstract":"If C is a p-ary code of length n and a/sup (1)/ and a/sup (2)/ are two codewords, then a/sup (3)/ is called a descendant of a/sup (1)/ and a/sup (2)/ if a/sub i//sup (3)//spl isin/{a/sub i//sup (1)/, a/sub i//sup (2)/} for i=1,..., n. We are interested in codes C with the property that if a/sup (1)/, a/sup (2)//spl isin/C then a/sup (3)/ is not a codeword in C. This way a coalition of 2 users a/sup (1)/ and a/sup (2)/ cannot frame a 3rd user a/sub i//sup (3)/. Intersecting codes over GF(p) with the above mentioned property are found.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125866443","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 : 2000-03-27DOI: 10.1109/ITCC.2000.844180
Chun-hung Li, P. Yuen, P. Tam
In this paper, the problem of edge preserving smoothing in image processing is tackled by combining a noise corruption model and a region and edge image model. The derivation of the probability model for the first order difference in the gray levels of the region pixels and edge pixels leads to a non-linear filter with coefficients as functions of the estimated noise variance and edge intensity. Such a model-based approach allows the design of improved filters for noise filtering and image compression. Experimental results demonstrate the improved performance of the filter for both synthetic and natural images.
{"title":"A probabilistic image model for smoothing and compression","authors":"Chun-hung Li, P. Yuen, P. Tam","doi":"10.1109/ITCC.2000.844180","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844180","url":null,"abstract":"In this paper, the problem of edge preserving smoothing in image processing is tackled by combining a noise corruption model and a region and edge image model. The derivation of the probability model for the first order difference in the gray levels of the region pixels and edge pixels leads to a non-linear filter with coefficients as functions of the estimated noise variance and edge intensity. Such a model-based approach allows the design of improved filters for noise filtering and image compression. Experimental results demonstrate the improved performance of the filter for both synthetic and natural images.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125294462","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 : 2000-03-27DOI: 10.1109/ITCC.2000.844282
H. K. Wong, A. Fong
This paper describes a methodology and development approach to implement an object relational database management system (ORDBMS) with the frame model (Fong, 1997). The frame model method is a solution to extend relational database management systems (RDBMS) to handle complex data such as objects. Objects can be represented in a frame model schema as classes, constraints and methods. Schema translation is the first step to implement the object-relational database management system (ORDBMS). This paper investigates a stepwise methodology for schema translation from a relational model to a frame model. The second step is the implementation of ORDBMS to incorporate RDBMS as a kernel, application program interface (API) as interactive SQL and a method command interpreter. Methods are pre-compiled and stored in RDBMS as stored procedures. Methods can be invoked directly through API or a constraint class that is defined in the frame model schema when the associated interactive SQL is issued from the API.
{"title":"Object-relational database management system (ORDBMS) using frame model approach","authors":"H. K. Wong, A. Fong","doi":"10.1109/ITCC.2000.844282","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844282","url":null,"abstract":"This paper describes a methodology and development approach to implement an object relational database management system (ORDBMS) with the frame model (Fong, 1997). The frame model method is a solution to extend relational database management systems (RDBMS) to handle complex data such as objects. Objects can be represented in a frame model schema as classes, constraints and methods. Schema translation is the first step to implement the object-relational database management system (ORDBMS). This paper investigates a stepwise methodology for schema translation from a relational model to a frame model. The second step is the implementation of ORDBMS to incorporate RDBMS as a kernel, application program interface (API) as interactive SQL and a method command interpreter. Methods are pre-compiled and stored in RDBMS as stored procedures. Methods can be invoked directly through API or a constraint class that is defined in the frame model schema when the associated interactive SQL is issued from the API.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114194722","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 : 2000-03-27DOI: 10.1109/ITCC.2000.844246
Daniel Puka, M. Penna, Vinicius Prodocimo
The contractual relation between customers and telecommunications service providers are becoming increasingly complex, due largely to changes in the marketplace and growth in the number and complexity of services on offer. In order to guarantee a certain quality of offered service and in response to customer needs, some mechanisms of service level management must be applied. The service level management in telecommunication networks is made by a agreement, established during the service subscription, which is used by customers and service providers to control the service level. This paper introduces a service level management system for ATM networks, which can be applied to different telecommunication systems.
{"title":"Service level management in ATM networks","authors":"Daniel Puka, M. Penna, Vinicius Prodocimo","doi":"10.1109/ITCC.2000.844246","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844246","url":null,"abstract":"The contractual relation between customers and telecommunications service providers are becoming increasingly complex, due largely to changes in the marketplace and growth in the number and complexity of services on offer. In order to guarantee a certain quality of offered service and in response to customer needs, some mechanisms of service level management must be applied. The service level management in telecommunication networks is made by a agreement, established during the service subscription, which is used by customers and service providers to control the service level. This paper introduces a service level management system for ATM networks, which can be applied to different telecommunication systems.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"258 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116191021","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 : 2000-03-27DOI: 10.1109/ITCC.2000.844203
J. Fridrich
Digital watermarks have been proposed for authentication of both video data and still images and for integrity verification of visual multimedia. In such applications, the watermark has to depend on a secret key and on the original image. It is important that the dependence on the key be sensitive, while the dependence on the image be continuous (robust). Both requirements can be satisfied using special image digest functions that return the same bit-string for a whole class of images derived from an original image using common processing operations. It is further required that two completely different images produce completely different bit-strings. We discuss methods how such robust hash functions can be built. We also show how the hash bits has another application, the robust image digest can be used as a search index for an efficient image database search.
{"title":"Robust hash functions for digital watermarking","authors":"J. Fridrich","doi":"10.1109/ITCC.2000.844203","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844203","url":null,"abstract":"Digital watermarks have been proposed for authentication of both video data and still images and for integrity verification of visual multimedia. In such applications, the watermark has to depend on a secret key and on the original image. It is important that the dependence on the key be sensitive, while the dependence on the image be continuous (robust). Both requirements can be satisfied using special image digest functions that return the same bit-string for a whole class of images derived from an original image using common processing operations. It is further required that two completely different images produce completely different bit-strings. We discuss methods how such robust hash functions can be built. We also show how the hash bits has another application, the robust image digest can be used as a search index for an efficient image database search.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114739112","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 : 2000-03-27DOI: 10.1109/ITCC.2000.844188
A. Papasakellariou
The paper gives an overview of interference cancellation (IC) methods, in terms of implementation and performance, for third generation CDMA communications systems. The signal processing of each method is outlined and the advantages and challenges are discussed. An exemplary IC application at the mobile receiver and its performance are presented for the WCDMA system setup.
{"title":"Overview of interference cancellation for CDMA wireless systems","authors":"A. Papasakellariou","doi":"10.1109/ITCC.2000.844188","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844188","url":null,"abstract":"The paper gives an overview of interference cancellation (IC) methods, in terms of implementation and performance, for third generation CDMA communications systems. The signal processing of each method is outlined and the advantages and challenges are discussed. An exemplary IC application at the mobile receiver and its performance are presented for the WCDMA system setup.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126274120","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 : 2000-03-27DOI: 10.1109/ITCC.2000.844204
L. Cong, S. Asghar, Bin Cong
This paper proposes a robust, speaker-independent isolated word speech recognition (IWSR) system (SMQ/HMM-SVQ/HMM)/MLP which combines dual split matrix quantization (SMQ) and split vector quantization (SVQ) pair combined with both the strength of the HMM in modeling stochastic sequences and the non-linear classification capability of MLP neural networks (NN). The system efficiently utilizes processing resources and improves speech recognition performance by using neural networks as the classifier of the system. Computer simulation clearly indicates the superiority over conventional VQ/HMM and MQ/HMM systems with 98% and 95.8% recognition accuracy at 20 dB and 5 dB SNR levels, respectively in a car noise environment, based on the TIDIGIT database.
{"title":"Robust speech recognition using neural networks and hidden Markov models","authors":"L. Cong, S. Asghar, Bin Cong","doi":"10.1109/ITCC.2000.844204","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844204","url":null,"abstract":"This paper proposes a robust, speaker-independent isolated word speech recognition (IWSR) system (SMQ/HMM-SVQ/HMM)/MLP which combines dual split matrix quantization (SMQ) and split vector quantization (SVQ) pair combined with both the strength of the HMM in modeling stochastic sequences and the non-linear classification capability of MLP neural networks (NN). The system efficiently utilizes processing resources and improves speech recognition performance by using neural networks as the classifier of the system. Computer simulation clearly indicates the superiority over conventional VQ/HMM and MQ/HMM systems with 98% and 95.8% recognition accuracy at 20 dB and 5 dB SNR levels, respectively in a car noise environment, based on the TIDIGIT database.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115892717","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 : 2000-03-27DOI: 10.1109/ITCC.2000.844182
Jiangfeng Ding, Jon C. Furgeson, E. Sha
Image compression has been an important research topic for many years. There are many kinds of compression techniques, but most of these do not fully take advantage of the characteristics of a target application. An example is virtual conferencing, one of the most popular applications in multimedia, which demands a huge network bandwidth. The paper presents an application-specific image compression technique focusing on virtual conferencing. The paper proposes a compression technique that compresses the image background and foreground (the face part) with different compression qualities. Compared to standard JPEG compression, our algorithms may reduce half of the image file size with a reasonably clear quality of background. This paper discusses how to divide an image into a background part and a foreground part automatically, and how to design and compare several different algorithms for compressing these two parts with different quality.
{"title":"Application specific image compression for virtual conferencing","authors":"Jiangfeng Ding, Jon C. Furgeson, E. Sha","doi":"10.1109/ITCC.2000.844182","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844182","url":null,"abstract":"Image compression has been an important research topic for many years. There are many kinds of compression techniques, but most of these do not fully take advantage of the characteristics of a target application. An example is virtual conferencing, one of the most popular applications in multimedia, which demands a huge network bandwidth. The paper presents an application-specific image compression technique focusing on virtual conferencing. The paper proposes a compression technique that compresses the image background and foreground (the face part) with different compression qualities. Compared to standard JPEG compression, our algorithms may reduce half of the image file size with a reasonably clear quality of background. This paper discusses how to divide an image into a background part and a foreground part automatically, and how to design and compare several different algorithms for compressing these two parts with different quality.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115612287","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 : 2000-03-27DOI: 10.1109/ITCC.2000.844265
H. Shah-Hosseini, R. Safabakhsh
The time-decreasing learning rate and neighborhood function of the basic SOM (self-organizing map) algorithm reduce its capability to adapt weights for a varied environment. In dealing with non-stationary input distributions and changing environments, we propose a modified SOM algorithm called "time adaptive SOM", or TASOM, that automatically adjusts the learning rate and neighborhood size of each neuron independently. The proposed TASOM is tested with stationary environments and its performance is compared with that of the basic SOM. It is also tested with non-stationary environments for representing the letter 'L', which may be translated, rotated, or scaled. Moreover, the TASOM is used for adaptive segmentation of images which may have undergone gray-level transformation.
{"title":"TASOM: the time adaptive self-organizing map","authors":"H. Shah-Hosseini, R. Safabakhsh","doi":"10.1109/ITCC.2000.844265","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844265","url":null,"abstract":"The time-decreasing learning rate and neighborhood function of the basic SOM (self-organizing map) algorithm reduce its capability to adapt weights for a varied environment. In dealing with non-stationary input distributions and changing environments, we propose a modified SOM algorithm called \"time adaptive SOM\", or TASOM, that automatically adjusts the learning rate and neighborhood size of each neuron independently. The proposed TASOM is tested with stationary environments and its performance is compared with that of the basic SOM. It is also tested with non-stationary environments for representing the letter 'L', which may be translated, rotated, or scaled. Moreover, the TASOM is used for adaptive segmentation of images which may have undergone gray-level transformation.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115711103","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 : 2000-03-27DOI: 10.1109/ITCC.2000.844200
Stephan Wong, S. Cotofana, S. Vassiliadis
This paper proposes an extension to general-purpose architectures to improve the performance of multimedia operations. More specifically, we consider the multimedia JPEG/MPEG standards and investigate the possibility to accelerate the Huffman encoding operation which is a known performance limiting function found in these standards. Our investigation suggests that it is possible to decrease the total number of execution cycles by 9% to 12% when the proposed unit is implemented as an extension to existing general-purpose hardware. This new extension is intended to be an integral part of a multimedia functional unit (MFU) that performs specific multimedia operations in a time efficient manner.
{"title":"General-purpose processor Huffman encoding extension","authors":"Stephan Wong, S. Cotofana, S. Vassiliadis","doi":"10.1109/ITCC.2000.844200","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844200","url":null,"abstract":"This paper proposes an extension to general-purpose architectures to improve the performance of multimedia operations. More specifically, we consider the multimedia JPEG/MPEG standards and investigate the possibility to accelerate the Huffman encoding operation which is a known performance limiting function found in these standards. Our investigation suggests that it is possible to decrease the total number of execution cycles by 9% to 12% when the proposed unit is implemented as an extension to existing general-purpose hardware. This new extension is intended to be an integral part of a multimedia functional unit (MFU) that performs specific multimedia operations in a time efficient manner.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114559799","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
扫码关注我们
求助内容：
应助结果提醒方式：