2,226 research outputs found
Neural Networks for Fingerprint Recognition
After collecting a data base of fingerprint images, we design a neural network algorithm for fingerprint recognition. When presented with a pair of fingerprint images, the algorithm outputs an estimate of the probability that the two images originate from the same finger. In one experiment, the neural network is trained using a few hundred pairs of images and its performance is subsequently tested using several thousand pairs of images originated from a subset of the database corresponding to 20 individuals. The error rate currently achieved is less than 0.5%. Additional results, extensions, and possible applications are also briefly discussed
Kansas environmental and resource study: A Great Plains model
There are no author-identified significant results in this report
Fused Text Segmentation Networks for Multi-oriented Scene Text Detection
In this paper, we introduce a novel end-end framework for multi-oriented
scene text detection from an instance-aware semantic segmentation perspective.
We present Fused Text Segmentation Networks, which combine multi-level features
during the feature extracting as text instance may rely on finer feature
expression compared to general objects. It detects and segments the text
instance jointly and simultaneously, leveraging merits from both semantic
segmentation task and region proposal based object detection task. Not
involving any extra pipelines, our approach surpasses the current state of the
art on multi-oriented scene text detection benchmarks: ICDAR2015 Incidental
Scene Text and MSRA-TD500 reaching Hmean 84.1% and 82.0% respectively. Morever,
we report a baseline on total-text containing curved text which suggests
effectiveness of the proposed approach.Comment: Accepted by ICPR201
Properties of continuous Fourier extension of the discrete cosine transform and its multidimensional generalization
A versatile method is described for the practical computation of the discrete
Fourier transforms (DFT) of a continuous function given by its values
at the points of a uniform grid generated by conjugacy classes
of elements of finite adjoint order in the fundamental region of
compact semisimple Lie groups. The present implementation of the method is for
the groups SU(2), when is reduced to a one-dimensional segment, and for
in multidimensional cases. This simplest case
turns out to result in a transform known as discrete cosine transform (DCT),
which is often considered to be simply a specific type of the standard DFT.
Here we show that the DCT is very different from the standard DFT when the
properties of the continuous extensions of these two discrete transforms from
the discrete grid points to all points are
considered. (A) Unlike the continuous extension of the DFT, the continuous
extension of (the inverse) DCT, called CEDCT, closely approximates
between the grid points . (B) For increasing , the derivative of CEDCT
converges to the derivative of . And (C), for CEDCT the principle of
locality is valid. Finally, we use the continuous extension of 2-dimensional
DCT to illustrate its potential for interpolation, as well as for the data
compression of 2D images.Comment: submitted to JMP on April 3, 2003; still waiting for the referee's
Repor
Image Display and Manipulation System (IDAMS) program documentation, Appendixes A-D
The IDAMS Processor is a package of task routines and support software that performs convolution filtering, image expansion, fast Fourier transformation, and other operations on a digital image tape. A unique task control card for that program, together with any necessary parameter cards, selects each processing technique to be applied to the input image. A variable number of tasks can be selected for execution by including the proper task and parameter cards in the input deck. An executive maintains control of the run; it initiates execution of each task in turn and handles any necessary error processing
- …