Jack Koplowitz

25 papers A* 1Misc 1Journal 22Unranked 1
YearRankTypeTitle / Venue / Authors
1996 Misc conf
A Study on Subpixel Smoothing for Binary Images.
MVA
Megumi Kawata, Jack Koplowitz, Masato Sakata
1996 J jnl
Hierarchical Representation of Chain-Encoded Binary Image Contours.
Comput. Vis. Image Underst.
Jack Koplowitz, Joseph DeLeone
1995 J jnl
Corner detection for chain coded curves.
Pattern Recognit.
Jack Koplowitz, Stephen Plante
1994 — conf
Multiresolution Chain Coding of Contours.
ICIP (2)
J. S. Lerman, Sanjeev R. Kulkarni, Jack Koplowitz
1994 J jnl
On the Edge Location Error for Local Maximum and Zero-Crossing Edge Detectors.
IEEE Trans. Pattern Anal. Mach. Intell.
Jack Koplowitz, Vito Greco
1994 J jnl
On the number of digital convex polygons inscribed into an (m, m)-grid.
IEEE Trans. Inf. Theory
A. Ivic, Jack Koplowitz, Jovisa D. Zunic
1992 J jnl
Chain codes and their linear reconstruction filters.
IEEE Trans. Inf. Theory
Ping Wah Wong, Jack Koplowitz
1991 J jnl
A New Parameterization of Digital Straight Lines.
IEEE Trans. Pattern Anal. Mach. Intell.
Michael Lindenbaum, Jack Koplowitz
1991 J jnl
Approximation for the Location of the Center of a Disk.
SIAM Rev.
M. L. Glasser, Jack Koplowitz
1990 J jnl
The number of digital straight lines on an N×N grid.
IEEE Trans. Inf. Theory
Jack Koplowitz, Michael Lindenbaum, Alfred M. Bruckstein
1989 J jnl
Design of Perimeter Estimators for Digitized Planar Shapes.
IEEE Trans. Pattern Anal. Mach. Intell.
Jack Koplowitz, Alfred M. Bruckstein
1989 J jnl
Tree Searched Chain Coding for Subpixel Reconstruction of Planar Curves.
IEEE Trans. Pattern Anal. Mach. Intell.
Raghavachari Sriraman, Jack Koplowitz, Seshadri Mohan
1988 J jnl
Compression of chain codes using digital straight line sequences.
Pattern Recognit. Lett.
Michael Lindenbaum, Jack Koplowitz
1988 A* conf
On the number of digital straight lines on an N×N grid.
CVPR
Michael Lindenbaum, Jack Koplowitz, Alfred M. Bruckstein
1987 J jnl
A Robust Filtering Algorithm for Subpixel Reconstruction of Chain Coded Line Drawings.
IEEE Trans. Pattern Anal. Mach. Intell.
Jack Koplowitz, A. P. Sundar Raj
1986 J jnl
On bit reduction of chain coded line drawings.
Pattern Recognit. Lett.
A. P. Sundar Raj, Jack Koplowitz
1985 J jnl
Fourier Encoding of Closed Planar Boundaries.
IEEE Trans. Pattern Anal. Mach. Intell.
G. Stephen Zabele, Jack Koplowitz
1985 J jnl
On the performance of edited nearest neighbor rules in high dimensions.
IEEE Trans. Syst. Man Cybern.
Andrei Z. Broder, Alfred M. Bruckstein, Jack Koplowitz
1981 J jnl
On the Performance of Chain Codes for Quantization of Line Drawings.
IEEE Trans. Pattern Anal. Mach. Intell.
Jack Koplowitz
1981 J jnl
On the relation of performance to editing in nearest neighbor rules.
Pattern Recognit.
Jack Koplowitz, Thomas A. Brown
1979 J jnl
Finite memory hypothesis testing with dependent samples (Corresp.).
IEEE Trans. Inf. Theory
Jack Koplowitz
1979 J jnl
The weighted nearest neighbor rule for class dependent sample sizes (Corresp.).
IEEE Trans. Inf. Theory
Thomas A. Brown, Jack Koplowitz
1978 J jnl
A More Efficient Convex Hull Algorithm.
Inf. Process. Lett.
Jack Koplowitz, D. Jouppi
1975 J jnl
Necessary and sufficient memory size for m-hypothesis testing.
IEEE Trans. Inf. Theory
Jack Koplowitz
1973 J jnl
Sequential estimation with a finite statistic.
IEEE Trans. Inf. Theory
Jack Koplowitz, Richard A. Roberts