62 results about "Iterative thresholding" patented technology

The invention discloses a non-contact contact line geometrical parameter detecting method. The method includes a first step of collecting high-definition images at equal time intervals by means of collection of control signals and finishing image preprocessing by means of the median filtering technique, the image graying technique and the like, a second step of locating a laser spot center point and extracting a coordinate of the center point by means of the iterative thresholding algorithm and a method of removing isolated noise in mathematical morphology, a third step of extracting a matched target region and detecting a transverse gray singular value of the target region, a fourth step of giving the wire height and a stagger value of a contact line by means of conversion from an image coordinate system to a camera coordinate system and from the camera coordinate system to a detection vehicle coordinate system, and compensating vibration of a vehicle body, and a fifth step of giving precise detection values of the wire height and the stagger value and displaying information of a plurality of parameters in a developed graphic monitoring interface. The method effectively improves detection efficiency of geometrical parameters of a contact net, simplifies the algorithm, improves precision of fault detection, and specifically improves safe reliability of the contact net of a high-speed train.

The present invention relates to a compressed sensing method for multi-source impact load identification of a mechanical structure for solving ill-posed natures of the multi-source impact load identification inverse problem of a highly underdetermined system. The method comprises the following steps of (1) measuring a frequency response function between an action point of impact load of the mechanical structure and a response point of the mechanical structure, and furthermore constructing a sensing matrix; (2) measuring signals generated by dynamic load of the structure by using a sensor; (3) constructing an underdetermined equation of the multi-source impact load identification; (4) constructing an L1-norm-based compressed sensing convex optimization model of the multi-source impact load identification; and (5) solving the compressed sensing optimization model by using a two-step iteration threshold algorithm, and obtaining a compressed sensing solution of multi-source impact load. Time and space combined sparsity of the impact load is fully utilized, the method is suitable for identifying and positioning the multi-source impact load acting on the mechanical structure, and the choke point that the underdetermined system cannot be solved by a traditional regularization method based on L2 norm is overcome.

The invention provides an automatic design method and device for a superconducting quantum chip reading cavity and a storage medium. The method comprises the following steps: determining the length of a CPW resonator according to the initial design frequency of a readout cavity; configuring a layout template and a simulation template, wherein the layout template and the simulation template are used for configuring geometric figure coordinates and size parameters of the CPW resonator and reading modeling parameters and simulation parameters of the cavity; constructing a simulation model of the readout cavity with the interdigital capacitor structure based on the layout template and the simulation template, performing spectrum scanning analysis, and determining simulation frequency; in response to the situation that the difference value between the simulation frequency and the initial design frequency is larger than an iteration threshold value, the initial design frequency is adjusted with a preset frequency offset, and the layout template and the simulation template are updated; and performing iterative analysis based on the updated layout template and the simulation template, and outputting the current layout template in response to the condition that the difference value between the obtained simulation frequency and the initial design frequency is less than or equal to an iterative threshold value. According to the method, the simulation model can be quickly generated, and a more accurate read-out cavity layout can be obtained.

The invention discloses an automatic baseline correction method for infrared spectroscopy. The automatic baseline correction method comprises the following steps: A1, preparing a to-be-detected sample; B1, acquiring an infrared spectrum of the to-be-detected sample by using a spectrograph, and preprocessing the spectrum to obtain the original absorbance spectrum; C1, for spectral intensity Y=[y1, y2...yN] in the original absorbance spectrum at equal interval, performing average minimum updating on the original absorbance spectrum, and obtaining the spectral intensity Y1=[y1,...yi+1] of the absorbance spectrum after the first update; D1, calculating the sum of range differences, namely Sabs(1) =Sigma of an absolute value of (Y-Y1); E1, repeating the step C1 for performing iterative computations for n times, updating the Y1 to obtain Y2, deducing the rest to obtain the Y1, Y2...Yn, further performing iterative computations on the step D1 to obtain Sabs(n), then calculating until the deltaSabs(n-1)/Sabs(n) is less than or equal to an iterative threshold lambda, and stopping calculating to obtain a baseline Yn of the absorbance spectrum, wherein n is more than 2; and F1, subtracting the baseline from the original absorbance spectrum, thereby obtaining the corrected absorbance spectrum.

The invention discloses a data processing method based on an artificial intelligence technology. The method comprises the steps of obtaining a first formation data set corresponding to a to-be-analyzed game; generating a second formation data set through a genetic algorithm based on the first formation data set; if the number of iterations corresponding to the second formation data set reaches an iteration threshold, obtaining at least one of an object name occurrence frequency and a skill name occurrence frequency corresponding to each piece of second formation data according to the second formation data set; and according to at least one of the object name occurrence frequency and the skill name occurrence frequency corresponding to each piece of second formation data, generating a game analysis result corresponding to the to-be-analyzed game. The invention further discloses a related device, equipment and a storage medium. The method is suitable for analyzing the game with the formation combination so that reasonability of analyzing the game data is improved, and the difficulty of adjusting the game balance is reduced.

