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

Quantifying Systemic Evolutionary Changes by color coding Confidence-Scored PPI Networks

9th International Workshop on Algorithms in Bioinformatics (WABI 2009)

作者： Dao, Phuong Schoenhuth, Alexander Hormozdiari, Fereydoun Hajirasouliha, Iman Sahinalp, S. Cenk Ester, Martin Simon Fraser Univ Sch Comp Sci Burnaby BC V5A 1S6 Canada

ISBN: (纸本)9783642042409

A current major challenge in systems biology is to compute statistics on biomolecular network motifs, since this can reveal significant systemic differences between organisms. We extend the "color coding" technique to weighted edge networks and apply it to PPI networks where edges are weighted by probabilistic confidence scores, as provided by the STRING database. This is a substantial improvement over the previously available studies on, still heavily noisy, binary-edge-weight data. Following up on such a study, we compute the expected number of occurrences of non-induced subtrees with k <= 9 vertices. Beyond the previously reported differences between unicellular and multicellular organisms, we reveal major differences between prokaryotes and unicellular eukaryotes. This establishes, for the first time on a statistically sound data basis, that evolutionary distance can be monitored in terms of elevated systemic arrangements.

关键词： Biomolecular Network Motifs color coding Evolutionary Systems Biology Protein-Protein Interaction Networks

来源：评论

学校读者我要写书评

暂无评论

A circular-viewing color coding rainbow holography

A circular-viewing color coding rainbow holography

引用

International Conference on Holography and Optical Information Processing (ICHOIP 96)

作者： Pei, M Zhang, ZQ Ge, HW Image Technology Development Huazhong University of Science and Technology Wuhan Hubei 430074 China

A circular-viewing color-coding rainbow holography with a group of circular coding slits Is presented, in which the color coding holographic image can be observed around a 360 degrees viewing circle, and no particular... 详细信息

ISBN: (纸本)0819422622

关键词： rainbow holography circular-viewing color coding circular slit

来源：评论

学校读者我要写书评

暂无评论

Optimal color coding for compression of true color images

Optimal color coding for compression of true color images

引用

Conference on Mathematics of Data/Image coding, Compression, and Encryption

作者： Musatenko, YS Kurashov, VN Kyiv Univ Radio Phys Dept Opt Informat Proc Lab Kyiv Ukraine

ISBN: (纸本)0819429112

In the paper we present the method that improves lossy compression of the true color or other multispectral images. The essence of the method is to project initial color planes into Karhunen-Loeve (KL) basis that gives completely decorrelated representation for the image and to compress basis functions instead of the planes. To do that the new fast algorithm of true KL basis construction with low memory consumption is suggested and our recently proposed scheme for finding optimal losses of KL functions while compression is used. Compare to standard JPEG compression of the CMYK images the method provides the PSNR gain from 0.2 to 2 dB for the convenient compression ratios. Experimental results are obtained for high resolution CMYK images. It is demonstrated that presented scheme could work on common hardware.

关键词： image compression color coding Karhunen-Loeve transform

来源：评论

学校读者我要写书评

暂无评论

Investigating the Effectiveness of color coding in Multimodal Medical Imaging 35

Investigating the Effectiveness of Color Coding in Multimoda...

引用

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

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

ISBN: (数字)9781665467704

ISBN: (纸本)9781665467704

In medical imaging, images represent the quantification of the interaction between electromagnetic waves and our body and are represented in grey-scale. In addition, medical imaging often produces multimodal images. However, the analysis and interpretation of these images mostly occur in sequence or, as in the case of automatic tools, they are simply concatenated as independent sources of information. In both cases, color perception and color contrast are not exploited. color perception and color contrast play a crucial role in human vision to recognize objects effectively and efficiently, and this can in principle extend to automatic systems. In this paper we show how color coding, particularly using color opponent models, can become an effective tool for preliminary color-based segmentation. Tests have been conducted on multimodal Magnetic Resonance Imaging (MRI) of the brain collected in a public database and the results obtained show the importance of color coding in medical imaging analysis.

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

来源：评论

学校读者我要写书评

暂无评论

To Increase Data Capacity of QR Code Using Multiplexing with color coding: An example of Embedding Speech Signal in QR Code 11

