182 research outputs found
A Compact and Complete AFMT Invariant with Application to Face Recognition
In this paper, we present a complete set of hybrid
similarity invariants under the Analytical Fourier-Mellin
Transform (AFMT) framework, and apply it to invariant face
recognition. Because the magnitude and phase spectra are not
processed separately, this invariant descriptor is complete. In order to simplify the invariant feature data for recognition and discrimination, a 2D-PCA approach is introduced into this complete invariant descriptor. The experimental results indicate that the presented invariant descriptor is complete and similarityinvariant. Its compact representation through the 2D-PCA preserves the essential structure of an object. Furthermore, we apply this compact form into ORL, Yale and BioID face databases for experimental verification, and achieve the desired results
Enhanced Integrated Scoring for Cleaning Dirty Texts
An increasing number of approaches for ontology engineering from text are
gearing towards the use of online sources such as company intranet and the
World Wide Web. Despite such rise, not much work can be found in aspects of
preprocessing and cleaning dirty texts from online sources. This paper presents
an enhancement of an Integrated Scoring for Spelling error correction,
Abbreviation expansion and Case restoration (ISSAC). ISSAC is implemented as
part of a text preprocessing phase in an ontology engineering system. New
evaluations performed on the enhanced ISSAC using 700 chat records reveal an
improved accuracy of 98% as compared to 96.5% and 71% based on the use of only
basic ISSAC and of Aspell, respectively.Comment: More information is available at
http://explorer.csse.uwa.edu.au/reference
Determining the Unithood of Word Sequences using Mutual Information and Independence Measure
Most works related to unithood were conducted as part of a larger effort for
the determination of termhood. Consequently, the number of independent research
that study the notion of unithood and produce dedicated techniques for
measuring unithood is extremely small. We propose a new approach, independent
of any influences of termhood, that provides dedicated measures to gather
linguistic evidence from parsed text and statistical evidence from Google
search engine for the measurement of unithood. Our evaluations revealed a
precision and recall of 98.68% and 91.82% respectively with an accuracy at
95.42% in measuring the unithood of 1005 test cases.Comment: More information is available at
http://explorer.csse.uwa.edu.au/reference
An extension of min/max flow framework
In this paper, the min/max flow scheme for image restoration is revised. The novelty consists of the fol-
24 lowing three parts. The first is to analyze the reason of the speckle generation and then to modify the
25 original scheme. The second is to point out that the continued application of this scheme cannot result
26 in an adaptive stopping of the curvature flow. This is followed by modifications of the original scheme
27 through the introduction of the Gradient Vector Flow (GVF) field and the zero-crossing detector, so as
28 to control the smoothing effect. Our experimental results with image restoration show that the proposed
29 schemes can reach a steady state solution while preserving the essential structures of objects. The third is
30 to extend the min/max flow scheme to deal with the boundary leaking problem, which is indeed an
31 intrinsic shortcoming of the familiar geodesic active contour model. The min/max flow framework pro-
32 vides us with an effective way to approximate the optimal solution. From an implementation point of
33 view, this extended scheme makes the speed function simpler and more flexible. The experimental
34 results of segmentation and region tracking show that the boundary leaking problem can be effectively
35 suppressed
A generic implementation framework for stereo matching algorithms
Traditional area-based matching techniques make use of similarity metrics such as the Sum of Absolute Differences(SAD), Sum of Squared Differences (SSD) and Normalised Cross Correlation (NCC). Non-parametric matching algorithms such as the rank and census rely on the relative ordering of pixel values rather than the pixels themselves as a similarity measure. Both traditional area-based and non-parametric stereo matching techniques have an algorithmic structure which is amenable to fast hardware realisation. This investigation undertakes a performance assessment of these two families of algorithms for robustness to radiometric distortion and random noise. A generic implementation framework is presented for the stereo matching problem and the relative hardware requirements for the various metrics investigated
- ā¦