55 results about "Ising model" patented technology

This computation device and method exponentially shortens a computation time of an NP-complete problem or the like mapped into an Ising model by exponentially shortening a computation time of the Ising mode. For each pair of a plurality of slave lasers, by controlling the intensity, the polarization, and the phase of light exchanged between two slave lasers using an attenuator and a wave plate, the magnitude and the sign of pseudo Ising interaction between two slave lasers are implemented. Then, after the plurality of slave lasers arrive at a steady state, by measuring the polarization of light generated by each slave laser with left-handed circular polarization and right-handed circular polarization used as bases, a pseudo spin of each slave laser is measured.

An object of the present invention is to realize an example of configuration that approximately represents a state of quantum spin in a semiconductor device where components as a basic configuration unit are arrayed so as to search a ground state of Ising model. There is disclosed a semiconductor device provided with plural units each of which is equipped with a first memory cell that stores a value which represents one spin of the Ising model by three or more states, a second memory cell that stores an interaction coefficient showing interaction from another spin which exerts interaction on the one spin and a logical circuit that determines the next state of the one spin on the basis of a function having a value which represents a state of the other spin and the interaction coefficient as a constant or a variable.

A method implemented by an optical circuit, including beam splitter, phase shifters and cross-phase modulators, for solving Ising-model using quantum annealing discretizes a continuous time-dependent Hamiltonian function over a time period T, into a plurality of smaller portions; implements each of said smaller portions with a non-linear optical medium, and iterates over said smaller portions to output a solution of the Ising Hamiltonian problem, using the optical components.

A parametric oscillator oscillates a plurality of pseudo spin pulses SPi having mutually an identical oscillation frequency by using parametric oscillation, an interaction implementing unit performs feedback implementation of a magnitude and a sign of interaction related to each pseudo spin pulse SPi (the proportionality coefficient λi+ΣJijσj+ΣKijkσjσk with respect to σi) by using a tentative measurement result of oscillation phases φi(tentative) of the plurality of pseudo spin pulses SPi, and a pseudo spin measuring unit measures the pseudo spins σi of the plurality of pseudo spin pulses SPi, based on a final measurement result of oscillation phases φi(steady) of the plurality of pseudo spin pulses SPi.

The invention discloses an image segmentation method based on an Ising graph model, comprising the steps of: constructing the Ising graph model corresponding to the graph, a dual graph corresponding to the Ising image model and an extension dual graph corresponding to the dual graph; calculating a maximum weight value perfect match of the extension dual graph according to the system total energy of the Ising graph model; obtaining a minimum weight value cut of the Ising graph model according to the maximum weight value perfect match of the extension dual graph, and obtaining the segmentation result of the image according to states of the nodes in the Ising graph model corresponding to the minimum weight value cut. The simple and effective Ising graph model is adopted for segmenting the image, therefore, not only the calculation complexity is low and the efficiency is high, but also the segmentation accuracy is high; meanwhile, compared with the traditional image segmentation algorithm, the image segmentation method based on the Ising graph model does not have too strict condition limitation; According to the image segmentation method, while calculating the weight value energy of the edges of the Ising graph model, the gray information or color information or texture information of the nodes in the Ising graph model are fully utilized, and the relatively accurate segmentation result can be achieved by regarding the information as the basis of the image segmentation.

A semiconductor device in which a ground state of an Ising model is realized, includes a spin array in which a spin unit is formed, the spin unit including a memory cell storing a value of one spin in an Ising model, a memory cell storing an interaction coefficient from an adjacent spin interacting with the spin, a memory cell storing an external magnetic field coefficient of the spin, and a circuit deciding a next state of the spin by binary majority decision logic based on a product of the value of each of the adjacent spins and the corresponding interaction coefficient, and the external magnetic field coefficient. The spin array is formed by having a plurality of the spin units, each having each spin allocated thereto, arranged and connected on a two-dimensional plane on a semiconductor substrate in the state where a topology of the Ising model is maintained.

