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

195results about How to "Fewer searches" patented technology

Method for quickly restoring power supply of power distribution network containing distributed power source

The invention relates to a method for restoring power supply of a power distribution network containing a distributed power source. The method is based on heuristic rules, performs dynamic island partition on the distributed power source, utilizes a connection switch to guarantee a power supply restoration scheme of the power distribution network to be adaptive to output changes of the distributed power source and continuous power supply of important users, and enables the intelligent power distribution network to operate safely, reliably and economically. Power supply restoration of the power distribution network comprises the steps that the power failure range of the power distribution network is determined by fault location information and an operating state of the power distribution network before the fault happens; and the distributed power source in the fault area is matched with the connection switch connected with the fault area, corresponding section switches are actuated, and radial operation of the power distribution network except for the distributed power source is ensured. The distributed power source is fully utilized to improve reliability of the power supply of the power distribution network, searching space is greatly reduced, and optimum strategy searching time is shortened. Therefore, the method is suitable for power supply restoration real-time operation of the power distribution network containing the distributed power source.
Owner:HOHAI UNIV +4

RFID (Radio Frequency Identification Device) mutual authentication method based on secret key and cache mechanism

ActiveCN102394753AWith anti-eavesdropping performancePrevent location tracking issuesUser identity/authority verificationCo-operative working arrangementsComputer hardwareLimited resources
The invention provides an RFID (Radio Frequency Identification Device) mutual authentication method based on a secret key and a cache mechanism, which mainly solves the problems in the prior art that illegal reading, position tracking, eavesdropping, camouflage cajoling and unsafe resetting can not be resisted simultaneously. The achieving steps are as follows: a reader-writer and a tag adopt typical inquire response mechanism, the tag generates two authentication information values, namely beta is equal to hash (rl and Pr0), and sends the authentication information values to the reader-writer, the reader-writer compares received information value with self-computed information value, if the comparison results are same, returning authentication information hash (k' Pr0 and Prl') is sent to the tag through authentication. If the comparison results are different, the information is sent to back-end data base, authentication judgment is conducted by the back-end data base, the returning authentication information hash (k'' Pr0 and Prl'') is sent to the tag, after the tag receives the returning authentication information, authentication is carried out on the reader-writer by comparing the tag with self-computed value hash (k Pr0 and Prl), if the tag and the self-computed value hash (k Pr0 Prl) are same, the authentication is passed. The RFID (Radio Frequency Identification Device) mutual authentication method has the advantages of high safety performance and high execution efficiency, and can be applied to the RFID application context with limited resources and high safety requirements.
Owner:北京中科蓝信科技有限公司

Mobile robot planning method based on visibility graph guidance

The invention relates to the technical field of robots, and more particularly relates to a mobile robot planning method based on visibility graph guidance. A planning guidance area is established by using a visibility graph method to limit the expansion of a rapid random expansion tree (RTT), a generation shape of a random tree is constrained by establishing a vehicle kinematic model, meanwhile the generation of the random tree is accelerated by using a 8 nearest neighbor node search method, after the random tree is obtained, a path conforming to a mobile robot motion law is obtained by calculation, and finally, the path is optimized to improve the quality of the path. In the traditional fast random expansion tree planning algorithm, the planned path cannot meet the kinematic constraints of a wheeled robot, and meanwhile, as the structure of the random tree becomes larger, the generation efficiency of the random tree is low. Therefore, kinematic modeling is performed on an unmanned vehicle, and then the random tree conforming to the kinematic model of the unmanned vehicle is obtained within a short time in combination with the 8 nearest neighbor node search method, and an optimal path from a starting point to an end point is obtained through path optimization.
Owner:SUN YAT SEN UNIV

PCNN automatic segmentation method for microscopic image of traditional Chinese medicine

InactiveCN106023224AHigh speedAccurate Contour RecognitionImage enhancementImage analysisMicroscopic imageColor image
The invention discloses a PCNN automatic segmentation method for a microscopic image of a traditional Chinese medicine. The PCNN automatic segmentation method comprises the steps of respectively establishing a CNN automatic binary image dividing algorithm which utilizes cross entropy segmentation criteria; establishing a traditional Chinese medicine microscopic image PCNN multi-value image automatic segmentation algorithm which utilizes maximizing mutual information as a segmentation object and utilizes mutual information entropy difference as a classification criteria, designing a vector pulse coupling neural network model, and realizing automatic segmentation on the microscopic color image of the traditional Chinese medicine through utilizing an index entropy criterion as a segmentation criteria; and establishing a traditional Chinese medicine microscopic image dividing algorithm in a multichannel or three-dimensional PCNN through utilizing a fuzzy index entropy as an optimized segmentation criterion. The PCNN automatic segmentation method has advantages of further improving objectivity, accuracy, repeatability and intelligent degree in quality evaluation of the traditional Chinese medicine, and providing a new approach for modernization of testing and analysis of the traditional Chinese medicine.
Owner:TIANSHUI NORMAL UNIV

Quick calculation method of satellite access forecast

