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

A novel color image encryption algorithm based on genetic recombination and the four-dimensional memristive hyperchaotic system

引用

Chinese Physics B 2016年第10期25卷 76-88页

作者：柴秀丽甘志华路杨张苗辉陈怡然 School of Computer and Information Engineering Institute of Image Processing and Pattern Recognition Henan University Department of Electrical and Computer Engineering University of Pittsburgh School of Software Henan University Research Department Henan University

Recently, many image encryption algorithms based on chaos have been proposed. Most of the previous algorithms encrypt components R, G, and B of color images independently and neglect the high correlation between them. In the paper, a novel color image encryption algorithm is introduced. The 24 bit planes of components R, G, and B of the color plain image are obtained and recombined into 4 compound bit planes, and this can make the three components affect each other. A four-dimensional(4D) memristive hyperchaotic system generates the pseudorandom key streams and its initial values come from the SHA 256 hash value of the color plain image. The compound bit planes and key streams are confused according to the principles of genetic recombination, then confusion and diffusion as a union are applied to the bit planes,and the color cipher image is obtained. Experimental results and security analyses demonstrate that the proposed algorithm is secure and effective so that it may be adopted for secure communication.

关键词： genetic recombination memristive hyperchaotic system color image encryption confusion diffusion

来源：评论

学校读者我要写书评

暂无评论

Shape classification according to LBP persistence of critical points 19th

Shape classification according to LBP persistence of critica...

引用

19th IAPR International Conference on Discrete Geometry for Computer imagery, DGCI 2016

作者： Janusch, Ines Kropatsch, Walter G. Pattern Recognition and Image Processing Group Institute of Computer Graphics and Algorithms TU Wien Vienna Austria

ISBN: (纸本)9783319323596

This paper introduces a shape descriptor based on a combination of topological image analysis and texture information. Critical points of a shape’s skeleton are determined first. The shape is described according to persistence of the local topology at these critical points over a range of scales. The local topology over scale-space is derived using the local binary pattern texture operator with varying radii. To visualise the descriptor, a new type of persistence graph is defined which captures the evolution, respectively persistence, of the local topology. The presented shape descriptor may be used in shape classification or the grouping of shapes into equivalence classes. Classification experiments were conducted for a binary image dataset and the promising results are presented. Because of the use of persistence, the influence of noise or irregular shape boundaries (e.g. due to segmentation artefacts) on the result of such a classification or grouping is bounded. © Springer International Publishing Switzerland 2016.

关键词： Local binary pattern

来源：评论

学校读者我要写书评

暂无评论

Semantic channels for fast pedestrian detection

Semantic channels for fast pedestrian detection

引用

2016 IEEE Conference on Computer Vision and pattern recognition, CVPR 2016

作者： Costea, Arthur Daniel Nedevschi, Sergiu Image Processing and Pattern Recognition Research Center Technical University of Cluj-Napoca Romania

ISBN: (纸本)9781467388511

Pedestrian detection and semantic segmentation are high potential tasks for many real-time applications. However most of the top performing approaches provide state of art results at high computational costs. In this work we propose a fast solution for achieving state of art results for both pedestrian detection and semantic segmentation. As baseline for pedestrian detection we use sliding windows over cost efficient multiresolution filtered LUV+HOG channels. We use the same channels for classifying pixels into eight semantic classes. Using short range and long range multiresolution channel features we achieve more robust segmentation results compared to traditional codebook based approaches at much lower computational costs. The resulting segmentations are used as additional semantic channels in order to achieve a more powerful pedestrian detector. To also achieve fast pedestrian detection we employ a multiscale detection scheme based on a single flexible pedestrian model and a single image scale. The proposed solution provides competitive results on both pedestrian detection and semantic segmentation benchmarks at 8 FPS on CPU and at 15 FPS on GPU, being the fastest top performing approach.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Real-time multi-resolution digital elevation map creation using the sensor model of a stereovision sensor

Real-time multi-resolution digital elevation map creation us...

引用

International Conference on Intelligent Transportation

作者： Szilárd Mandici Sergiu Nedevschi Image Processing and Pattern Recognition Research Group Technical University of Cluj-Napoca Romania

ISBN: (纸本)9781509018901

