HDTenEightyP/NetNews huggingface dataset:
From: iftekhar@elm.eecs.ucdavis.edu (Iftekhar Hussain)
Newsgroups: sci.image.processing
Subject: Re: Filter Ranges for Enhancement, HELP!?!
Date: 27 Jul 92 01:50:09 GMT
Reply-To: iftekhar@elm.eecs.ucdavis.edu (Iftekhar Hussain)
Organization: Digital Equipment Corporation

In article <1992Jul27.100116.9655@waikato.ac.nz>, singlis@waikato.ac.nz writes:
|> Path: ucdavis!ucbvax!agate!ames!sun-barr!cs.utexas.edu!wupost!waikato.ac.nz!singlis
|> From: singlis@waikato.ac.nz
|> Newsgroups: sci.image.processing
|> Subject: Filter Ranges for Enhancement, HELP!?!
|> Message-ID: <1992Jul27.100116.9655@waikato.ac.nz>
|> Date: Sun, 26 Jul 92 15:01:16 GMT-0:06
|> Organization: University of Waikato, Hamilton, New Zealand
|> Lines: 20
|> 
|> Greetings,
|> 
|> when filtering with a standard Laplacian filter
|> 	[ -1  -1  -1 ]
|> 	[ -1   8  -1 ]
|> 	[ -1  -1  -1 ]
|> and assuming the pixel values from 0..1 in intensity, the result of the 
|> operation can range from -8.0 to 8.0. What is the standard way of
|> mapping this result to a pixel range.
|> 
|> I have tried just diving by 8.0, and if negative ignore but this just gives
|> "black" images, I also tried /8.0 and the absolute, still it looks terrible.
|> 
|> I have a program for the PC, Improces which does a nice job.
|> 
|> Could anyone give me some tips??
|> 
|> thanks in advance
|> 
|> -Stuart Inglis, Waikato University, Hamilton, New Zealand.
|> 


scale it up beteen 0-range as follows:

range = 1.0;

for(i=0; i<dimension; i++)
  for(j=0; j<dimension; j++)
   scaled_image[i][j] = (range(image[i][j] - minimum))/(maximum-minimum);

/* where image[i][j] is your filtered image 
   minimum is minimum value of the filtered image 
   maximum  is maximum value of the filtered image 

   if you want to map between 0-255 simply change the range to 255

*/

-Iftekhar
Newsgroups: sci.image.processing
From: li@geop.ubc.ca (Yaoguo Li)
Subject: Fast Walsh Transform routines: wanted
Keywords: Walsh Transform
Reply-To: li@geop.ubc.ca
Organization: Geophysics & Astronomy, U.B.C. Vancouver, Canada
Date: Thu, 30 Jul 1992 20:33:03 GMT

Hi,

Could anyone please help me to find a fast Walsh transform (FWT)
routine? Perferably the transform is output in sequency order,
but other orders will do. Any pointer to FTP sites is great. 

Please E-mail me and I shall post a summary.

Thanks in advance!

------------------------------------------------------------
  Yaoguo Li        Department of Geophysics and Astronomy
  li@geop.ubc.ca   University of British Columbia, Canada
------------------------------------------------------------

Newsgroups: sci.image.processing
From: leyfre@McRCIM.McGill.EDU (Frederic Leymarie)
Subject: Re: Mathematical morphology for Image Compression???
Organization: McGill Research Center for Intelligent Machines, Montreal, Canada
Date: Tue, 21 Jul 92 16:53:17 GMT

In article <1992Jul21.142510.789@csi.uottawa.ca>, dominic@scooter.genie.uottawa.ca
 (Dominic Richens) writes:
|> 
|> In article <1992Jul20.202315.7143@ultb.isc.rit.edu>, jch3254@ultb.isc.rit.edu
 (J.C. Handley ) writes:
|> !    I asked my advisor, Ed Dougherty, about morphological image
|> !    processing being used for image compression.  He said to his 
|> !    knowledge there has been no fruitful use of morphology for image
|> !    compression.   
|> 
|> Well, I would think some derivative of fractal compression could make good
|> use of morphological operators.  Also, classification and segmentation
|> using morphological techniques is kinda image compression, no?!
|> 
|> As far as references go:
|> 
|> The definitive volumes on mathematical morphology has got to be Jean Serra's
|> three volume set.  Only problem I found with them is that you really have
   ^^^^^^^^^^^^

