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

International Workshop on Education Technology and Computer Science, ETCS

作者： Jianhao Ding Yigang Wang Lingyun Yu State Key Laboratory of CAD & CG University of Zhejiang Hangzhou China Institute of Computer graphics and Image Processing Hangzhou Dianzi University Hangzhou China Department of Mathematics and Computing Science University of Groningam Netherlands

ISBN: (纸本)9781424463886;9780769539874

Skeleton extraction is essential for general shape representation. A typical skeletonization algorithm should obtain the ability to preserve original object's topological and hierarchical properties. However, most of current methods are high memory cost, computationally intensive, and also require complex data structures. In this paper, we propose an efficient and accurate skeletonization method for the skeleton feature points extracted from human body based on silhouette images. First, the gradient of distance transform is used to detect critical points inside the foreground. Then, we converge and simplify critical points in order to generate the most important and elegant skeleton feature points. Finally, we present an algorithm which connects the skeleton feature points and estimates the position of skeleton joints.

关键词： Humans Skeleton Joints Iterative algorithms Euclidean distance Data mining Motion analysis image converters Shape Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Adaptive feature selection and extraction approaches for image retrieval based on region

引用

Journal of Multimedia 2010年第1期5卷 85-92页

作者： Song, Haiyu Li, Xiongfei Wang, Pengjie Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Institute of Computer Graphics and Image Processing Dalian Nationalities University Dalian China State Key Laboratory of CAD and CG Zhejiang University Hangzhou China

image retrieval based on region is one of the most promising and active research directions in recent year's CBIR, while region segmentation, feature selection and feature extraction of region are key issues. However, the existing approaches always adopt a uniform approach of segmentation and feature extraction for all images in the same system. In this paper, we propose adaptive image segmentation and feature extraction approach according to different category image for image retrieval system. To improve performance, we propose adaptive segmentation approach according to different category image. Textured image is segmented by Gaussian Mixture Models (GMM), while non-textured image is segmented by our proposed block-based normalized cut. To accurately describe feature of region, we propose weight assignment method for centroid pixel and its neighbor by convolution with normal distribution when image segmentation by GMM. To improve generalization, we propose adaptive number of Fourier descriptors of shape signature which depends on the energy distribution of Fourier descriptors, instead of fixed number by experience. To simply and efficiently describe the spatial relationships of multi-object or multi-region in same image, we apply simplified topological relationships. The experiments demonstrate that proposed approaches are superior to the traditional approaches. © 2010 ACADEMY PUBLISHER.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Optimal constrained multi-degree reduction of Bézier curves with explicit expressions based on divide and conquer

引用

Journal of Zhejiang University-Science A(Applied Physics & Engineering) 2009年第4期10卷 577-582页

作者： Lian ZHOU Guo-jin WANG Institute of Computer Graphics and Image Processing State Key Lab of CAD & CG Zhejiang University Hangzhou 310027 China

We decompose the problem of the optimal multi-degree reduction of Bézier curves with corners constraint into two simpler subproblems, namely making high order interpolations at the two endpoints without degree reduction, and doing optimal degree reduction without making high order interpolations at the two endpoints. Further, we convert the second subproblem into multi-degree reduction of Jacobi polynomials. Then, we can easily derive the optimal solution using orthonormality of Jacobi polynomials and the least square method of unequally accurate measurement. This method of 'divide and conquer' has several advantages including maintaining high continuity at the two endpoints of the curve, doing multi-degree reduction only once, using explicit approximation expressions, estimating error in advance, low time cost, and high precision. More importantly, it is not only deduced simply and directly, but also can be easily extended to the degree reduction of surfaces. Finally, we present two examples to demonstrate the effectiveness of our algorithm.

关键词： Bezier curves Multi-degree reduction Divide and conquer

来源：评论

学校读者我要写书评

暂无评论

A new method in highway route design:joining circular arcs by a single C-Bézier curve with shape parameter

引用

Journal of Zhejiang University-Science A(Applied Physics & Engineering) 2009年第4期10卷 562-569页

作者： Hua-hui CAI Guo-jin WANG Institute of Computer Graphics and Image Processing State Key Lab of CAD & CG Zhejiang University Hangzhou 310027 China

