default search action
Jack Koplowitz
1990 – 1999
- 1996
- [j22]Jack Koplowitz, Joseph DeLeone:
Hierarchical Representation of Chain-Encoded Binary Image Contours. Comput. Vis. Image Underst. 63(2): 344-352 (1996) - [c3]Megumi Kawata, Jack Koplowitz, Masato Sakata:
A Study on Subpixel Smoothing for Binary Images. MVA 1996: 119-122 - 1995
- [j21]Jack Koplowitz, Stephen Plante:
Corner detection for chain coded curves. Pattern Recognit. 28(6): 843-852 (1995) - 1994
- [j20]Jack Koplowitz, Vito Greco:
On the Edge Location Error for Local Maximum and Zero-Crossing Edge Detectors. IEEE Trans. Pattern Anal. Mach. Intell. 16(12): 1207-1212 (1994) - [j19]A. Ivic, Jack Koplowitz, Jovisa D. Zunic:
On the number of digital convex polygons inscribed into an (m, m)-grid. IEEE Trans. Inf. Theory 40(5): 1681-1686 (1994) - [c2]J. S. Lerman, Sanjeev R. Kulkarni, Jack Koplowitz:
Multiresolution Chain Coding of Contours. ICIP (2) 1994: 615-619 - 1992
- [j18]Ping Wah Wong, Jack Koplowitz:
Chain codes and their linear reconstruction filters. IEEE Trans. Inf. Theory 38(2): 268-280 (1992) - 1991
- [j17]Michael Lindenbaum, Jack Koplowitz:
A New Parameterization of Digital Straight Lines. IEEE Trans. Pattern Anal. Mach. Intell. 13(8): 847-852 (1991) - [j16]M. L. Glasser, Jack Koplowitz:
Approximation for the Location of the Center of a Disk. SIAM Rev. 33(4): 657 (1991) - 1990
- [j15]Jack Koplowitz, Michael Lindenbaum, Alfred M. Bruckstein:
The number of digital straight lines on an N×N grid. IEEE Trans. Inf. Theory 36(1): 192-197 (1990)
1980 – 1989
- 1989
- [j14]Raghavachari Sriraman, Jack Koplowitz, Seshadri Mohan
:
Tree Searched Chain Coding for Subpixel Reconstruction of Planar Curves. IEEE Trans. Pattern Anal. Mach. Intell. 11(1): 95-104 (1989) - [j13]Jack Koplowitz, Alfred M. Bruckstein:
Design of Perimeter Estimators for Digitized Planar Shapes. IEEE Trans. Pattern Anal. Mach. Intell. 11(6): 611-622 (1989) - 1988
- [j12]Michael Lindenbaum, Jack Koplowitz:
Compression of chain codes using digital straight line sequences. Pattern Recognit. Lett. 7(3): 167-171 (1988) - [c1]Michael Lindenbaum, Jack Koplowitz, Alfred M. Bruckstein:
On the number of digital straight lines on an N×N grid. CVPR 1988: 610-615 - 1987
- [j11]Jack Koplowitz, A. P. Sundar Raj:
A Robust Filtering Algorithm for Subpixel Reconstruction of Chain Coded Line Drawings. IEEE Trans. Pattern Anal. Mach. Intell. 9(3): 451-457 (1987) - 1986
- [j10]A. P. Sundar Raj, Jack Koplowitz:
On bit reduction of chain coded line drawings. Pattern Recognit. Lett. 4(2): 99-102 (1986) - 1985
- [j9]G. Stephen Zabele, Jack Koplowitz:
Fourier Encoding of Closed Planar Boundaries. IEEE Trans. Pattern Anal. Mach. Intell. 7(1): 98-102 (1985) - [j8]Andrei Z. Broder, Alfred M. Bruckstein, Jack Koplowitz:
On the performance of edited nearest neighbor rules in high dimensions. IEEE Trans. Syst. Man Cybern. 15(1): 136-139 (1985) - 1981
- [j7]Jack Koplowitz:
On the Performance of Chain Codes for Quantization of Line Drawings. IEEE Trans. Pattern Anal. Mach. Intell. 3(2): 180-185 (1981) - [j6]Jack Koplowitz, Thomas A. Brown:
On the relation of performance to editing in nearest neighbor rules. Pattern Recognit. 13(3): 251-255 (1981)
1970 – 1979
- 1979
- [j5]Jack Koplowitz:
Finite memory hypothesis testing with dependent samples (Corresp.). IEEE Trans. Inf. Theory 25(2): 210-213 (1979) - [j4]Thomas A. Brown, Jack Koplowitz:
The weighted nearest neighbor rule for class dependent sample sizes (Corresp.). IEEE Trans. Inf. Theory 25(5): 617-619 (1979) - 1978
- [j3]Jack Koplowitz, D. Jouppi:
A More Efficient Convex Hull Algorithm. Inf. Process. Lett. 7(1): 56-57 (1978) - 1975
- [j2]Jack Koplowitz:
Necessary and sufficient memory size for m-hypothesis testing. IEEE Trans. Inf. Theory 21(1): 44-46 (1975) - 1973
- [j1]Jack Koplowitz, Richard A. Roberts:
Sequential estimation with a finite statistic. IEEE Trans. Inf. Theory 19(5): 631-635 (1973)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
