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

dsp Forum - Future of Video Coding and Transmission

IEEE signal processing Magazine 2006年第6期23卷 76-82页

作者： Gary J. Sullivan Jens-rainer Ohm Antonio Ortega Edward Delp Anthony Vetro Mauro Barni ITU-T Video Coding Experts Group Microsoft Corp. Multimedia communication systems Coding and identification and services for mobile networks Fulbright scholarhip IEEE Signal Processing and Communications Societies Electrical and Computer Engineering Mitsubishi Electric Research Labs Cambridge Massachusetts University of Siena

来源：评论

学校读者我要写书评

暂无评论

Automatic Content-Based Image Retrieval Using Hierarchical Clustering Algorithms

Automatic Content-Based Image Retrieval Using Hierarchical C...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： K. Jarrah S. Krishnan Ling Guan Multimedia Research Laboratory (RML) and Signal Analysis Research Group (SAR) Ryerson University Toronto Canada Department of Electrical and Computer Engineering Ryerson University Toronto Canada Canada Research Chair Multimedia Research Laboratory (RML) Toronto Canada

The overall objective of this paper is to present a methodology for guiding adaptations of an RBF based relevance feedback network, embedded in automatic content-based image retrieval (CBIR) systems, through the principle of unsupervised hierarchical clustering. The self organizing tree map (SOTM) is essentially attractive for our approach since it not only extracts global intuition from an input pattern space but also injects some degree of localization into the discriminative process such that maximal discrimination becomes a priority at any given resolution. The main focus of this paper is two-fold: introducing a new member of SOTM family, the Directed SOTM (DSOTM) that not only provides a partial supervision on duster generation by forcing divisions away from the query class, but also presents a flexible verdict on resemblance of the input pattern as its tree structure grows; and modifying the current structure of the normalised graph cuts (Ncut) process by enabling the algorithm to determine appropriate number of clusters within an unknown dataset prior to its recursive clustering scheme through the principle of self-organizing normalized graph cuts (SONcut). Comprehensive comparisons with the Self-Organizing feature Map (SOFM), SOTM, and Ncut algorithms demonstrate feasibility of the proposed methods.

关键词： Image retrieval Content based retrieval Clustering algorithms Iterative algorithms Humans Focusing DC generators Tree data structures Feedback Shape

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT AND AUTOMATIC ABDOMINAL IMAGE REGISTRATION BASED ON ACTIVE CONTOUR

引用

IFAC Proceedings Volumes 2006年第18期39卷 267-272页

作者： Xiu Ying Wang Cherry Ballangan David Feng Biomedical and Multimedia Information Technology (BMIT) Group School of Information Technologies F09 The University of Sydney NSW 2006 Australia School of Computer Science and Technology Heilongjiang University Harbin 150080 P.R. China . Informatics Department Petra Christian University Indonesia Center for Multimedia Signal Processing Department of Electronic and Information Engineering Hong Kong Polytechnic University

Image registration is critical for making diagnostic decision and essential for image-guided surgery. To improve the quality and accuracy of healthcare, efficient registration is highly demanded. However, because of the non-rigid deformations caused by heartbeat and breath, abdominal image registration remains a challenging task. To address these issues, an automatic and elastic registration for abdominal images is proposed. The algorithm is divided into three steps: efficient non-iterative affine registration; elastic motion field extraction based on active contours; elastic registration based on motion field. The validation of the method on monomodality and multimodality abdominal images has demonstrated that the algorithm is reliable and efficient.

关键词： image registration affine transformations mean-square error computer vision

来源：评论

学校读者我要写书评

暂无评论

An optimized systolic array architecture for full search block matching algorithm and its implementation on FPGA chips

An optimized systolic array architecture for full search blo...

引用

3rd International IEEE Northeast Workshop on Circuits and Systems Conference, NEWCAS 2005

作者： Mohammadzadeh, Masoud Eshghi, Mohammad Azadfar, M. Mahdy ECE Faculty Shahid Beheshti University Iran Telecom Research Center Electrical and Computer Engineering Faculty Shahid Beheshti University Multimedia and Signal Processing Group Iran Telecom Research Center

ISBN: (纸本)0780389344

In this paper, an optimized systolic array architecture for FSBMA is presented. This Array Architecture is implemented by RTL-level VHDL. It is synthesized for two FPGA families, Xilinx Spartan II and Xilinx Virtex II and the results for area occupation and maximum operating frequency are presented. The results show this array architecture is suitable for real-time video encoding systems with minimum hardware utilization and high performance. © 2005 IEEE.

关键词： Field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

Characterization of a cascade LMS predictor

Characterization of a cascade LMS predictor

引用

2005 IEEE International Conference on Acoustics, Speech, and signal processing, ICASSP '05

作者： Huang, D.Y. Su, X. Nallanathan, A. Multimedia Signal Processing Laboratory Media Division Institute for Infocomm Research 21 Heng Mui Keng Terrace Singapore 119613 Singapore Department of Electrical and Computer Engineering National University of Singapore Singapore 119260 Singapore

ISBN: (纸本)0780388747

In this paper, an FIR cascade structure for adaptive linear prediction is studied in which each stage FIR filter is independently adapted using LMS algorithm. The theoretical analysis shows that the cascade performs a linear prediction in a way of successive refinement and each stage tries to obliterate the dominant mode of its input. Experimental results show that the performance of the cascade LMS predictor are in good agreement with our theoretical analysis. ©2005 IEEE.

关键词： signal filtering and prediction

来源：评论

学校读者我要写书评

暂无评论

A frequency domain sphericity test based approach for parsimonious rake receivers in CDMA systems

