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

44 results about "Global local" patented technology

Weighted convolutional autoencoder-long short-term memory network-based crowd anomaly detection method

The invention discloses a method for performing anomaly detection by a weighted convolutional autoencoder-long short-term memory network (WCAE-LSTM network). The method is devoted to perform anomaly detection and positioning by learning a generation model of a mobile pedestrian, thereby guaranteeing the public safety. The invention provides a novel double-channel framework, which learns generationmodes of an original data channel and a corresponding optical flow channel and reconstructs data by utilizing the WCAE-LSTM network, and performs the anomaly detection on the basis of a reconstruction error. In addition, for the problem of complex background, it is proposed that a sparse foreground and a low-rank background are separated by adopting modular robust principal component analysis decomposition; and a weighted Euclidean loss function is designed according to obtained background information, so that background noises are inhibited. The designed WCAE-LSTM network can not only perform the anomaly detection globally but also roughly locate an abnormal region locally; and through the joint consideration of global-local anomaly analysis and optical flow anomaly analysis results, finally robust and accurate detection of abnormal events is realized.
Owner:CHANGZHOU UNIV

Pedestrian re-identification method and device based on global features and coarse granularity local features

The invention, which belongs to the field of image processing and identification, discloses a pedestrian re-identification method and device based on global features and coarse granularity local features. The method comprises: detecting a pedestrian image in a query image as a global image, detecting a body key point of the pedestrian, and dividing the body of the pedestrian to obtain a local partregion; extracting global feature description of the global image and local feature description of the local part region, carrying out fusion of the global feature description and the local feature description to obtain global-local feature description; and carrying out associated analysis and combined indexing on all images in a pedestrian database, carrying out pedestrian retrieving on the processed images from the coarse granularity to fine granularity according to the global-local feature description, and determining the identity of the pedestrian in the query image. According to the invention, coarse granularity division is carried out on the body in the image, so that the good robustness is realized; and because the global features and regional local features are combined, accuratematching of the pedestrian images and pedestrian identity identification are realized.
Owner:PEKING UNIV

A data dimension reduction method based on a tensor global-local preserving projection

A data dimension reduction method based on a tensor global-local preserving projection comprises the following steps: (1) data samples are selected to form a sample set which is to be subjected to dimension reduction; (2) distances between sample pairs are calculated; (3) neighborhoods of sample points are divided to obtain close neighbor points and non-close-neighbor points; (4) neighboring right matrixes and non-neighboring right matrixes are established according to close neighbor relations and not-close-neighbor relations among the samples; (5) An object function corresponding to data global and local structure preserving is established, and an optimization problem is constructed; (6) the optimization problem is converted to a generalized eigenvalue problem, and a projection matrix is obtained through solving the problem; and (7) projection is carried out on the sample set to obtain dimension reduction data. Targeting at a dimension reduction problem of second order tensor data, the invention provides the data dimension reduction method which can simultaneously carry out excavation on the global and local structures of the data, which is good in dimension reduction effects and which are based on the tensor global-local preserving projection.
Owner:ZHEJIANG UNIV OF TECH

Method for analyzing residual compression strength of composite materials after impact damage

ActiveCN106202598AEfficiently predict residual strengthSpecial data processing applicationsUltrasound attenuationResidual strength
The invention belongs to the field of structural damage tolerance design of composite materials, and specifically relates to a method for analyzing residual compression strength of composite materials after impact damage; and the method is used for determining the residual compression strength of composite materials after impact damage. The method comprises three steps of 1, selecting a Hanshin failure criterion as a damage failure criterion for low-speed impact of a laminated plate according to failure characteristics of a composite material; 2, importing the Hanshin failure criterion by adopting a large-scale dynamic finite element program DYTRAN, so as to calculate a damage area under the low-speed impact of the laminated plate; and 3, carrying out rigidity attenuation on a damage area after the low-speed impact according to the damage area determined in the second step, and calculating the residual compression strength of the laminated plate after the low-speed impact by adopting a global-local model analysis method. The invention discloses a brand new analysis method, so that the residual strength of typical components of composite materials after impact damage can be effectively predicted, and basis is provided for the structural design, analysis and verification of the composite materials of airplanes.
Owner:HARBIN

Pedestrian image feature classification method and system

