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

Multi-scale application of camera calibration in tourism service platforms

Journal of Information Hiding and Multimedia Signal Processing 2017年第4期8卷 929-936页

作者： Ding, Xintao Luo, Yonglong Cai, Guorong Zhang, Xiaobo School of Territorial Resources and Tourism Anhui Normal University No. 819 South Jiuhua Road Wuhu241002 China School of Mathematics and Computer Science Anhui Normal University No. 819 South Jiuhua Road Wuhu241002 China Computer Engineering College Jimei University No. 183 Yinjiang Road Xiamen China Institute of Graphics and Image Processing Xianyang Normal University No. 43 Wenlin Road Xianyang China

Full view panoramas are able to simulate tele-presence or virtual reality experience, thus panoramic technology is an important implementation approach for the visual expression of tourism service platforms (TSP). On one hand, camera calibration, which is generally implemented under a certain resolution, may be a necessary preprocessing stage for panoramic technology. On the other hand, multi-scale applications are potentially involved in TSP for visualization expression. Therefore, calibration parameters resulting in one scale should be extended to multi-scale applications, but the extension research on this topic is insufficient. In this paper, the relations of intrinsic and distortion calibration parameters under different scales were both presented. Then, based on these two claims, a multi-scale correction algorithm is proposed. After demonstration experiments, with the help of the algorithm, different scale panoramas were employed for visualization expression in TSP. The multi-scale application of camera calibration in TSP is beneficial to bring intuition feelings to tourists. © 2017, Ubiquitous International. All rights reserved.

关键词： Calibration

来源：评论

学校读者我要写书评

暂无评论

A Novel Reversible Ternary Embedding Algorithm Based on Modified Full Context Prediction Errors

A Novel Reversible Ternary Embedding Algorithm Based on Modi...

引用

2016 IEEE International Conference on Signal and image Processing

作者： Li Li Chin-Chen Chang K.Bharanitharan Yanjun Liu Institute of Computer Graphics and Image Processing Hangzhou Dianzi University Department of Information Engineering and Computer Science Feng Chia University The Australian National University ACT

We propose a high capacity reversible ternary embedding-watermarking algorithm based on a modification of full-context-prediction-errors(MFCPE) wherein the binary bit stream is converted to the ternary stream then error histogram shifting is utilized to embed the ternary *** the existing predictor methods, we provide a full context prediction with a modification of each pixel at most by 1, which significantly reduces *** results confirm that the proposed algorithm achieves high PSNR while providing a higher embedding ***, results indicate that MFCPE outperforms the existing methods in terms of payload and the watermarked image quality.

关键词： reversible watermarking ternary embedding histogram shifting full context prediction

来源：评论

学校读者我要写书评

暂无评论

An effective mobile visual searching algorithm based on the bag-of-words method for furniture images

引用

Journal of Information Hiding and Multimedia Signal Processing 2016年第4期7卷 754-770页

作者： Li, Li Zheng, Dejie Lu, Jianfeng Mao, Xiaoyang Chang, Chin-Chen Institute of Graphics and Image Hangzhou Dianzi University HangzhouZhejiang310018 China University of Yamanash Japan Department of Information Engineering and Computer Science Feng Chia University Taichung40724 Taiwan

With the popularity of smart phones nowadays, image retrieval on mobile devices has been applied on a wider scale. To balance the efficiency and performance, an image retrieval algorithm which consists of two matching steps is proposed for furniture images captured by mobile devices (named mobile images). In the first stage, similar images are quickly obtained by the rough matching algorithm based on the bag-of-words (BOW) method. In the second stage, the most similar image is selected from the selection of similar images using the fine matching algorithm based on ORiented Brief (ORB).There are four main contributions in this paper. Firstly, add a spatial relationship to BOW features, an image is divided into three circular parts: the inner, middle and outer parts. Secondly, a feature point extraction method on concentric circles is proposed, which are resistant to geometric attack. Thirdly, the Gabor local line-based feature (GALIF) descriptor is improved by changing the filter object from the line to areas and overcome its weakness of low efficiency and rotation-sensitivity. Finally, a new image signature matching strategy is proposed based on Euclidean distance and a scale invariant feature to improve matching accuracy. Experimental results on a database with thousands of images show that our algorithm can retrieve mobile images quickly and precisely. © 2016.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

A robust image copy detection method based on feature extraction algorithm

引用

Journal of Information Hiding and Multimedia Signal Processing 2016年第5期7卷 1136-1146页

