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

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

作者： Tang, Xiaoli Pearlman, William A. Center for Image Processing Research Electrical Computer and Systems Engineering Department Rensselaer Polytechnic Institute Troy NY 12180-3590

ISBN: (纸本)0780388747

Here we propose scalable Three-Dimensional Set Partitioned Embedded bloCK (3D-SPECK)-an embedded, block-based, wavelet transform coding algorithm of low complexity for hyperspectral image compression. Scalable 3D-SPECK supports both SNR and resolution progressive coding. After wavelet transform, 3D-SPECK treats each subband as a coding block. To generate SNR scalable bitstream, the stream is organized so that the same indexed bit planes are put together across coding blocks and subbands, so that the higher bit planes precede the lower ones. To generate resolution scalable bitstreams, each subband is encoded separately to generate a sub-bitstream. Rate is allocated amongst the sub-bitstreams produced for each block. To decode the image sequence to a particular level at a given rate, we need to encode each subband at a higher rate so that the algorithm can truncate the sub-bitstream to the assigned rate. Resolution scalable 3D-SPECK is efficient for the application of an image server. Results show that scalable 3D-SPECK provides excellent performance on hyperspectral image compression. © 2005 IEEE.

关键词： image coding

来源：评论

学校读者我要写书评

暂无评论

A clique of active appearance models by minimum description length

A clique of active appearance models by minimum description ...

引用

2005 16th British Machine Vision Conference, BMVC 2005

作者： Langs, Georg Peloschek, Philipp Donner, René Bischof, Horst Institute for Computer Graphics and Vision Graz University of Technology Austria Department of Diagnostic Radiology Medical University of Vienna Austria Pattern Recognition and Image Processing Group Vienna University of Technology Austria

ISBN: (纸本)1901725294

Autonomous model building is a crucial trend in model based methods like AAMs. This paper introduces an approach that deals with non-linearities by detecting distinct sub-parts in the data. Sub-models each representing an individual sub-part are derived from a minimum description length criterion. Thereby the resulting clique of models is more compact and obtains a better generalization behavior than a single model. The proposed AAM clique generation deals with non-linearities in the data in a generic information theoretic manner reducing the necessity of user interaction during training.

关键词： Information theory

来源：评论

学校读者我要写书评

暂无评论

A robust matching algorithm for active appearance models 1

引用

Workshops Bildverarbeitung fur die Medizin: Algorithmen - Systeme - Anwendungen, BVM 2005 - Workshop on image processing for Medicine: Algorithms - Systems - Applications, BVM 2005

作者： Beichel, Reinhard Bischof, Horst Langs, Georg Sonka, Milan Institute for Computer Graphics and Vision Graz University of Technology Inffeldgasse 16/2 A-8010 Graz Austria Pattern Recognition and Image Processing Group Vienna University of Technology Favoritenstr. 9 A-1040 Vienna Austria Department of Electrical and Computer Engineering University of Iowa Iowa City IA 52242 United States

ISBN: (数字)9783540264316

ISBN: (纸本)3540250522

This paper proposes a method for robustly matching active appearance models (AAMs) on images with gross disturbances (outliers). The method consists of two steps. First, an initial residual is calculated by comparing model and image appearance, and modes of the residual are analyzed. Second, all possible mode combinations are tested by evaluating an objective function. The objective function allows the selection of an outlier-free mode combination. Experiments demonstrate the ability of the robust matching method to successfully cope with outliers - compared to standard AAM matching, no degeneration of the model during matching occurs.

关键词： Statistics

来源：评论

学校读者我要写书评

暂无评论

Scalable hyperspectral image coding

Scalable hyperspectral image coding

引用

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

作者： Xiaoli Tang W.A. Pearlman Center for Image Processing Research Electrical Computer and Systems Engineering Department Rensselaer Polytechnic Institute Troy NY USA

