Michał Kwaśny

Nematicons in twisted liquid crystals

The paper presents the way that colour can serve solving the problem of calibration points indexing in a camera geometrical calibration process. We propose a technique in which indexes of calibration points in a black-and-white chessboard are represented as sets of colour regions in the neighbourhood of calibration points. We provide some general rules for designing a colour calibration chessboard and provide a method of calibration image analysis. We show that this approach leads to obtaining better results than in the case of widely used methods employing information about already indexed points to compute indexes. We also report constraints concerning the technique. Nowadays we are witnessing an increasing need for camera geometrical calibration systems. They are vital for such applications as 3D modelling, 3D reconstruction, assembly control systems, etc. Wherever possible, calibration objects placed in the scene are used in a camera geometrical calibration process. This approach significantly increases accuracy of calibration results and makes the calibration data extraction process easier and universal. There are many geometrical camera calibration techniques for a known calibration scene [1]. A great number of them use as an input calibration points which are localised and indexed in the scene. In this paper we propose the technique of calibration points indexing which uses a colour chessboard. The presented technique was developed by solving problems we encountered during experiments with our earlier methods of camera calibration scene analysis [2]-[3]. In particular, the proposed technique increases the number of indexed points points in case of local lack of calibration points detection. At the beginning of the paper we present a way of designing a chessboard pattern. Then we describe a calibration point indexing method, and finally we show experimental results. A black-and-white chessboard is widely used in order to obtain sub-pixel accuracy of calibration points localisation [1]. Calibration points are defined as corners of chessboard squares. Assuming the availability of rough localisation of these points, the points can be indexed. Noting that differences in distances between neighbouring points in calibration scene images differ slightly, one of the local searching methods can be employed (e.g. [2]). Methods of this type search for a calibration point to be indexed, using a window of a certain size. The position of the window is determined by a vector representing the distance between two previously indexed points in the same row or column. However, experiments show that this approach has its disadvantages, as described below. * E-mail: A.Nowakowski@ire.pw.edu.pl Firstly, there is a danger of omitting some points during indexing in case of local lack of calibration points detection in a neighbourhood (e.g. caused by the presence of non-homogeneous light in the calibration scene). A particularly unfavourable situation is when the local lack of detection effects in the appearance of separated regions of detected calibration points. It is worth saying that such situations are likely to happen for calibration points situated near image borders. Such points are very important for the analysis of optical nonlinearities, and a lack of them can significantly influence the accuracy of distortion modelling. Secondly, such methods may give wrong results in the case of optical distortion with strong nonlinearities when getting information about the neighbouring index is not an easy task. Beside this, the methods are very sensitive to a single false localisation of a calibration point. Such a single false localisation can even result in false indexing of a big set of calibration points. To avoid the above-mentioned problems, we propose using a black-and-white chessboard which contains the coded index of a calibration point in the form of colour squares situated in the nearest neighbourhood of each point. The index of a certain calibration point is determined by colours of four nearest neighbouring squares (Fig.1). An order of squares in such foursome is important. Because the size of a colour square is determined only by the possibility of correct colour detection, the size of a colour square can be smaller than the size of a black or white square. The larger size of a black or white square is determined by the requirements of the exact localisation step which follows the indexing of calibration points [3]. In this step, edge information is extracted from a blackand-white chessboard. This edge information needs larger Artur Nowakowski, Wladyslaw Skarbek Institute of Radioelectronics, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warszawa, A.Nowakowski@ire.pw.edu.pl Received February 10, 2009; accepted March 27, 2009; published March 31, 2009 http://www.photonics.pl/PLP

Curved optical solitons subject to transverse acceleration in reorientational soft matter

We demonstrate that optical spatial solitons with non-rectilinear trajectories can be made to propagate in a uniaxial dielectric with a transversely modulated orientation of the optic axis. Exploiting the reorientational nonlinearity of nematic liquid crystals and imposing a linear variation of the background alignment of the molecular director, we observe solitons whose trajectories have either a monotonic or a non-monotonic curvature in the observation plane of propagation, depending on either the synergistic or counteracting roles of wavefront distortion and birefringent walk-off, respectively. The observed effect is well modelled in the weakly nonlinear regime using momentum conservation of the self-collimated beams in the presence of the spatial nonlocality of the medium response. Since reorientational solitons can act as passive waveguides for other weak optical signals, these results introduce a wealth of possibilities for all-optical signal routing and light-induced photonic interconnects.

