31 results about "Quadratic error" patented technology

By a motion vector correction circuit 313, a motion vector minimizing the sum of a value of the quadratic error function having a motion vector as a variable and the motion vector changing amount in neighboring blocks is determined, and it is linearly interpolated by a motion vector interpolation circuit 314 to obtain a motion vector in a pixel unit, and a motion compensated picture is generated, and a differential picture of the current frame and this motion compensated picture is divided into sub-bands by a video transform circuit 304, and only the information in the region of the large differential signal energy is coded.

A CDMA receiver with parallel interference suppression and with weighting. The weighting coefficients of the outputs from the various stages of the receiver are chosen in order to minimize a quadratic error weighted by the distribution of the pertinent values of the intercorrelation matrix.

An improved QEM three-dimensional model simplifying method belongs to the field of image processing technology. The invention aims to provide the improved QEM three-dimensional model simplifying method which effectively keeps model details and realizes details that are more similar with those of an original model through improving a QEM three-dimensional model. The improved QEM three-dimensional model simplifying method comprises the steps of acquiring a dihedral angle, acquiring a Gauss curvature and an average curvature, acquiring a discrete curvature, acquiring an improved error measuring matrix; and integrating area summation of triangles at vertexes, vertex curvatures and a secondary error matrix, thereby forming error control factors in grid simplification. According to the improved QEM three-dimensional model simplifying method, through differential approximation of countless planar triangles to a smooth grid surface, the bending degree at each vertex can be described by means of surface curvature of differential geometry. For keeping the sharp characteristic in the grid before and after simplification, grid simplification quality can be controlled through measurement to the vertex curvature change.

The invention discloses a robot calibrate error compensation method based on a fuzzy nerve network; the method comprises the following steps: compiling a homogeneous transformation matrix between adjacent link rods; calculating a kinetics equation and an error equation general formula of a robot end performer according to the transformation matrix; generating a kinetics equation and an error equation of an angle [theta i] according to a geometry parameter nominal value, the kinetics equation and the error equation general formula; compensating a first error compensation for the robot according to the kinetics equation and error equation; applying a fuzzy nerve network model to carry out a second error compensation for the robot; the method can enable the robot error compensation model to be faster, and more accurate with strong robustness.

The invention discloses an overlapped sub-aperture algorithm applicable to a missile-borne high forward-squint time-varying parameter SAR (Synthetic Aperture Radar). The algorithm mainly comprises thefollowing seven steps: 1, performing two-dimensional dechirping; 2, performing residual video phase correction; 3, performing wave number domain data format correction; 4, performing azimuth sub-aperture data segmentation; 5, performing azimuth coarse data focusing; 6, performing azimuth fine data focusing; 7, performing sub-aperture data splicing. According to the overlapped sub-aperture algorithm provided by the invention, the assumed error phase of a wave front plane of the sub-aperture data is limited by utilizing the sub-aperture data, a space-varying quadratic error phase is compensatedby utilizing the coarse focusing result of the sub-aperture data, and the overlapped sub-aperture algorithm is a high-efficiency and accurate imaging processing method.

The invention provides a deviation value control method for cold rolling hot galvanizing coating uniformity. The method comprises the steps of: 1) establishing an influence model of the knife lip opening degree on coating thickness; 2) establishing an influence efficiency function matrix determining the influence weight of each air knife lip servo motor adjustment amount on each coating; 3) solving a motor adjustment amount according to a quadratic error function minimum principle; and 4) considering the actual application features in terms of correcting the quadratic error function, when the galvanizing thickness measured value of a point deviates from most measuring points, in order to avoid the interference of an extreme value on the coating control of other areas, adding a filtering function in an error function, thus finally obtaining a needed air knife lip opening degree. The invention provides a new galvanized layer thickness calculation model suitable for industrial application, introduces the influence efficiency function matrix, enhances the coating uniformity control accuracy, and simultaneously adds the cost function and the filtering function to improve the coating error function accuracy, thereby enhancing the coating uniformity calculation accuracy, and improving the surface quality of a galvanized product.

The invention concerns a method and a system for determining a scent or taste profile of a user consisting in: storing for each of a set of products chosen among products for which a database contains smell of taste prints constituted by a set of measurements given by smell or taste electronic sensors, a rating (SN) given by the user; and automatically calculating weighting coefficients constituting said profile and respectively affected to said sensors, by successive approximation of sets of weighting coefficients leading to minimizing the sum of the quadratic errors over the set of satisfaction notes.