An image is segmented by subjecting the image to an iterative thresholding operation, and a hierarchical representation of clusters is obtained by analyzing the results of each of the iterative thresholding steps to find clusters of adjacent image elements. A type class is assigned to a leaf cluster of the hierarchical representation and the assigned class is propagated towards the top of the hierarchical representation. Then a mask is generated marking the locations of image elements contained in the top ancestral clusters of a specific type.

The invention relates to a bunching SAR compressed sensing imaging method based on an approximate observation matrix. The bunching SAR compressed sensing imaging method comprises the following steps:1, obtaining a matrix form of distance-direction scale transformation based on a polar coordinate format algorithm of scale transformation; 2, obtaining a matrix form of azimuth scale transformation based on the polar coordinate format algorithm of scale transformation; 3, deriving a matrix expression form of a polar coordinate format algorithm imaging process according to results of the step 1 and the step 2; 4, deriving a signal model of an inverse imaging process according to a signal model of a radar projection matrix obtained in the step 3; and 5, constructing a CS reconstruction model byusing a PFA imaging process and an inverse imaging process obtained in the above steps and an iterative threshold shrinkage algorithm based on the approximate observation matrix. According to the method, sparse constraint is carried out on the PFA imaging process, the application range of PFA imaging in the SAR field is wider, and compared with a traditional accurate measurement matrix, the calculation complexity and the storage memory are greatly reduced.

The invention relates to a continuous microfluid biochip advanced comprehensive design method based on a particle swarm algorithm. The continuous microfluid biochip advanced comprehensive design method comprises the following steps of S1, initializing a particle swarm according to a time sequence diagram and given assembly types and number; s2, using a list scheduling algorithm for each particle, and further obtaining a scheduling solution of each particle; s3, calculating a fitness function value of the particle according to the binding and scheduling solution; and S4, iteratively updating the particles according to the individual historical optimal solution and the global historical optimal solution, and obtaining an optimal binding and scheduling scheme if the current number of iterations reaches an iteration threshold. According to the invention, on the premise of not sacrificing the execution time of the biochemical reaction, a binding and scheduling scheme which needs a smaller number of flow channel intersection points can be obtained.

The invention discloses a docking recovery integrated navigation method based on an improved Gaussian distance iterative algorithm. The docking recovery integrated navigation method comprises the following steps: 1) segmenting a track of an AUV into a plurality of connected straight line segments; 2) calculating the coordinate of each position point by utilizing dead reckoning to obtain a coordinate equation set; 3) linearizing the error by using Taylor series expansion, setting a position initial value and an iteration threshold of the AUV, solving a correction amount of the AUV position by using a least square method, comparing the correction amount with the iteration threshold, and stopping iteration if the correction amount is less than the iteration threshold; 4) if the correction amount is greater than an iteration threshold, updating the step length by adopting a trust region method to continue iteration; 5) solving the coordinate of the last point of the straight line segment as the initial point of the next straight line segment, and repeating the above steps for iteration. The method can effectively correct the speed and position errors of the AUV, enables the whole system to have higher filtering precision and stability, and provides guarantee for the safe recovery of the AUV.

The invention provides a method for reducing the peak-to-average power ratio of a multi-carrier system of a filter bank. The method comprises the following steps: setting an initial amplitude limiting amplitude A (1), the maximum number of iterations Q, a peak regeneration suppression factor xi, a penalty factor eta and a search step length rho; shearing the original signal, wherein the processed signal can be expressed as Sn after being processed by the FBMC-OQAM system, the FBMC-OQAM signal iteration amplitude limiting recursion updating formula can be expressed as the conversion of the shearing noise into the frequency domain signal to solve the optimal convergence factor mu; solving the optimal value A (i) of the amplitude limiting threshold value; and letting i = i + 1, repeating the above steps, and entering the next round of loop iteration until the algorithm converges. According to the method, a system model of the reserved subcarriers of the FBMC-OQAM system is constructed, a self-adaptive subcarrier reservation algorithm is provided based on essential reasons of the FBMC-OQAM and in combination with signal structure characteristics of the FBMC-OQAM, the PAPR of the system is reduced with a small number of iterations by performing self-adaptive learning on input data and adjusting an iteration threshold value and an amplitude limiting factor, and signal distortion is not caused.

The invention discloses a compressed sensing magnetic resonance imaging method based on an iterative p-threshold projection algorithm, and belongs to the field of magnetic resonance imaging. The method comprises the following steps of: performing Fourier transform on a T2 weighted brain graph, transforming the T2 weighted brain graph subjected to Fourier transform into a K space to obtain K spacedata of the T2 weighted brain graph, and adopting the K space data of the T2 weighted brain graph according to a nonlinear sampling template to obtain T2 weighted brain graph under-sampling K space data; carrying out redundancy transformation on the T2 weighted brain graph undersampling k space data, and carrying out sparse representation on the T2 weighted brain graph undersampling k space data;and carrying out image reconstruction on the sparsely represented T2 weighted brain map undersampling k space data based on an iterative p-threshold projection algorithm or a fast iterative p-threshold projection algorithm, designing a new sparse target function by flexibly changing a p value, and achieving a better reconstruction effect .

