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

Efficient clustering algorithm based on local optimality of K-means

Ruan Jian Xue Bao/Journal of Software 2008年第7期19卷 1683-1692页

作者： Lei, Xiao-Feng Xie, Kun-Qing Lin, Fan Xia, Zheng-Yi National Laboratory on Machine Perception Department of Intelligence Science Peking University Beijing 100871 China School of Computer Science and Technology China University of Mining and Technology Xuzhou 221116 China Logistics Science and Technology Institute P.L.A. Chief Logistics Department Beijing 100071 China

K-Means is the most popular clustering algorithm with the convergence to one of numerous local minima, which results in much sensitivity to initial representatives. Many researches are made to overcome the sensitivity of K-Means algorithm. However, this paper propose a novel clustering algorithm called K-MeanSCAN by means of the local optimality and sensitivity of K-Means in this paper. The core idea is building the connectivity between sub-clusters based on the multiple clustering results of K-Means, where these clustering results are distinct because of the local optimality and sensitivity of K-Means. Then a weighted connected graph of the sub-clusters is constructed using the connectivity, and the sub-clusters are merged by the graph search algorithm. The theoretic analysis and experimental demonstrations show that K-MeanSCAN outperforms existing algorithms in clustering quality and efficiency.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Neural speech predictors

Neural speech predictors

引用

European Conference on Circuits and Systems for Communications, ECCSC

作者： Rui J.P. de Figueiredo Enis Akay Laboratory for Machine Intelligence Neural and Soft Computing Department of Electrical Engineering and Computer ScienceThe Henry Samueli School of Engineering University of California Irvine CA USA

In this paper we propose a new neural network architecture that deploys and extended Kalman filter (EKF) based learning algorithm. We used the new neural network for the prediction of speech signals. Simulation results show that the neural networks leads to better performance than the well known linear predictor coefficients (LPC) that uses Levinson-Durbin algorithm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CCL-SVC: Optimizing user experience of broadcasting video on computation capability limited handheld devices

CCL-SVC: Optimizing user experience of broadcasting video on...

引用

IEEE Workshop on Multimedia Signal Processing

作者： Jingyuan Wang Lifeng Sun Bin Li Meng Zhang Shiqiang Yang Key Laboratory of Media and Networking MOE-Microsoft Tsinghua National Laboratory for Information Science and Technology Department of Electronic Engineering Tsinghua University Beijing China Key Laboratory of Machine Perception MOE Department of Machine Intelligence School of Electronics Engineering and Computer Science Tsinghua University Beijing China

ISBN: (纸本)9781424422944;9781424422951

In this paper, we propose a novel scheme using computing complexity layered scalable video coding (CCLSVC) to optimize the user experience of broadcasting video in the computing capability limited handheld terminals. To address the heterogeneity of computing capability among different handheld devices, we employ hierarchal B reference structure of SVC to divide the frames into multiple computing complexity layers (CC Layers) in server side. The handheld clients simply choose to decode the frames in their corresponding layers in terms of their computation capability to maximize the video PSNR. We have proved that the optimal CC Layers division problem is a precedence constrained scheduling problem, which is an NP-complete problem. And we further propose our fast greedy method to approximately get optimized broadcasting video playback PSNR. The simulation shows that our method is superior to temporal SVC and random frame discarding method.

关键词： Static VAr compensators Complexity theory Decoding PSNR Streaming media Gain Broadcasting

来源：评论

学校读者我要写书评

暂无评论

Wasp: A Multi-agent System for Multiple Recommendations Problem

Wasp: A Multi-agent System for Multiple Recommendations Prob...

引用

International Conference on Next Generation Web Services Practices (NWeSP)

作者： Satchidananda Dehuri Sung-Bae Cho Ashish Ghosh Soft Computing Laboratory Department of Computer Science Yonsei University Seoul South Korea Machine Intelligence Unit and Center for Soft Computing Research Indian Statistical Institute Kolkata India

This paper proposed a multi-agent system using the social status of wasp to solve the problem of multiple simultaneous personalized recommendations (MSPRs). This problem occurs when several personalized campaigns are conducting simultaneously. The aim of this paper is two fold: i) to mimic the behavior of a wasp colony in nature for designing a robust bio-inspired algorithm and in the sequel strengthening the field of natural computing, and ii) using the collective intelligence of wasps to solve the NP-hard problem like multiple recommendations problem. The solution of MSPRs can be a new generation tool for recommendation system of e-commerce by replacing independent personalized recommendations.

