Copy Link
Add to Bookmark
Report
VISION-LIST Digest Volume 10 Issue 38
VISION-LIST Digest Mon Sep 09 09:51:31 PDT 91 Volume 10 : Issue 38
- Send submissions to Vision-List@ADS.COM
- Vision List Digest available via COMP.AI.VISION newsgroup
- If you don't have access to COMP.AI.VISION, request list
membership to Vision-List-Request@ADS.COM
- Access Vision List Archives via anonymous ftp to ADS.COM
Today's Topics:
Closed implicit surfaces
Fingerprints
New release of FEX and LPEG
Re: Neural Networks for Morphological Operators
3D surface fitting / smoothing
Color cameras (summary)
CVPR '92 call for papers
----------------------------------------------------------------------
Date: Fri, 6 Sep 1991 15:41:02 GMT
From: sullivan@herodotus.cs.uiuc.edu (Steve Sullivan)
Organization: University of Illinois, Dept. of Comp. Sci., Urbana, IL
Subject: Closed implicit surfaces
Keywords: surfaces,modelling,vision
Can anyone give me clues or references regarding how to tell if an
implicit surface in 3D is closed? I realize that, in the quadric case,
the surface will be closed if the eigenvalues in the quadratic form
are all of like sign (corresponding to an ellipsoid or sphere), but
what about higher degree surfaces? For the quartic case, I have so far
only been able to identify a few classes of closed surfaces and have
yet to find a general condition on the coefficients that insures
closure. Does such a condition exist? Any related comments or pointers
to the literature are welcome.
Steve Sullivan
Robotics/Vision group
Beckman Institute
University of Illinois, Urbana-Champaign
sullivan@demagog.cs.uiuc.edu
------------------------------
Date: Fri, 6 Sep 91 08:36:26 +0100
From: Nick Francis <nick@dcs.warwick.ac.uk>
Subject: Fingerprints
Could somebody tell we what the state of the art in fingerprint recognition
systems is ? Any good references (or texts) ? Are there any commercial
systems ?
Am I correct in assuming that the image processing part of the problem is
not too difficult but the database part is ?
Any help would be much appreciated,
-Nick
nick@dcs.warwick.ac.uk Warwick University Computer Science
------------------------------
Date: Fri, 6 Sep 91 4:25:16 BST
From: A.Etemadi@ee.surrey.ac.uk
Subject: New release of FEX and LPEG
G'Day
Some time ago I released FEX and LPEG versions 0.1 for comments.
Versions 1.5 (hopefully the final versions) of both packages are now
available by request through Email. These versions are compatible with
both the cc and gcc compilers. I would like to thank Sanjay Bhasin for
his invaluable comments in the preperation of the new versions. The
packages currently only work on systems running Unix or Ultrix.
Postscript copies of the preprints of two papers describing the
algorithms are also available by Email.
FEX is a package in C for creating a line and circular arc segment
description of raw edgemap images. The aim of FEX is to build an
analytic description of the edgemap in terms of line segments and
circular arcs.
LPEG is a package in C for the grouping of FEX line segments into the
following:
Overlapping parallel pairs
Non-overlapping parallel pairs
V Junctions
L Junctions
T Junctions
Lambda Junctions
Where the name of the junctions also conveys their form. The algorithms for
both FEX and LPEG are highly parallel. Below is a table of performance
timing information in units of Sun-IV Sparc CPU seconds excluding I/O:
| TYPICAL PROCESSING | WORST-CASE PROCESSING |
| TIME | TIME |
| FEX | < 1.0 | 10.0 |
| LPEG | < 10.0 | 160.0 |
Included is installation/usage information, a package for displaying the
results of LPEG groupings under X11R4, and some programs for converting ASCII
lists of arcs and lines generated by FEX into raw images.
Requests may be forwarded to any of the Email addresses given below.
regards
Dr A. Etemadi <(|)>.
Dr. A. Etemadi, | Phone: (0483) 300-800 Ext. 2311
V.S.S.P. Group, | Fax : (0483) 300-803
Dept. of Electronic and Electrical Eng., | Email:
University of Surrey, | Janet: a.etemadi@ee.surrey.ac.uk
Guildford, | ata@c.mssl.ucl.ac.uk
Surrey GU2 5XH | SPAN : ata@mssl
United Kingdom | ata@msslc
------------------------------
Date: Sun, 8 Sep 91 23:17:50 EDT
From: cherwig@eng.clemson.edu (christoph bruno herwig)
Subject: Re: Neural Networks for Morphological Operators
Dear all,
In 'VISION-LIST Digest 10/36' I asked for references about "Neural
Networks for Morphological Operators". Here are the I replies I
received so far and would be happy for any more:
++++++++++++++++++
Neural networks can be used to realize DILATION and EROSION operations.
Other than using backpropagation algorithm, they can be designed directly.
You can see the paper written by Lippmann in IEEE ASSP Magazine, pp.4-22,
April 1987.
Lin Yin
++++++++++++++++++
Juliette Mattioli, Michel Schmitt et al.
in ICANN91 in Helsinki, Vol.1, pg I-117:
Shape discrimination based in Mathematical Morphology and
Neural Networks, and
Vol 2, pg II-1045
Francois Vallet and Michel Schmitt,
Network Configuration and Initialization using Mathematical Morphology:
Theoretical Study of Measurement Functions.
While above article do not talk about the operations you mentioned, I know
that the author is working on these, i.e. Michel Schmitt;
his address is:
Thomson-CSF, Laboratoire Central de Recherche,
F-91404 Orsay Cedex, France
Konrad Weigl
++++++++++++++++++
Date: Wed, 28 Aug 91 09:49:01 +0200
From: toet@izf.tno.nl (Lex Toet)
there is indeed very little literature on this topic.
Some references that may be of use are :
S.S. Wilson (1989) Vector morphology and iconic neural networks.
IEEE Tr SMC 19, pp. 1636-1644.
F.Y. Shih and Jenlong Moh (1989) Image morphological operations
by neural circuits. In: IEEE 1989 Symposium on Circuits and Systems,
pp. 774-777.
M. Scmitt and F. Vallet (1991) Network configuration and initialization
using mathematical morphology: theoretical study of measurement functions.
In: Artificial Neural networks, T. Kohonen, M. Makisara, O. Simula and
J. Kangas, eds. Elsevier Science Publishers B.V. , Amsterdam.
++++++++++++++++++
Date: Thu, 29 Aug 91 22:55:35 -0400
From: "Mark Schmalz" <mssz@mosquito.cis.ufl.edu>
Re: your recent posting to comp.ai.vision -- obtain the recent papers
on morphological neural nets by Ritter and Davidson, and
Davidson and her students. Published in Proc. SPIE, the
papers are indexed in the Computer and Control Abstracts,
which you should have in your library. Copies may also
be obtained by writing to:
Center for Computer Vision Research
Department of Computer and Information Science
Attn: Dr. Joseph Wilson
University of Florida
Gainesville, FL 32611
The morpho. net computes over the ring (R,max,+) or (R,max,*),
where R denotes the set of reals, max the maximum operation,
and * multiplication. In contrast, the more usual McCullogh-
Pitts net computes over (R,+,*). Thus, the morpho. net is
inherently nonlinear. Additionally, numerous decompositions
of the morphological operations into linear operations have
been published. Casasent has recently published an interesting
paper on the applications of optics to the morphological
functions. His work on the hit-or-miss transform would be
an interesting topic for neural net implementation. I suggest
you obtain the SPIE Proceedings pertaining to the 1990 and 1991
Image Algebra conferences, presented at the San Diego Technical
Symposium of SPIE (both years). Morphological image processing
is included in the conference, and some good papers have appeared
over the last two years.
Mark Schmalz
++++++++++++++++++
Christoph Herwig
Dept. of Electrical and Computer Engineering, Clemson University, SC
------------------------------
Date: Fri, 6 Sep 1991 15:11:50 GMT
From: reha@cunixf.cc.columbia.edu (Reha Elci)
Organization: Columbia University
Subject: 3D surface fitting / smoothing
I frequently deal with noisy data distributed as the value of f(x,y).
Hence I have a surface which I can display in facet mesh form. But when the
data contains 100K+ polygons, efficient display becomes a problem. Are there
any algorithms which can transform the data into nurb meshes with varying
resolution & smoothness? Perhaps there even exists an adaptive algorithm?
Thanks in advance for all the replies.
Reha Elci
EMail: elci@bugs.gs.com
------------------------------
Date: Fri, 6 Sep 1991 16:34:08 GMT
From: hougen@uirvlj.ads.com (Darrell Roy Hougen)
Organization: University of Illinois at Urbana
Subject: Color cameras (summary)
Summary: Summary of information on color cameras
Keywords: color cameras
I while back I asked for information on color camera systems -- the
kind and price of a good color camera system. I promised to post the
results and here they are (finally):
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
I have purchased a colour camera, TMC 56GN from PULNIX company.
The price is about 1000 pounds. It is easy to connect to monitor
with BNC connector or connect to computer with a image grabber.
The camera we bought only has one ccd chip, so quility is not
very good. If you need high quility colour camera you can buy a
3 ccd chip camera whose price is about 5000pounds in UK. JVC or
SONY provides this kind camera.
Wang Yangsheng from UK.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
I have read your internet posting about color cameras.
I'm involved with a small german company (CCD Videometry), that has
developed a very high resolution camera with a high dynamic range. The
camera is manufactured and marketed by the Kontron Bildanalyse GmbH.
To your questions.
Price: The camera (ProgRes 3012) costs about $20k. PC interface and
software another $3k.
Quality: Resolution up to 3000*2300.
Acquisition time proportional to the number of pixels scanned
8 seconds for highest resolution (3000*2300).
12 bits for each color (RGB) i.e. 36 bits per pixel.
Signal to noise ratio 2500 i.e. more than enough even
for xray images.
Interface: PC interface with software for TIFF files or just raw color
plane data. Driver sources are cheaply available. Sun and Mac
interfaces are due end of the year.
Size: About 6*4*3 inches for the camera head, separate power supply
of the same size. The camera has a C mount lens adaptor and
can be screwed to the usual type of stand in any position.
Vendor: Kontron Bildanalyse GmbH in Eching, Germany. They have
representatives in the US. If you have interest, I can look
them up for you. Please send me an email if you want further
information. I (Udo Lenz) can be reached at
lenz@charly.bl.physik.tu-muenchen.de, fax 0049 89 3617141,
phone 0049 89 3209 4067 (Germany).
Yours, Udo
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
We have a Kodak CCD 1000 RGB Camera. Some of its specificatons are:
Video Output: NTCS composite or RGB
Imaging Device: 2/3 inch interline transfer CCD
Scanning System: 525 lines (2:1 interlace)
Synchronization: internal/external
Horizontal Resolution: 330 lines
Lens Mount: C-mount
Dimensions: 3.2 x 3.0 x 9.1 inch with lens
Weight: 1.9 lb
Price: I don't know
Liang He
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Darrell Hougen
hougen@uirvld.csl.uiuc.edu
------------------------------
From: Patrick J. Flynn <flynn@eecs.wsu.edu>
Date: Thu, 5 Sep 91 13:33:26 PDT
Subject: CVPR '92 call for papers
CALL FOR PAPERS
CVPR'92
Chancellor Hotel and Convention Center
Champaign, Illinois
June 15-18, 1992
GENERAL CHAIR
Professor Azriel Rosenfeld
Center for Automation Research
University of Maryland
College Park, MD 20742
E-mail: ar@alv.umd.edu
PROGRAM CO-CHAIRS
Professor Narendra Ahuja
University of Illinois
Beckman Institute
405 N. Mathews
Urbana, IL 61801
E-Mail: ahuja@uirvld.csl.uiuc.edu
Professor Thomas S. Huang
University of Illinois
Beckman Institute
405 N. Mathews
Urbana, IL 61801
E-Mail: huang@uirvld.csl.uiuc.edu
PROGRAM COMMITTEE
Lynn Abbott Chuck Dyer Roger Mohr
Jake Aggarwal Jan Olof Eklundh Theo Pavlidis
Yiannis Aloimonos Frank Ferrie Shmuel Peleg
P. Anandan Pat Flynn Alex Pentland
Paul Besl Robert Haralick Tomaso Poggio
Thomas Binford Anil Jain Jean Ponce
Ruud Bolle Ramesh Jain Giulio Sandini
Kevin Bowyer Avi Kak Steve Shafer
Michael Brady John Kender Linda Shapiro
Chris Brown Fumio Kishino Saburo Tsuji
Rama Chellappa Wei-Chung Lin Chip Weems
Chin-Tu Chen Gerard Medioni Larry Wolff
Homer Chen Rakesh Mohan Andrew Zisserman
Alok Choudhary
THE PROGRAM
The program will consist of high quality contributed papers on
all aspects of computer vision and pattern recognition including
applications. Papers will be refereed by the members of the pro-
gram committee.
PAPER SUBMISSION
Four copies of complete manuscripts should be received no later
than November 1, 1991 by: Sharon Collins, University of Illi-
nois, Beckman Institute, 405 N. Mathews, Urbana, IL 61801.
The manuscript should include the following (in that order):
A Title Page - containing the names and addresses of the authors, and an
abstract of up to 200 words.
A Second Title Page - with abstract but without the names and addresses of
the authors.
A Summary Page - fill out a copy of the form below.
Paper - No more than 30 pages (double-spaced, 12 point) including text,
figures, references, etc.
SUMMARY (CVPR '92)
(1) What is this paper about?
(2) What is the original contribution of the work reported in
this paper?
(3) What is the relationship of this work to related work of oth-
ers?
(4) How can your contribution be used by others?
------------------------------
End of VISION-LIST digest 10.38
************************