The invention provides a configuration method of a distributed power supply. The configuration method comprises the following steps: calculating a target function value of a pre-established DG-containing power distribution network optimal configuration model; when the target function value reaches a constraint condition, outputting a corresponding configuration mode; when the target function valuedoes not reach the constraint condition, adopting a firefly algorithm to perform iterative operation, and when the number of iterations reaches a set threshold, adding adaptive genetic iterative operation, calculating an optimal solution Gbest, and performing constraint condition judgment on the obtained optimal solution Gbest; and when the adaptive genetic iterative operation exceeds an iterative threshold, adding improved Gaussian disturbance, calculating an optimal solution xbest, and performing constraint condition judgment on the obtained optimal solution xbest. Compared with an AGA algorithm, the convergence speed of the adopted algorithm is higher, the optimal convergence point can be quickly found, and the convergence precision is high.

A method for the development of a compilation process for a quantum circuit on a quantum processor, comprises:

• • an implementation step of the compilation method comprising:
  • an iteration loop successively comprising:
  • a step of simulation of a given implementation of the logical qubits on the physical qubits of the quantum processor,
  • a step of detecting, in the quantum circuit, ineffective quantum gate(s),
  • a step of estimating the number of quantum swap gates to be inserted into the quantum circuit so that all of the quantum gates of the quantum circuit are effective,
  • a retroaction step, by means of a simulated annealing, involving a new step of simulation, until attaining, whereupon all the quantum gates are effective:
  • either a minimum threshold of the number of estimated quantum value swap gates between two physical qubits,
  • or a maximum threshold of iterations in the loop.

The embodiment of the invention provides an account fund transfer network diagram coloring method and device, and the method comprises the steps: respectively setting the identification of each node in a target account fund transfer network diagram as a natural number starting from zero, and determining the connection component to which each node belongs; performing initialization coloring processing on the connected components and a first preset number of nodes by applying a self-defined color number; coloring the nodes which are not colored at present; selecting one of the adjacent nodes with the same coloring color to delete the color; returning to execute the process of coloring the currently uncolored nodes until the execution frequency of the process of coloring the currently uncolored nodes is equal to or greater than a preset iterative threshold, and outputting a node coloring graph corresponding to the target account fund transfer network graph and used for dividing account node communities. User-defined coloring control over the account fund transfer network diagram can be achieved, and errors can be controlled within a certain range.

The invention relates to a multi-iteration folding vocabulary hierarchical classification method and a multi-iteration folding vocabulary hierarchical classification system. The hierarchical classification method comprises the following steps: calculating the use frequency of each to-be-classified vocabulary; arranging the to-be-classified vocabularies in an ascending order according to the use frequency of the to-be-classified vocabularies, and marking serial numbers; according to the total number of the to-be-classified vocabularies and the field to which the to-be-classified vocabularies belong, determining a level number and an iteration threshold value; initializing a candidate boundary threshold value of each level, wherein the candidate boundary threshold value of each level is the total number of the to-be-classified vocabularies; performing iterative query on the to-be-classified vocabularies according to the candidate boundary threshold value of each level, the serial number of the to-be-classified vocabularies and an iterative threshold value to obtain a boundary threshold value of each level; and obtaining hierarchical classification of the vocabulary to be classified according to the boundary threshold value of each hierarchy. According to the method, the word frequency is taken as a reference, the occurrence frequency of large-class vocabularies is higher than the occurrence frequency of small-class vocabularies, and the vocabulary hierarchy is divided in a loop iteration folding mode, so that the division efficiency is improved, and the hierarchy division is accurate.

The invention provides a reflection tomography laser radar image segmentation method based on target area local enhancement. The method comprises the following steps: inputting an original image generated by a reflection tomography laser radar and obtained through filtering back projection reconstruction; removing ring artifacts in the original image through a two-dimensional low-pass filter; further performing mean filtering processing to filter noise points, and performing initial segmentation on the image after noise point filtering by using an iterative threshold method to obtain a segmented image; target region extraction is carried out on the segmented image according to the criterion that the area of the circumscribed convex polygon is minimum, and a closed target region of the circumscribed convex polygon is extracted; performing image filling on the extracted target region by adopting an image filling algorithm to obtain a target saliency map; fusing the target saliency map with the original image to obtain a fused image with an enhanced target area; and solving an optimal threshold value of the enhanced target area image by adopting an iterative threshold value method, and then segmenting the whole fused image by using the optimal threshold value.