this work discusses the issue of approximation in point set matching. In general, one may have two classes of approximations when tackling a matching problem: (1) an algorithmic approximation which consists in using s...
详细信息
this work discusses the issue of approximation in point set matching. In general, one may have two classes of approximations when tackling a matching problem: (1) an algorithmic approximation which consists in using suboptimal procedures to infer the assignment, and (2), a representational approximation which involves a simplified and suboptimal model for the original data. Matching techniques have typically relied on the first approach by retaining the complete model and using suboptimal techniques to solve it. In this paper, we show how a technique based on using exact inference in simple graphical Models, an instance of the second class, can significantly outperform instances of techniques from the first class. We experimentally compare this method with well-known Spectral and Relaxation methods, which are exemplars of the first class. We have performed experiments with synthetic and real-world data sets which reveal significant performance improvement in a wide operating range. (c) 2005patternrecognition Society. Published by Elsevier Ltd. All rights reserved.
the patternrecognition problem in Ring Imaging CHerenkov (RICH) Counters concerns the identification of art unknown number of rings whose centers and radii are assumed to be unknown. In this paper we present art algo...
详细信息
the patternrecognition problem in Ring Imaging CHerenkov (RICH) Counters concerns the identification of art unknown number of rings whose centers and radii are assumed to be unknown. In this paper we present art algorithm based oil the possibilistic approach to Clustering that automatically finds boththe number of rings and their position without any a priori knowledge. the algorithm has been tested oil realistic Monte Carlo LHCb simulated events and it has been shown very powerful in detecting complex images full of rings. the tracking-independent algorithm Could be usefully employed after a track based approach to identify remaining trackless rings. (C) 2005 Elsevier Inc. All rights reserved.
作者：
Bloch, ILTCI
Ecole Natl Super Telecommun CNRS UMR 5141Dept TSI F-75013 Paris France
We show in this paper that mathematical morphology provides a unified and consistent framework to express different types of spatial relationships and to answer different questions about them, with good properties. We...
详细信息
ISBN:
(纸本)3540310193
We show in this paper that mathematical morphology provides a unified and consistent framework to express different types of spatial relationships and to answer different questions about them, with good properties. We show then how to use these fuzzy relationships in model-basedpatternrecognition and spatial reasoning under imprecision. Two examples are presented, one where recognition of face features is expressed as non bijective correspondence between graphs representing regions and spatial relations, and one where anatomical expert knowledge involving spatial relationships is used to guide the recognition of brain structures.
the patternrecognition problem in Ring Imaging CHerenkov (RICH) Counters concerns the identification of art unknown number of rings whose centers and radii are assumed to be unknown. In this paper we present art algo...
详细信息
the patternrecognition problem in Ring Imaging CHerenkov (RICH) Counters concerns the identification of art unknown number of rings whose centers and radii are assumed to be unknown. In this paper we present art algorithm based oil the possibilistic approach to Clustering that automatically finds boththe number of rings and their position without any a priori knowledge. the algorithm has been tested oil realistic Monte Carlo LHCb simulated events and it has been shown very powerful in detecting complex images full of rings. the tracking-independent algorithm Could be usefully employed after a track based approach to identify remaining trackless rings. (C) 2005 Elsevier Inc. All rights reserved.
A grouping method of the similar words, is proposed for the classification of documents, which is applied to Reuters international news and it is shown that the grouping of words has equivalent ability to the Latent S...
详细信息
the following topics are dealt with: parallel and distributed computing; software metrics and project management; communication systems and networks; data mining; data warehousing; information management systems; Inte...
the following topics are dealt with: parallel and distributed computing; software metrics and project management; communication systems and networks; data mining; data warehousing; information management systems; Internet; mobile computing; wireless computing; software engineering; information engineering; management information systems; image processing and patternrecognition; computer architecture and software testing; artificial intelligence; intelligent agent technology; Web engineering
A grouping method of the similar words is proposed for the classification of documents, which is applied to Reuters international news and it is shown that the grouping of words has equivalent ability to the latent se...
详细信息
A grouping method of the similar words is proposed for the classification of documents, which is applied to Reuters international news and it is shown that the grouping of words has equivalent ability to the latent semantic analysis (LSA) in the classification accuracy. Further, a new combining method is proposed for the documents classification, which consists of grouping, latent semantic analysis followed by the k-nearest neighbor classification (k-NN). the combining method proposed here, shows the higher accuracy in the classification than the conventional methods of the kNN, and the LSA followed by the kNN
A fast algorithm is proposed for polygonal approximation of a digitized curve based on genetic evolution. the polygon is represented by a set of dominant points. the dominant points are identified as the points on the...
详细信息
A fast algorithm is proposed for polygonal approximation of a digitized curve based on genetic evolution. the polygon is represented by a set of dominant points. the dominant points are identified as the points on the curve with local maximum curvatures. the optimization problem for the digitized curve withthe approximating polygon is employing the genetic algorithm. thus, a chromosome is used to represent a polygon. the break point detection on the chromosome is conducted to reduce the computations for optimization. Experimental results are included to show the effectiveness of this method
Conveying information secretly and establishing hidden relationship has been of interest since long past. Text documents have been widely used since very long time ago. therefore, we have witnessed different method of...
详细信息
Conveying information secretly and establishing hidden relationship has been of interest since long past. Text documents have been widely used since very long time ago. therefore, we have witnessed different method of hiding information in texts (text steganography) since past to the present. In this paper we introduce a new approach for steganography in Persian and Arabic texts. Considering the existence of too many points in Persian and Arabic phrases, in this approach, by vertical displacement of the points, we hide information in the texts. this approach can be categorized under feature coding methods. this method can be used for Persian/Arabic watermarking. Our method has been implemented by Java programming language
In this paper, we discuss the notion of consistency in inexact graph matching to be able to correctly determine the optimal solution of the matching problem. Consistency allows us to study the cost function which cont...
详细信息
ISBN:
(纸本)3540252703
In this paper, we discuss the notion of consistency in inexact graph matching to be able to correctly determine the optimal solution of the matching problem. Consistency allows us to study the cost function which controls the graph matching process, regardless of the optimization technique that is used. the analysis is performed in the context of change detection in geospatial information. A condition based on the expected graph error is presented which allows to determine the bounds of error tolerance and in this way characterizes acceptable over inacceptable data inconsistencies.
暂无评论