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

Class-prioritized compression of multispectral imagery data

JOURNAL OF ELECTRONIC IMAGING 2002年第2期11卷 246-256页

作者： Saghri, JA Tescher, AG Omran, MGH Calif Polytech State Univ San Luis Obispo Dept Elect Engn San Luis Obispo CA 93407 USA Compress Sci Corp Inc Sunnyvale CA 95085 USA Al Andalus Kuwait Kuwait

A joint classification-compression scheme that provides the user with added capability to prioritize classes of interest in the compression process is proposed. The dual compression system includes a primary unit for conventional coding of a multispectral image set followed by an auxiliary unit to code the resulting error induced on pixel vectors that represent classes of interest. This technique effectively allows classes of interest in the scene to be coded at a relatively higher level of precision than nonessential classes. Prioritized classes are selected from a thematic map or directly specified by their unique spectral signatures. Using the specified spectral signatures of the prioritized classes as end members, a modified linear spectral unmixing procedure is applied to the original data as well as to the decoded data. The resulting two sets of concentration maps, which represent classes prioritized before and after compression, are compared and the differences between them are coded via an auxiliary compression unit and transmitted to the receiver along with a conventionally coded image set. At the receiver, the differences found are blended back into the decoded data for enhanced restoration of the prioritized classes. The utility of this approach is that it works with any multispectral compression scheme. This method has been applied to test the imagery from various platforms including NOAA's AVHRR (1.1 km GSD), and LANDSAT 5 TM (30 m GSD), LANDSAT 5 MSS (79 m GSD). (C) 2002 SPIE and IST.

关键词： Image compression Multispectral imaging Earth observing sensors Landsat algorithm development Associative arrays Image transmission Standards development Sensors Spatial resolution

来源：评论

学校读者我要写书评

暂无评论

Computational approach for edge linking

引用

JOURNAL OF ELECTRONIC IMAGING 2002年第4期11卷 479-485页

作者： Ghita, O Whelan, PF Dublin City Univ Sch Elect Engn Vis Syst Lab Dublin 9 Ireland

Efficient edge operators such as those based on partial derivatives fail to return continuous edge maps. To address this, a supplementary edge linking step is required to complete initial edge information. In this paper we. propose a fast and efficient algorithm for edge linking using local information around edge terminators. In order to minimize incorrect linking decisions, the direction and the linking path for each edge terminator are established by minimizing a cost function. The particular novelty of this approach lies in the labeling scheme which assigns the directionality of the. edge terminators (endpoints) based only on local knowledge. As a consequence, it relaxes the demand of a priori knowledge and furthermore assures an accurate and efficient search for edge paths in the image. (C) 2002 SPIE and IST.

关键词： Detection and tracking algorithms Edge detection Sensors Image processing Image restoration Image segmentation algorithm development Image analysis Image processing algorithms and systems Image resolution

来源：评论

学校读者我要写书评

暂无评论

Evaluation of algorithms for lossless compression of continuous-tone images

引用

JOURNAL OF ELECTRONIC IMAGING 2002年第1期11卷 75-86页

作者： Savakis, AE Rochester Inst Technol Dept Comp Engn Rochester NY 14623 USA

Lossless image compression algorithms for continuous-tone images have received a great deal of attention in recent years. However, reports on benchmarking their performance have been limited. In this paper, we present a comparative study of the following algorithms: UNIX compress, gzip, LZW, Group 3, Group 4, JBIG, old lossless JPEG, JPEG-LS based on LOCO, CALIC, FELICS, S + P transform, and PNG. The test images consist of two sets of eight bits/pixel continuous-tone images: one set contains nine pictorial images, and another set contains eight document images, obtained from the standard set of CCITT images that were scanned and printed using eight bits/pixel at 200 dpi. In cases where the algorithm under consideration could only be applied to binary data, the bitplanes of the gray scale image were decomposed, with and without Gray encoding, and the compression was applied to individual bit planes. The results show that the best compression is obtained using the CALIC and JPEG-LS algorithms. (C) 2002 SPIE and IST.

关键词： Image compression Computer programming Image processing algorithm development Data modeling Image quality standards Binary data Error analysis Bridges Photonic integrated circuits

来源：评论

学校读者我要写书评

暂无评论

Open standard development platforms for distributed sensor networks

Open standard development platforms for distributed sensor n...

引用

Conference on Unattended Ground Sensor Technologies and Applications IV

作者： Merrill, W Sohrabi, K Girod, L Elson, J Newberg, F Kaiser, W Sensoria Corp Culver City CA 90230 USA

ISBN: (纸本)0819444936

