Štefan Kohek

The characterisation of geometric shapes produces their concise description and is, therefore, important for subsequent analyses, for example in Computer Vision, Machine Learning, or shape matching. A new method for extracting characterisation vectors of 2D geometric shapes is proposed in this paper. The shape of interest, embedded into a raster space, is swept several times by sweep-lines having different slopes. The interior shape’s points, being in the middle of its boundary and laying on the actual sweep-line, are identified at each stage of the sweeping process. The midpoints are then connected iteratively into chains. The chains are filtered, vectorised, and normalised. The obtained polylines from the vectorisation step are used to design the shape’s characterisation vector for further application-specific analyses. The proposed method was verified on numerous shapes, where single- and multi-threaded implementations were compared. Finally, characterisation vectors, among which some were rotated and scaled, were determined for these shapes. The proposed method demonstrated a good rotation- and scaling-invariant identification of equal shapes.

Woody vegetation landscape features, such as hedges, tree patches, and riparian vegetation, are important elements of landscape and biotic diversity. For the reason that biodiversity loss is one of the major ecological problems in the EU, it is necessary to establish efficient workflows for the registration and monitoring of woody vegetation landscape features. In the paper, we propose and evaluate a methodology for automated detection of changes in woody vegetation landscape features from a digital orthophoto (DOP). We demonstrate its ability to capture most of the actual changes in the field and thereby provide valuable support for more efficient maintenance of landscape feature layers, which is important for the shaping of future environmental policies. While the most reliable source for vegetation cover mapping is a combination of LiDAR and high-resolution imagery, it can be prohibitively expensive for continuous updates. The DOP from cyclic aerial photography presents an alternative source of up-to-date information for tracking woody vegetation landscape features in-between LiDAR recordings. The proposed methodology uses a segmentation neural network, which is trained with the latest DOP against the last known ground truth as the target. The output is a layer of detected changes, which are validated by the user before being used to update the woody vegetation landscape feature layer. The methodology was tested using the data of a typical traditional Central European cultural landscape, Goričko, in north-eastern Slovenia. The achieved F1 of per-pixel segmentation was 83.5% and 77.1% for two- and five-year differences between the LiDAR-based reference and the DOP, respectively. The validation of the proposed changes at a minimum area threshold of 100 m2 and a minimum area percentage threshold of 20% showed that the model achieved recall close to 90%.

A new approach is proposed for lossless raster image compression employing interpolative coding. A new multifunction prediction scheme is presented first. Then, interpolative coding, which has not been applied frequently for image compression, is explained briefly. Its simplification is introduced in regard to the original approach. It is determined that the JPEG LS predictor reduces the information entropy slightly better than the multi-functional approach. Furthermore, the interpolative coding was moderately more efficient than the most frequently used arithmetic coding. Finally, our compression pipeline is compared against JPEG LS, JPEG 2000 in the lossless mode, and PNG using 24 standard grayscale benchmark images. JPEG LS turned out to be the most efficient, followed by JPEG 2000, while our approach using simplified interpolative coding was moderately better than PNG. The implementation of the proposed encoder is extremely simple and can be performed in less than 60 lines of programming code for the coder and 60 lines for the decoder, which is demonstrated in the given pseudocodes.