Search

We propose a novel unsupervised semantic segmentation method for fast and accurate flood area detection utilizing color images acquired from unmanned aerial vehicles (UAVs). To the best of our knowledge, this is the first fully unsupervised method for flood area segmentation in color images captured by UAVs, without the need of pre-disaster images. The proposed framework addresses the problem of flood segmentation based on parameter-free calculated masks and unsupervised image analysis techniques. First, a fully unsupervised algorithm gradually excludes areas classified as non-flood, utilizing calculated masks over each component of the LAB colorspace, as well as using an RGB vegetation index and the detected edges of the original image. Unsupervised image analysis techniques, such as distance transform, are then applied, producing a probability map for the location of flooded areas. Finally, flood detection is obtained by applying hysteresis thresholding segmentation. The proposed method is tested and compared with variations and other supervised methods in two public datasets, consisting of 953 color images in total, yielding high-performance results, with 87.4% and 80.9% overall accuracy and F1-score, respectively. The results and computational efficiency of the proposed method show that it is suitable for onboard data execution and decision-making during UAV flights. [ABSTRACT FROM AUTHOR]

In this paper, we present a general version of polygonal fitting problem called Unconstrained Polygonal Fitting (UPF). Our goal is to represent a given 2D shape S with an N-vertex polygonal curve P with a known number of vertices, so that the Intersection over Union (IoU) metric between S and P is maximized without any assumption or prior knowledge of the object structure and the location of the N-vertices of P that can be placed anywhere in the 2D space. The search space of the UPF problem is a superset of the classical polygonal approximation (PA) problem, where the vertices are constrained to belong in the boundary of the given 2D shape. Therefore, the resulting solutions of the UPF may better approximate the given curve than the solutions of the PA problem. For a given number of vertices N, a Particle Swarm Optimization (PSO) method is used to maximize the IoU metric, which yields almost optimal solutions. Furthermore, the proposed method has also been implemented under the equal area principle so that the total area covered by P is equal to the area of the original 2D shape to measure how this constraint affects IoU metric. The quantitative results obtained on more than 2800 2D shapes included in two standard datasets quantify the performance of the proposed methods and illustrate that their solutions outperform baselines from the literature. [ABSTRACT FROM AUTHOR]

A jigsaw puzzle is a recreational activity that involves assembling a certain number of pieces into a combined and well-fitting unit without creating gaps between adjacent pieces. Two-dimensional puzzles are divided into two main categories, the "apictorial" in which the only information available is the shape of the pieces and the "pictorial" which may take into account not only the shape of the pieces, but also their content. Jigsaw puzzles are considered as one of the most popular category of puzzles. The majority of them are accompanied by a guiding image and there is only one "counterpart" for each side of each piece (pictorial jigsaw puzzles), although some more difficult variants have blank pieces, the so-called apictorial jigsaw puzzles. In this paper, we will examine the open problem of solving pictorial and apictorial jigsaw puzzles, and their various applications, such as the reconstruction of two-dimensional fragmented objects, the restoration of fragmented wall-paintings and the repair of shredded documents. We will also present an evaluation of the state-of-the- art jigsaw puzzle reassembly techniques in pictorial and apictorial puzzles. [ABSTRACT FROM AUTHOR]

This paper studies the problem of unsupervised detection of geometrically similar fragments (segments) in curves, in the context of boundary matching. The goal is to determine all pairs of sub-curves that are geometrically similar, under local scale invariance. In particular, we aim to locate the existence of a similar section (independent of length and/or orientation) in the second curve, to a section of the first curve, as indicated by the user. The proposed approach is based on a suitable distance matrix of the two given curves. Additionally, a suitable objective function is proposed to capture the trade-off between the similarity of the common sub-sequences and their lengths. The goal of the algorithm is to minimize this objective function via an efficient graph-based approach that capitalizes on Dynamic Time Warping to compare the two subcurves. We apply the proposed technique in the context of geometric matching of coastline pairs. This application is crucial for investigating the forcing factors related to the coastline evolution. The proposed method was successfully applied to global coastline data, yielding a bipartite graph with analytical point-to-point correspondences. [ABSTRACT FROM AUTHOR]

