Pub Date : 2010-12-01DOI: 10.1109/PIC.2010.5687596
Yun Liu, Kai Liu, Li Fu
Cooperative communication is proved to effectively mitigate fading, achieve high spectrum efficiency and improve transmission capacity for wireless networks by means of spatial diversity. Recently increasing work is extended to cooperative medium access control (MAC) protocol design. A relay preselection and contention-based cooperative MAC (RPCB-CMAC) protocol is proposed to alleviate the negative effect of low rate nodes which take more time to transmit the same data than high rate nodes. In the protocol, the sender preselects two candidate relays through its local relay-information table, and sets different priorities to these two candidate relays by relay utility which reflects how much time can be saved per packet. After the handshake between the sender and the receiver, two candidate relays can obtain rate information among the sender, the receiver and themselves to judge whether they can provide cooperation gain. If they can, then they contend to become the final relay based on their priorities. Simulation results show that compared to basic RTS/CTS scheme and CoopMAC, the proposed protocol can improve the network performance.
{"title":"A relay preselection and contention-based cooperative MAC for wireless networks","authors":"Yun Liu, Kai Liu, Li Fu","doi":"10.1109/PIC.2010.5687596","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687596","url":null,"abstract":"Cooperative communication is proved to effectively mitigate fading, achieve high spectrum efficiency and improve transmission capacity for wireless networks by means of spatial diversity. Recently increasing work is extended to cooperative medium access control (MAC) protocol design. A relay preselection and contention-based cooperative MAC (RPCB-CMAC) protocol is proposed to alleviate the negative effect of low rate nodes which take more time to transmit the same data than high rate nodes. In the protocol, the sender preselects two candidate relays through its local relay-information table, and sets different priorities to these two candidate relays by relay utility which reflects how much time can be saved per packet. After the handshake between the sender and the receiver, two candidate relays can obtain rate information among the sender, the receiver and themselves to judge whether they can provide cooperation gain. If they can, then they contend to become the final relay based on their priorities. Simulation results show that compared to basic RTS/CTS scheme and CoopMAC, the proposed protocol can improve the network performance.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115599259","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 : 2010-12-01DOI: 10.1109/PIC.2010.5687598
Chunlin Song, S. Sudirman, M. Merabti
Improving the robustness of watermark in withstanding attacks has been one of the main research objectives in digital image watermarking. In this paper we propose a novel region-adaptive watermarking technique that can provide improvements in both robustness and visual quality of the watermarks when compared to the original, non-region-adaptive, embedding technique. The proposed technique, which is derived from our previously published research finding, shows that the relative difference in spectral distributions between the watermark data and the host image plays an important role in improving the watermark robustness and transparency.
{"title":"Robust digital image watermarking using region adaptive embedding technique","authors":"Chunlin Song, S. Sudirman, M. Merabti","doi":"10.1109/PIC.2010.5687598","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687598","url":null,"abstract":"Improving the robustness of watermark in withstanding attacks has been one of the main research objectives in digital image watermarking. In this paper we propose a novel region-adaptive watermarking technique that can provide improvements in both robustness and visual quality of the watermarks when compared to the original, non-region-adaptive, embedding technique. The proposed technique, which is derived from our previously published research finding, shows that the relative difference in spectral distributions between the watermark data and the host image plays an important role in improving the watermark robustness and transparency.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117261375","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 : 2010-12-01DOI: 10.1109/PIC.2010.5687595
Huameng Zhou, Xiaomei Fu, Jinhua Miao
A new kind of encoding as well as a linear differential decoding method is proposed in this article. A new model built in the TWRC (two-way relay channels) is presented, which involves partial response coding at the source and two different kinds of differential coding(the add-differential coding and the multiple-differential coding) at the relay. This article puts forward the demonstration of the linear differential decoding. In the decoding process, this new method can be used in both kinds of differential coding. It can be seen this method simplifies the decoding process and has its commonality.
{"title":"Partial response differential network coding in two-way relay channels","authors":"Huameng Zhou, Xiaomei Fu, Jinhua Miao","doi":"10.1109/PIC.2010.5687595","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687595","url":null,"abstract":"A new kind of encoding as well as a linear differential decoding method is proposed in this article. A new model built in the TWRC (two-way relay channels) is presented, which involves partial response coding at the source and two different kinds of differential coding(the add-differential coding and the multiple-differential coding) at the relay. This article puts forward the demonstration of the linear differential decoding. In the decoding process, this new method can be used in both kinds of differential coding. It can be seen this method simplifies the decoding process and has its commonality.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127539510","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 : 2010-12-01DOI: 10.1109/PIC.2010.5687860
Francisco Ortin, Miguel García
Although static typing provides early type error detection, better legibility and abstraction, and more opportunities for compiler optimizations, dynamic typing supplies a high degree of runtime adaptiveness, providing an agile and interactive development suitable for rapid prototyping. In this article, the minimal core type system of a programming language which main aim is to provide the benefits of both dynamic and static typing is presented. Keeping explicit typing, implicit type inference is introduced to combine dynamic and static typing in the same programming language. Union and intersection types are customized to express the dynamism of implicitly typed references. The main benefits of our work are an early type error detection in dynamic code, the integration of dynamic and static code in the same programming language, and a notable optimization of the generated code.
{"title":"Supporting dynamic and static typing by means of union and intersection types","authors":"Francisco Ortin, Miguel García","doi":"10.1109/PIC.2010.5687860","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687860","url":null,"abstract":"Although static typing provides early type error detection, better legibility and abstraction, and more opportunities for compiler optimizations, dynamic typing supplies a high degree of runtime adaptiveness, providing an agile and interactive development suitable for rapid prototyping. In this article, the minimal core type system of a programming language which main aim is to provide the benefits of both dynamic and static typing is presented. Keeping explicit typing, implicit type inference is introduced to combine dynamic and static typing in the same programming language. Union and intersection types are customized to express the dynamism of implicitly typed references. The main benefits of our work are an early type error detection in dynamic code, the integration of dynamic and static code in the same programming language, and a notable optimization of the generated code.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124824842","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 : 2010-12-01DOI: 10.1109/PIC.2010.5687927
Shi-feng Zhao, Zhongke Wu, Mingquan Zhou
Segmentation is one of the most challenging problems in the field of medical image analysis, and blood vessels are especially difficult to extract. In this paper, we propose a novel method for segmentation of cerebral blood vessels from magnetic resonance angiography (MRA) images based on Frangi's vesselness measure and ball B-Spline. First, we apply Frangi's vesselness measure to find putative centerlines of tubular structures along with their estimated radii. Then the ball B-Spline method is adopted to construct the 3D vascular trees. Results on head MRA datasets demonstrate the availability of the method.
{"title":"A multi-scale method for extraction of cerebral blood vessles","authors":"Shi-feng Zhao, Zhongke Wu, Mingquan Zhou","doi":"10.1109/PIC.2010.5687927","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687927","url":null,"abstract":"Segmentation is one of the most challenging problems in the field of medical image analysis, and blood vessels are especially difficult to extract. In this paper, we propose a novel method for segmentation of cerebral blood vessels from magnetic resonance angiography (MRA) images based on Frangi's vesselness measure and ball B-Spline. First, we apply Frangi's vesselness measure to find putative centerlines of tubular structures along with their estimated radii. Then the ball B-Spline method is adopted to construct the 3D vascular trees. Results on head MRA datasets demonstrate the availability of the method.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125868992","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 : 2010-12-01DOI: 10.1109/PIC.2010.5687937
Yanfang Wang, Bo Han
Red-eye artifact is induced by the light reflected off retinal capillaries when photos are taken under weak light using flash. An automatic method is proposed to remove red-eye artifacts in digital images in this paper. First, a face detector based on histograms of oriented gradients (HOG) features and Real Adaboost algorithm is employed to select faces, and eye-boxes which contain one eye in each of them are obtained from the detected faces. Next, a mask which records candidates for red-eye is calculated by two segmentation criteria computing over each eye-box. Afterwards, the candidate mask is processed by morphological filters and several heuristic exclusive principles to locate the target red-eye region. At last, the red-eye defect is compensated by an adaptive correction technique. The proposed method is efficient and effective when tested on real images taken by different digital cameras.
{"title":"A novel red-eye removal approach in digital color photos","authors":"Yanfang Wang, Bo Han","doi":"10.1109/PIC.2010.5687937","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687937","url":null,"abstract":"Red-eye artifact is induced by the light reflected off retinal capillaries when photos are taken under weak light using flash. An automatic method is proposed to remove red-eye artifacts in digital images in this paper. First, a face detector based on histograms of oriented gradients (HOG) features and Real Adaboost algorithm is employed to select faces, and eye-boxes which contain one eye in each of them are obtained from the detected faces. Next, a mask which records candidates for red-eye is calculated by two segmentation criteria computing over each eye-box. Afterwards, the candidate mask is processed by morphological filters and several heuristic exclusive principles to locate the target red-eye region. At last, the red-eye defect is compensated by an adaptive correction technique. The proposed method is efficient and effective when tested on real images taken by different digital cameras.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126722292","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 : 2010-12-01DOI: 10.1109/PIC.2010.5687431
Zhonghai Yu
Digital design of mechanical products depends much on reuse of existing design knowledge. An ontology based knowledge management approach and reuse method towards digital design process was proposed in this paper. According to the characteristics of digital design process of mechanical products and the characteristics of knowledge reuse during them, the generic technology of the design knowledge management was discussed. The digital design tasks are classified into two basic types in the approach: structure design and parametric design. The relations between the design task and its linkage knowledge (design cases, design rules, design criteria, and handbooks) are represented in the ontology model. Through finding the linkage knowledge according to the current scenario of design phase, the relevant knowledge items would thus be effectively located and retrieved. A case of the digital design process of a thread rolling board illustrates the proposed approach.
{"title":"Ontology based knowledge management and reuse approach in digital design","authors":"Zhonghai Yu","doi":"10.1109/PIC.2010.5687431","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687431","url":null,"abstract":"Digital design of mechanical products depends much on reuse of existing design knowledge. An ontology based knowledge management approach and reuse method towards digital design process was proposed in this paper. According to the characteristics of digital design process of mechanical products and the characteristics of knowledge reuse during them, the generic technology of the design knowledge management was discussed. The digital design tasks are classified into two basic types in the approach: structure design and parametric design. The relations between the design task and its linkage knowledge (design cases, design rules, design criteria, and handbooks) are represented in the ontology model. Through finding the linkage knowledge according to the current scenario of design phase, the relevant knowledge items would thus be effectively located and retrieved. A case of the digital design process of a thread rolling board illustrates the proposed approach.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126742743","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 : 2010-12-01DOI: 10.1109/PIC.2010.5687430
Pengjun Wang, Fanglong Yi, Xiaofang Zhou
Based on layered decoding and semi-parallel structure, a novel architecture of multi-rate QC-LDPC decoder is proposed in this paper. It can support any code rates without any changes in hardware to achieve higher hardware utilization. The update of current layer and the comparison of next layer are processed simultaneously to improve the throughput. The check-to-variable messages are stored indirectly to reduce the storage space. Based on the proposed architecture, a QC-LDPC decoder of 2304 bits and 6-encodings style is presented. Then ModelSim SE6.0 simulation results verify that the proposed decoder is correct and effective. Finally, the decoder is synthesized by Synopsys Design Compiler on SMIC 0.18 µm CMOS technology, and the maximum throughput can achieve 318 Mbps at 145 MHz and 15 iterations.
{"title":"Design of a novel multi-rate QC-LDPC decoder","authors":"Pengjun Wang, Fanglong Yi, Xiaofang Zhou","doi":"10.1109/PIC.2010.5687430","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687430","url":null,"abstract":"Based on layered decoding and semi-parallel structure, a novel architecture of multi-rate QC-LDPC decoder is proposed in this paper. It can support any code rates without any changes in hardware to achieve higher hardware utilization. The update of current layer and the comparison of next layer are processed simultaneously to improve the throughput. The check-to-variable messages are stored indirectly to reduce the storage space. Based on the proposed architecture, a QC-LDPC decoder of 2304 bits and 6-encodings style is presented. Then ModelSim SE6.0 simulation results verify that the proposed decoder is correct and effective. Finally, the decoder is synthesized by Synopsys Design Compiler on SMIC 0.18 µm CMOS technology, and the maximum throughput can achieve 318 Mbps at 145 MHz and 15 iterations.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115172511","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 : 2010-12-01DOI: 10.1109/PIC.2010.5688019
Xuli Han, Y. Ren, Xinru Liu
In order to adjust effectively the shape of the tensor product Bézier surfaces and to connect conveniently the surface patches, generalized tensor product Bézier surfaces with local directional control derivative vectors are given in this paper. The given surface expression is a modification based on a kind of higher approximate polynomials of a function. Taking the tensor Bézier surfaces as a special case, the given surface is an effective modification for the Bézier surface of higher degree by adjusting the directional target derivative vectors. A method for connecting surface patches on rectangle domain is presented; it can be used to realize C1 continuous connection of two surface patches without any constraint conditions for the control grid points.
{"title":"Generalized tensor product Bézier surfaces","authors":"Xuli Han, Y. Ren, Xinru Liu","doi":"10.1109/PIC.2010.5688019","DOIUrl":"https://doi.org/10.1109/PIC.2010.5688019","url":null,"abstract":"In order to adjust effectively the shape of the tensor product Bézier surfaces and to connect conveniently the surface patches, generalized tensor product Bézier surfaces with local directional control derivative vectors are given in this paper. The given surface expression is a modification based on a kind of higher approximate polynomials of a function. Taking the tensor Bézier surfaces as a special case, the given surface is an effective modification for the Bézier surface of higher degree by adjusting the directional target derivative vectors. A method for connecting surface patches on rectangle domain is presented; it can be used to realize C1 continuous connection of two surface patches without any constraint conditions for the control grid points.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116584701","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 : 2010-12-01DOI: 10.1109/PIC.2010.5687925
Ling-Hao Huang, Yanliang Shang
Modeling technology is the key to the advancement of road & bridge construction problem solving technology. In light of the existing defects of problem-solving modeling technology, a new function graphic modeling technology which can reflect problem solving characteristics is proposed. Based on function graphic object which has engineering properties of length-variable and unstructured, and can exist independently and work cooperatively with each other, a group of function graphic objects are used to emulate planed road & bridge construction sub-problem, and solving process is carried out interactively and dynamically by creating, operating, and deducing function graphic objects. Through the proposed function graphic modeling technology, the traditional modeling method and realization model of road & bridge construction problem solving are broken through, and a new modeling and realization technology system which is suitable for solving characteristics of road & bridge construction problem is set up.
{"title":"Function graphic modeling technology and its application in road & bridge construction","authors":"Ling-Hao Huang, Yanliang Shang","doi":"10.1109/PIC.2010.5687925","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687925","url":null,"abstract":"Modeling technology is the key to the advancement of road & bridge construction problem solving technology. In light of the existing defects of problem-solving modeling technology, a new function graphic modeling technology which can reflect problem solving characteristics is proposed. Based on function graphic object which has engineering properties of length-variable and unstructured, and can exist independently and work cooperatively with each other, a group of function graphic objects are used to emulate planed road & bridge construction sub-problem, and solving process is carried out interactively and dynamically by creating, operating, and deducing function graphic objects. Through the proposed function graphic modeling technology, the traditional modeling method and realization model of road & bridge construction problem solving are broken through, and a new modeling and realization technology system which is suitable for solving characteristics of road & bridge construction problem is set up.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122812446","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
扫码关注我们
求助内容：
应助结果提醒方式：