The invention concerns a method for jointly decoding and equalizing a digital signal protected by a trellis-defined code and transmitted though a channel. The method consists in carrying out a maximum likelihood estimate of each current bit xn by minimizing the quadratic error between the observed symbol Vn and the current symbol in the channel output zn, the quadratic error being calculated (1002) from the set of observed symbols based on the branch metric of the last transition en1(X)→en(X) according to the relationship (I); wherein k represents the rank of the coefficients of transverse filtering introduced by the radioelectric channel. The branch metric is calculated by backtracking through the successive states and the error propagating process is inhibited (1003) while backtracking through the successive states by storing at each node S survivors and by updating each survivor at the next time. The final survivor of the least metric is determined (1004) and the sequence of bits is read by backtracking through the successive nodes. The invention is applicable to ATM radio transmission.

The invention provides a complex surface detection adaptive sampling method based on triangular mesh simplification, which calculates a curvature factor by calculating a quadratic error matrix and estimating a vertex Gaussian curvature and an average curvature to obtain an edge shrinkage error; the edge shrinkage error is obtained by calculating a quadratic error matrix and estimating a vertex Gaussian curvature and an average curvature. By judging the edge type to get the best shrinking target point, introducing the edge length constraints to optimize the distribution of sampling points, triangular mesh surface simplification under multi-constraint is realized, and then the simplified triangular mesh vertices are projected onto the design surface to get complex surface detection samplingpoints. The method is suitable for free-form surface detection sampling point planning with complex geometric characteristics, adopts multiple constraints to plan sampling point distribution, improvessampling point distribution defects under single constraint, reduces computational complexity based on discrete data, and improves measurement efficiency and accuracy.

The invention discloses a method for simplifying three-dimensional geometric graphics on the basis of triangle contraction. The method includes firstly, setting conditions for judging triangles and only allowing contraction operation to be carried out on triangles which meet the conditions; secondly, folding and contracting the triangles; thirdly, determining the vertexes V of contraction points with the maximum distances d, using average planes M as planes adjacent to points V and solving the contraction points by a secondary error process. The maximum distances d of the contraction points are equal to computation factors a. The folding and contraction priority of each triangle is represented by a weight L=aXb, the triangles corresponding to small weights L are contracted at first, each factor b represents the area of the corresponding triangle, each average plane M of a triangle plate S of the corresponding triangle T is computed, normal vectors of the average planes M are acquired in such a manner the maximum distances d from the various points V to the triangle plates S are used as the factors a, in other words, each d is equal to an absolute value of nX(V-x), each factor a is the maximum value of the corresponding distances d1, d2 and d3, and the distances d are used for solving the triangles T. The method for simplifying the three-dimensional geometric graphics on the basis of triangle contraction has the advantages that conditional judgment is carried out on the triangles, the triangles are folded and contracted according to priority levels of the triangles, accordingly, simplifying procedures can be optimized, the precision is high, and the original graphics can be effectively preserved.

The link adaptation process for selecting a physical layer mode used on a radio link for transmitting symbols of a message between two stations of a wireless communication system among a set of potential physical layer modes comprises the steps of: —evaluating the current radio link conditions; and switching from a current physical layer mode to another physical layer mode by applying a criteria depending on the evaluated current radio link conditions. The evaluation step of the current radio link conditions comprises the calculation of a received modulation accuracy (RMA) for at least a part of the message, the received modulation accuracy (RMA) being de\-fined as the inverse of the expectation of a quadratic error for a predetermined number of symbols between demodulated received symbol values and ideal symbol values and in that the criteria is at least partially dependent on the calculated received modulation accuracy (RMA).

A method for calibrating the dynamic error of the strapdown MEMS gyroscope, which can identify all the dynamic error coefficients of the strapdown MEMS gyroscope. The strapdown MEMS gyro zero bias, scale factor, installation error coefficient, and the error coefficient of the gyro and the square of the angular velocity are obtained; the three-coupling azimuth dynamic test is used to calibrate the error coefficient of the three angular velocity coupling quadratic terms of the gyro; using the three-axis rate turntable Set the initial angle of the three-axis, input the same uniform angular velocity Ω to the YT axis of the three-axis turntable in the middle frame and the ZT axis of the outer frame at the same time, and stimulate the dynamic error term including the angular acceleration error, so as to calibrate the gyro and angular acceleration related term error coefficients. The invention can accurately calibrate all the dynamic error coefficients of the strapdown MEMS gyroscope only by using the three-axis rate turntable, has high error identification accuracy, and can provide reference for traditional mechanical gyroscopes and optical fiber gyroscopes.

