Image classification method based on heterogeneous tensor decomposition

A technology of tensor decomposition and classification method, applied in the field of image classification based on heterogeneous tensor decomposition, can solve the problems of losing structural information and destroying element dependencies, and achieves the effect of improving the discrimination ability and the classification accuracy.

Active Publication Date: 2019-09-10
TIANJIN UNIV
View PDF4 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Benefits of technology

This patented method improves image processing techniques for identifying objects or characters from images captured with cameras. It uses different methods such as tensor decomposing (Tucker) , histogram equalizing (HE), and discrimination-robustness analysis (DBSCAN). These improvements help identify specific areas within each pixel that are important for understanding how things happen inside them.

Problems solved by technology

This patented technical problem addressed in this patents relates to improving image recognition technology based upon big datasets containing diverse types of data without losing important parts like shape details. Traditionally these techniques require manual effort due to their complexity and lack of understanding capabilities. However, recent advances in artificial intelligence allow researchers to automate certain tasks more efficiently than ever before. These new tools aim at analyzing complicated images and identifying specific patterns within them accurately.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Image classification method based on heterogeneous tensor decomposition
  • Image classification method based on heterogeneous tensor decomposition
  • Image classification method based on heterogeneous tensor decomposition

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0035] An embodiment of the present invention provides an image classification method based on heterogeneous tensor decomposition, see figure 1 , the method includes the following steps:

[0036] 101: Construct the original tensor according to the ORL dataset;

[0037] Wherein, the ORL data set is a face image database established by the University of Cambridge, UK, which is well known to those skilled in the art, and will not be described in detail in this embodiment of the present invention.

[0038] 102: Decompose the original tensor into a factor matrix and a sample feature representation matrix corresponding to each order of the tensor;

[0039] 103: Add column-by-column orthogonal constraints on the factor matrix;

[0040] 104: Apply a low-rank constraint to the sample feature representation matrix Z, and obtain the lowest-rank representation by identifying the global low-rank structure of the sample;

[0041] 105: pass l 2,1 Norm-constrained loss function and regulariz

Embodiment 2

[0047] The scheme in embodiment 1 is further introduced below in conjunction with specific calculation formulas and examples, see the description below for details

[0048] 1. Problem definition

[0049] Suppose a target tensor of order M is given The training set of , where N is the number of samples, I 1 × I 2 ×…×I M is the size of the sample space, and R is the real sample space. Combine N target tensors into a tensor of order (M+1) At the same time, F=[f 1 , f 2 ,..., f N ] T ∈{0,1} N×C Represented as a binary label matrix, where C is the number of classes and f i is the i-th sample χ i The label vector for . if and only if χ iWhen belonging to the jth category (j=1, 2,..., C), the element f i,j is 1, and the rest are 0.

[0050] The proposed algorithm aims to jointly learn:

[0051] 1) For the first M order of the tensor, learn M orthogonal factor matrices Realize the low-dimensional embedding of the original tensor, and learn the feature representation m

Embodiment 3

[0096] Below in conjunction with concrete implementation process, implementation result, carry out feasibility verification to the scheme in embodiment 1 and 2, see the following description for details:

[0097] Comparing our method with state-of-the-art classification algorithms to validate the joint use of kernel tensors and l 2,1 The effectiveness of heterogeneous tensor decomposition of norms for image classification, the data set used is: ORL.

[0098] In Example 1, the proposed heterogeneous tensor decomposition based image classification is evaluated on the widely used dataset ORL. This dataset has been widely used by various image classification methods. Apply nearest neighbor classifiers to evaluate classification performance.

[0099] The ORL dataset contains 40 different subjects, each with 10 images. Images in the same subject were taken with wide variance, changing lighting, facial expressions (eyes open / closed, smiling / unhappy) and facial details (glasses /

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses an image classification method based on heterogeneous tensor decomposition. The method comprises the following steps: constructing an original tensor according to an ORL data set; decomposing the original tensor into a factor matrix and a sample feature representation matrix corresponding to each order of the tensor; adding column-by-column orthogonal constraints on the factor matrix; low-rank constraint is applied to the sample feature representation matrix, and the lowest-rank representation is obtained by identifying the global low-rank structure of the sample; through l2, 1 norm constraint loss function and a regularization item, a target of robust feature selection discrimination is realized; obtaining a complete objective function; carrying out optimization iteration on the objective function by using an alternating direction multiplier to obtain an optimal solution, and further obtaining a classifier; and inputting the test set pictures in the ORL into the trained classifier to complete image classification. The method solves the problems that in a traditional vector or matrix method, structural information is likely to be lost, and dependence among elements and heterogeneity in the tensor decomposition process are damaged.

Description

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Owner TIANJIN UNIV
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