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

EURASIP JOURNAL ON IMAGE AND VIDEO PROCESSING 2010年第1期2010卷 175203-175203页

作者： Chen, Shaohua Beghdadi, Azeddine Univ Paris 13 Lab L2TI Inst Galilee F-93430 Villetaneuse France

A new algorithm of Natural Enhancement of Color Image (NECI) is proposed. It is inspired by multiscale Retinex model. There are four steps to realize this enhancement. At first, the image appearance is rendered by content-dependent global mapping for light cast correction, and then a modified Retinex filter is applied to enhance the local contrast. Histogram rescaling is used afterwards for normalization purpose. At last, the texture details of image are enhanced by emphasizing the high-frequency components of image using multichannel decomposition of Cortex Transform. In the contrast enhancement step, luminance channel is firstly enhanced, and then a weighing map is calculated by collecting luminance enhancement information and applied to chrominance channel in color space CIELCh which enables a proportional enhancement of chrominance. It avoids the problem of unbalanced enhancement in classical RGB independent channel operation. In this work, it is believed that image enhancement should avoid dramatic modifications to image such as light condition changes, color temperature alteration, or additional artifacts introduced or amplified. Disregarding light conditions of the scene usually leads to unnaturally sharpened images or dramatic white balance changes. In the proposed method, the ambience of image (warm or cold color impression) is maintained after enhancement, and no additional light sources are added to the scene, and no halo effect and blocking effect are amplified due to overenhancement. It realizes a Natural Enhancement of Color Image. Different types of natural scene images have been tested and an encouraging performance is obtained for the proposed method.

关键词： IMAGE processing COMPUTER algorithms IMAGE analysis COMPARATIVE studies TEMPERATURE LOGARITHMS coding theory

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to “Toric codes and finite geometries” [Finite Fields Appl. 45 (2017) 203–216]

引用

Finite Fields and Their Applications 2017年 48卷 447-448页

作者： John B. Little Department of Mathematics and Computer Science College of the Holy Cross Worcester MA 01610 United States

This correction adds a necessary hypothesis in Proposition 2.4 of [1] . A counterexample to the previous version was pointed out to the author by Melda Görür and the author thanks her for bringing that to his attention. Theorem 3.2 and Corollary 3.3 are also reformulated so they do not refer to the new, more restricted Proposition 2.4.

关键词： primary 94B27 secondary 51C05 coding theory Finite geometry Ring geometry

来源：评论

学校读者我要写书评

暂无评论

Crossed product codes

引用

JOURNAL OF ALGEBRA AND ITS APPLICATIONS 2024年第8期23卷 2550045-2550045页

作者： Duarte, A. Pereira, A. Milies, C. Polcino Univ Sao Paulo Inst Matemaat & Estatadst Caixa Postal 66281 BR-05315970 Sao Paulo Brazil Univ Fed Rural Rio Janeiro BR-23890000 Seropedica RJ Brazil

Bernal et al. provided a necessary and sufficient condition for a linear code to be realized as an ideal in a finite group algebra and De La Cruz and Willems proved a similar result for ideals in twisted group algebras. In this paper, we extend this characterization to crossed products. Furthermore, we determine conditions for some crossed product codes to be self-dual.

关键词： Crossed product coding theory duality

来源：评论

学校读者我要写书评

暂无评论

CONSTRUCTION OF LINEAR CODES HAVING PRESCRIBED PRIMAL-DUAL MINIMUM DISTANCE WITH APPLICATIONS IN CRYPTOGRAPHY

引用

Albanian Journal of Mathematics 2008年第3期2卷 221-227页

作者： Axel Kohnert

A method is given for the construction of linear codes with prescribed minimum distance and also prescribed minimum distance of the dual code. This works for codes over arbitrary finite fields. In the case of binary codes Matsumoto et al. showed how such codes can be used to construct cryptographic Boolean functions. This new method allows to compute new bounds on the size of such codes, extending the table of Matsumoto et al..