When was volume 3 published ? (I have seen only volumes 1 & 2 so far.)


|> to start at page 1 if you are to understand anything.  Sorry that I can't
|> remember the exact referrence for this, but they shouldn't be too hard to
|> find.  I'm pretty sure this is in English.
|> 
|> For algorithm, try to get a copy of Luc Vincent's Phd dissertation from
|> Ecole des Mines, Paris.  It is the best explained piece I have seen (hey,
|> even _I_ understood it!) and the algorithms he presents take most of work 
|> out of the coding.  I'm pretty sure this is in French.

Beucher's thesis on image segmentation (from the same lab; i.e., Centre de
Morphologie Mathematique, Fontainebleau, France) is quite good too.
Both theses are in French.
-- 
Frederic Leymarie -- leyfre@mcrcim.mcgill.edu
McGill University, Electrical Eng. Dept., McRCIM,    |	Tel.: (514) 398-8204
3480 University St., Montreal, QC, CANADA, H3A 2A7.  |	FAX:  (514) 398-7348
Newsgroups: sci.image.processing
From: pringle@dec09.cs.monash.edu.au (Glen Pringle)
Subject: Standard IP Images (Was Re: Lena source)
Organization: Computer Science, Monash University, Australia
X-Newsreader: Tin 1.1 PL4
Date: Fri, 24 Jul 1992 03:37:47 GMT

Various people wrote:
> The Lena image is from Playboy 1972 Oct/Nov.
> 

Well, I can confirm that the centrefold of the November 1972 Playboy
was Lenna Sjooblom, from which the standard image we've all seen many
times is taken.

Now that we've found out all about Lenna, does anyone know who Claire
& Miss America were in the standard video test sequences that are
widely used?

GLen
Newsgroups: sci.image.processing,comp.graphics
From: ben@ph.tn.tudelft.nl (Ben Verwer)
Subject: Re: Noise Reducing w/ Edge Enhancement
Organization: Delft University of Technology
Date: Tue, 28 Jul 1992 17:52:55 GMT

jle@dam.brown.edu (Jon Elion) writes:

>Would be interested in from anyone who has experience with image
>filtering techniques for noise reduction that simultaneously ENHANCE
>edges.  Normally, these two operations are mutually exclusive (as
>noise reduction can tend to BLUR edges, not sharpen them).  There
>exist non-linear approaches that achieve this goal (although
>tending to be computationally very intensive).

>Application is x-ray fluoroscopy (noise is Poisson).  Goal is to reduce
>the Poisson noise while providing edge enhancement.

>Anecdotes, experience, pointers to articles, etc. would be appreciated.

How about: Edge preserving smoothing
Proc, 4th Int. Conf on Pattern Recognition
Nov 7-10 1978 Kyoto
Nagao & Matsuyama


Basically, compute variance and mean in 4 quadrants in the neighbourhood
around a point and take the mean of the quadrant with the lowest vaariance.
In TCL-Image on a Quadra: 1.9 seconds for a 256*256 image independent of
neighbourhoodsize.

Ben
From: mrd@ecs.soton.ac.uk (Mark Dobie)
Newsgroups: sci.image.processing
Subject: Re: 24-bit displays
Date: 21 Jul 92 15:11:55 GMT

In <1992Jul15.044034.27437@ms.uky.edu> sean@ms.uky.edu (Sean Casey) writes:
>In article <BrEKwI.1nL@syd.dms.CSIRO.AU> chriss@dmssyd.syd.dms.CSIRO.AU (Chris Skelsey) writes:
>:Additionally, we would like to be able to alter the lookup tables for each of
>:the Red, Green and Blue channels.

>Hrm. I thought 24 bit color meant you didn't have lookup tables. Is
>that not the case?

Even with 24 bit colour, lookup tables between the frame store and
output are useful for previewing changes to an image. You can
interactively fiddle with colour, brightness, contrast etc and when
you are satisfied remap the image through the lookup tables back onto
the frame store. This is much easier (and faster) than changing the
actual image data all the time.

				Mark.
