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

Proceedings - International Conference on pattern recognition 2002年第1期16卷 707-710页

作者： Jun, Xie Tsui, H.T. Deshen, Xia Image Processing and Computer Vision Lab Department of Electronic Engineering Chinese University of Hong Kong Hong Kong Pattern Recognition Lab Department of Computer Science Nanjing University of Sci. and Tech. China

A new method based on MLE-OED is proposed for unsupervised image segmentation of multiple objects which have fuzzy edges. It adjusts the parameters of a mixture of Gaussian distributions via minimizing a new loss function proposed to implement image segmentation based on the image's local spatial information and global intensity distribution properties . The loss function consists of two terms: a local content fitting term, which optimizes the entropy distribution, and a global statistical fitting term, which maximizes the likelihood of the parameters for the given data. The proposed segmentation method was validated by simulated and real examples. Its performance in the experiments is better than those of two popular methods. © 2002 IEEE.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT ONLINE LABEL CONSISTENT HASHING FOR LARGE-SCALE CROSS-MODAL RETRIEVAL

EFFICIENT ONLINE LABEL CONSISTENT HASHING FOR LARGE-SCALE CR...

引用

2021 IEEE International Conference on Multimedia and Expo, ICME 2021

作者： Yi, Jinhan Liu, Xin Cheung, Yiu-Ming Xu, Xing Fan, Wentao He, Yi Department of Computer Science and Technology Huaqiao University Xiamen361021 China Xiamen Key Lab. of Computer Vision and Pattern Recognition Fujian Key Lab. of Big Data Intelligence and Security China Department of Computer Science Hong Kong Baptist University Kowloon Hong Kong School of Computer Science and Engineering University of Electronic Science and Technology of China China Provincial Key Laboratory for Computer Information Processing Technology Soochow University China

ISBN: (纸本)9781665438643

Existing cross-modal hashing still faces three challenges: (1) Most batch-based methods are unsuitable for processing large-scale and streaming data. (2) Current online methods often suffer from insufficient semantic association, while lacking flexibility to learn the hash functions for varying streaming data. (3) Existing supervised methods always require much computation time or accumulate large quantization loss to learn hash codes. To address above challenges, we present an efficient Online Label Consistent Hashing (OLCH) for cross-modal retrieval, which aims to incrementally learn hash codes for the current arriving data, while updating the hash functions at a streaming manner. To be specific, an online semantic representation learning framework is designed to adaptively preserve the semantic similarity across different modalities, and a mini-batch online gradient descent approach associated with forward-backward splitting is developed to optimize the hash functions. Accordingly, the hash codes are adaptively learned online with the high discriminative capability, while avoiding high computation complexity to process the streaming data. Experimental results show its outstanding performance in comparison with the-state-of-arts. © 2021 IEEE computer Society. All rights reserved.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Robust recovery of eigenimages in the presence of outliers and occlusions

引用

Journal of Computing and Information Technology 1996年第1期4卷 25-38页

作者： Leonardis, Aleš Bischof, Horst Department for Pattern Recognition and Image Processing Technical University Vienna Treitlstraße 3/1832 ViennaA-1040 Austria Computer Vision Laboratory Faculty of Computer and Information Science University of Ljubljana Tržaška 25 Ljubljana1000 Slovenia

The basic limitations of the current appearance-based matching methods using eigenimages are non-robust estimation of coefficients and inability to cope with problems related to occlusions and segmentation. In this paper we present a new approach which successfully solves these problems. The major novelty of our approach lies in the way how the coefficients of the eigenimages are determined. Instead of computing the coefficients by a projection of the data onto the eigenimages. we extract them by a hvpothesize-and-test paradigm using subsets of image points. Competing hypotheses arc then subject to a selection procedure based on the Minimum Description Length principle. The approach enables us not only lo reject outliers and to deal with occlusions but also to simultaneously use multiple classes of eigenimages.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Normalized Linear Transform for Cross-Platform Microarray Data Integration

Normalized Linear Transform for Cross-Platform Microarray Da...

引用

International Conference on Machine Learning and Applications (ICMLA)

作者： Huilin Xiong Ya Zhang Xue-wen Chen Institute of Image Processing and Pattern Recognition Shanghai Jiaotong University Shanghai China Department of Electrical Engineering and Computer Science University of Kansas Lawrence KS USA

With microarray data being dramatically accumulated, integrating data from related studies represents a natural way to increase sample size so that more reliable statistical analysis may be performed. However, inherent variation among different microarray platforms makes the data integration not a trivial task. In this paper, we present a simple and effective integration scheme, called normalized linear transform (NLT), to combine data from different microarray platforms. The NLT scheme is compared with three other integration schemes for two tasks: classification analysis and gene marker selection. Our experiments demonstrate that the NLT scheme performs best in terms of classification accuracy under various classification settings, and leads to more biologically significant marker genes.

关键词： Costs Gene expression Support vector machines Support vector machine classification Machine learning Application software image processing pattern recognition computer science Statistical analysis

来源：评论

学校读者我要写书评

暂无评论

NCEM: Network structural similarity metric-based clustering for noisy cryo-EM single particle images

NCEM: Network structural similarity metric-based clustering ...

引用

Chinese Automation Congress

作者： Yin Shuo Biao Zhang Hong-Bin Shen Yang Yang Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai China Department of Computer Science Shanghai Jiao Tong University Shanghai China

Cryo-EM single particle image reconstruction is currently a powerful technique for revealing the structure of biomacromolecules. Compared to traditional structural biology techniques like X-Ray, it requires fewer restrictions on specimens and is highly efficient with image processing tools. In this single particle reconstruction protocol, the ultimate goal is to identify different particle projection orientations. Since the picked single particle images are highly noisy, clustering is an important step to refrain noise by dividing images with similar projection angles into groups and averaging these images. The goal of clustering analysis is to assign similar particles into same class, so similarity measurement between particles is an important part in all clustering algorithms. Directly measuring the similarity of two particle images will be unreliable due to their low SNR. In this study, we propose a novel network structural similarity metric-based clustering algorithm NCEM for clustering the single particle images. We first construct a complex network for all particle images, where each node represents a particle. Then calculating the similarity between two nodes using structural similarity. This new network-based single particle image similarity metric has advantages over direct measurement for its noise resistance by using the structural information of the network. Our experiments on both artificial and experimental datasets demonstrate its effectiveness.

关键词： Cryo-EM Single particle image clustering Complex network Structural similarity

来源：评论

学校读者我要写书评

暂无评论

Combining LPP with PCA for microarray data clustering

Combining LPP with PCA for microarray data clustering

引用

Congress on Evolutionary Computation

作者： Chuanliang Chen Rongfang Bie Ping Guo Department of Computer Science Beijing Normal University Beijing China Processing & Pattern Recognition Laboratory Beijing Normal University Beijing China

DNA microarray technique has produced large amount of gene expression data. To analyze these data, many excellent machine learning techniques have been proposed in recent related work. In this paper, we try to perform the clustering of microarray data by combining the recently proposed locality preserving projection (LPP) method with PCA, i.e. PCA-LPP. The comparison between PCA and PCA-LPP is performed based on two clustering algorithms, K-means and agglomerative hierarchical clustering. As we already known, clustering with the components extracted by PCA instead of the original variables does improve cluster quality. Moreover, our empirical study shows that by using LPP to perform further process the dimensions of components extracted by PCA can be further reduced and the quality of the clusters can be improved greatly meanwhile. Particularly, the first few components obtained by PCA-LPP capture more information of the cluster structure than those of PCA.

关键词： Evolutionary computation

来源：评论

学校读者我要写书评

暂无评论

computer operation via face orientation

Computer operation via face orientation

引用

International Conference on pattern recognition

作者： P. Ballard G.C. Stockman Pat tern Recognition and Image Processing Laboratory Computer Science Department Michigan State University East Lansing MI USA

computer operation via face orientation provides a means of communication for people with severe physical disability. The authors present a near-real-time computer system to track the eyes and the nose of a subject and compute the direction of the face. As presented by K. Ohmura et al. (1988), the direction can be computed from three natural feature points extracted from the face. The computational approach taken in this system is motivated by the practical requirements of near-real-time performance and accuracy. The approach is based on the reflection characteristic of the cornea. Any bright light source forms a twinkle in the eye that is fixed as long as the light source is fixed. Face direction detection is treated as a 2D tracking problem. The eye twinkles are extracted from the image and used to locate the nose. A final experiment shows that the face direction obtained from the three feature points is precise enough to control the mouse cursor to make selection from a menu with large light buttons.< >

关键词： Face detection Nose Light sources Physics computing Eyes Feature extraction Optical reflection Cornea Lighting control Mice

来源：评论

学校读者我要写书评

暂无评论

Double-Row Cascade Labeling Algorithm for Hyper-Scale Issue

引用

Procedia Engineering 2011年 15卷 4047-4051页

作者： Yebin Fan Hualong Zhao Department of Computer Science Huazhong University of Science and Technology National Key Laboratory of Science and Technology on Multi-Spectral Information Processing Institute for Pattern Recognition and Artificial Intelligence Huazhong University of Science and Technology

An efficient algorithm is presented to label the connected components in the case that the primary memory is smaller than the image data. Our algorithm uses only the memory of two image rows to label the huge image or any image larger than the available memory. The search path compression is a applied for improving the performance further. An extensive comparison with the state-of-art algorithms is proposed, both on random and real datasets. Our algorithm shows an impressive speedup, while the auxiliary memory is not required at all comparing with all competitors.

关键词： Connected components labeling page fault hyper-scalar union-find

来源：评论

学校读者我要写书评

暂无评论

Iterative data adaptive anisotropic image filtering

Iterative data adaptive anisotropic image filtering

引用

2012 International Conference on Machine Learning and Cybernetics, ICMLC 2012

作者： Yang, Chang-Cai Zheng, Xin-Yi Tian, Jin-Wen Shang, Ke Tian, Xin Hao, Wei Institute for Pattern Recognition and Artificial Intelligence Science and Technology on Multi-Spectral Information Processing Laboratory Huazhong University of Science and Technology Wuhan 430074 China Electrical Engineering and Renewable Energy School China Three Gorges University Yichang 443002 China Institute of Intelligent Vision and Image Information College of Computer and Information Technology China Three Gorges University Yichang 443002 China

ISBN: (纸本)9781467314855

This paper presents a novel data-adaptive anisotropic filtering technique built on top of an iterative scheme. This new technique can preserve the original significant structures while suppressing noises to the largest extent. To achieve this goal, dominant orientation information of all gradients is used to control the local kernel adaptively. This results in elongated and elliptical contours spread along the directions of the local edge structure. With these locally adapted kernels, the smoothing is mostly effective along the edges, rather than across them. Therefore details in the original input can be preserved. The performance of the proposed data-adaptive anisotropic filter together with its iterative scheme are compared with the conventional Gaussian filter, anisotropic diffusion filter, the structure-adaptive anisotropic filter, and the iterative kernel regression scheme. The experimental results on both simulated Gaussian and Poission noisy images indicate that the proposed method performs the best, and the iterative scheme can significantly improve the performance of the noise suppressing while delivering high computation efficiency. © 2012 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm and implementation for residue to binary number conversion

An efficient algorithm and implementation for residue to bin...

引用

International Conference on Communications, Circuits and Systems (ICCCAS)

作者： Chengyi Xiong Zhirong Gao Jinwen Tian Key Laboratory of Education Commission for Image Processing and Intelligent Control Institute of Pattern Recognition & Artificial Intelligence Huazhong University of Science and Technology Wuhan China Department of Computer Science Wuhan University of Science & Engineering Wuhan China Key Laboratory of Education Commission for Image Processing Huazhong University of Science & Technology China

The residue number system (RNS) has computational advantages in addition and multiplication compared with weighted number systems, such as the binary number system (BNS), since operations on residue digits are performed independently and these processes can be performed in parallel. Thus they are widely used in digital signal processing etc. Since residue to binary conversion is critical and difficult for the practicality of RNS, in this paper, a novel residue to binary (R/B) conversion algorithm for the restricted moduli set (2/sup n/ -1, 2/sup n/, 2n+1), based on exploring the periodicity of modulo (2/sup n/ /spl plusmn/ 1) operations is presented. A new 2n-bit adder based R/B converter is also proposed. The performance comparison results demonstrate that the new converter is faster and requires less area compared with the others reported in the previous literature.

关键词： Signal processing algorithms image converters Educational institutions computer science Concurrent computing Digital signal processing Arithmetic Laboratories image processing Intelligent control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：