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

30 results about "Coordinate descent method" patented technology

UAV-assisted WSN, as well as method for designing node scheduling, route planning and power distribution of same

The invention discloses a UAV (Unmanned Aerial Vehicle)-assisted WSN (Wireless Sensor Network), as well as a method for designing node scheduling, route planning and power distribution of the same, and belongs to the technical field of wireless communication and IOT (Internet Of Things). The UAV-assisted WSN consists of a UAV aerial base station and K single-antenna ground terminal nodes. The method of the invention is characterized by aiming at minimizing system power consumption, considering constraint conditions such as a data transmission rate of the terminal node, a flight speed of the UAV and a transmitting power of the UAV, building a mathematical optimization model by taking a scheduling variable of the terminal node, a flying route of the UAV and a transmitting power variable of the UAV as parameters, respectively converting two sub-problems decomposed from a non-convex optimization problem of mixed integer variables into upper bound convex problems corresponding to the two sub-problems, alternately iterating sub-optimization problems through a block coordinate descent method and an interior point method, and obtaining a suboptimal parameter solution for scheduling of theterminal node, the flying route and the power distribution of the UAV.
Owner:ZHENGZHOU UNIVERSITY OF AERONAUTICS

Turbulence-degraded image blind restoration method based on dark channel and Alternating Direction Method of Multipliers

ActiveCN106920220ASolve the problem of easy to obtain fuzzy solutionSuppress artifactsImage enhancementRestoration methodMaximum a posteriori estimation
The invention relates to a turbulence-degraded image blind restoration method based on dark channel and Alternating Direction Method of Multipliers. The method includes the following steps: firstly on the basis of the multiple dimension theory, in each dimension, applying dark channel prior constraint on an image, applying sparse constraint and energy constrain on a point spread function, then using the coordinate descent method and conducting alternating iteration to estimate a fuzzy kernel and the image in current dimension, if the dimensions arrive at the maximum thereof, a final estimated fuzzy kernel is obtained, finally, in combination with a total variation model, using a derivative Alternating Direction Method of Multipliers to make details of the image restored quickly. According to the invention, the method, by using the dark channel prior information of a clear image as a constraint item, can help a cost function to converge to a clear solution in the iteration process, addresses the susceptibility of obtaining a fuzzy solution by using tapered prior information under the Maximum posterior probability in current blind restoration algorithm, such that the method herein can restore more image details, has less ring effect, and effectively increases restoring quality.
Owner:NORTHWESTERN POLYTECHNICAL UNIV

Structure sparsification maintenance based semi-supervised dictionary learning method

The invention discloses a structure sparsification maintenance based semi-supervised dictionary learning method. The method mainly comprises the following steps of firstly establishing a new semi-supervised dictionary learning model through a self-representation relationship between structure sparsification maintenance codes; secondly performing iterative optimization on various variables in the proposed semi-supervised dictionary learning model by adopting a block-coordinate descent method and proving convergence of an algorithm theoretically; and finally proposing a method for constructing class-related sub-dictionaries, and classifying samples through reconstruction errors of the samples in the various sub-dictionaries. According to the method, structure sparsification constraints are introduced, so that a large amount of unlabelled samples can be automatically added into a class in which the unlabelled samples are arranged; and the unlabelled samples and labeled samples in the same class together participate in dictionary learning, so that the sparse representation ability and judgment ability of a dictionary are improved. An experimental result shows that compared with other classic dictionary learning methods, the semi-supervised dictionary learning method has higher classification accuracy, thereby having a very good application prospect.
Owner:温州大学苍南研究院

Semi-supervised classification method capable of simultaneously learning affinity matrix and Laplacian regularized least square

