Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

An Adaptive Kernel Clustering Image Segmentation Method

An image segmentation and kernel clustering technology, applied in the field of image processing, can solve problems such as wrong segmentation results and inaccurate cluster numbers, and achieve the effects of reducing time consumption, reducing the possibility of local convergence, and reducing sensitivity

Inactive Publication Date: 2017-12-19
HOHAI UNIV
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Using the peaks and troughs in the gray histogram of the image to be segmented to determine the number of clusters of the image to be segmented can ensure that the pixels in each class have similar gray values, but when the boundary between the peak and the trough is blurred , the number of clusters obtained by this method will be inaccurate, resulting in wrong segmentation results

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
  • An Adaptive Kernel Clustering Image Segmentation Method
  • An Adaptive Kernel Clustering Image Segmentation Method
  • An Adaptive Kernel Clustering Image Segmentation Method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0040] The present invention will be further described below in conjunction with the accompanying drawings.

[0041] Such as figure 1 As shown, an adaptive kernel clustering image segmentation method, for an image sample gray value set containing n elements X={x 1 ,x 2 ,...,x n},, each element in the sample has s characteristic attributes, then each sample element can use the vector x k =[x k1 ,x k2 ,...,x ks ] T ∈R s Represents, where T represents the matrix transpose, and the vector x k The value of each dimension of is the value of its corresponding characteristic attribute. Now divide the sample set X into c clusters, where the value range of c is 1k The membership degrees of c classifications are expressed as vectors, then the membership of n elements to c classifications can be divided by matrix U=[u ik ] c×n Indicates that U ∈ R cn . at the same time u ik Constraints are met:

[0042]

[0043] use theta i Indicates the cluster center, and all cluster ...

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 a self-adaptive kernel cluster image partitioning method which aims at combining particle swarms, fuzzy clustering and granularity validity functions and providing a monitoring-free gray image partitioning method. The self-adaptive kernel cluster image partitioning method comprises the following steps: according to the characteristic difference of different image areas, corresponding areas which have identical characteristics or similarity within a certain area in images into one type of clustering processing through clustering, thereby completing the image partitioning process. Chaos particles are adopted as an initial center of clustering, so that the sensitivity of the partitioning result to the selection of the initial clustering center is alleviated, and the possibility that an algorithm falls into partial convergence is reduced. In the fuzzy clustering process, the gray level of the images instead of that of image pixel points is taken as a clustering sample set, and the image partitioning speed is increased; in the clustering process, the validity functions of clustering is dynamically calculated, an optimal clustering number is selected, and the subjectivity in artificially appointing the clustering number is avoided.

Description

technical field [0001] The invention relates to an adaptive kernel clustering image segmentation method, which belongs to the technical field of image processing. Background technique [0002] Image segmentation is to extract the target area of ​​interest in the image based on the feature difference between the image areas, so that the subsequent tasks can be carried out, and it is an important basis for image processing. In practical applications, due to the equipment, environment, system and other factors of image acquisition, images inevitably have fuzziness and uncertainty, and fuzzy theory is very suitable for describing such characteristics of images. Clustering is to divide a collection of objects without specific categories into several small sub-collections according to certain requirements or rules, and requires that the differences between the sub-collections be as large as possible. Introducing the combination of fuzzy theory and clustering theory into the image...

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
Patent Type & Authority Patents(China)
IPC IPC(8): G06T7/10
CPCG06T7/11G06T2207/20112
Inventor 胡居荣韩亚红陈龙
Owner HOHAI UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products