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

48 results about "Sparse methods" patented technology

Video motion identification method based on sparse time slicing network

InactiveCN108764128ATake advantage ofImprove motion recognition accuracyCharacter and pattern recognitionSparse methodsNetwork structure
The invention discloses a video motion identification method based on a sparse time slicing network. The method includes steps: extracting information from each training video, and performing first training and optimization on the time slicing network; adding a sparse to the network after the first optimization, and performing second training and optimization; performing cutting and dimension adjustment on the network after the second optimization; performing third training and optimization on the network after dimension adjustment until the identification precision or the sparsity reaches theexpectation; and extracting information from a to-be-identified video, inputting the extracted information to the network after the third optimization, and performing output and fusion on the time slicing network to obtain a motion identification result. According to the method, the information of the longer video can be obtained through the time slicing network, and a double-flow convolutional network structure can fully utilize the video information and greatly improve the motion identification precision; and a structured sparse method can enable the weight of a convolution layer to be sparse in groups, a model is further simplified by network cutting, and the storage space is reduced.
Owner:HUAZHONG UNIV OF SCI & TECH

Monocular infrared video three-dimensional reconstruction method based on visual odometer

The invention provides a monocular infrared video three-dimensional reconstruction method based on a visual odometer. Firstly, a thermal infrared imager is calibrated; then, a direct method and sparse method visual odometer model is constructed; then, frames are managed, a key frame is generated from a continuous infrared image sequence to be processed, and the key frame is marginalized; point management is conducted on the pixel on the key frame; finally, sliding window optimization is conducted on the key frame, a photometric error of the direct method and sparse method visual odometer model is minimized, the reverse depths of thermal infrared imager pose, internal references and spatial points are solved in an iterative algorithm by a gauss-newton method, and finally, three-dimensional point cloud of a scene is obtained. According to the monocular infrared video three-dimensional reconstruction method based on the visual odometer, the direct method is applied to photometric error minimization, traditional feature point detection and matching are skipped, through direction operation on a grey value of the pixel, all variables which the photometric error to be optimized depend on is calculated directly, and therefore three-dimensional reconstruction of a night vision scene is achieved, the real-time capability of the three-dimensional reconstruction is ensured, and the spaciousness of the scene is enhanced.
Owner:DONGHUA UNIV

Array sparse method for broadband non-frequency-variable multi-beam imaging sonar

The invention discloses an array sparse method for a broadband non-frequency-variable multi-beam imaging sonar. With the Bessel function, fitting of influences on array guiding vectors by different frequency points in the broadband signal bandwidth is performed and a broadband signal multi-beam forming model under the far-field situation is established; on the premise that the formed multiple beams approximate a reference beam, a minimum number of effective array elements are searched and multiple sets of weighting coefficients are calculated; a highly nonlinear sparse array optimization problem is transformed into a sparse signal reconstruction problem in the compressed sensing theory, a reconstruction weighting coefficient is calculated iteratively by an underdetermined system localizedsolution algorithm, and a sparse array structure is determined; a convex optimization theory is introduced so as to form a plurality of low-side-lobe beams and a multi-beam array sparse side-lobe suppression model for array element excitation is established. According to the invention, the main lobes of a plurality of formed beams are not extended with changes of signal operating frequencies; andpeak side-lobe levels of multiple beams formed by the sparse array are reduced effectively.
Owner:NANJING UNIV OF AERONAUTICS & ASTRONAUTICS

Side lobe suppression method and array sparse method for multi-beam imaging sonar sparse array

