This study proposed an approach to retrieve images based on texture features using GLCM and image subblocks. Each image is divided into three rows and three columns with equal sizes. Texture features are extracted based on GLCM (Gray Level Co-occurrence Matrix) using four statistical features that is contrast, homogeneity, energy and correlation. The features are calculated in four directions (...

In layout problem of manufacturing cells, rectangular cells to be positioned without overlapping. The objective is to minimize the total transportation cost. The types of layouts are categorized according to the shape of the transportation system’s track. In the case of a closed loop layout, the track has a rectangular shape. A common difficulty of all layout problems is the manner in which dis...

With the advent of big data, there is a growing demand for smart algorithms that can extract relevant information from high-dimensional large data sets, potentially corrupted by faulty measurements (outliers). In this context, we present a novel line of research that utilizes the robust nature of L1-norm subspaces for data dimensionality reduction and outlier processing. Specifically, (i) we us...

Fast indexing in time sequence databases for similarity searching has attracted a lot of research recently. Most of the proposals, however, typically centered around the Euclidean distance and its derivatives. We examine the problem of multi-modal similarity search in which users can choose the best one from multiple similarity models for their needs. In this paper, we present a novel and fast ...

Geometric spanner is a fundamental structure in computational geometry and plays an important role in many geometric networks design applications. In this paper, we consider a generalization of the classical geometric spanner problem (called segment spanner): Given a set S of disjoint 2-D segments, find a spanning network G with minimum size so that for any pair of points in S, there exists a p...

Vector quantization (VQ) is a well-known method for image compression but its encoding process is very heavy computationally. In order to speed up VQ encoding, it is most important to avoid unnecessary Euclidean distance computations (k-D) as much as possible by a lighter (no multiplication operation) difference check first that uses simpler features (low dimensional) while the searching is goi...

The Johnson-Lindenstrauss Lemma shows that any set of n points in Euclidean space can be mapped linearly down to O((log n)/ǫ) dimensions such that all pairwise distances are distorted by at most 1 + ǫ. We study the following basic question: Does there exist an analogue of the JohnsonLindenstrauss Lemma for the l1 norm? Note that Johnson-Lindenstrauss Lemma gives a linear embedding which is inde...

The dilation of a geometric graph is the maximum, over all pairs of points in the graph, of the ratio of the Euclidean length of the shortest path between them in the graph and their Euclidean distance. We consider a generalized version of this notion, where the nodes of the graph are not points but axis-parallel rectangles in the plane. The arcs in the graph are horizontal or vertical segments...

This review is based on a manuscript of 67 pages corresponding to the Master’s thesis of Jan Vakula. The work of this thesis was performed in the Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, under the supervision of Dr. Tomáš Svoboda. The goal of this thesis was to test and improve a visual odometry algorithm developed by Jiri Divis in his ...

The increasing number of digitized texts presently available notably on the Web has developed an acute need in text mining techniques. Clustering systems are used more and more often in text mining, especially to analyze texts and to extract knowledge they contain. With the availability of the vast amount of clustering algorithms and techniques, it becomes highly confusing to a user to choose t...