Jack Koplowitz

According to our database, Jack Koplowitz authored at least 24 papers between 1973 and 1996.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1996

Hierarchical Representation of Chain-Encoded Binary Image Contours.

Jack Koplowitz, Joseph DeLeone

Comput. Vis. Image Underst., 1996

A Study on Subpixel Smoothing for Binary Images.

Megumi Kawata, Jack Koplowitz, Masato Sakata

Proceedings of IAPR Workshop on Machine Vision Applications, 1996

1995

Corner detection for chain coded curves.

Jack Koplowitz, Stephen Plante

Pattern Recognit., 1995

1994

On the number of digital convex polygons inscribed into an (m, m)-grid.

A. Ivic, Jack Koplowitz, Jovisa D. Zunic

IEEE Trans. Inf. Theory, 1994

On the Edge Location Error for Local Maximum and Zero-Crossing Edge Detectors.

Jack Koplowitz, Vito Greco

IEEE Trans. Pattern Anal. Mach. Intell., 1994

Multiresolution Chain Coding of Contours.

J. S. Lerman, Sanjeev R. Kulkarni, Jack Koplowitz

Proceedings of the Proceedings 1994 International Conference on Image Processing, 1994

1992

Chain codes and their linear reconstruction filters.

Ping Wah Wong, Jack Koplowitz

IEEE Trans. Inf. Theory, 1992

1991

Approximation for the Location of the Center of a Disk.

M. L. Glasser, Jack Koplowitz

SIAM Rev., 1991

A New Parameterization of Digital Straight Lines.

Michael Lindenbaum, Jack Koplowitz

IEEE Trans. Pattern Anal. Mach. Intell., 1991

1990

The number of digital straight lines on an N×N grid.

Jack Koplowitz, Michael Lindenbaum, Alfred M. Bruckstein

IEEE Trans. Inf. Theory, 1990

1989

Tree Searched Chain Coding for Subpixel Reconstruction of Planar Curves.

Raghavachari Sriraman, Jack Koplowitz, Seshadri Mohan

IEEE Trans. Pattern Anal. Mach. Intell., 1989

Design of Perimeter Estimators for Digitized Planar Shapes.

Jack Koplowitz, Alfred M. Bruckstein

IEEE Trans. Pattern Anal. Mach. Intell., 1989

1988

Compression of chain codes using digital straight line sequences.

Michael Lindenbaum, Jack Koplowitz

Pattern Recognit. Lett., 1988

1987

A Robust Filtering Algorithm for Subpixel Reconstruction of Chain Coded Line Drawings.

Jack Koplowitz, A. P. Sundar Raj

IEEE Trans. Pattern Anal. Mach. Intell., 1987

1986

On bit reduction of chain coded line drawings.

A. P. Sundar Raj, Jack Koplowitz

Pattern Recognit. Lett., 1986

1985

On the performance of edited nearest neighbor rules in high dimensions.

Andrei Z. Broder, Alfred M. Bruckstein, Jack Koplowitz

IEEE Trans. Syst. Man Cybern., 1985

Fourier Encoding of Closed Planar Boundaries.

G. Stephen Zabele, Jack Koplowitz

IEEE Trans. Pattern Anal. Mach. Intell., 1985

1981

On the relation of performance to editing in nearest neighbor rules.

Jack Koplowitz, Thomas A. Brown

Pattern Recognit., 1981

On the Performance of Chain Codes for Quantization of Line Drawings.

Jack Koplowitz

IEEE Trans. Pattern Anal. Mach. Intell., 1981

1979

Finite memory hypothesis testing with dependent samples (Corresp.).

Jack Koplowitz

IEEE Trans. Inf. Theory, 1979

The weighted nearest neighbor rule for class dependent sample sizes (Corresp.).

Thomas A. Brown, Jack Koplowitz

IEEE Trans. Inf. Theory, 1979

1978

A More Efficient Convex Hull Algorithm.

Jack Koplowitz, D. Jouppi

Inf. Process. Lett., 1978

1975

Necessary and sufficient memory size for m-hypothesis testing.

Jack Koplowitz

IEEE Trans. Inf. Theory, 1975

1973

Sequential estimation with a finite statistic.

Jack Koplowitz, Richard A. Roberts

IEEE Trans. Inf. Theory, 1973