We constructed a single C-Bezier curve with a shape parameter for G^2 joining two circular arcs. It was shown that an S-shaped transition curve, which is able to manage a broader scope about two circle radii than the Bezier curves, has no curvature extrema, while a C-shaped transition curve has a single curvature extremum. Regarding the two kinds of curves, specific algorithms were presented in detail, strict mathematical proofs were given, and the effectiveness of the method was shown by examples This method has the following three advantages：（1） the pattern is unified; （2） the parameter able to adjust the shape of the transition curve is available; （3） the transition curve is only a single segment, and the algorithm can be formulated as a low order equation to be solved for its positive root. These advantages make the method simple and easy to implement.

关键词： Transition curve C-Bezier curve Monotone curvature Shape parameter

来源：评论

学校读者我要写书评

暂无评论

Live Cell Segmentation in Fluorescence Microscopy via Graph Cut

Live Cell Segmentation in Fluorescence Microscopy via Graph ...

引用

International Conference on Pattern Recognition

作者： Milán Leskó Zoltan Kato Antal Nagy Imre Gombos Zsolt Török Laszlo Vigh Jr László Vígh Department of Image Processing and Computer Graphics University of Szeged Szeged Hungary Molecular Stress Biology Group Institute of Biochemistry Biological Research Center Hungarian Academy of Sciences (ATOMKI) Hungary Molecular Stress Biology Group Biological Research Center

We propose a novel Markovian segmentation model which takes into account edge information. By construction, the model uses only pairwise interactions and its energy is sub modular. Thus the exact energy minima is obtained via a max-flow/min-cut algorithm. The method has been quantitatively evaluated on synthetic images as well as on fluorescence microscopic images of live cells.

关键词： image segmentation Microscopy Pixel Computational modeling Mathematical model Biomembranes Biology

来源：评论

学校读者我要写书评

暂无评论

Testing Cross-Platform Streaming of Video Games over Wired and Wireless LANs

Testing Cross-Platform Streaming of Video Games over Wired a...

引用

International Conference on Advanced Information Networking and Applications Workshops (AINAW)

作者： Audrius Jurgelionis Francesco Bellotti Alessandro De Gloria Jukka-Pekka Laulajainen Philipp Fechteler Peter Eisert Haggai David Department of Biophysical and Electronic Engineering University of Genoa Genoa Italy Universita degli Studi di Genova Genova Liguria IT Converging Networks Laboratory VTT Technical Research Center of Finland Oulu Finland Computer Vision & Graphics Fraunhofer-Institute for Telecommunications Berlin Germany Computer Vision & Graphics Image Processing Department Heinrich-Hertz-Institute Fraunhofer Institute of Telecommunications Berlin Germany Converging Networks Laboratory VTT Technical Research Centre of Finland Oulu Finland R&D Department Exent Technologies Ltd. Petach Tikva Israel

In this paper we present a new cross-platform approach for video game delivery in wired and wireless local networks. The developed 3D streaming and video streaming approaches enable users to access video games on set top boxes and handheld devices that natively are not capable to run PC games. During the development of the distributed gaming system we have faced a number of challenges and problems posed by the hardware and network limitations. In order to solve these problems we have developed a multilevel testing methodology which is based on user assessment and technical measures for the system under development. In this paper we focus on the technical measures and instrumentation that we use for the system's performance measurement and testing. The benefits of our testing methodology are demonstrated through examples from the development and testing work.

关键词： Streaming media Games Wireless LAN System testing Computer graphics Hardware Cloud computing Delay image coding Computer architecture

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT CLASSIFICATION FOR LARGE-SCALE PROBLEMS BY MULTIPLE LDA SUBSPACES

EFFICIENT CLASSIFICATION FOR LARGE-SCALE PROBLEMS BY MULTIPL...

引用

4th International Conference on Computer Vision Theory and Applications

作者： Uray, Martina Roth, Peter M. Bischof, Horst Institute of Digital Image Processing Joanneum Research Austria Institute for Computer Graphics and Vision Graz University of Technology Austria

ISBN: (纸本)9789898111692

