In this paper, we present an analysis of two image characteristics which give rise to local and global redundancy in image representation. Based on this study, we propose a lossless image compression scheme which expl...
详细信息
In this paper, we present an analysis of two image characteristics which give rise to local and global redundancy in image representation. Based on this study, we propose a lossless image compression scheme which exploits both types of redundancy. the algorithm segments the image into variable size blocks and encodes them depending on characteristics exhibited by the pixels within the block. the performance of the proposed algorithm is studied by software implementation. the proposed algorithm works better than other lossless compression schemes such as the Huffman, the arithmetic, the Lempel-Ziv and the JPEG.
this paper presents a novel multiparadigm segmentation method based upon knowledge based clustering with reclustering. the techniques described enhance unsupervised classification and achieve pattern labeling. First d...
详细信息
this paper presents a novel multiparadigm segmentation method based upon knowledge based clustering with reclustering. the techniques described enhance unsupervised classification and achieve pattern labeling. First domain knowledge is utilized to decide where and how a clustering algorithm is applied, then clustering is iteratively applied to focus-of-attention patterns withthe knowledge of how many expected classes there are in those patterns and the prototypical patterns of a class. Examples showing clustering improvements are given from brain MRI's and satellite images.
the present paper is devoted to the multiperspective recognition, in which the pattern to be recognized undergoes several classification tasks. Each task denotes here recognition from a different point of view and wit...
详细信息
the present paper is devoted to the multiperspective recognition, in which the pattern to be recognized undergoes several classification tasks. Each task denotes here recognition from a different point of view and with respect to a different set of classes. In the decomposed dependent approach, when the multiperspective recognition is not a single activity but it states the multistep decision process, important role plays the order of recognition tasks determining the successive steps of the entire multiperspective recognition. In this paper the algorithm for optimal (with respect to the risk function) ordering of recognition tasks is presented. the proposed algorithm using controlled enumeration through a branch-and-bound search procedure selects the best order without exhaustive search. Furthermore, results of computer experiments are given and a simple illustrative example is considered.
Most of the recent work in nonlinear order statistic filters has focused on smoothing and preserving the details in digital images. However, in many image analysis and computer vision applications, where edges are bei...
详细信息
Most of the recent work in nonlinear order statistic filters has focused on smoothing and preserving the details in digital images. However, in many image analysis and computer vision applications, where edges are being used as primary features, edge enhancement becomes an essential attribute of preprocessing filters. Moreover, the human visual system is also very sensitive to this feature. Majority of the most frequently used filters, such as median and its extensions do not posses this property; median filters tend to preserve any monotonic degradation of the edge and therefore, are not capable of enhancing blurred or ramp edges. In this paper we present a variable length robust nonlinear filter which has the capability to both sharpen the edges and smoothing out the noise. Experimental results on real images are also provided.
Considers a simple two class pattern classification problem from two points of view, namely that of empirical risk minimization and that of maximum-likelihood estimation. the main focus is on an exact solution for the...
详细信息
Considers a simple two class pattern classification problem from two points of view, namely that of empirical risk minimization and that of maximum-likelihood estimation. the main focus is on an exact solution for the generalization error resulting from the above two approaches, emphasizing mainly the finite sample behavior, which is very different for the two methods. Focusing on the case of normal input distributions and linear threshold classifiers, the author uses statistical mechanics techniques to calculate the empirical and expected (or generalization) errors for the maximum-likelihood and minimal empirical error estimation methods, as well as several other algorithms. In the case of spherically symmetric distributions within each class the author finds that the simple Hebb rule, corresponding to maximum-likelihood parameter estimation, outperforms the other more complex algorithms, based on error minimization. Moreover, the author shows that in the regime where the overlap between the classes is large, algorithms with low empirical error do worse in terms of generalization, a phenomenon known as over-training.
Image processing is used in the forest products industry to detect various defects on wood surfaces. Normally, several different sensors are needed, which makes the systems complicated and expensive. In this paper we ...
详细信息
Image processing is used in the forest products industry to detect various defects on wood surfaces. Normally, several different sensors are needed, which makes the systems complicated and expensive. In this paper we present a highly integrated sensor system for wood defect detection based on a single MAPP2200 smart sensor. Five different measuring principles are simultaneously utilized to detect surface grayscale, surface roughness, deviating grain direction, 3D-profile and surface density. Using a pixel resolution of 1/spl times/0.5 mm, the sensor permits scanning of boards at the speed of several meters per second.
the finite-sample risk of the k-nearest-neighbor classifier is analyzed for a family of two-class problems in which patterns are randomly generated from smooth probability distributions in an n-dimensional Euclidean f...
详细信息
the finite-sample risk of the k-nearest-neighbor classifier is analyzed for a family of two-class problems in which patterns are randomly generated from smooth probability distributions in an n-dimensional Euclidean feature space. First, an exact integral expression for the m-sample risk is obtained for a k-nearest-neighbor classifier that uses a reference sample of m labeled feature vectors. Using a multidimensional application of Laplace's method of integration, this integral can be represented as an asymptotic expansion in negative rational powers of m. the leading terms of this asymptotic expansion elucidate the curse of dimensionality and other properties of the finite-sample risk.
this paper presents a flexible communication module for low-level as well as high-level image processing operations. It allows a good separation of data communication and data processing and thereby reduces the necess...
详细信息
this paper presents a flexible communication module for low-level as well as high-level image processing operations. It allows a good separation of data communication and data processing and thereby reduces the necessary amount of work for the implementation of parallel image processing algorithms. It supports heterogenous processor systems. It has been successfully used for the parallel implementation of a hierarchical image transition and for its symbolic analysis on a 9-node transputer image processing system. Experimental results in the field of traffic sign detection are discussed.
Presents the overall goals of the authors' research program on the application of high performance computing to remote sensing applications, specifically applications in land cover dynamics. this involves developi...
详细信息
Presents the overall goals of the authors' research program on the application of high performance computing to remote sensing applications, specifically applications in land cover dynamics. this involves developing scalable and portable programs for a variety of image and map data processing applications, eventually integrated with new models for parallel I/O of large scale images and maps. After an overview of the multiblock PARTI run time support system, the authors explain extensions made to that system to support image processing applications, and then present an example involving multiresolution image processing. Results of running the parallel code on both a TMC CM5 and an Intel Paragon are discussed.
Outlines a method to derive geometric invariance kernels which may be applied to a space-variant sensor architecture. the basic idea as to transform a kernel with desired symmetry properties (e.g. the Fourier kernel) ...
详细信息
Outlines a method to derive geometric invariance kernels which may be applied to a space-variant sensor architecture. the basic idea as to transform a kernel with desired symmetry properties (e.g. the Fourier kernel) in the domain to the range of the transform. By combining this transformed kernel withthe Jacobian of the transformation, the authors obtain a new integral transform, in the range, which has similar properties to the original transform. the authors illustrate this idea with a variant of the Mellin-Fourier transform, applied to an image which has been transformed by a log-polar mapping. the kernel obtained, which the authors call an "exponential chirp" has properties (unlike the Mellin-Fourier transform) which are both consistent withthe spatial nature of human vision and can be applied directly in the space-variant image plane. the authors outline applications to visual template matching and auto-correlation, and show a one-dimensional example of a generalization of cepstral auto-correlation using this method.
暂无评论