The authors define and approximately solve the problem of unsupervised image sorting that is considered as a kind of content‐based image clustering. The content‐based image sorting is the creation of a route that passes through all the images once, in such an order that the next one from the previous image has similar content. In the end, an image ordering (e.g. slideshow) is automatically produced, so that the images with similar content should be close to each other. This problem resembles the problem known in the literature as 'travelling salesman problem' (TSP). In this work, the authors have proposed two classes of methods (the nearest‐neighbour and genetic methods) that have also been applied on the TSP problem. Their benefits on computational efficiency and accuracy are discussed over six datasets that have been created from the GHIM‐10K dataset. The experimental results demonstrate that the proposed methods efficiently solve the image sorting problem, producing image sequences that almost agree with human intuition. [ABSTRACT FROM AUTHOR]

We present a novel solution to the problem of detecting common actions in time series of motion capture data and videos. Given two action sequences, our method discovers all pairs of common subsequences, i.e. subsequences that represent the same or similar action. This is achieved in a completely unsupervised manner, i.e., without any prior knowledge of the type of actions, their number and their duration. These common subsequences (commonalities) may be located anywhere in the original sequences, may differ in duration and may be performed under different conditions e.g., by a different actor. The proposed method performs a very efficient graph-based search on the matrix of pairwise distances of frames of the two sequences. This search is supported by an objective function that captures the trade off between the similarity of the common subsequences and their lengths. The proposed method has been evaluated quantitatively on challenging datasets and in comparison to state of the art approaches. The obtained results demonstrate that the proposed method outperforms the state of the art methods both in the quality of the obtained solutions and in computational performance. [ABSTRACT FROM AUTHOR]

Recommender systems try to predict the preferences of users for specific items, based on an analysis of previous consumer preferences. In this paper, we propose SCoR, a Synthetic Coordinate based Recommendation system which is shown to outperform the most popular algorithmic techniques in the field, approaches like matrix factorization and collaborative filtering. SCoR assigns synthetic coordinates to nodes (users and items), so that the distance between a user and an item provides an accurate prediction of the user’s preference for that item. The proposed framework has several benefits. It is parameter free, thus requiring no fine tuning to achieve high performance, and is more resistance to the cold-start problem compared to other algorithms. Furthermore, it provides important annotations of the dataset, such as the physical detection of users and items with common and unique characteristics as well as the identification of outliers. SCoR is compared against nine other state-of-the-art recommender systems, sever of them based on the well known matrix factorization and two on collaborative filtering. The comparison is performed against four real datasets, including a brief version of the dataset used in the well known Netflix challenge. The extensive experiments prove that SCoR outperforms previous techniques while demonstrating its improved stability and high performance. [ABSTRACT FROM AUTHOR]

In this work, an unsupervised isocontour based segmentation method is proposed, that is applied on the detection of topographic highs with arbitrary basal shapes on Digital Elevation Models (DEMs). A series of isocontour based segmentation maps is computed for decreasing altitude levels. During this process, the isocontours are gradually merged providing a topological hierarchy of highs in an inclusion tree structure. A novel formulation of a topographic high is given taking into account the volume evolution of an isocontour that starts from the top of a high and grows, as decreasing the altitude level of isocontour, until a high of higher altitude is reached. This formulation yields to a robust unsupervised algorithm that can be sequentially applied to automatically recognize and discriminate the topographic highs of a region according to the inclusion tree without any constraint on basal shapes. The proposed method is applied on real and synthetic DEMs, in order to automatically detect the exact shape of complex topographic highs and some geomorphological based features useful for high annotations, yielding high performance results, even if the highs are partially visible in the given DEM. [ABSTRACT FROM AUTHOR]

We present in this article a new method on unsupervised semantic parsing and structure recognition in peri-urban areas using satellite images. The automatic “building” and “road” detection is based on regions extracted by an unsupervised segmentation method. We propose a novel segmentation algorithm based on a Markov random field model and we give an extensive data analysis for determining relevant features for the classification problem. The novelty of the segmentation algorithm lies on the class-driven vector data quantization and clustering and the estimation of the likelihoods given the resulting clusters. We have evaluated the reachability of a good classification rate using the Random Forest method. We found that, with a limited number of features, among them some new defined in this article, we can obtain good classification performance. Our main contribution lies again on the data analysis and the estimation of likelihoods. Finally, we propose a new method for completing the road network exploiting its connectivity, and the local and global properties of the road network. [ABSTRACT FROM AUTHOR]