In this paper we consider the limitations of Linear Discriminative Analysis (LDA) when applying it for large-scale problems. Since LDA was originally developed for two-class problems the obtained transformation is sub-optimal if multiple classes are considered. In fact, the separability between the classes is reduced, which decreases the classification power. To overcome this problem several approaches including weighting strategies and mixture models were proposed. But these approaches are complex and computational expensive. Moreover, they were only tested for a small number of classes. In contrast, our approach allows to handle a huge number of classes showing excellent classification performance at low computational costs. The main idea is to split the original data into multiple sub-sets and to compute a single LDA space for each sub-set. Thus, the separability in the obtained subspaces is increased and the overall classification power is improved. Moreover, since smaller matrices have to be handled the computational complexity is reduced for both, training and classification. These benefits are demonstrated on different publicly available datasets. In particular, we consider the task of object recognition, where we can handle up to 1000 classes.

关键词： LDA image classification Large databases

来源：评论

学校读者我要写书评

暂无评论

New method in information processing for maintaining an efficient dynamic ordered set

引用

Science in China(Series F) 2009年第8期52卷 1292-1301页

作者： XIN ShiQing WANG GuoJin Institute of Computer Graphics and Image Processing Zhejiang University Hangzhou 310027 China State Key Laboratory of CAD & CG Zhejiang University Hangzhou 310027 China

This paper investigates how to maintain an efficient dynamic ordered set of bit strings, which is an important problem in the field of information search and information processing. Generally, a dynamic ordered set is required to support 5 essential operations including search, insertion, deletion, max-value retrieval and next-larger-value retrieval. Based on previous research fruits, we present an advanced data structure named rich binary tree （RBT）, which follows both the binary-search-tree property and the digital-search-tree property. Also, every key K keeps the most significant difference bit （MSDB） between itself and the next larger value among K＇s ancestors, as well as that between itself and the next smaller one among its ancestors. With the new data structure, we can maintain a dynamic ordered set in O（L） time. Since computers represent objects in binary mode, our method has a big potential in application. In fact, RBT can be viewed as a general-purpose data structure for problems concerning order, such as search, sorting and maintaining a priority queue. For example, when RBT is applied in sorting, we get a linear-time algorithm with regard to the key number and its performance is far better than quick-sort. What is more powerful than quick-sort is that RBT supports constant-time dynamic insertion/deletion.

关键词： information processing dynamic ordered set algorithms and data structures rich binary tree

来源：评论

学校读者我要写书评

暂无评论

An efficient hierarchical segmentation approach for remote sensing images

An efficient hierarchical segmentation approach for remote s...

引用

MIPPR 2009 - Automatic Target Recognition and image Analysis: 6th International Symposium on Multispectral image processing and Pattern Recognition

作者： Kong, Dingke Wang, Guozhao Institute of Computer Graphics and Image Processing Department of Mathematics Zhejiang University Hangzhou 310027 China

ISBN: (纸本)9780819478061

Segmentation is one of the key problems in remote sensing image processing, and a cluster hierarchy is a powerful tool to analyze data on multiple scales. In this paper, we present an optimal hierarchical remote sensing image segmentation approach which is a combination of feature-based classification, multi-scale region merging and classification-based object refinement, and it is shown to have the following properties: 1) it gets better results on general remote sensing images;2) it offers a flexible segmentation hierarchy at a less computational cost. © 2009 Copyright SPIE - The International Society for Optical Engineering.

关键词： image segmentation

来源：评论

学校读者我要写书评

暂无评论

A novel adaptive noise filtering method for SAR images

A novel adaptive noise filtering method for SAR images

引用

Satellite Data Compression, Communication, and processing V

作者： Li, Weibin He, Mingyi Institute of Graphics and Image Processing Xianyang Normal Univ. Xianyang 712000 China Electronics and Information Northwestern Polytechnical Univ. Xi'an 710072 China

ISBN: (纸本)9780819477453

In the most application situation, signal or image always is corrupted by additive noise. As a result there are mass methods to remove the additive noise while few approaches can work well for the multiplicative noise. The paper presents an improved MAP-based filter for multiplicative noise by adaptive window denoising technique. A Gamma noise models is discussed and a preprocessing technique to differential the matured and un-matured pixel is applied to get accurate estimate for Equivalent Number of Looks. Also the adaptive local window growth and 3 different denoise strategies are applied to smooth noise while keep its subtle information according to its local statistics feature. The simulation results show that the performance is better than existing filter. Several image experiments demonstrate its theoretical performance. © 2009 SPIE.

关键词： Additive noise

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：