Properties of spatial solitons in chiral nematic liquid crystal cells

The paper presents the way that colour can serve solving the problem of calibration points indexing in a camera geometrical calibration process. We propose a technique in which indexes of calibration points in a black-and-white chessboard are represented as sets of colour regions in the neighbourhood of calibration points. We provide some general rules for designing a colour calibration chessboard and provide a method of calibration image analysis. We show that this approach leads to obtaining better results than in the case of widely used methods employing information about already indexed points to compute indexes. We also report constraints concerning the technique. Nowadays we are witnessing an increasing need for camera geometrical calibration systems. They are vital for such applications as 3D modelling, 3D reconstruction, assembly control systems, etc. Wherever possible, calibration objects placed in the scene are used in a camera geometrical calibration process. This approach significantly increases accuracy of calibration results and makes the calibration data extraction process easier and universal. There are many geometrical camera calibration techniques for a known calibration scene [1]. A great number of them use as an input calibration points which are localised and indexed in the scene. In this paper we propose the technique of calibration points indexing which uses a colour chessboard. The presented technique was developed by solving problems we encountered during experiments with our earlier methods of camera calibration scene analysis [2]-[3]. In particular, the proposed technique increases the number of indexed points points in case of local lack of calibration points detection. At the beginning of the paper we present a way of designing a chessboard pattern. Then we describe a calibration point indexing method, and finally we show experimental results. A black-and-white chessboard is widely used in order to obtain sub-pixel accuracy of calibration points localisation [1]. Calibration points are defined as corners of chessboard squares. Assuming the availability of rough localisation of these points, the points can be indexed. Noting that differences in distances between neighbouring points in calibration scene images differ slightly, one of the local searching methods can be employed (e.g. [2]). Methods of this type search for a calibration point to be indexed, using a window of a certain size. The position of the window is determined by a vector representing the distance between two previously indexed points in the same row or column. However, experiments show that this approach has its disadvantages, as described below. * E-mail: A.Nowakowski@ire.pw.edu.pl Firstly, there is a danger of omitting some points during indexing in case of local lack of calibration points detection in a neighbourhood (e.g. caused by the presence of non-homogeneous light in the calibration scene). A particularly unfavourable situation is when the local lack of detection effects in the appearance of separated regions of detected calibration points. It is worth saying that such situations are likely to happen for calibration points situated near image borders. Such points are very important for the analysis of optical nonlinearities, and a lack of them can significantly influence the accuracy of distortion modelling. Secondly, such methods may give wrong results in the case of optical distortion with strong nonlinearities when getting information about the neighbouring index is not an easy task. Beside this, the methods are very sensitive to a single false localisation of a calibration point. Such a single false localisation can even result in false indexing of a big set of calibration points. To avoid the above-mentioned problems, we propose using a black-and-white chessboard which contains the coded index of a calibration point in the form of colour squares situated in the nearest neighbourhood of each point. The index of a certain calibration point is determined by colours of four nearest neighbouring squares (Fig.1). An order of squares in such foursome is important. Because the size of a colour square is determined only by the possibility of correct colour detection, the size of a colour square can be smaller than the size of a black or white square. The larger size of a black or white square is determined by the requirements of the exact localisation step which follows the indexing of calibration points [3]. In this step, edge information is extracted from a blackand-white chessboard. This edge information needs larger Artur Nowakowski, Wladyslaw Skarbek Institute of Radioelectronics, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warszawa, A.Nowakowski@ire.pw.edu.pl Received February 10, 2009; accepted March 27, 2009; published March 31, 2009 http://www.photonics.pl/PLP

Possibility of discrete beam propagation in chiral nematic liquid crystals

