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

2005 International Conference on parallel and distributed processing Techniques and Applications, PDPTA'05

作者： Shu-Guang, Ji Liu, Dan Zhangzhang Institute of Nautical Science Technology Dalian Maritime University Dalian Liaoning 116026 China

ISBN: (纸本)9781932415582

A review on the fractal image compression coding and the improvement measures are provided in this paper. The development process of the fractal image compression coding is introduced briefly. Some basic mathematic theories about the fractal image compression coding are given. The main problems which exist in the fractal compression coding bring into focus. Some traditional and new methods about the fractal image compression coding are discussed. The advantages and disadvantages of these methods are comprehensively analy ed. And the mixture of these methods is concerned. It is believed that the fractal image compression coding will be one of the most effective methods in the field of digital image coding.

关键词： Fractals

来源：评论

学校读者我要写书评

暂无评论

A proposal of parallel strategy for global wavelet-based registration of remote-sensing images

引用

6th International Conference on Algorithms and Architectures for parallel processing

作者： Zhou, HF Tang, Y Yang, XJ Liu, HZ Natl Univ Def Technol Sch Comp Changsha Peoples R China

ISBN: (纸本)3540292357

With the increasing importance of multiple multiplatform remote sensing missions, digital image registration has been applied into many fields, and specially plays a very important role in remotely sensed data processing. Firstly a brief introduction of existing parallel methods of wavelet-based global registration is given. And then the communication optimization for GP method is described. The optimized algorithm is named Group-Optimized-parallel (GOP for short). To find out the reason of occasionally lower efficiency of GOP than other methods, a more careful analysis is presented in theory and proved in experiments. Moreover, we give a quantitative criterion, called Remainder Items, to choose the best solution in different input conditions.

关键词： image processing

来源：评论

学校读者我要写书评

暂无评论

Performance comparison of mirrored disk scheduling methods with a shared non-volatile cache

引用

distributed AND parallel DATABASES 2005年第3期18卷 253-281页

作者： Thomasian, A Liu, C New Jersey Inst Technol Dept Comp Sci Newark NJ 07102 USA

Mirrored disks or RAID1 is a popular disk array paradigm, which in addition to fault-tolerance, doubles the data access bandwidth. This is important in view of rapidly increasing disk capacities and the slow improvement in disk access time. Caching of dirty data blocks in a non-volatile storage (NVS) cache allows the destaging of dirty blocks to be deferrable, so as to improve the response time of read requests by giving them a higher priority than write requests. Destaging of dirty blocks in batches to take advantage of disk geometry entails in lowered disk utilization due to writes and improved performance for reads. Polyzois et al. [12] propose a scheduling policy for mirrored disks equipped with an NVS cache, so that one disk processes read requests, while the other disk is processing a write batch according to the CSCAN policy. We propose an improved scheduling policy as follows: (i) eliminating the forced idleness caused by the batch processing paradigm for write requests, i.e., allowing write requests to be processed individually;(ii) using SATF or even an exhaustive search, to reduce destaging time compared to CSCAN;(iii) introducing a threshold for the number of read requests, which when exceeded defers the destaging of dirty blocks. We compare these two scheduling policies with each other and also against prioritizing the processing of reads versus writes: (i) the head-of-the-line (HOL) priority queueing discipline, (ii) SATF with conditional priorities. It follows from simulation results that the new method outperforms Polyzois' method, which is even outperformed by the HOL priority policy. SATF with conditional priorities slightly outperforms the proposed method from the viewpoint of its throughput and response time, but is susceptible to more variability in response time.

关键词： mirrored disks RAID1 non-volatile storage performance analysis disk scheduling queueing system simulation

来源：评论

学校读者我要写书评

暂无评论

3D visualization techniques and its usefulness of eyeground images data sets generated by Optical Coherence Tomography

3D visualization techniques and its usefulness of eyeground ...

引用

11th International Conference on parallel and distributed Systems

作者： Ito, F Doi, A Tokuda, M Faculty of Software and Information Science Iwate Prefectural University Japan Microtomography Corporation Japan

ISBN: (纸本)0769522815

