检索结果-内蒙古大学图书馆

36th IEEE International Symposium on Computer-Based Medical Systems (CBMS)

作者： Pio, Alessandro Castellano, Giovanna Mignosi, Filippo Placidi, Giuseppe Polsinelli, Matteo Sciarra, Alessandro Vessio, Gennaro Univ LAquila A2VI Lab Dept MeSVA Laquila Italy Univ Bari Aldo Moro Dept Comp Sci Bari Italy Univ LAquila DISIM Laquila Italy Univ Salerno Dept Comp Sci Salerno Italy

ISBN: (纸本)9798350312249

In medical imaging and magnetic resonance imaging (MRI), images generally represent the interaction between electromagnetic waves and the human body, often provided in multiple modalities, each represented in gray scale. However, the analysis and interpretation of these images mainly occur sequentially or, as in the case of automated tools, as a concatenation of independent sources of information. The nonlinear relationships between them are not exploited or left to the learning process of a complex automated strategy. In contrast, combining multiple modalities into pseudo-color images could enable the exploitation of nonlinear relationships due to color perception and color contrast, which play a crucial role in human vision to recognize objects effectively and efficiently. In principle, this can be extended to automated systems. However, automatic strategies do not fully exploit color representation if these nonlinear relationships are not modeled. In this paper, we show how a graph model of a device-independent color encoding (CIE XYZ) supplemented with a metric in the form of Euclidean distance between colors can become an effective tool for image segmentation from multiple sources. Tests were conducted on multimodal brain MRIs collected in a public database. The results demonstrate the importance of a graph model for mimicking color relationships, which could be very useful in medical image analysis and interpretation and other color-based computer vision applications.

关键词： artificial intelligence color coding computer vision medical imaging MRI multimodal imaging

来源：评论

学校读者我要写书评

暂无评论

A Series Arc Fault Identification Method Based on Improved Gramian Angular Field 5

A Series Arc Fault Identification Method Based on Improved G...

引用

5th International Conference on Power and Energy Technology, ICPET 2023

作者： Jiang, Wenqian Yang, Zhou Huang, Junli Cai, Hanju Lin, Xiuqing Tang, Zhitao State Grid Guangxi Electric Power Company Measurement Center of Guangxi Power Grid Co. Ltd. Nanning China Tianjin University School of Electrical and Information Engineering Tianjin China

ISBN: (纸本)9798350339673

The AC series arc fault of low-voltage power lines is easy to lead electrical fires and cause personal and property losses. The detection of series fault arc in low-voltage lines is mainly based on the extraction of arc fault features of current signals, which cannot make full use of all the information contained in the current waveform. In order to avoid the loss of valuable feature information in the current waveform, this paper proposes a 2D image coding method of current time series based on Gramian angular field (GAF), and uses computer vision technology for time series classification. Aiming at the problem that the arc feature information contained in the image is not obvious due to the limitation of computing resources and the pixel size of the image should be as small as possible, this paper improves the traditional GAF coding method. Based on the zero-current period and power features of arc current, the second color coding is performed on the image encoded by GAF in HSV color space to better express the original signal features. A series arc fault experimental platform was built, and the normal operation current and arc fault current of various electrical appliances were collected. The convolutional neural network and the improved image coding method are used to classify and identify the collected current. The results show that the average of the improved GAF coding method is 99.7 %, which has better accuracy than the traditional GAF. © 2023 IEEE.

关键词： color coding Gramian angular field image recognition series arc fault

来源：评论

学校读者我要写书评

暂无评论

Faster Algorithms for k-SUBSET SUM and Variations 15th

Faster Algorithms for k-SUBSET SUM and Variations

引用

15th International Frontiers of Algorithmics Workshop (FAW) / Game Theory in Blockchain Track Conference / 2nd International Joint Conference on Theoretical Computer Science (IJTCS)

作者： Antonopoulos, Antonis Pagourtzis, Aris Petsalakis, Stavros Vasilakis, Manolis Natl Tech Univ Athens Polytechnioupoli Sch Elect & Comp Engn Zografos 15780 Greece

ISBN: (纸本)9783030970994;9783030970987

