| On the relation of performance to editing in nearest neighbor rules J Koplowitz, TA Brown Pattern Recognition 13 (3), 251-255, 1981 | 112 | 1981 |
| On the performance of chain codes for quantization of line drawings J Koplowitz IEEE Transactions on Pattern analysis and Machine intelligence, 180-185, 1981 | 87 | 1981 |
| Design of perimeter estimators for digitized planar shapes J Koplowitz, AM Bruckstein IEEE Transactions on Pattern Analysis and Machine Intelligence 11 (6), 611-622, 1989 | 84 | 1989 |
| On the edge location error for local maximum and zero-crossing edge detectors J Koplowitz, V Greco IEEE Transactions on Pattern Analysis and Machine Intelligence 16 (12), 1207 …, 1994 | 77 | 1994 |
| Corner detection for chain coded curves J Koplowitz, S Plante Pattern Recognition 28 (6), 843-852, 1995 | 71 | 1995 |
| The number of digital straight lines on an n* n grid J Koplowitz, M Lindenbaum, A Bruckstein IEEE Transactions on Information Theory 36 (1), 192-197, 1990 | 69 | 1990 |
| The weighted nearest neighbor rule for class dependent sample sizes (Corresp.) T Brown, J Koplowitz IEEE Transactions on Information Theory 25 (5), 617-619, 1979 | 67 | 1979 |
| Identification of power system load dynamics using artificial neural networks M Bostanci, J Koplowitz, CW Taylor IEEE Transactions on Power Systems 12 (4), 1468-1473, 1997 | 59 | 1997 |
| A new parameterization of digital straight lines M Lindenbaum, J Koplowitz IEEE Transactions on Pattern Analysis & Machine Intelligence 13 (08), 847-852, 1991 | 48 | 1991 |
| Necessary and sufficient memory size for m-hypothesis testing J Koplowitz IEEE Transactions on Information Theory 21 (1), 44-46, 1975 | 37 | 1975 |
| A robust filtering algorithm for subpixel reconstruction of chain coded line drawings J Koplowitz, APS Raj IEEE transactions on pattern analysis and machine intelligence, 451-457, 1987 | 31 | 1987 |
| A more efficient convex hull algorithm J Koplowitz, D Jouppi Information Processing Letters 7 (1), 56-57, 1978 | 23 | 1978 |
| On the number of digital convex polygons inscribed into an (m, m)-grid A Ivic, J Koplowitz, J Zunic IEEE Transactions on Information Theory 40 (5), 1681-1686, 1994 | 21 | 1994 |
| Fourier encoding of closed planar boundaries GS Zabele, J Koplowitz IEEE transactions on pattern analysis and machine intelligence, 98-102, 1985 | 20 | 1985 |
| Hierarchical representation of chain-encoded binary image contours J Koplowitz, J DeLeone Computer Vision and Image Understanding 63 (2), 344-352, 1996 | 18 | 1996 |
| Chain codes and their linear reconstruction filters PW Wong, J Koplowitz IEEE Transactions on Information Theory 38 (2), 268-280, 1992 | 16 | 1992 |
| Tree searched chain coding for subpixel reconstruction of planar curves R Sriraman, J Koplowitz, S Mohan IEEE transactions on pattern analysis and machine intelligence 11 (1), 95-104, 1989 | 13 | 1989 |
| A unified theory of coding schemes for the efficient transmission of line drawings J Koplowitz, GT Toussaint Proceedings of the 1976 IEEE Conference on Communications and Power, 205-208, 1976 | 12 | 1976 |
| Sequential estimation with a finite statistic J Koplowitz, R Roberts IEEE Transactions on Information Theory 19 (5), 631-635, 1973 | 12 | 1973 |
| On the number of digital straight lines on a square grid J Koplowitz, AM Bruckstein, M Lindenbaum Technion-IIT, Department of Electrical Engineering, 1987 | 10 | 1987 |
Alfred BrucksteinOllendorff Chair in Science, Technion, IIT, Haifa, IsraelVerified email at cs.technion.ac.il