To Increase Data Capacity of QR Code Using Multiplexing with...

引用

11th Annual IEEE India Conference (INDICON)

作者： Galiyawala, Hiren J. Pandya, Kinjal H. CGPIT Dept E&C Bardoli Gujarat India

ISBN: (纸本)9781479953646

QR codes have become widely popular along with the increased usage and popularity of smart phones. In many areas, QR codes have overtaken the place of linear barcodes because of the obvious advantage of large data capacity and ease of data retrieval. QR code specifications offers many more advantages like reduced space, durability against soil and damage, high data capacity, supported languages are more than other barcodes, supports 360 degree reading, etc over linear barcodes which makes QR codes worth opting. The structural flexibility of QR code architecture opens many more possibilities to stretch the limits of data capacity further away which includes data hiding techniques, multiplexing techniques, use of color QR codes, use of data compression techniques, etc. Proposed technique attempts to increase data capacity by multiplexing several QR codes and generating a color QR code. Experimental results show that this technique offers increase of the data capacity upto 24 times as compared to a standard QR code of same size. To get quicker results while demultiplexing, multiplexing of 12 or less QR codes is advisable with proposed technique. Due to such large capacity offered by proposed technique, embedding of speech signal into a QR code has made possible.

关键词： QR code image multiplexing color coding data capacity enhancement embedding speech in QR code

来源：评论

学校读者我要写书评

暂无评论

"color coding" and Support for Social Policy Spending: Assessing the Parameters among Whites

引用

ANNALS OF THE AMERICAN ACADEMY OF POLITICAL AND SOCIAL SCIENCE 2011年第1期634卷 174-189页

作者： Wilson, George Nielsen, Amie L. Univ Miami Dept Sociol Coral Gables FL 33124 USA

This study uses data from the 1996 through 2002 General Social Survey to examine whether one variant of modern racial prejudice-"color coding"-explains support for several ostensibly nonracial government spending policies regarding crime, urban problems, and drug addiction (welfare and race spending are used as baseline measures). Findings indicate that color coding does not extend appreciably beyond its established focus of welfare and race and operates along a continuum with welfare and race at one end (heavily influenced by prejudice), addiction spending and urban spending at the other end (not influenced by prejudice), and crime spending situated in the middle (moderately influenced by prejudice). Possible causes of the continuum, as well as emerging aspects of the color coding phenomenon- specifically, its possible bidirectional effects and its subordination to political party affiliation in explanatory value-are discussed. Directions for future research that would shed additional light on the color coding phenomenon are also discussed.

关键词： color coding racial prejudice spending policy attitudes

来源：评论

学校读者我要写书评

暂无评论

On the Descriptive Complexity of color coding 36

On the Descriptive Complexity of Color Coding

引用

36th International Symposium on Theoretical Aspects of Computer Science (STACS)

作者： Bannach, Max Tantau, Till Univ Lubeck Inst Theoret Comp Sci Lubeck Germany

ISBN: (纸本)9783959771009

color coding is an algorithmic technique used in parameterized complexity theory to detect "small" structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable, small color pattern. We transfer color coding to the world of descriptive complexity theory by characterizing - purely in terms of the syntactic structure of describing formulas - when the powerful second-order quantifiers representing a random coloring can be replaced by equivalent, simple first-order formulas. Building on this result, we identify syntactic properties of first-order quantifiers that can be eliminated from formulas describing parameterized problems. The result applies to many packing and embedding problems, but also to the long path problem. Together with a new result on the parameterized complexity of formula families involving only a fixed number of variables, we get that many problems lie in fpt just because of the way they are commonly described using logical formulas.

关键词： color coding descriptive complexity fixed-parameter tractability quantifier elimination para-AC(0)

来源：评论

学校读者我要写书评

暂无评论

Efficient Implementation of color coding Algorithm for Subgraph Isomorphism Problem 1

引用

Conference on Analysis of Experimental Algorithms (SEA2)

作者： Malik, Josef Suchy, Ondrej Valla, Tomas Czech Tech Univ Fac Informat Technol Dept Theoret Comp Sci Prague Czech Republic