关键词： boolean function coding theory dual minimum distance minimum distance

来源：评论

学校读者我要写书评

暂无评论

Introducing...Cwatsets!

引用

Mathematics Magazine 1994年第2期67卷 109-117页

作者： Sherman, Gary J. Wattenberg, Martin

Click to increase image sizeClick to decrease image size

关键词： Automorphisms coding theory Addition Confidence interval Mathematical notation Combinatorial permutations Equivalence relation Mathematical sets

来源：评论

学校读者我要写书评

暂无评论

Recurrent coding Sequence Variation Explains Only A Small Fraction of the Genetic Architecture of Colorectal Cancer

引用

SCIENTIFIC REPORTS 2015年第1期5卷 16286-16286页

作者： Timofeeva, Maria N. Ben Kinnersley Farrington, Susan M. Whiffin, Nicola Palles, Claire Svinti, Victoria Lloyd, Amy Gorman, Maggie Ooi, Li-Yin Hosking, Fay Barclay, Ella Zgaga, Lina Dobbins, Sara Martin, Lynn Theodoratou, Evropi Broderick, Peter Tenesa, Albert Smillie, Claire Grimes, Graeme Hayward, Caroline Campbell, Archie Porteous, David Deary, Ian J. Harris, Sarah E. Northwood, Emma L. Barrett, Jennifer H. Smith, Gillian Wolf, Roland Forman, David Morreau, Hans Ruano, Dina Tops, Carli Wijnen, Juul Schrumpf, Melanie Boot, Arnoud Vasen, Hans F. A. Hes, Frederik J. van Wezel, Tom Franke, Andre Lieb, Wolgang Schafmayer, Clemens Hampe, Jochen Buch, Stephan Propping, Peter Hemminki, Kari Foersti, Asta Westers, Helga Hofstra, Robert Pinheiro, Manuela Pinto, Carla Teixeira, Manuel Ruiz-Ponte, Clara Fernandez-Rozadilla, Ceres Carracedo, Angel Castells, Antoni Castellvi-Bel, Sergi Campbell, Harry Bishop, D. Timothy Tomlinson, Ian P. M. Dunlop, Malcolm G. Houlston, Richard S. Univ Edinburgh Inst Genet & Mol Med Colon Canc Genet Grp Edinburgh EH4 2XU Midlothian Scotland Western Gen Hosp MRC Human Genet Unit Edinburgh EH4 2XU Midlothian Scotland Inst Canc Res Div Genet & Epidemiol Sutton SM2 5NG Surrey England Univ Oxford Wellcome Trust Ctr Human Genet Oxford OX3 7BN England Univ Edinburgh Ctr Populat Hlth Sci Edinburgh EH8 9AG Midlothian Scotland Univ Edinburgh Roslin Inst Roslin EH25 9RG Midlothian Scotland Univ Edinburgh Inst Genet & Mol Med Edinburgh EH4 2XU Midlothian Scotland Univ Edinburgh Western Gen Hosp Edinburgh Inst Genet & Mol Med Generat Scotland Edinburgh EH4 2XU Midlothian Scotland Univ Edinburgh Ctr Cognit Ageing & Cognit Epidemiol Dept Psychol Edinburgh EH8 9JZ Midlothian Scotland Univ Leeds St Jamess Univ Hosp Leeds Inst Canc & Pathol Sect Epidemiol & Biostat Leeds W Yorkshire England Univ Dundee Med Res Inst Dundee Scotland IARC Canc Surveillance Unit Lyon France Leiden Univ Med Ctr Dept Pathol NL-2300 RA Leiden Netherlands Leiden Univ Med Ctr Dept Clin Genet NL-2300 RA Leiden Netherlands Leiden Univ Med Ctr Dept Human Genet NL-2300 RA Leiden Netherlands Leiden Univ Med Ctr Dept Gastroenterol NL-2300 RA Leiden Netherlands Univ Hosp Schleswig Holstein Inst Clin Mol Biol Kiel Germany Univ Kiel Inst Epidemiol Kiel Germany Univ Hosp Schleswig Holstein Dept Gen & Thorac Surg Kiel Germany Tech Univ Dresden Univ Hosp Dresden Dept Med 1 Dresden Germany Univ Hosp Bonn Inst Human Genet Bonn Germany German Canc Res Ctr Div Mol Genet Epidemiol D-69120 Heidelberg Germany Lund Univ Ctr Primary Hlth Care Res S-20502 Malmo Sweden Univ Groningen Univ Med Ctr Groningen Dept Genet NL-9700 RB Groningen Netherlands Erasmus MC Dept Clin Genet NL-3015 GE Rotterdam Netherlands Univ Porto Portuguese Oncol Inst Dept Genet P-4100 Porto Portugal Univ Porto Biomed Sci Inst ICBAS P-4100 Porto Portugal Univ Santiago de Compostela Hosp Clin Genom Med Grp FPGMXCIBERER Santiago De Compostela 15