ActiveCN108919199AEnhanced inhibitory effectAvoid the problem of sparse solutions falling into local optimumAcoustic wave reradiationSparse methodsLinear regression
The invention discloses a side lobe suppression method and an array sparse method for a multi-beam imaging sonar sparse array. A sparse optimization problem of an array antenna is transformed into a linear regression problem of a sparse matrix, combination learning is carried out by taking the reconstruction of multiple beam direction patterns with different pointing directions as a target task, and a sparse semicircle array model for multi-task learning is established; based on the performance requirement of a preset main side lobe, a norm regular term of 1<1 / 2> of a weighted coefficient matrix is introduced on the basis of a least squares loss function, an iterative threshold converged method and an accelerating gradient descent method are used for solving an optimal weighting coefficient, and a weighting coefficient which minimizes a side lobe peak level is solved at the same time while optimizing the position of the sparse array. According to the side lobe suppression method and the array sparse method for the multi-beam imaging sonar sparse array, the problem that the sparse solution falls into the local optimum due to the mismatching of array position and weight vector is avoided, and peak side lobe levels of multiple beams formed by the array after sparseness is effectively reduced.
Owner:NANJING UNIV OF AERONAUTICS & ASTRONAUTICS

Planar antenna array sparse method based on quantum spider population evolution mechanism

ActiveCN107302140ASolving sparse problems with discrete variablesImprove the theory of evolution mechanismAntenna arraysArtificial lifeSparse methodsPlanar antenna array
The invention provides a planar antenna array sparse method based on a quantum spider population evolution mechanism. The planar antenna array sparse method comprises the steps of 1, establishing a planar antenna array sparse model; 2, setting system parameters; 3, performing evaluation on advantages and disadvantages of each spider coding position in a population by a fitness function, and taking the optimal position of the fitness function as the global optimal position of the whole population; 4, dividing genders of spiders in the population; 5, calculating weight of each spider; 6, updating quantum positions of female spiders by adopting an analog quantum vector rotation door rotation based on the updated quantum vector rotary angle; 7, updating quantum positions of male spiders by adopting an analog quantum vector rotation door rotation based on the updated quantum vector rotary angle; 8, updating the respective historical optimal positions; and 9, judging whether the maximum number of iterations is reached or not. By adoption of the planar antenna array sparse method, the difficulty existing in multi-constraint planar array antenna sparsity is solved, and various requirements on the planar sparse array are satisfied.
Owner:HARBIN ENG UNIV

Neural network structured sparse method based on incremental regularization

InactiveCN110197257APrecise TrimmingAvoid problems that cannot bear large penaltiesNeural architecturesNeural learning methodsDimensional regularizationPattern recognition
The invention discloses a neural network structured sparse method based on incremental regularization. The method comprise the steps of when the branches of a neural network are pruned, according to the relative importance of each weight group, distributing different regularization increments to different weight groups step by step, then updating the regularization factors of the weight groups iteratively and continuously, and when the regularization factor of a certain weight group reaches a specified regularization upper limit, deleting the corresponding weight in the network permanently toincrease the structured sparsity of the network model; and when the sparsity of a certain layer reaches a preset sparsity rate, automatically stopping pruning of the layer until the pruning of all thelayers is completed; and finally, retraining the whole network to callback the accuracy, and when the accuracy of the model does not rise any more, stopping retraining to obtain a sparse model. According to the method, a large deep learning model can be deployed on the mobile and embedded equipment, a remarkable actual acceleration effect is obtained, and the application of a deep learning algorithm on a mobile terminal is promoted.
Owner:ZHEJIANG UNIV

Zero attraction penalty and attraction compensation combined sparse LMS method

ActiveCN113037661AFast convergenceAttract punishment easyChannel estimationSparse methodsAlgorithm
The invention relates to a zero attraction penalty and attraction compensation combined sparse LMS method, and belongs to the field of signal processing. According to the method, zero attraction penalty and attraction compensation are combined, coefficients of an estimation filter are divided into a near-zero coefficient, a small coefficient and a large coefficient, and then different attraction methods are adopted; in each iterative update, for estimating a near-zero coefficient of the filter, only a product term in an iterative update formula is used for calculation; then trace attraction compensation is carried out on the large coefficient of the estimation filter, so that the convergence speed of the coefficient of the estimation filter to approach the large coefficient of the channel is accelerated; for the small coefficient of the estimation filter, if the coefficient approaches the zero coefficient value of the channel or the large coefficient value of the channel in the iteration process, processing is carried out according to the method for estimating the near zero coefficient and the large coefficient of the filter, otherwise, simple zero attraction punishment is carried out on the coefficient. The method is high in convergence speed, low in complexity and wide in tuning parameter application range.
Owner:CHONGQING UNIV OF POSTS & TELECOMM