关键词： Multiagent systems Robustness Algorithm design and analysis NP-hard problem Materials requirements planning Ant colony optimization Books Web services Laboratories computer science

来源：评论

学校读者我要写书评

暂无评论

Scheduling of dataflow models within the Reconfigurable Video Coding framework

Scheduling of dataflow models within the Reconfigurable Vide...

引用

IEEE Workshop on Signal Processing Systems (SIPS)

作者： Jani Boutellier Veeranjaneyulu Sadhanala Christophe Lucarz Philip Brisk Marco Mattavelli Machine Vision Group University of Oulu Finland Department of Computer Science and Engineering IIT Bombay India Microelectronic Systems Laboratory Switzerland Processor Architecture Laboratory École Polytechnique Fédérale de Lausanne Switzerland

The upcoming reconfigurable video coding (RVC) standard from MPEG (ISO/IEC SC29WG11) defines a library of coding tools to specify existing or new compressed video formats and decoders. The coding tool library has been written in a dataflow/actor-oriented language named CAL. Each coding tool can be represented with an extended finite state machine and the dependencies between the tools are described as dataflow graphs. This paper proposes an approach to derive a multiprocessor execution schedule for RVC systems that are comprised of CAL actors. In addition to proposing a scheduling approach for RVC, an extension to the well-known permutation flow shop scheduling problem that enables rapid run-time scheduling of RVC tasks is introduced.

关键词： Video coding Job shop scheduling IEC standards ISO standards Libraries Transform coding Video compression Decoding Automata Runtime

来源：评论

学校读者我要写书评

暂无评论

Multiobjective fuzzy biclustering in microarray data: Method and a new performance measure

Multiobjective fuzzy biclustering in microarray data: Method...

引用

Congress on Evolutionary Computation

作者： Ujjwal Maulik Anirban Mukhopadhyay Sanghamitra Bandyopadhyay Michael Q. Zhang Xuegong Zhang Department of Computer Science and Engineering Jadavpur University Kolkata India Department of Computer Science and Engineering University of Kalyani Kalyani India Machine Intelligence Unit Indian Statistical Institute Kolkata India Cold Spring Harbor Laboratory USA and Tsinghua University Beijing China Department of Automation Tsinghua University Beijing China

Objective of any biclustering algorithm in microarray data is to discover a subset of genes that are expressed similarly in a subset of conditions. The boundaries of biclusters usually overlap as genes and conditions may belong to different biclusters with different membership degrees. Hence the notion of fuzzy sets is useful for discovering such overlapping biclusters. In this article an attempt has been made to develop a multiobjective genetic algorithm based approach for probabilistic fuzzy biclustering that minimizes the residual and maximizes cluster size and expression profile variance. A novel variable string length encoding has been proposed in this regard that encodes multiple biclusters in a single string. Also a new performance measure that reflects how a bicluster is statistically distinguished from the background is proposed. Performance of the proposed algorithm has been compared with some well known biclustering algorithms.

关键词： Clustering algorithms Optimization Electronic mail Gallium Genetic algorithms Indexes Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

Using a patient image archive to diagnose retinopathy

Using a patient image archive to diagnose retinopathy

引用

Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

作者： Kenneth W. Tobin Michael D. Abramoff Edward Chaum Luca Giancardo V. Priya Govindasamy Thomas P. Karnowski Matthew T.S. Tennant Stephen Swainson Image Science and Machine Vision Group Oak Ridge National Laboratory Oak Ridge TN USA Department of Electrical and Computer Engineering University of Iowa Iowa IA USA Department of Ophthalmology and Visual Sciences University of Iowa Hospitals and Clinics Iowa IA USA Tennessee Health Science Center Hamilton Eye Institute Memphis TN USA Oak Ridge National Laboratory Oak Ridge TN USA Department of Ophthalmology University of Alberta Edmonton Canada Faculty of Medicine University of Alberta AB Canada

Diabetes has become an epidemic that is expected to impact 365 Million people worldwide by 2025. Consequently, diabetic retinopathy is the leading cause of blindness in the industrialized world today. If detected early, treatments can preserve vision and significantly reduce debilitating blindness. Through this research we are developing and testing a method for automating the diagnosis of retinopathy in a screening environment using a patient archive and digital fundus imagery. We present an overview of our content-based image retrieval (CBIR) approach and provide performance results for a dataset of 98 images from a study in Canada when compared to an archive of 1,355 patients from a study in the Netherlands. An aggregate performance of 89% correct diagnosis is achieved, demonstrating the potential of automated, web-based diagnosis for a broad range of imagery collected under different conditions and with different cameras.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Incorporating User Provided Constraints into Document Clustering