This paper presents an approach for constructing high quality Digital Elevation Maps (DEMs) from dense stereo data. As opposed to classical DEM creation algorithms, the proposed solution uses the sensor models of the stereovision sensor to correct the raw data. The direct and inverse sensor models are found from experiments. The algorithm decomposes the 2D cells containing vertical objects or object boundaries in order to model the objects more precisely. The approach distinguishes between 2 types of cells: cells containing horizontal and vertical objects. For the vertical object cells, connected components in the histogram of heights are found while in the horizontal object cells, the most representative height is determined using a mode-seeking approach similar to mean shift. The 3D reconstructed points are assigned to the cells around it by considering the probability of correspondence based on the 2D Gaussian component of the direct sensor model. In order to eliminate the noise, a similarity measure is computed between each 3D point and cell based on the calculated DEM cell descriptor and is discarded if the similarity score is smaller than a predefined threshold. The algorithm is implemented on the GPU in order to achieve a real-time execution speed and it is evaluated extensively in comparison with other DEM creation algorithms using the latest KITTI stereo benchmark data. The obtained DEM is denser, more accurate and the object boundaries are modeled more precisely.

关键词： Three-dimensional displays Robot sensing systems image reconstruction Two dimensional displays Histograms Solid modeling Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Semantic Channels for Fast Pedestrian Detection

Semantic Channels for Fast Pedestrian Detection

引用

IEEE Conference on Computer Vision and pattern recognition

作者： Arthur Daniel Costea Sergiu Nedevschi Image Processing and Pattern Recognition Research Center Technical University of Cluj-Napoca

ISBN: (纸本)9781467388528

关键词： Pedestrians Semantics Arts image scale short-distance central processing units segmentation Segmentation FES gene

来源：评论

学校读者我要写书评

暂无评论

Correction to: Internet gaming disorder: deficits in functional and structural connectivity in the ventral tegmental area-Accumbens pathway

引用

Brain imaging and behavior 2019年第4期13卷 1182页

作者： Ruonan Wang Min Li Meng Zhao Dahua Yu Yu Hu Corinde E Wiers Gene-Jack Wang Nora D Volkow Kai Yuan School of Life Science and Technology Xidian University Xi'an Shaanxi 710071 People's Republic of China. Engineering Research Center of Molecular and Neuro Imaging Ministry of Education Xi'an People's Republic of China. Inner Mongolia Key Laboratory of Pattern Recognition and Intelligent Image Processing School of Information Engineering Inner Mongolia University of Science and Technology Baotou Inner Mongolia 014010 People's Republic of China. National Institute on Alcoholism and Alcohol Abuse National Institutes of Health Bethesda MD 20892 USA. National Institute on Drug Abuse National Institutes of Health Bethesda MD 20892 USA. School of Life Science and Technology Xidian University Xi'an Shaanxi 710071 People's Republic of China. kyuan@***. Engineering Research Center of Molecular and Neuro Imaging Ministry of Education Xi'an People's Republic of China. kyuan@***. Inner Mongolia Key Laboratory of Pattern Recognition and Intelligent Image Processing School of Information Engineering Inner Mongolia University of Science and Technology Baotou Inner Mongolia 014010 People's Republic of China. kyuan@***. National Institute on Alcoholism and Alcohol Abuse National Institutes of Health Bethesda MD 20892 USA. kyuan@***. Guangxi Key Laboratory of Multi-Source Information Mining and Security Guangxi Normal University Guilin People's Republic of China. kyuan@***.

The original version of this article contained mistakes, and the authors would like to correct them. The correct details are given below.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Data graph formulation as the minimum-weight maximum-entropy problem 10

Data graph formulation as the minimum-weight maximum-entropy...

引用

10th IAPR-TC-15 International Workshop on Graph-Based Representations in pattern recognition, GbRPR 2015

作者： De Sousa, Samuel Kropatsch, Walter G. Pattern Recognition and Image Processing Group Vienna University of Technology Vienna Austria

ISBN: (纸本)9783319182230

Consider a point-set coming from an object which was sampled using a digital sensor (depth range, camera, etc). We are interested in finding a graph that would represent that point-set according to some properties. Such a representation would allow us to match two objects (graphs) by exploiting topological properties instead of solely relying on geometrical properties. The Delaunay triangulation is a common out off-the-shelf strategy to triangulate a point-set and it is used by many researchers as the standard way to create the so called data-graph and despite its positive properties, there are also some drawbacks. We are interested in generating a graph with the following properties: the graph is (i) as unique as possible, (ii) and as discriminative as possible regarding the degree distribution. We pose a combinatorial optimization problem (Min-Weight Max-Entropy Problem) to build such a graph by minimizing the total weight cost of the edges and at the same time maximizing the entropy of the degree distribution. Our optimization approach is based on Dynamic Programming (DP) and yields a polynomial time algorithm. © Springer International Publishing Switzerland 2015.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