The invention discloses a quick calculation method of a satellite access forecast. The quick calculation method comprises the following steps: (1) applying a Lagrange polynomial interpolation method, adopting Chebyshev nodes, i.e. adopting the points of unequal spaces to carry out interpolation on an orbit forecast result of the satellite in one day, and calculating the satellite orbit through the satellite according to the Lagrange polynomial; and (2) adopting a method that the point of intersection of a curve descending branch of an angle of pitch and a coordinate axis is firstly found and a time window is then judged, searching the point of intersection of the curve descending branch of the angle of pitch and the coordinate axis through a large step size, and adopting a variable step size to search and calculate a visible time window. The method aims at an autonomous mission planning platform carried by a satellite in the future and is suitable for a satellite platform with low dominant frequency and small memory. A Lagrange difference value way is adopted to realize on-board quick orbit calculation, a quick calculation method, combining variable-step size searching and linear fitting, for the visible time window of the satellite to the target is designed, and an efficient quick calculation method of the satellite access forecast is provided.
Owner:NAT UNIV OF DEFENSE TECH

PTS double-layer searching algorithm for reducing FBMC-OQAM peak-to-average power ratio (PAPR)

The invention relates to wireless communication systems, and provides an algorithm for reducing the peak-to-average power ratio (PAPR) of an FBMC-OQAM system. The algorithm is characterized in that classified subsequences are re-grouped on the basis of subsequence classification of the traditional PTS, so that a double-layer subsequence classification structure is formed, and layered searching is carried out for rapid searching. Firstly, each data block in the FBMC-OQAM system is divided into V subsequences according to the same method adopted by the PTS, the V subsequences are grouped into D groups, and each group comprises V/D subsequences; secondly, the layered searching is carried out according to different layers, a bottom algorithm aims to reduce the PAPR of the current data block, and a top algorithm aims to handle mutual effects between the adjacent data blocks, so that the overall signal PAPR of the FBMC-OQAM system is reduced. The algorithm provided by the invention has the advantages that due to the adoption of the layered searching method, the searching sequence length in each layer is relatively small, so that searching times are reduced to a certain extent, and signal distortion is avoided.
Owner:CHONGQING UNIV OF POSTS & TELECOMM

Video foreground object coding method by taking boundary detection as motion estimation reference

The invention discloses a video foreground object coding method by taking boundary detection as motion estimation reference, and belongs to the technical field of video coding technology. The method comprises the following steps of: (1) dividing continuously acquired video into a reference frame and a predictive frame, and dividing the reference frame and the predictive frame into a plurality of macroblocks in fixed size; (2) respectively performing foreground extraction on the reference frame and the predictive frame; (3) for the reference frame, adopting a static image compression algorithmand coding outline information of the video; and (4) for the predictive frame, determining a search starting point through boundary detection, pre-searching from the search starting point and stopping searching in dual time to obtain a motion vector of a corresponding macroblock, and coding the outline information, the motion vector and the residual error of the video. On the basis of performing foreground extraction on each image frame of the video, the video compression is carried out in real time, the coding contents required by the image frames can be effectively reduced, the coding speedis improved, the compression ratio is improved, the search frequency is reduced, and the coding efficiency is effectively improved.
Owner:BEIHANG UNIV

Millimeter-wave system channel estimation method low in complexity

The invention discloses a millimeter-wave system channel estimation method low in complexity. The method includes the following steps: firstly, a receiving end uses a first-order codebook to estimatea pair of azimuths AOA and AOD, and then establishes a set on the basis of the defined quantization precision estimated the second time and the number of quantization angles estimated the second time;secondly, the receiving end uses the set obtained in the first step and also a second-order codebook to conduct azimuth estimation at the second-order precision; and thirdly, the receiving end utilizes a least square method to estimate fading of channels corresponding to the azimuths, and determines whether channel estimation is carried out according to a result. Through utilization of sparsity of a millimeter-wave system channel and redundancy of a sparse dictionary in a compression sensing technology, a channel estimation process is quantified through angles to be decomposed into two-complexity channel estimation processes. According to the method, the number of searching of the sparse dictionary is reduced, the millimeter-wave system channel estimation efficiency is increased, and thechannel estimation complexity of channel estimation is reduced effectively while the estimation precision is guaranteed.
Owner:NANJING UNIV OF POSTS & TELECOMM

In-machine roundness detection method

The invention relates to the field of machining and detection, in particular to an in-machine roundness detection method. The in-machine roundness detection method involves a base, a first rotating shaft, a second rotating shaft, a circular hoop, a clamping buckle, a first half ring and a second half ring, wherein the first half ring is arranged on the circular hoop through the first rotating shaft; the second half ring is connected with the first half ring through the clamping buckle; the circular hoop is arranged on the base through the second rotating shaft; supporting legs are arranged on the lower end surfaces of the circular hoop and the first half ring. According to the in-machine roundness detection method, a three-dimensional measurement point, acquired by a three-coordinate measurer, on a cylinder is projected to a plane, and a circle center of a circle with the minimum area is searched by an iteration method, so that the calculated amount of searching is greatly simplified; an initial value of the circle center is determined by the least square method according to the projected measurement point, so that the search process under a determined attitude is quicker; by the selection of a center moving direction and a center moving step length, the number of searching times is reduced, and the searching precision is improved.
Owner:BEIJING INSTITUTE OF TECHNOLOGYGY