-- 
Mark Dobie                              M.R.Dobie@uk.ac.soton.ecs (JANET)
University of Southampton		M.R.Dobie@ecs.soton.ac.uk (The World)
Newsgroups: sci.image.processing
From: ritley@uimrl7.mrl.uiuc.edu ()
Subject: Re: Image processing package...
Reply-To: ritley@uiucmrl.bitnet ()
Organization: Materials Research Lab
Date: Sat, 25 Jul 1992 12:46:54 GMT

In article <1992Jul24.113320.8898@uoft02.utoledo.edu>,
jarney@jupiter.cse.utoledo.edu (jonathan arney) writes:

|>   At any rate, I am looking for more ideas from anyone even vaguely
|>interested 
|>  in image procesing for routines to include...				   -Jon Arney
|>				   jarney@jupiter.cse.utoledo.edu

You mentioned some image processing routines which you have included,
and you have
requested suggestions for more routines to include.

I'd like to point out that, for many applications, the ability to
process a user-selected
subset of an image is crucial.  Examples of this include selecting and
"zooming"
a portion of an image on a display device, selecting a subset of an
image
and then performing some operation (such as a Fourier transform) on the
subset,
selecting multiple subsets and comparing them (or, for example, adding
them)
in some manner.  For my own work, it is essential that I be able to
select a
subset of an image, then be able to "integrate" the subset by summing
the
pixel rows or columns - and ultimately output this information to a
file.

Unfortunately, the interactive selection of a subset of an image is
probably more
effective and easier by means of GUI-type programs, rather than by
command-line-
driven programs.  Fortunately, it may be relatively simple to construct
a
device-dependent shell which is capable of executing your command-line
program
while providing basic GUI features (use of a pointing device, mouse,
etc.). 

Finally, you can always get good ideas by looking at existing software
packages.
There has been some discussion on this newsgroup of existing image
processing packages, and I'd like to put in a plug for IRAF, the Image
Reduction and Analysis Facility (more info is probably available
through
NOAO, P.O.Box 26732, Tucson AZ 85726).  This is a COLOSSAL public-domain
(?) package
developed by the National Optical Astronomy Observatories (NOAO), and
in
part by the Space Telescope Science Institute (STScI) and others.  This
package
has an extensive compliment of functions for processing astronomical
data,
but in addition has plenty of general image processing tools.  It is
also extensible,
so you may develop your own tools for use with IRAF.  It is supported
on a wide variety of machines, and it is quite simple to install - but
it is HUGE!  If nothing else,
finding out more about the tools included in this package might give
you
some good ideas for tools to include in your own program!
Newsgroups: sci.image.processing
From: wiesel@ipf.bau-verm.uni-karlsruhe.de (Joachim Wiesel Ext. 2316)
Subject: Re: 24-bit displays
Reply-To: wiesel@ipf.bau-verm.uni-karlsruhe.de
Organization: IPF, University of Karlsruhe
Date: Wed, 22 Jul 1992 10:57:56 GMT

Try 'ImageMagic' ... It fully supports all X visuals (direct color, true color,
Pseudo Color) on X servers. You can find it  on  export.lcs.mit.edu
in the 'contrib' directory --> ImageMagick.tar.Z

Joachim

---

Joachim Wiesel, Institut fuer Photogrammetrie und Fernerkundung,
Universitaet  Karlsruhe, Englerstr. 7, D-7500 Karlsruhe, Germany
Phone: +49 721 608 2316                      Fax: +49 721 694 568
Internet: wiesel@ipf.bau-verm.uni-karlsruhe.de
From: milack@uts.uni-c.dk (Claus Kristensen)
Newsgroups: sci.image.processing
Subject: Software Needed for epi-flourescence microscopy
Date: 27 Jul 92 22:59:58 GMT
Organization: UNI-C, Danish Computing Centre for Research and Education


From
DEPARTMENT OF MICROBIOLOGY
TECHNICAL UNIVERSITY OF DENMARK
BUILDING 221 - DK-2800 LYNGBY
TEL: +45 45 93 34 22 ext. 2522 / 2515
FAX: +45 45 93 28 09
E-MAIL: milack@uts.uni-c.dk

Re: Software for flourescence microscopy


We are going to set up a facility at this lab for analyzing
bacteria by flourescence microscopy. The images will be cap-
tured with a CCD camera from Photometrics (KAF1400) with a
cooling device (-45 C). The images will be recorded by dedica-
ted software on a 486 PC with 16 Mb RAM. From here a preproces-
sed tiff image will be sent via an ethernet link to a SUN IPX
computer with 16 Mb RAM and 1.7 Gb disk and further analyzed.

