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

117 results about "Pruning algorithm" patented technology

Pruning (algorithm) Pruning is a technique in machine learning that reduces the size of decision trees by removing sections of the tree that provide little power to classify instances. Pruning reduces the complexity of the final classifier, and hence improves predictive accuracy by the reduction of overfitting.

System and method for resource-efficient live media streaming to heterogeneous clients

A resource-efficient live streaming system includes a broadcaster and a streaming server. The broadcaster receives a live feed and broadcasts a media stream to the streaming server containing several descriptions of the live feed along with control information. The broadcaster includes a stream thinner that implements a pruning algorithm. If descriptions from different streams are similar enough, one or more of them may be discarded without penalizing the quality of service perceived by the receivers. The streaming server assembles compressed data units into streams according to the control information from the broadcaster. The streaming server may also gather client feedback in order to estimate the status of the transmission channels and forwards the information to the broadcaster. The streaming server builds and streams media information to clients according to user preferences and receiver capabilities.
Owner:IBM CORP

Interframe mode fast selecting method and system of video compressed coding

The invention discloses an interframe mode fast selecting method and system of video compressed coding. The interframe mode fast selecting method and system of video compressed coding comprises the steps of judging whether one current-depth CU of a current coding image needs to terminate a further division operation by adopting a sub-CU pruning algorithm in one CU layer based on spatial correlation of the rate-distortion cost of a current coding image and time correlation of depth information, if so, terminating the further division operation for the current-depth CU, otherwise, carrying on further division for the current-depth CU; and sieving a range of PU division in advance in a PU layer based on texture information of the current coding image, and then performing PU mode division based on the range of PU division sieved in advance. The interframe mode fast selecting method and system of video compressed coding has the advantages of low calculation complexity and fast speed, and can be widely applied to the field of video coding.
Owner:SUN YAT SEN UNIV

Foundation surveillance radar multi-target tracking method based on radial velocity information

The invention discloses a foundation surveillance radar multi-target tracking method based on radial velocity information. The foundation surveillance radar multi-target tracking method based on radial velocity information includes the following steps: S1, calculating the track fitting degree by means of radial velocity; S2, generating hypothesis by means of the radial velocity fitting degree andthe positional information; S3, modifying the track scores of the first k optimal hypothesis by means of the radial velocity fitting degree, and obtaining the hypothesis probability pj of each hypothesis in the first k optimal hypothesis; S4, establishing a hypothesis tree according to the first k optimal hypothesis, based on the principle of selecting the root node in which the hypothesis probability pj is, performing pruning on the hypothesis tree by means of an N pruning algorithm, and leaving the optimal hypothesis to be determined; and S5, according to a preset determination threshold T1and a preset delete threshold T2, comparing the track scores of the optimal hypothesis to be determined in the step S4 with the determination threshold T1 and the delete threshold T2, so as to determine the track or delete the track. The foundation surveillance radar multi-target tracking method based on radial velocity information can realize inhibition of false tracks and false alarm in a strongclutter and high false alarm environment, and can greatly improve the radar multi-target tracking effect.
Owner:长沙深之瞳信息科技有限公司

Mobile robot path planning method based on improved RRT algorithm

The invention provides a mobile robot path planning method based on an improved RRT algorithm in an indoor environment. A high-precision grid map of a robot working environment is established; map segmentation is carried out, and then a next grid needing to be searched is determined by adopting a neighborhood extension strategy; the type of a search grid and the number of effective sampling pointsare determined through a random sampling experiment, then the effective sampling points are added into a random tree according to a neighborhood optimal principle, state updating is conducted on thegrid based on a memory strategy, and finally smoothing processing is conducted on an obtained planning path through a pruning algorithm and a Bezier curve. Due to introduction of map segmentation andobstacle edge detection ideas, the sampling efficiency of an RRT algorithm in complex maps such as narrow channels is improved; due to introduction of a memory mechanism and a neighborhood extension strategy, the planning success rate of the algorithm in a complex environment is increased; a father node is selected according to the neighborhood optimal mode, and problems that the algorithm randomness is high, and the path is not optimal are solved.
Owner:SHENYANG LIGONG UNIV

Method suitable for compressing sequence images of unmanned aerial vehicle

The invention discloses a method suitable for compressing sequence images of an unmanned aerial vehicle. The method comprises the following steps: according to airborne auxiliary data, carrying out intelligent dynamic coding frame group division of the sequence images of the unmanned aerial vehicle; within a frame group, carrying out high-precision quick motion estimation of the first frame and the last frame to the current frame, thereby acquiring a number pair matching point; according to corresponding matching relation, obtaining projection transformation matrixes of the first frame and the last frame to the current frame so as to acquire a forecast image and residual error; combining residual error images of the first frame and the other frames of the same frame group into a singe image; and compressing the singe image by JPEG2000 to acquire a high-performance compression result by a global optimization pruning algorithm. The method takes into account the characteristics of the sequence images of the unmanned aerial vehicle and makes full use of the characteristics of airborne auxiliary information and the JPEG2000 compression algorithm; therefore, the method has the characteristics of low algorithm complexity, good compression performance, strictly controlled compression code rate, easily realized hardware, and the like.
Owner:HUAZHONG UNIV OF SCI & TECH