We present new, faster pseudopolynomial time algorithms for the k-SUBSET SUM problem, defined as follows: given a set Z of n positive integers and k targets t(1), ... , t(k), determine whether there exist k disjoint subsets Z(1), ... , Z(k) subset of Z, such that Sigma(Z(i)) = t(i), for i = 1, ... , k. Assuming t = max{t(1), ... , t(k)} is the maximum among the given targets, a standard dynamic programming approach based on Bellman's algorithm [3] can solve the problem in O(nt(k)) time. We build upon recent advances on SUBSET SUM due to Koiliaris and Xu [1 6] and Bringmann [1] in order to provide faster algorithms for k-SUBSET SUM. We devise two algorithms: a deterministic one of time complexity (O) over tilde (n(k)/((k+1))t(k)) and a randomised one of (O) over tilde (n + t(k)) complexity. We further demonstrate how these algorithms can be used in order to cope with variations of k-SUBSET SUM, namely SUBSET SUM RATIO, k-SUBSET SUM RATIO and MULTIPLE SUBSET SUM.

关键词： SUBSET SUM FFT color coding MULTIPLE SUBSET SUM MULTIPLE KNAPSACK k-SUBSET SUM Pseudopolynomial Algorithms

来源：评论

学校读者我要写书评

暂无评论

Integrated Learning-Based Point Cloud Compression for Geometry and color with Graph Fourier Transforms 45

Integrated Learning-Based Point Cloud Compression for Geomet...

引用

Applications of Digital Image Processing XLV

作者： Lazzarotto, Davi Ebrahimi, Touradj Ecole Polytech Fed Lausanne EPFL Multimedia Signal Proc Grp MMSPG Lausanne Switzerland

ISBN: (纸本)9781510654372;9781510654365

Point cloud representation is a popular modality to code immersive 3D contents. Several solutions and standards have been recently proposed in order to efficiently compress the large volume of data that point clouds require, in order to make them feasible for real-life applications. Recent studies adopting learning-based methods for point cloud compression have demonstrated high compression efficiency specially when compared to the conventional compression standards. However, they are mostly evaluated either on geometry or color separately, and few learning-based joint codecs have been proposed. In this paper, we propose an integrated learned coding architecture by joining a previously proposed geometry coding module based on three-dimensional convolutional layers with a color compression method relying on graph Fourier transform (GFT) using a learning-based mean and scale hyperprior to compress the obtained coefficients. Evaluation on a test set with dense point clouds shows that the proposed method outperforms G-PCC and achieves competitive performance with V-PCC when evaluated with state-of-the-art objective quality metrics.

关键词： Point cloud compression graph Fourier transform geometry coding color coding

来源：评论

学校读者我要写书评

暂无评论

Analysis and Research on color Encoding and K-means Clustering Algorithm in Lingnan Landscape Design

引用

Applied Mathematics and Nonlinear Sciences 2024年第1期9卷

作者： Tan, Hongyan School of Fine Arts and Design Zhanjiang University of Science and Technology Guangdong Zhanjiang524000 China

As a prominent visual phenomenon, the color environment influences the landscape design of the Lingnan region in three aspects: shape, color, and texture. The purpose of this paper is to examine the landscape nature of color by analyzing the psychological perception characteristics of color and the evolution of Lingnan's color landscape system. We propose color clustering extraction methods for both single and batch Lingnan landscape images, combining them with color space conversion algorithms like RGB and YIQ to extract colors and segment Lingnan landscape images. We look at the performance parameters of various reconstructed images at various compression ratios. We also draw the performance convergence curves of the clustering algorithm, the JPEG, and the JPEG2000 algorithms to talk about how well they code. Taking the Lingnan region (Guangzhou) as the main object of analysis, we divide the regional color qualities and analyze the evolution and development of landscape color characteristics in the Lingnan region. Most of the Lingnan architectural landscapes have color brightness values in the medium-high range of 5-7. For wall color brightness, most of the brightness class level values are in the high brightness range of 7-10, followed by the medium brightness range of 4-7, and a small portion is in the low brightness range of 1-3. © 2024 Hongyan Tan, published by Sciendo.

关键词： Clustering algorithm color coding color space transformation Lingnan landscape

来源：评论

学校读者我要写书评

暂无评论

A Robust and Accurate Structured Light Pattern for Dynamic 3D Reconstruction 13