Sparse LMS method for combination of zero attraction penalty and attraction compensation

The invention relates to a sparse LMS method combining zero attraction penalty and attraction compensation, belonging to the field of signal processing. The method combines zero attraction penalty and attraction compensation, divides the coefficients of the estimated filter into near zero coefficients, small coefficients and large coefficients, and then adopts different attraction methods. In each iterative update, for the near-zero coefficients of the estimated filter, only the product term in the iterative update formula is used to calculate; for the large coefficients of the estimated filter, a slight attraction compensation is performed to speed up the estimated filtering The coefficient of the filter is used to approximate the convergence speed of the large coefficient of the channel; for the small coefficient of the estimated filter, if the coefficient approximates the zero coefficient value of the channel or the large coefficient value of the channel during the iteration process, then the estimation filter is approximated as described above. method with zero and large coefficients, otherwise, a simple zero-attraction penalty is applied to the coefficient. The method has fast convergence speed, low complexity and wide range of tuning parameters.
Owner:CHONGQING UNIV OF POSTS & TELECOMM

High-frequency time series data real-time sparse display method based on number of pixel points

The invention relates to the technical field of industrial data acquisition visualization, in particular to a high-frequency time series data real-time sparse display method based on the number of pixels. The method comprises the following steps: when an oscillogram of a time series data point is displayed on a computer graphical interface, a point tracing display method is adopted, points in an actual coordinate system are converted into pixel coordinate system points for point tracing, the time sequence is horizontal coordinates, the amplitude is vertical coordinates, the time sequence is converted into horizontal coordinate pixels, the amplitude is converted into vertical coordinate pixels, and then the points are connected through folding lines. Under the condition of high-frequency data acquisition, data can be acquired; the data point density is very large, if a signal waveform curve is displayed in real time without distortion, a large amount of computer performance and networkperformance can be consumed, the data sparse method based on the number of pixel points is provided, and the signal waveform curve can be displayed in real time without distortion under the conditionthat the computer hardware performance is not improved.
Owner:WUHAN HENGLI HUAZHEN TECH CO LTD

Sidelobe Suppression Method and Array Sparse Method for Multi-beam Imaging Sonar Sparse Array

ActiveCN108919199BEnhanced inhibitory effectAvoid the problem of sparse solutions falling into local optimumAcoustic wave reradiationLocal optimumSparse methods
The invention discloses a side lobe suppression method and an array sparse method for a multi-beam imaging sonar sparse array. A sparse optimization problem of an array antenna is transformed into a linear regression problem of a sparse matrix, combination learning is carried out by taking the reconstruction of multiple beam direction patterns with different pointing directions as a target task, and a sparse semicircle array model for multi-task learning is established; based on the performance requirement of a preset main side lobe, a norm regular term of 1<1 / 2> of a weighted coefficient matrix is introduced on the basis of a least squares loss function, an iterative threshold converged method and an accelerating gradient descent method are used for solving an optimal weighting coefficient, and a weighting coefficient which minimizes a side lobe peak level is solved at the same time while optimizing the position of the sparse array. According to the side lobe suppression method and the array sparse method for the multi-beam imaging sonar sparse array, the problem that the sparse solution falls into the local optimum due to the mismatching of array position and weight vector is avoided, and peak side lobe levels of multiple beams formed by the array after sparseness is effectively reduced.
Owner:NANJING UNIV OF AERONAUTICS & ASTRONAUTICS
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