This paper presents an approach to texture segmentation by thresholding based on compactness measures of fuzzy sets to determine thresholds of an ill-defined image. The extension of fuzziness in the texture feature sp...
详细信息
ISBN:
(纸本)1864352094
This paper presents an approach to texture segmentation by thresholding based on compactness measures of fuzzy sets to determine thresholds of an ill-defined image. The extension of fuzziness in the texture feature space provides more meaningful results than by considering fuzziness in gray scale domain. The effectiveness of the algorithm is demonstrated by comparison with other traditional non-fuzzy methods or the controversial fuzzy method in gray scale alone. In addition, the efficiency of our algorithm is further improved by parallel implementation using distributed shared memory workstations.
The proceedings contain 118 papers. The special focus in this conference is on. Euro-Par is the annual European Conference on parallelprocessing;parallel numerical algorithms;High Performance Computing, Application. ...
ISBN:
(纸本)3540616276
The proceedings contain 118 papers. The special focus in this conference is on. Euro-Par is the annual European Conference on parallelprocessing;parallel numerical algorithms;High Performance Computing, Application. The topics include: Optimization of the ScaLAPACK LU Factorization Routine Using Communication/Computation Overlap;On Experiments with a parallel Direct Solver for Diagonally Dominant Banded Linear Systems;The Computation of Partial Eigensolutions on a distributed Memory Machine Using a Modified Lanczos Method;The parallel Computation of Partial Eigensolutions of Large Matrices on a Massively parallel Processor;Preprocessing of Sparse Unassembled Linear Systems for Efficient Solution Using Element-by-element Preconditioners;Implementing The parallel Quasi-Laguerre's Algorithm for Symmetric Tridiagonal Eigenproblems;Comparing Task and Data parallel Excecution Schemes for the DiiRK Method;Numerical Turbulence Simulation on Different parallel Computers Using the Sparse Grid Combination Method;parallel Fourier-Motzkin Elimination;Comparison of Three Monte Carlo methods for Matrix Inversion;parallel Solution of the Volume Integral Equation of Electromagnetic Scattering;Optimization of parallel Multilevel-Newton Algorithms on Workstation Clusters;A Time and Space parallel Algorithm for the Heat Equation: The Implicit Collocation Method;parallelimage/Video processing, Computer Arithmetic;A High Performance image Database System for Remotely Sensed imagery;An Asynchronous parallel Algorithm for Symbolic Grouping Operations in Vision;A parallel Pipelined Hough Transform;High-Performance SAR-image Formation and Post-processing;A parallel Implementation of image Coding Using Linear Prediction and Iterated Functions Systems and parallel Algorithms for Using Non-Stationary MRA in image Compression.
The problem of mis-registration of 3D datasets is addressed for MR imaging of the breast. Three methods are examined and qualitative evidence of their performance is presented. A method of constrained principal axis d...
详细信息
ISBN:
(纸本)0819420859
The problem of mis-registration of 3D datasets is addressed for MR imaging of the breast. Three methods are examined and qualitative evidence of their performance is presented. A method of constrained principal axis determination is compared with a correlation method, and an orthogonal polynomial approach is extended into three dimensions. The most effective methods still remain relatively time consuming, and for the correlation method, paralleldistributed computing has been applied to reduce the time-to-solution.
The wavelet transform is a popular signal processing technique, particularly due to its impressive results in data compression. Its usefulness includes two-dimensional data for use in imageprocessing and three-dimens...
详细信息
ISBN:
(纸本)081942143X
The wavelet transform is a popular signal processing technique, particularly due to its impressive results in data compression. Its usefulness includes two-dimensional data for use in imageprocessing and three-dimensional data for use in video processing. In imageprocessing, the current trends are for image sizes which require a substantial amount of computing power;an application processing a 1024 by 1024 standard quality image requires many millions of processing steps per image frame. When processing sequences of these images for video, the throughput required is considerable in order to attain even low display rates. Three-based architectures have been proposed to provide this throughput rate by processing pixels in a data parallel fashion. Each level of the wavelet transform is processed using an array or a plane of processing elements operating in parallel on shared or distributed data. The largest of these architectures, the plane-based H-tree design, provides a real-time, pipelineable implementation of the 2DWT, but is costly in terms of VLSI area due to its requirement of O(n2) processors for a n by n data-set. In this paper, we look at methods for improving the practicality of these architectures by reducing the required area for a given problem size. This is achieved by adding extra processors at the root of the tree, which allows processing of larger images with an insignificant addition of hardware in exchange for a detrimental effect on the processing speed. We conclude the paper by presenting area/time trade-offs which can be used to evaluate cost/performance specifications.
The proceedings contain 26 papers. The special focus in this conference is on parallel I/O and parallel Hardware. The topics include: Flexibility and performance of parallel file systems;study of data distribution str...
ISBN:
(纸本)3540616950
The proceedings contain 26 papers. The special focus in this conference is on parallel I/O and parallel Hardware. The topics include: Flexibility and performance of parallel file systems;study of data distribution strategies for parallel I/O management;an experimental evaluation of the parallel I/O systems of the IBM SP and intel paragon using a production application;a scalable interconnection structure for distributed computing;performance aspects of virtual circuit connections over a local ATM network;new results of the salzburg NTN-method for the radon transform;parallel computation of optimal parameters for pseudo random number generation;parallel evaluation of multi-join queries;skew handling in the DBS3 parallel database system;dynamic declustering methods for parallel grid files;encapsulation of intra-operation parallelism in a parallel match operator;synthetic workload generation for parallelprocessing systems;parallel program visualization with MUCH;heuristics to optimize the speed-up of parallel programs;vectorization of visualization algorithms;parallel chaotic iterative algorithms for image reconstruction with limited projection data;the parastation project;a new language for automatic data generation;horizontal fragmentation in distributed object database systems;implementing snapshot protocol for message based communication libraries;a data structure for data dependence analysis in programs with pointers;a partition method for solving block pentadiagonal linear system on intel hypercube iPSC/860 and parallelimageprocessing by using homogeneous computing structures.
The detection of small, hostile targets in multispectral imagery is generally complicated by sensor noise, atmospheric obscurants, and spatial distortions induced by the point-spread function (PSF). Traditional method...
详细信息
ISBN:
(纸本)0819421391
The detection of small, hostile targets in multispectral imagery is generally complicated by sensor noise, atmospheric obscurants, and spatial distortions induced by the point-spread function (PSF). Traditional methods for multispectral detection of small targets, such as signature- based discrimination predicated upon deterministic physical models, have not proven robust in the presence of camera noise at low light levels. The additional problem of target variability also confounds a signature-based approach. Due to time-dependent variations in illuminant spectra response, targets can appear to have different spectral properties at different times of day and under various weather conditions. In this paper, we discuss computationally efficient methods for locating targets that differ spectrally from their spatially adjacent backgrounds but are similar to features located elsewhere in the source image. In particular, we note that flicker effects can be produced in which target intensity appears to vary differently with background intensity. Such effects are produced computationally by cyclic overlay processing (COP), which sequentially displays monospectral band images to achieve different perceived flicker rates of target and background. When combined with knowledge about the human visual system (HVS), COP can be successfully used in conjunction with neighborhood operations to segment target regions in highly cluttered imagery. We emphasize the role of target-background contrast in potentiating flicker effects, and discuss algorithms for computing COP. Analyses emphasize computational cost and effectiveness of various COP filter configurations for detecting targets that are similar to, or partially obscured by, surrounding cover or earth. We also discuss the implementation of our algorithms on parallel processors, in particular, the parallel algebraic logic (PAC) architecture currently being implemented in cooperation with Lockheed- Martin and USAF Wright Laboratory
The proceedings contain 76 papers. The special focus in this conference is on Applied parallel Computing Industrial Computation and Optimization. The topics include: Performance tuning IBM RS/6000 POWER2 systenls;digi...
ISBN:
(纸本)3540620958
The proceedings contain 76 papers. The special focus in this conference is on Applied parallel Computing Industrial Computation and Optimization. The topics include: Performance tuning IBM RS/6000 POWER2 systenls;digital imageprocessing;use of parallel computations for account of options by a monte carlo method;wavelets and differential equations;from first princlples to industrial applications;parallel implementation of a schwarz domain decomposition algorithm;practical experience in the dangers of heterogeneous computing;coupling the advection and the chemical parts of large air pollution models;advanced optimizations for parallel irregular out-of-core programs;a software architecture for massively parallel input-output;spatial genetic algorithm and its parallel implementation;addressing algebra as a tool for parallel program development;optimizing the NAS BT application for the POWER CHALLENGEarray;providing access to high performance computing technologies;parallel object-oriented library of genetic algorithms;monitoring of performance of PVM applications on virtual network computer;a parallel version of the quasi-minimal residual method based on coupled two-term recurrences;a proposal for parallel sparse BLAS;parallel search-based methods in optimization;an hierarchical approach for performance analysis of scaLAPACK-based routines using the distributed linear algebra machine;scaLAPACK tutorial;bulk synchronous parallelisation of genetic programming;frontal software for the solution of sparse linear equations;parallel heuristics for bandwidth reduction of sparse matrices with IBM SP2 and cray T3D;parallel libraries on distributed memory architectures;parallel least squares estimates of 2-D spect image reconstructions on the SGI power challenge and the prospect for parallel computing in the oil industry.
This paper presents an approach to texture segmentation by thresholding based on compactness measures of fuzzy sets of determine thresholds of an ill-defined image. The extension of fuzziness in the texture feature sp...
详细信息
This paper presents an approach to texture segmentation by thresholding based on compactness measures of fuzzy sets of determine thresholds of an ill-defined image. The extension of fuzziness in the texture feature space provides more meaningful results than by considering fuzziness in gray scale domain. The effectiveness of the algorithm is demonstrated by comparison with other traditional non-fuzzy methods or the controversial fuzzy method in gray scale alone. In addition, the efficiency of our algorithm is further improved by parallel implementation using distributed shared memory workstations.
This paper presents an approach to texture segmentation by thresholding based on compactness measures of fuzzy sets to determine thresholds of an ill-defined image. The extension of fuzziness in the texture feature sp...
详细信息
This paper presents an approach to texture segmentation by thresholding based on compactness measures of fuzzy sets to determine thresholds of an ill-defined image. The extension of fuzziness in the texture feature space provides more meaningful results than by considering fuzziness in gray scale *** effectiveness of the algorithm is demonstrated by comparison with other traditional nonfuzzy methods or the controversial fuzzy method in gray scale *** addition,the efficiency of our algorithm is further improved by parallel implementation using distributed shared memory workstations.
Many imageprocessing tasks can be computed efficiently in a single program multiple data (SPMD) fashion on massively parallel systems. Although executing SPMD tasks on coarse-grained heterogeneous systems yields a co...
详细信息
Many imageprocessing tasks can be computed efficiently in a single program multiple data (SPMD) fashion on massively parallel systems. Although executing SPMD tasks on coarse-grained heterogeneous systems yields a cost-effective solution, heterogeneity introduces more complexity in data partitioning, mapping, and scheduling problems. In this paper, three image data partitioning schemes for parallelimageprocessing in heterogeneous systems are investigated and implemented using the parallel virtual machine message passing library. The partitioning schemes are based on the system characteristics (processing capability) incorporated within the distributed computing primitives (DCP) environment using SpecInt92 benchmark and our DCP-based benchmark. We compare the results with the baseline (Eq-based) scheme that equally partitions images regardless of processing speed. The results from the experiments show that the DCP-based partitioning scheme outperforms the Eq-based and Spec-based schemes.
暂无评论