The invention discloses a three-dimensional grid model simplification method and system method and system based on optimized feature preservation. The three-dimensional grid model simplification method includes the steps: firstly, calculating the Gaussian curvature of each edge in a three-dimensional grid, combing the Gaussian curvature and the secondary error measure of the edge to calculate thefolding cost of the edge, and constructing edge folding operation based on feature preservation; combining an edge splitting operation sequence and an edge folding operation sequence based on featurepreservation to generate a mixed sequence, and using a mixing mechanism for simplifying a three-dimensional grid model; replacing a global search stage in whale optimization by crossover and mutationoperation of differential evolution, and constructing a whale differential evolution optimization algorithm; and finally, searching an optimal edge splitting operation and edge folding operation sequence combination mode by utilizing an optimization algorithm, so that the approximate error between the simplified three-dimensional model and the original model is minimum. According to the three-dimensional grid model simplification method, through grid simplification, the optimal three-dimensional grid simplification effect with the minimum approximate error can be obtained, meanwhile, geometrical characteristics can be well kept, and the quality of triangles in the model is improved.

The invention relates to the field of computer graphics and discloses a mean quadratic error metrics edge contraction simplifying method. The mean quadratic error metrics edge contraction simplifying method comprises a mean quadratic error metrics method and an edge contraction simplifying method based on the mean quadratic error metrics method. The mean quadratic error metrics method comprises the steps of collecting all vertices in a model and updating the vector quantities of all triangular surfaces. The edge contraction simplifying method comprises the steps of selecting all proper vertex pairs, calculating the contraction target vertex and error value of each vertex pair, ranking the vertex pairs in an ascending order according to the error values, placing the ranked vertex pairs in a vertex pair list, and finally traversing the list from the start, removing the vertex pairs, contracting the vertices and updating the error values of corresponding vertex pairs. According to the edge contraction simplifying method adopting mean quadratic error metrics, the mean quadratic error matrix of the vertices is calculated by means of the parallel computing power of a GPU, and time required by the initialization phase during quadratic error metrics is shortened greatly.

A prediction-correction model-based mesh simplification method is disclosed. The mesh simplification method of the calibration model comprises the following steps: reading all vertices and surfaces inthe three-dimensional mesh, and calculating the basic quadratic matrix and the quadratic error matrix; calculating the initial folding errors of all edges and the positions of the corresponding new vertices, and inserting the initial folding errors into the priority queue; selecting the edge with the least folding error from the priority queue, performing a folding operation, and updating the related vertices and faces; recalculating the basic quadratic matrix of the adjacent surfaces and the quadratic error matrix of the new vertices according to the positions of the new vertices; recalculating the folding error of the edge adjacent to the folding point and the position of the corresponding new vertex, and updating the priority queue; stopping operation until the simplified conditions set are satisfied. The invention can effectively control the accumulated error in the process of edge folding, improve the quality of the simplified model and improve the overall simplified effect whilerapidly and efficiently simplifying the mesh.

Detection method and device for a receiver in a digital communication system designed to process a frame comprising a periodic sub-set of length n, said method comprising the following steps: —determining a first vector u having a length n;—determining a second shifted vector v;—calculating a correlation function between said first and second vectors; —calculating a quadratic error function between said first and second vectors;—calculating a first cost function that is a linear combination of both preceding functions and, according to the sign of the result,—calculating a second cost function of frame beginning estimate; and—starting the communication system receiver.

The invention discloses a grid simplification method considering the area and normal vector for the non-smooth surface. The estimated error of each edge folding and the position of the new vertex, the normal vector constraint is included in the cost of the new vertex after folding, the minimum folding cost and the corresponding position of the new vertex and the original vertex are stored in the vertex attribute, and the folding error Insert into the priority queue; take out the edge with the least folding cost from the queue, fold it, and update the relevant vertices and faces; until the set simplification conditions are satisfied. The present invention can keep the detail features of the original model as much as possible while quickly simplifying the grid. Especially for some non-fluid and non-smooth surfaces, compared with the traditional method, this method can better preserve the details and achieve a more prominent simplification effect, thereby improving the overall simplification effect.

The invention discloses a triangular mesh simplification method based on angle error measure, which comprises the following steps: triangles are classified according to a certain condition; fixed points of the triangles are subjected to measurement and calculation on secondary error measure; the position of a new vertex is designed and determined; the narrow extent of a triangle is calculated; a local region area of the triangle is calculated; angle error measure of a folding point is calculated; a triangle folding error matrix is comprehensively calculated; the error queue is arranged; and optimal folding operation on the triangle is realized. A simplification method which can well keep the topological structure and the geometric boundary characteristics of the original triangular networkmodel can be provided for the user, the operation efficiency is improved, the space occupancy is reduced, and the method can be widely applied to computer graphics, computer aided design, virtual reality technology and other needs.