A Robust and Accurate Structured Light Pattern for Dynamic 3...

引用

13th International Conference on Digital Image Processing (ICDIP)

作者： Zhao, Xiangyu Mai, Songping Tsinghua Univ Div Informat Sci & Technol Shenzhen Int Grad Sch Shenzhen 518000 Peoples R China Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China

ISBN: (数字)9781510646018

ISBN: (纸本)9781510646018

A new method based on single shot using color coded image sequence for 3D reconstruction is proposed. The previous spatial neighborhood coding methods often need to determine the center of the pattern, but inaccurate positioning of pattern feature points will bring errors to 3D reconstruction. In this paper, a color-coded pattern is designed as two opposite triangular patterns to directly establish the center point of the pattern, thus avoiding the error caused by the inaccurate positioning of the center point after the pattern distortion. We designed a corner detector for our feature point detection, it is efficient and accurate. The pattern is coded in four colors of red, blue, green and pale yellow. We use a quaternary sixth order primitive polynomial to generate the pseudorandom sequence, which is then regenerated into the M-array. The final size of the code pattern is 65x63, and the unique code window size is 2x3. Experiments show that the 3D reconstruction owns high measurement precision and the decoding has strong robustness.

关键词： Structured light 3D reconstruction pseudo-random pattern color coding spatial neighborhood coding

来源：评论

学校读者我要写书评

暂无评论

Readiness of Healthcare Facilities to Implement Onsite Healthcare Waste Management Protocols and Incineration Guidelines in Tanzania

引用

Journal of Environmental Protection 2022年第11期13卷 913-940页

作者： Samwel Manyele Honest Anicetus Michael Habtu Khalid Massa Mahir Said Josephat Saria Grace Saguti Zabloni Yoti Department of Chemical and Mining Engineering University of Dar es Salaam Dar es Salaam Tanzania Ministry of Health Dodoma Tanzania World Health Organization Dar es Salaam Country Office Dar es salaam Tanzania Department of Physical and Environmental Sciences The Open University of Tanzania Dar es Salaam Tanzania

The aim of this study was to assess Readiness of Healthcare facilities to Implement onsite Healthcare Waste Management Protocols and Incineration Guidelines in Tanzania. To address this, a national assessment was conducted country wide to assess readiness of Healthcare Facilities (HCFs) to undertake various Healthcare Waste Management (HCWM) initiatives with particular focus to adherence to HCWM protocols and incineration guidelines. The assessment of healthcare waste management was conducted in facilities in the 26 regions of Tanzania mainland for one month. A standardized checklist and tools were used to assess and monitor various aspects related to healthcare waste management using open source software for data collection (ODK). Data were analyzed using SPSS computer software. It was observed that 46.2%, 33.3% and 25% of the health centres, district hospitals and regional hospitals did not have appointed supervisors, which makes it difficult for the HCFs to perform better in managing healthcare waste in their respective facilities. It was further revealed that healthcare facilities have made remarkable improvement in the overall healthcare waste management with evidence of ongoing common activity on purchasing injection safety boxes (69.2%) and purchasing of waste bins (53.8%) at all levels. On average, about 70% of the HCFs have plans and budget though inadequate to support HCWM activities. In a conclusion Healthcare Facilities must designate a better system to compressively address healthcare waste management issues. Again the findings provide evidence for those engaged in improving HCF conditions to develop evidence-based policies and efficient programs, enhance service delivery systems, and make better use of available resources.

关键词： Healthcare Waste Incinerators Waste Segregation Waste Collection color coding Ash Pits

来源：评论

学校读者我要写书评

暂无评论

Recent Advances in Positive-Instance Driven Graph Searching

引用

ALGORITHMS 2022年第2期15卷 42页

作者： Bannach, Max Berndt, Sebastian Univ Lubeck Inst Theoret Comp Sci D-23562 Lubeck Germany Univ Lubeck Inst IT Secur D-23562 Lubeck Germany

