CN102708589B - Three-dimensional target multi-viewpoint view modeling method on basis of feature clustering - Google Patents

Three-dimensional target multi-viewpoint view modeling method on basis of feature clustering Download PDF

Info

Publication number
CN102708589B
CN102708589B CN201210150380.8A CN201210150380A CN102708589B CN 102708589 B CN102708589 B CN 102708589B CN 201210150380 A CN201210150380 A CN 201210150380A CN 102708589 B CN102708589 B CN 102708589B
Authority
CN
China
Prior art keywords
target
viewpoint
bending moment
cluster
attitude image
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201210150380.8A
Other languages
Chinese (zh)
Other versions
CN102708589A (en
Inventor
赵慧洁
李旭东
丁昊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beihang University
Original Assignee
Beihang University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beihang University filed Critical Beihang University
Priority to CN201210150380.8A priority Critical patent/CN102708589B/en
Publication of CN102708589A publication Critical patent/CN102708589A/en
Application granted granted Critical
Publication of CN102708589B publication Critical patent/CN102708589B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Image Analysis (AREA)

Abstract

The invention relates to a three-dimensional target multi-viewpoint view modeling method on the basis of the feature clustering, which comprises four steps of: 1, acquiring an all attitude image of a test target; 2, extracting a target feature vector set <xi|i=1,2,...N> from an acquired all attitude image set and adopting a 7-dimensional invariant moment formed by integrating an affine invariant moment with a geometric invariant moment and further carrying out regularization to describe an appearance feature of the all attitude image; 3, determining an optimal cluster number Cop; and 4, clustering target feature vectors into the Cop type by adopting a k-means clustering method and using a small amount of finally obtained clustering centers as modeling results. Aiming at the defect that under different viewpoints, due to difference of target images, the single target view description cannot identify the target, the invention establishes the three-dimensional target multi-viewpoint view modeling method which has a small description number and little redundant information and can be used for well describing the target all-attitude feature vector set. The three-dimensional target multi-viewpoint view modeling method has high practical value and wide application prospect in the field of the pattern recognition.

Description

A kind of many viewpoints of objective View Modeling Method based on feature clustering
Technical field
The present invention relates to a kind of many viewpoints of objective View Modeling Method based on feature clustering, belong to area of pattern recognition, be specifically related to the aspects such as target identification, Target Modeling and Data Reduction.For the modeling of many viewpoints of objective, be applicable to the problem that simple target view description that under different points of view, target image difference causes can not be identified target.
Background technology
Objective identification is an important research direction in computer vision field.The three-dimensional information that obtains in actual applications at present target is often very difficult, and the image that identification objective still mainly forms by identification target two-dimensional projection completes.Target two-dimensional imaging (projection) process has caused partial information loss, and under different points of view, the appearance difference of complex target is obvious, makes the objective identification difficulty of fast and stable very large.
By objective being carried out to modeling to form the comprehensive description to target shape, be one of means that address this problem.This just need to study many viewpoints View Modeling Method of objective.Idea is under a plurality of viewpoints, the description of target image to be integrated to the description as target intuitively.Yet for same target, its attitude number cannot be exhaustive, between different description, a lot of redundant informations have also been comprised.Therefore, need to when describing, yojan redundancy retain as far as possible important description.
The viewpoint spherical surface partitioning algorithm of classical many viewpoints of objective View Modeling Method based target geometry and visible relation, the geometry topological characteristic of main based target image, the modeling result finally obtaining is the multi-pose characteristic view collection about target.But these class methods depend on geometry and the feature of target to the structure of target signature view collection, generally can only, for a certain class certain objects of certain complexity, as solid of revolution, quadric surface body etc., in reality, be difficult to application.
Summary of the invention
The object of the invention is to: a kind of many viewpoints of objective View Modeling Method based on feature clustering is provided, the simple target view description that it causes for target image difference under different points of view can not be identified the shortcoming of target, has built a kind of many viewpoints of objective View Modeling Method of describing that quantity is little, redundant information is few, can better describing the full posture feature vector set of target.
Its technical scheme is as follows:
A kind of many viewpoints of objective View Modeling Method based on feature clustering of the present invention, it comprises the following steps:
Step 1: the full attitude image that obtains test target.Target is placed in to viewpoint ball center, and target carriage change is equivalent to the difference object observing of video camera in viewpoint spherical surface.Uniform sampling in viewpoint spherical surface, obtaining quantity is the full attitude image set of the objective of N.
Step 2: extract target feature vector set { x from the full attitude image set obtaining i| i==1,2 ... N}.Employing combine affine not bending moment and geometric invariant moment and further form after regularization 7 tie up not bending moment and describe the full attitude image of target resemblance.
Step 3: determine optimum clustering number C op.By analyzing cluster total error quadratic sum J eand the relation curve (J between cluster numbers C e-c curve) and J e-c second derivative curve zero crossing, determines optimum clustering number C op.
Step 4: adopt k-means Method that target feature vector is gathered for C opclass, using a small amount of cluster centre finally obtaining as modeling result.
Wherein, the full attitude image that obtains test target described in step 1, specific implementation process is as follows:
First create the target three-dimensional model that need to carry out the modeling of many viewpoints view.Then object module is placed in to the centre of sphere of imaginary viewpoint ball, because target carriage change is equivalent to the difference object observing of video camera in viewpoint spherical surface, therefore obtains video camera and observe the process that the process of viewpoint is division viewpoint spherical surface.Adopt the mode of similar division earth longitude and latitude, with same intervals, evenly divide viewpoint spherical surface, and at corresponding division points place to target imaging, can obtain the full attitude image set of target.
Wherein, the affine not bending moment described in step 2 is obtained by (1) formula, wherein μ pqpresentation video p+qJie center square.
I 1 = ( &mu; 20 &mu; 02 - &mu; 11 2 ) &mu; 00 4 I 2 = &mu; 30 2 &mu; 03 2 - 6 &mu; 30 &mu; 03 &mu; 21 &mu; 12 + 4 &mu; 30 &mu; 12 3 + 4 &mu; 21 3 &mu; 03 - 3 &mu; 12 2 &mu; 21 2 &mu; 00 10 I 3 = &mu; 20 ( &mu; 21 &mu; 03 - &mu; 12 2 ) - &mu; 11 ( &mu; 30 &mu; 03 - &mu; 21 &mu; 12 ) + &mu; 02 ( &mu; 30 &mu; 12 - &mu; 21 2 ) &mu; 00 7 - - - ( 1 )
For carrying out front four components of comprehensive geometric invariant moment with above-mentioned affine not bending moment, by (2) formula, obtained
&Phi; 1 = &eta; 20 + &eta; 02 &Phi; 2 = ( &eta; 20 - &eta; 02 ) 2 + 4 &eta; 11 2 &Phi; 3 = ( &eta; 30 - 3 &eta; 12 ) 2 + ( 3 &eta; 21 - &eta; 03 ) 2 &Phi; 4 = ( &eta; 30 + &eta; 12 ) 2 + ( &eta; 21 + &eta; 03 ) 2 - - - ( 2 )
For solving the above-mentioned not difference of the order of magnitude between bending moment, need further above-mentioned not bending moment to be carried out to regularization computing
I k &OverBar; = sign ( I k ) | I k | 2 / S - - - ( 3 )
I in formula kthe combination that represents not regularization is bending moment not, not bending moment is combined in expression regularization, and Sign represents Heaviside function, and S represents the summation of square factor exponent number in each square component.Finally obtain describing 7 of target shape information and tie up not bending moment of regularization.
Wherein, the definite optimum clustering number C described in step 3 op, specific implementation process is as follows:
Adopt k-means Method to carry out cluster to the full posture feature vector set of above-mentioned target, making classification count c progressively increases, c=2, and c=3 ..., record the total error quadratic sum J of each cluster e, final according to obtaining J e-c curve, further calculates J e-c second derivative curve, in the situation that considering certain numerical value fluctuation, selects J eon-c second derivative curve first close to zero point and relatively the mid point between flat zone as optimum cluster numbers c opestimated value.
The advantage that the present invention has is: by feature clustering, with minority cluster centre, represent the distribution of the full posture feature vector of target in feature space, realized Data Reduction, method highly versatile, can conveniently determine optimum clustering number.
Accompanying drawing explanation
Fig. 1 is processing flow chart of the present invention;
Fig. 2 is the viewpoint ball schematic diagram relating in the present invention;
Fig. 3 is J in the present invention e-c curve synoptic diagram;
Fig. 4 is that the present invention determines optimum clustering number C opschematic diagram.
Embodiment
The present invention is directed to many viewpoints of objective view modeling problem, proposed a kind of many viewpoints of objective View Modeling Method based on Support Vector data description.
See Fig. 1, a kind of many viewpoints of objective View Modeling Method based on feature clustering of the present invention, it comprises the following steps:
Step 1: the full attitude image that obtains test target.Target is placed in to viewpoint ball center, and target carriage change is equivalent to the difference object observing of video camera in viewpoint spherical surface.Uniform sampling in viewpoint spherical surface, obtaining quantity is the full attitude image set of the objective of N.
Step 2: extract target feature vector set { x from the full attitude image set obtaining i| i=1,2 ... N}.Employing combine affine not bending moment and geometric invariant moment and further form after regularization 7 tie up not bending moment and describe the full attitude image of target resemblance.
Step 3: determine optimum clustering number C op.By analyzing cluster total error quadratic sum J eand the relation curve (J between cluster numbers C e-c curve) and J e-c second derivative curve zero crossing, determines optimum clustering number C op.
Step 4: adopt k-means Method that target feature vector is gathered for C opclass, using a small amount of cluster centre finally obtaining as modeling result.
First, obtain the full attitude image of target and need to create the target three-dimensional model for the treatment of modeling.See Fig. 2, object module is placed in to the centre of sphere of viewpoint ball.Viewpoint ball is the imaginary unit's ball being defined in three dimensional euclidean space, under different points of view, the imaging process of target can be regarded target as and take the centre of sphere as the process of starting point to different directions projection, in viewpoint spherical surface, the corresponding projecting direction vector of every bit P P, sees target along the rectangular projection of projecting direction P corresponding to the point of P viewpoint spherical surface.Therefore obtain video camera and observe the process that the process of viewpoint is division viewpoint spherical surface.Adopt the mode of similar division earth longitude and latitude, with same intervals, evenly divide viewpoint spherical surface, and at corresponding division points place to target imaging, can obtain element number is the full attitude image set of target of N.
Attitude image set is extracted to target signature, obtain the proper vector set { x that describes the full attitude appearance information of this target i| i=1,2 ... N}.Adopt 7 of comprehensive affine not bending moment and geometric invariant moment formation to tie up not bending moment and described target shape.Affine not bending moment is obtained by (1) formula, wherein μ pqpresentation video p+qJie center square.
I 1 = ( &mu; 20 &mu; 02 - &mu; 11 2 ) &mu; 00 4 I 2 = &mu; 30 2 &mu; 03 2 - 6 &mu; 30 &mu; 03 &mu; 21 &mu; 12 + 4 &mu; 30 &mu; 12 3 + 4 &mu; 21 3 &mu; 03 - 3 &mu; 12 2 &mu; 21 2 &mu; 00 10 I 3 = &mu; 20 ( &mu; 21 &mu; 03 - &mu; 12 2 ) - &mu; 11 ( &mu; 30 &mu; 03 - &mu; 21 &mu; 12 ) + &mu; 02 ( &mu; 30 &mu; 12 - &mu; 21 2 ) &mu; 00 7
For carrying out front four components of comprehensive geometric invariant moment with above-mentioned affine not bending moment, by (2) formula, obtained
&Phi; 1 = &eta; 20 + &eta; 02 &Phi; 2 = ( &eta; 20 - &eta; 02 ) 2 + 4 &eta; 11 2 &Phi; 3 = ( &eta; 30 - 3 &eta; 12 ) 2 + ( 3 &eta; 21 - &eta; 03 ) 2 &Phi; 4 = ( &eta; 30 + &eta; 12 ) 2 + ( &eta; 21 + &eta; 03 ) 2
For solving the above-mentioned not difference of the order of magnitude between bending moment, need further above-mentioned not bending moment to be carried out to regularization computing
I k &OverBar; = sign ( I k ) | I k | 2 / S
The combination that wherein Ik represents not regularization is bending moment not, not bending moment is combined in expression regularization, and Sign represents Heaviside function, and S represents the summation of square factor exponent number in each square component.For example, for second component Ф of geometric invariant moment 2, S=(2+0) * 2=4, wherein (2+0) represents square factor η 20exponent number and, * 2 represent square factor η 20power operation.
Finally obtain describing 7 of target shape information and tieed up not bending moment of regularization.
The full posture feature vector set of above-mentioned target is carried out to cluster, using a small amount of cluster centre finally obtaining as modeling result.Adopted k-means Method.The basis of k-average is error sum of squares criterion.If N ii cluster Γ iin number of samples, m iit is the average of these samples.Γ iin each sample y and average m ibetween error sum of squares after all classes are added be:
J e = &Sigma; i = 1 c &Sigma; y &Element; &Gamma; i | | y - m i | | 2 - - - ( 4 )
J emeasured with c cluster centre m 1, m 2..., m cthe total square-error producing while representing c sample set.To different cluster J evalue be different, make J eminimum cluster is the optimal result under error sum of squares criterion.
Adopt following methods to determine optimum clustering number c op: as shown in Figure 3, making classification count c progressively increases, to c=2, and c=3 ... use respectively k-mean algorithm, error sum of squares will reduce along with the increase of c in theory.There is certain critical point OP, when cluster numbers is c opwhen individual, J ealong with cluster numbers, c is increased to c from 1 opand reduce rapidly J when c increases again ethough reduce to some extent, the speed reducing slows down.As shown in Figure 4, according to calculating J e-c curve, further calculates J e-c second derivative curve, in the situation that considering certain numerical value fluctuation, selects J eon-c second derivative curve first close to zero point and relatively the mid point between flat zone as optimum cluster numbers c opestimated value.
Finally, adopting k-means clustering algorithm, is c by the full posture feature vector set of target cluster opindividual classification, using the cluster centre of each subclass as many viewpoints of objective view modeling result.

Claims (1)

1. many viewpoints of the objective View Modeling Method based on feature clustering, is characterized in that: it comprises the following steps:
Step 1: the full attitude image that obtains test target; Target is placed in to viewpoint ball center, and target carriage change is equivalent to the difference object observing of video camera in viewpoint spherical surface, uniform sampling in viewpoint spherical surface, and obtaining quantity is the full attitude image set of the objective of N;
Step 2: extract the full posture feature vector of target set { x from the full attitude image set obtaining i| i=1,2 ... N}, adopt combine affine not bending moment and geometric invariant moment and further form after regularization 7 tie up not bending moment and describe the full attitude image of target resemblance;
Step 3: determine optimum clustering number C op; By analyzing cluster total error quadratic sum J eand the relation curve between cluster numbers C is J e-c curve and J e-c second derivative curve zero crossing, determines optimum clustering number C op;
Step 4: adopt k-means Method that the set of the full posture feature vector of target is gathered for C opclass, using a small amount of cluster centre finally obtaining as modeling result;
Wherein, the full attitude image that obtains test target described in step 1, specific implementation process is as follows: first create the target three-dimensional model that need to carry out the modeling of many viewpoints view, then object module is placed in to the centre of sphere of imaginary viewpoint ball, because target carriage change is equivalent to the difference object observing of video camera in viewpoint spherical surface, therefore obtain video camera and observe the process that the process of viewpoint is division viewpoint spherical surface; Adopt the mode of similar division earth longitude and latitude, with same intervals, evenly divide viewpoint spherical surface, and at corresponding division points place to target imaging, obtain the full attitude image set of target;
Wherein, the affine not bending moment described in step 2 is obtained by (1) formula, wherein μ pqpresentation video p+qJie center square;
For carrying out front four components of comprehensive geometric invariant moment with above-mentioned affine not bending moment, by (2) formula, obtained
For solving the difference of the order of magnitude between affine not bending moment and geometric invariant moment, need further above-mentioned not bending moment to be carried out to regularization computing
In formula, I kthe combination that represents not regularization is bending moment not, not bending moment is combined in expression regularization, and sign represents Heaviside function, and S represents the summation of square factor exponent number in each square component, finally obtains describing 7 of target shape information and ties up not bending moment of regularization;
Wherein, the definite optimum clustering number C described in step 3 op, specific implementation process is as follows:
Adopt k-means Method to carry out cluster to the full posture feature vector set of above-mentioned target, making classification count c progressively increases, c=2, and c=3 ..., record the total error quadratic sum J of each cluster e, final according to obtaining J e-c curve, further calculates J e-c second derivative curve, in the situation that considering certain numerical value fluctuation, selects J eon-c second derivative curve first close to zero point and relatively the mid point between flat zone as optimum cluster numbers c opestimated value.
CN201210150380.8A 2012-05-15 2012-05-15 Three-dimensional target multi-viewpoint view modeling method on basis of feature clustering Active CN102708589B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210150380.8A CN102708589B (en) 2012-05-15 2012-05-15 Three-dimensional target multi-viewpoint view modeling method on basis of feature clustering

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210150380.8A CN102708589B (en) 2012-05-15 2012-05-15 Three-dimensional target multi-viewpoint view modeling method on basis of feature clustering

Publications (2)

Publication Number Publication Date
CN102708589A CN102708589A (en) 2012-10-03
CN102708589B true CN102708589B (en) 2014-10-29

Family

ID=46901305

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210150380.8A Active CN102708589B (en) 2012-05-15 2012-05-15 Three-dimensional target multi-viewpoint view modeling method on basis of feature clustering

Country Status (1)

Country Link
CN (1) CN102708589B (en)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103295025B (en) * 2013-05-03 2016-06-15 南京大学 A kind of automatic selecting method of three-dimensional model optimal view
CN103870845B (en) * 2014-04-08 2017-02-15 重庆理工大学 Novel K value optimization method in point cloud clustering denoising process
CN104866872B (en) * 2015-06-03 2018-06-05 哈尔滨工业大学 The battery equivalent group technology of more characteristic parameters
US9875427B2 (en) * 2015-07-28 2018-01-23 GM Global Technology Operations LLC Method for object localization and pose estimation for an object of interest
CN107490356B (en) * 2017-08-21 2020-04-07 上海航天控制技术研究所 Non-cooperative target rotating shaft and rotation angle measuring method
CN108647730B (en) * 2018-05-14 2020-11-24 中国科学院计算技术研究所 Data partitioning method and system based on historical behavior co-occurrence

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102024036A (en) * 2010-11-29 2011-04-20 清华大学 Three-dimensional object retrieval method and device based on hypergraphs

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8375032B2 (en) * 2009-06-25 2013-02-12 University Of Tennessee Research Foundation Method and apparatus for predicting object properties and events using similarity-based information retrieval and modeling

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102024036A (en) * 2010-11-29 2011-04-20 清华大学 Three-dimensional object retrieval method and device based on hypergraphs

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
An Online Approach: Learning-Semantic-Scene-by-Tracking and Tracking-by-Learning-Semantic-Scene;Xuan Song等;《2010 IEEE Conference on Computer Vision and Pattern Recognition(CVPR)》;20100618;第739-746页 *
Xuan Song等.An Online Approach: Learning-Semantic-Scene-by-Tracking and Tracking-by-Learning-Semantic-Scene.《2010 IEEE Conference on Computer Vision and Pattern Recognition(CVPR)》.2010,第739-746页.
三维目标多尺度建模与混合神经网络识别方法;翁文杰;《中国优秀硕士学位论文全文数据库信息科技辑》;20080315(第3期);摘要,第10-29页 *
翁文杰.三维目标多尺度建模与混合神经网络识别方法.《中国优秀硕士学位论文全文数据库信息科技辑》.2008,(第3期),摘要,第10-29页.

Also Published As

Publication number Publication date
CN102708589A (en) 2012-10-03

Similar Documents

Publication Publication Date Title
Zhi et al. LightNet: A Lightweight 3D Convolutional Neural Network for Real-Time 3D Object Recognition.
CN109753885B (en) Target detection method and device and pedestrian detection method and system
Wu et al. 3d shapenets for 2.5 d object recognition and next-best-view prediction
Huang et al. A coarse-to-fine algorithm for matching and registration in 3D cross-source point clouds
CN102708589B (en) Three-dimensional target multi-viewpoint view modeling method on basis of feature clustering
Glasner et al. aware object detection and continuous pose estimation
CN108280858B (en) Linear global camera motion parameter estimation method in multi-view reconstruction
CN111160214A (en) 3D target detection method based on data fusion
Liu et al. Adaptive object tracking by learning hybrid template online
CN104915965A (en) Camera tracking method and device
CN103902989B (en) Human action video frequency identifying method based on Non-negative Matrix Factorization
CN104063702A (en) Three-dimensional gait recognition based on shielding recovery and partial similarity matching
CN107481279A (en) A kind of monocular video depth map computational methods
CN101877143A (en) Three-dimensional scene reconstruction method of two-dimensional image group
CN103295025A (en) Automatic selecting method of three-dimensional model optimal view
CN111754618B (en) Object-oriented live-action three-dimensional model multi-level interpretation method and system
JP2012083855A (en) Object recognition device and object recognition method
CN112712589A (en) Plant 3D modeling method and system based on laser radar and deep learning
CN105488541A (en) Natural feature point identification method based on machine learning in augmented reality system
CN106886754B (en) Object identification method and system under a kind of three-dimensional scenic based on tri patch
CN110009745B (en) Method for extracting plane from point cloud according to plane element and model drive
CN109284692A (en) Merge the face identification method of EM algorithm and probability two dimension CCA
CN113496260A (en) Grain depot worker non-standard operation detection method based on improved YOLOv3 algorithm
CN110543845B (en) Face cascade regression model training method and reconstruction method for three-dimensional face
CN116797640A (en) Depth and 3D key point estimation method for intelligent companion line inspection device

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant