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

11th Asian Conference on Computer Vision, ACCV 2012

作者： Chen, Li Zhou, Yue Yang, Jie Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai 200240 China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai Jiao Tong University Shanghai 200240 China

ISBN: (纸本)9783642374302

It is well known that the backgrounds or the targets always change in real scenes, which weakens the effectiveness of classical tracking algorithms because of frequent model mismatches. In this paper, an object tracking algorithm within the framework of concept drift is proposed to solve this problem. We detect the driftpoints using a simple message-passing algorithm based on Bayesian Approach. The analyzed probability distribution lays the foundation for the self-adaption of our new model. Our tracking algorithm within the framework of concept drift improves the tracking robustness and accuracy which is illustrated by the two experiments on two real-world changing scenes. © 2013 Springer-Verlag.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

Shadow detection using regression tree fields with paired regions

引用

Journal of Computational Information Systems 2013年第11期9卷 4309-4317页

作者： Tao, Wei Zhou, Yue Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Shanghai 200240 China

In this paper, we try to deal with the problem of shadow detection from static images and video sequences. In instead to considering individual regions separately, we use relative illumination conditions between segmented regions and perform pair-wise classification based on such information. We use Regression Tree Fields to solve the labeling of shadow and non-shadow regions. And we use continuous value to describe the possibility of the shadow of the region. We evaluate our method on static images and a series of video sequences. © 2013 by Binary Information Press.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Cattle's fur detection in complex background based on Graph Cuts

Cattle's fur detection in complex background based on Graph ...

引用

International Conference on Advanced Computer Science and Information System (ICACSIS)

作者： Hisyam Fahmi Ary Noviyanto Aniati Murni Arymurthy Image Processing and Pattern Recognition Laboratory Faculty of Computer Science Universitas Indonesia

Segmentation becomes a difficult task if the objects are not homogeneous and have overlapping characteristics. The Graph Cuts methods combined with Gaussian Mixture Model (GMM) for initialization label has been adopted to detect cattle object in an image with complex background. The RGB colors and Gray Level Co-occurrence Matrix (GLCM) textures are used as the features set. This method can robustly segment the cattle beef image from its background. This segmentation method produces the average of accuracy value up to 90%.

关键词： image segmentation Cows Accuracy image color analysis Equations Mathematical model Gaussian mixture model

来源：评论

学校读者我要写书评

暂无评论

AN ACTIVE CONTOUR MODEL BASED ON MULTIPLE BOUNDARY MEASURES

AN ACTIVE CONTOUR MODEL BASED ON MULTIPLE BOUNDARY MEASURES

引用

IEEE International Conference on image processing

作者： Yu Qiao Lei Zhou Jie Yang Yonghui Gao The Key Laboratory of Ministry of Education for System Control and Information Processing Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University

ISBN: (纸本)9781479923427

Weak boundary contrast, inhomogeneous background and overlapped intensity distributions of the object and background are main causes that may lead to failure of boundary detection for many traditional active contour methods. In this paper, we propose a region-based active contour model to address these problems in both local and global ways. A localized active contour framework is developed, in which two local boundary measures are introduced for the evolution of the level set function. These measures are used to select the boundary candidates for boundary preservation such that the evolution of the contour is guided in a reasonable way. The object boundary is determined by a global boundary measure which evaluates the boundary completeness during the entire evolution process. The experiments demonstrate that our method works well against weak boundary contrast, inhomogeneous background and overlapped intensity distributions.

关键词： Region-based active contour model Level set method Local boundary measures Boundary preservation Global boundary measure contour Boundary boundary layer set method boundary contrast Comet Nucleus Tour Edge detection evolution evolution evolution intensity distribution

来源：评论

学校读者我要写书评

暂无评论

Efficient Texture Classification using Short-time Fourier Transform with Spatial Pyramid Matching

Efficient Texture Classification using Short-time Fourier Tr...

引用

IEEE International Conference on Systems, Man, and Cybernetics

作者： Hassan Dawood Hussain Dawood Ping Guo Image Processing and Pattern Recognition Laboratory Beijing Normal University Beijing 100875 China

ISBN: (纸本)9781479906505

Texture feature extraction plays an important role in texture image classification. In this paper, we have proposed a texture feature extraction method by utilizing the Short-time Fourier Transform to provide local image information, and for the global geometric correspondence we have proposed to use Spatial Pyramid Matching in frequency domain named as Short-time Fourier Transform with Spatial Pyramid Matching (STFT-SPM). The experiments are conducted on standard benchmark datasets for texture classification like Brodatz and KTH-TIPS2-a, shows that STFT-SPM can achieve significant improvement compared to the Local Phase Quantization, Weber local Descriptor and local Binary pattern methods.

关键词： Spatial Pyramid Matching Texture classification Short-time Fourier Transform STFT Fourier Transform Pyramid texture image information textures standardized benchmark Feature extraction

来源：评论

学校读者我要写书评

暂无评论

An image compression-encryption algorithm based on 2-D compressive sensing

引用

Journal of Computational Information Systems 2013年第24期9卷 10057-10064页

作者： Mo, Yan Zhang, Aidi Zheng, Fen Zhou, Nanrun Jiangxi Province Key Laboratory of Image Processing and Pattern Recognition Nanchang Hangkong University Nanchang 330063 China Department of Electronic Information Engineering Nanchang University Nanchang 330031 China

An image compression-encryption algorithm based on 2-D compressive sensing is proposed, which can accomplish encryption and compression simultaneously. The measurements are performed in two directi-ons and the measurement matrices are constructed as partial Hadamard matrices, which are controlled by chaos map. The proposed algorithm is sensitive to the keys and it can resist various attacks. Simulation results verify the validity and reliability of the proposed algorithm. Copyright © 2013 Binary Information Press.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

Mining top-K Frequent and Flexible pattern from sequences

Mining top-K Frequent and Flexible Pattern from sequences

引用

2013 IEEE Conference Anthology, ANTHOLOGY 2013

作者： Junyan, Zhang Fan, Min Information Science and Technology College Chengdu University China University Key Laboratory of Pattern Recognition and Intelligent Information Processing Sichuan Province Chengdu China School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China

ISBN: (纸本)9781479916603

pattern Mining is a popular issue in biological sequence analysis. With the introduction of wildcard gaps, more interesting patterns can be mined. In this paper, we propose a new definition related to pattern frequency, under which the Apriori property holds. We define a pattern mining problem called Ming top-K Frequent patterns (MFP), where gaps are mined instead of specified. Compared with existing problems, MFP does not require any domain knowledge of the user. However, theoretical analysis and experimental results show that MFP favors inflexible patterns. We then define another problem where the flexibility threshold of each gap is specified by the user. The problem is called Mining top-K Frequent and Flexible patterns (MF2P). We develop algorithm with polynomial complexities for both problems. patterns can grow from both sides. Some interesting biological patterns mined by our algorithms are discussed. © 2013 IEEE.

关键词： Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

AFFINE SOFTASSIGN WITH BIDIRECTIONAL DISTANCE FOR POINT MATCHING

AFFINE SOFTASSIGN WITH BIDIRECTIONAL DISTANCE FOR POINT MATC...

引用

IEEE International Conference on image processing

作者： Peng-peng Zhang Sheng-zheng Wang Yu Qiao Jie Yang Yong-hui Gao The Key Laboratory of Ministry of Education for System Control and Information Processing Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University China 200240 Merchant Marine College Shanghai Maritime University China 200235

ISBN: (纸本)9781479923427

This paper proposes a new affine registration algorithm for 2D point matching. It is a two-step iterative registration algorithm by soft weight assignment based on bidirectional distance. At each iteration, the affine transformation is updated by two optimization steps, in which the model data and the test data are matched from each other respectively. By the optimization of registration at separate steps during each iteration, the proposed algorithm can provide a good estimate of the accurate affine transformation in condition of poor initialization and lack of geometric assumptions on point sets. Some experiments about comparison with the current state-of-the art approaches, demonstrate the robustness and accuracy of our method.

关键词： affine soft assignment bidirectional distance point matching In-law Affine transformation Bidirectional Affine Registration observational data iterative methods

来源：评论

学校读者我要写书评

暂无评论

Detection of aflatoxin contaminated figs using Near-Infrared (NIR) reflectance spectroscopy

Detection of aflatoxin contaminated figs using Near-Infrared...

引用

International Conference on Electronics, Computer and Computation (ICECCO)

作者： Ali Güneş Habil Kalkan Efkan Durmuş Mehmet Burak Bütükcan Vision Image Processing and Pattern Recognition Laboratory (VIPLAB) S üleyman Demirel University Isparta Turkey Canakkale Onsekiz Mart Universitesi Canakkale Canakkale TR

Figs like other agricultural products may include cancerogenic aflatoxin which is caused by Aspergillus type molds. Under the UV illumination, a large portion of the aflatoxin contaminated figs expose Bright Greenish Yellow Fluorescence (BGYF) in visible light spectrum. Using the fluorescence properties, the contaminated figs are visually detected and manually removed by workers. However, this procedure could not eliminate all the aflatoxin contaminated figs and the UV exposure may cause skin cancer on workers under UV illumination. Besides, the reflectance outside the visible spectrum may include significant information for aflatoxin contamination. In this study, we investigate the NIR reflectance spectroscopy for the detection of aflatoxin contaminated figs and correctly classified the figs with 90% mean accuracy.

关键词： Spectroscopy Reflectivity Fluorescence Lighting Inspection Sugar Contamination

来源：评论

学校读者我要写书评

暂无评论

Parallel implementation of segmentation algorithms on graphics processing unit

Parallel implementation of segmentation algorithms on graphi...

引用

IEEE Signal processing and Communications Applications (SIU)

作者： Erdal Yenialp Habil Kalkan Vision Image Processing and Pattern Recognition Laboratory (VIPLAB) Bilgisayar Mühendisliği Bölümü Süleyman Demirel Üniversitesi Isparta Turkey

Segmentation algorithms are widely used in image processing. These methods have different complexity values and the choice of reasonable methods decreases on large images. Especially on the medical images with large size, it may take days to perform segmentation in some methods. However, parallel implementation may eliminate the drawback of these algorithms to some extent. In this study, we propose to implement segmentation algorithms in parallel using Graphical processing Unit. Using the proposed implementation, the computation time of the K-centers, K-means and DBSCAN algorithms were decreases 87, 642 and 2 times, respectively.

关键词： Graphics processing units Clustering algorithms image segmentation Art Software algorithms Computer science

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：