The invention discloses a semi-supervised classification method capable of simultaneously learning an affinity matrix and a Laplacian regularized least square, which mainly comprises the following steps: firstly, a joint model capable of simultaneously learning the affinity matrix and the Laplacian regularized least square is established according to a training sample; secondly, the block coordinate descent method is used to optimize all kinds of variables in the model; and finally, the soft label of the sample is obtained by a Laplacian regularized least square classifier, and the dimension with the largest element in a label vector is selected as the category of the sample. The invention effectively fuses the sparse self-representation problem of samples and the Laplacian regularized least square classifier, and realizes the simultaneous optimization and mutual improvement of the sample affinity matrix and the Laplacian regularized least square classifier in the learning process. Theinvention has an explicit classifier function, so that the problem of an external sample can be effectively handled. Compared with other semi-supervised classification methods, the method has more accurate classification accuracy and good application prospects.
Owner:温州大学苍南研究院

Fluorescence-molecular-tomography rebuilding method based on random-variable alternating direction multiplier method

The invention discloses a fluorescence-molecular-tomography rebuilding method based on a random-variable alternating direction multiplier method. The mode of the alternating direction multiplier method is converted into a random parameter mode with the randomness and the decomposability of the random dual coordinate descent method, and then solving is carried out through parameter alternating updating of the random-parameter alternating direction multiplier method; the fluorescence-molecular-tomography rebuilding method includes the following achieving steps that (1) large-scale fluorescence data is collected; (2) the linear relationship between measurement data and target distribution is built; (3) the linear relationship is converted into the convex optimization problem; (4) the convex optimization problem is solved in an alternated mode with the random-parameter dual coordinate descent method and the random-parameter alternating direction multiplier method, and a target distribution diagram and rebuilding time are obtained. The rebuilding efficiency of fluorescence molecular tomography is effectively improved while the quality of rebuilt images is guaranteed, and the fluorescence-molecular-tomography rebuilding method has the important application value in the field of medical molecular images, the field of rebuilding methods and the like.
Owner:NORTHWEST UNIV(CN)

Hybrid precoding method based on analog phase shift-switch cascade network

The invention relates to a hybrid precoding method based on an analog phase shift-switch cascade network, and the method comprises the following steps: giving an analog network structure in which a switch and a phase shifter are cascaded, and building a millimeter wave large-scale MIMO system hybrid precoding mathematical model based on the structure; solving an all-digital optimal precoding matrix through channel matrix singular value decomposition, and then randomly generating an analog phase shift precoding matrix; utilizing a block coordinate descent method to jointly optimize the analog switch precoding matrix and the digital precoding matrix; utilizing phase rotation to optimize an analog phase shift precoding matrix; and utilizing the analog phase shift precoding matrix, the analogswitch precoding matrix and the digital precoding matrix to complete hybrid precoding. Compared with the prior art, the analog phase shift-switch cascade network provided by the invention only needs phase shifters with the number equal to that of antenna array elements, and has the advantages of relatively low hardware cost, relatively low power consumption and the like; furthermore, a simulationexperiment result shows that the hybrid precoding method based on the analog phase shift-switch cascade network has relatively high spectral efficiency and energy efficiency.
Owner:东北大学秦皇岛分校

Sparse subspace clustering method based on selective coordinate descent optimization

The invention discloses a sparse subspace clustering method based on selective coordinate descent optimization. The method comprises the following steps: 1, establishing a sparse subspace clustering model, substituting the sparse subspace clustering model into the Lasso formula, converting the sparse subspace clustering model into a quadratic programming problem, and solving a similarity matrix; 2, starting to solve the similarity matrix, traversing all features in the first time iteration by using a coordinate descent method, and using a calculated solution as an initial value; 3, starting from the second time iteration, traversing each feature, if the current solution item is non-zero, updating the feature of the coordinate position by using the coordinate descent method; otherwise, skipping the update of the feature of the coordinate position; repeating the process until the convergence of an objective function; and 4, after the similarity matrix is obtained, performing a spectral clustering process to obtain a classification serial number. According to the sparse subspace clustering method disclosed by the invention, whether the current solution item is zero or non-zero is quickly judged by using an infinite norm rule, thereby avoiding an unnecessary calculation process of a zero item result and shortening the time of optimization solution; and the effect on large-scale sparse problems is extremely obvious.
Owner:NANJING UNIV OF INFORMATION SCI & TECH

Mining and visualization method for supply and distribution energy consumption data in big-data environment