InactiveCN106709478ASatisfy the strict conditions required by the input sampleGuaranteed robustnessCharacter and pattern recognitionData expansionClassification methods
The invention provides a pedestrian image feature classification method and system, and the method comprises the steps: carrying out the data expansion of a pedestrian image sample in a sample dataset; carrying out the grouping of the pedestrian image sample in the sample dataset after expansion, and obtaining a plurality of pedestrian sample groups; selecting samples, building a multi-channel convolution neural network, and extracting the global and local features of the sample data through the multi-channel convolution neural network; setting a loss function, calculating a loss value of the multi-channel convolution neural network, and optimizing the multi-channel convolution neural network; carrying out the feature classification of each global-local feature through the optimized multi-channel convolution neural network, and obtaining the feature class of each pedestrian sample group. The method enables the sample data to be expanded, meets the condition that triple loss exerts strict requirements for an input sample, can guarantee the robustness through employing multi-loss to optimize the multi-channel convolution neural network, and is suitable for the processing of pedestrian image features of a plurality of scenes.
Owner:GUILIN UNIV OF ELECTRONIC TECH

A method for controlling alignment of pre-fabricated segmental beams based on a short-line matching method

The invention relates to the technical field of alignment control of pre-assembled segmental beams in bridge engineering, in particular to a method for controlling alignment of pre-fabricated segmental beams based on a short-line matching method. The method comprises the following steps: S1, performing on-site data measurement; S2, establishing a local global coordinate conversion system; S3, n-1# block 6 control point measured local coordinates are converted into measured global coordinates data; S4, deviation analysis is performed on the -1 # block; S5, determining the coupling angle of n-1 #two end axis and performing decoupling; S6, calculating the correction coordinates of the I end of the n # block; S7, judging whether the adjustment is made to the n + 1 # block; S8, judging whether there is deviation in the construction of the n # block, and if so, adjusting the positioning point of the I end section of the n + 1 # block; S9, obtaining the local coordinate data of the six control points when the n # block is used as the matching block to prefabricate the n + 1 # block through the global-local coordinate conversion, which has the beneficial effect that the real beam block axis deviation angle can be obtained, and the calculation accuracy of the corrected coordinate of the prefabricated beam block is improved.
Owner:SOUTH CHINA UNIV OF TECH

A mesh surface curve design method based on distance constraint

The invention discloses a mesh surface curve design method based on distance constraint. The designed curve passes through a given interpolation point and is smooth (in the sense of discreteness) andstrictly located on the mesh surface. The method transforms the complex manifold constraints into distance constraints and describes them as optimization problems together with smooth constraints andinterpolation constraints. The local surface is approximated by the tangent plane, and the distance constraint is relaxed to the distance from the point to the tangent plane. Because the points on thecurve used to calculate the distance are interdependent with their corresponding tangent points, a global-local iterative strategy is adopted and Gauss- Newton idea method is used to control its convergence behavior: in the whole stage, it is relaxed into a convex optimization problem by distance approximation to solve the iterative step size; In the local phase, a robust and efficient projectionmethod is used to map the optimized curves to the surface to update the tangent points. Finally, all the relaxed polygons are mapped to the mesh surface by using the cutting plane method. Compared with the existing methods, this method has many advantages in efficiency, robustness and application range.
Owner:ZHEJIANG SCI-TECH UNIV

Freehand interactive three-dimensional model retrieval method based on high-level semantic property comprehension

The invention provides a freehand interactive three-dimensional model retrieval method based on high-level semantic property comprehension. According to the method, first, a data driving mode is utilized to extract global-local semantic properties of freehand sketches under different styles and categories, and a semantic property space of the freehand sketches is defined; second, on the basis of the defined semantic property space, automatic annotation of semantic properties is performed on a three-dimensional model in a database according to content characteristics corresponding to the three-dimensional model; and last, the semantic properties of the freehand sketches and the semantic properties of the three-dimensional model in the database are mapped to the same measurement space by means of constructing a semantic property tree for comparison, and if the similarity between the semantic properties of the freehand sketches and the semantic properties of the three-dimensional model reaches a set similarity, information of the three-dimensional model is fed back, and retrieval is completed. Through the method, deviation brought by an existing freehand interactive three-dimensionalmodel retrieval algorithm through which a three-dimensional model cannot be compared with freehand sketches unless the three-dimensional model is projected into a two-dimensional view is avoided.
Owner:JIANGXI NORMAL UNIV

Aggregation node location method based on improved discrete difference algorithm

