Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

48 results about "Distance classifier" patented technology

The minimum distance classifier (MDC) is an example of a commonly used ‘conventional’ classifier. The minimum distance classifier is used to classify unknown image data to classes which minimize the distance between the image data and the class in multi-feature space.

Light spectrum and spatial information bonded high spectroscopic data classification method

Disclosed is a hyperspectral data classification method which is combined spectrum and spatial information. The steps comprises (1) reading the hypersectral data, (2) confirming the minimum size of structural element, (3) calculating differentiation between picture elements in neighborhood of each structural element by extended mathematical morphology expansion and corrosion operation, (4) obtaining exponential value of morphology eccentricity by the extended expansion and the corrosion operation of step (3), (5), constantly repeating the above steps with the adding of the size of the structural element to achieve the maximum size of the structural element, (6), constantly updating the exponential value MEI of morphology eccentricity in iteration process via the obtained new value, and generating a final exponential value MEI of morphology eccentricity after the iteration process is finished, (7) realizing the extraction of the data characteristic by the image of the exponential value MEI of morphology eccentricity, namely generating ground object type information, and realizing sophisticated category of the ground object by a minimum-distance classifier. The method is an unsupervised classification method for hyperspectral ground object with strong stability, high reliability and high accuracy.
Owner:BEIHANG UNIV

Illumination-classification-based adaptive image segmentation method

The invention discloses an illumination-classification-based adaptive image segmentation method which is used for accurately segmenting a target object under different illumination conditions. The illumination conditions are divided into two types, namely a frontlighting type and a backlighting type, by extracting color characteristics of an image to be processed in a red, green and blue (RGB) space and a hue, saturation and value (HSV) space and adopting a minimum euclidean distance classifier; a proper color characteristic quantity serving as a segmenting parameter is extracted from the image in the two illumination types and imported into a two-dimensional histogram; neighbor information of each pixel point is increased, so the interference resistance capacity is improved; and the acquired image is subjected to intelligent illumination judgment and precise segmentation. In the illumination-classification-based adaptive image segmentation method, a mode of judging the illumination condition first and then selecting a segmenting algorithm is adopted, so the algorithm has higher pertinence and the effectiveness of the algorithm is improved; meanwhile, illumination correction is not required, so the computing cost is reduced greatly; and a favorable condition is created for the subsequent image processing and analysis.
Owner:JIANGSU UNIV

High spectroscopic data supervision classifying method based on information quantity dimensionality sequence

A high spectroscopic data supervision classification method based on information quantity dimensionality sequence includes the following steps: reading the high spectrum image data of a certain region; selecting a reference spectrum from the spectrum library or selecting the training sample from images to execute wave band average acquiring reference spectrum; calculating one by one the reference spectrum and all test spectral information quantity dimensionality sequence; executing vector angle matching one by one the test spectrum with all reference spectral information quantity dimensionality sequence, and using minimum distance classification machine to classify; result binarization matching, the matching result of each series of field culture is represented by the binary images, each image only includes a series of field culture. The high spectroscopic data classification method based on information quantity dimensionality sequence introduces the information quantity dimensionality into the spectrum domain analysis, synthetizes the advantages of the all band matching and partial quantization characteristic matching, can obtain higher classification effectiveness and classification accuracy, and has important value in the high spectroscopic data classification and object identification.
Owner:BEIHANG UNIV

Radar target one-dimensional range profile local optimal sub-space recognition method

