Pub Date : 2001-04-02DOI: 10.1109/ITCC.2001.918783
A. Tosun, W. Feng
The paper introduces lightweight video encryption algorithms for transmission over wireless networks. The objective of these encryption algorithms is to reduce the total amount of data encrypted (while providing reasonable privacy and security) and to use multiple FEC codes to reduce the expected number of bit errors left in the data after decoding. The goal of this work is to provide encryption of video data while increasing the decodeability of the stream in the presence of network bit error. The first algorithm uses multi-layer video coding (which also helps to increase PSNR) for security and encrypts only a base layer. The second algorithm extends video encryption algorithms to deduce the amount of data encrypted and uses different BCH codes for each level.
{"title":"Lightweight security mechanisms for wireless video transmission","authors":"A. Tosun, W. Feng","doi":"10.1109/ITCC.2001.918783","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918783","url":null,"abstract":"The paper introduces lightweight video encryption algorithms for transmission over wireless networks. The objective of these encryption algorithms is to reduce the total amount of data encrypted (while providing reasonable privacy and security) and to use multiple FEC codes to reduce the expected number of bit errors left in the data after decoding. The goal of this work is to provide encryption of video data while increasing the decodeability of the stream in the presence of network bit error. The first algorithm uses multi-layer video coding (which also helps to increase PSNR) for security and encrypts only a base layer. The second algorithm extends video encryption algorithms to deduce the amount of data encrypted and uses different BCH codes for each level.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128274879","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 : 2001-04-02DOI: 10.1109/ITCC.2001.918790
R. Radke, V. Zagorodnov, S. Kulkarni, P. Ramadge
This paper addresses several estimation problems involving correspondence in digital video. We present three cases, in order of increasing complexity: affine transformations, projective transformations, and general correspondence. We review some recent research in the first two cases and present a new framework for discussing the third case. We also discuss how to use the formalism of correspondence graphs to ensure that any estimated correspondence is physically valid.
{"title":"Estimating correspondence in digital video","authors":"R. Radke, V. Zagorodnov, S. Kulkarni, P. Ramadge","doi":"10.1109/ITCC.2001.918790","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918790","url":null,"abstract":"This paper addresses several estimation problems involving correspondence in digital video. We present three cases, in order of increasing complexity: affine transformations, projective transformations, and general correspondence. We review some recent research in the first two cases and present a new framework for discussing the third case. We also discuss how to use the formalism of correspondence graphs to ensure that any estimated correspondence is physically valid.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130673124","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 : 2001-04-02DOI: 10.1109/ITCC.2001.918810
A. Dasu, S. Panchanathan
Multimedia processing is becoming increasingly important with a range of applications. Existing approaches for processing multimedia data can be broadly classified into two categories, namely: (i) microprocessors with extended media processing capabilities; and (ii) dedicated implementations (ASICs). The complexity, variety of techniques and tools associated with multimedia processing points to the opportunities for reconfigurable computing devices which will be able to adapt the underlying hardware dynamically in response to changes in the input data or processing environment. The paper proposes a novel approach to design a dynamically reconfigurable processor by performing hardware software co-design for a media processing application. As an example, the analysis of the shape coding module of MPEG-4 is chosen to demonstrate the potential for reconfigurability.
{"title":"Reconfigurable media processing","authors":"A. Dasu, S. Panchanathan","doi":"10.1109/ITCC.2001.918810","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918810","url":null,"abstract":"Multimedia processing is becoming increasingly important with a range of applications. Existing approaches for processing multimedia data can be broadly classified into two categories, namely: (i) microprocessors with extended media processing capabilities; and (ii) dedicated implementations (ASICs). The complexity, variety of techniques and tools associated with multimedia processing points to the opportunities for reconfigurable computing devices which will be able to adapt the underlying hardware dynamically in response to changes in the input data or processing environment. The paper proposes a novel approach to design a dynamically reconfigurable processor by performing hardware software co-design for a media processing application. As an example, the analysis of the shape coding module of MPEG-4 is chosen to demonstrate the potential for reconfigurability.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130732070","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 : 2001-04-02DOI: 10.1109/ITCC.2001.918856
Jinfeng Ni, Xuehai Zhou, Kexiang Wang, Haiyan Xu
Hypermedia applications generate comprehension and orientation problems due to their rich link structure. Adaptive hypermedia tries to alleviate these problems by ensuring that the links and the content of the information pages are adapted to each individual user according to different background. The paper introduces KDAEHS, an Adaptive Education Hypermedia System based on structural computing. The adaptation techniques allow students to choose their own learning goals, get suggestions for suitable study sequence and appropriate course materials. Structural semantic information are extracted from the course context and stored in the form of a knowledge structure graph. An adaptive engine implemented in a Java servlet applies structural computing algorithms to generate adaptive presentation to different individuals. The paper presents the architecture of KDAEHS as well as the system components in detail.
{"title":"KDAEHS: from architecture to system","authors":"Jinfeng Ni, Xuehai Zhou, Kexiang Wang, Haiyan Xu","doi":"10.1109/ITCC.2001.918856","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918856","url":null,"abstract":"Hypermedia applications generate comprehension and orientation problems due to their rich link structure. Adaptive hypermedia tries to alleviate these problems by ensuring that the links and the content of the information pages are adapted to each individual user according to different background. The paper introduces KDAEHS, an Adaptive Education Hypermedia System based on structural computing. The adaptation techniques allow students to choose their own learning goals, get suggestions for suitable study sequence and appropriate course materials. Structural semantic information are extracted from the course context and stored in the form of a knowledge structure graph. An adaptive engine implemented in a Java servlet applies structural computing algorithms to generate adaptive presentation to different individuals. The paper presents the architecture of KDAEHS as well as the system components in detail.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"44 16","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131722622","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 : 2001-04-02DOI: 10.1109/ITCC.2001.918816
Qi Wang, Zixiang Xiong, Feng Wu, Shipeng Li
We examine the enhancement-layer rate allocation problem in progressive fine granularity scalable (PFGS) video coding. The problem arises from the fact that different frames in the enhancement layer have different rates in PFGS coding. A rate-distortion (R-D) function for a multi-frame group is first established for enhancement-layer PFGS coding, followed by experiments to verify its validity using real test sequences. Optimal rate allocation among frames in the group is then given based on the R-D function, together with a simple implementation that is suitable for applications like streaming video. Experiments show that, compared with uniform bit allocation, optimal bit allocation not only makes the quality variation in decoded video much smoother, but also improves the average PSNR of PFGS coding by 0.3-0.5 dB.
{"title":"Optimal rate allocation for progressive fine granularity scalable video coding","authors":"Qi Wang, Zixiang Xiong, Feng Wu, Shipeng Li","doi":"10.1109/ITCC.2001.918816","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918816","url":null,"abstract":"We examine the enhancement-layer rate allocation problem in progressive fine granularity scalable (PFGS) video coding. The problem arises from the fact that different frames in the enhancement layer have different rates in PFGS coding. A rate-distortion (R-D) function for a multi-frame group is first established for enhancement-layer PFGS coding, followed by experiments to verify its validity using real test sequences. Optimal rate allocation among frames in the group is then given based on the R-D function, together with a simple implementation that is suitable for applications like streaming video. Experiments show that, compared with uniform bit allocation, optimal bit allocation not only makes the quality variation in decoded video much smoother, but also improves the average PSNR of PFGS coding by 0.3-0.5 dB.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125532673","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 : 2001-04-02DOI: 10.1109/ITCC.2001.918875
J. Sil, A. Konar
Involvement of multi-agent systems for scheduling and executing a complex task autonomously, is addressed in the paper to solve the navigational problems in robotics. Here, a complex task is broken into a number of subtasks and one to one mapping between subtask and agent is determined from the given relationship among various agents. In a dynamic environment the state-space model of the multi-agent system has been designed using the agents' spatial coordinate positions and sensory data to facilitate performing a task through cooperation. The paper proposes an efficient strategy for collision resolution that may occur at an instant of time, while the robots navigate in the common environment. The distributed agent concept has been adopted in the paper to implement the whole scheme in Java.
{"title":"Building perception for scheduling and executing a task using multi-agent systems","authors":"J. Sil, A. Konar","doi":"10.1109/ITCC.2001.918875","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918875","url":null,"abstract":"Involvement of multi-agent systems for scheduling and executing a complex task autonomously, is addressed in the paper to solve the navigational problems in robotics. Here, a complex task is broken into a number of subtasks and one to one mapping between subtask and agent is determined from the given relationship among various agents. In a dynamic environment the state-space model of the multi-agent system has been designed using the agents' spatial coordinate positions and sensory data to facilitate performing a task through cooperation. The paper proposes an efficient strategy for collision resolution that may occur at an instant of time, while the robots navigate in the common environment. The distributed agent concept has been adopted in the paper to implement the whole scheme in Java.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115179666","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 : 2001-04-02DOI: 10.1109/ITCC.2001.918794
T. Echigo, Ken Masumitsu, M. Teraguchi, M. Etoh, Shun-ichi Sekiguchi
Presents a framework to generate digest video clips from contents managed by meta-data based on MPEG-7, which are personalized by profiles of an individual user. Mobile users request to receive condensed information instantly, so that it is important to generate short video clips from a long image sequence. Unstructured video contents should be therefore managed by standard meta-data. First, we propose a method to assign values that are changed in a time interval of indexes that present the content of the scene. Next, content profiles are estimated so as to generate typical digest video clips to meet similar demands from many users. In conclusion, our approach does not generate completely personalized video for all users, but provides some typical digest video clips for users without well-learned user profiles to enable them to choose their favourite ones, which can be combined in individual requests from users.
{"title":"Personalized delivery of digest video managed on MPEG-7","authors":"T. Echigo, Ken Masumitsu, M. Teraguchi, M. Etoh, Shun-ichi Sekiguchi","doi":"10.1109/ITCC.2001.918794","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918794","url":null,"abstract":"Presents a framework to generate digest video clips from contents managed by meta-data based on MPEG-7, which are personalized by profiles of an individual user. Mobile users request to receive condensed information instantly, so that it is important to generate short video clips from a long image sequence. Unstructured video contents should be therefore managed by standard meta-data. First, we propose a method to assign values that are changed in a time interval of indexes that present the content of the scene. Next, content profiles are estimated so as to generate typical digest video clips to meet similar demands from many users. In conclusion, our approach does not generate completely personalized video for all users, but provides some typical digest video clips for users without well-learned user profiles to enable them to choose their favourite ones, which can be combined in individual requests from users.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122483472","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 : 2001-04-02DOI: 10.1109/ITCC.2001.918808
E. Weippl
Role-based access control is the state-of-the-art mechanism for restricting access to resources. Today, digital content is distributed via CD-ROMs and the Internet with little or no protection. Using widely available public key cryptography, we propose to extend the paradigm of role-based access control to digital content by encapsulating it into secure document containers. Certification authorities can certify that a specific user belongs to a certain group and can thus be granted access to systems (i.e. document containers) that do not know who the user actually is. Online distribution of one-time keys can be used to avoid various attacks like replays.
{"title":"An approach to role-based access control for digital content","authors":"E. Weippl","doi":"10.1109/ITCC.2001.918808","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918808","url":null,"abstract":"Role-based access control is the state-of-the-art mechanism for restricting access to resources. Today, digital content is distributed via CD-ROMs and the Internet with little or no protection. Using widely available public key cryptography, we propose to extend the paradigm of role-based access control to digital content by encapsulating it into secure document containers. Certification authorities can certify that a specific user belongs to a certain group and can thus be granted access to systems (i.e. document containers) that do not know who the user actually is. Online distribution of one-time keys can be used to avoid various attacks like replays.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131126855","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 : 2001-04-02DOI: 10.1109/ITCC.2001.918866
Ulrich Güntzer, Wolf-Tilo Balke, Werner Kießling
Applications like multimedia databases or enterprise-wide information management systems have to meet the challenge of efficiently retrieving the best-matching objects from vast collections of data. We present a new algorithm, called Stream-Combine, for processing multi-feature queries on heterogeneous data sources. Stream-Combine is self-adapting to different data distributions and to the specific kind of the combining function. Furthermore, we present a new retrieval strategy that essentially speeds up the output of relevant objects.
{"title":"Towards efficient multi-feature queries in heterogeneous environments","authors":"Ulrich Güntzer, Wolf-Tilo Balke, Werner Kießling","doi":"10.1109/ITCC.2001.918866","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918866","url":null,"abstract":"Applications like multimedia databases or enterprise-wide information management systems have to meet the challenge of efficiently retrieving the best-matching objects from vast collections of data. We present a new algorithm, called Stream-Combine, for processing multi-feature queries on heterogeneous data sources. Stream-Combine is self-adapting to different data distributions and to the specific kind of the combining function. Furthermore, we present a new retrieval strategy that essentially speeds up the output of relevant objects.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131768458","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 : 2001-04-02DOI: 10.1109/ITCC.2001.918797
H. Kang, K. Kim, Jonguk Choi
Presents an algorithm for watermark insertion and extraction in a vector image. Most parts of the vector image consist of an array of coordinate values. First, the image is partitioned into blocks with the same area, and every vertex coordinate value within a block is changed to a new coordinate value whose origin is at the south-west vertex of the mask belonging to the associated block. The insertion area is different according to the value of the watermark. Unlike the work of M. Sakamoto et al. (2000), we are able to use an arbitrary size for the square mask. The mask of Sukamoto et al.'s work is restrictive since the length of the mask is 2/sup R/-1, where R=1, 2, ..., n. We also show that our method is superior to the previous work against noise attacks.
{"title":"A vector watermarking using the generalized square mask","authors":"H. Kang, K. Kim, Jonguk Choi","doi":"10.1109/ITCC.2001.918797","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918797","url":null,"abstract":"Presents an algorithm for watermark insertion and extraction in a vector image. Most parts of the vector image consist of an array of coordinate values. First, the image is partitioned into blocks with the same area, and every vertex coordinate value within a block is changed to a new coordinate value whose origin is at the south-west vertex of the mask belonging to the associated block. The insertion area is different according to the value of the watermark. Unlike the work of M. Sakamoto et al. (2000), we are able to use an arbitrary size for the square mask. The mask of Sukamoto et al.'s work is restrictive since the length of the mask is 2/sup R/-1, where R=1, 2, ..., n. We also show that our method is superior to the previous work against noise attacks.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134224155","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
扫码关注我们
求助内容：
应助结果提醒方式：