Showing papers by "Azriel Rosenfeld published in 1972"
TL;DR: Further work is described on simple sets of parallel operations that detect "texture edges" (abrupt discontinuities in the average values of local picture properties), as well as spots or streaks that are texturally different from their surrounds.
Abstract: Further work is described on simple sets of parallel operations that detect "texture edges" (abrupt discontinuities in the average values of local picture properties), as well as spots or streaks that are texturally different from their surrounds.
124 citations
TL;DR: Topics covered include picture compression; image enhancement; matched filtering, edge and curve detection; picture processing implementations; pictorial pattern recognition; picture properties; picture parts and picture description; and picture automata and grammars.
90 citations
01 Feb 1972
TL;DR: In this paper, the order in which template points are compared to the corresponding picture points (for each position of the template on the picture) is selected to make the digital template matching more efficient.
Abstract: Digital template matching can be made more efficient by selecting the order in which template points are compared to the corresponding picture points (for each position of the template on the picture).
39 citations
TL;DR: Certain arrangements of local features in a scene tend to group together and to be seen as units, and it is suggested that this phenomenon might be interpretable as a process of cluster detection in a graph-structured space derived from the scene.
Abstract: Certain arrangements of local features in a scene tend to group together and to be seen as units. It is suggested that, in some instances, this phenomenon might be interpretable as a process of cluster detection in a graph-structured space derived from the scene. This idea is illustrated using a class of line-drawing ``scenes'' that contain only horizontal and vertical line segments.
6 citations
01 Oct 1972
TL;DR: This paper describes how to do useful, nontrivial image processing tasks interactively using only a standard alphanumeric CRT terminal, or even a teletype, with no need for a dedicated computer or channel.
Abstract: : The paper describes how to do useful, nontrivial image processing tasks interactively using only a standard alphanumeric CRT terminal, or even a teletype. Only an ordinary time-sharing system is required; there is no need for a dedicated computer or channel, or even for special priority on the system.
2 citations
01 Jan 1972
TL;DR: In this article, bounds on the complexity of grammars are discussed in terms of the length of the longest member in any rewriting rule, the size of the vocabulary, and the number of rules.
Abstract: Publisher Summary This chapter discusses bounds on the complexity of grammars. One can study various measures of the complexity of a grammar. The chapter discusses three such measures-rule length, vocabulary size, and number of rules. A difficult problem is that of finding a grammar that has minimum complexity in regard to two or more of the measures. Any language has grammars for which each of these measures individually has a low value. The chapter discusses terms of three measures of the complexity of a grammar: λ, the length of the longest member in any rewriting rule; v, the size of the vocabulary; and ρ, the number of rules. Any language has grammars in which any one of these measures has a low value, but this can in general be achieved only at the expense of increasing one or both of the other two measures. Bounds on v as a function of λ are obtained in a number of cases; in most of these cases, the grammars are required to be context free.
TL;DR: In this paper, the similarity of pairs of patterns made up of 10x10 arrays of short line segments was measured with respect to the variability of occurrence of each of eight possible angles of orientation of the individual segments.
Abstract: Ss judged the similarity of pairs of patterns made up of 10x10 arrays of short line segments. Patterns differed with respect to the variability of occurrence of each of eight possible angles of orientation of the individual segments. The amount of information per line segment was the best linear predictor of the average similarity ratings. Other measures of statistical properties of these patterns are also described.