Our goal is to represent a given 2D shape with an automatically determined number of ellipses, so that the total area covered by the ellipses is equal to the area of the original shape without any assumption or prior knowledge about the object structure. To solve this interesting theoretical problem, first we employ the skeleton of the 2D shape which provides important information on the parameters of the ellipses that could approximate the original shape. For a given number of such ellipses, the hard Expectation-Maximisation (EM) algorithm is employed to maximise the shape coverage under the Equal Area constraint. Different models (i.e., solutions involving different numbers of ellipses) are evaluated based on the Akaike Information Criterion (AIC). This considers a novel, entropy-based shape complexity measure that balances the model complexity and the model approximation error. In order to minimise the AIC criterion, two variants are proposed and evaluated: (a) the augmentative method that gradually increases the number of considered ellipses starting from a single one and (b) the decremental method that decreases the number of ellipses starting from a large, automatically defined set. The obtained quantitative results on more than 4000 2D shapes included in standard as well as in custom datasets, quantify the performance of the proposed methods and illustrate that their solutions agree with human intuition. [ABSTRACT FROM AUTHOR]

In this paper, we propose an unsupervised point clustering framework. The goal is to cluster N given points into K clusters, so that similarities between objects in the same group are high while the similarities between objects in different groups are low. The point similarity is defined by a voting measure that takes into account the point distances. Using the voting formulation, the problem of clustering is reduced to the maximization of the sum of votes between the points of the same cluster. We have shown that the resulting clustering based on voting maximization has advantages concerning the cluster's compactness, working well for clusters of different densities and/or sizes. In addition, the proposed scheme is able to detect outliers. Experimental results and comparisons to existing methods on real and synthetic datasets demonstrate the high performance and robustness of the proposed scheme. [ABSTRACT FROM AUTHOR]

In this paper, we propose a solution on microaggregation problem based on the hierarchical tree equi-partition (HTEP) algorithm. Microaggregation is a family of methods for statistical disclosure control of microdata, that is, for masking microdata, so that they can be released without disclose private information on the underlying individuals. Knowing that the microaggregation problem is non-deterministic polynomial-time-hard, the goal is to partitionNgiven data into groups of at leastKitems, so that the sum of the within-partition squared error is minimized. The proposed method is general and it can be applied to any tree partition problem aiming at the minimization of a total score. The method is divisive, so that the tree with the highest ‘score’ is split into two trees, resulting in a hierarchical forest of trees with almost equal ‘score’ (equipartition). We propose a version of HTEP for microaggregation (HTEPM), that is applied on the minimum spanning tree (MST) of the graph defined by the data. The merit of the HTEPM algorithm is that it solves optimally some instances of the multivariate microaggregation problem on MST search space in. Experimental results and comparisons with existing methods from literature prove the high performance and robustness of HTEPM. [ABSTRACT FROM AUTHOR]

We present a model-based, top-down solution to the problem of tracking the 3D position, orientation and full articulation of the human body from markerless visual observations obtained by two synchronized RGBD cameras. Inspired by recent advances to the problem of model-based hand tracking Oikonomidis et al. (Efficient Model-based 3D Tracking of Hand Articulations using Kinect, ), we treat human body tracking as an optimization problem that is solved using stochastic optimization techniques. We show that the proposed approach outperforms in accuracy state of the art methods that rely on a single RGBD camera. Thus, for applications that require increased accuracy and can afford the extra-complexity introduced by the second sensor, the proposed approach constitutes a viable solution to the problem of markerless human motion tracking. Our findings are supported by an extensive quantitative evaluation of the method that has been performed on a publicly available data set that is annotated with ground truth. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we propose a framework for interactive image segmentation. The goal of interactive image segmentation is to classify the image pixels into foreground and background classes, when some foreground and background markers are given. The proposed method minimizes a min–max Bayesian criterion that has been successfully used on image segmentation problem and it consists of several steps in order to take into account visual information as well as the given markers, without any requirement of training. First, we partition the image into contiguous and perceptually similar regions (superpixels). Then, we construct a weighted graph that represents the superpixels and the connections between them. An efficient algorithm for graph clustering based on synthetic coordinates is used yielding an initial map of classified pixels. This method reduces the problem of graph clustering to the simpler problem of point clustering, instead of solving the problem on the graph data structure, as most of the known algorithms from literature do. Finally, having available the data modeling and the initial map of classified pixels, we use a Markov Random Field (MRF) model or a flooding algorithm to get the image segmentation by minimizing a min–max Bayesian criterion. Experimental results and comparisons with other methods from the literature are presented on LHI, Gulshan and Zhao datasets, demonstrating the high performance and accuracy of the proposed scheme. [Copyright &y& Elsevier]

