We introduce a method for computing homology groups and their generators of a 2D image, using a hierarchical structure i.e. irregular graph pyramid. Starting from an image, a hierarchy of the image is built, by two op...
详细信息
ISBN:
(纸本)9783540729020
We introduce a method for computing homology groups and their generators of a 2D image, using a hierarchical structure i.e. irregular graph pyramid. Starting from an image, a hierarchy of the image is built, by two operations that preserve homology of each region. Instead of computing homology generators in the base where the number of entities (cells) is large, we first reduce the number of cells by a graph pyramid. then homology generators are computed efficiently on the top level of the pyramid, since the number of cells is small, and a top down process is then used to deduce homology generators in any level of the pyramid, including the base level i.e. the initial image. We show that the new method produces valid homology generators and present some experimental results.
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by its generalized median, i.e., the strin...
详细信息
ISBN:
(纸本)9783540729020
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by its generalized median, i.e., the string -over the set of all possible strings- that minimizes the sum of distances to every string of the set, or by its set median, i.e., the string of the set that minimizes the sum of distances to every other string of the set. For the first two histogram-based distances, we show that the generalized median string can be computed efficiently;for the third one, which biased histograms with individual substitution costs, we conjecture that this is a NP-hard problem, and we introduce two different heuristic algorithms for approximating it. We experimentally compare the relevance of the three histogram-based distances, and the different statistical characterizations of sets of strings, for classifying images that are represented by strings.
the traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of cities, the problem is approximated int...
详细信息
ISBN:
(纸本)9783540729020
the traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of cities, the problem is approximated into a simpler form containing smaller number of cities, which is then solved optimally. graph pyramid solution strategies, in a bottom-up manner using Boruvka's minimum spanning tree, convert a 2D Euclidean TSP problem with a large number of cities into successively smaller problems (graphs) with similar layout and solution, until the number of cities is small enough to seek the optimal solution. Expanding this tour solution in a top-down manner to the lower levels of the pyramid approximates the solution. the new model has an adaptive spatial structure and it simulates visual acuity and visual attention. the model solves the TSP problem sequentially, by moving attention from city to city withthe same quality as humans. graph pyramid data structures and processing strategies are a plausible model for finding near-optimal solutions for computationally hard patternrecognition problems.
It has been demonstrated that the difficult problem of classifying heterogeneous projection images, similar to those found in 3D electron microscopy (3D-EM) of macromolecules, can be successfully solved by finding an ...
详细信息
ISBN:
(纸本)9783540729020
It has been demonstrated that the difficult problem of classifying heterogeneous projection images, similar to those found in 3D electron microscopy (3D-EM) of macromolecules, can be successfully solved by finding an approximate Max k-Cut of an appropriately constructed weighted graph. Despite of the large size (thousands of nodes) of the graph and the theoretical computational complexity of finding even an approximate Max k-Cut, an algorithm has been proposed that finds a good (from the classification perspective) approximate solution within several minutes (running on a standard PC). However, the task of constructing the complete weighted graph (that represents an instance of the projection image classification problems) is computationally expensive. Due to the large number of edges, the computation of edge weights can take tens of hours for graphs containing several thousand nodes. We propose a method, which utilizes an early termination technique, to significantly reduce the computational cost of constructing such graphs. We compare, on synthetic data sets that resemble projection sets encountered in 3D-EM, the performance of our method withthat of a brute-force approach and a method based on nearest neighbor search.
the proceedings contain 18 papers. the topics discussed include: learning extractors from unlabeled text using relevant databases;information integration for the masses;a platform for scalable, collaborative, structur...
详细信息
ISBN:
(纸本)9781577353416
the proceedings contain 18 papers. the topics discussed include: learning extractors from unlabeled text using relevant databases;information integration for the masses;a platform for scalable, collaborative, structured information integration;author disambiguation using error-driven machine learning with a ranking loss function;efficient strategies for improving partitioning-based author coreference by incorporating web pages as graph nodes;query rewriting for semantic web information integration;using regulatory instructions for information extraction;name disambiguation using web connection;on the stable marriage of maximum weight royal couples;mining heterogeneous transformations for record linkage;probabilistic representations for integrating unreliable data sources;and exploiting social annotation for automatic resource discovery.
Ontology mapping tools typically employ combinations of methods, the mutual effects of which deserve study. We propose an approach to analysis of such combinations using synthetic ontologies. Initial experiments have ...
详细信息
Ontology mapping tools typically employ combinations of methods, the mutual effects of which deserve study. We propose an approach to analysis of such combinations using synthetic ontologies. Initial experiments have been carried out for two string-based and one graph-based method. Most important target of the study was the impact of name patterns over taxonomy paths on the mapping results.
the ability to associate images is the basis for learning relationships involving vision, hearing, tactile sensation, and kinetic motion. A new architecture is described that has only local, recurrent connections, but...
详细信息
ISBN:
(纸本)9781424413270
the ability to associate images is the basis for learning relationships involving vision, hearing, tactile sensation, and kinetic motion. A new architecture is described that has only local, recurrent connections, but can directly form global image associations. this architecture has many similarities to the structure Of the neocortex, including the division into Brodmann areas, the distinct internal and external lamina, and the pattern of neuron interconnection. Analogous to the bits in an SR flip-flop, two arbitrary images can hold each other in place in an association processor and thereby form a short-term image memory. Overlay masks can focus attention on specific image regions. Spherically symmetric wavelets, identical to those found in the receptive fields of the retina, enable efficient image computations. Stability and noise reduction in reciprocal continuous wavelet transform representations can be achieved using an orthogonal projection based on the reproducing kernel.
Wildlife lies in vast and wide areas where human gamekeepers work as protectors. the task of recognizing poachers in protected areas is tedious, tiring, and requires huge manpower and computational overhead. A fully a...
详细信息
ISBN:
(纸本)9780980446005
Wildlife lies in vast and wide areas where human gamekeepers work as protectors. the task of recognizing poachers in protected areas is tedious, tiring, and requires huge manpower and computational overhead. A fully automated system cannot accurately identify every such poacher. this paper proposes a conceptual system based on sensor network, which will provide amusement for cyberspace gamekeepers while protecting the wildlife. For this, the sensory data from the park is mapped to a game-like virtual environment. Cyberspace gamekeepers will access the system and play the game. While playing, they will help to conserve the wildlife in national parks by patternrecognition of intruders in the game. the sensor network in the proposed system will use microphone, accelerometers and wireless transmission system.
Statistical patternrecognition applications have gained considerable attention in to detect structural changes (i.e. damage) that occur over time. Outlier analysis of the features/metrics obtained from the structural...
详细信息
ISBN:
(纸本)9781932078718
Statistical patternrecognition applications have gained considerable attention in to detect structural changes (i.e. damage) that occur over time. Outlier analysis of the features/metrics obtained from the structural health monitoring (SHM) data is used to detect the changes in the structural condition. One of the most challenging aspects of structural condition evaluation of existing constructed facilities by experimental data could be considered as the stochastic nature of the problem. Most of the time, the inherent uncertainties, such as due to environmental effects, can mask the evidence of structural change in the data. Detection of the structural changes is also very dependent on the redundancy of the structure and the level of damage. In this study, a two span 18 ft by 6 ft steel grid is used for different levels of damage on this redundant structure to investigate the effectiveness of statistical methods that have shown promise on other structures. Ambient vibration data is collected. this study accompanies time series modeling (Auto-Regressive model) of response data with a Mahalanobis distance based outlier detection algorithm to detect the structural changes/damage. After explaining the theoretical background of the methodology, example results coming from laboratory tests are presented in a comparative fashion.
Presented paper deals withthe problem of design transform based invariant associative image memory. Invariant feature selection is solved using the Trace transform and the Karhunen -Loeve transform (TT-KLT). System p...
详细信息
Presented paper deals withthe problem of design transform based invariant associative image memory. Invariant feature selection is solved using the Trace transform and the Karhunen -Loeve transform (TT-KLT). System performance was evaluated in experiments with original images and their different modifications.
暂无评论