In the development of distributed security sensor networks a large variety of prototype systems have been implemented and tested. However these systems tend to be developer specific and require substantial overhead in demonstrating more than one application. To bridge the gap between embedded, networked. systems and desktop simulation environments, systems are necessary which are easily deployable and allow extended operation of distributed sensor networks, while allowing the flexibility to quickly test and evaluate a variety of operational algorithms. To enable fast optimization by leveraging the widest development community, open standards for such a portable development system are desired. An open development system allows individual developers and small groups to focus on and optimize specific aspects of a distributed sensor network within realistic deployment constraints, prior to complete integration and deployment of a system within a specific application. By providing an embedded sensor and processing platform with integrated wired and wireless networking, a modular software suite separating access and control of individual processes, and open APIs, algorithm development and software optimization can be greatly accelerated and more robustly tested. To meet the unique needs of distributed sensor network applications, additional separation must be provided between the access to various subsystems, for example real-time embedded control versus tasks with less stringent timing requirements. An open platform that separates these requirements allows developers to accelerate testing and development of applications by focusing on individual components of the distributed sensor system, such as target tracking or low power networking. The WINS NG 2.0 developer's platform, provided by Sensoria Corporation for the DARPA/ITO Sensor Information Technology (SensIT) program, provides one example of such a system. This systems bridge the gap between dedicated desktop develop

关键词： Sensors Standards development Sensor networks Sensing systems algorithm development Distributed computing Software development Telecommunications Control systems Embedded systems

来源：评论

学校读者我要写书评

暂无评论

Discrimination, tracking, and recognition of small and fast moving objects

Discrimination, tracking, and recognition of small and fast ...

引用

12th Conference on Automatic Target Recognition

作者： Wei, J Gertner, I CUNY City Coll Dept Comp Sci New York NY 10031 USA

ISBN: (纸本)0819444766

In military applications it is of utmost importance to detect and identify targets from Infra-Red (M) sequences. Usually the targets of interest are of small size and moving with great velocity. In addition, the IR sequences are extremely noisy due to rampant systemic noise incurred by the sensing instrument and the noise from the environment. In this paper, we developed a method which can effectively detect and identify the targets of interest from the noisy IR sequences using the manipulation of both the temporal, spectral, and spatial bandpass filtering. With this method, first a bandpass filtering in the spectral domain is conducted in order to remove noises, especially the systemic ones. Next the candidate target locations are declared through a spectral bandpassing from the temporal pixel process, where by taking advantage of the fact that the targets of interest are fast moving the background and random noises are largely removed. The estimated targets of interest for each IR frame are further refined after a post-processing in the spatial domain. The final targets of interest are then declared after a consistency check-up across adjacent IR frames by use of an adaptive Hough transform. Experimental results based on this proposed method have suggested desirable performance.

关键词： Bandpass filters Hough transforms Optical filters Image processing Target detection Sensors algorithm development Filtering (signal processing) Defense technologies Infrared sensors

来源：评论

学校读者我要写书评

暂无评论

Fingerprint image enhancement algorithm based on AM-FM model

Fingerprint image enhancement algorithm based on AM-FM model

引用

2nd International Conference on Image and Graphics

作者： Zhang, WW Wang, YS Chinese Acad Sci Natl Lab Pattern Recognit Inst Automat Beijing 100080 Peoples R China

ISBN: (纸本)0819446564

Fingerprint enhancement is a key issue in fingerprint minutiae extraction due to various image qualities. Most of exist fingerprint enhancement algorithms need to estimate the ridge orient and ridge distance, which are used to design the enhancement filter. However ridge distance estimation is a rather difficult task due to the fingerprint image quality and singularity, therefore, the ridge distance estimate usually fails in those case and leads to enhancement algorithm failed. In this paper, we propose an AM-FM based fingerprint image enhancement algorithm, which uses a novel Dominate Component Analysis (DCA) technique to estimate the dominate component, and uses band pass filter to enhance those component rather than directly estimate the ridge distance, ridge orientation. Experiment results show that our enhancement algorithm leads to significant image quality improvement as well as the system efficient.

关键词： Image enhancement Image filtering Image quality Image processing algorithms and systems Image segmentation Linear filtering algorithm development Image processing Detection and tracking algorithms Fingerprint recognition

来源：评论

学校读者我要写书评

暂无评论

Integrating visualization into the modeling of business simulations

引用

Simulation and Gaming 2002年第4期33卷 409-424页

作者： Perotti, Victor J. Pray, Thomas F. Rochester Institute of Technology United States College of Business Max Lowenthal Building Rochester NY 14623-5608 106 Lomb Memorial Drive United States