Incorporating User Provided Constraints into Document Cluste...

引用

IEEE International Conference on Data Mining (ICDM)

作者： Yanhua Chen Manjeet Rege Ming Dong Jing Hua Department of Computer Science Machine Vision and Pattern Recognition Laboratory Detroit MI USA Department of Computer Science Graphics and Imaging Laboratory Detroit MI USA

Document clustering without any prior knowledge or background information is a challenging problem. In this paper, we propose SS-NMF: a semi-supervised non- negative matrix factorization framework for document clustering. In SS-NMF, users are able to provide supervision for document clustering in terms of pairwise constraints on a few documents specifying whether they "must" or "cannot" be clustered together. Through an iterative algorithm, we perform symmetric tri-factorization of the document- document similarity matrix to infer the document clusters. Theoretically, we show that SS-NMF provides a general framework for semi-supervised clustering and that existing approaches can be considered as special cases of SS-NMF. Through extensive experiments conducted on publicly available data sets, we demonstrate the superior performance of SS-NMF for clustering documents.

关键词： Iterative algorithms Clustering algorithms Symmetric matrices Data mining Databases Clustering methods Couplings machine vision Pattern recognition computer graphics

来源：评论

学校读者我要写书评

暂无评论

Design of a Low Power Multiply-Accumulator for 2D Convolution in Video Processing Applications

Design of a Low Power Multiply-Accumulator for 2D Convolutio...

引用

International Conference on Information Technology: New Generations (ITNG)

作者： Hau T. Ngo Vijayan K. Asari Computational Intelligence and Machine Vision Laboratory Department of Electrical and Computer Engineering Old Dominion University Norfolk VA USA

ISBN: (纸本)0769527760;9780769527765

Design of a low power multiply-and-accumulator (MAC) unit for video processing systems exploiting insignificant bits in pixels values and the similarity of neighboring pixels in video streams is presented in this paper. The proposed technique reduces dynamic power consumption by analyzing the bit patterns in the input data to reduce switching activities. Special values of the pixels in the video streams such as zero, one, repeated values or repeated bit combinations are detected and data paths in the architecture design are disabled appropriately to eliminate unnecessary switching in arithmetic units and data buses. It is observed that the proposed scheme helps to reduce operations and switching activities in the MAC unit up to 30% which results in lower power consumption with low hardware overhead

关键词： Convolution Energy consumption Frequency Clocks Arithmetic Capacitance Streaming media Adders Application software Hardware

来源：评论

学校读者我要写书评

暂无评论

Regional Variance Dependant Sub-frame Reduction for Face Detection in High Definition Video Frames

Regional Variance Dependant Sub-frame Reduction for Face Det...

引用

Applied Imagery Pattern Recognition Workshop (AIPR)

作者： Adam R. Livingston Vijayan K. Asari Computational Intelligence & Machine Vision Laboratory Electrical and Computer Engineering Department Old Dominion University Norfolk VA USA

ISBN: (纸本)9781424431625

Statistical learning based face detection systems search multiple scale sub-frames of an image or frame of a video stream with a trained classifier to detect face objects. If the frame is large there will be a large number of these sub-frames. Sections of the frame with a regional variance below a predefined threshold do not need to be searched as it is not possible for a face to exist in these spaces. A preprocessing system to eliminate these low variance regions of a frame is presented in this paper. A top down quad-tree deconstruction of the frame is used to accomplish this task. Regional variance is computed and tested to determine if a given quadrant should be further broken down. If below a predefined threshold that region will be eliminated in a mask image. This procedure is continued until all sections are eliminated or a defined tree depth is reached. The resulting mask image is then smoothed and subjected to thresholding, merging the remaining valid search areas. The resulting filled mask is then used to determine whether a given sub-frame should be sent to a Viola-Jones face detection cascade. Preliminary results show promise in reducing the number of sub-frames that must be considered for detection, increasing the speed of the detection system.

关键词： Face detection High definition video Image coding Sensor arrays Face recognition Object detection Radar detection Detectors Image recognition Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：