Pub Date : 2013-03-01DOI: 10.2478/v10248-012-0088-x
R. Kozik, A. Marchewka
Abstract In this paper an object recognition algorithm for mobile devices is presented. The algorithm is based on a hierarchical approach for visual information coding proposed by Riesenhuber and Poggio [1] and later extended by Serre et al. [2]. The proposed method adapts an efficient algorithm to extract the information about local gradients. This allows the algorithm to approximate the behaviour of simple cells layer of Riesenhuber and Poggio model. Moreover, it is also demonstrated that the proposed algorithm can be successfully deployed on a low-cost Android smartphone.
{"title":"Object recognition algorithm for mobile devices","authors":"R. Kozik, A. Marchewka","doi":"10.2478/v10248-012-0088-x","DOIUrl":"https://doi.org/10.2478/v10248-012-0088-x","url":null,"abstract":"Abstract In this paper an object recognition algorithm for mobile devices is presented. The algorithm is based on a hierarchical approach for visual information coding proposed by Riesenhuber and Poggio [1] and later extended by Serre et al. [2]. The proposed method adapts an efficient algorithm to extract the information about local gradients. This allows the algorithm to approximate the behaviour of simple cells layer of Riesenhuber and Poggio model. Moreover, it is also demonstrated that the proposed algorithm can be successfully deployed on a low-cost Android smartphone.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124904685","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-03-01DOI: 10.2478/v10248-012-0071-6
T. Andrysiak, Ł. Saganowski, M. Maszewski
Abstract The article depicts possibility of using Matching Pursuit decomposition in order to recognize unspecified hazards in network traffic. Furthermore, the work aims to present feasible enhancements to the anomaly detection method, as well as their efficiency on the basis of a wide collection of pattern test traces.
{"title":"Network anomaly detection based on signal processing techniques","authors":"T. Andrysiak, Ł. Saganowski, M. Maszewski","doi":"10.2478/v10248-012-0071-6","DOIUrl":"https://doi.org/10.2478/v10248-012-0071-6","url":null,"abstract":"Abstract The article depicts possibility of using Matching Pursuit decomposition in order to recognize unspecified hazards in network traffic. Furthermore, the work aims to present feasible enhancements to the anomaly detection method, as well as their efficiency on the basis of a wide collection of pattern test traces.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132458988","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-03-01DOI: 10.2478/v10248-012-0087-y
D. Frejlichowski
Abstract In this paper an algorithm for the representation of 3D models is described and experimentally evaluated. Three-dimensional objects are becoming very popular recently and they are processed in various ways - analysed, retrieved, recognised, and so on. Moreover, they are employed in various aplications, such as virtual reality, entertainment, Internet, Computer Aided Design, or even in biometrics or medical imaging. That is why the development of appropriate algorithms for the representation of 3D objects is so important recently. These algorithms - so called 3D shape descriptors - are assumed to be invariant to particular transformations and deformations. One of the possible approaches is based on the projections of a 3D object into planar shapes and representation of them using a 2D shape descriptor. An algorithm realising this idea is described in this paper. Its first stage is based on the rendering of 20 2D projections, from various points of view. Later, the obtained projections are stored in a form of bitmaps and the Curvature Scale Space algorithm is applied for the description of the planar shapes extracted from them. The proposed approach is experimentally compared with several other 3D shape representation methods.
{"title":"Application of the curvature scale space transform to the representation of three-dimensional models","authors":"D. Frejlichowski","doi":"10.2478/v10248-012-0087-y","DOIUrl":"https://doi.org/10.2478/v10248-012-0087-y","url":null,"abstract":"Abstract In this paper an algorithm for the representation of 3D models is described and experimentally evaluated. Three-dimensional objects are becoming very popular recently and they are processed in various ways - analysed, retrieved, recognised, and so on. Moreover, they are employed in various aplications, such as virtual reality, entertainment, Internet, Computer Aided Design, or even in biometrics or medical imaging. That is why the development of appropriate algorithms for the representation of 3D objects is so important recently. These algorithms - so called 3D shape descriptors - are assumed to be invariant to particular transformations and deformations. One of the possible approaches is based on the projections of a 3D object into planar shapes and representation of them using a 2D shape descriptor. An algorithm realising this idea is described in this paper. Its first stage is based on the rendering of 20 2D projections, from various points of view. Later, the obtained projections are stored in a form of bitmaps and the Curvature Scale Space algorithm is applied for the description of the planar shapes extracted from them. The proposed approach is experimentally compared with several other 3D shape representation methods.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"96 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132782287","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-03-01DOI: 10.2478/v10248-012-0072-5
A. Flizikowski, Marcin Przybyszewski, W. Holubowicz
Abstract This paper presents results of assessing quality of VoIP conversations in WiMAX networks using the nbLDPC (non-binary Low- Density Parity-Check) FEC in mobility scenarios that are based on the real world terrain charactristics around simulated BS. System under test (SUT) is instrumented with three Call Admission Control (CAC) mechanisms (namely EMAC, ARAC and nsc-ARAC). These algorithms are evaluated against controlling the VBR traffic that comes with burst arrivals. The first algorithm relies on calculating simple exponential weighted moving average (EWMA) of the overall resource consumption whereas the other two ARAC algorithms perform calculations discerning between the new, the ongoing and the finishing connections thus providing more accurate resource estimations (but the ARAC tracks the history of requests as well). In order to evaluate their performance authors rely on a cell-level based simulation environment that relies on the cooperative use of well known simulators - ns2 and Matlab. Previous work in the field is enhanced by improving the fidelity of proposed IEEE 802.16 simulator. Authors demonstrate the influence of increasing number of arrivals per one batch as well as testing the "zero hour" scenario (system saturation). In order to include nbLDPC codes in SUT’s mobile channels, a method called Link-To-System interface (L2S) has been implemented.
{"title":"Evaluation of wimax admission control algorithms in mobile voip scenarios with batch arrivals and nbldpc fec","authors":"A. Flizikowski, Marcin Przybyszewski, W. Holubowicz","doi":"10.2478/v10248-012-0072-5","DOIUrl":"https://doi.org/10.2478/v10248-012-0072-5","url":null,"abstract":"Abstract This paper presents results of assessing quality of VoIP conversations in WiMAX networks using the nbLDPC (non-binary Low- Density Parity-Check) FEC in mobility scenarios that are based on the real world terrain charactristics around simulated BS. System under test (SUT) is instrumented with three Call Admission Control (CAC) mechanisms (namely EMAC, ARAC and nsc-ARAC). These algorithms are evaluated against controlling the VBR traffic that comes with burst arrivals. The first algorithm relies on calculating simple exponential weighted moving average (EWMA) of the overall resource consumption whereas the other two ARAC algorithms perform calculations discerning between the new, the ongoing and the finishing connections thus providing more accurate resource estimations (but the ARAC tracks the history of requests as well). In order to evaluate their performance authors rely on a cell-level based simulation environment that relies on the cooperative use of well known simulators - ns2 and Matlab. Previous work in the field is enhanced by improving the fidelity of proposed IEEE 802.16 simulator. Authors demonstrate the influence of increasing number of arrivals per one batch as well as testing the \"zero hour\" scenario (system saturation). In order to include nbLDPC codes in SUT’s mobile channels, a method called Link-To-System interface (L2S) has been implemented.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"24 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125672365","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-03-01DOI: 10.2478/v10248-012-0070-7
I. Kubiak
Abstract The article contains information about the capabilities of electromagnetic infiltration process in case of occurrence of strong interfering signals. As a methods supporting infiltration process used method of digital processing of signals and images in the form of histogram transformations, global and local thresholding of signal amplitudes and logical filters. The material presented in the article shows that risk can arise if the uncontrolled use of the computer. Risks that could decide our safety and security of our data. obtained images. Manipulation of histograms, threshold amplitudes of the emission signal correlated with the classified signals or logical filters highlight the weakness of the security used at the source. The presence of strong interfering signals such as vertical and horizontal synchronization signals blocking measurement receivers, do not prevent the reproduction of classified information. Opportunities of the electromagnetic infiltration in situations of weak compromising emissions occurs are presented in the article.
{"title":"Digital processing methods of images and signals in electromagnetic infiltration process","authors":"I. Kubiak","doi":"10.2478/v10248-012-0070-7","DOIUrl":"https://doi.org/10.2478/v10248-012-0070-7","url":null,"abstract":"Abstract The article contains information about the capabilities of electromagnetic infiltration process in case of occurrence of strong interfering signals. As a methods supporting infiltration process used method of digital processing of signals and images in the form of histogram transformations, global and local thresholding of signal amplitudes and logical filters. The material presented in the article shows that risk can arise if the uncontrolled use of the computer. Risks that could decide our safety and security of our data. obtained images. Manipulation of histograms, threshold amplitudes of the emission signal correlated with the classified signals or logical filters highlight the weakness of the security used at the source. The presence of strong interfering signals such as vertical and horizontal synchronization signals blocking measurement receivers, do not prevent the reproduction of classified information. Opportunities of the electromagnetic infiltration in situations of weak compromising emissions occurs are presented in the article.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129077424","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-03-01DOI: 10.2478/v10248-012-0073-4
S. García-Galán, R. Pérez de Prado, J. E. Muñoz Expósito
Abstract Nowadays, diverse areas in science as high energy physics, astronomy or climate research are increasingly relying on experimental studies addressed with hard computing simulations that cannot be faced with traditional distributed systems. In this context, grid computing has emerged as the new generation computing platform based on the large-scale cooperation of resources. Furthermore, the use of grid computing has also been extended to several technology, engineering or economy areas such as financial services and construction engineering that demand high computer capabilities. Nevertheless, a major issue in the sharing of resources is the scheduling problem in a high-dynamic and uncertain environment where resources may become available, inactive or reserved over time according to local policies or systems failures. In this paper, a review of scheduling strategies dealing with uncertainty in systems information by the application of techniques such as fuzzy logic, neural networks or evolutionary algorithms is presented. Furthermore, this work is centered on the study of scheduling strategies based on fuzzy rulebased systems given their flexibility and ability to adapt to changes in grid systems. These knowledge-based strategies are founded on a fuzzy characterization of the system state and the application of the scheduler knowledge in the form of fuzzy rules to cope with the imprecise environment. Obtaining good rules also arises as a challenging problem. Hence, the main learning methods that allow the improvement and adaptation of the expert schedulers are introduced.
{"title":"Uncertainty-tolerant scheduling strategies for grid computing: knowledge-based techniques with bio-inspired learning","authors":"S. García-Galán, R. Pérez de Prado, J. E. Muñoz Expósito","doi":"10.2478/v10248-012-0073-4","DOIUrl":"https://doi.org/10.2478/v10248-012-0073-4","url":null,"abstract":"Abstract Nowadays, diverse areas in science as high energy physics, astronomy or climate research are increasingly relying on experimental studies addressed with hard computing simulations that cannot be faced with traditional distributed systems. In this context, grid computing has emerged as the new generation computing platform based on the large-scale cooperation of resources. Furthermore, the use of grid computing has also been extended to several technology, engineering or economy areas such as financial services and construction engineering that demand high computer capabilities. Nevertheless, a major issue in the sharing of resources is the scheduling problem in a high-dynamic and uncertain environment where resources may become available, inactive or reserved over time according to local policies or systems failures. In this paper, a review of scheduling strategies dealing with uncertainty in systems information by the application of techniques such as fuzzy logic, neural networks or evolutionary algorithms is presented. Furthermore, this work is centered on the study of scheduling strategies based on fuzzy rulebased systems given their flexibility and ability to adapt to changes in grid systems. These knowledge-based strategies are founded on a fuzzy characterization of the system state and the application of the scheduler knowledge in the form of fuzzy rules to cope with the imprecise environment. Obtaining good rules also arises as a challenging problem. Hence, the main learning methods that allow the improvement and adaptation of the expert schedulers are introduced.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121694582","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 DDoS attacks detection method based on modelling the variability with the use of conditional average and variance in examined time series is proposed in this article. Variability predictions of the analyzed network traffic are realized by estimated statistical models with long-memory dependence ARFIMA, Adaptive ARFIMA, FIGARCH and Adaptive FIGARCH. We propose simple parameter estimation models with the use of maximum likelihood function. Selection of sparingly parameterized form of the models is realized by means of information criteria representing a compromise between brevity of representation and the extent of the prediction error. In the described method we propose using statistical relations between the forecasted and analyzed network traffic in order to detect abnormal behavior possibly being a result of a network attack. Performed experiments confirmed effectiveness of the analyzed method and cogency of the statistical models.
{"title":"Long-Memory Dependence Statistical Models for DDoS Attacks Detection","authors":"T. Andrysiak, Ł. Saganowski, M. Maszewski, Piotr Grad","doi":"10.1515/ipc-2015-0042","DOIUrl":"https://doi.org/10.1515/ipc-2015-0042","url":null,"abstract":"Abstract DDoS attacks detection method based on modelling the variability with the use of conditional average and variance in examined time series is proposed in this article. Variability predictions of the analyzed network traffic are realized by estimated statistical models with long-memory dependence ARFIMA, Adaptive ARFIMA, FIGARCH and Adaptive FIGARCH. We propose simple parameter estimation models with the use of maximum likelihood function. Selection of sparingly parameterized form of the models is realized by means of information criteria representing a compromise between brevity of representation and the extent of the prediction error. In the described method we propose using statistical relations between the forecasted and analyzed network traffic in order to detect abnormal behavior possibly being a result of a network attack. Performed experiments confirmed effectiveness of the analyzed method and cogency of the statistical models.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130982819","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}
M. Majchrowicz, Paweł Kapusta, L. Jackowska-Strumillo, D. Sankowski
Abstract 3D ECT provides a lot of challenging computational issues that have been reported in the past by many researchers. Image reconstruction using deterministic methods requires execution of many basic operations of linear algebra, such as matrix transposition, multiplication, addition and subtraction. In order to reach real-time reconstruction a 3D ECT computational subsystem has to be able to transform capacitance data into image in fractions of seconds. By assuming, that many of the computations can be performed in parallel using modern, fast graphics processor and by altering the algorithms time to achieve high quality image reconstruction will be shortened significantly. The research conducted while analysing ECT algorithms has also shown that, although dynamic development of GPU computational capabilities and its recent application for image reconstruction in ECT has significantly improved calculations time, in modern systems a single GPU is not enough to perform many tasks. Distributed Multi-GPU solutions can reduce reconstruction time to only a fraction of what was possible on pure CPU systems. Nevertheless performed tests clearly illustrate the need for developing a new distributed platform, which would be able to fully utilize the potential of the hardware. It has to take into account specific nature of computations in Multi-GPU systems.
3D ECT提供了许多具有挑战性的计算问题，这些问题在过去已经被许多研究人员报道过。用确定性方法重建图像需要执行许多线性代数的基本运算，如矩阵的变换、乘法、加法和减法。为了实现实时重建，三维ECT计算子系统必须能够在几秒钟内将电容数据转换为图像。假设许多计算可以使用现代、快速的图形处理器并行执行，并且通过改变算法来实现高质量图像重建的时间将大大缩短。在分析ECT算法的同时进行的研究也表明，尽管GPU计算能力的动态发展及其最近在ECT中图像重建的应用显著改善了计算时间，但在现代系统中，单个GPU不足以执行许多任务。分布式多gpu解决方案可以将重建时间减少到纯CPU系统的一小部分。然而，进行的测试清楚地表明，需要开发一种新的分布式平台，这种平台将能够充分利用硬件的潜力。它必须考虑到多gpu系统中计算的特定性质。
{"title":"Analysis of Application of Distributed Multi-Node, Multi-GPU Heterogeneous System for Acceleration of Image Reconstruction in Electrical Capacitance Tomography","authors":"M. Majchrowicz, Paweł Kapusta, L. Jackowska-Strumillo, D. Sankowski","doi":"10.1515/ipc-2015-0035","DOIUrl":"https://doi.org/10.1515/ipc-2015-0035","url":null,"abstract":"Abstract 3D ECT provides a lot of challenging computational issues that have been reported in the past by many researchers. Image reconstruction using deterministic methods requires execution of many basic operations of linear algebra, such as matrix transposition, multiplication, addition and subtraction. In order to reach real-time reconstruction a 3D ECT computational subsystem has to be able to transform capacitance data into image in fractions of seconds. By assuming, that many of the computations can be performed in parallel using modern, fast graphics processor and by altering the algorithms time to achieve high quality image reconstruction will be shortened significantly. The research conducted while analysing ECT algorithms has also shown that, although dynamic development of GPU computational capabilities and its recent application for image reconstruction in ECT has significantly improved calculations time, in modern systems a single GPU is not enough to perform many tasks. Distributed Multi-GPU solutions can reduce reconstruction time to only a fraction of what was possible on pure CPU systems. Nevertheless performed tests clearly illustrate the need for developing a new distributed platform, which would be able to fully utilize the potential of the hardware. It has to take into account specific nature of computations in Multi-GPU systems.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131568060","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 Line following robots are applied in numerous applications and the best performance could be obtained if the forward looking camera is applied. Variable light and line conditions influence the line estimation and quality of the robot navigation. Proposed History Dependent Viterbi Algorithm and Viterbi Algorithm are compared. Obtained results using Monte Carlo tests show improved performance of the proposed algorithm for assumed model.
{"title":"History Dependent Viterbi Algorithm for Navigation Purposes of Line Following Robot","authors":"G. Matczak, P. Mazurek","doi":"10.1515/ipc-2015-0039","DOIUrl":"https://doi.org/10.1515/ipc-2015-0039","url":null,"abstract":"Abstract Line following robots are applied in numerous applications and the best performance could be obtained if the forward looking camera is applied. Variable light and line conditions influence the line estimation and quality of the robot navigation. Proposed History Dependent Viterbi Algorithm and Viterbi Algorithm are compared. Obtained results using Monte Carlo tests show improved performance of the proposed algorithm for assumed model.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130996575","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 a vision based visual servoing system and active laser triangulation method for distance measurement. The proposed hybrid system is dedicated to mobile robot operating in difficult lighting conditions. The problems caused by the use of the video system in extremely underexposured 3D scene have been discussed and two devices performing the distance measurement together with an analysis measurements have been analyzed.
{"title":"The night vision distance measurement method dedicated for mobile robots","authors":"Jarosław Fastowicz, P. Lech","doi":"10.1515/ipc-2015-0041","DOIUrl":"https://doi.org/10.1515/ipc-2015-0041","url":null,"abstract":"Abstract The paper presents a vision based visual servoing system and active laser triangulation method for distance measurement. The proposed hybrid system is dedicated to mobile robot operating in difficult lighting conditions. The problems caused by the use of the video system in extremely underexposured 3D scene have been discussed and two devices performing the distance measurement together with an analysis measurements have been analyzed.","PeriodicalId":271906,"journal":{"name":"Image Processing & Communications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127858028","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
扫码关注我们
求助内容：
应助结果提醒方式：