A frequency domain sphericity test based approach for parsim...

引用

8th International Symposium on signal processing and its Applications, ISSPA 2005

作者： El-Sallam, Amar Abd Leung, Yee H. Zoubir, Abdelhak M. Communications and Signal Processing Group Department of Electrical and Computer Engineering Curtin University of Technology GPO Box U1987 Perth WA 6845 Australia Signal Theory Group Institute for Communication Technology Darmstadt University of Technology Merckstrasse 25 D-64283 Germany

ISBN: (纸本)0780392434

A frequency domain approach is presented for parsimonious channel estimation which can result in the implementation of a low complexity DS-CDMA RAKE receiver. We consider frequency selective slowly fading channels. A new approach is proposed to identify and estiamte only significant channel parameters. The approach uses the sphericity test and delay estimation methods based on averaged periodogram techniques. Simulations show that, with short training sequences and low signal to noise ratio, the proposed technique can correctly identify the significant channel parameters. Also the parsimonious RAKE receiver based on these estimates gives improved statistical as well as computational performance over classical methods. © 2005 IEEE.

关键词： Frequency domain analysis

来源：评论

学校读者我要写书评

暂无评论

Complexity Control in Semantic Identification

Complexity Control in Semantic Identification

引用

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)

作者： M. Falelakis C. Diou A. Valsamidis A. Delopoulos Multimedia Understanding Group Information Processing Laboratory Department of Electrical and Computer Engineering Aristotle University of Thessaloniki Greece

This paper proposes a methodology for modeling the process of semantic identification and controlling its complexity and accuracy of the results. Each semantic entity is defined in terms of lower level semantic entities and low level features that can be automatically extracted, while different membership degrees are assigned to each one of the entities participating in a definition, depending on their importance for the identification. By selecting only a subset of the features that are used to define a semantic entity both complexity and accuracy of the results are reduced. It is possible, however, to design the identification using the metrics introduced, so that satisfactory results are obtained, while complexity remains below some required limit

关键词： Encyclopedias Automatic control Brightness Information processing Laboratories Content management Standardization MPEG 7 Standard Data mining Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Dynamic Semantic Identification with Complexity Constraints as a Knapsack Problem

Dynamic Semantic Identification with Complexity Constraints ...

引用

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)

The process of automatic identification of high level semantic entities (e.g., objects, concepts or events) in multimedia documents requires processing by means of algorithms that are used for feature extraction, i.e. low level information needed for the analysis of these documents at a semantic level. This work copes with the high and often prohibitive computational complexity of this procedure. Emphasis is given to a dynamic scheme that allows for efficient distribution of the available computational resources in application. Scenarios that deal with the identification of multiple high level entities with strict simultaneous restrictions, such as real time applications

关键词： Data mining Feature extraction Algorithm design and analysis Computational efficiency Encyclopedias Information processing Laboratories Information analysis Text analysis Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Edge detection: Wavelets versus conventional methods on DSP processors

引用

Machine Graphics and Vision 2005年第1期14卷 83-101页

作者： Abdel-Qader, Ikhlas M. Maddix, Marie E. Electrical and Computer Engineering Department College of Engineering and Applied Sciences Western Michigan University Kalamazoo MI 49008 ECE Department WMU Center College of Engineering and Applied Sciences Western Michigan University IEEE Accoustics Speech and Signal Processing Society IEEE Engineering in Medicine and Biology Society Society of Women Engineers Honor Society of Phi Kappa Phi Sigma Xi Scientific Research Society Tau Beta Pi Engineering Honors Fraternity Eaton Corporation Current Product Engineering Group

Edge detection is a cornerstone in any computer, robotic or machine vision system. Real time edge detection is a pre-process to many critical applications, such as assembly line inspection and surveillance. Wavelets-based algorithms are replacing traditional algorithms, especially the Haar wavelet because of its simplicity. The Haar algorithm uses a multilevel decomposition to produce image edges corresponding to high frequency wavelet coefficients. In this paper, a real time edge detection algorithm based on Haar is analyzed and compared to conventional edge detectors. Other implemented and compared algorithms are the traditional Prewitt algorithm, and, from a newer generation, the Canny algorithm. The real time implementation of all algorithms is accomplished using TI TMS320C6711 card. In case of Haar, the multilevel decomposition improves the results obtained with noisy images. The results show that the Haar-based edge detector has a low execution time with accurate edge results, and thus represents a suitable algorithm for on-line vision system applications. Canny has produced the thinnest edges, but is not suitable for real time processing using the 6711, and falls short in edge results compared to the Haar results. The wavelet-based algorithm has outperformed other edge detectors.

关键词： Edge detection

来源：评论

学校读者我要写书评

暂无评论

Characterization of a cascade LMS predictor

Characterization of a cascade LMS predictor

引用

International Conference on Acoustics, Speech, and signal processing (ICASSP)

作者： D.Y. Huang X. Su A. Nallanathan Multimedia Signal Processing Laboratory/Media Division Institute for Infocomm Research Singapore Department of Electrical and Computer Engineering National University of Singapore Singapore

An FIR cascade structure for adaptive linear prediction is studied in which each stage FIR filter is independently adapted using an LMS algorithm. Theoretical analysis shows that the cascade performs a linear prediction in a way of successive refinement and each stage tries to obliterate the dominant mode of its input. Experimental results show that the performance of the cascade LMS predictor are in good agreement with our theoretical analysis.

关键词： Least squares approximation Finite impulse response filter Convergence Performance analysis signal analysis Adaptive signal processing Laboratories signal processing algorithms Speech coding Video coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：