The paper presents the way that colour can serve solving the problem of calibration points indexing in a camera geometrical calibration process. We propose a technique in which indexes of calibration points in a black-and-white chessboard are represented as sets of colour regions in the neighbourhood of calibration points. We provide some general rules for designing a colour calibration chessboard and provide a method of calibration image analysis. We show that this approach leads to obtaining better results than in the case of widely used methods employing information about already indexed points to compute indexes. We also report constraints concerning the technique. Nowadays we are witnessing an increasing need for camera geometrical calibration systems. They are vital for such applications as 3D modelling, 3D reconstruction, assembly control systems, etc. Wherever possible, calibration objects placed in the scene are used in a camera geometrical calibration process. This approach significantly increases accuracy of calibration results and makes the calibration data extraction process easier and universal. There are many geometrical camera calibration techniques for a known calibration scene [1]. A great number of them use as an input calibration points which are localised and indexed in the scene. In this paper we propose the technique of calibration points indexing which uses a colour chessboard. The presented technique was developed by solving problems we encountered during experiments with our earlier methods of camera calibration scene analysis [2]-[3]. In particular, the proposed technique increases the number of indexed points points in case of local lack of calibration points detection. At the beginning of the paper we present a way of designing a chessboard pattern. Then we describe a calibration point indexing method, and finally we show experimental results. A black-and-white chessboard is widely used in order to obtain sub-pixel accuracy of calibration points localisation [1]. Calibration points are defined as corners of chessboard squares. Assuming the availability of rough localisation of these points, the points can be indexed. Noting that differences in distances between neighbouring points in calibration scene images differ slightly, one of the local searching methods can be employed (e.g. [2]). Methods of this type search for a calibration point to be indexed, using a window of a certain size. The position of the window is determined by a vector representing the distance between two previously indexed points in the same row or column. However, experiments show that this approach has its disadvantages, as described below. * E-mail: A.Nowakowski@ire.pw.edu.pl Firstly, there is a danger of omitting some points during indexing in case of local lack of calibration points detection in a neighbourhood (e.g. caused by the presence of non-homogeneous light in the calibration scene). A particularly unfavourable situation is when the local lack of detection effects in the appearance of separated regions of detected calibration points. It is worth saying that such situations are likely to happen for calibration points situated near image borders. Such points are very important for the analysis of optical nonlinearities, and a lack of them can significantly influence the accuracy of distortion modelling. Secondly, such methods may give wrong results in the case of optical distortion with strong nonlinearities when getting information about the neighbouring index is not an easy task. Beside this, the methods are very sensitive to a single false localisation of a calibration point. Such a single false localisation can even result in false indexing of a big set of calibration points. To avoid the above-mentioned problems, we propose using a black-and-white chessboard which contains the coded index of a calibration point in the form of colour squares situated in the nearest neighbourhood of each point. The index of a certain calibration point is determined by colours of four nearest neighbouring squares (Fig.1). An order of squares in such foursome is important. Because the size of a colour square is determined only by the possibility of correct colour detection, the size of a colour square can be smaller than the size of a black or white square. The larger size of a black or white square is determined by the requirements of the exact localisation step which follows the indexing of calibration points [3]. In this step, edge information is extracted from a blackand-white chessboard. This edge information needs larger Artur Nowakowski, Wladyslaw Skarbek Institute of Radioelectronics, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warszawa, A.Nowakowski@ire.pw.edu.pl Received February 10, 2009; accepted March 27, 2009; published March 31, 2009 http://www.photonics.pl/PLP

Measurements of the quality of nematic liquid crystal alignment

