Abstract When applied to the segmentation of 3D medical images, graph-cut segmentation algorithms require an extreme amount of memory and time resources in order to represent the image graph and to perform the necessary processing on the graph. These requirements actually exclude the graph-cut based approaches from their practical application. Hence, there is a need to develop the dedicated graph size reduction methods. In this paper, several techniques for the graph size reduction are proposed. These apply the idea of superpixels. In particular, two methods for superpixel creation are introduced. The results of applying the proposed methods to the segmentation of CT datasets using min-cut/max-flow algorithm are presented, compared and discussed.
{"title":"A Competitive Study of Graph Reduction Methods for Min S-T Cut Image Segmentation","authors":"T. Weglinski, A. Fabijańska, J. Gocławski","doi":"10.1515/ipc-2015-0014","DOIUrl":"https://doi.org/10.1515/ipc-2015-0014","url":null,"abstract":"Abstract When applied to the segmentation of 3D medical images, graph-cut segmentation algorithms require an extreme amount of memory and time resources in order to represent the image graph and to perform the necessary processing on the graph. These requirements actually exclude the graph-cut based approaches from their practical application. Hence, there is a need to develop the dedicated graph size reduction methods. In this paper, several techniques for the graph size reduction are proposed. These apply the idea of superpixels. In particular, two methods for superpixel creation are introduced. The results of applying the proposed methods to the segmentation of CT datasets using min-cut/max-flow algorithm are presented, compared and discussed.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132538638","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}
Abstract Abstract The paper presents a CT/MRI image based semi-automatic AAA (abdominal aortic aneurysm) segmentation method. Segmentation process can run automatically with the active contour method but results are controlled by the operator. If incorrect segmentation is noticed, the operator may introduce corrections. The proposed method makes possible the segmentation of dissected aneurysms, with which no automatic analysis works. Controlling the segmentation process by the operator serves to ensure correct geometric shape reproduction, which is crucial in deploying aneurysm models to help assess rupture risk.
{"title":"Semi-Automatic Segmentation of Ct/Mri Images Based on Active Contour Method for 3D Reconstruction of Abdominal Aortic Aneurysms","authors":"P. Drapikowski, Zuzanna Domagala","doi":"10.1515/ipc-2015-0002","DOIUrl":"https://doi.org/10.1515/ipc-2015-0002","url":null,"abstract":"Abstract Abstract The paper presents a CT/MRI image based semi-automatic AAA (abdominal aortic aneurysm) segmentation method. Segmentation process can run automatically with the active contour method but results are controlled by the operator. If incorrect segmentation is noticed, the operator may introduce corrections. The proposed method makes possible the segmentation of dissected aneurysms, with which no automatic analysis works. Controlling the segmentation process by the operator serves to ensure correct geometric shape reproduction, which is crucial in deploying aneurysm models to help assess rupture risk.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122221937","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}
Abstract The problem of service time-varying traffic in flexible transparent optical networks, assuming that the incoming connections and their duration are not known in advance, is considered in this work. Time-varying traffic requires dynamic spectrum allocation for connections implemented in the network. In the considered problem, a path with the required spectrum around the reference frequency is determined for each incoming connection by the routing algorithm. In order to take into account the dynamic spectrum allocation for the connections in the network, two spectrum expansion/- contraction schemes have been applied on the basis of which the average blocking probability for the incoming request additional slot was determined.
{"title":"RSA Problem for Varying Traffic in Flexible Optical Networks","authors":"I. Olszewski","doi":"10.1515/ipc-2015-0004","DOIUrl":"https://doi.org/10.1515/ipc-2015-0004","url":null,"abstract":"Abstract The problem of service time-varying traffic in flexible transparent optical networks, assuming that the incoming connections and their duration are not known in advance, is considered in this work. Time-varying traffic requires dynamic spectrum allocation for connections implemented in the network. In the considered problem, a path with the required spectrum around the reference frequency is determined for each incoming connection by the routing algorithm. In order to take into account the dynamic spectrum allocation for the connections in the network, two spectrum expansion/- contraction schemes have been applied on the basis of which the average blocking probability for the incoming request additional slot was determined.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133158005","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}
Abstract Hidden Markov Model (HMM) is a well established technique for image recognition and has also been successfully applied in other domains such as speech recognition, signature verification and gesture recognition. HMM is widely used mechanism for pattern recognition based on 1D data. For images one dimension is not satisfactory, because the conversion of one-dimensional data into a twodimensional lose some information. This paper presents a solution to the problem of 2D data by developing the 2D HMM structure and the necessary algorithms.
{"title":"Comparison of the Effectiveness of 1D and 2D Hmm in the Pattern Recognition","authors":"J. Bobulski","doi":"10.1515/ipc-2015-0001","DOIUrl":"https://doi.org/10.1515/ipc-2015-0001","url":null,"abstract":"Abstract Hidden Markov Model (HMM) is a well established technique for image recognition and has also been successfully applied in other domains such as speech recognition, signature verification and gesture recognition. HMM is widely used mechanism for pattern recognition based on 1D data. For images one dimension is not satisfactory, because the conversion of one-dimensional data into a twodimensional lose some information. This paper presents a solution to the problem of 2D data by developing the 2D HMM structure and the necessary algorithms.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121270669","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}
Abstract Text segmentation from land map images is a non-trivial task as map components are interleaved and overlapped in a complex spatial form. The characters in a word in most of the Indic languages, including Bangla (the 6th most spoken language in the world), are connected through a headline (”matra” or ”shirorekha”) which makes the corresponding word a single component. It has been observed that the Delaunay triangulation (DT) forms a number of small triangles on the text regions compared to other regions of the map - a property very much discernible for Bangla (and some other Indic scripts) texts. This property is primarily exploited here to segment text from the complex background of the land map images. The proposed text segmentation approach is tested and compared with an existing method on a collected dataset of paper map images( containing Bangla, an Indian regional language texts) and the results are encouraging.
{"title":"Text Segmentation from Bangla Land Map Images","authors":"Samit Biswas, Amit Kumar Das, B. Chanda","doi":"10.1515/ipc-2015-0003","DOIUrl":"https://doi.org/10.1515/ipc-2015-0003","url":null,"abstract":"Abstract Text segmentation from land map images is a non-trivial task as map components are interleaved and overlapped in a complex spatial form. The characters in a word in most of the Indic languages, including Bangla (the 6th most spoken language in the world), are connected through a headline (”matra” or ”shirorekha”) which makes the corresponding word a single component. It has been observed that the Delaunay triangulation (DT) forms a number of small triangles on the text regions compared to other regions of the map - a property very much discernible for Bangla (and some other Indic scripts) texts. This property is primarily exploited here to segment text from the complex background of the land map images. The proposed text segmentation approach is tested and compared with an existing method on a collected dataset of paper map images( containing Bangla, an Indian regional language texts) and the results are encouraging.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125265287","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 : 2013-12-01DOI: 10.2478/v10248-012-0092-1
Paweł Misiorek, Przemyslaw Walkowiak, Stanisław Karlik, S. Vanini
Abstract A growing number of mobile nodes that require Internet access is observed. These nodes may be organized in a wireless mesh network in which some of the nodes may serve the access to the Internet and relay other users’ traffic. Such a vision, however, causes the need for carrier-grade reliable Internet sharing solution. This paper presents a CARMNET-XML protocol, which enables to provide Authentication, Authorisation and Accounting AAA functionalities in wireless mesh networks managed by the Delay-Aware Network Utility Maximization System (DANUMS). The presented solution is a part of a CARMNET system, which integrates the utility-oriented resource allocation provided by DANUMS with the IMS architecture. The system allows users to access Internet with a given quality without the need of extending the operator’s infrastructure. Moreover, we define the scenario of the system application involving the use of the proposed protocol that has been experimentally evaluated in a wireless testbed environment
{"title":"SIP-based AAA in delay-aware num-oriented wireless mesh networks","authors":"Paweł Misiorek, Przemyslaw Walkowiak, Stanisław Karlik, S. Vanini","doi":"10.2478/v10248-012-0092-1","DOIUrl":"https://doi.org/10.2478/v10248-012-0092-1","url":null,"abstract":"Abstract A growing number of mobile nodes that require Internet access is observed. These nodes may be organized in a wireless mesh network in which some of the nodes may serve the access to the Internet and relay other users’ traffic. Such a vision, however, causes the need for carrier-grade reliable Internet sharing solution. This paper presents a CARMNET-XML protocol, which enables to provide Authentication, Authorisation and Accounting AAA functionalities in wireless mesh networks managed by the Delay-Aware Network Utility Maximization System (DANUMS). The presented solution is a part of a CARMNET system, which integrates the utility-oriented resource allocation provided by DANUMS with the IMS architecture. The system allows users to access Internet with a given quality without the need of extending the operator’s infrastructure. Moreover, we define the scenario of the system application involving the use of the proposed protocol that has been experimentally evaluated in a wireless testbed environment","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126268137","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 : 2013-12-01DOI: 10.2478/v10248-012-0090-3
S. Hanczewski, M. Sobieraj, Michał Dominik Stasiak, J. Weissenberg
Abstract In this paper we discuss a proposition of various applications of new queueing models that have been developed within the CARMNET project in nodes of the mesh network. These models allow characteristics of systems that service multi-rate traffic to be determined, e.g., the average queue length or the average waiting time for calls of a given class. The proposed models can be used to design, analyse and optimize multiservice networks
{"title":"Queuing models for wireless mesh networks","authors":"S. Hanczewski, M. Sobieraj, Michał Dominik Stasiak, J. Weissenberg","doi":"10.2478/v10248-012-0090-3","DOIUrl":"https://doi.org/10.2478/v10248-012-0090-3","url":null,"abstract":"Abstract In this paper we discuss a proposition of various applications of new queueing models that have been developed within the CARMNET project in nodes of the mesh network. These models allow characteristics of systems that service multi-rate traffic to be determined, e.g., the average queue length or the average waiting time for calls of a given class. The proposed models can be used to design, analyse and optimize multiservice networks","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127239756","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 : 2013-12-01DOI: 10.2478/v10248-012-0089-9
P. Owczarek, P. Zwierzykowski
Abstract The interest in services offered by wireless network has been growing for many years. It has encouraged the development of wireless technologies. New solutions are able to satisfy the ever-increasing demands concerning wireless services. It is also evident in the diversification of quality assessment methods employed with reference to connections used in such networks. One of the basic elements used in connection quality assessment are metrics. The use of metrics is directly linked to the type of the routing protocol applied in a given network. The selection of a given routing protocol is often determined by its specific properties that might be advantageous in a certain network type, or that are important in terms of the type or scope of services provided. Therefore, it is easy to identify a relationship between metrics and the area of application of a given routing protocol. The significance and diversity of metrics is also reflected inWireless Mesh Networks (WMNs). The proposed paper presents a review of the current state-of-the-art routing metrics for Ad-hoc and WMN networks
{"title":"Metrics in routing protocol for wireless mesh networks","authors":"P. Owczarek, P. Zwierzykowski","doi":"10.2478/v10248-012-0089-9","DOIUrl":"https://doi.org/10.2478/v10248-012-0089-9","url":null,"abstract":"Abstract The interest in services offered by wireless network has been growing for many years. It has encouraged the development of wireless technologies. New solutions are able to satisfy the ever-increasing demands concerning wireless services. It is also evident in the diversification of quality assessment methods employed with reference to connections used in such networks. One of the basic elements used in connection quality assessment are metrics. The use of metrics is directly linked to the type of the routing protocol applied in a given network. The selection of a given routing protocol is often determined by its specific properties that might be advantageous in a certain network type, or that are important in terms of the type or scope of services provided. Therefore, it is easy to identify a relationship between metrics and the area of application of a given routing protocol. The significance and diversity of metrics is also reflected inWireless Mesh Networks (WMNs). The proposed paper presents a review of the current state-of-the-art routing metrics for Ad-hoc and WMN networks","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124870580","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 : 2013-12-01DOI: 10.2478/v10248-012-0091-2
A. Kaliszan, M. Głąbowski, S. Hanczewski, Dario Gallucci, S. Vanini
Abstract This article presents a hybrid method for testing routing protocols specifically dedicated to mesh networks. The architecture of software routers is described and a graphic environment that would ensure effective configuration of test networks is proposed. The platform for tests of routing protocols presented in the article combines an implementation of routing protocols (the real control plane) with a router data plane simulator. The proposed solution provides an opportunity to test real implementations of routing protocols for any parameters of data plane, not limited by the physical implementation of a test network. The presented platform is based on an open source code
{"title":"A Hybrid method for testing routing protocols in mesh networks","authors":"A. Kaliszan, M. Głąbowski, S. Hanczewski, Dario Gallucci, S. Vanini","doi":"10.2478/v10248-012-0091-2","DOIUrl":"https://doi.org/10.2478/v10248-012-0091-2","url":null,"abstract":"Abstract This article presents a hybrid method for testing routing protocols specifically dedicated to mesh networks. The architecture of software routers is described and a graphic environment that would ensure effective configuration of test networks is proposed. The platform for tests of routing protocols presented in the article combines an implementation of routing protocols (the real control plane) with a router data plane simulator. The proposed solution provides an opportunity to test real implementations of routing protocols for any parameters of data plane, not limited by the physical implementation of a test network. The presented platform is based on an open source code","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126009735","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 : 2013-12-01DOI: 10.2478/v10248-012-0093-0
P. Remlein
Abstract Frequency-Division Multiplexed Continuous Phase Modulation (FDM-CPM) systems with Multiple Input Multiple Output (MIMO) transmission are investigated. In this paper, a multiuser reception scheme for CPM MIMO transmission is presented. The analyzed system is designed to achieve high spectral efficiency by exploiting the multiplexing gain of MIMO techniques. To take advantage of the multiplexing gain of MIMO systems, a Zero Forcing (ZF) MIMO detector and a low-complexity iterative algorithm for Inter- Carrier Interference (ICI) cancellation are considered. Numerical simulations have been performed to assess the performance improvement achieved with the proposed frequency-division multiplexed CPM multiuser MIMO system
{"title":"Multiuser cpm transmission for mimo systems","authors":"P. Remlein","doi":"10.2478/v10248-012-0093-0","DOIUrl":"https://doi.org/10.2478/v10248-012-0093-0","url":null,"abstract":"Abstract Frequency-Division Multiplexed Continuous Phase Modulation (FDM-CPM) systems with Multiple Input Multiple Output (MIMO) transmission are investigated. In this paper, a multiuser reception scheme for CPM MIMO transmission is presented. The analyzed system is designed to achieve high spectral efficiency by exploiting the multiplexing gain of MIMO techniques. To take advantage of the multiplexing gain of MIMO systems, a Zero Forcing (ZF) MIMO detector and a low-complexity iterative algorithm for Inter- Carrier Interference (ICI) cancellation are considered. Numerical simulations have been performed to assess the performance improvement achieved with the proposed frequency-division multiplexed CPM multiuser MIMO system","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130516583","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
扫码关注我们
求助内容：
应助结果提醒方式：