The invention discloses a distributed multi-hop wireless network clock synchronization method based on a mean field, and aims to solve the technical problem that a clock reference is difficult to determine in an existing distributed clock synchronization method. According to the technical scheme, the method comprises the following steps: realizing bidirectional time stamp exchange in a broadcast way firstly; making a clock difference overall effect between nodes be equivalent to a mean field; establishing a clock synchronization model of a network based on a spatial Markov random field; introducing a neighbor system and a clique potential according to the equivalence between the Markov random field and a Gibbs random field to obtain a clock synchronization energy function based on a mean field Ising model; and giving a clock synchronization algorithm adopting energy minimization optimization, namely, a whole-network clock distributed synchronization algorithm based on a mean field model. Through adoption of a whole-network clock synchronization method based on the mean field model, a whole-network virtual clock reference is determined through a mean action between the nodes, so that the technical problem that the clock reference is difficult to determine in the distributed clock synchronization method in the prior art is solved.

An information processing unit and information processing method capable of performing a ground-state search of an Ising model having coefficients of arbitrary values regardless of restrictions on hardware or software is suggested.When a ground state of an original problem, which is an Ising model, or an approximate solution of that ground state is calculated as a solution of the original problem, one or more sub-problems which are Ising models are generated from the original problem and the information processing unit searches the ground state of each generated sub-problem and generates a solution of the original problem based on a solution of each sub-problem obtained from the search; and when types of coefficient values of an Ising model whose ground state can be searched are limited, sub-problems which are Ising models composed of the types of limited values of coefficients are generated.

Methods and systems represent constraint as an Ising model penalty function and a penalty gap associated therewith, the penalty gap separating a set of feasible solutions to the constraint from a set of infeasible solutions to the constraint; and determines the Ising model penalty function subject to the bounds on the programmable parameters imposed by the hardware limitations of the second processor, where the penalty gap exceeds a predetermined threshold greater than zero. Such may be employed to find quantum binary optimization problems and associated gap values employing a variety of techniques.

The present invention discloses a collaborative consensus method for multiple unmanned vehicles based on the Markov random field, which is used for solving the technical problem that the collaborative consensus of the existing multiple unmanned vehicles is difficult to determine. In the technical solution, a neighbor system is introduced, and a reference of the whole network is generated by the interaction of collaborative information among neighbors based on the theory of the Markov random field; a deviation of cooperation between nodes is mapped as cluster potential energy, and an Ising model-based energy function is established on this basis; and finally, the consensus of the whole network is implemented by using the parallel energy minimization method.

An information processing apparatus manufactured at low cost and with ease and that is capable of making a search for a ground state of an arbitrary Ising model. An information processing unit containing a plurality of semiconductor chips, each retains a value of one spin or values of a plurality of spins and simulates interactions among the spins, inter-chip wiring between the necessary semiconductor chips, and a control unit that cause each semiconductor chip to perform interaction computation. The control unit converts data of a problem into data of a lattice-shaped Ising model, which is possibly expressed by the plurality of semiconductor chips, without causing a spin arrangement, in a ground state of an Ising model for the problem, to be changed. The data of the lattice-shaped Ising model is divided for allocation to the plurality of semiconductor chips, and causes each semiconductor chip to perform the interaction computation.

One aspect of the method / apparatus finds, for each input-image pixel, an “offset weighted average” of neighboring-pixel interactions—and uses the averages to make a final image. Another aspect assumes a value for each pixel, to use in a final rendered image form—and, at each in a series of approximations, determines whether to change the value, and finds a probabilistic weight to help determine. Yet another finds, for each pixel, a numerical representation of neighboring-pixel interactions—and establishes a distance cutoff for use in defining “neighbor”, and uses the representation to decide whether to change color values. Still another finds a desired or ideal number of print passes, and adapts the number of passes actually used to the found number. Another combines halftoning and printmasking into one procedure and prints images prepared thereby. Another integrates halftoning and image filtering, to obtain esthetic visual effects, into one procedure—and prints images thus prepared.

