Search
Now showing items 1-10 of 2339
Fast Transforms for Acoustic Imaging-Part I: Theory
(IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2011)
The classical approach for acoustic imaging consists of beamforming, and produces the source distribution of interest convolved with the array point spread function. This convolution smears the image of interest, significantly ...
Fast Transforms for Acoustic Imaging-Part II: Applications
(IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2011)
In Part I [""Fast Transforms for Acoustic Imaging-Part I: Theory,"" IEEE TRANSACTIONS ON IMAGE PROCESSING], we introduced the Kronecker array transform (KAT), a fast transform for imaging with separable arrays. Given a ...
Scan time reduction with an adaptive field of view
(ELSEVIER SCIENCE INC, 2005)
In magnetic resonance imaging (MRI), there is always a drive toward reducing the acquisition time. In volume imaging, time is often spent in acquiring data where there exists no signal because the imaging volume is larger ...
Fast identification of individuals based on iris characteristics for biometric systems
(2012-02-13)
Nowadays, systems based on biométrie techniques have a wide acceptance in many different areas, due to their levels of safety and accuracy. A biometrie technique that is gaining prominence is the identification of individuals ...
Color description of low resolution images using fast bitwise quantization and border-interior classification
(Institute of Electrical and Electronics Engineers - IEEEBrisbane, 2015-04)
Image classification often require preprocessing and feature extraction steps that are directly related to the accuracy and speed of the whole task. In this paper we investigate color features extracted from low resolution ...
Accelerating Overrelaxed and Monotone Fast Iterative Shrinkage-Thresholding Algorithms With Line Search for Sparse Reconstructions
(Ieee-inst Electrical Electronics Engineers Inc, 2017-07-01)
Recently, specially crafted unidimensional optimization has been successfully used as line search to accelerate the overrelaxed and monotone fast iterative shrinkage-threshold algorithm (OMFISTA) for computed tomography. ...
Undersampling k-space using fast progressive 3D trajectories
(WILEY, 2005)
In 3D MRI, sampling k-space with traditional trajectories can be excessively time-consuming. Fast imaging trajectories are used in an attempt to efficiently cover the k-space and reduce the scan time without significantly ...
Optimizing Fast Fourier Transform (FFT) Image Compression using Intelligent Water Drop (IWD) Algorithm
Digital image compression is the technique in digital image processing where special attention is provided in decreasing the number of bits required to represent a digital image. A wide range of techniques have been developed ...
Fast three-dimensional k-space trajectory design using missile guidance ideas
(WILEY, 2004)
Three-dimensional (3D) k-space trajectories are needed to acquire volumetric images in MRI. While scan time is determined by the trajectory efficiency, image quality and distortions depend on the shape of the trajectories. ...