What we need will be a program that can quantify spots (cells)
and subtract the background level appropriately. A manual
editing as well as automatic circumscription of the individual
spots should be possible and generation of rapports stating
area and intensity (at the level of pixels) are needed. A
visual output with artificial colors based on superimposed
serial images, each captured with different marker dyes should
also be supported. 

If you know such a program, or suite of programs for unix, public-domain,
shareware or commercial, we would like to hear from you.

We would like pricing and availability information as well.

Also, if you have any additional questions, please contact us.

Yours sincerely,

Claus Kristensen, Ph.D.         Lars Kongsbak Poulsen, Ph.D.

Please send reply by e-mail to milack@uts.uni-c.dk [Claus Kristensen]

Note: we have noticed the review in this forum posted july 27.



-- 
-- Sent from [milack@uts.uni-c.dk]
--  .................................................................
--  . Claus Sternberg Kristensen, M.Sc                              .
--  . Department of Microbiology       Phone +45 45 93 34 22 / 2515 .
--  . Technical University of Denmark  Fax   +45 45 93 28 09        .
--  .................................................................
From: seow@iti.gov.sg (Seow Aik Siong)
Newsgroups: sci.image.processing
Subject: Image rotation algorithms
Date: 29 Jul 92 09:18:14 GMT
Reply-To: seow@iti.gov.sg
Organization: Information Technology Institute National Computer Board
Originator: seow@hephaistos.iti.gov.sg


Hello,
	I am currently working on a program to rotate a bitmap image using
the very simple transformation alogorithm. However, after compiling my C
program, I discovered that it takes 2 minutes to rotate a 64x64 image!!!
I figure later that the main reason for the slow performance of my program
is due to the fact that I am using simple sine and cosine functions to
manipulate floating point numbers...that is why it took so long.
	If there is anyone out there who can offer me some suggestions to
getting my program run faster...please email me. I am currently using
Microsoft C ver 7.00 compiler and 386 machine. Thanx!


** Chris **
From: mark-r@spec0.ee.man.ac.uk (Mark Robinson (JO PhD))
Newsgroups: sci.image.processing
Subject: Buying a lens
Date: 22 Jul 92 08:56:19 GMT
Organization: Dept Electrical and Electronic Eng, Manchester University, UK

Hi.

Quick question about lenses. I want to buy a fixed focus lens
(fixed focus == less glass == lower distortion ?). I would
like an object about 15mm diameter to fill an image with the
object - camera distance somewhere between 40 and 70cm.

How do I calculate the focal length of the lens?

Cheers
Mark
mark-r@snow_white.ee.man.ac.uk
From: alien@essex.ac.uk ("Adrian F Clark")
Newsgroups: sci.image.processing
Subject: Re: image restoration
Date: 28 Jul 92 08:20:12 GMT
Organization: University of Essex, UK
In-reply-to: egntoh@ntuvax.ntu.ac.sg's message of 24 Jul 92 02:53:28 GMT


In article <1992Jul24.105328.1@ntuvax.ntu.ac.sg> egntoh@ntuvax.ntu.ac.sg writes:

> I would like to hv information on image restoration in the area of
> motion blurr and out_of_focus restoration. Could anyone comment on the
> availability of good papers and software? By the way. is there any ftp
> site providing softare or images on image restoration ?

The normal linear way to do this is via the cepstral filtering: linear
motion blur results in two sharp dips in the cepstrum, while defocus
blur results in the superposition of a Bessel onto the cepstrum (which
you can identify by the zero crossings).

Probably the standard papers in this area are:

@ARTICLE{Cannon,
   AUTHOR = "T. Michael Cannon",
   TITLE = "Blind Deconvolution with Spatially Invariant Image Blurs with
            Phase",
   JOURNAL = "IEEE Transactions on Acoustics, Speech, and Signal Processing",
   VOLUME = 24, NUMBER =1, PAGES = "58--63",
   YEAR = "1976",
   KEYWORDS = "enhancement, got"}