A fundamental problem in networking and computing is community detection. Various applications like finding web communities, uncovering the structure of social networks, or even analyzing a graph's structure to uncover Internet attacks are just some of the applications for which community detection is important. In this paper, we propose an algorithm that finds the entire community structure of a network, represented by an undirected, unweighted graph, based on local interactions between neighboring nodes and on an unsupervised centralized clustering algorithm. The novelty of the proposed approach is the fact that the algorithm is based on the use of network coordinates computed by a distributed algorithm. Experimental results and comparisons with the Lancichinetti et al. method (Phys. Rev. E 80(5 Pt 2), 056117, ; New J. Phys. 11(3), 033015, ) are presented for a variety of benchmark graphs with known community structure, derived by varying a number of graph parameters. Emphasis is given on benchmark graphs with significant variations in the size of their communities. Further experimental results are presented for two real dataset graphs, namely the Enron, and the Epinions graphs, from SNAP, the Stanford Large Network Dataset Collection. The experimental results demonstrate the high performance of our algorithm in terms of accuracy to detect communities, and its computational efficiency. [ABSTRACT FROM AUTHOR]

In this paper, we propose an efficient clustering algorithm that has been applied to the microaggregation problem. The goal is to partition $(N)$ given records into clusters, each of them grouping at least $(K)$ records, so that the sum of the within-partition squared error (SSE) is minimized. We propose a successive Group Selection algorithm that approximately solves the microaggregation problem in $(O(N^2 \log N))$ time, based on sequential Minimization of SSE. Experimental results and comparisons to existing methods with similar computation cost on real and synthetic data sets demonstrate the high performance and robustness of the proposed scheme. [ABSTRACT FROM AUTHOR]

One of the fundamental problems in social networking with a lot of potential applications is to detect effectively the communities that are created by the users' interaction. Other applications, such as finding web communities, uncovering the structure of social networks, or even analyzing a graph's structure to uncover Internet attacks are equally as important. All these problems converge to a common goal, the development of flexible and efficient local community detection algorithms. In this paper, we demonstrate the performance of an algorithm that uncovers the entire community structure of a network, based solely on local interactions between neighboring nodes and a distributed clustering algorithm. The proposed algorithm, named VCD, is based on the distributed computation of a synthetic coordinates for each graph node. Experimental results and comparisons with another method from the literature (Lancichinetti et al.) are presented. The algorithm is also tested on two real dataset graphs from the SNAP: Stanford Large Network Dataset Collection. In all cases the experimental results demonstrate the high performance of our algorithm in terms of accuracy to detect communities, and its computational efficiency. [ABSTRACT FROM AUTHOR]

We propose a general purpose image segmentation framework, which involves feature extraction and classification in feature space, followed by flooding and merging in spatial domain. Region growing is based on the computed local measurements and distances from the distribution of features describing the different classes. Using the properties of the label dependent distances spatial coherence is ensured, since the image features are described globally. The distribution of the features for the different classes are obtained by block-wise unsupervised clustering based on the construction of the minimum spanning tree of the blocks' grid using the Mallows distance and the equipartition of the resulting tree. The final clustering is obtained by using the k-centroids algorithm. With high probability and under topological constraints, connected components of the maximum likelihood classification map are used to compute a map of initially labelled pixels. An efficient flooding algorithm is introduced, namely, Priority Multi-Class Flooding Algorithm (PMCFA), that assign pixels to labels using Bayesian dissimilarity criteria. A new region merging method, which incorporates boundary information, is introduced for obtaining the final segmentation map. Therefore, the merging stage is based on region features and edge localization. Segmentation results on the Berkeley benchmark data set demonstrate the effectiveness of the proposed methods. [ABSTRACT FROM PUBLISHER]

