A segmentation is done on a monochrome 256 multiplied by 256 image using only texture information generated by local extreme measurements. The number of extrema of various sizes are counted over a local region and the...
详细信息
A segmentation is done on a monochrome 256 multiplied by 256 image using only texture information generated by local extreme measurements. The number of extrema of various sizes are counted over a local region and these numbers are used to separate the regions. The use of texture edge information in the local averaging process is discussed.
Fuzzy subset theory is introduced as a counterpart of the statistical approaches for the classification of Giemsa stained human chromosomes. Although the structure of the chromosome is well-defined, the real appearanc...
详细信息
Fuzzy subset theory is introduced as a counterpart of the statistical approaches for the classification of Giemsa stained human chromosomes. Although the structure of the chromosome is well-defined, the real appearance and the artisanal features to classify them are ill-defined. An algorithm based on a split and merge procedure, and describing the chromosome profile in a tree structure, is briefly stated. In order to interpret the features assigned to the nodes a hierarchical aggregation operator is applied for the interpretation of chromosomes.
A new technique is described fast ″scan-along″ computation of piecewise linear approximations of digital curves in 2-space. Our method is derived from earlier work on the theory of minimum-perimeter polygonal approx...
详细信息
A new technique is described fast ″scan-along″ computation of piecewise linear approximations of digital curves in 2-space. Our method is derived from earlier work on the theory of minimum-perimeter polygonal approximations of digitized closed curves. It is demonstrated that the specialization of this technique to the cases where the error is measured as a) the largest Hausdorff-Euclidean distance between the approximation and the given digitized curve, and b) the largest vertical distance between the approximation and a corresponding point on the given digitized curve.
A large number of techniques have been proposed to solve the problem of image reconstruction from its projections in the spatial domain which were shown to be special cases of a general quadratic optimization formulat...
详细信息
A large number of techniques have been proposed to solve the problem of image reconstruction from its projections in the spatial domain which were shown to be special cases of a general quadratic optimization formulation. In this study, the problem is formulated as a quadratic optimization in the Fourier domain. Different special cases and interpretations are included. Advantages of such a formulation are discussed, reconstruction algorithms for a separate optimization of magnitude and phase are derived, and finally, computer simulated results are presented.
Many applications in picture processing require accurate slope estimation. A brief survey of these applications is followed by discussion of the Sobel edge detection operator. The Sobel operator is very fast and simpl...
详细信息
Many applications in picture processing require accurate slope estimation. A brief survey of these applications is followed by discussion of the Sobel edge detection operator. The Sobel operator is very fast and simple; however, it is inherently biased as a function of true slope value and displacement of the true edge from center of the processing window. An iterative version of the operator is presented which reduces this bias with only a moderate increase in required processing.
It is proposed that the curves commonly encountered in picture processing can be described by a sequence of arcs linked at critical points. A statistical model is developed which assumes that the locations of the crit...
详细信息
It is proposed that the curves commonly encountered in picture processing can be described by a sequence of arcs linked at critical points. A statistical model is developed which assumes that the locations of the critical points are statistically independent. The model is used to develop and analyze algorithms for determining such critical points.
A syntactic method for the analysis of time-varying (TV) images is proposed. The problem is first analyzed through the use of pattern deformation model. The TV phenomena is then interpreted in terms of a language tran...
详细信息
A syntactic method for the analysis of time-varying (TV) images is proposed. The problem is first analyzed through the use of pattern deformation model. The TV phenomena is then interpreted in terms of a language translation schema. Furthermore, theorems are proved that some TV patterns can be formulated as a Context-Free Programmed Language (CFPL). Thus the existing literature on error-correcting syntax analysis can be applied to the TV pattern analysis problem. Tree grammar translation is proposed to handle more complex TV patterns.
It has been pointed out that any heuristic for problem solving - weak or strong - is based on the recognition of a unary relation (subset) or a relation of higher arity on the set of states of the problem. Since the r...
详细信息
It has been pointed out that any heuristic for problem solving - weak or strong - is based on the recognition of a unary relation (subset) or a relation of higher arity on the set of states of the problem. Since the recognition of such relations from examples (often obtained by gedanken experiments on the problem) is a necessary part of the development of such heuristics, one can effectively develop heuristics automatically by using patternrecognition techniques. This thesis is supported by simple examples of problems solved by heuristics developed by a computor program.
PASM, a multimicroprocessor system being designed at Purdue Univeristy for imageprocessing and patternrecognition, is described. This system can be dynamically reconfigured to operate as one or more independent SIMD...
详细信息
PASM, a multimicroprocessor system being designed at Purdue Univeristy for imageprocessing and patternrecognition, is described. This system can be dynamically reconfigured to operate as one or more independent SIMD and/or MIMD machines. The functions that the PASM operating system will perform are discussed, demonstrating how it will handle a variety of types of imageprocessing tasks. Examples of how PASM will improve computational speeds in comparison to conventional computers are presented. In particular, smoothing, histogram, and two-dimensional FFT algorithms are analyzed.
A description is given of a technique for generating a skeleton of a ribbon-like object using sequential data for all or part of the boundary. It shows how one may use local geometric information derived from the cont...
详细信息
A description is given of a technique for generating a skeleton of a ribbon-like object using sequential data for all or part of the boundary. It shows how one may use local geometric information derived from the contour to aid in the generation of a skeleton. For contours or curves of length n, this may be accomplished with a computation time of order n, while previous algorithms generally require order n**2 and require a two-dimensional matrix for their working representation.
暂无评论