HDTenEightyP/NetNews huggingface dataset:
From: bweiner@ruhets.rutgers.edu (Benjamin Weiner)
Newsgroups: sci.physics
Subject: Re: Magnetic monopoles?
Date: 21 Jan 93 21:06:50 GMT
Organization: Rutgers Univ., New Brunswick, N.J.

merritt@macro.bu.edu (Sean Merritt) writes:

>I always thought the best theorist DO think like experimentalist. Are
>they not always waiting to grab the results off the griddle and offer
>an explination? And do they not always(in the case of the best) offer
>an experiment that can prove thier theory?

In a perfect world ...
But also, the problems facing an experimentalist are not quite the
same as those facing a theorist ... where theorists may require
facility with complicated mathematics, or a sort of unchecked
creativity that leads them to invent things (like quarks, say),
a great experimentalist is someone whose creativity lies in thinking
up *how* to observe something, that possibly everyone assumed 
simply could not be done - like Rabi's molecular beam experiments,
or Glaser and Alvarez for the bubble chamber, for example.  (In _A
Random Walk in Science_ Glaser reminisces that the APS scheduled one
of his first talks about the bubble chamber in the Saturday "crackpot
session.") 

Of course the above is a caricature and not to be taken too seriously ...
I think one problem in physics is that physicists tend to be bowled
over by theory and assume that experiments are cut-and-dried things 
which are done out of cookbooks and simply return a "yes" or "no"
for a theory, and that they don't need to worry about knowing both
theory and experiment.
Newsgroups: sci.physics
From: snyder@henry.ece.cmu.edu (John Snyder)
Subject: Re: ATOMS & ELECTRONS
Organization: Physics Department, Carnegie Mellon University
Date: Thu, 28 Jan 1993 00:50:29 GMT

In article <1993Jan23.220138.15459@lynx.dac.northeastern.edu> mkagalen@lynx.dac.northeastern.edu (michael kagalenko) writes:
>In article <1jipr8INN9vo@elroy.jpl.nasa.gov> angelyn@fridge.Jpl.Nasa.Gov (Angelyn P. Williams) writes:
>>In article <1993Jan19.203435.9707@sfu.ca> Leigh Palmer, palmer@sfu.ca writes:
>>
>>>In article <16302@hq.hq.af.mil> John C Pope, jpope@pafosu1.hq.af.mil
>>>writes:
>>
>>>>  *   Why do the elctrons (of an atom) not go crashing into the protons?
>>

Actually, there is a finite probability that they do, isn't there?  
Isn't that what electron capture is?  The electron has a finite
probability density inside the nucleus, and can react with
a proton to form an electron.

John
snyder@henry.ece.cmu.edu
From: paul@mtnmath.UUCP (Paul Budnik)
Newsgroups: sci.physics
Subject: Quantum mechanics *is* incoherent, was: What does quantum ...
Date: 26 Jan 93 17:58:01 GMT
Organization: Mountain Math Software, P. O. Box 2124, Saratoga. CA 95070

In article <1993Jan25.134627.22922@oracorp.com>, daryl@oracorp.com (Daryl McCullough) writes:
> mcirvin@husc8.harvard.edu (Matt McIrvin) writes:
[...]
> >The "incoherent mess" may lie more in the minds of the physicists
> >you're talking to than in the theory as a whole.  I agree that people
> >who deny the legitimacy of the study of interpretations, or who regard
> >it as a solved problem, are deluding themselves.
> 
> I agree that the incoherence is in minds, rather than the theory.  It
> could be very well be the case that there is some way of looking at
> things so that it all becomes perfectly clear and consistent. I don't
> see any evidence that the way has been found yet, though.
> 
On the contrary the incoherence is in the theory. It is not in the nice
linear local causal Lorentz invariant theory that describes the evolution of
the wave function and obeys all those elegant `classical intuitions' that
John Baez criticizes in my thinking. And of course physicists work almost
completely within this model. That is why they are able to obtain such
marvelous results. However the rest of the theory that connects this
elegant model to experimental observation *is* incoherent.

The reason is simple. The founders of QM insisted on developing a complete
theory. Since they did not *have* a complete theory they were forced to
introduce metaphysical nonsense into the fundamental laws of physics.
Unfortunately later generation of physicists have, for the most part,
bought into this lapse of scientific rigor. They have been overly impressed
by the admittedly extraordinary achievements of the existing theory. They have
also been at a complete loss for a way to describe the nonlinear changes
in the physical world that are currently brushed aside from further
consideration with the collapse postulate.

Paul Budnik
Newsgroups: sci.image.processing
From: ti1@irz201.inf.tu-dresden.de (Torsten Ihle)
Subject: Re: Help Wanted: Contour Tracing
Reply-To: ti1@irz201.inf.tu-dresden.de (Torsten Ihle)
Organization: Free University of Berlin, Germany
Date: Fri, 22 Jan 1993 09:27:29 GMT


--
In article <1993Jan21.192619.10241@pinet.aip.org>, scotj@pinet.aip.org (scot_shinderman) writes:
[...]
|>   While reading the standard image processing books I have noticed one
|>algorithm that seems to be glossed over: contour tracing.  In the
|>pictures that I am scanning, a filter is run across the pixels and a
|>threshold is applied to produce either white or black pixels for the
|>grey-scale.  At this point there is usually a rather disconnected set of
|>dots due to noise in the picture but also some strong edges from the
|>filter.  What is the "pratical" method of moveing along the detected
|>pixels to find lines (or curves).  If I try to step from one pixel to
|>the next by looking in a neighborhood, then the path almost always gets
|>caught up in the noise off to one side or another.  Is there a way to
|>"nudge" the search in a particular direction based on previous motions.
[...]

1)	You can try to fix some "small gaps" in your lines by morphological 
	operations ( n times dilate and afterwards n times erode, where 0<n<6 ).
2)	You can use a Hough-Transform to get clues, where to find lines (or curves)
	in the image.
3)	You can use a sort of relaxation method to extract the lines, but to do
	this you can not simply threshold your filter output.
4)	You can extract line parts as a symbolic description of the connected
	components of your binary image and join line parts to lines (or curves)
	by symbolic methods
	
----------------------------------------------
Torsten Ihle, cand. inf., TU-Dresden
EMail: ihle@iki101.inf.tu-dresden.de

Es ist deutsch in Kaltland !
----------------------------------------------
From: ttrusk@its.mcw.edu (Thomas Trusk)
Newsgroups: sci.image.processing
Subject: re: Singular Value Decomposition Algorithm
Date: 23 Jan 93 23:56:23 GMT
Reply-To: ttrusk@its.mcw.edu
Organization: Medical College of Wisconsin
NNTP-Posting-Host: pixel.cellbio.mcw.edu


In article <1jom89INNlhl@rs6000.bham.ac.uk> stannaee@eee.bham.ac.uk (Mr. Eric E. Stannard) writes:
>--
>Does anyone have or know where to obtain an efficient routine to
>calculate the Singular Value Decomposition of a real matrix. The
>code would preferably be in C/C++ but Fortran is fine. 
>Is there any free library routines available to do this available by
>ftp?
>
>Thanks in advance.
>
What you want can be found in 

NUMERICAL RECIPES IN C: THE ART OF SCIENTIFIC COMPUTING
Press WH et al, 1992, SECOND EDITION, Cambridge University Press

That topic is covered in chapter 2, and routines to implement the
algorithms are provided. There is also a Numerical Recipes in FORTRAN
version of the same ideas (also look for SECOND EDITION, 1992)
*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*==*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=
*Dr. Thomas Trusk                    *                              *
*Dept. of Cellular Biology & Anatomy * Email to ttrusk@its.mcw.edu  *
*Medical College of Wisconsin        *                              *
*Milwaukee, WI  53226                *                              *
*(414) 257-8504                      *                              *
*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*==*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=
From: mosscrp@ccu.umanitoba.ca (David R. Mosscrop)
Newsgroups: sci.image.processing
Subject: Khoros availability ?
Date: 26 Jan 93 16:04:51 GMT
Followup-To: sci.image.processing
Organization: University of Manitoba

Hello;

Is the source code, and some binaries for Khoros available on some nice
transportable format like a CD-ROM.  ftp access is good but for such large
programs can be a pain.
I am interested in running on a IBM RS/6000 and a NeXT Colour station.
People with experience on these platforms, please drop me a note, so I know
where to tune for help ;-)

Thank you.
David R. Mosscrop

Programmer Analyst
University of Manitoba
Geography Department
Newsgroups: sci.image.processing
From: twc@swamp.cacs.usl.edu (Tat W. Chan)
Subject: Debugging problem
Followup-To: twc@swamp.cacs.usl.edu.usa
Organization: The Center for Advanced Computer Studies
Date: Tue, 26 Jan 1993 01:28:44 GMT

Hi, 

   I would like some comments about some problems that I encountered recently.

     1. Debugging a large program which input data is huge and not 
        well-structured (as it is common in the domain of this newsgroup), 
        is there any effective ways to locate the bugs? Should we deal with 
        the program first, or the data first, or both?

     2. If there is any good way to solve #1, is it different from debugging 
        techniques in other domains in which the input data is not so intensive?

Thanks for any help in advance!




Newsgroups: sci.image.processing
From: brune@rhrk.uni-kl.de ( T. Brune [Biologie])
Subject: looking for file conversion programm
Organization: University of Kaiserslautern, Germany
Date: Tue, 26 Jan 1993 19:55:28 GMT

Hi everybody,

i have image files (8bit) in a custom format and want to 
convert them into a common PC file format like TIFF, PCX ...
Can someone point me to a shareware program that is able to 
import images in a user defined format (like NIH-Image...).
Unfortunately we have no Mac's so it should be a (win)DOS-
programm.  

regards,

 Thomas Brune    <brune@rhrk.uni-kl.de>   
 FB Biologie
 Univ. of Kaiserslautern
 Erwin-Schroedinger-Str.
 W-6750-Kaiserslautern
 Germany
-- 

 
      Thomas Brune            <brune@rhrk.uni-kl.de>

Newsgroups: sci.image.processing
From: dans@iplmail.orl.mmc.com (Dan Sullivan)
Subject: Re: need help with FFT's...
Organization: Martin Marietta
Date: Thu, 21 Jan 1993 17:56:04 GMT

In article <l8h39wm@rpi.edu>, raffuj@rebecca.its.rpi.edu (Jose Raffucci) writes:
|> 
|> I'm trying to add a low pass filter so I can check too see if it's 
|> doing what it's supposed to.  It's not.  I'm getting what appear to be 
|> the upper edges of some sinc waves, especially in the darker portions
|> of the pictures.  I've checked this out with another program I found
|> that fft's images, and the same thing happens.  

	That sounds exactly like it should. Since you are doing an *ideal*
low-pass filter (all 1's in the pass band, all zero's in the stop band), 
you will indeed get a diffraction pattern in your output image. You are 
effectively convolving the image with a sinc function, which causes the 
ringing.

	If you are trying to simulate lower-resolution optics, this is correct.

	You might try a smoother filter function that falls off more slowly
at higher frequencies. A gaussian is one idea.
|> 
|> Related question:  
|> 
|> 	What should I do with the data that dips below zero when I 
|> return from the frequency domain?  I Need to keep the intensity values
|> of the pixels, since they're linearly mapped to the signs' luminance.  
|> That pretty much eliminates moving everyting up, and making the lowest 
|> point the new zero.  any suggestions?
|> 
	Um, I'm not an optics type, but wouldn't luminance be the magnitude^2
of the output image? That would take care of any negative pixels.

|> Now, before anyone suggests I not do the fft and move over to a   
|> sliding kernel method, let me mention that if I could I would.  The 
|> problem is that I don't know how to change the filter functions to
|> their corresponding kernels.
|> 
	The FFT is just a convenient computational technique; if you do it right
you'll get the same results as the space-domain implementation. It sounds like
you are doing it right.

-- 
Dan                                             o
                                     ____  o o
Dan-Sullivan@orl.mmc.com            (_/\_)o
Martin Marietta Electronic Systems    ()=o
MP 1160, Orlando, FL USA
"You keep using that word. I do not think it means
 what you think it means."
Newsgroups: sci.image.processing
From: swormley@thr1.cnde.iastate.edu (Sam Wormley)
Subject: testimg.gif
Organization: Iowa State University, Ames IA
Date: Wed, 27 Jan 1993 22:41:21 GMT

Can anyone give me a source for a 256 by 256 test image commonly known
as testimg.gif, testimg.jpg or testimg.ppm of a young woman from USC.
This is a standard image that is used in DIP classes and is often found in
text books. Any information would be appreciated.

Please reply directly to: 
 
   Loren Knutson
   lknutson@cnde.iastate.edu



Newsgroups: sci.image.processing
From: ricky@vnet.ibm.com (Rick Turner)
Subject: Re: Help Wanted: Contour Tracing
Date: Fri, 22 Jan 93 08:09:24 GMT
Organization: IBM UK Scientific Centre

Hysteresis is one common technique, often used as a back end to edge
detectors. There's probably more information in the machine vision
literature than in mainstream image processing literature.

Rick
From: sbarrkum@engws4.ic.sunysb.edu (Se kumarakulasinghe)
Newsgroups: sci.image.processing
Subject: Re: Edge Detection And Segmentation Using Khorus And PV-WAVE
Date: 27 Jan 93 01:43:29 GMT
Distribution: sci.image.processing
Organization: State University of New York at Stony Brook

In article <ANADEEM.93Jan24173844@ampere.sci.image.processing> anadeem@ampere.sci.image.processing (Ahmed Nadeem) writes:
>Netters,
Image Processing Software package that has good 
>Edge Detection and Classification ( Segmentation ) modules/routines.  
>        I have heard a lot about Khoros ( University Of New Mexico) and 
>PV-WAVE (Precision Visuals) and was curious if other professionals or students
>had any experience on how good they are for the above purposes.
Bcc: 

Hi,

Theres a FTP site with a whole number of IDL routines.
The site is fermi.jhuapl.edu
          and in directory idl-pvwave/jhuapl

Ive run a couple of these on PV-Wave a they work fine.  They are really
well written programs, nice modular form and well documented. I do not 
know if it has edge detection programs, however the possibility is high.

Barr Kum
Newsgroups: sci.image.processing
From: ricky@vnet.ibm.com (Rick Turner)
Subject: Re: animation program for X11R4 inquiry
Date: Thu, 28 Jan 93 08:15:09 GMT
Distribution: usa
Organization: IBM UK Scientific Centre 

There's one called 'xflic'. It's probably in most of the standard archives
(wuarchive.wustl.edu or gatekeeper.dec.com are good bets).

Rick
Newsgroups: sci.image.processing
From: stan@sabaac.NoSubdomain.NoDomain (Andrew Staniszewski)
Subject: image reduction
Reply-To: staniszewski@mayo.edu
Organization: Mayo Foundation
Date: Thu, 21 Jan 93 15:07:59 GMT

Hi,

I am looking for a 2D algorithm which would allow me to:

	reduce a set of arbitrary geometric objects

	position the reduced objects objects such that they "lie within"
	the original object. ie, the reduced object lises inside the borders
	of the original object, with its edges equidistant from the edges of the
	original object.

If you know of an algorithm for doing this, and/or have a subroutine 
I could use...

please reply to

staniszewski@mayo.edu
Organization: TECHNION - Israel Institute of Technology.
Date: Tuesday, 26 Jan 1993 23:41:16 IST
From: <PHR13YS@TECHNION.BITNET>
Newsgroups: sci.image.processing
Subject: Book query.

Dear group members,

  Several weeks ago I found in this news-group a reccomendation on the

following book: Introductory Computer Vision and Image Processing by

Adrian Low (1991). Our librarian can't find it in "books in print" and

other sources, so if anyone has more details (specifically the publisher

and corrections to above stated details), please let me know by E-mail

directly.

                       Thanks in advance,

                              Yoram, PHR13YS@TECHNION
Newsgroups: sci.image.processing
From: anpilant@mtu.edu (Andrew A. Pilant)
Subject: Need: SSM/I-to-raster program
Keywords: SSM/I, raster conversion, image display, UNIX
Organization: Michigan Technological University
Date: Sun, 24 Jan 1993 15:54:34 GMT

I'm looking for a program to convert SSM/I data in R.S.S. Antenna Temperature
Tape format to raster format for image display, in a UNIX (Sun) environment.
Also, I'd like to connect with people using SSM/I data for snow/land-surface
studies.

Many thanks-

Drew Pilant
(please reply to:    anpilant@mtu.edu  )
From: baalke@kelvin.jpl.nasa.gov (Ron Baalke)
Newsgroups: sci.image.processing
Subject: Re: IP packages for PC?
Date: 25 Jan 1993 15:57 UT
Organization: Jet Propulsion Laboratory
Distribution: world
NNTP-Posting-Host: kelvin.jpl.nasa.gov
News-Software: VAX/VMS VNEWS 1.41    

In article <1993Jan24.160609.5663@sbcs.sunysb.edu>, sbarrkum@engws3.ic.sunysb.edu (Se kumarakulasinghe) writes...
>In article <1jq3baINNsba@pandora.sdsu.edu> rzimdar@explore.sdsu.edu (Robert Zimdar) writes:
> 
>>Try Imdisp (I don't recall if its free or sharware), which can be found by,
>>anonymous ftp to ames.arc.nasa.gov   cd pub/SPACE/SOFTWARE

The latest version of IMDISP available is 7.9.  The program plus documentation
is in the imdisp79.zip.  

>Whats also geat about this bit of software is that you can display a large
>images without having much of memory. Ive opened 10 MB Landsat MSS onto a PC
>having 8 MB of Memory.

I'm one of the programmers for IMDISP, and I'm never tried an image
this large, and I'm glad to see it works.  I've programmed it so that
the image will be stored in extended or expanded memory, if it is available.
Otherwise, it will just access the image from the disk.

>There is also a similar program for the Mac. Its called Pixel Pusher 
>and available from someplace. (FTP).  its a NCSA product.

Pixel Pusher was written by Dan Stanfill at JPL. It is only available
through Cosmic (the clearing house for NASA software), but unfortunately
they charge something like $400 for it.
     ___    _____     ___
    /_ /|  /____/ \  /_ /|     Ron Baalke         | baalke@kelvin.jpl.nasa.gov
    | | | |  __ \ /| | | |     Jet Propulsion Lab |
 ___| | | | |__) |/  | | |__   M/S 525-3684 Telos | Every once in a while,
/___| | | |  ___/    | |/__ /| Pasadena, CA 91109 | try pushing your luck.
|_____|/  |_|/       |_____|/                     |
From: jg90@castle.ed.ac.uk (J Gourlay)
Newsgroups: sci.image.processing
Subject: Hadamard transforms
Date: 25 Jan 93 18:05:10 GMT
Organization: Edinburgh University

I would greatly appreciate anyone willing to discuss Hadamard
transforms, theory and applications, to contact me, particularly anyone
currently working with them. I am both simulating the tranforms and
applications digitaly in serial and on a parallel machine, and applying 
them in a practical optical system.

*************************************************************************
James Gourlay                            e-mail: jg90@uk.ac.ed.castle
Applied Optics Group                     phone:  (031)650 1000
Department of Physics                    fax:    (031)650 5220
James Clerk Maxwell Building
King's Buildings            
Mayfield Road               
Edinburgh EH9 3JZ           
Scotland                    
U.K.
Newsgroups: sci.image.processing
From: ms@specklec.mpifr-bonn.mpg.de (Markus Schoeller)
Subject: Re: Fourier Transform`s What? 
Organization: Max-Planck-Institut f"ur Radioastronomie
Date: Thu, 21 Jan 1993 17:33:17 GMT

In <1993Jan19.145159.19327@gserv1.dl.ac.uk> g.coulter@daresbury.ac.uk (G. Coulter) writes:

>I wounder if someone could help explain to  me Fourier Transforms
>(FFT's) I don't  want  the formulae involved just an  overview of
>the  technique. ie  How it works?  what is it used for?  What are
>the results of using the transform & how do you get back  to your
>initial say 2d data, any other  general information would also be
>very welcome.

After there was a response about what a FFT looks like I just want
to give an example what it is used for.
If you are collecting images -in my case these are astronomical 
ones- you often have a convolution between the object you are 
looking at and a so called point-spread-function.
The convolution is defined by a very nasty mathematical operation.
It looks like this:

    i(x) = \int( o(y) p(x-y) dy )

where i(x) is the image, o(x) the object and p(x) the psf.
\int stands for an integral sign.
If you do a FT, the convolution results in a multiplication:

    I(u) = O(u) P(u)

where the uppercase letters are the FT's corresponding to the
lowercase letters (letter==function).
Of course everybody can get O(u) from this formula, if P(u) doesn't 
equal 0 on the whole field. A simple devision yields:

    O(u) = I(u) / P(u)

An inverse transformation yields the object o(x).
Unfortunately you don't know the psf in every case. But that's a much
more complicated topic.

Hope that helps and everything was in an understandable English.

Markus

Newsgroups: sci.image.processing
From: martinjp@cs.washington.edu (John Martin)
Subject: HELP: Med Imaging sys image formats to SGI GL???
Organization: Computer Science & Engineering, U. of Washington, Seattle
Date: Fri, 22 Jan 93 17:58:46 GMT


I am trying to find out the standard image formats that come
out of NMR scanner and the like.  I am going to try and put
a medical (3D image) in a stereoscopic virtual environment.

So i need to convert the med images into a format that 
SGI's GL can understand.  Any pointers to info would be appreciated

I can't seem to find any hard info on the image formats

thanks

John
-------
 

Newsgroups: sci.image.processing,comp.sys.sun.hardware
From: yman@matilda.vut.edu.au (Yauman NG)
Subject: Sun VideoPix Image Capture Board -- Any Good?
Organization: Victoria University of Technology
Date: Mon, 25 Jan 1993 03:01:52 GMT

We are thinking of buying one of this beast to do some image processing
work.
We would like to hear from any one with good or bad experience with
this card.

Many thanks in advance

Yauman
E-mail : yman@cabsav.vut.edu.au

Newsgroups: sci.image.processing
From: massengi@cloves.unx.sas.com (Darrell Massengill)
Subject: Position Opening at SAS Institute 
Date: Wed, 27 Jan 1993 21:40:52 GMT
Organization: SAS Institute Inc.

SAS Institute Inc. is one of the nation's largest independent
software companies.
With a customer renewal rate of over 90% and an employee retention
rate better than three times the Industry average, SAS
Institute lives up to high standards of satisfaction.
The Institute has an opening for the following position.

Systems Developer (#1909)

You will be responsible for developing and maintaining code for
the Institute's image processing package.

Requirements include:

* Bachelor's degree in a quantitative field,
  preferably in computer science or a
  related field;
* five years' programming experience
* experience with the C programming language;
  experience developing computer graphics
  software with emphasis on image processing,
  image editing and painting, and  2D, 3D graphics
  preferred.

SAS Institute offers a progressive atmosphere, with excellent
benefits and competitive salaries.  If you seek personal and
professional growth and the chance to put your creativity to
the test, mail or fax a detailed letter and resume, including
position number and salary requirements to receive an
application.  Inquiries must be received by 5:00 on 08FEB93.


                   SAS Institute Inc.
                   Department USE12793
                   SAS Campus Drive
                   Cary, NC  27513
                   Fax: 919-677-8123


SAS Institute Inc. is an Equal Opportunity/Affirmative Action
Employer. M/F/D/V


Newsgroups: sci.image.processing