In this paper, we propose a method for automatic enhancement and identification of partial curvilinear structures. The accurate identification of line structures in geophysical images plays an important role in geophysical interpretation and the detection of subsurface structures. The method was applied on geophysical images in an effort to recognize the linear patterns of subsurface architectural structures that exist in archaeological sites. To our knowledge, the problem of identification of curvilinear structures in geophysical images for archaeological sites is faced for the first time. The method efficiently combines a rotation- and scale-invariant filter and a pixel-labeling method, providing a robust enhancement and detection of mostly line structures in 2-D grayscale images, respectively. Experimental results on real and synthetic images and comparison with existing methods in the literature indicated the reliable performance of the proposed scheme. [ABSTRACT FROM PUBLISHER]

Abstract: In this paper we analyze the problem of partitioning a continuous curve into n parts with equal successive chords, the curve EquiPartition problem (EP). The goal is to locate consecutive curve points, so that the curve can be divided into n segments with equal chords under a distance function. We adopt a level set approach to prove that for any continuous injective curve in a metric space and any number n there always exists at least one n-equipartition (EP). A new approximate algorithm, that is the first EP algorithm, inspired from the level set approach is proposed for finding all solutions with high accuracy. Finally, EP based applications are presented and special properties of their solutions are discussed. [Copyright &y& Elsevier]

We present a key frames selection algorithm based on three Iso-content principles (Iso-Content Distance, Iso-Content Error and Iso-Content Distortion), so that the selected key frames are equidistant-in video content according to the used principle. Two automatic approaches for defining the most appropriate number of key frames are proposed by exploiting supervised and unsupervised content criteria. Experimental results and the comparisons with existing methods from literature on large dataset of real-life video sequences illustrate the high performance of the proposed schemata. [ABSTRACT FROM AUTHOR]

We propose a method to improve the prediction performance of recommender systems via a Dual (user anditem) Training Error based Correction approach (DTEC). The proposed method is applied to the Synthetic Coordinate Recommendation system (SCoR) (Papadakis et al., 2017) and to other Ithree state-of-the-art systems. Initially, a recommender system is used Ito provide recommendations for users and items. Subsequently, we introduce a second stage, after initial execution of the recommender system, that improves its predictions taking into account the error in the training set between users and items and their similarity. These corrections can be performed from both user and item viewpoints, and finally a dual system is proposed that efficiently combines both corrections. DTEC computes a model that makes zero the recommendation error in the training set, and then applies it on the test set to improve the rating predictions. The proposed DTEC approach is applicable Ito any model-based recommender system with positive training error, potentially increasing the accuracy of the recommendations. The experimental results demonstrate the efficiency and high performance of DTEC on four well-known, real-world datasets. • DTEC takes into account the error in the training set between users and items. • A dual system efficiently combines the user and item view point corrections. • Improvement of recommendations of the SCoR system. • Applicability of DTEC on other recommender systems to improve recommendations. • High performance results on four well-known, real world datasets. [ABSTRACT FROM AUTHOR]

We present a shape-based method for automatic people detection and counting without any assumption concerning camera motion. In order to evaluate the robustness of the proposed method, we apply it for classifying athletics videos into two classes: videos of individual and videos of team sports. The videos used are real and characterized by dynamic and unconstrained environment. Moreover, in the case of team sport, we propose a shape deformations based method for running/hurdling discrimination (activity recognition). Robust, adaptive and independent from color, illumination changes and the camera motion, the proposed features are combined in the Transferable Belief Model (TBM) framework providing a two-level (frames and shot) video categorization. Experimental results of 97% of accuracy for individual/team sport categorization using a dataset of 252 real videos of athletic meetings, acquired by moving cameras under varying view angles, indicate the stability and the good performance of the proposed scheme. [ABSTRACT FROM AUTHOR]

