IBM Research and five leading universities are partnering to create computing systems that are expected to simulate and emulate the brain's abilities. Although this project has achieved some successes, it meets gr...
详细信息
In order to improve image quality, a novel Retinex algorithm for image enhancement was presented. Different from conventional algorithms, it was based on certain defined points containing the illumination information ...
详细信息
In order to improve image quality, a novel Retinex algorithm for image enhancement was presented. Different from conventional algorithms, it was based on certain defined points containing the illumination information in the intensity image to estimate the illumination. After locating the points, the whole illumination image was computed by an interpolation technique. When attempting to recover the reflectance image, an adaptive method which can be considered as an optimization problem was employed to suppress noise in dark environments and keep details in other areas. For color images, it was taken in the band of each channel separately. Experimental results demonstrate that the proposed algorithm is superior to the traditional Retinex algorithms in image entropy.
We proposed a channel allocation algorithm, which was a modification of graph theory and based on demand to optimize the performance of cognitive wireless Mesh network. The key idea of the algorithm was to design a pr...
详细信息
The weighted circles layout problem belongs to the layout optimization problem with performance constraints. Due to its NP-hard property, it is difficult to solve in polynomial time. In this paper, a heuristic particl...
详细信息
Formal concept analysis (FCA) and description logic (DL) are meant to be formalizations of concepts.A formal concept in the former consists of its intent and extent,where the intent is the set of all the attributes sh...
详细信息
Formal concept analysis (FCA) and description logic (DL) are meant to be formalizations of concepts.A formal concept in the former consists of its intent and extent,where the intent is the set of all the attributes shared by each object in the extent of the concept,and the extent is the set of all the objects sharing each property in the intent of the concept.A concept in the latter formalization is simply a concept name,the interpretation of which is a subset of a *** consider the correspondence between concepts in both formalizations,a multi-valued formal context must be represented both as a knowledge base and as a model of the DL for contexts,where concepts are decomposed into tuple concepts C,interpreted as a set of tuples and value concepts V,interpreted as a set of attribute-value *** show that there is a difference between the interpretation of concepts R.V /R.C and the Galois connection between the extent/intent of formal concepts in *** to the Galois connection,there should be concepts of the form + R.V and + R.C inter-preted in FCA,and hence the logical language L for DL is extended to be L + together with + as a constructor so that + R.V and + R.C are well-defined ***,according to the interpretation in DL there should be pseudo concepts in FCA so that the interpretation of concepts R.V /R.C is the extent/intent of pseudo *** correspondence between formal concepts and concepts in L +,and between pseudo concepts and concepts in L are presented in this paper.
We study the direct product decomposition of quantum many-valued algebras (QMV algebras) which generalizes the decomposition theorem of ortholattices (orthomodular lattices).In detail,for an idempo- tent element of a ...
详细信息
We study the direct product decomposition of quantum many-valued algebras (QMV algebras) which generalizes the decomposition theorem of ortholattices (orthomodular lattices).In detail,for an idempo- tent element of a given QMV algebra,if it commutes with every element of the QMV algebra,it can induce a direct product decomposition of the QMV *** the same time,we introduce the commutant C(S) of a set S in a QMV algebra,and prove that when S consists of idempotent elements,C(S) is a subalgebra of the QMV *** also generalizes the cases of orthomodular lattices.
Decision tree is a popular classification technique in many applications, such as retail target marketing, fraud detection and design of telecommunication service plans. With the information exploration, the existing ...
详细信息
Most of the previous works for web video topic detection(e.g., graph-based co-clustering method) always encounter the problem of real-time topic detection, since they all suffer from the high computation complexity. T...
详细信息
Semantic relation among different objects is one of the most important kinds of semantics which plays the primary role for people and intelligent systems in grasping the situation accurately in the context of connecte...
详细信息
In this paper,we propose an iterative two-grid method for the edge finite element discretizations(a saddle-point system)of Perfectly Matched Layer(PML)equations to the Maxwell scattering problem in two ***,we use a fi...
详细信息
In this paper,we propose an iterative two-grid method for the edge finite element discretizations(a saddle-point system)of Perfectly Matched Layer(PML)equations to the Maxwell scattering problem in two ***,we use a fine space to solve a discrete saddle-point system of H(grad)variational problems,denoted by auxiliary system ***,we use a coarse space to solve the original saddle-point ***,we use a fine space again to solve a discrete H(curl)-elliptic variational problems,denoted by auxiliary system ***,we develop a regularization diagonal block preconditioner for auxiliary system 1 and use H-X preconditioner for auxiliary system *** we essentially transform the original problem in a fine space to a corresponding(but much smaller)problem on a coarse space,due to the fact that the above two preconditioners are efficient and *** with some existing iterative methods for solving saddle-point systems,such as PMinres,numerical experiments show the competitive performance of our iterative two-grid method.
暂无评论