ISBN: (数字)9783030340292

ISBN: (纸本)9783030340292;9783030340285

We consider the subgraph isomorphism problem where, given two graphs G (source graph) and F (pattern graph), one is to decide whether there is a (not necessarily induced) subgraph of G isomorphic to F. While many practical heuristic algorithms have been developed for the problem, as pointed out by McCreesh et al. [JAIR 2018], for each of them there are rather small instances which they cannot cope. Therefore, developing an alternative approach that could possibly cope with these hard instances would be of interest. A seminal paper by Alon, Yuster and Zwick [J. ACM 1995] introduced the color coding approach to solve the problem, where the main part is a dynamic programming over color subsets and partial mappings. As with many exponential-time dynamic programming algorithms, the memory requirements constitute the main limiting factor for its usage. Because these requirements grow exponentially with the treewidth of the pattern graph, all existing implementations based on the color coding principle restrict themselves to specific pattern graphs, e.g., paths or trees. In contrast, we provide an efficient implementation of the algorithm significantly reducing its memory requirements so that it can be used for pattern graphs of larger treewidth. Moreover, our implementation not only decides the existence of an isomorphic subgraph, but it also enumerates all such subgraphs (or given number of them). We provide an extensive experimental comparison of our implementation to other available solvers for the problem.

关键词： Subgraph isomorphism Subgraph enumeration color coding Tree decomposition Treewidth

来源：评论

学校读者我要写书评

暂无评论

Wavelet-based embedded zerotree extension to color coding 5

Wavelet-based embedded zerotree extension to color coding

引用

SPIE Conference on Wavelet Applications V

作者： Franques, VT USAF Res Lab Munit Directorate Eglin AFB FL 32542 USA

ISBN: (纸本)081942840X

Recently, a new image compression algorithm was developed which employs wavelet transform and a simple binary linear quantization scheme with an embedded coding technique to perform data compaction. This new family of coder, Embedded Zerotree Wavelet (EZW), provides a better compression performance than the current JPEG coding standard for low bit rates. Since The Embedded Zerotree Wavelet coding algorithm emerged, all of the published coding results related to this coding technique are on monochrome images. In this paper the author has enhanced the original coding algorithm to yield a better compression ratio [2], and has extended the wavelet-based zerotree coding to color images. color imagery is often represented by several components, such as RGB, in which each component is generally processed separately. With color coding, each component could be compressed individually in the same manner as a monochrome image, therefore requiring a threefold increase in processing rime. Most image coding standards employ de-correlated components, such as YlQ or Y, C-B, C-R, and subsampling of the 'chroma' components, such coding technique is employed here. Results of the coding, including reconstructed images and coding performance, will be presented.

关键词： embedded zerotree coding multi-resolution coding color coding image compression wavelets

来源：评论

学校读者我要写书评

暂无评论

A New Algorithm For CBIR Using Bi-Cubic Interpolation with color coding and Different Level of DWT 2

A New Algorithm For CBIR Using Bi-Cubic Interpolation with C...

引用

2nd International Conference on Computing, Communication, Control and Automation (ICCUBEA)

作者： Dixit, Nityanand Tiwari, Sandeep Kumar Sharma, Pankaj Dept CSE IT Gwalior MP India VITM Dept CSE IT Gwalior MP India

ISBN: (纸本)9781509032914

In this study, a new algorithm for Content Based Image Retrieval (CBIR) using bi-cubic interpolation (BCI) with color coding (CC) and different level of discrete wavelet transform (DWT). In this paper the techniques of CBIR are discussed, analyzed and compared. BCI is used to scale the query image and database images. CC is used for color feature extraction. Apply DWT on each level plane of an image for texture feature. Apply edge histogram (EH) on each plane of an image for shape features. The experimental database performed on Corel database which contain fruit, flowers, sports, tools, facial images. Apply Support vector matching (SVM) for classifying the data. The performance analysis of precision (P), execution time (T) for retrieved images. We calculate similarity distance on Euclidean distance (ED), Relative Deviation (RSD), CityBlock (CD) and Canberra distance.

关键词： CBIR DWT SVM color coding Bicubie Interpolation Precision Recall etc

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：