Tomogram of eyeground images by Optical Coherence Tomography(OCT) are a set of the echo information on a minute portion by the scanning beam. These images contain many random noises and gap between images. images of OCT are strongly influenced of the motion-induced artifacts during the image acquisition, pulsation by the living body organization. Therefore, it is difficult to form 3D volume images. In this research, a noise removal of 2D images and position alignment processing were performed as a pretreatment of 3D visualization. 3D images contribute to medical treatment Of eyeground disease and informed consent. We utilized a texture-based volume rendering technique, and evaluated the usefulness of the 3D eyeground model in the medical treatment of eyeground disease.

关键词： image analysis

来源：评论

学校读者我要写书评

暂无评论

QoS resource management for cluster-based image retrieval systems

QoS resource management for cluster-based image retrieval sy...

引用

2005 International Conference on parallel and distributed processing Techniques and Applications, PDPTA'05

作者： Bruning, A. Geisler, S. Hoefer, M. Kao, O. Department of Computer Science Technical University of Clausthal Germany Department of Computer and Information Science University of Konstanz Germany Department of Computer Science Paderborn University Germany

ISBN: (纸本)9781932415582

This paper presents a novel concept for resource management in cluster-based image retrieval systems. First, the paper describes image retrieval using static and dynamic feature extraction. The complexity of dynamic feature extraction requires the utilization of powerful parallel architectures and in order to provide the user with reasonable response times. Most existing methods for resource management in parallel image retrieval systems are based on sinlge query execution and do not take quality of service (QoS) aspects into account. This appears not to be practical in large-scale and commercial applications of image databases having a large number of users at any time. In order to allow an efficient utilization of the parallel system and to meet user-defined QoS demands associated with queries, we need to develop a new concept and a novel resource management architecture. Interesting aspects of the model include utility theory, flexible computations, QoS levels, and a hierarchical resource management architecture. Finally, an approach for algorithmic solution is described.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Proceedings: 2005 International Conference on parallel processing Workshops

Proceedings: 2005 International Conference on Parallel Proce...

引用

International Conference on parallel processing Workshops 2005, ICPP 2005

The proceedings contain 74 papers. The topics discussed include: web services composition for distributed data mining;how to run scientific applications over web services;resource management services for a grid analysis environment;a comparison of two methods for building astronomical image mosaics on a grid;gene sequence alignment on a public computing platform;parallel module network learning on distributed memory multiprocessors;a scalable parallel poisson solver in three dimensions with infinite-domain boundary conditions;factoring solution sets of polynomial systems in parallel;a programmable array processor architecture for flexible approximate string matching algorithms;and speculative parallel threading architecture and compilation.

关键词： World Wide Web

来源：评论

学校读者我要写书评

暂无评论

parallel computation of adjoint sensitivities for 3D n optical image reconstruction

Parallel computation of adjoint sensitivities for 3D n optic...

引用

2005 International Conference on parallel and distributed processing Techniques and Applications, PDPTA'05

作者： Ye, Y. Zhang, C. Ali, A. Qiao, J. Department of Computational Science and Statistics University of Southern Mississippi Hattiesburg MS United States Department of Mathematics Computer Science and Physics Converse College Spartanburg SC United States

ISBN: (纸本)1932415602

One of the most significant challenges in fluorescence-enhanced optical tomography is the repeated calculation of Jacobian sensitivity matrix. An adjoint sensitivity method is more computationally efficient than other methods to compute the sensitivity, but its serial implementation is not sufficient for real-time large scale 3D reconstruction system due to the intensive computation overhead of the inverse problem and the limitation of the single computer resources. A vectorized implementation of a sequential algorithm has been applied for adjoint sensitivity computation on a single computer. In this paper, we present an extension of this algorithm to parallel computing environment, in which mesh data decomposition is used to compute the Jacobian matrix over multiple processors. We discuss and compare the performance of the parallel algorithm implemented on both the network of Dell PC workstations and the SGI Onyx3400 shared memory MIMD system.

关键词： Jacobian matrices

来源：评论

学校读者我要写书评

暂无评论

Evaluation of the hybrid multithreading programming model using image processing transforms

Evaluation of the hybrid multithreading programming model us...

引用

