Sequences of pictures of growing colonies of animal cells or microorganisms contain information useful to biologists. Special lighting increases the information contained in the pictures and decreases the difficulty o...
详细信息
Sequences of pictures of growing colonies of animal cells or microorganisms contain information useful to biologists. Special lighting increases the information contained in the pictures and decreases the difficulty of the image analysis. A high resolution flying spot scanner digitizes images of petri dishes recorded on film. Nonlinear edge region detectors and a region growing algorithm find the outlines of the colonies. Outlines which pass tests for validity are analyzed to extract further information. Data files of parameters are created which are analyzed by programs written by biologists. Statistical and other techniques were used to classify species and locate mutant colonies.
A digital imageprocessing computer called TEXAC (for its sophisticated ″texture analysis″ capabilities) is the most advanced patternrecognitioncomputer in operation for the processing of biomedical images. Among ...
详细信息
A digital imageprocessing computer called TEXAC (for its sophisticated ″texture analysis″ capabilities) is the most advanced patternrecognitioncomputer in operation for the processing of biomedical images. Among the important applications of the instrument is its ability to enhance significantly the image quality of radiograms, and thus to bring out important elements which might otherwise escape detection during a traditional viewbox examination of the original films. TEXAC employs a conventional TV camera to input the x-ray picture. By means of a special algorithm TEXAC completes edge enhancement operations on the x-ray image in a matter of seconds.
In order to carry out an automatic procedure to analyze a sequence of images and extract in that way the dynamic characteristics of the motion represented in the sequence, a certain number of methods are, at present, ...
详细信息
In order to carry out an automatic procedure to analyze a sequence of images and extract in that way the dynamic characteristics of the motion represented in the sequence, a certain number of methods are, at present, considered and evaluated by many authors. In that context one of the more interesting aspects consists in obtaining the segmentation of each frame that could be considered ″normalized″ in a given interval of frames belonging to the sequence. A method to obtain a normalized segmentation for the special case considered, is presented. The technique is based on the iterated application of a pair of algorithms the first of which is able to identify the moving parts and to make a check on the rightness of such identification; the second one carries out the ″normalization″ of frames of the sequence on the basis of the results furnished by the first algorithm.
Several algorithms for the string pattern matching problem are presented, based on an approach that requires no additional storage space. It is shown that a little additional storage space will reduce computation time...
详细信息
Several algorithms for the string pattern matching problem are presented, based on an approach that requires no additional storage space. It is shown that a little additional storage space will reduce computation time considerably.
The shape number of a curve is derived for two-dimensional non-intersecting closed curves that are the boundary of simply connected regions. This description is independent of their size, orientation and position, but...
详细信息
The shape number of a curve is derived for two-dimensional non-intersecting closed curves that are the boundary of simply connected regions. This description is independent of their size, orientation and position, but it depends on their shape. Each curve carries ″within it″ its own shape number. The order of the shape number indicates the precision with which that number describes the shape of the curve. For a curve, the order of its shape number is the length of the perimeter of a 'discrete shape' (a closed curve formed by vertical and horizontal segments, all of equal length) closely corresponding to the curve. A procedure is given that deduces, without table look-up, string matching or correlations, the shape number of any order for an arbitrary curve.
This study deals with the problem of estimating a transmitted string X//s, when the only observable string is its noisy version Y. Y is assumed to contain substitution, deletion and insertion errors. Based on three ge...
详细信息
This study deals with the problem of estimating a transmitted string X//s, when the only observable string is its noisy version Y. Y is assumed to contain substitution, deletion and insertion errors. Based on three generalized edit distances of substitution, insertion and deletion and on the properties of the noisy channel through which X//s is transmitted, a distance D(X/Y) is defined between a word X contained in the dictionary H and the noisy string Y. The best estimate X* of X//s is defined as that element of H which minimizes this distance. Using dynamic programming principles, an algorithm is then presented which yields x* without computing individually the distances between every word of H and Y.
The problem of extending the scope of the recently developed concept of composite classifier systems to the domain of imperfectly supervised environments is considered in this study. The constraints underlying the ass...
详细信息
The problem of extending the scope of the recently developed concept of composite classifier systems to the domain of imperfectly supervised environments is considered in this study. The constraints underlying the associated problem of optimal partitioning of the feature space, for the case wherein the composite system consists of the linear and nearest neighbor (NN) classifiers, are appropriately reformulated taking into account the imperfectness of the training sample labels. The resulting constrained optimization problem is solved, as before, using SWIFT-Sequential Weight Increasing Factor Technique. The classical NN rule is also modified to give due weightage to the fact that the training samples are imperfectly labeled, thereby adapting the linear/NN composite classifier, in all its facets, for deployment in imperfectly supervised environments.
A formalization is made of the concept of skeleton as encountered in patternrecognition applications, and the link which exists between skeletons, projections, and patterns is exhibited. The possibility for doing so ...
详细信息
A formalization is made of the concept of skeleton as encountered in patternrecognition applications, and the link which exists between skeletons, projections, and patterns is exhibited. The possibility for doing so is offered by the use of our general categorical formalization of patternrecognition.
The widely used stepwise discriminant analysis procedure selects one variable at a time. However, instances arise in which variables occur naturally paired, such as the real and imaginary parts of a Fourier transforme...
详细信息
The widely used stepwise discriminant analysis procedure selects one variable at a time. However, instances arise in which variables occur naturally paired, such as the real and imaginary parts of a Fourier transformed signal. The existing stepwise discriminant procedure might select the real part of the ith harmonic and the imaginary part of the jth harmonic. This paper presents an algorithm that selects variables in pairs. With this algorithm, both the phase and magnitude of a signal can be used to form a discriminant function, as compared to the existing method of using the power only. From the simulation study, the discriminant procedure is better for inherently paired variables.
The objective of computer vision system is to outline the objects in a picture and label them with an appropriate interpretation. This study proposes a new paradigm for a modular computer vision system which is both d...
详细信息
The objective of computer vision system is to outline the objects in a picture and label them with an appropriate interpretation. This study proposes a new paradigm for a modular computer vision system which is both data directed and knowledge based. The system consists of three different types of units, two of which are associative data memories implemented as relational databases. The short term memory (STM) contains the raw color picture data and the most current interpretations and deductions about the original scene. The long term memory (LTM) contains a detailed model of the scene under consideration. A collection of analysis processors, each of which is specialized for a particular task can communicate with both of these memories.
暂无评论