Along with the quick development of computer software and hardware technology and the wide application of the Internet, the information technology generates a large amount of data information in all fields, such as life, production, scientific research, army, and power supply and distribution. The mining and visualization of supply and distribution energy consumption data becomes a challenge under the condition of complex and redundant big data. The invention proposes a mining and visualization method for supply and distribution energy consumption data in a big-data environment, and relates to a sparse cording algorithm based on deep learning. The method comprises the steps: on the one hand, employing a dictionary learning method of a coordinate descent method to adjust the dictionary parameters in sparse coding; on the other hand, learning main correlation characteristics of supply and distribution energy consumption data through a conjugate gradient descent method, thereby achieving the dimensionality reduction and linearization of redundant data, and achieving data mining. The method employs a Weka data-mining working platform, is combined with an interface file of Weka software, integrates the above methods in Weka, and achieves the data mining and the visualization on a new interactive interface.
Owner:CHONGQING UNIV

Automatic image annotation method based on cross-media sparse theme code

The invention relates to an automatic image annotation method based on a cross-media sparse theme code. The method comprises the steps that firstly an image word is generated by an image in a multi-media document, a word bag model is used for representing an annotation word in the multi-media document as a vector, and the processed multi-media document is obtained; according to the processed multi-media document and a probability theme model, an image cross-media sparse theme code model is obtained; by using a maximum posterior probability estimation method, the image word and the annotation word in the multi-media document and a joint distribution formula of a relation code variate of the image word and the annotation word are obtained, and an image word code, a multi-media document codeand a relation code in the joint distribution formula are modeled by adopting Laplace transcendence and super-Gaussian; a coordinate descent method is used for optimally figuring out a cross-media sparse theme code model, and then the cosine similarity degree between an image code and an annotation word code is calculated and subjected to image annotation. According to the automatic image annotation method based on cross-media sparse theme coding, the complexity of annotation time and space is lowered, the accuracy rate of image annotation is guaranteed, and meanwhile the efficiency is guaranteed.
Owner:XI AN JIAOTONG UNIV

Blind Restoration Method of Turbulent Flow Image Based on Dark Channel Color and Alternating Direction Multiplier Method Optimization

ActiveCN106920220BSolve the problem of easy to obtain fuzzy solutionSuppress artifactsImage enhancementRestoration methodMaximum a posteriori estimation
The invention relates to a turbulence-degraded image blind restoration method based on dark channel and Alternating Direction Method of Multipliers. The method includes the following steps: firstly on the basis of the multiple dimension theory, in each dimension, applying dark channel prior constraint on an image, applying sparse constraint and energy constrain on a point spread function, then using the coordinate descent method and conducting alternating iteration to estimate a fuzzy kernel and the image in current dimension, if the dimensions arrive at the maximum thereof, a final estimated fuzzy kernel is obtained, finally, in combination with a total variation model, using a derivative Alternating Direction Method of Multipliers to make details of the image restored quickly. According to the invention, the method, by using the dark channel prior information of a clear image as a constraint item, can help a cost function to converge to a clear solution in the iteration process, addresses the susceptibility of obtaining a fuzzy solution by using tapered prior information under the Maximum posterior probability in current blind restoration algorithm, such that the method herein can restore more image details, has less ring effect, and effectively increases restoring quality.
Owner:NORTHWESTERN POLYTECHNICAL UNIV

Fund location estimation algorithm based on industry index regression

The fund bin is the proportion of funds invested into stock markets to assets that can be used by the funds, and is a reaction of market information. At present, warehouse location information of domestic funds is disclosed by taking seasons as units according to a security guard, and the wind direction of the market cannot be reflected in time. The method is mainly used for everyday estimation ofthe fund storage location. The method comprises the following steps: firstly, dividing stocks into 28 categories according to Shen000 first-level industry classification, and obtaining 28 industry index daily return rates and the daily return rate of a to-be-estimated fund; Establishing a regression equation by taking the industry index daily return rate as an independent variable and taking thedaily return rate of the fund as a dependent variable; Then, based on a lasso regression model, solving a regression coefficient through a coordinate descent method and a minimum regression loss function, wherein the sum of the regression coefficient is the proportion of the stock assets held by the fund to the fund assets, namely the fund location; And finally, comparing the actual bin position and the predicted bin position published in each season, calculating an average error after the maximum error and the minimum error are removed, carrying out model trimming, and improving the accuracyof the model. And a certain investment reference value can be provided for investors according to a result of the fund bin location prediction model.
Owner:厦门多快好省网络科技有限公司

