Computer Vision – ECCV 2018. 15th European Conference, Munich, Germany, September 8–14, 2018, Proceedings, Part XII
The sixteen-volume set comprising the LNCS volumes 11205-11220 constitutes the refereed proceedings of the 15th European Conference on Computer Vision, ECCV 2018, held in Munich, Germany, in September 2018. The 776 revised papers presented were carefully reviewed and selected from 2439 submissions. The papers are organized in topical sections on learning for vision; computational photography; human analysis; human sensing; stereo and reconstruction; optimization; matching and recognition; video attention; and poster sessions.
We present a new combined approach for monocular model-based 3D tracking. A preliminary object pose is estimated by using a keypoint-based technique. The pose is then refined by optimizing the contour energy function. The energy determines the degree of correspondence between the contour of the model projection and the image edges. It is calculated based on both the intensity and orientation of the raw image gradient. For optimization, we propose a technique and search area constraints that allow overcoming the local optima and taking into account information obtained through keypoint-based pose estimation. Owing to its combined nature, our method eliminates numerous issues of keypoint-based and edge-based approaches. We demonstrate the efficiency of our method by comparing it with state-of-the-art methods on a public benchmark dataset that includes videos with various lighting conditions, movement patterns, and speed.
The article discusses one argument in favor of descriptive theory of reference of proper names against the theory of direct reference which appeals to a famous example of the ship of Theseus. The author defends the latter theory by means of distinguishing the object of direct reference and its principles of individuation. The argument is discussed with reference to the works of H. Chandler, L. Linsky, S. Kripke, N. Salmon and other theorists.
The volume contains the abstracts of the 12th International Conference "Intelligent Data Processing: Theory and Applications". The conference is organized by the Russian Academy of Sciences, the Federal Research Center "Informatics and Control" of the Russian Academy of Sciences and the Scientific and Coordination Center "Digital Methods of Data Mining". The conference has being held biennially since 1989. It is one of the most recognizable scientific forums on data mining, machine learning, pattern recognition, image analysis, signal processing, and discrete analysis. The Organizing Committee of IDP-2018 is grateful to Forecsys Co. and CFRS Co. for providing assistance in the conference preparation and execution. The conference is funded by RFBR, grant 18-07-20075. The conference website http://mmro.ru/en/.
This is an interdisciplinary volume that focuses on the central topic of the representation of events, namely cross-cultural differences in representing time and space, as well as various aspects of the conceptualisation of space and time. It brings together research on space and time from a variety of angles, both theoretical and methodological. Crossing boundaries between and among disciplines such as linguistics, psychology, philosophy, or anthropology forms a creative platform in a bold attempt to reveal the complex interaction of language, culture, and cognition in the context of human communication and interaction.
The authors address the nature of spatial and temporal constructs from a number of perspectives, such as cultural specificity in determining time intervals in an Amazonian culture, distinct temporalities in a specific Mongolian hunter community, Russian-specific conceptualisation of temporal relations, Seri and Yucatec frames of spatial reference, memory of events in space and time, and metaphorical meaning stemming from perception and spatial artefacts, to name but a few themes.
In the paper we present a new notion of stochastic monotone measure and its application to image processing. By definition, a stochastic monotone measure is a random value with values in the set of monotone measures and it can describe a choice of random features in image processing. In this case, a monotone measure describes uncertainty in the problem of choosing the set of features with the highest value of informativeness and its stochastic behavior is explained by a noise that can corrupt images.
We investigate the specific problem of machine vision, namely, video-based detection of the moving forklift truck. It is shown that the detection quality of the state-of-the-art local descriptors (SURF, SIFT, etc.) is not satisfactory if the resolution is low and the illumination is changed dramatically. In this paper, we propose to use a simple mathematical morphological algorithm to detect the presence of a cargo on the forklift truck. At first, the movement direction is estimated by the updating motion history image method and the front part of the moving object is obtained. Next, contours are detected and morphological operations in front of the moving object are used to estimate simple geometric features of empty forklift. In the experimental study it has been shown that the proposed method has 40% lower FAR and 27% lower FRR in comparison with conventional matching of local descriptors. Moreover, our algorithm is 7 times faster.
The paper theorizes on the general architectonics of idealized cognitive models (ICMs) and their involvement in metonymy and metaphor. The article posits that an ICM's structure should reflect the architecture of the neural network/s engaged in processing of a given concept. The ICM nodes, or cogs, construct a complex, hierarchically organized neural connections, with the superior nodes being highly selective, invariant and prototypical. Signals travelling from one cog to another within one ICM are essentially metonymical, while a cog shared by two or more ICMs marks a metaphoric shift.
A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traﬃc is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the ﬁnal node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a ﬁnite-dimensional system of diﬀerential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of diﬀerential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.
Event logs collected by modern information and technical systems usually contain enough data for automated process models discovery. A variety of algorithms was developed for process models discovery, conformance checking, log to model alignment, comparison of process models, etc., nevertheless a quick analysis of ad-hoc selected parts of a journal still have not get a full-fledged implementation. This paper describes an ROLAP-based method of multidimensional event logs storage for process mining. The result of the analysis of the journal is visualized as directed graph representing the union of all possible event sequences, ranked by their occurrence probability. Our implementation allows the analyst to discover process models for sublogs defined by ad-hoc selection of criteria and value of occurrence probability
The geographic information system (GIS) is based on the first and only Russian Imperial Census of 1897 and the First All-Union Census of the Soviet Union of 1926. The GIS features vector data (shapefiles) of allprovinces of the two states. For the 1897 census, there is information about linguistic, religious, and social estate groups. The part based on the 1926 census features nationality. Both shapefiles include information on gender, rural and urban population. The GIS allows for producing any necessary maps for individual studies of the period which require the administrative boundaries and demographic information.
It is well-known that the class of sets that can be computed by polynomial size circuits is equal to the class of sets that are polynomial time reducible to a sparse set. It is widely believed, but unfortunately up to now unproven, that there are sets in EXPNP, or even in EXP that are not computable by polynomial size circuits and hence are not reducible to a sparse set. In this paper we study this question in a more restricted setting: what is the computational complexity of sparse sets that are selfreducible? It follows from earlier work of Lozano and Torán (in: Mathematical systems theory, 1991) that EXPNP does not have sparse selfreducible hard sets. We define a natural version of selfreduction, tree-selfreducibility, and show that NEXP does not have sparse tree-selfreducible hard sets. We also construct an oracle relative to which all of EXP is reducible to a sparse tree-selfreducible set. These lower bounds are corollaries of more general results about the computational complexity of sparse sets that are selfreducible, and can be interpreted as super-polynomial circuit lower bounds for NEXP.