作者： Lu, Jian Feng Xu, Xiao Yan Li, Li Chang, Chin-Chen Wang, Qiang Institute of Graphics and Image Hangzhou Dianzi University HangzhouZhejiang China Institute of Digital Media Hangzhou Dianzi University HangzhouZhejiang China Department of Information Engineering and Computer Science Feng Chia University Taichung Taiwan

Detecting copied versions of a query image is very important for copyright protection. This paper presents a robust copy detection method for images. The main contribution of our algorithm is to combine the image feature extraction and the saliency image segmentation methods, and a novel two steps approach is proposed for the image copy detection. Firstly, several salient regions in a query image are extracted based on salient region detection method and segmented into a series of partial images, with introduction of illumination variation to obtain a better saliency image. Secondly, surf key points in both partial images and images in database are extracted and the number of correctly matched key points is computed. Similarity value is computed to judge if two key points are correctly matched. Finally, if the number of correctly-matched key points is greater than the threshold value, the image from database is judged as a copy of the query image. The experimental results show that the proposed method can detect copyright information of query image even when the image is cropped, rotated, put in picture, water-colored, changed in contrast, blurred or inserted with words. © 2016, Ubiquitous International. All Rights Reserved.

关键词： image segmentation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Web-Based Tool for Semi-Automated Segmentation of Histopathological images Using Nonlinear Color Classifiers

A Web-Based Tool for Semi-Automated Segmentation of Histopat...

引用

Annual IEEE Symposium on computer-Based Medical Systems

作者： Marcelo Dornbusch Lopes Antonio C. Sobieranski Aldo Von Wangenheim Eros Comunello INCoD - National Brazilian Institute for Digital Convergence / LAPIX - Image Processing and Computer Graphics Lab - Federal University of Santa Catarina Brazil Postgraduate Program in Applied Computing University of Itajai Valley - UNIVALI INCoD (Nat. Brazilian Inst. for Digital Convergence) LAPIX (Image Process. & Comput. Graphics Lab.) Universidade Federal de Santa Catarina Florianopolis SC BR

ISBN: (纸本)9781467390378

Histopathological staining is a technique widely used to highlight biological states or pharmacological activities in uman tissue. A quantitative analysis of the resulting images can produce biomarkers for diseases or even other specific conditions, thus providing valuable information for diagnosis and prognosis. Since biomarkers require measurements to be made in an objective and consistent way, software systems are employed to provide this quantitative analysis. For measurements to be reproducible, the same methods must be available across different laboratories. In this paper, we present a tool that allows users to perform quantitative analyses over the web, thus providing an efficient environment not only for individual cases to be evaluated, but also for users to share a common ground when making measurements. The classification method used by the tool to segment stained pixels is performed by a similarity function based on the polynomial version of the Mahalanobis distance, which is nonlinear and provides very robust classification for m-dimensional feature spaces. Furthermore, the similarity function can be generalized in the tool, so that images can be classified by reusing parameters of previous cases. The results of our web-based approach were compared with established ground-truth data sets, producing sensitivity, specificity and fitness values of 97.09%, 98.70%, and 97.90%.

关键词： image color analysis image segmentation Biomarkers Sensitivity Inspection Servers Statistical analysis

来源：评论

学校读者我要写书评

暂无评论

New framework for decomposing a polygon with zero or more holes

引用

Open Cybernetics and Systemics Journal 2015年第1期9卷 390-405页

作者： Hongguang, Zhou Guozhao, Wang Institute of Computer Graphics and Image Processing Department of Mathematics Zhejiang University Hangzhou Zhejiang China

In this paper, we propose a unified framework for decomposition of a polygon with or without holes, enlightened by approximate convex decomposition. We transform target polygon containing holes into the polygon without holes by merging holes into external boundary, thus only need to partition the polygon without holes. Several constraints are enforced to ensure generate more visually meaningful decompositions, more elegant final components than that of other methods. Moreover, we estimate tolerance δ from geometry information of target polygon to obtain a naturally visual decomposition, a polished hierarchical representation. Our approach computes a decomposition of a polygon, containing zero or more holes, with n vertices and r notches in O(nr) time. In contrast, exact convex decomposition is NP-hard, or if the polygon has no holes, takes much more time. Many experimental results and applications are presented to show the superiority, applicability and flexibility of our approach. © Hongguang and Guozhao;Licensee Bentham Open.

关键词： Decomposition

来源：评论

学校读者我要写书评

暂无评论

