We propose a method of optimal morphological decomposition. We first formulate this kind of problem into a set of linear constraints, and then find out the solution to the set of linear constraints by using an integer...
详细信息
ISBN:
(纸本)0780332598
We propose a method of optimal morphological decomposition. We first formulate this kind of problem into a set of linear constraints, and then find out the solution to the set of linear constraints by using an integer linear programming technique. Our method has the following three advantages: (1) the size of the factors can be any n/spl times/n (n/spl ges/3), (2) it can be applied to both convex and concave simply-connected images; (3) optimality is selective and flexible.
This paper proposes a technique based on information theory principles for shape description of 2-D images. By its essence the technique is invariant to rotation and translation. We first describe how the translationa...
详细信息
This paper proposes a technique based on information theory principles for shape description of 2-D images. By its essence the technique is invariant to rotation and translation. We first describe how the translational information content of an image may be defined, identified, assessed and analysed. The effect of the size is then assessed and quantified which permits us to propose a modified definition of translational information content invariant to scale. In order to demonstrate the feasibility of the developed techniques, a series of tests were carried out on rectangular and triangular shapes. The results illustrate the power of the translational information assessment techniques in analysing and describing 2-D images. The use of these techniques in shape description is also introduced.
The individuality of a human face depends on the fine details of the facial components, and it is necessary to extract and to describe these detailed patterns in order to recognize human faces. We propose a method to ...
详细信息
The individuality of a human face depends on the fine details of the facial components, and it is necessary to extract and to describe these detailed patterns in order to recognize human faces. We propose a method to describe the eye figure with small parameters by classifying their patterns to typical groups. First, an eye image is divided into parts such as eyelid and inner corner, and a set of 1-dimensional slit projections is obtained from the 2-dimensional intensity array. Then, the principal component analysis is applied to these projections to find the major axes which have typical features. The individuality of each eye is parameterized by the principal component scores. The effectiveness of the description is evaluated by generating sketch images based on the parameters extracted from real eye images.
Signature (watermark) casting on digital images is an important problem, since it affects many aspects of the information market. We propose a method for casting digital watermarks on images and we analyze its effecti...
详细信息
Signature (watermark) casting on digital images is an important problem, since it affects many aspects of the information market. We propose a method for casting digital watermarks on images and we analyze its effectiveness. The satisfaction of some basic demands in this area is examined and a method for producing digital watermarks is proposed. Moreover, immunity to subsampling is examined and simulation results are provided for the verification of the above mentioned topics.
This paper39;s main contributions are three-fold. Firstly, it is shown that the two existing template matching-like definitions of the Hough transform proposed by Princen, Illingworth and Kittler (1992) and by Berge...
详细信息
ISBN:
(纸本)0780332598
This paper's main contributions are three-fold. Firstly, it is shown that the two existing template matching-like definitions of the Hough transform proposed by Princen, Illingworth and Kittler (1992) and by Bergen and Shvaytser (1991) are inadequate. The principal reason behind this is that the common implicit assumption of these two definitions, that every feature point within the template associated with a given accumulator cell E/sub 0/ in Hough space votes equally to E/sub 0/, is not reasonable. Secondly, an inherent probabilistic aspect of the Hough transform embedded in the transformation process from the image space to the parameter space is clarified. It is concluded that when the Hough transform is used to detect a pattern, an appropriate curve (surface, if the number of the parameters to be detected is more than 2) density function, which depends on the parameterization of the pattern, must be implicitly or explicitly provided to eliminate the uncertainties resulting from such a probabilistic aspect. Thirdly, a new framework of the Hough transform is proposed which mainly consists of two parts, namely parameterization and associated curve (surface) density function.
The unsupervised detection of an unknown number of straight lines in digital imagery is addressed. Based on possibilistic clustering an algorithm is proposed which does not require any assumption about the number of s...
详细信息
The unsupervised detection of an unknown number of straight lines in digital imagery is addressed. Based on possibilistic clustering an algorithm is proposed which does not require any assumption about the number of straight lines present in the edge map. Three major modifications are introduced with respect to existing clustering-based algorithms: the use of possibilistic clustering; a more sophisticated analysis of the clusters, including the possibility of rejecting non linear clusters; a bottom up strategy to evaluate how many straight lines the image contains. The effectiveness of the proposed scheme is proved by validating it against real world imagery.
A classified hierarchical template matching algorithm is presented in this work. In our system, a template is first classified into one of three classes: texture, edge and low-activity. Then different features are use...
详细信息
A classified hierarchical template matching algorithm is presented in this work. In our system, a template is first classified into one of three classes: texture, edge and low-activity. Then different features are used for each class, thereby achieving a better recognition rate than with the commonly used l/sub 2/ metric. Furthermore, a two-level hierarchical searching algorithm is designed to reduce the amount of computation. The algorithm works in both spatial and DCT domains. It can be applied to image retrieval applications where a user is interested in finding images containing a small pattern.
The segmented-scene spatial entropy (SSE) is defined as the amount of information contained in the spatial structure of a segmented scene resulting from segmenting an image. An automatic, nonparametric, unsupervised t...
详细信息
The segmented-scene spatial entropy (SSE) is defined as the amount of information contained in the spatial structure of a segmented scene resulting from segmenting an image. An automatic, nonparametric, unsupervised thresholding algorithm that maximizes the SSE of an image is described, and this algorithm is known as the maximum segmented-scene spatial entropy (MSSE) thresholding algorithm. It is shown that the MSSE-thresholded image contains the maximum amount of information about the original scene and hence good thresholding results are warranted. Simulation and practical results are presented to illustrate the improvement in performance as compared to some other histogram-based thresholding algorithms.
An original method used to detect images in defocused scenes by means of a binary joint transform correlation is presented. The optical transfer function of the imaging lens, which presents positive and negative value...
详细信息
An original method used to detect images in defocused scenes by means of a binary joint transform correlation is presented. The optical transfer function of the imaging lens, which presents positive and negative values, introduces sign errors in the joint power spectrum. The goal of this study is to detect the sign of the optical transfer function starting from the defocused image by means of a digital algorithm, to compensate the sign errors in the binary joint power spectrum and to obtain invariant correlations with respect to defocusing. Theoretical analysis and digital experiments to test the procedure are provided.
In this paper,we present a new adaptive image compression method based on wavelet transform,bit image compression,fractal iteration and huffman *** method is better than other compression methods which use simple enco...
详细信息
In this paper,we present a new adaptive image compression method based on wavelet transform,bit image compression,fractal iteration and huffman *** method is better than other compression methods which use simple encoding *** experiment results demonstrate the method is efficient.
暂无评论