Here we propose scalable three-dimensional set partitioned embedded block (3D-SPECK) - an embedded, block-based, wavelet transform coding algorithm of low complexity for hyperspectral image compression. Scalable 3D-SPECK supports both SNR and resolution progressive coding. After wavelet transform, 3D-SPECK treats each subband as a coding block. To generate SNR scalable bitstream, the stream is organized so that the same indexed bit planes are put together across coding blocks and subbands, so that the higher bit planes precede the lower ones. To generate resolution scalable bitstreams, each subband is encoded separately to generate a sub-bitstream. Rate is allocated amongst the sub-bitstreams produced for each block. To decode the image sequence to a particular level at a given rate, we need to encode each subband at a higher rate so that the algorithm can truncate the sub-bitstream to the assigned rate. Resolution scalable 3D-SPECK is efficient for the application of an image server. Results show that scalable 3D-SPECK provides excellent performance on hyperspectral image compression.

关键词： Hyperspectral imaging image coding Hyperspectral sensors Partitioning algorithms Scalability Streaming media image resolution Frequency Transform coding Wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

An interaction interface for multiple agents on shared 3D display

An interaction interface for multiple agents on shared 3D di...

引用

2nd International Conference on Cooperative Design, Visualization, and Engineering, CDVE 2005

作者： Choi, Jeong-Dan Hwang, Chi-Jeong Telematics Solution Research Team Telematics and RFID Research Department Electronic and Telecommunications Research Institute 161 Gajeong-dong Yuseong-gu Dajeon 305-350 Korea Republic of Image Processing Laboratory Computer Engineering Department Chungnam National University 220 Gung-dong Yuseong-gu Daejeon 305-764 Korea Republic of

ISBN: (纸本)3540289488

In the multi-user VR game, wide stereoscopic display is an important component that supports immersion and perception to the gamer. Because the space in front of the display allows multi-participants to collaborate and guarantees view with the entire field of view for each user. This paper describes a method to integrate user interfaces for interactions among users wear VR devices on wide stereoscopic display. The key technologies of our proposed system include the problems of coordination with various devices to treat user events in real-time, synchronization of PC clusters which renders the VR contents, and seamless display of multi-channel display surfaces. To accomplish this, we propose a VR game display platform composed of multi-projectors, stereoscopic see-through head mounted device, and gesture recognition system for collaborative interactions. Our preliminary results showed that the proposed strategy well suits high resolution application at real-time frame rate for VR game. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Display devices

来源：评论

学校读者我要写书评

暂无评论

Method for automatically segmenting the spinal cord and canal from 3D CT images

引用

11th International Conference on computer Analysis of images and Patterns, CAIP 2005

作者： Nyúl, Lászlo G. Kanyó, Judit Máté, Eörs Makay, Géza Balogh, Emese Fidrich, Márta Kuba, Attila Department of Image Processing and Computer Graphics University of Szeged Árpád tér 2 H-6720 Szeged Hungary Clinical Software Engineering GE Medical Systems Lajos u. 48-66 H-1036 Budapest Hungary Institute of Mathematics University of Szeged Aradi vértanuk tere 1 H-6720 Szeged Hungary

ISBN: (纸本)3540289690

We present two approaches for automatically segmenting the spinal cord/canal from native CT images of the thorax region containing the spine. Different strategies are included to handle images where only part of the spinal column is visible. The algorithms require one seed point given on a slice located in the middle region of the spine, and the rest is automatic. The spatial extent of the spinal cord/canal is determined automatically. An extended region-growing technique is suggested for segmenting the spinal canal while active contours are applied if the spinal cord is to be segmented. Both methods work in 2D and use propagated information from neighboring slices. They are also very rapid in execution, that means an efficient, user-friendly workflow. The methods were evaluated by radiologists and were found to be useful (in reducing/eliminating contouring labor and time) and met the accuracy and repeatability requirements for the particular task. © Springer-Verlag Berlin Heidelberg 2005.

关键词： computerized tomography

来源：评论

学校读者我要写书评

暂无评论

Knot modifications of B-spline or NURBS Surface

引用

Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of computer-Aided Design and computer graphics 2005年第5期17卷 986-989页

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

Modifying some knots of a B-spline or NURBS surface of order k×h to generate a family of B-spline or NURBS surface is presented. We show that the envelope of the family is a B-spline or NURBS surface defined by the same control points, and its order is (k-a)×(h-b), where a, b are the multiplicity of the modified knots. Moreover, any order partial derivatives of the B-spline surface and the family of B-spline surfaces differ only in a multiplier. The presented results can be served as a theoretical guidance for surface modeling and shape modifications in computer aided design today.

