the proceedings contain 23 papers. the special focus in this conference is on Color reproduction, Color sensation and perception, Color image processing, Spectral imaging and Color in digital cultural heritage. the to...
ISBN:
(纸本)9783319159782
the proceedings contain 23 papers. the special focus in this conference is on Color reproduction, Color sensation and perception, Color image processing, Spectral imaging and Color in digital cultural heritage. the topics include: Color and spectral mixings in printed surfaces;an overview of color name applications in computer vision;optics and computational methods for hybrid resolution spectral imaging;relative pose estimation and fusion of 2D spectral and 3D lidar images;representation of cultural objects by image sets with directional illumination;descriptor-based image colorization and regularization;experimental analysis for modeling color of halftone images;development of a dynamic relighting system for moving planar objects with unknown reflectance;collection, analysis and representation of memory color information;the display gamut available to simulate colors perceived by anomalous trichromats;visual search for normal color and dichromatic observers using a unique distracter color;first stage of a human visual system simulator;the color logarithmic image processing (CoLIP) antagonist space and chromaticity diagram;does color influence image complexity perception?;adaptive filters for color images: median filtering and its extensions;can linear data projection improve hyperspectral face recognition?;spectral impulse noise model for spectral image processing;evaluation of the colorimetric performance of single-sensor image acquisition systems employing colour and multispectral filter array;high-resolution multispectral scanning for mesoscopic investigation of discoloration of traditional Japanese pigments and estimating the colors of paintings.
Knowledge graph completion aims to predict missing entities or relationships in a knowledge graph, addressing the issue of data sparsity. In recent years, deep learning-based models, especially graph Convolutional Net...
详细信息
ISBN:
(数字)9798350355925
ISBN:
(纸本)9798350355932
Knowledge graph completion aims to predict missing entities or relationships in a knowledge graph, addressing the issue of data sparsity. In recent years, deep learning-based models, especially graph Convolutional Network (GCN) and Self-Attention mechanisms, have gained attention for their advantages in handling graph-structured data. We propose a knowledge graph completion model, CSANN, which integrates GCN and self-attention mechanisms. First, GCN module is used to learn the initial representations of entities and relationships, considering the neighboring information of entities. Next, the initial representations of entities and relationships are concatenated to form a sequence, which is further refined by introducing the self-attention mechanism. By combining the local graph structure awareness of GCN and the sequential dependency capturing ability of self-attention mechanisms, CSANN improves the accuracy of knowledge graph completion. Experiments conducted on two public datasets, FB15K-237 and WN18RR, show that the proposed model outperforms many classical models, such as TransE, DistMult, ConvE, and RotatE, in terms of Mean Reciprocal Rank (MRR) and Hit@K.
Software visualization is an efficient and flexible tool to inspect and analyze software data at various levels of detail. However, software analysts typically do not have a sufficient background in visualization and ...
详细信息
Software visualization is an efficient and flexible tool to inspect and analyze software data at various levels of detail. However, software analysts typically do not have a sufficient background in visualization and cognitive science to select efficient representations and parameters without the help of visualization experts. To overcome this problem, we propose an approach to generate software analysis tasks that use visualization. To this end, we use taxonomies of low-level analytic tasks, high-level interactive tasks, and perceptual rules to design an assistant that proposes analysis scenarios.
In the paper we propose an approach to the realization of models inspired to biological solutions for patternrecognition. the approach is based on a hierarchical modular structure capable to learn by examples and rec...
详细信息
In the paper we propose an approach to the realization of models inspired to biological solutions for patternrecognition. the approach is based on a hierarchical modular structure capable to learn by examples and recognize objects in digital images. the adopted techniques are based on multiresolution image correlation and neural networks. Performance on two different data sets and experimental timings on a SIMD machine are also reported.
the following topics are dealt with: parallel and distributed computing; software metrics and project management; communication systems and networks; data mining; data warehousing; information management systems; Inte...
the following topics are dealt with: parallel and distributed computing; software metrics and project management; communication systems and networks; data mining; data warehousing; information management systems; Internet; mobile computing; wireless computing; software engineering; information engineering; management information systems; image processing and patternrecognition; computer architecture and software testing; artificial intelligence; intelligent agent technology; Web engineering
In this paper we describe modifications of irregular image segmentation pyramids based on user-interaction. We first build a hierarchy of segmentations by the minimum spanning tree based method, then regions from diff...
详细信息
Finding similar patterns (motifs) in a set of sequences is an important problem in Computational Molecular Biology. Pevzner and Sze [18] defined the planted (l,d)-motif problem as trying to find a length-l patterntha...
详细信息
A new algorithm for building irregular pyramids is presented. the algorithm is based on only two basic operations on graphs, contraction and removal of edges. By making use of the concept of dual graphs, the algorithm...
详细信息
A new algorithm for building irregular pyramids is presented. the algorithm is based on only two basic operations on graphs, contraction and removal of edges. By making use of the concept of dual graphs, the algorithm overcomes the problem of unbounded vertex degree proper to the existing approach to building irregular pyramids. this boundedness extends the scope of parallel, degree preserving graph contraction also to irregular structures. Our method can be applied to all problems in which a 2D discrete space can be represented by a planar graph. Four-connected square grids, region adjacency graphs, Voronoi diagrams and Delaunay triangulations are examples of such plane representations.
Today’s deep learning systems deliver high performance based on end-to-end training but are notoriously hard to inspect. We argue that there are at least two reasons making inspectability challenging: (i) representat...
详细信息
暂无评论