InactiveCN103941244AImprove object classification performanceEasy to identifyWave based measurement systemsMinimum distance classifierLocal optimum
The invention provides a radar target one-dimensional range profile local optimal sub-space recognition method which effectively improves the performance of recognizing a radar target. According to the method, firstly, a nearest intra-class distance scattering matrix and a nearest between-class distance scattering matrix are calculated through training data; then, a local optimal sub-space is set up according to an optimal ratio criteria, the characteristics of the target are extracted, and the characteristics are classified through a minimum distance classifier; finally, the classification where the input target belongs is determined. The method specifically includes the steps of determining a vector X<W>ij and a vector Xij through a radar target one-dimensional range profile training vector Xij; determining a vector d<W>ij and a vector dij; determining a matrix DW and a matrix DB; determining m vectors a1, a2...and am of the local optimal sub-space; determining the equation (please see the equation in the specification) of the local optimal sub-space according to lambdai and a vector ai, wherein i is 1 or 2 or 3...or m; determining a template library according to the projection of the training vectors in the sub-space A; determining the local optimal sub-image of an input target one-dimensional range profile Xt; determining the distance between the local optimal sub-image and a library template vector, and determining the classification where the input target range profile belongs through the minimum distance classifier.
Owner:UNIV OF ELECTRONIC SCI & TECH OF CHINA

Human behavior recognition method based on accelerometer

The invention discloses a human behavior recognition and classification method based on an accelerometer. The method includes the first step of collecting human behavior samples as a training set, the second step of searching for a projection matrix U which is optimal for the recognition and classification of the training set, the third step of carrying projection on no-labeled data, and the fourth step of classifying the projected data by using a minimum distance classifier to obtain a recognition result. According to the human behavior recognition method, a partial approximate linear hypothesis is carried out on adjacent blocks formed by labeled data so as to enable the distance between different types of samples on the blocks to be large enough, positional sequence information of the same type of samples is reserved as far as possible through class sigmoid function penalty factors, and finally a global objective function is established on the basis of the objective functions on all blocks. The human behavior recognition method can reserve the information of the distance between the samples in a higher dimensional space properly, and reduces dependence of recognition models on artificial tagging samples, and the recognition effect is superior to a representative human behavior recognition method based on linear discriminant analysis.
Owner:SOUTH CHINA UNIV OF TECH

Integral and local characteristic fuse recognition system facing to identification

The invention provides an identification-oriented integral-local feature fusion-recognition system in the technical field of pattern recognition. In the system, a weighted adjacency graph construction module establishes a weighted adjacency graph, and acquires the similarity weight between any two vertices according to category information; a matrix construction module of a training sample receives the similarity weight, and establishes a similar matrix, a degree matrix, a laplacian matrix of the graph, an intra-class scatter matrix and an inter-class scatter matrix for the training sample according to the nearest neighbor principle; a selection module for an optimal regulatory factor selects a regulatory factor value allowing the recognition rate of the training sample to reach maximum as an optimal value of regulatory factors; a projection-matrix acquisition module selects eigenvectors corresponding to top minimum feature values in all feature values as base vectors, so as to form a projection matrix; and a data classification module adopts a minimum distance classifier to recognize the category of test data. The system utilizes the category information of data to depict data relation more accurately, thereby gaining higher recognition performance.
Owner:SHANGHAI JIAO TONG UNIV

Multi-classifier integration-based image character recognition method

The invention provides a multi-classifier integration-based image character recognition method. The method comprises the following steps of: converting a colored to-be-identified image into a grayscale image; carrying out binary processing on the grayscale image and segmenting an image region with character information; segmenting each Chinese character from a whole character image; extracting grid features and direction features of each Chinese character; selecting stroke density total length features to carry out first-layer rough classification by adoption of a minimum distance classifier; and respectively selecting peripheral features, the grid features and the direction features to complete second-layer classification matching by adoption of a nearest-neighbor classifier. The method has the advantages that the character recognition has relatively strong anti-jamming capability and relatively strong character local structure description capability, and is less influenced by stroke widths; by adoption of a classifier integration technology of complementing and combining the minimum distance classifier and the nearest-neighbor classifier, a system is more reliable; and the characters can be intelligently recognized, so that the adaptability of the system is improved and the recognition rate is high.
Owner:SOUTH CHINA NORMAL UNIVERSITY

Bearing fault diagnosis method