A real-time algorithm for train position monitoring using optical time-domain reflectometry

A real-time algorithm for train position monitoring using op...

引用

IEEE International Conference on Intelligent Rail Transportation (ICIRT)

作者： Adam Papp Christoph Wiesmeyr Martin Litzenberger Heinrich Garn Walter Kropatsch Digital Safety and Security Department Austrian Institute of Technology GmbH Vienna Austria Pattern Recognition and Image Processing group Vienna University of Technology Vienna Austria

ISBN: (纸本)9781509015566

We propose an algorithm which uses an optical time-domain reflectometer (OTDR) for real-time tracking of trains. OTDR sensing, often also termed distributed acoustical sensing (DAS), measures the Rayleigh backscattering of a light pulse along an optical fiber. The resulting signal provides information on local acoustic pressure at linearly spaced positions along the fiber. While different approaches for train tracking with DAS are described in the literature, the results have been evaluated only for short time recordings with few train crossings. In this paper we provide details on the tracking performance of a novel algorithm that finds and tracks trains over 15km. Furthermore, this is the first contribution that uses ground truth data to assess the performance of the method. For the evaluation two one hour recordings are used.

关键词： Monitoring Vibrations Optical fibers Sensors Backscatter Rail transportation Time measurement

来源：评论

学校读者我要写书评

暂无评论

Reeb graphs through local binary patterns 10

Reeb graphs through local binary patterns

引用

10th IAPR-TC-15 International Workshop on Graph-Based Representations in pattern recognition, GbRPR 2015

作者： Janusch, Ines Kropatsch, Walter G. Pattern Recognition and Image Processing Group Institute of Computer Graphics and Algorithms Vienna University of Technology Vienna Austria

ISBN: (纸本)9783319182230

This paper presents an approach to derive critical points of a shape, the basis of a Reeb graph, using a combination of a medial axis skeleton and features along this skeleton. A Reeb graph captures the topology of a shape. The nodes in the graph represent critical points (positions of change in the topology), while edges represent topological persistence. We present an approach to compute such critical points using Local Binary patterns. For one pixel the Local Binary pattern feature vector is derived comparing this pixel to its neighbouring pixels in an environment of a certain radius. We start with an initial segmentation and a medial axis representation. Along this axis critical points are computed using Local Binary patterns with the radius, defining the neighbouring pixels, set a bit larger than the radius according to the medial axis transformation. Critical points obtained in this way form the node set in a Reeb graph, edges are given through the connectivity of the skeleton. This approach aims at improving the representation of flawed segmented data. In the same way segmentation artefacts, as for example single pixels representing noise, may be corrected based on this analysis. © Springer International Publishing Switzerland 2015.

关键词： image segmentation

来源：评论

学校读者我要写书评

暂无评论

OUGENE： a disease associated over-expressed and under-expressed gene database

引用

Science Bulletin 2016年第10期61卷 752-754页

作者： Xiaoyong Pan Hong-Bin Shen Section for Animal Genetics Bioinformatics and Breeding Center for Non-Coding RNA in Technology and Health University of Copenhagen 1870 Frederiksberg Denmark Department of Disease Systems Biology Novo NordiskFoundation Center for Protein Research University ofCopenhagen 1870 Frederiksberg Denmark Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University and Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai 200240 China

Gene over-expression or under-expression is closely associated with human diseases, which contributes to phenotypic variations and diversity. To our best knowledge, there is no single open specific resource available to provide the association information between gene over- or under-expression and various diseases. In this study, we presented a comprehensive disease-associated over- and under-expressed gene database （OUGene） based on our proposed text mining pipeline and several open curated databases. It contains total 41,269 unique associa- tions between 7,238 over- or under-expressed genes and 1,480 diseases, which are supported by 81,974 evidence sentences from 56,442 articles. The OUGene is compre- hensive and covers most important therapeutic areas. Meanwhile a new scoring system is designed to rank the associations based on benchmarking against hand-curated data. OUGene provides an easy-of-use web interface for researchers to analyze these data and visualize the associ- ated networks, which can give insights to the complex relationships between over- and under-expressed genes and diseases at a system level. It is available at ***. ***/bioinf/OUGene/.

关键词： Text mining Gene over- and under-expression Disease Database

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：