Abstract Median filtering has been widely used in image processing for noise removal because it can significantly reduce the power of noise while limiting edge blurring. This filtering is still a challenging task in the case of three-dimensional images containing up to a billion of voxels, especially for large size filtering windows. The authors encountered the problem when applying median filter to speckle noise reduction in optical coherence tomography images acquired by the Spark OCT systems. In the paper a new approach to the GPU (Graphics Processing Unit) based median smoothing has been proposed, which uses two-step evaluation of local intensity histograms stored in the shared memory of a graphic device. The solution is able to output about 50 million voxels per second while processing the neighbourhood of 125 voxels by Quadro K6000 graphic card configured on the Kepler architecture.
{"title":"A New Idea of Fast Three-Dimensional Median Filtering for Despeckling of Optical Coherence Tomography Images","authors":"J. Gocławski, J. Sekulska-Nalewajko","doi":"10.1515/ipc-2015-0037","DOIUrl":"https://doi.org/10.1515/ipc-2015-0037","url":null,"abstract":"Abstract Median filtering has been widely used in image processing for noise removal because it can significantly reduce the power of noise while limiting edge blurring. This filtering is still a challenging task in the case of three-dimensional images containing up to a billion of voxels, especially for large size filtering windows. The authors encountered the problem when applying median filter to speckle noise reduction in optical coherence tomography images acquired by the Spark OCT systems. In the paper a new approach to the GPU (Graphics Processing Unit) based median smoothing has been proposed, which uses two-step evaluation of local intensity histograms stored in the shared memory of a graphic device. The solution is able to output about 50 million voxels per second while processing the neighbourhood of 125 voxels by Quadro K6000 graphic card configured on the Kepler architecture.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133665702","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 paper presents an automatic point set extraction method for reconstructing 3D tomography images of funnel flow boundary. The method clearly shows the boundary between the funnel flow and stagnant zone during silo discharging process. After adjusting the contrast of the original X-ray CT image and applying filter function, the intensity profile of the image shows a high jump corresponding to the local flow boundary position at a specific height of the silo model. By extracting and connecting those jump points gave us a boundary line of the funnel flow from the stagnant. The outcome of segmented image opens a door for analysing further about funnel flow in 3D images.
{"title":"3D Reconstruction of Funnel Flow Boundary Using Automatic Point Set Extraction","authors":"Selam Waktola, K. Grudzień, L. Babout","doi":"10.1515/ipc-2015-0038","DOIUrl":"https://doi.org/10.1515/ipc-2015-0038","url":null,"abstract":"Abstract The paper presents an automatic point set extraction method for reconstructing 3D tomography images of funnel flow boundary. The method clearly shows the boundary between the funnel flow and stagnant zone during silo discharging process. After adjusting the contrast of the original X-ray CT image and applying filter function, the intensity profile of the image shows a high jump corresponding to the local flow boundary position at a specific height of the silo model. By extracting and connecting those jump points gave us a boundary line of the funnel flow from the stagnant. The outcome of segmented image opens a door for analysing further about funnel flow in 3D images.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126958209","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 article describes research on dishes segmentation for the purposes of customer service process automation in a self-service canteen. The project assumptions and a prototype test stand are presented. The developed empty workspace detection and tray position determination algorithms are discussed. Finally, the chosen dishes segmentation algorithm is described and justified.
{"title":"Segmentation of Dishes for Customer Service Automation in a Self-service Canteen","authors":"T. Kryjak, Damian Krol, M. Gorgon","doi":"10.1515/ipc-2015-0030","DOIUrl":"https://doi.org/10.1515/ipc-2015-0030","url":null,"abstract":"Abstract The article describes research on dishes segmentation for the purposes of customer service process automation in a self-service canteen. The project assumptions and a prototype test stand are presented. The developed empty workspace detection and tray position determination algorithms are discussed. Finally, the chosen dishes segmentation algorithm is described and justified.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125083932","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 Automated and intelligent video surveillance systems play important role in current home care and facilities security applications. Among many research problems is graphical visualization of semantic messages to the human operator that he can percept information in more natural way. The other essential research question is how to recognize 3D objects and their state on the monitored scene only from their views (2D images from the camera). In this paper we continue our previous work on data fusion in visualization of 3D scene semantic model and propose to recognize events and states of scene objects under surveillance in an automatic way using feedback provided by the renderer. We developed ray-tracing based visualization for surveillance system, that is capable of recognizing object’s state and at the same time present relevant information to the human operator.
{"title":"Ray-Tracing-Based Event Detection and 3D Visualization for Automated Video Surveillance System","authors":"J. Przybyło, M. Jablonski","doi":"10.1515/ipc-2015-0032","DOIUrl":"https://doi.org/10.1515/ipc-2015-0032","url":null,"abstract":"Abstract Automated and intelligent video surveillance systems play important role in current home care and facilities security applications. Among many research problems is graphical visualization of semantic messages to the human operator that he can percept information in more natural way. The other essential research question is how to recognize 3D objects and their state on the monitored scene only from their views (2D images from the camera). In this paper we continue our previous work on data fusion in visualization of 3D scene semantic model and propose to recognize events and states of scene objects under surveillance in an automatic way using feedback provided by the renderer. We developed ray-tracing based visualization for surveillance system, that is capable of recognizing object’s state and at the same time present relevant information to the human operator.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130263457","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 aim of this work was to develop a simple and fast yet robust algorithm for segmentation of objects in log-polar space. Assuming that some interesting parts of an image are selected by fixation of point of attention, pixels located close to fixation points are transformed to a log-polar space, then edge detection is performed. As a final step, detected edges are processed in a specific manner, which should lead to obtain boundaries of objects. After some smoothing, the detected boundaries are transformed back to a Cartesian space and are superimposed on an original image in order to show results of segmentation.
{"title":"Segmentation of Objects in Log-Polar Space","authors":"Z. Bublinski, P. Pawlik","doi":"10.1515/ipc-2015-0034","DOIUrl":"https://doi.org/10.1515/ipc-2015-0034","url":null,"abstract":"Abstract The aim of this work was to develop a simple and fast yet robust algorithm for segmentation of objects in log-polar space. Assuming that some interesting parts of an image are selected by fixation of point of attention, pixels located close to fixation points are transformed to a log-polar space, then edge detection is performed. As a final step, detected edges are processed in a specific manner, which should lead to obtain boundaries of objects. After some smoothing, the detected boundaries are transformed back to a Cartesian space and are superimposed on an original image in order to show results of segmentation.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123811153","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}
Szymon Bigaj, A. Glowacz, Jacek Kościow, Z. Mikrut, P. Pawlik
Abstract The paper presents an application for generating ground truth data for the purposes of video detection and justifies its use in systems which analyze road traffic videos. The usefulness of described application in the development of video detection software is presented - especially during scene configuration and comparative analysis of video detection results versus ground truth data. The latter is possible due to simplicity of the result text files generated in a similar way both by the presented application and by the video detection algorithm. Two exemplary applications of the tool designed to generate ground truth data are presented, together with a discussion of their construction, functionality and abilities.
{"title":"Ground Truth Generating Tool for Traffic Video Detector","authors":"Szymon Bigaj, A. Glowacz, Jacek Kościow, Z. Mikrut, P. Pawlik","doi":"10.1515/ipc-2015-0031","DOIUrl":"https://doi.org/10.1515/ipc-2015-0031","url":null,"abstract":"Abstract The paper presents an application for generating ground truth data for the purposes of video detection and justifies its use in systems which analyze road traffic videos. The usefulness of described application in the development of video detection software is presented - especially during scene configuration and comparative analysis of video detection results versus ground truth data. The latter is possible due to simplicity of the result text files generated in a similar way both by the presented application and by the video detection algorithm. Two exemplary applications of the tool designed to generate ground truth data are presented, together with a discussion of their construction, functionality and abilities.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"16 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130484866","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 This paper considers the problem of QR codes detection in digital images. In particular, the approach for detection of QR codes is proposed. The approach is based on histogram correlation between the reference image of QR code and the input image. In particular the input image is firstly divided into blocks. These are next used to build binary map of regions similar and dissimilar in terms of histogram to the image of QR code. On the binary map the morphological operations are next applied in order to remove outliers and identify the QR code. The results of applying the introduced approach to various images are presented and discussed. Different lighting conditions, image resolutions and orientations of QR codes are considered.
{"title":"Detection of QR-Codes in Digital Images Based on Histogram Similarity","authors":"Karol Ciazynski, A. Fabijańska","doi":"10.1515/ipc-2015-0033","DOIUrl":"https://doi.org/10.1515/ipc-2015-0033","url":null,"abstract":"Abstract This paper considers the problem of QR codes detection in digital images. In particular, the approach for detection of QR codes is proposed. The approach is based on histogram correlation between the reference image of QR code and the input image. In particular the input image is firstly divided into blocks. These are next used to build binary map of regions similar and dissimilar in terms of histogram to the image of QR code. On the binary map the morphological operations are next applied in order to remove outliers and identify the QR code. The results of applying the introduced approach to various images are presented and discussed. Different lighting conditions, image resolutions and orientations of QR codes are considered.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"796 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123006250","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 methods for protection of non-public information against electromagnetic infiltration are very important issue that requires constant development of technological advancement of the devices on which such information is processed. The current methods are the solutions regarding construction of the devices and organisation oriented solutions that are related mainly to physically limiting access to such information. The new area concerning electromagnetic protection of processed information by means of electricity is the programme based methods. These, however, do not deal with the issues of cryptographic information protection. The programme based protection uses special shapes of fonts, which having passed through the Radiated Information Infiltration Channel (RIIC) make reading of protected data impossible. This is achieved through eliminating specific character elements (roots, sheriffs, arcs) and maximising the degree of similarity between them. However, the assimilation should not make the original characters, i.e. those displayed on the screen of the device that processes these data harder to differentiate between them. Yet, is maximising the degree of similarity between the characters of a safe font decisive for electromagnetic security? The article presents two font solutions of similar character shape, which are however much different from one another in terms of their degree of recognisability on the output of the RIIC due to structural detail. This shows that maximising similarity between characters in their original form does not have to increase the degree of resistance to recognition of the secondary characters.
{"title":"Radiated Information Infiltration Channel Concerning Programme Based Solutions for Information Protection Prior to its Non-Invasive Acquisition","authors":"I. Kubiak","doi":"10.1515/ipc-2015-0026","DOIUrl":"https://doi.org/10.1515/ipc-2015-0026","url":null,"abstract":"Abstract The methods for protection of non-public information against electromagnetic infiltration are very important issue that requires constant development of technological advancement of the devices on which such information is processed. The current methods are the solutions regarding construction of the devices and organisation oriented solutions that are related mainly to physically limiting access to such information. The new area concerning electromagnetic protection of processed information by means of electricity is the programme based methods. These, however, do not deal with the issues of cryptographic information protection. The programme based protection uses special shapes of fonts, which having passed through the Radiated Information Infiltration Channel (RIIC) make reading of protected data impossible. This is achieved through eliminating specific character elements (roots, sheriffs, arcs) and maximising the degree of similarity between them. However, the assimilation should not make the original characters, i.e. those displayed on the screen of the device that processes these data harder to differentiate between them. Yet, is maximising the degree of similarity between the characters of a safe font decisive for electromagnetic security? The article presents two font solutions of similar character shape, which are however much different from one another in terms of their degree of recognisability on the output of the RIIC due to structural detail. This shows that maximising similarity between characters in their original form does not have to increase the degree of resistance to recognition of the secondary characters.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124584111","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}
T. Andrysiak, Ł. Saganowski, M. Maszewski, Piotr Grad
Abstract Dynamic development of various systems providing safety and protection to network infrastructure from novel, unknown attacks is currently an intensively explored and developed domain. In the present article there is presented an attempt to redress the problem by variability estimation with the use of conditional variation. The predictions of this variability were based on the estimated conditional heteroscedastic statistical models ARCH, GARCH and FIGARCH. The method used for estimating the parameters of the exploited models was determined by calculating maximum likelihood function. With the use of compromise between conciseness of representation and the size of estimation error there has been selected as a sparingly parameterized form of models. In order to detect an attack-/anomaly in the network traffic there were used differences between the actual network traffic and the estimated model of the traffic. The presented research confirmed efficacy of the described method and cogency of the choice of statistical models.
{"title":"A DDoS Attacks Detection Based on Conditional Heteroscedastic Time Series Models","authors":"T. Andrysiak, Ł. Saganowski, M. Maszewski, Piotr Grad","doi":"10.1515/ipc-2015-0027","DOIUrl":"https://doi.org/10.1515/ipc-2015-0027","url":null,"abstract":"Abstract Dynamic development of various systems providing safety and protection to network infrastructure from novel, unknown attacks is currently an intensively explored and developed domain. In the present article there is presented an attempt to redress the problem by variability estimation with the use of conditional variation. The predictions of this variability were based on the estimated conditional heteroscedastic statistical models ARCH, GARCH and FIGARCH. The method used for estimating the parameters of the exploited models was determined by calculating maximum likelihood function. With the use of compromise between conciseness of representation and the size of estimation error there has been selected as a sparingly parameterized form of models. In order to detect an attack-/anomaly in the network traffic there were used differences between the actual network traffic and the estimated model of the traffic. The presented research confirmed efficacy of the described method and cogency of the choice of statistical models.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128437469","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 In this article, we have presented an algorithm for separating the mixed or fused images. We have considered that the two independent histogram equalized digital images are linearly mixed, and the joint probability density function (PDF) or the scatter plot of the two observed or mixed images is used for separation. The objective and subjective separation results are presented, and observed to be better than the other existing techniques in terms of Peak signal-to-noise ratio (PSNR) and Signal-to-interference ratio (SIR).
{"title":"Digital Image Separation Algorithm Based on Joint PDF of Mixed Images","authors":"M. Wajid, Mayank Sharma","doi":"10.1515/ipc-2015-0025","DOIUrl":"https://doi.org/10.1515/ipc-2015-0025","url":null,"abstract":"Abstract In this article, we have presented an algorithm for separating the mixed or fused images. We have considered that the two independent histogram equalized digital images are linearly mixed, and the joint probability density function (PDF) or the scatter plot of the two observed or mixed images is used for separation. The objective and subjective separation results are presented, and observed to be better than the other existing techniques in terms of Peak signal-to-noise ratio (PSNR) and Signal-to-interference ratio (SIR).","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122447585","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
扫码关注我们
求助内容：
应助结果提醒方式：