The invention belongs to the technical field of image segmentation, and particularly relates to an image segmentation method based on a secondary confinement region growth method, which comprises thefollowing steps: step 1, converting an image from an RGB space into a Lab space; step 2, setting the number of seed points and a threshold value, throwing the seed points, and marking the image by using a limited area growth method and the threshold value; step 3, traversing the whole image according to a grating scanning sequence to carry out secondary limited region growth, and marking each unmarked point; step 4, calculating a mean value of wave bands of the superpixel blocks divided in the last two steps; And step 5, setting a predicted classification number, and combining the superpixel results obtained in the step 3 by using a simulated annealing algorithm based on a hidden Markov model, an Isinuous model and a Gaussian function to obtain a final segmentation result. According to theimage segmentation method disclosed by the invention, a region growth limiting method is used, so that each seed point performs region growth in an image range of the step size multiplied by the stepsize, the calculation workload is reduced, and the operation speed is increased.

The invention belongs to the field of image reconstruction, and particularly relates to a super-resolution image reconstruction method based on characteristic channel adaptive weighting. A super-resolution image reconstruction method based on characteristic channel adaptive weighting comprises the following steps: (1) improving an excitation function of a compressed excitation network SE to obtainan ISE module; (2) simplifying the existing EDSR network; (3) embedding the ISE model into the simplified EDSR network to obtain an ISE-EDSR model; (4) training ISE-EDSR model by using the training sample. The method has the advantages that the training difficulty is low; adaptively learning feature channel weights; the problem that the output value of the network intermediate layer is too low isavoided; and the peak signal-to-noise ratio of the image after super-resolution reconstruction is high.

Provided is a more efficient method as a method of parameter adjustment of a graph embedded in an annealing machine. An information processing apparatus including an annealing calculation circuit including a plurality of spin units, which obtains a solution using an Ising model, is also provided. In the apparatus, each of the plurality of spin units includes a first memory cell that stores a value of the spin of the Ising model, a second memory cell that stores an interaction coefficient with an adjacent spin that interacts with the spins, a third memory cell that stores an external magnetic field coefficient of the spin, and an operational circuit that performs an operation of determining a next value of the spin based on a value of the adjacent spin, the interaction coefficient, and the external magnetic field coefficient. Further, the apparatus includes an external magnetic field coefficient update circuit that updates the external magnetic field coefficient with a monotonic increase or a monotonic decrease, and the annealing calculation circuit performs the annealing calculation a plurality of times by the operational circuit based on the updated external magnetic field coefficient.

A quantum mechanical arithmetic operation method for machine vision, based on quantum dots is performed by a quantum processing processor. The quantum mechanical arithmetic operation method comprises, obtaining a first labeled graph connecting between feature points of the first image and a second labeled graph connecting feature points of the second image, generating a point-to-point combination by matching the feature points of the first image with the feature points the second image, generating a conflict graph by adding the largest point-to-point combination by comparing the point-to-point combinations with the threshold, generating non-constrained binary optimization equation for finding a maximum independent set of conflict graphs, converting the non-constrained binary optimization equation into Ising model of the quantum system, and calculating the Hamiltonian of Ising model based on the quantum dots to obtain solution of the non-constrained binary optimization equation.

A quantum mechanical arithmetic operation method for machine vision, based on orbital qubit is performed by a quantum processing processor. The quantum mechanical arithmetic operation method comprises, obtaining a first labeled graph connecting between feature points of the first image and a second labeled graph connecting feature points of the second image, generating a point-to-point combination by matching the feature points of the first image with the feature points the second image, generating a conflict graph by adding the largest point-to-point combination by comparing the point-to-point combinations with the threshold, generating non-constrained binary optimization equation for finding a maximum independent set of conflict graphs, converting the non-constrained binary optimization equation into Ising model of the quantum system, and calculating the Hamiltonian of Ising model based on an orbital qubit to obtain solution of the non-constrained binary optimization equation.