Phase coding sequence parallel accelerated descent optimization design method

PendingCN113534087ASolve the problem of initial value sensitivityRadio wave reradiation/reflectionCoordinate descent methodTheoretical computer science
The invention designs a phase coding sequence parallel accelerated descent optimization design method. For a non-convex optimization problem, a coordinate descent method is sensitive to an initial value and cannot guarantee that a satisfactory optimal solution is finally obtained. Aiming at the problems of the two optimization methods, the invention provides a phase coding sequence parallel accelerated descent optimization design method. The method comprises the following specific steps of generating a new solution by adopting a simulated annealing algorithm according to a set initial coding parameter, and performing variable updating by taking the new solution as an initial parameter of a coordinate descent method; and judging whether the target function increment corresponding to the updated solution meets an acceptance condition or not, and when the new solution meets a convergence condition, ending calculation. According to the method, the simulated annealing algorithm and the coordinate descent method are combined, the simulated annealing solution serves as input of coordinate descent, descent of the target function is accelerated, and the problem that the coordinate descent method is sensitive to initial variables is solved.
Owner:中国船舶集团有限公司第七二四研究所

Simulated Annealing Rayleigh Wave Inversion Method Based on Differential Evolution and Block Coordinate Descent

The invention discloses an improved simulated annealing Rayleigh wave inversion method based on differential evolution and block coordinate descent. The method firstly constructs the inversion objective function, and then uses the differential evolution algorithm to optimize the parameter model of the inversion objective function to obtain After the optimal individual, the block coordinate descent algorithm is used to perform simulated annealing on each individual, and the obtained new individual is used as the individual of the next generation population. The present invention constructs the inversion objective function, uses the differential evolution algorithm to optimize the inversion objective function, and uses the block coordinate descent method to divide the multi-parameter problem into multiple single-parameter local iterative optimization problems, which can effectively improve the performance of simulated annealing inversion. Accuracy, to achieve the controllability of simulated annealing to the accuracy, thereby improving the stability of simulated annealing, and can be applied to the inversion of actual shallow exploration seismic data to improve the prediction accuracy of near-surface subsurface structures.
Owner:UNIV OF ELECTRONICS SCI & TECH OF CHINA

FBMC signal PAPR reduction method based on punishment concave-convex process

ActiveCN110210094AAvoid Bit Error Rate Performance IncreaseFBMC decreasedDesign optimisation/simulationSpecial data processing applicationsCoordinate descent methodCarrier signal
The invention provides an FBMC signal PAPR reduction method based on a punishment concave-convex process. The method comprises the following steps: firstly, constructing an optimization problem according to parameters of an FBMC system, namely minimizing a PAPR of a frame of FBMC signal by taking a sending symbol as a variable and taking symbol deformation on a data subcarrier and sending power ona free subcarrier as constraints; secondly, performing equivalent conversion on the optimization problem to obtain an equivalent problem meeting a penalty concave-convex process algorithm framework;secondly, solving an optimization problem according to a two-layer iteration algorithm based on a punishment concave-convex process, updating punishment parameters through outer-layer iteration, fixing the punishment parameters through inner-layer iteration, and solving the punishment problem according to the concave-convex process and a block coordinate descent method; and finally, outputting a calculation result to obtain an FBMC sending signal with a lower PAPR. The PAPR of the FBMC signal is optimized and reduced by utilizing the punishment concave-convex process, and compared with a traditional heuristic iterative algorithm, the method can remarkably reduce the PAPR of the FBMC signal under the condition that the bit error rate is slightly increased.
Owner:ZHEJIANG UNIV
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