The invention relates to a bearing fault diagnosis method which is characterized by including the following steps: (1) obtaining multiple groups of vibration acceleration signal data of the spindle bearing of a wind generating set in different states, randomly extracting a plurality of groups of vibration acceleration signal data as standard sample data, and taking the other groups of vibration acceleration signal data as to-be-detected sample data; (2) adaptively decomposing the standard sample data and the to-be-detected sample data to obtain a series of intrinsic rotational components; (3)making a time-domain analysis of the instantaneous amplitude and instantaneous phase information of the first intrinsic rotational components in the standard sample data and the to-be-detected sampledata, and extracting bearing fault feature vectors; (4) inputting the extracted fault feature vector of the standard sample data to a neighbor distance classifier for training to get a trained fault diagnosis model; and (5) inputting the extracted bearing fault feature vector of the to-be-detected sample data to the trained fault diagnosis model for fault identification to obtain the fault state of the bearing. The bearing fault diagnosis method of the invention can be widely applied to bearing fault diagnosis.
Owner:CHINA INST OF WATER RESOURCES & HYDROPOWER RES

Feature dimension-reduction optimization method for Chinese character recognition

The invention discloses a feature dimension-reduction optimization method for Chinese character recognition. The feature dimension-reduction optimization method comprises a first step of conducting preprocessing and feature extraction on a Chinese character sample and conducting LDA dimension reduction changing on the extracted Chinese character features, a second step of conducting classification and recognition by means of a minimum Euclidean distance classifier, a third step of regarding the sample with wrong classification and recognition as a newly-added sample, adding the newly-added sample to an original sample set, and conducting the dimension reduction changing again by means of a learning method of ILDA incremental linear judgment, a fourth step of conducting the classification and recognition again by means of the minimum Euclidean distance classifier, and a fifth step of repeating the third step and the fourth step, outputting the LDA optimizing parameter after repeated iterative calculation, and enabling the LDA optimized parameter to be used for the classification and recognition of Chinese characters. The feature dimension-reduction optimization method for the Chinese character recognition overcomes the defect that an existing LDA changing method can not effectively optimize the LDA transformation matrix parameters by means of recognition classification and information, and has the advantages that the performance of the LDA feature dimension reduction changing and the accuracy rate of the character recognition can be greatly improved.
Owner:SOUTH CHINA UNIV OF TECH

Training method and system of sleep-state classifier

The invention relates to a training method and system of a sleep-state classifier, wherein the method comprises the following steps: constructing feature vectors of sample data of a plurality of sleep-state types and a cluster center formed by aggregating the feature vectors, and establishing an objective function according to the feature vectors and the cluster center of the feather vectors; using the objective function to characterize the distance between the minimized sample data of same types and dictionary atoms, and the distance among maximized atoms of different types; respectively selecting a plurality of the feature vectors from the sample data of a plurality of the sleep-state types to be taken as initial values of the atoms, distributing various sample data to the atoms and solving the objective function, thus obtaining a classification dictionary; using the classification dictionary to classify the sample data, comparing the types and the distances of the atoms which are closest to the sample data, if the distance is less than a preset threshold value, judging that the types of the sample data are consistent with the types of the atoms; training the sleep-state classifier according to the classified sample data. By adopting the training method and system of the sleep-state classifier, a more accurate sleep-state classifier can be trained.
Owner:GUANGZHOU SHIYUAN ELECTRONICS CO LTD

Compression domain-oriented video content comparison system, optimization method and comparison method

The invention belongs to the field of computer vision, particularly relates to a compressed domain-oriented video content comparison system, an optimization method and a comparison method, and aims tosolve the problem of low efficiency of completing video content comparison by using full decoding information. The comparison system comprises: a feature learning module which is used for respectively obtaining feature maps of multiple modes based on multiple pieces of compressed domain information of an input video; a multi-modal compressed domain information fusion module which is used for carrying out information fusion on the multi-modal feature maps output by the feature learning module to obtain a fusion feature vector of the input video; a second module which is configured to obtain the L1 distance of the fusion feature vector of the two input videos; and a classifier which is a binary classification network and is configured to perform binary classification of the comparison result based on the L1 distance output by the second module. According to the invention, high-level semantic information of the video content can be effectively extracted, and high comparison speed and high performance of the video content are ensured.
Owner:NAT COMP NETWORK & INFORMATION SECURITY MANAGEMENT CENT +1
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products