Michael Kovalerchuk
Central Washington University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Michael Kovalerchuk.
Algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery X | 2004
Boris Kovalerchuk; William Q. Sumner; Mark Curtiss; Michael Kovalerchuk; Richard Chase
The problems of imagery registration, conflation, fusion and search require sophisticated and robust methods. An algebraic approach is a promising new option for developing such methods. It is based on algebraic analysis of features represented as polylines. The problem of choosing points when attempting to prepare a linear feature for comparison with other linear features is a significant challenge when orientation and scale is unknown. Previously we developed an invariant method known as Binary Structural Division (BSD). It is shown to be effective in comparing feature structure for specific cases. In cases where a bias of structure variability exists however, this method performs less well. A new method of Shoulder Analysis (SA) has been found which enhances point selection, and improves the BSD method. This paper describes the use of shoulder values, which compares the actual distance traveled along a feature to the linear distance from the start to finish of the segment. We show that shoulder values can be utilized within the BSD method, and lead to improved point selection in many cases. This improvement allows images of unknown scale and orientation to be correlated more effectively.
Proceedings of SPIE | 2009
Peter Doucette; Boris Kovalerchuk; Michael Kovalerchuk; Robert T. Brigantic
The methods used to evaluate automation tools are a critical part of the development process. In general, the most meaningful measure of an automation method from an operational standpoint is its effect on productivity. Both timed comparison between manual and automation based-extraction, as well as measures of spatial accuracy are needed. In this paper, we introduce the notion of correspondence to evaluate spatial accuracy of an automated update method. Over time, existing vector data becomes outdated because 1) land cover changes occur, or 2) more accurate overhead images are acquired, and/or vector data resolution requirements by the user may increase. Therefore, an automated vector data updating process has the potential to significantly increase productivity, particularly as existing worldwide vector database holdings increase in size, and become outdated more quickly. In this paper we apply the proposed evaluation methodology specifically to the process of automated updating of existing road centerline vectors. The operational scenario assumes that the accuracy of the existing vector data is in effect outdated with respect to newly acquired imagery. Whether the particular approach used is referred to as 1) vector-to-image registration, or 2) vector data updating-based automated feature extraction (AFE), it is open to interpretation of the application and bias of the developer or user. The objective of this paper is to present a quantitative and meaningful evaluation methodology of spatial accuracy for automated vector data updating methods.
Algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery XIV | 2008
Boris Kovalerchuk; Peter Doucette; Gamal H. Seedahmed; Robert Brigantic; Michael Kovalerchuk; Brian Graff
The variability of panchromatic and multispectral images, vector data (maps) and DEM models is growing. Accordingly, the requests and challenges are growing to correlate, match, co-register, and fuse them. Data to be integrated may have inaccurate and contradictory geo-references or not have them at all. Alignment of vector (feature) and raster (image) geospatial data is a difficult and time-consuming process when transformational relationships between the two are nonlinear. The robust solutions and commercial software products that address current challenges do not yet exist. In the proposed approach for Vector-to-Raster Registration (VRR) the candidate features are auto-extracted from imagery, vectorized, and compared against existing vector layer(s) to be registered. Given that available automated feature extraction (AFE) methods quite often produce false features and miss some features, we use additional information to improve AFE. This information is the existing vector data, but the vector data are not perfect as well. To deal with this problem the VRR process uses an algebraic structural algorithm (ASA), similarity transformation of local features algorithm (STLF), and a multi-loop process that repeats (AFE-VRR) process several times. The experiments show that it was successful in registering road vectors to commercial panchromatic and multi-spectral imagery.
international symposium on neural networks | 2017
Boris Kovalerchuk; Michael Kovalerchuk
The Big data challenge includes dealing with a big number of heterogeneous and multidimensional datasets of all possible sizes not only with data of big size. As a result a huge number of Machine Learning (ML) tasks, which must be solved dramatically exceeds the number of data scientists who can solve these tasks. Next many ML tasks require critical input from subject matter experts (SME) and end users/decision makers who are not ML experts. A set of tools that we call a “virtual data scientist” is needed to assist SMEs and end users to construct ML models for their tasks to meet this Big data challenge with a minimal contribution from data scientists. This paper describes our vision of such a “virtual data scientist” based on the visual approach with collocated and shifted paired coordinates. The approach is illustrated with real world data and ML tasks, as well as simulated data.
Algorithms and technologies for multispectral, hyperspectral, and ultraspectral imagery. Conference | 2005
Boris Kovalerchuk; Michael Kovalerchuk; William Q. Sumner; Adam Haase
The problem of imagery registration/conflation and change detection requires sophisticated and robust methods to produce better image fusion, target recognition, and tracking. Ideally these methods should be invariant to arbitrary image affine transformations. A new abstract algebraic structural invariant approach with area ratios can be used to identify corresponding features in two images and use them for registration/conflation. Area ratios of specific features do not change when an image is rescaled or skewed by an arbitrary affine transformation. Variations in area ratios can also be used to identify features that have moved and to provide measures of image registration/conflation quality. Under more general transformations, area ratios are not preserved exactly, but in practice can often still be effectively used. The theory of area ratios is described and three examples of registration/conflation and change detection are described.
CISST | 2004
Boris Kovalerchuk; Artemus Harper; Michael Kovalerchuk; Jon Brown
The unique human expertise in imagery analysis should be preserved and shared with other imagery analysts to improve image analysis and decision-making. Such knowledge can serve as a corporate memory and be a base for an imagery virtual expert. The core problem in reaching this goal is constructing a methodology and tools that can assist in building the knowledge base of imagery analysis. This paper provides a framework for an imagery virtual expert system that supports imagery registration and conflation tasks. The approach involves two strategies: (1) recording expertise onthe-fly and (2) extracting information from the expert system in an optimized way. The second strategy is based on the theory of monotone Boolean functions.
Archive | 2004
Boris Kovalerchuk; Jon Brown; Michael Kovalerchuk
This chapter addresses the problem of visually correlating objects and events. A new Bruegel visual correlation system based on an iconographic language that permits a compact information representation is described. The description includes the Bruegel concept, functionality, the ability to compress information via iconic semantic zooming, and dynamic iconic sentences. The chapter provides a brief description of Bruegel architecture and tools. The formal Bruegel iconic language for automatic icon generation is outlined. The second part of the chapter is devoted to case studies that describe how Bruegel iconic architecture can be used for the visual correlation of terrorist events, for file system navigation, for the visual correlation of drug traffic and other criminal records, for the visual correlation of real estate and job markets offerings, and for the visual correlation of medical research, diagnosis, and treatment.
Proceedings of SPIE | 2013
Boris Kovalerchuk; Michael Kovalerchuk; Simon Streltsov; Matthew Best
Automated Feature Extraction (AFE) plays a critical role in image understanding. Often the imagery analysts extract features better than AFE algorithms do, because analysts use additional information. The extraction and processing of this information can be more complex than the original AFE task, and that leads to the “complexity trap”. This can happen when the shadow from the buildings guides the extraction of buildings and roads. This work proposes an AFE algorithm to extract roads and trails by using the GMTI/GPS tracking information and older inaccurate maps of roads and trails as AFE guides.
Proceedings of SPIE | 2012
Boris Kovalerchuk; Leonid I. Perlovsky; Michael Kovalerchuk
Geospatial data analysis relies on Spatial Data Fusion and Mining (SDFM), which heavily depend on topology and geometry of spatial objects. Capturing and representing geometric characteristics such as orientation, shape, proximity, similarity, and their measurement are of the highest interest in SDFM. Representation of uncertain and dynamically changing topological structure of spatial objects including social and communication networks, roads and waterways under the influence of noise, obstacles, temporary loss of communication, and other factors. is another challenge. Spatial distribution of the dynamic network is a complex and dynamic mixture of its topology and geometry. Historically, separation of topology and geometry in mathematics was motivated by the need to separate the invariant part of the spatial distribution (topology) from the less invariant part (geometry). The geometric characteristics such as orientation, shape, and proximity are not invariant. This separation between geometry and topology was done under the assumption that the topological structure is certain and does not change over time. New challenges to deal with the dynamic and uncertain topological structure require a reexamination of this fundamental assumption. In the previous work we proposed a dynamic logic methodology for capturing, representing, and recording uncertain and dynamic topology and geometry jointly for spatial data fusion and mining. This work presents a further elaboration and formalization of this methodology as well as its application for modeling vector-to-vector and raster-to-vector conflation/registration problems and automated feature extraction from the imagery.
Archive | 2005
Michael Kovalerchuk; Boris Kovalerchuk