@ARTICLE{Cannon-Trussell-Hunt,
   AUTHOR = "T. Michael Cannon and H. Joel Trussell and Barry R. Hunt",
   TITLE = "A Comparison of Image Restoration Methods",
   JOURNAL = "Applied Optics", VOLUME = 17, PAGES = "3384--3390",
   YEAR = "1978",
   KEYWORDS = "enhancement, got"}

Note that cepstral filtering will result in ringing at sharp edges
(after all, you will be throwing away the high frequencies).  To do
any better than this, you have to go to non-linear techniques such as
maximum entropy (MEM) or maximum _a posteriori_ (MAP).

Hope this helps.

--
 Dr Adrian F. Clark                                   JANET: alien@uk.ac.essex
 INTERNET: alien%uk.ac.essex@nsfnet-relay.ac.uk          FAX: (+44) 206-872900
 BITNET: alien%uk.ac.essex@ac.uk              PHONE: (+44) 206-872432 (direct)
 Dept ESE, University of Essex, Wivenhoe Park, Colchester, Essex, C04 3SQ, UK.
Newsgroups: sci.image.processing
From: davef@sdosrv1.gvl.unisys.com (Dave Frymier)
Subject: More what's happening - image compression
Keywords: compression of a single frame
Organization: Paramax Systems, Ivyland, PA
Distribution: USA
Date: Mon, 20 Jul 1992 17:39:08 GMT

As this newsgroup is getting fired up and in keeping with the 
"whats going on" theme, I'd like to ask about the compression of 
simple images (say 16 colors) for transmission as data.  This could
cover most window type screen displays, and other crude but useful 
pictorial data.  With all the data flowing around the world these days,
it seems there would be a lot of work going on in this field.

Dave Frymier




Newsgroups: sci.image.processing
From: latone@trixie.ide.com (Joe Latone)
Subject: Video/Image Processing Problem (Non-fictional)
Organization: Sportsware (Fictional)
Date: Thu, 30 Jul 92 21:30:19 GMT

Hi,

I need some help with a video/image processing application I'm working
with and thought that if I described the problem I'm currently having,
someone might recognize it and suggest a peice of hardware that might
resolve it.

The system is set up as follows (I'll try not to misuse the terminology
and try to be as specific as I can):  A CCD video camera(1) is focused
on a 70 foot-wide area of a baseball field from about 100 feet away and
the object of interest is -- you guessed it -- a baseball.  The video
output from the camera feeds into a digital AV mixer(2) for reasons
which are not of interest here.  The output from the mixer feeds into a
NTSC->RGB converter, which in turn feeds the green and sync into a
PC-based image processing board(3), which digitizes the green signal
into 8 bits/pixel.  One other thing I should let you know is that the
camera is connected to the various video equipment I mentioned by
several hundred feet (approx. 500) of professional quality coax cable.

The purpose of the system is to try to find and track a baseball
automatically by digitizing and processing the video as fast as
possible.

The problem with the system is trying to deal with the various natural
lighting conditions and backgrounds, combinations of which cause the
white ball to get lost in the dark dirt/grass background by the time
the video signal is digitized and processed.  I need a way to maximize
the "brightness/whiteness" of the ball and maximize the
"blackness/darkness" of the sand/grass.  This seems like a fairly
well-contained problem (i.e., the ball is always very white and the
background is always either green or light brown and the lighting
conditions are either early-afternoon natural light or major league
stadium lighting) and one that an additional piece of video processing
hardware or camera filters might be able to solve for me.

Any help would be appreciated.  Hardware specifics are listed below and
I included prices to give you an idea of the quality of the equipment.

Regards, Joe

#include <std/disclaimer>
The information in this posting has nothing to do with my employer, IDE --
it's strictly related to my own computing hobby.

(1) The camera is from a company called Vicom and is a "high-resolution
black and white" video camera.  For what it's worth, it's also a 
"3-chip implementation."  The camera body costs about $1000.

(2) A Panasonic Digital AV Mixer which cosst about $2000.

(3) A Matrox MVP-AT 640 image processing board which costs about $5000.
From: turk@imag.fr (Matthew Turk)
Newsgroups: sci.image.processing
Subject: Re: Datacube
Summary: Datacube mailing list
Date: 22 Jul 92 09:31:06 GMT
Followup-To: turk@lifia.imag.fr
Organization: Institut Imag, Grenoble, France

In article <1992Jul20.221850.11457@ctr.columbia.edu> sion@sioux.ctr.columbia.edu (Boudi Sahyoun) writes:
>
>Any datacube experts around here?
>
>
>Boudi