Research on the similarity of a graph to being a tree-called the treewidth of the graph-has seen an enormous rise within the last decade, but a practically fast algorithm for this task has been discovered only recently by Tamaki (ESA 2017). It is based on dynamic programming and makes use of the fact that the number of positive subinstances is typically substantially smaller than the number of all subinstances. Algorithms producing only such subinstances are called positive-instance driven (PID). The parameter treedepth has a similar story. It was popularized through the graph sparsity project and is theoretically well understood-but the first practical algorithm was discovered only recently by Trimble (IPEC 2020) and is based on the same paradigm. We give an alternative and unifying view on such algorithms from the perspective of the corresponding configuration graphs in certain two-player games. This results in a single algorithm that can compute a wide range of important graph parameters such as treewidth, pathwidth, and treedepth. We complement this algorithm with a novel randomized data structure that accelerates the enumeration of subproblems in positive-instance driven algorithms.

关键词： treewidth pathwidth treedepth graph searching positive-instance driven color coding

来源：评论

学校读者我要写书评

暂无评论

A Volumetric Approach to Point Cloud Compression-Part I: Attribute Compression

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2020年 29卷 2203-2216页

作者： Chou, Philip A. Koroteev, Maxim Krivokuca, Maja Google Inc Seattle WA 98103 USA Imatrex Inc Moscow 121205 Russia INRIA Ctr Rech Rennes Bretagne Atlantique F-35042 Rennes France

Compression of point clouds has so far been confined to coding the positions of a discrete set of points in space and the attributes of those discrete points. We introduce an alternative approach based on volumetric functions that are functions defined not just on a finite set of points but throughout space. As in regression analysis, volumetric functions are continuous functions that are able to interpolate values on a finite set of points as linear combinations of continuous basis functions. Using a B-spline wavelet basis, we are able to code volumetric functions representing both geometry and attributes. Geometry compression is addressed in Part II of this paper, while attribute compression is addressed in Part I. Attributes are represented by a volumetric function whose coefficients can be regarded as a critically sampled orthonormal transform that generalizes the recent successful Region-Adaptive Hierarchical (or Haar) Transform to higher orders. Experimental results show that attribute compression using higher order volumetric functions is an improvement over the first-order functions used in the emerging MPEG point cloud compression standard.

关键词： Three-dimensional displays Image coding Geometry Transforms Octrees Splines (mathematics) Hilbert space Bezier volumes B-splines wavelets point cloud compression color coding attribute coding multiresolution representations graph signal processing counting measure

来源：评论

学校读者我要写书评

暂无评论

Incremental value of color coding in 3D volume rendered CT images for interpretation of complex cardiothoracic vascular malformations

引用

INTERNATIONAL JOURNAL OF CARDIOLOGY 2013年第5期168卷 4692-4698页

作者： Saremi, Farhood Bai, Chester Saremi, Arvin Young, Cen Garon, Bonnie Lee, Chris Hassani, Cameron Ihde, Lauren Univ So Calif Dept Radiol Image Proc Lab Los Angeles CA 90033 USA

Objectives: To evaluate the benefit of color coding of CT angiography images for the assessment of complex cardiovascular malformations by comparing the quality of 3D (dimensional) volume rendered (VR) images before and after vessel color coding. Methods: Cardiothoracic CT images of 34 patients with complex vascular malformations were retrospectively selected for post processing. 3D VR images were created without and after color coding of the target vessels. Source images as well as selected 3D VR images without and with color coding were reviewed independently by 4 observers and scores were recorded on a 4-point scale for overall image quality, visualization conspicuity of target vessels, and final interpretation of target structures. Results: Overall diagnostic advantages of color coded VR images compared with non-color coded VR images included;improved visualization of the anatomical course of vessels, improved visualization of the extent of abnormality, better understanding of the spatial relationship of structures (i.e. to right ventricle outflow tract), and improved overall quality of the images. For all comparisons the color coded score was statistically significantly better than the non-color coded score (p < 0.0001). A trend showed that review speed was faster for color coded images (p = 0.06). Good inter-observer agreement was achieved for the target conspicuity and final interpretation scores with weighted Kappa score of 0.66 (95% CI: 0.54, 0.79) and 0.71 (95% CI: 0.60, 0.81) respectively. Conclusion: color coded 3D VR images can optimize visualization of vascular structures and improve interpretation of complex vascular malformation in cardiothoracic CT studies. Published by Elsevier Ireland Ltd.

关键词： Ct angiography color coding Post processing Coronary CT

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：