Whilst common genetic variation in many non-coding genomic regulatory regions are known to impart risk of colorectal cancer (CRC), much of the heritability of CRC remains unexplained. To examine the role of recurrent coding sequence variation in CRC aetiology, we genotyped 12,638 CRCs cases and 29,045 controls from six European populations. Single-variant analysis identified a coding variant (rs3184504) in SH2B3 (12q24) associated with CRC risk (OR = 1.08, P = 3.9 x 10(-7)), and novel damaging coding variants in 3 genes previously tagged by GWAS efforts;rs16888728 (8q24) in UTP23 (OR = 1.15, P = 1.4 x 10(-7));rs6580742 and rs12303082 (12q13) in FAM186A (OR = 1.11, P = 1.2 x 10(-7) and OR = 1.09, P = 7.4 x 10(-8));rs1129406 (12q13) in ATF1 (OR = 1.11, P = 8.3 x 10(-9)), all reaching exome-wide significance levels. Gene based tests identified associations between CRC and PCDHGA genes (P < 2.90 x 10(-6)). We found an excess of rare, damaging variants in base-excision (P = 2.4 x 10(-4)) and DNA mismatch repair genes (P = 6.1 x 10(-4)) consistent with a recessive mode of inheritance. This study comprehensively explores the contribution of coding sequence variation to CRC risk, identifying associations with coding variation in 4 genes and PCDHG gene cluster and several candidate recessive alleles. However, these findings suggest that recurrent, low-frequency coding variants account for a minority of the unexplained heritability of CRC.

关键词： coding theory COLON cancer HERITABILITY (Genetics) POPULATION GENES EUROPE

来源：评论

学校读者我要写书评

暂无评论

Homomorphisms Preserving Types of Density

引用

ACTA CYBERNETICA 2009年第2期19卷 499-516页

作者： Jurgensen, Helmut MeQuillan, Ian Univ Western Ontario Dept Comp Sci London ON N6A 5B7 Canada Univ Saskatchewan Dept Comp Sci Saskatoon SK S7N 5A9 Canada

The concept of density in a free monoid can be generalized from the infix relation to arbitrary relations. Many of the properties known for density can be established over these more general notions of densities. In this paper, we investigate homomorphisms which preserve different types of density. We demonstrate a strict hierarchy between families of homomorphisms which preserve density over different types of relations. However, as with the case of endomorphisms, a similar hierarchy for weak-coding homomorphisms collapses. We also present an algorithm to decide whether a homomorphism preserves density over any relation which satisfies some natural conditions.

关键词： density homomorphisms coding theory formal language theory

来源：评论

学校读者我要写书评

暂无评论

A coding computation scheme for secure aggregation

引用

JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES 2024年第5期36卷

作者： Yang, Ze Tian, Youliang Guizhou Univ Coll Comp Sci & Technol State Key Lab Publ Big Data Guiyang 550025 Peoples R China Guizhou Univ Guizhou Prov Key Lab Cryptog & Blockchain Technol Guiyang 550025 Peoples R China