QR decomposition detection method

The invention belongs to the technical field of mobile communication, and particularly relates to a QR decomposition detection method under a novel system combined with spatial modulation and quasi-orthogonal space time block codes. The QR decomposition detection method comprises the steps that first, antenna combined modes are selected and traversed, and an equivalent channel submatrix corresponding to an activated antenna combined index is obtained; QR decomposition is conducted on the equivalent channel sub matrix, so that an upper triangular matrix R is obtained; afterwards, the last sign is demodulated, judgment is made by using a maximum-likelihood criterion, and when other signs are detected, interference of the detected signs is sequentially subtracted. Due to the fact that each antenna combined mode corresponds to a set of solution vectors, the Euclidean distance between received signals is calculated respectively, the solution vector corresponding to the minimum value serves as an optimal detection sending signal, the corresponding sending combination is an activated sending antenna combination. Through QR decomposition, the searching frequency can be reduced, the detection complexity of a receiver is lowered, and excellent detection performance can be achieved under the low complexity condition.
Owner:UNIV OF ELECTRONICS SCI & TECH OF CHINA

Hybrid field signal source positioning method based on symmetrical nested array

The invention provides a hybrid field signal source positioning method based on a symmetrical nested array. The hybrid field signal source positioning method comprises the following steps that an antenna array is set, wherein the antenna array is the symmetrical nested array; a far-field signal DOA is estimated to obtain an estimation value of the far-field signal DOA; the near field component isseparated from the far field component; a fourth-order cumulant virtual difference array of a near-field signal is calculated; an estimation value of the near-field signal DOA is obtained by using spectral peak search; and according to the near-field signal DOA estimation value, the near-field signal distance is estimated to obtain a near-field signal distance estimation value. The hybrid field signal source positioning method uses mixed-order statistics, and compared with a second-order statistic algorithm, the hybrid field signal source positioning method solves the problems of Gaussian noise interference and reduction of degree of freedom by half; the symmetric nested array and the fourth-order cumulant virtual differential array are used for improving the estimation accuracy of far-field DOA, near-field DOA and a near-field distance; oblique projection technology is utilized to separate the far-field and near-field components, and thus, it is not necessary to distinguish the far-field signal from the near-field signal according to distance parameters; and therefore, the number of search is reduced, and the computational complexity of the algorithm is further reduced.
Owner:UNIV OF ELECTRONICS SCI & TECH OF CHINA

IRA (Irregular Repeat-Accumulate) codes open set blind recognition method

The invention discloses an IRA (Irregular Repeat-Accumulate) codes open set blind recognition method, which realizes the recognition of the code length, the codeword starting point and the code rate, the sparse reconstruction of a check matrix and restoration of an interleaving permutation relation in the absence of any prior knowledge, and aims to solve the problems that the prior art cannot accurately recognize the IRA codes with arbitrary code length and bit rate under a bit error condition, and the recognition speed is slow. The method comprises the following steps: firstly, constructing an analysis matrix according to the estimated code length and the codeword starting point, and solving a dual vector by using a Gauss column elimination method and a statistical decision criterion and other methods to realize the recognition of the code length; secondly, using the dual vector to eliminate the bit errors, iterating the above operations and obtaining multiple groups of dual vectors and further analyzing the codeword starting point; thirdly, realizing the sparse reconstruction of the check matrix of the IRA codes by an obtained effective check vector; and finally, according to the coding structure features of the IRA codes, analyzing the interleaving permutation relation, and finishing the overall recognition of the IRA codes. Through theoretical analysis and simulation verification, the IRA codes open set blind recognition method provided by the invention has lower computation complexity and excellent fault-tolerance performance.
Owner:XIDIAN UNIV

Self-adaptive fast-matching binocular ranging method

ActiveCN109631829AQuick matchFilter out the effect of feature discriminationOptical rangefindersParallaxComputer graphics (images)
The invention discloses a self-adaptive fast-matching binocular ranging method. The method comprises the following steps that firstly, a binocular camera is used for acquiring a binocular image of a target to be detected; secondly, a template image and a search image are captured from the binocular image in a self-adaptive mode; then the template image is quickly matched in the search image by a layered screening strategy to obtain the pixel-level matching coordinates; and then the pixel points in the region surrounding the pixel-level matching coordinate are used as fitting points, secondarycurved surface fitting is carried out on the fitting points, the maximum value of the curve fitting function is worked out so as to obtain sub-pixel-level matching coordinates corresponding to the pixel-level matching coordinates; and finally a parallax is obtained according to the sub-pixel level matching coordinates and the template image coordinates, then the distance of the target to be measured is worked out according to a triangulation method, and ranging is completed. According to the method, the template image is extracted in a self-adaptive mode, the search image boundary is limited and search range range is optimized, the layered screening strategy is adopted for improving the searching efficiency and the like, so that the image matching precision is improved, and then the ranging precision is improved.
Owner:NANJING UNIV OF SCI & TECH
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