In this paper, we propose a method for the automatic identification of P-phase arrival based on the distribution of local maxima (LM) in earthquake seismograms. The method efficiently combines energy and frequency characteristics of the LM distribution (LMD). The P detection is mainly based on the energy of a seismic event in the case the earthquake has higher amplitude than seismic background noise. Otherwise, it is based on the frequency of LM. Thus, the method provides robust detection of P-phase arrival in any quality type of seismic data. Moreover, it uses two sequential sliding signal windows yielding very high accuracy on the P-phase estimation. A hierarchical P-phase detection algorithm dramatically reduces the computational cost, making possible a real-time implementation. Experimental results from a large database of more than 80 low, medium, and high signal-to-noise ratio seismic events and comparison with existing methods in the literature indicate the reliable performance of the proposed scheme. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we present an algorithm based on equal errors principle, which solves the general version of polygonal approximation problem (GPA). The approximation nodes of GPA can be selected anywhere on the original polygonal curve, while the “classical” (usually used) polygonal approximation problem (PA) demands the vertices to be a subset of the original polygon vertices. Although the proposed algorithm does not guarantee global minimum distortion, in many cases almost optimal solutions are achieved. Moreover, it is very flexible on changes of error criteria and on curve dimension yielding an alternative and in many cases approximations with lower error (by relaxing the simplification constraint) than the optimal PA methods with about the same computation cost. [Copyright &y& Elsevier]

Abstract: The European DHX project is introduced in this paper and the vision-based 3D content authoring tools that have been implemented as a core part of its framework are presented. These tools consist mainly of two interrelated components. The first one is a hybrid (geometry and image based) modeling and rendering system capable of providing photorealistic walkthroughs of real-world large landscapes based solely on a sparse set of stereoscopic views. The second one deals with obtaining lifelike animal motion using as input captured video sequences of animal movement and prior anatomy knowledge. Both of these components have been successfully applied to a DHX research prototype aiming to create an integrated virtualized representation of the Samaria Gorge in Crete and the principal animals living in the ecosystem. [Copyright &y& Elsevier]

This work presents novel pattern recognition techniques applied on bathymetric data from two large areas in Eastern Mediterranean. Our objectives are as follows: (a) to demonstrate the efficiency of this methodology, (b) to highlight the quick and accurate detection of both hydrocarbon related tectonic lineaments and salt structures affecting seafloor morphology, and (c) to reveal new structural data in areas poised for hydrocarbon exploration. In our work, we first apply a multiple filtering and sequential skeletonization scheme inspired by the hysterisis thresholding technique. In a second stage, we categorize each linear and curvilinear segment on the seafloor skeleton (medial axis) based on the strength of detection as well as the length, direction, and spatial distribution. Finally, we compare the seafloor skeleton with ground truth data. As shown in this paper, the automatic extraction of the bathymetric skeleton allows the interpretation of the most prominent seafloor morphological features. We focus on the competent tracing of tectonic lineaments, as well as the effective distinction between seafloor features associated with shallow evaporite movements and those related to intense tectonic activity. The proposed scheme has low computational demand and decreases the cost of the marine research because it facilitates the selection of targets prior to data acquisition. [ABSTRACT FROM AUTHOR]

We present RFOVE, a region-based method for approximating an arbitrary 2D shape with an automatically determined number of possibly overlapping ellipses. RFOVE is completely unsupervised, operates without any assumption or prior knowledge on the object's shape and extends and improves the Decremental Ellipse Fitting Algorithm (DEFA) [ 1 ]. Both RFOVE and DEFA solve the multi-ellipse fitting problem by performing model selection that is guided by the minimization of the Akaike Information Criterion on a suitably defined shape complexity measure. However, in contrast to DEFA, RFOVE minimizes an objective function that allows for ellipses with higher degree of overlap and, thus, achieves better ellipse-based shape approximation. A comparative evaluation of RFOVE with DEFA on several standard datasets shows that RFOVE achieves better shape coverage with simpler models (less ellipses). As a practical exploitation of RFOVE, we present its application to the problem of detecting and segmenting potentially overlapping cells in fluorescence microscopy images. Quantitative results obtained in three public datasets (one synthetic and two with more than 4000 actual stained cells) show the superiority of RFOVE over the state of the art in overlapping cells segmentation. • 2D shape representation with an automatically determined number of overlapping ellipses • Applied on Segmentation of potentially overlapping cells • Good balance between model complexity and shape coverage • Experiments on more than 8000 2D shapes show the superiority of RFOVE. • RFOVE achieves better shape coverage with simpler models than DEFA. [ABSTRACT FROM AUTHOR]

