Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Morton Nadler

dblp:34/6824 · DBLP profile ↗
← Back
11ranked-venue papers
6as first author
0since 2021 · last 2002
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-authorArtificial intelligence and machine learning · 2 · 1 first-authorSystems, architecture and hardware · 2 · 2 first-authorComputer networks · 1Theory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
2 papers
Image and video coding · 50% Image and video processing · 50%
Human-computer interaction and pervasive computing
1 paper
Accessibility and assistive technology · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video processing
edge detection
0.021987
Predictive Image Coding with Pseudo-Laplacian Edge Detector · IEEE J. Sel. Areas Commun. 1987
The telesign project · Proc. IEEE 1985
Image and video coding
predictive coding
0.011987
Predictive Image Coding with Pseudo-Laplacian Edge Detector · IEEE J. Sel. Areas Commun. 1987
Image and video coding
image compression
0.011985
The telesign project · Proc. IEEE 1985
Machine learning › Probabilistic and Bayesian machine learning
statistical decision theory
0.011971
Error and Reject Rates in a Hierarchical Pattern Recognizer · IEEE Trans. Computers 1971
Coding theory › error-correcting codes
block codes
0.011962
A 32-point n=12, d=5 code (Corresp.) · IRE Trans. Inf. Theory 1962
Coding theory
error-correcting codes
0.011962
A 32-point n=12, d=5 code (Corresp.) · IRE Trans. Inf. Theory 1962

Methods — techniques the papers use, named apart from their topics

psychovisual experiment · 0.0binary coding · 0.0delta modulation · 0.0DPCM · 0.0statistical analysis · 0.0
YearPublicationVenuePosition
2002 Non-contact velocity compensation system for handheld scanners
Nikos Asimopoulos, Morton Nadler
Pattern Recognit.2
1990 Vector quantization with 3-D gradient motion compensation
abstract
Several new methods for vector quantization of image sequence were developed in this paper. The 3-d gradient operator1 and the newly developed stochastic gradient operator was used to estimate the motion vector on the present frame in a pixel-bypixel basis. Two new methods of block motion estimation using the pixel motion vectors were studied. The methods either use the pixel motion vectors directly on the moving block or calculate the block motion vector from the pixel motion vectors. Then for both of the methods, the differences between the prediction block and the moving block are vector quantized. The gradual deterioration of the image frames due to the incorrect matching of the code vectors and the difference blocks could be suppressed with the stochastic gradient operator and a simple smoothing filter for the prediction values. Good quality images for video conferencing applications could be obtained with the bit rate in the neighborhood of 0.15.
Choon Lee, Morton Nadler
VCIP2
1990 Automated stereophotogrammetry
Greg Brookshire, Morton Nadler, Choon Lee
Comput. Vis. Graph. Image Process.2
1990 A note on the coefficients of compass mask convolutions
Morton Nadler
Comput. Vis. Graph. Image Process.1
1987 Predictive Image Coding with Pseudo-Laplacian Edge Detector
abstract
Several edge-adaptive dual-mode predictive coding systems are proposed for coding monochrome video signals. These algorithms use the pseudo-Laplacian edge detector to switch between the textural coding and the edge coding. The one-dimensional Song DM coder and the two-dimensional weighted average prediction DM coder were used for the textural coding. The edge coding was done with either a normal two-dimensional Song DM coder, Graham's DPCM schemes, or a DPCM coder developed by the authors. Nine different combinations of textural and edge coding techniques were developed and simulated. The bit rates of the various schemes were compared, and the range varied between 2.28-3.46 bits/pixel without further compression of the edge information bits or the correction bits. Subjective tests were carried out on images reconstructed according to these schemes. The results show that most of the pictures obtained with the techniques in this paper are superior to the pictures coded by the Song mode normal two-dimensional DM coder alone.
Choon Lee, Morton Nadler
IEEE J. Sel. Areas Commun.2
1985 The telesign project
abstract
Telesign is designed to offer a means of visual communication over a 56- or 64-kbit/s data network. The purpose is to supply a means of visual telecommunication among the members of the deaf community using sign language or lip reading. The system consists of an edge detector followed by digital compression coding to meet channel requirements. Psychometric experiments have shown the need for 25 frames/s with a minimum definition of 128 × 128 points. Edge-detection techniques are discussed from the viewpoint of an unusual quality criterion: the subjective resemblance of the contoured image to the original and, closely related to this, the intelligibility of the image sequence. A classification of edge detectors is given, based upon the position of the contour with respect to the dark/light contrast boundaries in the picture. The relationship of this classification to the quality criterion yields the definition of a new gradient display, called the "shifted gradient," with improved visual quality. The pseudo-Laplacian, well-suited to the problem, is analyzed. Various binary coding techniques are reviewed, and the results of compression given. A psychovisual experiment, performed in conjunction with the INJS (National Institute for the Education of Young Deaf), Paris, France, is described; the results validate the proposed approach. Guidelines are proposed for the design of a real-time device. The application of Telesign to closed-caption TV programs for the deaf viewer is also suggested.
Phililppe Letellier, Morton Nadler, Jean-François Abramatic
Proc. IEEE2
1984 Document segmentation and coding techniques
Morton Nadler
Comput. Vis. Graph. Image Process.1
1971 Error and Reject Rates in a Hierarchical Pattern Recognizer
abstract
The reject and error rates of a certain hierarchical decision structure are derived under assumptions of statistical independence among the members of the hierarchy. It is shown that high decision reliability can be obtained with much more relaxed requirements on the individual recognizers in the hierarchy.
Morton Nadler
IEEE Trans. Computers1
1968 "Empyrean", an alternative paradigm for pattern recognition
Morton Nadler
Pattern Recognit.1
1963 An Analog-Digital Character Recognition System
abstract
The importance of solving the measurement problem in character recognition systems before or collaterally with the decision problem is stressed. Measurements themselves are decision processes. In the system discussed here the measurements constitute decisions on the probable presence and most likely orientation of the edges of the character strokes in each elementary scanning area. This permits an effective and economical sequential feature detection in which the statistical variations due to printing and scanning variations are taken into account. The article concludes with a discussion of the role of the computer in recognition-logic design.
Morton Nadler
IEEE Trans. Electron. Comput.1
1962 A 32-point n=12, d=5 code (Corresp.)
Morton Nadler
IRE Trans. Inf. Theory1