This article demonstrates the advantages of using visualization as part of the modeling process. Several examples are given to show how visualization can help developers to more completely understand the range of behaviors for their algorithms. Specifically, the Cobb Douglas function and Gold and Pray demand sytem are examined using a tool that combines mathematical modeling with visualization capabilities. © 2002 Sage Publications.

关键词： algorithm behavior algorithm development Business simulation Mathematica Model-ing Visualization

来源：评论

学校读者我要写书评

暂无评论

Relevant modelling & comparison of geometric distortions in watermarking systems

Relevant modelling & comparison of geometric distortions in ...

引用

Conference on Applications of Digital Image Processing XXV

作者： Delannay, D Setyawan, I Lagendijk, RL Macq, B Catholic Univ Louvain Commun & Remote Sensing Lab B-3000 Louvain Belgium

ISBN: (纸本)0819445576

A challenging aspect in the development of robust watermarking algorithms is the ability to withstand complex geometric distortion of the media. A few existing techniques are known to deal with such transformations up to a certain level. Traditionally, the measure of the degradation caused by an attack on an image only addressed the pixel value modification. However, a degradation consequent to the geometric distortion of an image cannot be measured with traditional criteria. Therefore the evaluation and comparison of the robustness to desynchronization of different watermarking schemes was not possible. In this paper, we present an innovative method to measure the distortion introduced by complex geometric deformations of an image. The distortion measure is expressed in term of how closely the applied transform can be approximated by a simpler transform model (e.g. RST transform, affine transform). The scheme relies on the local least square estimation of the parameters of the reference transform model. Eventually, we illustrate the proposed measure by presenting some results for different complex image distortions.

关键词： Digital watermarking algorithm development Image segmentation Systems modeling Detection and tracking algorithms Mathematical modeling Digital imaging Error analysis Image processing Resistance

来源：评论

学校读者我要写书评

暂无评论

Contour-based progressive coding of cutting plane data

Contour-based progressive coding of cutting plane data

引用

Conference on Visualization and Data Analysis 2002

作者： Guan, Y Moorhead, RJ Mississippi State Univ NSF Engn Res Ctr Starkville MS 39759 USA

ISBN: (纸本)0819444057

We present an efficient algorithm for progressive coding of cutting plane data extracted from large-scale computational field simulation (CFS) datasets. Since cutting planes are frequently used for examination of 3D simulation results, efficient compression of their geometry, topography, and the associated field data is important for good visualization performance, especially when the simulation is running on a geographically remote server or the simulation results are stored in a remote repository. Progressive coding is ideal for exploratory visualization since the data can be presented naturally starting with a coarse view and progressing down to the detail. In our algorithm, each cutting plane is reduced at the server to a set of triangle strips containing contour lines. On the local visualization machine (the client), the original surface is reconstructed by triangulating the space between the triangle strips. The more contour lines used, the higher the reconstruction accuracy obtained. It can quickly show an area of interest without modifying that section of the original triangle mesh. In generating the data to be sent to the client, the algorithm can smoothly trade-off computation and the accuracy of the representation by altering the cutting plane generation procedure or by adjusting the accuracy of the data.

关键词： Visualization Signal to noise ratio Phase modulation Visual compression Chromium Computer simulations Reconstruction algorithms algorithm development Transform theory Data centers

来源：评论

学校读者我要写书评

暂无评论

Fast invariant recognition for color 3D images based on Hurwitzon-valued moments and invariants

Fast invariant recognition for color 3D images based on Hurw...

引用

Conference on Wavelet and Independent Component Analysis Applications IX

作者： Labounets, V Labounets-Rundblad, E Astola, J Tampere Univ Technol Tampere Int Ctr Signal Proc FIN-33101 Tampere Finland

ISBN: (纸本)081944488X

There is currently a considerable interest in methods of invariant 3D image recognition. Indeed, very often information about 3D objects can be obtained by computer tomographic reconstruction, 3D magnetic resonance imaging, passive 3D sensors or active range finders. Due to that algorithms of systematic derivation of 3D moment invariants should be developed for 3D colour object recognition. In this work we proposed an elegant theory which allows to describe many such invariants. Our theory is based on the theory of triplet numbers and quaternions. We propose Hurwitzon valued invariants, which are related to the descriptions of objects as the zero sets of implicit polynomials. These are global invariants which show great promise for recognition of complicated objects. Hurwitzon-valued invariants have good discriminating power for computer recognition of 3D colour objects using statistical pattern recognition methods. For fast computation of Hurwitzon-valued invariants we us(, modular arithmetic of Galois fields and rings, which maps calculation of invariants to fast number theoretical Fourior-Galois-Hamilton transform.

关键词： 3D image processing RGB color model Atrial fibrillation Vector spaces algorithm development Colorimetry Quantum efficiency Detection and tracking algorithms Pattern recognition Sensors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：