head	1.4;
access;
symbols
	r0_10:1.4
	Eglin_alpha_1:1.3;
locks; strict;
comment	@# @;


1.4
date	93.08.03.16.29.48;	author jm;	state Exp;
branches;
next	1.3;

1.3
date	93.05.27.11.41.13;	author thoth;	state Exp;
branches;
next	1.2;

1.2
date	93.05.18.21.44.57;	author thoth;	state Exp;
branches;
next	1.1;

1.1
date	93.03.18.11.23.20;	author thoth;	state Exp;
branches;
next	;


desc
@descriptions of the convolutions possible with int templates.
@


1.4
log
@Added median_neighborhood convolution operation. It uses the class
"IA_List", a simplified list created specially for this purpose.
@
text
@#
#	Copyright 1993, Center for Computer Vision and Visualization,
#	University of Florida.  All rights reserved.
#

#
# $Log:	int-convolutions.desc,v $
# Revision 1.3  93/05/27  11:41:13  thoth
# Copyright Notices
# 
# Revision 1.2  93/05/18  21:44:57  thoth
# New more descriptive names for standard convolutions.
# 
# Revision 1.1  93/03/18  11:23:20  thoth
# Initial revision
# 

int linear_product int int zero=0
init:	RTYPE	a = 0;
accum:	a += IVAL * TVAL;
final:	IRESULT = a;

int addmax_product int int zero=-MAXINT
init:	RTYPE	a=-MAXINT;
accum:	RTYPE temp = IVAL+TVAL; if (temp > a) a = temp;
final:	IRESULT = a;

# double addmax double double zero=-MAXDOUBLE
# init:	RTYPE	a=-MAXDOUBLE;
# accum:	RTYPE temp = IVAL+TVAL; if (temp > a) a = temp;
# final:	IRESULT = a;
#

int addmin_product int int  zero=MAXINT
init:	RTYPE	a=MAXINT;
accum:	register IBTYPE ival = IVAL; if (ival == MAXINT) continue; RTYPE temp = ival+TVAL; if (temp < a) a = temp;
accvar:	RTYPE temp = IVAL+TVAL; if (temp < a) a = temp;
final:	IRESULT = a;

# double addmin double double
# init:	RTYPE	a=MAXDOUBLE;
# accum:	RTYPE temp = IVAL+TVAL; if (temp < a) a = temp;
# final:	IRESULT = a;
#

int median_neighborhood int int zero=0
init:	IA_List acc((templ.domain()).card());
accum:	if (TVAL) acc = acc * IVAL;
final:	IRESULT = acc.median();

@


1.3
log
@Copyright Notices
@
text
@d8 3
d45 6
@


1.2
log
@New more descriptive names for standard convolutions.
@
text
@d2 5
d8 3
@


1.1
log
@Initial revision
@
text
@d2 4
a5 1
# $Log$
d7 1
a7 1
int gcon int int zero=0
d12 1
a12 1
int addmax int int zero=-MAXINT
d23 1
a23 1
int addmin int int  zero=MAXINT
@