The paper presents the way that colour can serve solving the problem of calibration points indexing in a camera geometrical calibration process. We propose a technique in which indexes of calibration points in a black-and-white chessboard are represented as sets of colour regions in the neighbourhood of calibration points. We provide some general rules for designing a colour calibration chessboard and provide a method of calibration image analysis. We show that this approach leads to obtaining better results than in the case of widely used methods employing information about already indexed points to compute indexes. We also report constraints concerning the technique. Nowadays we are witnessing an increasing need for camera geometrical calibration systems. They are vital for such applications as 3D modelling, 3D reconstruction, assembly control systems, etc. Wherever possible, calibration objects placed in the scene are used in a camera geometrical calibration process. This approach significantly increases accuracy of calibration results and makes the calibration data extraction process easier and universal. There are many geometrical camera calibration techniques for a known calibration scene [1]. A great number of them use as an input calibration points which are localised and indexed in the scene. In this paper we propose the technique of calibration points indexing which uses a colour chessboard. The presented technique was developed by solving problems we encountered during experiments with our earlier methods of camera calibration scene analysis [2]-[3]. In particular, the proposed technique increases the number of indexed points points in case of local lack of calibration points detection. At the beginning of the paper we present a way of designing a chessboard pattern. Then we describe a calibration point indexing method, and finally we show experimental results. A black-and-white chessboard is widely used in order to obtain sub-pixel accuracy of calibration points localisation [1]. Calibration points are defined as corners of chessboard squares. Assuming the availability of rough localisation of these points, the points can be indexed. Noting that differences in distances between neighbouring points in calibration scene images differ slightly, one of the local searching methods can be employed (e.g. [2]). Methods of this type search for a calibration point to be indexed, using a window of a certain size. The position of the window is determined by a vector representing the distance between two previously indexed points in the same row or column. However, experiments show that this approach has its disadvantages, as described below. * E-mail: A.Nowakowski@ire.pw.edu.pl Firstly, there is a danger of omitting some points during indexing in case of local lack of calibration points detection in a neighbourhood (e.g. caused by the presence of non-homogeneous light in the calibration scene). A particularly unfavourable situation is when the local lack of detection effects in the appearance of separated regions of detected calibration points. It is worth saying that such situations are likely to happen for calibration points situated near image borders. Such points are very important for the analysis of optical nonlinearities, and a lack of them can significantly influence the accuracy of distortion modelling. Secondly, such methods may give wrong results in the case of optical distortion with strong nonlinearities when getting information about the neighbouring index is not an easy task. Beside this, the methods are very sensitive to a single false localisation of a calibration point. Such a single false localisation can even result in false indexing of a big set of calibration points. To avoid the above-mentioned problems, we propose using a black-and-white chessboard which contains the coded index of a calibration point in the form of colour squares situated in the nearest neighbourhood of each point. The index of a certain calibration point is determined by colours of four nearest neighbouring squares (Fig.1). An order of squares in such foursome is important. Because the size of a colour square is determined only by the possibility of correct colour detection, the size of a colour square can be smaller than the size of a black or white square. The larger size of a black or white square is determined by the requirements of the exact localisation step which follows the indexing of calibration points [3]. In this step, edge information is extracted from a blackand-white chessboard. This edge information needs larger Artur Nowakowski, Wladyslaw Skarbek Institute of Radioelectronics, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warszawa, A.Nowakowski@ire.pw.edu.pl Received February 10, 2009; accepted March 27, 2009; published March 31, 2009 http://www.photonics.pl/PLP

Nematicons routing through two types of disclination lines in chiral nematic liquid crystals

In this work, we study nematicons propagation at the disclination lines in a wedge-shaped planarly oriented sample. Using optimal beam parameters for light self-trapping and varying the input beam position and direction of the wave vector k with respect to the z-axis, we gain insight in the nematicons propagation in the highly disturbed area around two different types of disclination lines in chiral nematic.

Linear and nonlinear light beam propagation in chiral nematic liquid crystal waveguides

The paper presents the way that colour can serve solving the problem of calibration points indexing in a camera geometrical calibration process. We propose a technique in which indexes of calibration points in a black-and-white chessboard are represented as sets of colour regions in the neighbourhood of calibration points. We provide some general rules for designing a colour calibration chessboard and provide a method of calibration image analysis. We show that this approach leads to obtaining better results than in the case of widely used methods employing information about already indexed points to compute indexes. We also report constraints concerning the technique. Nowadays we are witnessing an increasing need for camera geometrical calibration systems. They are vital for such applications as 3D modelling, 3D reconstruction, assembly control systems, etc. Wherever possible, calibration objects placed in the scene are used in a camera geometrical calibration process. This approach significantly increases accuracy of calibration results and makes the calibration data extraction process easier and universal. There are many geometrical camera calibration techniques for a known calibration scene [1]. A great number of them use as an input calibration points which are localised and indexed in the scene. In this paper we propose the technique of calibration points indexing which uses a colour chessboard. The presented technique was developed by solving problems we encountered during experiments with our earlier methods of camera calibration scene analysis [2]-[3]. In particular, the proposed technique increases the number of indexed points points in case of local lack of calibration points detection. At the beginning of the paper we present a way of designing a chessboard pattern. Then we describe a calibration point indexing method, and finally we show experimental results. A black-and-white chessboard is widely used in order to obtain sub-pixel accuracy of calibration points localisation [1]. Calibration points are defined as corners of chessboard squares. Assuming the availability of rough localisation of these points, the points can be indexed. Noting that differences in distances between neighbouring points in calibration scene images differ slightly, one of the local searching methods can be employed (e.g. [2]). Methods of this type search for a calibration point to be indexed, using a window of a certain size. The position of the window is determined by a vector representing the distance between two previously indexed points in the same row or column. However, experiments show that this approach has its disadvantages, as described below. * E-mail: A.Nowakowski@ire.pw.edu.pl Firstly, there is a danger of omitting some points during indexing in case of local lack of calibration points detection in a neighbourhood (e.g. caused by the presence of non-homogeneous light in the calibration scene). A particularly unfavourable situation is when the local lack of detection effects in the appearance of separated regions of detected calibration points. It is worth saying that such situations are likely to happen for calibration points situated near image borders. Such points are very important for the analysis of optical nonlinearities, and a lack of them can significantly influence the accuracy of distortion modelling. Secondly, such methods may give wrong results in the case of optical distortion with strong nonlinearities when getting information about the neighbouring index is not an easy task. Beside this, the methods are very sensitive to a single false localisation of a calibration point. Such a single false localisation can even result in false indexing of a big set of calibration points. To avoid the above-mentioned problems, we propose using a black-and-white chessboard which contains the coded index of a calibration point in the form of colour squares situated in the nearest neighbourhood of each point. The index of a certain calibration point is determined by colours of four nearest neighbouring squares (Fig.1). An order of squares in such foursome is important. Because the size of a colour square is determined only by the possibility of correct colour detection, the size of a colour square can be smaller than the size of a black or white square. The larger size of a black or white square is determined by the requirements of the exact localisation step which follows the indexing of calibration points [3]. In this step, edge information is extracted from a blackand-white chessboard. This edge information needs larger Artur Nowakowski, Wladyslaw Skarbek Institute of Radioelectronics, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warszawa, A.Nowakowski@ire.pw.edu.pl Received February 10, 2009; accepted March 27, 2009; published March 31, 2009 http://www.photonics.pl/PLP

