In HSV color space,the method employs color segmentation algorithm,which utilizes three elements' value range of the license plate color and a color distance threshold,to the image to filtrate background prepartorily.

The method of "one category with several groups (or clusters)" and the rule of the relative distance threshold in the supervised classifications are proposed,designed and used in order to improve the quality of the classifications.

The DBCOD algorithm records the datum points by distance threshold, counts the density of every datum point in clustering, identifies outliers by density threshold, determinates valid cluster and outlier cluster by the number of datum points in it.

In HSV color space, the method employs color segmentation algorithm which utilizes three element value ranges of the licenses plate color and a color distance threshold, to filtrate the plate images background firstly.

In chapter 3, I propose a Cell Identification Code method to realize the distance-based location update strategy in LEO Satellite Communication System, which performs best among the three dynamic location update strategy and I analyze the result of different distance threshold.

We have tested 36 cases of blood lactate of modern pentathlon's athletes after swimming by l00m, 200m or 300m four indexes are compared and analysed:blood lactate threshold,lactate threshold intensity,limit lactate and threshold curve slope. In conclusion,there is no changes in lactate threshold affected by distance. Lactate threshold intensity and lactate level present a direct ratio to distance,threshold curve slope inverse ratio instead.

The variance in any points new position is then used to define a distance threshold between actual and predicted position which is used as a coplanarity test to find extended planar regions.

Coverage may be defined as direct or indirect: indirect coverage requires that a node be within a distance threshold s>amp;gt;0 of the subtree, and direct coverage requires that a node be connected to the subtree (s=0).

These structures are used as input for a next cycle of iteration where a distance threshold Dmaxis dynamically reduced.

Two types of the similarity join are well-known, the distance range join, in which the user defines a distance threshold for the join, and the closest pair query or k-distance join, which retrieves the k most similar pairs.

A valid group is defined as a group of moving users that are within a distance threshold from one another for at least a minimum time duration.

In this paper,the geographic position rectification,classification and mapping of LANDSAT MSS image are studied and discussed on the basis of the research of the supervised classifications in Hangzhou region and Darning mountain in Fuchunjiang country.The method of "one category with several groups (or clusters)" and the rule of the relative distance threshold in the supervised classifications are proposed,designed and used in order to improve the quality of the classifications.The factors of the distortions...

In this paper,the geographic position rectification,classification and mapping of LANDSAT MSS image are studied and discussed on the basis of the research of the supervised classifications in Hangzhou region and Darning mountain in Fuchunjiang country.The method of "one category with several groups (or clusters)" and the rule of the relative distance threshold in the supervised classifications are proposed,designed and used in order to improve the quality of the classifications.The factors of the distortions in MSS images are analyzed,and the continuous and discontinuous distortions in the images are rectified in order to meet the high accuracy requirements for mapping.The methods of the directed mapping and the resampled mapping are tested and studied.The characteristics and efficiency of the plotter are specially considered to improve the map precision and increase the plotting speed.The plotting program is designed to plot various classification maps with different scale and is easy to use.On the other hand,the classification maps are rectified and mapped on a Gauss-Kruger grid for the interpretation and application.In the paper the map of classification with color in the West Lake region in Hangzhou is given in scale 1:50,000.The studies mentioned above provide not only the ideal maps for the interpretation of the images and mapping of the thematic maps,but also a good basis for the integrative processing of the multi-date,multi-sensor remotely sensed data and the non-remotely sensed information,and for the renewing of the data in the database of the remotely sensed images.

A novel fuzzy genetic clustering algorithm is presented in this paper.There is no need to know the distance threshold (d) and prior number of clusters while using this algorithm in solving clustering problem. The simulation shows that this algorithm is also effective to non-spherical-shape data.

In order to solve the problem of slow speed,based on the canonical algorithm of calculation of the correlation integrals,this paper not only provides several improvements,but also puts forward two optimized algorithms.The algorithms are based on the region of embedded dimension and region of distance threshold.They are filled in table of [ m max × r max ]( m max is number of embedded dimension, r max is number of distance threshold) by batch methods giving up the one by one processing...

In order to solve the problem of slow speed,based on the canonical algorithm of calculation of the correlation integrals,this paper not only provides several improvements,but also puts forward two optimized algorithms.The algorithms are based on the region of embedded dimension and region of distance threshold.They are filled in table of [ m max × r max ]( m max is number of embedded dimension, r max is number of distance threshold) by batch methods giving up the one by one processing methods.In this paper,the theory and algorithm are narrated in detail.The performance of two optimal algorithms is compared with canonical algorithm and improvement method.The experimental result shows that optimal algorithms need least time to calculate the correlation dimension for same length time series with same number of distance threshold and embedded dimension since they have little redundant calculations and enhance the calculation efficiency obviously.