Optimal surface normal from affine transformation 10

Optimal surface normal from affine transformation

引用

10th International Conference on computer Vision Theory and Applications, VISAPP 2015

作者： Daniel, Barath Molnar, Jozsef Hajder, Levente Geometric Modelling and Computer Vision Laboratory MTA SZTAKI Kende utca 13-17 BudapestH-1111 Hungary Department of Image Processing and Computer Graphics Institute of Informatics University of Szeged Árpád tér 2 SzegedH-6720 Hungary

ISBN: (纸本)9789897580918

This paper deals with surface normal estimation from calibrated stereo images. We show here how the affine transformation between two projections defines the surface normal of a 3D planar patch. We give a formula that describes the relationship of surface normals, camera projections, and affine transformations. This formula is general since it works for every kind of cameras. We propose novel methods for estimating the normal of a surface patch if the affine transformation is known between two perspective images. We show here that the normal vector can be optimally estimated if the projective depth of the patch is known. Other non-optimal methods are also introduced for the problem. The proposed methods are tested both on synthesized data and images of real-world 3D objects.

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

Automated multi-contrast brain pathological area extraction from 2D MR images

引用

Journal of Applied Research and Technology 2015年第1期13卷 58-69页

作者： Dvořák, P. Bartušek, K. Kropatsch, W.G. Smékal, Z. Institute of Scientific Instruments of the ASCR V.v.i Academy if Sciences of the Czech Republic Brno Czech Republic Dept. of Telecommunications Faculty of Electrical Engineering and Communication Brno University of Technology Brno Czech Republic Pattern Recognition and Image Processing Group Institute of Computer Graphics and Algorithms Faculty of Informatics Vienna University of Technology Vienna Austria

The aim of this work is to propose the fully automated pathological area extraction from multi-parametric 2D MR images of brain. The proposed method is based on multi-resolution symmetry analysis and automatic thresholding. The proposed algorithm first detects the presence of pathology and then starts its extraction. T2 images are used for the presence detection and the multi-contrast MRI is used for the extraction, concretely T2 and FLAIR images. The extraction is based on thresholding, where Otsu's algorithm is used for the automatic determination of the threshold. Since the method is based on symmetry, it works for both axial and coronal planes. In both these planes of healthy brain, the approximate left-right symmetry exists and it is used as the prior knowledge for searching the approximate pathology location. It is assumed that this area is not located symmetrically in both hemispheres, which is met in most cases. The detection algorithm was tested on 203 T2-weighted images and reached the true positive rate of 87.52% and true negative rate of 93.14%. The extraction algorithm was tested on 357 axial and 443 coronal real images from publicly available BRATS databases containing 3D volumes brain tumor patients. The results were evaluated by Dice Coefficient (axial: 0.85 ± 0.11, coronal 0.82 ± 0.18) and by Accuracy (axial: 0.96 ± 0.05, coronal 0.94 ± 0.09). © 2015 Universidad Nacional Autónoma de México.

关键词： Brain Pathology Brain Tumor MRI Multi-contrast MRI Symmetry Analysis

来源：评论

学校读者我要写书评

暂无评论

Relevance concept based image annotation refinement algorithm

引用

ICIC Express Letters 2015年第11期9卷 3023-3029页

作者： Song, Haiyu Li, Houjie Bao, Cuizhu Wang, Pengjie Li, Mengying Qu, Zhaowei Institute of Computer Graphics and Image Processing Dalian Nationalities University Economic and Technological Development Zone No. 18 Liaohe Road Dalian China College of Traffic Jilin University No. 148-3 Renmin Avenue Changchun China

Automatic image annotation (AIA) is a promising solution to retrieve, organize and manage image data. What is more, AIA can make it possible for relational database system to manage non-structure image data. However, the performances of state-of-the-art image annotation approaches are often unsatisfactory. image annotation refinement can further improve the performance of image annotation by removing noisy annotation words. The correlation measurement of candidate annotation is core technology of image annotation refinement. To our knowledge, most of existing approaches only exploit textual information such as semantic similarity or co-occurrence probability of candidate annotation words. Different from traditional approaches, we propose visual-modal relevance concept of candidate textual-modal annotations words, and apply to measure correlations of candidate annotations. Experiments on standard Corel5K dataset show that our proposed approach outperforms other mainstream annotation refinement approaches based on textual information. Moreover, the performance of our proposed approach is very close to the limited performance. © 2015 ICIC International.

关键词： image annotation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：