The automatic extraction of geomorphologic features using digital elevation models (DEMs) belongs to the remote sensing techniques used to improve our understanding in a variety of disciplines in the geosciences (i.e. remote sensing, topography, geology, archaeology, oceanography and others) prior the fieldwork and later during data processing and interpretation. This approach highly contributes towards a rapid, objective and lower cost fieldwork. In the present work, recently developed techniques of pattern recognition in the context of European Projects (NEREIDs, Sea4All), are applied on digital elevation models (DEMs) from onshore and offshore areas of the Mediterranean aiming to a) demonstrate their efficiency, and b) partly compare the results of the automatic detection with geological data provided either from previous researches or ground truth data.Panagiotakis and Kokinou (2014, 2015, and 2017) have implemented the two-step methodology, to process digital elevation models. It was applied partly or in whole in previous onshore and offshore geological and environmental studies. The proposed approach is based on a) the automatic detection of topographic highs and computation of the geomorphologic features (orientation, eccentricity, average slope, and shape complexity) and b) the automatic detection of lineaments, possibly related to the presence of geological faults or other subsurface processes.The two-step methodology has been evaluated on real and synthetic digital elevation models of medium and high accuracy that correspond to onshore and offshore environment. The experimental results demonstrate the high performance of the proposed approach on several real and synthetic topographic data. In our tests major and accompanying geomorphologic structures (lineaments, geological faults, topographic highs and depressions und others) are estimated with high precision concerning their location, shape, and orientation. Furthermore, the financial cost of the fieldwork severely decreases, since prior to the fieldwork geomorphologic structures of interest are identified with great precision and scheduled to be examined. [ABSTRACT FROM AUTHOR]

In this paper, we develop a novel hybrid recommender system for the tourism domain, which combines (a) a Bayesian preferences elicitation component which operates by asking the user to rate generic images (corresponding to generic types of POIs) in order to build a user model and (b) a novel content-based (CB) recommendations component. The second component can in fact itself be considered a hybrid among two different CB algorithms, each exploiting one of two semantic similarity measures: a hierarchy-based and a non-hierarchy based one. The latter is the recently introduced Weighted Extended Jaccard Similarity (WEJS). We note that WEJS is employed for the first time within a recommender algorithm. We incorporate our algorithm within a real, already available at Google Play, tour-planning mobile application for short-term visitors of the popular touristic destination of Agios Nikolaos, Crete, Greece, and evaluate our approach via extensive simulations conducted on a real-world dataset constructed for the needs of the aforementioned mobile application. Our experiments verify that our algorithms result in effective personalized recommendations of touristic points of interest, while our final hybrid algorithm outperforms our exclusively content-based recommender algorithms in terms of recommendations accuracy. Specifically, when comparing the performance of several hybrid recommender system variants, we are able to come up with a "winner": the most preferable variant of our hybrid recommender algorithm is one using a 〈four elicitation slates, six shown images per slate〉 pair as input to its Bayesian elicitation component. This variant combines increased precision performance with a lightweight preferences elicitation process. [ABSTRACT FROM AUTHOR]

The estimation of micro-Range (m-R) is important for micro-motion feature extraction and imaging, which provides significant supports for the classification of a precession cone-shaped target. Under low signal-to-noise ratio (SNR) circumstances, the modified Kalman filter (MKF) will obtain broken segments rather than complete m-R tracks due to missing trajectories, and the performance of the MKF is restricted by unknown noise covariance. To solve these problems, a noise-robust m-R estimation method, which combines the adaptive Kalman filter (AKF) and the random sample consensus (RANSAC) algorithm, is proposed in this paper. The AKF, where the noise covariance is not required for the estimation of the state vector, is applied to associate m-R trajectories for higher estimation accuracy and lower wrong association probability. Due to missing trajectories, several associated segments which are parts of the m-R tracks can be obtained by the AKF. Then, the RANSAC algorithm is utilized to associate the segments and the complete m-R tracks can be obtained. Compared with the MKF, the proposed method can obtain complete m-R tracks instead of several segments, and avoids the influence of unknown noise covariance under low SNR circumstances. Experimental results based on electromagnetic simulation data demonstrate that the proposed method is more precise and robust compared with traditional methods. [ABSTRACT FROM AUTHOR]