The influence of pitch and birefringence on nematicon propagation at the disclination lines in chiral nematic liquid crystals

The paper presents the way that colour can serve solving the problem of calibration points indexing in a camera geometrical calibration process. We propose a technique in which indexes of calibration points in a black-and-white chessboard are represented as sets of colour regions in the neighbourhood of calibration points. We provide some general rules for designing a colour calibration chessboard and provide a method of calibration image analysis. We show that this approach leads to obtaining better results than in the case of widely used methods employing information about already indexed points to compute indexes. We also report constraints concerning the technique. Nowadays we are witnessing an increasing need for camera geometrical calibration systems. They are vital for such applications as 3D modelling, 3D reconstruction, assembly control systems, etc. Wherever possible, calibration objects placed in the scene are used in a camera geometrical calibration process. This approach significantly increases accuracy of calibration results and makes the calibration data extraction process easier and universal. There are many geometrical camera calibration techniques for a known calibration scene [1]. A great number of them use as an input calibration points which are localised and indexed in the scene. In this paper we propose the technique of calibration points indexing which uses a colour chessboard. The presented technique was developed by solving problems we encountered during experiments with our earlier methods of camera calibration scene analysis [2]-[3]. In particular, the proposed technique increases the number of indexed points points in case of local lack of calibration points detection. At the beginning of the paper we present a way of designing a chessboard pattern. Then we describe a calibration point indexing method, and finally we show experimental results. A black-and-white chessboard is widely used in order to obtain sub-pixel accuracy of calibration points localisation [1]. Calibration points are defined as corners of chessboard squares. Assuming the availability of rough localisation of these points, the points can be indexed. Noting that differences in distances between neighbouring points in calibration scene images differ slightly, one of the local searching methods can be employed (e.g. [2]). Methods of this type search for a calibration point to be indexed, using a window of a certain size. The position of the window is determined by a vector representing the distance between two previously indexed points in the same row or column. However, experiments show that this approach has its disadvantages, as described below. * E-mail: A.Nowakowski@ire.pw.edu.pl Firstly, there is a danger of omitting some points during indexing in case of local lack of calibration points detection in a neighbourhood (e.g. caused by the presence of non-homogeneous light in the calibration scene). A particularly unfavourable situation is when the local lack of detection effects in the appearance of separated regions of detected calibration points. It is worth saying that such situations are likely to happen for calibration points situated near image borders. Such points are very important for the analysis of optical nonlinearities, and a lack of them can significantly influence the accuracy of distortion modelling. Secondly, such methods may give wrong results in the case of optical distortion with strong nonlinearities when getting information about the neighbouring index is not an easy task. Beside this, the methods are very sensitive to a single false localisation of a calibration point. Such a single false localisation can even result in false indexing of a big set of calibration points. To avoid the above-mentioned problems, we propose using a black-and-white chessboard which contains the coded index of a calibration point in the form of colour squares situated in the nearest neighbourhood of each point. The index of a certain calibration point is determined by colours of four nearest neighbouring squares (Fig.1). An order of squares in such foursome is important. Because the size of a colour square is determined only by the possibility of correct colour detection, the size of a colour square can be smaller than the size of a black or white square. The larger size of a black or white square is determined by the requirements of the exact localisation step which follows the indexing of calibration points [3]. In this step, edge information is extracted from a blackand-white chessboard. This edge information needs larger Artur Nowakowski, Wladyslaw Skarbek Institute of Radioelectronics, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warszawa, A.Nowakowski@ire.pw.edu.pl Received February 10, 2009; accepted March 27, 2009; published March 31, 2009 http://www.photonics.pl/PLP

