Professional Documents
Culture Documents
U
InP/InGaAs technology.
28th Nowmber 1991
M. Ban& B. Jalali, D. A. Humphrey, R. K. Montgomery, R. N.Not- U
tenburg, R. A. H a and M. B. Panish (AT&T Bell Laboratories,
Murray Hill, NJ 07974, USA)
Reference
1 Y A ~ U C H I Y., o., NAGATA, K., im, H., and ISHIB*SHI, T.:
, NAKNIMA,
AIGaAsIGaAs HBTs. Proc. IEEE of 1989 GaAs Symp., pp,
121-124
2 WANG, K. C., ASBECK, P. M., ClUNG, M. F., NUBLING, R. 8.. PIEWON, R.
L., SHENG, N. H., SULLIVAN, G . I., YU, I., CHEN, A., CLEMBNT, n., rsm,
T. c., BASIT, H. F., GEORGE, I. D., and YOUNG, R.: AIGaAsIGaAs
heterojunction bipolar transistors. ISSCC Dig. of Technical
Papers, February 1991,pp. 154-155
3 I A U L I , B., NOTTENBURG, R. N., BANU, M., MONTGOMERY, R. K., LEVI, A.
F. G., PANISN, M. B., and CHO, A. Y.: High speed InGaAs HBT
devios and circuits. Proc. Third Int. Conf. on InP and Related
Materials, Cardiff, Wales, United Kingdom, 8th-11th April 1991,
pp. 228-233 l2mm
4 REIN, H. M., and HAUENSCHILD, 1.: 23Gbitis Si bipolar decision 1555111
circuit consisting of 24Gbit/s MUX and DEMUX ICs: Electron.
Lett., 1991.27, (11). pp. 974-976 Fig. 1 Layout of three-pole Chebyshev bondpassfilter
. 1 r n- NHKlSRL
-
Trans., 1991, MAG-21, (2). pp. 2553-2556 denotes the grey-level value of an image and the value of the
KALOKITL~, o., et d.:Performanceof a narrow band microwave edge in Fig. Ib is the edge strength calculated by eqn. 1. If the
filter implemented in thin-hlm YBa,Cu,O, with ohmic wn-
()$$ -
tacti, Appl. Phys. Lett., 1991.58, (5). pp. 537-539
NEWMAN, H. s, et al.: Microwave devices using YBa,Cu,O,-,
films made by pulsed laser deposition, IEEE Trans., 1991,
MAG-27, (Z), pp. 2540-2543 ZQO
TALISA, s. H., et 01.: Microwave superwnducting filters, IEEE
Trans., 1991, MAG-21, (2). pp. 2544-2547
2 0
TALISA, s. H., IANCCKO, M. A., TALVACCHIO, I., and MOGKOWIIZ,c.:
Present and projected performance of high-temperature superwn-
ducting filters.IEEE MTT-S Dig., 1991, pp. 1325-1328 Fig. 1 Hexayono1 tesselllotion and edge strength
a Hexagonal tessellation
b Edge strength
pling yields smaller quantisation errors than square sampling number of i incident edges at that vertex V. For the square
[2]. Horn [3] shows advantages of hexagonal grids for com- grid in Fig. 2b, there are four different vertex types [ l ] .
puter vision application. The hexagonal grids allow improved
sampling and quantisation during the image formation TaMe 1 HEXAGONAL EDGE RELAXATION
process, and remarkably improve the understanding of coo- ALGORITHM
nectivity.
The conventional edge relaxation [ l ] improves the con- (I) Determine confidence level E ( e ) for all edges e
fidence of detected edges using neighbouring edge information Initially, we define I?(e) = s(e)/max $e) for all edges e
in square grid. For each edge, its confidence level is initially Let k = 0
defined as its edge strength which is the difference of neigh- (2) While there exists L!(e) which is neither 0 nor 1:
bouring pixel values and adjusted dynamically as the relax- (i) ktt
ation proceeds. (ii) Compute Z ( e ) from local information around edge e
In this Letter the edge relaxation is applied to the hexago- (a) Classify the two vertices of an edge e,
nal grids rather than to the square grids. In the hexagonal based on the confidence levels of surrounding edges
edge relaxation, the edge type can he determined unam- (b) Classify edge e, based on its vertex types
biguously from the small number of pairs of vertex type (e) Update Lye), based on its edge classifications
whether incremented, decremented or unchanged, and the (3) End
edge confidence level is updated, explained in the following
Section. Because of the unambiguous classification of edge
type, this new relaxation algorithm does not cause a degrada- Now using this vertex type, each edge which is a link
tion effect which usually appears in relaxation approaches. between two vertices can also be classified into six different
pairings as in Fig. 3. For the square grid there are 10 different
Hexagonal edge relaxation: The hexagonal image can be pairings. The edge type is depicted by the pairing vertex type
obtained by simply shifting the even or odd rows of a given of the vertex V and that of vertex W such as (qyw- q-).
image by half a pixel to the right or left. In this hexagonal
tessellation, all six pixels touching a central cell are neigh-
hours so there is no ambiguity in determining its neighbours a b b
as shown in Fig. l a , where pixel value is represented by
integer values. In the case of image formation, there is no
difference in resolution between a rectangular grid and hex-
agonal grid. The edge defined by the Prager method is
obtained by a fourconnectedness neighbour, hut a hexagonal 0 b m
edge is acquired in a six-connectedness sense.
We now explain the hexagonal edge relaxation algorithm. Fig. 2 Vertex classficntion
The edges are located between adjacent pixels in the hexago- (I Hexagonal grid