关键词： B-spline surface Envelope Knots modification NURBS surface Shape modifications

来源：评论

学校读者我要写书评

暂无评论

Performing clustering analysis on collaborative models

Performing clustering analysis on collaborative models

引用

作者： Shen, Hongbin Yang, Jie Chen, Ningjiang Dong, Yifei Wang, Shitong Institute of Image Processing and Pattern Recognition Shanghai Jiaotong University Shanghai 200030 China Philips Research East Asia Shanghai 200070 China School of Computer Science and Engineering University of New South Wales Australia Department of Information Science Southern Yangtze University Wuxi Jiangsu 214036 China

Conventional clustering algorithms are designed for a single independent dataset, i.e. Fuzzy C-Means (FCM) clustering algorithm. In the real world, a dataset is independent of other datasets but sometimes can be cooperative with others by exchanging information, such as the relationship between subsidiary companies. We should therefore consider the influence from other relative collaborative datasets while performing clustering learning under such collaborative circumstances. In this paper, three different collaborative models are discussed and new correct methods are proposed to quantitatively measure such collaboration between datasets, i.e. information gain. The corresponding collaborative clustering algorithms are presented accordingly and the theoretical analysis shows that the new cooperative clustering algorithms can finally converge to a local minimum. Experimental results demonstrate that the clustering structures obtained by new cooperative algorithms are different from those of conventional algorithms for the consideration of collaboration and the performances of these collaborative clustering algorithms can be much better than those conventional single clustering algorithms under the cooperating circumstances. ©?2005-IOS Press and the authors. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Elastic wave propagation modeling on emulated digital CNN-UM architecture

Elastic wave propagation modeling on emulated digital CNN-UM...

引用

IEEE International Workshop on Cellular Nanoscale Networks and their Applications, (CNNA)

作者： P. Kozma P. Sonkoly P. Szolgay Department of Image Processing and Neurocomputing University of Veszprém Veszprem Hungary Department of Image Processing and Neurocomputing University of Veszprém Hungary Analogic and Neural Computing Laboratory Computer and Automation Research Institute Hungarian Academy of Sciences Budapest Hungary

The synthetic seismogram has seen many years of widespread and successful application in geophysical prospecting. It is used to simulate the normal incidence reflectivity of a heterogeneous medium and has been employed more recently to obtain the responses of subsurface structural and stratigraphic configurations. The propagation of seismic waves has to be modeled to create synthetic seismograms. The solution of the partial differential equations of motion describing the propagation of stress waves in an elastic medium requires enormous computation power. In this paper a solution of seismic wave propagation will be presented on CNN-UM architecture. Unfortunately the space-dependent equations and the low computational precision do not make it possible to utilize the huge computing power of the analog CNN-UM chips so the Falcon emulated digital CNN-UM architecture is used to implement our solution.

关键词： Partial differential equations computer architecture Cellular neural networks Geophysics computing Seismic waves Stress Analog computers image processing Very large scale integration Numerical models

来源：评论

学校读者我要写书评

暂无评论

Optimal sub-shape models by minimum description length

Optimal sub-shape models by minimum description length

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： G. Langs P. Peloschek H. Bischof Institute for Computer Graphics and Vision Graz University of Technology Graz Austria Pattern Recognition and Image Processing Group University of Technology Vienna Vienna Austria Department of Clinical Radiology Vienna Medical University Vienna Austria

Active shape models are powerful and widely used tool to interpret complex image data. By building models of shape variation they enable search algorithms to use a priori knowledge in an efficient and gainful way. However, due to the linearity of PCA, non-linearities like rotations or independently moving sub-parts in the data can deteriorate the resulting model considerably. Although non-linear extensions of active shape models have been proposed and application specific solutions have been used, they still need a certain amount of user interaction during model building. In this paper the task of building/choosing optimal models is tackled in a more generic information theoretic fashion. In particular, we propose an algorithm based on the minimum description length principle to find an optimal subdivision of the data into sub-parts, each adequate for linear modeling. This results in an overall more compact model configuration. Which in turn leads to a better model in terms of modes of variations. The proposed method is evaluated on synthetic data, medical images and hand contours.

关键词： Active shape model Biomedical imaging Principal component analysis computer vision Linearity Polynomials Pattern recognition computer graphics Radiology image processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：