There is a Datacube mailing list, kept by Mark Stricker at the
University of Chicago.  To join, send mail to
"datacube-request@gargoyle.uchicago.edu".  The traffic is rather low,
but maybe you folks can beef it up a bit.

	Matthew Turk
Newsgroups: sci.image.processing,comp.compression
From: amaravad@copper.ucs.indiana.edu (ratnakar amaravadi)
Subject: Re: Some common algorithms
Organization: Indiana University
Distribution: usa
Date: Wed, 22 Jul 1992 18:26:44 GMT

In article <1992Jul21.193508.14046@csi.uottawa.ca> giridhar@genie.uottawa.com (Giridhar Iyengar) writes:
>Hi yall:
>
>I am looking for code of some of the matrix algorithms like Singular
>value decomposition, matrix inversions etc. Does anybody of you know 
>of any ftp sites where I can find these ? 
>
>Pls reply to giridhar@pixie.genie.uottawa.ca
>
>Thanks
>-giri

MATHEMATICA can do many types of decompositions on matrices.  This
package is most easily available on NeXT work stations.  But it is not
source code though. Wolfram's book on MATHEMATICA is a good reference
to MATHEMATICA programming.  SAS has a module called IML (interactive
matrix language I beleive) which may also do decompositions.  SAS is
available at most places on VMS mainframes.  There is also PC SAS.
You could also check FORTRAN's IMSL libraries.

ratty

amaravad@indiana.edu
From: iftekhar@elm.eecs.ucdavis.edu (Iftekhar Hussain)
Newsgroups: sci.image.processing
Subject: Re: articles on wavelet?
Date: 27 Jul 92 02:16:33 GMT
Reply-To: iftekhar@elm.eecs.ucdavis.edu (Iftekhar Hussain)
Organization: Digital Equipment Corporation

In article <1992Jul26.161427.13379@bernina.ethz.ch>, gst5@igpho (Li) writes:
|> Path: ucdavis!ucbvax!cis.ohio-state.edu!zaphod.mps.ohio-state.edu!mips!darwin.sura.net!Sirius.dfn.de!chx400!bernina!igpho!gst5
|> From: gst5@igpho (Li)
|> Newsgroups: sci.image.processing
|> Subject: articles on wavelet?
|> Message-ID: <1992Jul26.161427.13379@bernina.ethz.ch>
|> Date: Sun, 26 Jul 92 09:14:27 GMT-0:06
|> Sender: news@bernina.ethz.ch (USENET News System)
|> Organization: Swiss Federal Institute of Technology (ETH), Zurich, CH
|> Lines: 9
|> X-Newsreader: Tin 1.1 PL3
|> 
|> Hi,
|> 
|> I was wandering if any one know some publications, articles on 
|> wavelet transform used for edge detection.
|> 
|> Thanks in advance.
|> 
|> Haihong Li
|> gst5@p.igp.ethz.ch
|> 

Characterization of Signals from Multiscale Edges by Stephane Mallat and
Sifen Zhong 

IEEE Trans. on Pattern Anal. and Machine Intel. (PAMI) vol. 14. No. 7.
July 1992 pages: 710-732.

-Iftekhar
From: asr@castle.ed.ac.uk (Angus "Fluffy" Rae)
Newsgroups: sci.image.processing
Subject: Re: Request for algorithm to reduce number of used colours...
Date: 30 Jul 92 15:09:56 GMT
Distribution: sci
Organization: CATHY_VoiceMail_Project

Thanks to everyone who responded to me on this request - I've responded
to those who Emailed individually (I hope) but if I missed you for some
reason, thanks anyway!

For those of you intersted, the original version of the software I'm
helping to revise is on the cover disk of ST Format magzine, not sure
which issue... it's part of a package of three GFA Raytrace utilities.
The author is listed as "Stargate 42".

The next version is expected sometime before the Big Crunch.
:-)


-- 
Angus G Rae, the Cuddly Vampire Teddy Bear [asr@castle.edinburgh.ac.uk]
CATHY VoiceMail, Computer Science Dept., Edinburgh University
"I'm on the run from the Facist Police with a murderer and
 a mass murderer and a man in a bri-nylon shirt."  Rimmer, Red Dwarf V