The embodiment of the invention discloses a model simplification method and related equipment thereof. The method comprises the steps: firstly determining a quadratic error matrix and curvature representation data of at least one vertex in a to-be-simplified model after the to-be-simplified model is obtained; respectively determining a quadratic error matrix and curvature representation data of at least one vertex pair according to the quadratic error matrixes and curvature representation data of the vertexes; then, according to the quadratic error matrixes of the vertex pairs and curvature representation data, the merging cost of the vertex pairs is determined; and finally, according to the combination cost of the vertex pairs, performing vertex combination processing on the to-be-simplified model, so that the number of vertexes in the to-be-simplified model obtained through vertex combination processing is less than the number of vertexes in the original to-be-simplified model. Therefore, less resources are consumed when subsequent model processing is carried out on the to-be-simplified model obtained through vertex merging processing, and the processing effect on the high-dimensional data model can be improved.

The invention relates to the field of computer graphics, and discloses a mean quadratic error measuring method. The mean quadratic error measuring method comprises the steps that all vertexes in a model are collected, and the vectors of all triangular faces are updated; according to the specific steps, a vertex error is defined as the sum of the squares of the distances between the vertexes and all the triangular faces adjacent to the vertexes according to a QEM algorithm; calculation of the vertex error is transferred o a GPU end; a pixel value is defined, and a row vector is converted into the pixel value and placed in Color Buffer; the pixel value is acquired from the Color Buffer and is reverted to a mean quadratic error matrix; the computational formula of the second order error can be obtained according to the computational formula of the vertex error. The mean quadratic error measuring method is provided, the QEM algorithm is adopted, calculation of the vertex error is transferred to the GPU end, the pixel value is acquired from the Color Buffer and reverted to the mean quadratic error matrix, and time needed in the initialization stage of second order error measurement is greatly shortened.

The invention relates to the field of computer graphics, and discloses a mean quadratic error measuring method. The mean quadratic error measuring method comprises the steps that all vertexes in a model are collected, and the vectors of all triangular faces are updated; according to the specific steps, a vertex error is defined as the sum of the squares of the distances between the vertexes and all the triangular faces adjacent to the vertexes according to a QEM algorithm; calculation of the vertex error is transferred o a GPU end; a pixel value is defined, and a row vector is converted into the pixel value and placed in Color Buffer; the pixel value is acquired from the Color Buffer and is reverted to a mean quadratic error matrix; the computational formula of the second order error can be obtained according to the computational formula of the vertex error. The mean quadratic error measuring method is provided, the QEM algorithm is adopted, calculation of the vertex error is transferred to the GPU end, the pixel value is acquired from the Color Buffer and reverted to the mean quadratic error matrix, and time needed in the initialization stage of second order error measurement is greatly shortened.

The invention discloses a three-dimensional model classification retrieval method based on kernel sparse representation. The method comprises the following steps: 1, carrying out vertex simplificationprocessing on a three-dimensional model represented in a point cloud form by using an edge shrinkage algorithm based on a secondary error as a measurement cost; 2, calculating the direction of the three-dimensional model after vertex simplification, ensuring that the same kind of models can be aligned in the direction, and obtaining three characteristic direction vectors of the three-dimensionalmodel through calculation; 3, rendering the three-dimensional model based on the three characteristic direction vectors to obtain a plurality of different rendered images in corresponding different directions; 4,for the characteristics of the three-dimensional model in different data sets, comprehensively considering data characteristics and descriptor characteristics, and selecting a characteristic descriptor to extract the characteristics of the rendered image; and 5, matching the extracted feature vectors by using an improved kernel sparse representation classifier so as to realize the classification retrieval work of the three-dimensional model. The method has certain robustness, and relatively high-efficiency and reliable superior performance is obtained.

The present invention discloses an area and normal vector-based grid simplification method for unsmooth surfaces. The method comprises the following steps that: all vertices and surfaces in a three-dimensional grid are read, the basic quadratic matrix and initial quadratic error matrix of the vertices and surfaces are calculated; the estimation error of the folding of each side and the positions of new vertices are calculated, after the sides are folded, the cost of the new vertices contains normal vector constraints, minimum folding cost and the positions of a new vertex and an original vertex which are corresponding to the minimum folding cost are stored in vertex attributes, and the folding error is interpolated into a priority queue; sides with the minimum folding cost are extracted from the queue, folding operation is performed on the sides, related vertices and surfaces are updated; and the method dose terminate until a set simplification condition is satisfied. With the method of the invention adopted, the grid can be quickly simplified, and at the same time, the detail features of an original model can be retained as much as possible. As for non-fluid and non-smooth surfaces, the method can better retain detail features and achieve a more outstanding simplification effect compared with a traditional method, and therefore, the method can improve an overall simplificationeffect.