The Ising model calculation device selects a solution having a consistent quality from among solutions obtained through the calculations with the evaluation index of a calculation accuracy. A coupling coefficient obtained by combining the Ising model coupling coefficient corresponding to a problem for which a solution should be calculated with the Ising model coupling coefficient corresponding to the check problem is set as a coupling coefficient used to calculate the interaction. With regard to a calculation value corresponding to the check spin among the calculation values using a plurality of light pulses, the compatibility as the solution of the check problem is judged. When the judgement result shows the compatibility as the solution of the check problem, a calculation value other than the calculation values corresponding to the check spin among the resultant calculation values is outputted as a solution to the problem for which a solution should be calculated.

In the present invention, a parametric oscillator 1 oscillates a plurality of pseudo spin pulses SPi having mutually an identical oscillation frequency by using parametric oscillation, an interaction implementing unit 5 performs feedback implementation of a magnitude and a sign of interaction related to each pseudo spin pulse SPi (the proportionality coefficient λi+ΣJijσj+ΣKijkσjσk with respect to σi) by using a tentative measurement result of oscillation phases ϕi (tentative) of the plurality of pseudo spin pulses SPi, and a pseudo spin measuring unit 6 measures the pseudo spins σi of the plurality of pseudo spin pulses SPi, based on a final measurement result of oscillation phases ϕi (steady) of the plurality of pseudo spin pulses SPi.

The application provides an optimization device and a control method of the optimization device. The optimization device includes: k first calculation circuits, N-k second calculation circuits, a selection circuit, an identification information calculation circuit and an update circuit. The first calculation circuit calculates a first energy change of an Ising model due to a change of a value of one of k first bits having values of 1 and a change of a value of a second bit having a value of 0 selected based on a generated first random number. The second calculation circuit calculates a secondenergy change of the Ising model due to a change of a value of one of (N-k) third bits having the values of 0 and a change of a value of a fourth bit having a value of 1 selected based on a generatedsecond random number.

The invention discloses a fast algorithm for judging the contaminated area of Bohai Bay based on remote sensing images: based on a Bayesian model, an Ising model and a signal model, the Bayesian-Isin-Signal (BIS) hybrid model is constructed; the variational Bayesian method is used to estimate the background low rank matrix L: to estimate U and V, to estimate the super parameter alpha, and to estimate the noise precision beta, and estimate foreground support matrix S. The invention aims at the judgment problem of Bohai Bay contaminated area of remote sensing image, restricts the form of matrixdecomposition by low rank condition and introduces continuous prior as sparse condition constraint to achieve the purpose of simultaneously estimating low rank matrix of background and foreground support matrix. In order to guarantee the existence of low rank solutions in the low rank decomposition process, an independent prior distribution with the same sparse profile is introduced for variablesand parameters, and a posteriori inference is made by using variational Bayesian method. In addition, considering the spatial distribution characteristics of singular value space, Markov random fieldsare introduced to estimate the foreground support matrix.

The invention provides an optimization device and a method for controlling the optimization device. The optimization device comprises: a plurality of calculation circuits, each of which calculates, for a plurality of bits corresponding to a plurality of spins included in an Ising model obtained by converting a problem to be calculated, in a case where the plurality of bits is divided into a plurality of groups, on the basis of a first local field value for a first bit having a value of 1 and a second local field value for a second bit having a value of 0 among a plurality of bits included in each of the plurality of groups, a first energy change of the Ising model due to a change of the value of the first bit from 1 to 0 and a change of the value of the second bit from 0 to 1; a selectioncircuit that outputs first bit identification information on the basis of a magnitude relationship between the first energy change and thermal excitation energy determined on the basis of an input temperature parameter and a random number; an identification information calculation; an update unit; a second storage unit; and a local field generation unit.