Coal ash fusion temperature forecasting method based on construction-pruning mixed optimizing RBF (Radial Basis Function) network

InactiveCN101968832ADynamically adjust the number of hidden nodesSmall structureSpecial data processing applicationsNeural learning methodsData centerCoal
The invention discloses a coal ash fusion temperature forecasting method based on a construction-pruning mixed optimizing RBF (Radial Basis Function) network, which is characterized by comprising the following two stages of crude regulation and fine regulation: the crude regulation stage comprises the steps of dynamically increasing the number of hidden nodes according to a principle of enabling an energy function to be minimum, selecting corresponding sample input as a data center and stopping till the number of the hidden nodes meets a stopping criterion; the fine regulation stage comprisesthe steps of further regulating the structure and the parameters of the RBF network, which are obtained through the crude regulation by using a Gaussian regularization method, establishing the corresponding construction-pruning mixed optimizing RBF network on the basis of the chemical constituents of coal ash, and forecasting coal ash fusion temperature through the construction-pruning mixed optimizing RBF network. A construction-pruning mixed optimizing algorithm (CPHM) effectively integrates the advantages of a construction algorithm and a pruning algorithm, can not only dynamically regulate the number of the hidden nodes of the RBF network, but also enable the data center of the RBF network to change in a self-adaption way; and in addition, the invention has the advantages of smaller structure, better generalization capability and higher robustness.
Owner:SOUTHEAST UNIV

Plant disease and insect pest identification method based on sparse network migration

The invention discloses a plant disease and insect pest identification method based on sparse network migration, and belongs to the technical field of intelligent agricultural disease and insect pestidentification. The method comprises the following steps: designing a pruning algorithm, iteratively traversing a network, freezing redundant parameters in a source domain network, and generating a retrained optimal sparse sub-network structure; employing deep migration learning, migrating the sparse network to a target domain, proposing a sparse network migration hypothesis, verifying the feasibility of the sparse network, exploring the potential association between a target task and existing knowledge, and initializing the network through the weight of a source domain, and achieving the knowledge migration and reuse on the target domain; finally, finely adjusting the sub-network by using a small number of samples of the target domain data, optimizing the network performance, and finishing the task migration, thereby solving the practical application problem. Plant diseases and insect pests can be recognized, the network detection precision is improved through sparse migration, and meanwhile, the problems that a traditional deep method needs to train a dense network, calculation expenditure is large, the requirement for hardware is high, and popularization is not facilitated are solved.
Owner:DALIAN UNIV OF TECH

Sparse and non-sparse data management method and system

A method and system for tracking data packets that utilizes a tree data structure with a recursive pruning algorithm that collapses the branches of the tree that represent contiguous ranges or regions to maintain a minimally optimum memory size. Each contiguous region is identified by a node, which includes the start and end range of packets. Each node further includes left and right pointer elements, which point to adjacent lower and higher nodes, respectively. When a packet sequence number is not contiguous with any other sequence numbers previously received, a new node is created that contains only a single value range. When a new packet is received that has a contiguous sequence number (i.e., immediately preceding or succeeding sequence number), the original node is updated so as to reflect the new contiguous range. Additionally, if this new contiguous range is contiguous with another node's range, the two nodes are “collapsed” into a new single node containing the new expanded contiguous range. Furthermore, the algorithm can quickly and efficiently determine whether there are any missing packets by simply determining if there is only a single node remaining after a designated “last packet” has been received.
Owner:AVAGO TECH INT SALES PTE LTD

3780 point discrete fourier transform processor

The invention discloses a novel 3780 points DFT processor, which relates to a digital television terrestrial broadcasting system. The processor has one of the following two structures, of which the first structure comprises 140 27 points DFT processors, a complex multiplier, a subscript mapping processor and 27 140 points DFT processors in turn; the second structure comprises the 27 140 points DFT processors, the complex multiplier, the subscript mapping processor and the 140 27 points DFT processors. As for input information including channel impulse response (CIR) vector, the 3780 points DFT processor with the first structure also comprises pruning algorithm to remove the redundant operation in the processor related to zero element in CIR vector. Compared with the prior art, the 3780 points DFT processor provided by the invention effectively reduces the multiplication operation quantity and system power dissipation. Moreover, the invention further reduces the multiplication and addition operation quantity of the processor by pruning algorithm according to the natural characteristics of the CIR vector.
Owner:维布络网络私人有限公司
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