A geophysical investigation was carried across the M3 burial mound from Silvașu de Jos —Dealu Țapului, a tumuli necropolis in western Romania, where the presence of the Yamnaya people was certified archaeologically. For characterizing the inner structure of the mound, two conventional geophysical methods have been used: a geomagnetic survey and electrical resistivity tomography (ERT). The results allowed the mapping of the central features of the mound and the establishment of the relative stratigraphy of the mantle, which indicated at least two chronological phases. Archaeological excavations performed in the central part of the mound accurately validated the non-invasive geophysical survey and offered a valuable chronological record of the long-forgotten archaeological monument. Geophysical approaches proved to be an invaluable instrument for the exploration of the monument and suggest a fast constructive tool for the investigation of the entire necropolis which currently has a number of distinct mounds. [ABSTRACT FROM AUTHOR]

Detailed information regarding land utilization/cover is a valuable resource in various fields. In recent years, remote sensing images, especially aerial images, have become higher in resolution and larger span in time and space, and the phenomenon that the objects in an identical category may yield a different spectrum would lead to the fact that relying on spectral features only is often insufficient to accurately segment the target objects. In convolutional neural networks, down-sampling operations are usually used to extract abstract semantic features, which leads to loss of details and fuzzy edges. To solve these problems, the paper proposes a Multi-level Feature Aggregation Network (MFANet), which is improved in two aspects: deep feature extraction and up-sampling feature fusion. Firstly, the proposed Channel Feature Compression module extracts the deep features and filters the redundant channel information from the backbone to optimize the learned context. Secondly, the proposed Multi-level Feature Aggregation Upsample module nestedly uses the idea that high-level features provide guidance information for low-level features, which is of great significance for positioning the restoration of high-resolution remote sensing images. Finally, the proposed Channel Ladder Refinement module is used to refine the restored high-resolution feature maps. Experimental results show that the proposed method achieves state-of-the-art performance 86.45% mean IOU on LandCover dataset. [ABSTRACT FROM AUTHOR]

Synthetic aperture imaging radiometers (SAIRs) are powerful passive microwave systems for high-resolution imaging by use of synthetic aperture technique. However, the ill-posed inverse problem for SAIRs makes it difficult to reconstruct the high-precision brightness temperature map. The traditional regularization methods add a unique penalty to all the frequency bands of the solution, which may cause the reconstructed result to be too smooth to retain certain features of the original brightness temperature map such as the edge information. In this paper, a multi-parameter regularization method is proposed to reconstruct SAIR brightness temperature distribution. Different from classical single-parameter regularization, the multi-parameter regularization adds multiple different penalties which can exhibit multi-scale characteristics of the original distribution. Multiple regularization parameters are selected by use of the simplified multi-dimensional generalized cross-validation method. The experimental results show that, compared with the conventional total variation, Tikhonov, and band-limited regularization methods, the multi-parameter regularization method can retain more detailed information and better improve the accuracy of the reconstructed brightness temperature distribution, and exhibit superior noise suppression, demonstrating the effectiveness and the robustness of the proposed method. [ABSTRACT FROM AUTHOR]

We present new mathematical and geological models to assist civil protection authorities in the mitigation of potential oil spill accidents in the Eastern Mediterranean Sea. Oil spill simulations for 19 existing offshore wells were carried out based on novel and high resolution bathymetric, meteorological, oceanographic, and geomorphological data. The simulations show a trend for east and northeast movement of oil spills into the Levantine Basin, affecting the coastal areas of Israel, Lebanon and Syria. Oil slicks will reach the coast in 1 to 20 days, driven by the action of the winds, currents and waves. By applying a qualitative analysis, seabed morphology is for the first time related to the direction of the oil slick expansion, as it is able to alter the movement of sea currents. Specifically, the direction of the major axis of the oil spills, in most of the cases examined, is oriented according to the prevailing azimuth of bathymetric features. This work suggests that oil spills in the Eastern Mediterranean Sea should be mitigated in the very few hours after their onset, and before wind and currents disperse them. We explain that protocols should be prioritized between neighboring countries to mitigate any oil spills. [ABSTRACT FROM AUTHOR]

No abstract received. [ABSTRACT FROM AUTHOR]