Data aggregation involves the integration of relevant data generated across platforms and devices, leveraging the potential value of sensory data. However, in addition to security and efficiency, which are the basic requirements for data aggregation involving private data, how to achieve fault tolerance and interference of aggregation in real computing networks is imminent and is the main contribution of this paper. In this paper, we propose a secure aggregation framework involving multiple servers based on coding theory, which is not only robust to clients dropping out and tolerant to partial server withdrawal but also resistant to malicious computation by servers and forgery attacks by adversaries. In particular, the proposed protocol employs the Chinese Residual Theorem (CRT) to encode private data and constructs Lagrange interpolation polynomials to perform aggregation, which achieves lightweight privacy preservation while achieving robust, verifiable and secure aggregation goals.

关键词： Data aggregation coding theory Chinese Residual Theorem (CRT) Privacy preservation

来源：评论

学校读者我要写书评

暂无评论

Automated Generation of Custom Processor Core from C Code

引用

JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING 2012年第unknown期2012卷 1-26页

作者： Trajkovic, Jelena Abdi, Samar Nicolescu, Gabriela Gajski, Daniel D. Univ Calif Irvine Ctr Embedded Comp Syst Irvine CA 92697 USA Ecole Polytech Montreal PQ H3C 3A7 Canada Concordia Univ Elect & Comp Engn Dept Montreal PQ H4B 1R6 Canada

We present a method for construction of application-specific processor cores from a given C code. Our approach consists of three phases. We start by quantifying the properties of the C code in terms of operation types, available parallelism, and other metrics. We then create an initial data path to exploit the available parallelism. We then apply designer-guided constraints to an interactive data path refinement algorithm that attempts to reduce the number of the most expensive components while meeting the constraints. Our experimental results show that our technique scales very well with the size of the C code. We demonstrate the efficiency of our technique on wide range of applications, from standard academic benchmarks to industrial size examples like the MP3 decoder. Each processor core was constructed and refined in under a minute, allowing the designer to explore several different configurations in much less time than needed for manual design. We compared our selection algorithm to the manual selection in terms of cost/performance and showed that our optimization technique achieves better cost/performance trade-off. We also synthesized our designs with programmable controller and, on average, the refined core have only 23% latency overhead, twice as many block RAMs and 36% fewer slices compared to the respective manual designs.

关键词： PROGRAMMING languages (Electronic computers) AUTOMATION coding theory APPLICATION software CONSTRAINT satisfaction (Artificial intelligence) DATA analysis COMPUTER algorithms PERFORMANCE evaluation

来源：评论

学校读者我要写书评

暂无评论

On the lower bound for the length of minimal codes

引用

DISCRETE MATHEMATICS 2024年第1期347卷

作者： Scotti, Martin Univ Sorbonne Paris Nord Univ Paris 8 Lab Geometrie Anal & Applicat LAGA CNRSUMR 7539 Villetaneuse France

In recent years, many connections have been made between minimal codes, a classical object in coding theory, and other remarkable structures in finite geometry and combinatorics. One of the main problems related to minimal codes is to give lower and upper bounds on the length m(k, q) of the shortest minimal codes of a given dimension k over the finite field F-q. It has been recently proved that m(k, q) >= (q + 1)(k - 1).In this note, we prove that lim inf(k ->infinity) m(k,q)/k >= (q + epsilon(q)), where epsilon is an increasing function such that 1.52 < epsilon(2) <= epsilon(q) <= root 2 + 1/2. Hence, the previously known lower bound is not tight for large enough k. We then focus on the binary case and prove some structural results on minimal codes of length 3(k - 1). As a byproduct, we are able to show that, if k = 5 (mod 8) and for other small values of k, the bound is not tight.(c) 2023 Elsevier B.V. All rights reserved.

关键词： Minimal codes Strong blocking sets coding theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：