the problem of image data fusion includes several techniques for data integration from different sensors about a given object. the process can be divided in two stages: (a) pixel interpolation on each observed image t...
详细信息
ISBN:
(纸本)076951846X
the problem of image data fusion includes several techniques for data integration from different sensors about a given object. the process can be divided in two stages: (a) pixel interpolation on each observed image to equalize their resolutions;and (b) synthesis of the fused image using the interpolated images. this work proposes the use of projection onto convex sets (POCS) techniques in both stages of the image data fusion process: on the interpolation stage, by creating intermediate pixels more adapted to the local characteristics of the observed images;and on the synthesis stage, by generating a final multispectral imagethat incorporates the best spatial and spectral characteristics of the initial images. As an example, the algorithm is applied to Spot satellite images.
We present the assessment of two classification procedures using a Monte Carlo experience and Landsat data. Classification performance is hard to assess with generality due to the huge number of variables involved. In...
详细信息
ISBN:
(纸本)0769526861
We present the assessment of two classification procedures using a Monte Carlo experience and Landsat data. Classification performance is hard to assess with generality due to the huge number of variables involved. In this case we consider the problem of classifying multispectral optical imagery with pointwise Gaussian Maximum Likelihood and contextual ICM (Iterated Conditional Modes), with and without errors in the training stage. Using simulation the ground truth is known and, therefore, precise comparisons are possible. the contextual approach proved being superior than the pointwise one, at the expense of requiring more computational resources, with both real and simulated data. Quantitative and qualitative results are discussed.
the single triangle-strip loop generation algorithm on a triangulated two-manifold presented by Gopi and Eppstein [4] is based on the guaranteed existence of a perfect matching in its dual graph. However such a perfec...
详细信息
ISBN:
(纸本)0769526861
the single triangle-strip loop generation algorithm on a triangulated two-manifold presented by Gopi and Eppstein [4] is based on the guaranteed existence of a perfect matching in its dual graph. However such a perfect matching is not guaranteed in the dual graph of triangulated manifolds with boundaries. In this paper we present algorithms that suitably modify the results of the dual graph matching to generate a single strip loop on manifolds with boundaries. Further the algorithm presented in [4] can produce only strip loops, but not linear strips. We present an algorithm that does topological surgery to construct linear strips, with user-specified start and end triangles, on manifolds with or without boundaries. the main contributions of this paper include graph algorithms to handle unmatched triangles, reduction of the number of Steiner vertices introduced to create strip loops, and finally a novel method to generate single linear strips with arbitrary start and end positions.
作者:
Ye, BPeng, JXHuazhong Univ Sci & Technol
Inst Pattern Recognit & Artificial Intelligence State Key Lab Image Proc & Intelligent Control Wuhan 430074 Peoples R China
An improved Zernike moment using as a region-based shape descriptor is presented the improved Zernike moment not only has rotation invariance, but also has scale invariance that the unimproved Zernike moment does not ...
详细信息
ISBN:
(纸本)076951846X
An improved Zernike moment using as a region-based shape descriptor is presented the improved Zernike moment not only has rotation invariance, but also has scale invariance that the unimproved Zernike moment does not have. the experimental results show that the improved Zernike moment has better invariant properties than unimproved Zernike moment using as region-based shape descriptor.
the estimation of left ventricle motion and deformation from series of images has been an area of attention in the medical image analysis and still remains and open and challenging problem. the proper motion tracking ...
详细信息
ISBN:
(纸本)0769513301
the estimation of left ventricle motion and deformation from series of images has been an area of attention in the medical image analysis and still remains and open and challenging problem. the proper motion tracking of left ventricle wall can contribute to isolate the location and extent of ischemic or infarcted myocardium. We present a method that automatically estimates the velocity vector field for a beating heart based on the study of variation in frequency content of a time series of non-stationary images. Results obtained withthis automated method in synthetic images and cardiac gated-SPECT images are presented.
this work, describes a new framework for automatic analysis of optic fundus non-mydriatic images, focusing on the segmentation of the blood vessels by using pixel classification based on pattern recognition techniques...
详细信息
ISBN:
(纸本)0769520324
this work, describes a new framework for automatic analysis of optic fundus non-mydriatic images, focusing on the segmentation of the blood vessels by using pixel classification based on pattern recognition techniques. Each pi-vel is represented by a feature vector composed of color information and measurements at different scales taken from the continuous wavelet (Morlet) transform as well as from mean and order filtering applied to the green channel. the major benefit resulting from the wavelet application to the optic fundus images is its multiscale analysing capability in tuning to specific frequencies, thus allowing noise filtering and blood vessel enhancement in a single step. Supervised classifiers are then applied to label each pi-vel as either a vessel or a non-vessel. Two different strategies to select the traning set have been devised: (1) the blood vessels of a sample image are completely drawn by hand, leading to a labeled image (i.e. vessels x non-vessel pixels) which is used to train the classifier, to be applied to other images: (2) the vessels located in a given small portion of the target image are drawn by hand and the remaining fundus image is segmented by a classifier trained using the hand-drawn portion to define the training set. the latter strategy is particularly suitable for the implementation of a semi-automated software to be used by health workers in order to avoid the need of setting imaging parameters such as thresholds. Both strategies have been extensively assessed and several successful experimental results using real-case images have been obtained.
In this work we model the problem of identifying how close structurally two proteins are as a problem of measuring the similarity between color images that represent their contact maps, where the chromatic information...
详细信息
ISBN:
(纸本)0769522270
In this work we model the problem of identifying how close structurally two proteins are as a problem of measuring the similarity between color images that represent their contact maps, where the chromatic information encodes the chemical nature of the contacts. We study two conceptually distinct methods to measure the similarity between such contact maps: a content-based image retrieval one and another based on image registration. In experiments with contact maps constructed from the PDB, the image registration approach was able to identify with 100% precision 8 instances of a protein class mixed with 28 proteins of other classes. the content-based image retrieval approach had an accuracy only a little worse than that.
Boolean expansion of binary functions has been used in the representation of binary image operators. this representation scheme induced the creation of imageprocessing architectures based on decision diagrams. In som...
详细信息
ISBN:
(纸本)076951846X
Boolean expansion of binary functions has been used in the representation of binary image operators. this representation scheme induced the creation of imageprocessing architectures based on decision diagrams. In some situations, the application of this graph-based operator over the input images is faster than the corresponding conventional approach, in that the operators are constructively described by means of basic operators and set operations. However, when the conventional architecture exploits the bit parallelism of the microprocessor logical instructions, its performance often surpasses that of the graph-based system. this article proposes a novel approach, in which the decision diagrams guide the actions of the underlying conventional architecture, taking advantage of its parallelism, so that faster imageprocessing can be achieved.
Stack filters are a special case of non-linear filters. they have a good performance for filtering images with different types of noise while preserving edges and details. A stack filter decomposes an input image into...
详细信息
ISBN:
(纸本)9780769529967
Stack filters are a special case of non-linear filters. they have a good performance for filtering images with different types of noise while preserving edges and details. A stack filter decomposes an input image into several binary images according to a set of thresholds. Each binary image is filtered by a Boolean function. the Boolean function that characterizes an adaptive stack filter is optimal and is computed from a pair of images consisting of an ideal noiseless image and its noisy version. In this work the behavior of adaptive stack filters is evaluated for the classification of Synthetic Aperture Radar (SAR) images, which are affected by speckle noise. Withthis aim it was carried out experiment in which simulated and real images are generated and then filtered with a stack filter trained with one of them. the results of their Maximum Likelihood classification are evaluated and then are compared withthe results of classifying the images without previous filtering.
the image Foresting Transform (IFT) has been proposed for the design of image operators based on connectivity. the IFT reduces imageprocessing problems into a minimum-cost path forest problem in a graph derived from ...
详细信息
ISBN:
(纸本)0769522270
the image Foresting Transform (IFT) has been proposed for the design of image operators based on connectivity. the IFT reduces imageprocessing problems into a minimum-cost path forest problem in a graph derived from the image. It has been successfully used for image filtering, segmentation, and analysis. In this work, we propose a novel image operator which solves segmentation by pruning trees of the forest. First, an IFT is applied to create an optimum-path forest whose roots are pixels selected inside a desired object. In this forest, the background consists of a few subtrees rooted at pixels on the object's boundary. these boundary pixels are identified and their subtrees are eliminated, such that the remaining forest defines the object. the tree pruning is an effective alternative to situations where image segmentation methods based on competing seeds fail. We present an interactive implementation of the tree-pruning technique, show several examples and discuss some experiments toward fully automatic segmentation.
暂无评论