发布求助
文献互助 智能选刊 最新文献

Image Processing & Communications最新文献

筛选
英文 中文
The Impact of Selected Parameters on the Performance of Routing Protocols in Wireless Sensor Networks 无线传感器网络中选定参数对路由协议性能的影响
Image Processing & Communications Pub Date : 2017-03-01 DOI: 10.1515/ipc-2017-0006
M. Piechowiak, P. Zwierzykowski, P. Kotlarz, P. Żmudziński
{"title":"The Impact of Selected Parameters on the Performance of Routing Protocols in Wireless Sensor Networks","authors":"M. Piechowiak, P. Zwierzykowski, P. Kotlarz, P. Żmudziński","doi":"10.1515/ipc-2017-0006","DOIUrl":"https://doi.org/10.1515/ipc-2017-0006","url":null,"abstract":"Abstract The aim of the article was to compare the effectiveness of the selected routing protocols for wireless sensor networks taking into account a number of specific parameters as network troughput, packet error rate and message buffer capacity for different network topologies. The simulation research was conducted in open source OMNeT++ environment. In order to achieve the assumed requirements, four different-sized network topologies were established and AODV and DYMO routing protocols were adapted.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130209849","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}
引用次数: 1
Multi Criterion Multicast Routing Algorithm Comparison for Large Networks 大型网络多准则组播路由算法比较
Image Processing & Communications Pub Date : 2017-03-01 DOI: 10.1515/ipc-2017-0005
Krzysztof Stachowiak
{"title":"Multi Criterion Multicast Routing Algorithm Comparison for Large Networks","authors":"Krzysztof Stachowiak","doi":"10.1515/ipc-2017-0005","DOIUrl":"https://doi.org/10.1515/ipc-2017-0005","url":null,"abstract":"Abstract QoS enabled multicast routing is known to be of non-polynominal complexity, which leads to the necessity of using heuristic algorithms to find sub-optimal solutions to the problems of this class. The evaluation of such algorithms requires the use of the simulation techniques as the heuristics’ results are of stochastic nature. Because of the problem complexity the simulation times increase significantly in the function of the network size, therefore the results presented in the literature are often limited to only small models. In this article the results of the evaluation of different multicast QoS routing algorithms (further referred to as the Multi-Constrained Minimum Steiner Tree Problem - MCMST) have been presented for a wide range of network sizes reaching thousands of nodes.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122829555","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}
引用次数: 0
Proposal of a New Structure for Netfpga Cards 一种新的Netfpga卡结构的建议
Image Processing & Communications Pub Date : 2017-03-01 DOI: 10.1515/ipc-2017-0003
M. Michalski, Tytus Sielach
{"title":"Proposal of a New Structure for Netfpga Cards","authors":"M. Michalski, Tytus Sielach","doi":"10.1515/ipc-2017-0003","DOIUrl":"https://doi.org/10.1515/ipc-2017-0003","url":null,"abstract":"Abstract In this paper, we present a proposal of a new internal structure for NetFPGA cards and its analysis. We propose to use a switching fabric instead of a single pipeline. Such a change complicates some modules and connects several of them into a single, more complicated module. Their functionality is the same, but the delay of the served Ethernet frame will be decreased.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127299148","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}
引用次数: 0
Spectrum Fragmentation-Aware Strategies for Deadline-Driven Dynamic Multicast Scheduling Problem in EON EON中限期驱动动态组播调度问题的频谱碎片感知策略
Image Processing & Communications Pub Date : 2017-03-01 DOI: 10.1515/ipc-2017-0001
M. Markowski
{"title":"Spectrum Fragmentation-Aware Strategies for Deadline-Driven Dynamic Multicast Scheduling Problem in EON","authors":"M. Markowski","doi":"10.1515/ipc-2017-0001","DOIUrl":"https://doi.org/10.1515/ipc-2017-0001","url":null,"abstract":"Abstract Since the spectrum fragmentation is an important issue for the dynamic demands allocation in the Elastic Optical Networks, minimization of it improves the spectrum utilization and decreases the blocking probability. In the paper, the dynamic deadline-driven multicast routing and spectrum assignment problem in the elastic network is considered. Three spectrum fragmentation-aware algorithms were proposed and evaluated. Two of proposed algorithms use the well-known fragmentation metrics, while the third one utilizes a new original fragmentation increase estimator. The results of the experiments validating the quality of proposed methods and algorithms were reported and analyzed.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128295809","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}
引用次数: 0
SDN-Based WAN Optimization: PCE Implementation in Multi-Domain MPLS Networks Supported By BGP-LS 基于sdn的广域网优化:BGP-LS支持的多域MPLS网络中PCE的实现
Image Processing & Communications Pub Date : 2017-03-01 DOI: 10.1515/ipc-2017-0004
Grzegorz Rzym, K. Wajda, P. Chołda
{"title":"SDN-Based WAN Optimization: PCE Implementation in Multi-Domain MPLS Networks Supported By BGP-LS","authors":"Grzegorz Rzym, K. Wajda, P. Chołda","doi":"10.1515/ipc-2017-0004","DOIUrl":"https://doi.org/10.1515/ipc-2017-0004","url":null,"abstract":"Abstract In order to provide efficient and flexible resource management and path set-up in high-speed MPLS/GMPLS networks, the PCE (Path Computation Element) architecture was proposed by IETF. Implementation of a central module for the path set-up enables network operators to run path establishment operations for applications with explicitly defined objective functions and QoS requirements. The paper reports on recent research and experimental investigations with PCE-based path computation performed according to the 3- layered traffic engineering (TE) system consisting of: (1) a PCE module equipped with the IBM Cplex LP solver used in the highest layer 3, and (2) a SDN controller in the intermediate layer 2 responsible for transferring path setup requests towards virtual routers in the lowest layer 1. The presented results show usefulness of the PCE-supporting architecture with an SDN controller and applicability of bandwidth-oriented optimization based on real-time focused constraints (path delay limits). We emphasise that even a simple optimization approach shows the power provided by the SDN, i.e., flexibility of flows. This property is in practice not feasible in classical IP or MPLS networks, that is the usage of flow-based routing provided by network programmability really opens opportunities in network tuning","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130167430","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}
引用次数: 4
Overflows of Elastic Traffic 弹性流量溢出
Image Processing & Communications Pub Date : 2017-03-01 DOI: 10.1515/ipc-2017-0002
M. Głąbowski, Damian Kmiecik
{"title":"Overflows of Elastic Traffic","authors":"M. Głąbowski, Damian Kmiecik","doi":"10.1515/ipc-2017-0002","DOIUrl":"https://doi.org/10.1515/ipc-2017-0002","url":null,"abstract":"Abstract This article presents the results of a study on hierarchical multiservice traffic overflow systems. The systems under investigation were composed of a number of primary resources and one alternative resource. Traffic in the considered systems was generated with the assumption that there was a finite number of traffic sources in individual classes. Further assumption was that offered traffic is elastic traffic for which – with an increase of the load of the system – a change in the volume of allocated resources is possible followed by concurrent extension of their service time. The article includes the results that present the blocking probability in the sample elastic traffic overflow systems. The study focuses on a determination of the influence of the traffic intensity, volume of resources, degree of compression, resource with compression (primary resources, alternative resources) and the cardinality of traffic sources on values of the blocking probability in individual call classes and on the number of calls that overflow to the alternative resource.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125717326","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}
引用次数: 1
Inter-Device Periocular Recognition Under Near-Infrared Light 近红外光下设备间眼周识别
Image Processing & Communications Pub Date : 2016-12-01 DOI: 10.1515/ipc-2016-0021
Michal Wlodarczyk, Pawel Krotewicz, D. Kacperski, W. Sankowski, K. Grabowski
{"title":"Inter-Device Periocular Recognition Under Near-Infrared Light","authors":"Michal Wlodarczyk, Pawel Krotewicz, D. Kacperski, W. Sankowski, K. Grabowski","doi":"10.1515/ipc-2016-0021","DOIUrl":"https://doi.org/10.1515/ipc-2016-0021","url":null,"abstract":"Abstract Periocular biometrics is a relatively new field of research, and only several publications on this topic can be found in the literature. It can become a promising feature that can be used independently or as a complement to other biometrics. In this work, the recognition rates of periocular biometrics on a single acquisition device and inter-device database is verified and the impact of different image sources on the performance of recognition algorithms is investigated. For this purpose a NearInfrared Light database was collected. The database contains images taken by two acquisition devices. In order to test the periocular biometric trait, three feature extraction methods are chosen: Histograms of Oriented Gradients, Local Binary Patterns and Scale Invariant Feature Transform. The fusion of these methods is also proposed and it is tested on inter-device database. The feasibility of applying periocular recognition as an individual decision module for a biometric system is assessed. Experimental results yield Equal Error Rate of 17.65 for right eye using inter-device database of 640 gallery periocular images for each eye side taken from 32 different individuals (20 images per individual for each eye side). These results are obtained by the optimal weighted sum fusion of the three feature extraction methods.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116642962","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}
引用次数: 0
Application of the Moment Shape Representations to the General Shape Analysis 矩形表示在一般形状分析中的应用
Image Processing & Communications Pub Date : 2016-12-01 DOI: 10.1515/ipc-2016-0022
D. Frejlichowski
{"title":"Application of the Moment Shape Representations to the General Shape Analysis","authors":"D. Frejlichowski","doi":"10.1515/ipc-2016-0022","DOIUrl":"https://doi.org/10.1515/ipc-2016-0022","url":null,"abstract":"Abstract The General Shape Analysis (GSA) is a task similar to the shape recognition and retrieval. However, in GSA an object usually does not belong to a template class, but can only be similar to some of them. Moreover, the number of applied templates is limited. Usually, ten most general shapes are used. Hence, the GSA consists in searching for the most universal information about them. This is useful when some general information has to be concluded, e.g. in coarse classification. In this paper the result of the application of three shape descriptors based on the moment theory to the GSA is presented. For this purpose the Moment Invariants, Contour Sequence Moments, and Zernike Moments were selected.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134272146","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}
引用次数: 0
Reconstructed Quantized Coefficients Modeled with Generalized Gaussian Distribution with Exponent 1/3 用指数为1/3的广义高斯分布重构量化系数
Image Processing & Communications Pub Date : 2016-12-01 DOI: 10.1515/ipc-2016-0019
R. Krupiński
{"title":"Reconstructed Quantized Coefficients Modeled with Generalized Gaussian Distribution with Exponent 1/3","authors":"R. Krupiński","doi":"10.1515/ipc-2016-0019","DOIUrl":"https://doi.org/10.1515/ipc-2016-0019","url":null,"abstract":"Abstract Generalized Gaussian distribution (GGD) includes specials cases when the shape parameter equals p = 1 and p = 2. It corresponds to Laplacian and Gaussian distributions respectively. For p → ∞, f(x) becomes a uniform distribution, and for p → 0, f(x) approaches an impulse function. Chapeau-Blondeau et al. [4] considered another special case p = 0.5. The article discusses more peaky case in which GGD p = 1/3.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132317059","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}
引用次数: 8
Identification of Football Players based on Generic Fourier Descriptor Applied for the Recognition of Numbers 基于通用傅里叶描述子的足球运动员识别应用于数字识别
Image Processing & Communications Pub Date : 2016-12-01 DOI: 10.1515/ipc-2016-0020
D. Frejlichowski
{"title":"Identification of Football Players based on Generic Fourier Descriptor Applied for the Recognition of Numbers","authors":"D. Frejlichowski","doi":"10.1515/ipc-2016-0020","DOIUrl":"https://doi.org/10.1515/ipc-2016-0020","url":null,"abstract":"Abstract There are various possible approaches to the task of automatic identification of football players on video sequences. In the paper the numbers on jerseys are analysed and investigated. Firstly, the algorithm for the localisation of sport shirts and consecutively numbers is described. Secondly, the method for the recognition of the extracted numbers is proposed and experimentally investigated. The approach analysed in the paper applies the Generic Fourier Descriptor for the representation of extracted binary shapes of numbers.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"150 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114114406","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}
引用次数: 2
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信