Properties of nematicons in low-birefringent nematic liquid crystals

The paper presents the way that colour can serve solving the problem of calibration points indexing in a camera geometrical calibration process. We propose a technique in which indexes of calibration points in a black-and-white chessboard are represented as sets of colour regions in the neighbourhood of calibration points. We provide some general rules for designing a colour calibration chessboard and provide a method of calibration image analysis. We show that this approach leads to obtaining better results than in the case of widely used methods employing information about already indexed points to compute indexes. We also report constraints concerning the technique. Nowadays we are witnessing an increasing need for camera geometrical calibration systems. They are vital for such applications as 3D modelling, 3D reconstruction, assembly control systems, etc. Wherever possible, calibration objects placed in the scene are used in a camera geometrical calibration process. This approach significantly increases accuracy of calibration results and makes the calibration data extraction process easier and universal. There are many geometrical camera calibration techniques for a known calibration scene [1]. A great number of them use as an input calibration points which are localised and indexed in the scene. In this paper we propose the technique of calibration points indexing which uses a colour chessboard. The presented technique was developed by solving problems we encountered during experiments with our earlier methods of camera calibration scene analysis [2]-[3]. In particular, the proposed technique increases the number of indexed points points in case of local lack of calibration points detection. At the beginning of the paper we present a way of designing a chessboard pattern. Then we describe a calibration point indexing method, and finally we show experimental results. A black-and-white chessboard is widely used in order to obtain sub-pixel accuracy of calibration points localisation [1]. Calibration points are defined as corners of chessboard squares. Assuming the availability of rough localisation of these points, the points can be indexed. Noting that differences in distances between neighbouring points in calibration scene images differ slightly, one of the local searching methods can be employed (e.g. [2]). Methods of this type search for a calibration point to be indexed, using a window of a certain size. The position of the window is determined by a vector representing the distance between two previously indexed points in the same row or column. However, experiments show that this approach has its disadvantages, as described below. * E-mail: A.Nowakowski@ire.pw.edu.pl Firstly, there is a danger of omitting some points during indexing in case of local lack of calibration points detection in a neighbourhood (e.g. caused by the presence of non-homogeneous light in the calibration scene). A particularly unfavourable situation is when the local lack of detection effects in the appearance of separated regions of detected calibration points. It is worth saying that such situations are likely to happen for calibration points situated near image borders. Such points are very important for the analysis of optical nonlinearities, and a lack of them can significantly influence the accuracy of distortion modelling. Secondly, such methods may give wrong results in the case of optical distortion with strong nonlinearities when getting information about the neighbouring index is not an easy task. Beside this, the methods are very sensitive to a single false localisation of a calibration point. Such a single false localisation can even result in false indexing of a big set of calibration points. To avoid the above-mentioned problems, we propose using a black-and-white chessboard which contains the coded index of a calibration point in the form of colour squares situated in the nearest neighbourhood of each point. The index of a certain calibration point is determined by colours of four nearest neighbouring squares (Fig.1). An order of squares in such foursome is important. Because the size of a colour square is determined only by the possibility of correct colour detection, the size of a colour square can be smaller than the size of a black or white square. The larger size of a black or white square is determined by the requirements of the exact localisation step which follows the indexing of calibration points [3]. In this step, edge information is extracted from a blackand-white chessboard. This edge information needs larger Artur Nowakowski, Wladyslaw Skarbek Institute of Radioelectronics, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warszawa, A.Nowakowski@ire.pw.edu.pl Received February 10, 2009; accepted March 27, 2009; published March 31, 2009 http://www.photonics.pl/PLP