The present invention provides an aggregation node location method based on an improved discrete difference algorithm. The influence of the isomerism of nodes and the reliability of the routing path in real engineering on aggregation node location is fully considered, an adaptive zoom factor is introduced into the improved discrete difference algorithm to allow the algorithm to maintain high global search capability at the initial stage and maintain high global local search capability at the later period; an adaptive variation mechanism is introduced, an appropriate variation strategy is selected according the trend of the population evolution in the evolution process to maintain the diversity of the population and avoid falling into the local optimum so as to improve the global optimization capability of the discrete difference algorithm, rapidly converging the algorithm and solve the technical problems of the precocity convergence and falling into the local minimum of the original difference algorithm at the discrete variable optimization, and therefore the optimized aggregation node location disposition is obtained, the data communication reliability is enhanced, and the network service quality is improved.
Owner:CHONGQING TECH & BUSINESS UNIV

Heterogeneous network recommendation algorithm based on deep neural network

The invention discloses a heterogeneous network recommendation algorithm based on a deep neural network. The heterogeneous network recommendation algorithm comprises the following steps: S1, representing vectors of global local information of users and articles; S2, automatically selecting meta-path types by utilizing a bolt genetic algorithm; S3, obtaining meta-path instances under the optimal Xmeta-path types; S4, obtaining an interaction vector based on the meta-path; S5, fusing global local information of the user and the article; S6, enhancing the vector representation of the user and the object by using a collaborative attention mechanism; S7, obtaining scores of the user and the article pair; S8, building loss function optimization parameters; and S9, repeating the steps 1-8, and when lu, i stably tends to a very small threshold epsilon (epsilon) 0), stopping training to obtain a heterogeneous network recommendation model based on the deep neural network. According to the invention, valuable meta-path types are automatically obtained by utilizing a genetic algorithm, so that the interference of human factors is reduced; and global and local information in the heterogeneousnetwork are mined through the node domain and the network structure information.
Owner:NORTHWESTERN POLYTECHNICAL UNIV

Global-local adaptive optimization panoramic light field splicing method

The invention discloses a panoramic light field splicing method based on global local adaptive optimization. The panoramic light field splicing method comprises the following steps: inputting a plurality of light fields to be spliced; extracting, matching and screening feature points of the to-be-spliced light fields to calculate a global homography transformation matrix of all the to-be-spliced light fields; respectively carrying out 4D meshing on the plurality of to-be-spliced light fields, evaluating the global registration precision of each grid according to the global homography transformation matrix, calculating a local homography transformation matrix of the grid of which the global registration precision is lower than a preset threshold, and evaluating the local registration precision of the corresponding grid according to the local homography transformation matrix; and comparing the global registration precision with the local registration precision, taking the homography transformation matrix with the highest precision for each grid, and fusing the light fields to obtain a splicing result. According to the invention, the overall and detail splicing results of the light field are most accurate, so that an accurate multi-light-field panoramic splicing method is realized.
Owner:SHENZHEN GRADUATE SCHOOL TSINGHUA UNIV

Global and local batch process fault detection method based on dynamic orthogonality

ActiveCN109085816AEliminate Dynamic Timing DependenciesEliminate dynamicsElectric testing/monitoringTime lagCharacteristic space
The invention provides a global and local batch process fault detection method based on dynamic orthogonality, which comprises the following steps of: (1) collecting each key variable data when a batch process is normally operated, and forming a training sample X which is an element of a set of RI*J*K in a normal operation state; (2) firstly expanding the training sample X into two-dimensional data X which is an element of a set of RI*KJ along a batch direction, then carrying out standardization on the expanded two-dimensional data, and rearranging the standardizated two-dimensional data intoX which is an element of a set of RKI*J; (3) on the basis of the two-dimensional data X which is the element of the set of RKI*J, establishing a time lag matrix XD to eliminate timing autocorrelationof a process variable; (4) constructing a dynamic orthogonal global local model for the established time lag matrix XD; (5) respectively establishing T2 and SPE statistical models in a characteristicspace and a residual space, and gaining a control limit; (6) collecting online process data and carrying out standardization processing; and (7) carrying out projection on the online data by utilizingthe established dynamic orthogonal global local model, and by the T2 and SPE statistical models, judging occurrence of a fault.
Owner:LANZHOU UNIVERSITY OF TECHNOLOGY
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