19th IEEE International parallel and distributed processing Symposium, IPDPS 2005

作者： Jidin, Razali Andrews, David Peck, Wesley Chirpich, Dan Stout, Kevin Gauch, John Information Technology and Telecommunications Center Department of Electrical Engineering and Computer Science University of Kansas

ISBN: (纸本)0769523129

Hybrid chips containing both CPU's and FPGA components promise the potential of providing a unified platform for seamless implementation of hardware and software co-designed components. Realizing the potential of these new hybrid chips requires new high level programming model capabilities that support a far more integrated view of the CPU and FPGA components than is achievable with current methods. The KU Hybrid Threads project has been investigating extending the familiar multithreaded programming model across this CPU/FPGA boundary to support both FPGA based hardware and CPU based software threads. Adopting this generalized multithreaded model can lead to programming productivity improvement, while at the same time providing the benefit of customized hardware from within a familiar software programming model. In this paper we present an application study of our hybrid multithreaded model. We have implemented several image-processing functions in both hardware and software, but from within the common multithreaded programming model on a XILINX V2P7 FPGA. This example demonstrates hardware and software threads executing concurrently using standard multithreaded synchronization primitives transforming real-time images captured by a camera and display it on a workstation.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Phase diversity restoration of sunspot images -: ii.: Dynamics around a decaying sunspot

引用

ASTRONOMY & ASTROPHYSICS 2005年第3期430卷 1089-1097页

作者： Bonet, JA Márquez, I Muller, R Sobotka, M Roudier, T Inst Astrofis Canarias Tenerife 38205 Spain Observ Pic Du Midi & Toulouse F-65008 Tarbes France Acad Sci Czech Republ Inst Astron CS-25165 Ondrejov Czech Republic Univ La Laguna Dept Anal Matemat Tenerife 38271 Spain

Two time series, taken simultaneously in the G-band and in white-light, and corrected for telescope aberrations and turbulence perturbations using the method of phase diversity, are employed to study the motions of granules and G-band bright points (GBPs) in the moat of an old regular sunspot. Local correlation tracking and feature tracking have been utilized for this purpose. A large-scale radial outflow with a mean velocity of 0.51 km s(-1) has been measured in the sunspot moat. Centres of diverging horizontal motions, identified with families of granules formed by repeatedly splitting granules, move away from the sunspot. Most of the GBPs in the moat also move outwards through radially orientated "channels" ( confined between the borders of adjacent families) with velocities comparable to those of the adjacent granules. However, 6% of the GBPs move faster (> 1.4 km s(-1)) than the neighbouring granules. GBPs in the moat are not regularly distributed but they are less frequent on its solar centre side.

关键词： Sun : photosphere Sun : sunspots methods : data analysis Sun : granulation Sun : magnetic fields techniques : image processing

来源：评论

学校读者我要写书评

暂无评论

Some new parallel fast Fourier transform algorithms

Some new parallel fast Fourier transform algorithms

引用

6th International Conference on parallel and distributed Computing, Applications and Technologies, PDCAT 2005

作者： Zhong, Cui-Xiang Han, Guo-Qiang Huang, Ming-He School of Computer Science and Engineering South China University of Technology Guangzhou 510640 Guangdong China Software College Jiangxi Normal University Nanchang 330027Jiangxi China

ISBN: (纸本)0769524052

Discrete Fourier transform (DFT) has many applications in digital signal and image processing and other scientific and technological domains, but its time complexity of direct computation is O(n2), limiting greatly its application range. Thus many people have developed fast Fourier transform (FFT) algorithms, reducing the complexity from O(n2) to O(nlogn)(In this paper logn denotes log2n).But for large n, O(nlogn) is still very high. So multiprocessor systems have been used to speed up the computation of DFT. This paper first introduces a new general method to deduce FFT algorithms, then transforms the deduced second radix-2 decimation-in-time FFT algorithm into another parallelizable sequential form, and finally transforms the latter algorithm into a new parallel FFT algorithm, reducing the time complexity of DFT to O(nlogn/p) (where p is the number of processors). Using similar methods, the authors can also design other new parallel 1-D and 2-D FFT algorithms. © 2005 IEEE.

关键词： Discrete Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：