@conference {12447,
	title = {Component-based restoration of speckled images},
	booktitle = {2011 18th IEEE International Conference on Image Processing (ICIP)},
	year = {2011},
	month = {2011/09/11/14},
	pages = {2797 - 2800},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Many coherent imaging modalities are often characterized by a multiplicative noise, known as speckle which often makes the interpretation of data difficult. In this paper, we present a speckle reduction algorithm based on separating the structure and texture components of SAR images. An iterative algorithm based on surrogate functionals is presented that solves the component optimization formulation. Experiments indicate this proposed method performs favorably compared to state-of-the-art speckle reduction methods.},
	keywords = {coherent imaging modalities, component optimization formulation, component-based restoration, Dictionaries, image restoration, iterative algorithm, iterative methods, multiplicative noise, NOISE, optimisation, radar imaging, SAR images, Speckle, speckle reduction algorithm, speckled images, structure components, surrogate functionals, synthetic aperture radar, texture components, transforms, TV},
	isbn = {978-1-4577-1304-0},
	doi = {10.1109/ICIP.2011.6116252},
	author = {Patel, Vishal M. and Easley,G. R and Chellapa, Rama}
}
@conference {18922,
	title = {The Life Game: Cognitive Strategies for Repeated Stochastic Games},
	year = {2011},
	month = {2011/10//},
	pages = {95 - 102},
	abstract = {Standard models in bio-evolutionary game theory involve repetitions of a single stage game (e.g., the Prisoner{\textquoteright}s Dilemma or the Stag Hunt); but it is clear that repeatedly playing the same stage game is not an accurate model of most individuals{\textquoteright} lives. Rather, individuals{\textquoteright} interactions with others correspond to many different kinds of stage games. In this work, we concentrate on discovering behavioral strategies that are successful for the life game, in which the stage game is chosen stochastically at each iteration. We present a cognitive agent model based on Social Value Orientation (SVO) theory. We provide extensive evaluations of our model{\textquoteright}s performance, both against standard agents from the game theory literature and against a large set of life-game agents written by students in two different countries. Our empirical results suggest that for life-game strategies to be successful in environments with such agents, it is important (i) to be unforgiving with respect to trust behavior and (ii) to use adaptive, fine-grained opponent models of the other agents.},
	keywords = {adaptive model, behavioral strategy, bioevolutionary game theory, cognitive agent model, fine-grained opponent model, game theory, iteration, iterative methods, life game, prisoner{\textquoteright}s dilemma, repeated stochastic games, social value orientation theory, stag hunt, stage game, Stochastic processes, trust behavior},
	doi = {10.1109/PASSAT/SocialCom.2011.62},
	author = {Cheng,Kan-Leung and Zuckerman,I. and Nau, Dana S. and Golbeck,J.}
}
@article {13975,
	title = {A broadband fast multipole accelerated boundary element method for the three dimensional Helmholtz equation},
	journal = {The Journal of the Acoustical Society of America},
	volume = {125},
	year = {2009},
	month = {2009///},
	pages = {191 - 205},
	abstract = {The development of a fast multipole method (FMM) accelerated iterative solution of the boundary element method (BEM) for the Helmholtz equations in three dimensions is described. The FMM for the Helmholtz equation is significantly different for problems with low and high kD (where k is the wavenumber and D the domain size), and for large problems the method must be switched between levels of the hierarchy. The BEM requires several approximate computations (numerical quadrature, approximations of the boundary shapes using elements), and these errors must be balanced against approximations introduced by the FMM and the convergence criterion for iterative solution. These different errors must all be chosen in a way that, on the one hand, excess work is not done and, on the other, that the error achieved by the overall computation is acceptable. Details of translation operators for low and high kD, choice of representations, and BEM quadrature schemes, all consistent with these approximations, are described. A novel preconditioner using a low accuracy FMM accelerated solver as a right preconditioner is also described. Results of the developed solvers for large boundary value problems with 0.0001≲kD≲500 are presented and shown to perform close to theoretical expectations.},
	keywords = {acoustic wave scattering, boundary-elements methods, boundary-value problems, Helmholtz equations, iterative methods},
	doi = {10.1121/1.3021297},
	url = {http://link.aip.org/link/?JAS/125/191/1},
	author = {Gumerov, Nail A. and Duraiswami, Ramani}
}
@article {14254,
	title = {Robust Wavelet-Based Super-Resolution Reconstruction: Theory and Algorithm},
	journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
	volume = {31},
	year = {2009},
	month = {2009/04//},
	pages = {649 - 660},
	abstract = {We present an analysis and algorithm for the problem of super-resolution imaging, that is the reconstruction of HR (high-resolution) images from a sequence of LR (low-resolution) images. Super-resolution reconstruction entails solutions to two problems. One is the alignment of image frames. The other is the reconstruction of a HR image from multiple aligned LR images. Both are important for the performance of super-resolution imaging. Image alignment is addressed with a new batch algorithm, which simultaneously estimates the homographies between multiple image frames by enforcing the surface normal vectors to be the same. This approach can handle longer video sequences quite well. Reconstruction is addressed with a wavelet-based iterative reconstruction algorithm with an efficient de-noising scheme. The technique is based on a new analysis of video formation. At a high level our method could be described as a better-conditioned iterative back projection scheme with an efficient regularization criteria in each iteration step. Experiments with both simulated and real data demonstrate that our approach has better performance than existing super-resolution methods. It can remove even large amounts of mixed noise without creating artifacts.},
	keywords = {batch algorithm, better-conditioned iterative back projection scheme, Enhancement, homography estimation, image denoising, image denoising scheme, image frame alignment, Image processing software, Image reconstruction, image resolution, image sequence, Image sequences, iterative methods, regularization criteria, robust wavelet-based iterative super-resolution reconstruction, surface normal vector, video formation analysis, video sequence, video signal processing, Wavelet transforms},
	isbn = {0162-8828},
	doi = {10.1109/TPAMI.2008.103},
	author = {Hui Ji and Ferm{\"u}ller, Cornelia}
}
@conference {15544,
	title = {Efficient Kriging via Fast Matrix-Vector Products},
	booktitle = {Aerospace Conference, 2008 IEEE},
	year = {2008},
	month = {2008/03//},
	pages = {1 - 7},
	abstract = {Interpolating scattered data points is a problem of wide ranging interest. Ordinary kriging is an optimal scattered data estimator, widely used in geosciences and remote sensing. A generalized version of this technique, called cokriging, can be used for image fusion of remotely sensed data. However, it is computationally very expensive for large data sets. We demonstrate the time efficiency and accuracy of approximating ordinary kriging through the use of fast matrix-vector products combined with iterative methods. We used methods based on the fast Multipole methods and nearest neighbor searching techniques for implementations of the fast matrix-vector products.},
	keywords = {cokriging technique, fast matrix-vector products, fast multipole methods, geophysical techniques, image fusion, Interpolation, iterative methods, nearest neighbor searching, optimal scattered data estimator, Remote sensing, remotely sensed data, scattered data points, sensor fusion, time efficiency},
	doi = {10.1109/AERO.2008.4526433},
	author = {Memarsadeghi,N. and Raykar,V.C. and Duraiswami, Ramani and Mount, Dave}
}
@conference {18458,
	title = {Fast Multipole Accelerated Boundary Elements for Numerical Computation of the Head Related Transfer Function},
	booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing, 2007. ICASSP 2007},
	volume = {1},
	year = {2007},
	month = {2007/04//},
	pages = {I-165-I-168 - I-165-I-168},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The numerical computation of head related transfer functions has been attempted by a number of researchers. However, the cost of the computations has meant that usually only low frequencies can be computed and further the computations take inordinately long times. Because of this, comparisons of the computations with measurements are also difficult. We present a fast multipole based iterative preconditioned Krylov solution of a boundary element formulation of the problem and use a new formulation that enables the reciprocity technique to be accurately employed. This allows the calculation to proceed for higher frequencies and larger discretizations. Preliminary results of the computations and of comparisons with measured HRTFs are presented.},
	keywords = {Acceleration, Acoustic measurements, Acoustic scattering, audio signal processing, boundary element formulation, Boundary element method, Boundary element methods, boundary-elements methods, Costs, Ear, Fast Multipole Method, Frequency, Head related transfer function, HUMANS, Irrigation, iterative methods, multipole accelerated boundary elements, multipole based iterative preconditioned Krylov solution, numerical computation, Reciprocity, Transfer functions},
	isbn = {1-4244-0727-3},
	doi = {10.1109/ICASSP.2007.366642},
	author = {Gumerov, Nail A. and Duraiswami, Ramani and Zotkin,Dmitry N}
}
@article {12378,
	title = {Contention-conscious transaction ordering in multiprocessor DSP systems},
	journal = {IEEE Transactions on Signal Processing},
	volume = {54},
	year = {2006},
	month = {2006/02//},
	pages = {556 - 569},
	abstract = {This paper explores the problem of efficiently ordering interprocessor communication (IPC) operations in statically scheduled multiprocessors for iterative dataflow graphs. In most digital signal processing (DSP) applications, the throughput of the system is significantly affected by communication costs. By explicitly modeling these costs within an effective graph-theoretic analysis framework, we show that ordered transaction schedules can significantly outperform self-timed schedules even when synchronization costs are low. However, we also show that when communication latencies are nonnegligible, finding an optimal transaction order given a static schedule is an NP-complete problem, and that this intractability holds both under iterative and noniterative execution. We develop new heuristics for finding efficient transaction orders, and perform an extensive experimental comparison to gauge the performance of these heuristics.},
	keywords = {contention-conscious transaction ordering, Costs, data flow graphs, Dataflow, Delay, Digital signal processing, digital signal processing chips, Embedded system, graph-theoretic analysis, Instruments, Internet telephony, interprocessor communication, iterative dataflow graphs, iterative methods, Message passing, multiprocessor, multiprocessor DSP systems, NP-complete problem, Processor scheduling, scheduling, Signal processing, synchronization, Throughput},
	isbn = {1053-587X},
	doi = {10.1109/TSP.2005.861074},
	author = {Khandelia,M. and Bambha,N. K and Bhattacharyya, Shuvra S.}
}
@article {12618,
	title = {Robust ego-motion estimation and 3-D model refinement using surface parallax},
	journal = {Image Processing, IEEE Transactions on},
	volume = {15},
	year = {2006},
	month = {2006/05//},
	pages = {1215 - 1225},
	abstract = {We present an iterative algorithm for robustly estimating the ego-motion and refining and updating a coarse depth map using parametric surface parallax models and brightness derivatives extracted from an image pair. Given a coarse depth map acquired by a range-finder or extracted from a digital elevation map (DEM), ego-motion is estimated by combining a global ego-motion constraint and a local brightness constancy constraint. Using the estimated camera motion and the available depth estimate, motion of the three-dimensional (3-D) points is compensated. We utilize the fact that the resulting surface parallax field is an epipolar field, and knowing its direction from the previous motion estimates, estimate its magnitude and use it to refine the depth map estimate. The parallax magnitude is estimated using a constant parallax model (CPM) which assumes a smooth parallax field and a depth based parallax model (DBPM), which models the parallax magnitude using the given depth map. We obtain confidence measures for determining the accuracy of the estimated depth values which are used to remove regions with potentially incorrect depth estimates for robustly estimating ego-motion in subsequent iterations. Experimental results using both synthetic and real data (both indoor and outdoor sequences) illustrate the effectiveness of the proposed algorithm.},
	keywords = {3D model refinement, algorithms, Artificial intelligence, Automated;Subtraction Technique;, Computer-Assisted;Imaging, constant parallax model, depth based parallax model, digital elevation map, epipolar field, Image Enhancement, Image Interpretation, iterative algorithm, iterative methods, Motion estimation, robust ego-motion estimation, smooth parallax field, surface parallax, Three-Dimensional;Information Storage and Retrieval;Pattern Recognition},
	isbn = {1057-7149},
	doi = {10.1109/TIP.2005.864167},
	author = {Agrawal,A. and Chellapa, Rama}
}
@article {14030,
	title = {Computation of scattering from clusters of spheres using the fast multipole method},
	journal = {The Journal of the Acoustical Society of America},
	volume = {117},
	year = {2005},
	month = {2005///},
	pages = {1744 - 1761},
	abstract = {A T-matrix based method of solution of the multiple scattering problem was presented by the authors [J. Acoust Soc. Am. 112, 2688{\textendash}2701 (2002)]. This method can be applied to the computation of relatively small problems, since the number of operations required grows with the number of spheres N as O(N3), and with the sixth power of the wave number. The use of iterative techniques accelerated using the fast multipole method (FMM) can accelerate this solution, as presented by Koc and Chew [J. Acoust. Soc. Am. 103, 721{\textendash}734 (1998)] originally. In this study we present a method that combines preconditioned Krylov subspace iterative techniques, FMM accelerated matrix vector products, a novel FMM-based preconditioner, and fast translation techniques that enable us to achieve an overall algorithm in which the cost of the matrix-vector multiplication grows with N as O(N log N) and with the third power of the wave number. We discuss the convergence of the iterative techniques, selection of the truncation number, errors in the solution, and other issues. The results of the solution of test problems obtained with the method for N \~{} 102{\textendash}104 for different wave numbers are presented. {\textcopyright} 2005 Acoustical Society of America.},
	keywords = {acoustic wave scattering, convergence of numerical methods, iterative methods, matrix multiplication},
	doi = {10.1121/1.1853017},
	url = {http://link.aip.org/link/?JAS/117/1744/1},
	author = {Gumerov, Nail A. and Duraiswami, Ramani}
}
@conference {12394,
	title = {Modeling image processing systems with homogeneous parameterized dataflow graphs},
	booktitle = {Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP {\textquoteright}05). IEEE International Conference on},
	volume = {5},
	year = {2005},
	month = {2005/03//},
	pages = {v/133 - v/136 Vol. 5 - v/133 - v/136 Vol. 5},
	abstract = {We describe a new dataflow model called homogeneous parameterized dataflow (HPDF). This form of dynamic dataflow graph takes advantage of the fact that in a large number of image processing applications, data production and consumption rates, though dynamic, are equal across graph edges for any particular iteration, which leads to a homogeneous rate of actor execution, even though data production and consumption values are dynamic and vary across graph edges. We discuss existing dataflow models and formulate in detail the HPDF model. We develop examples of applications that are described naturally in terms of HPDF semantics and present experimental results that demonstrate the efficacy of the HPDF approach.},
	keywords = {data consumption, data flow graphs, data production, dynamic dataflow graph, graph edges, homogeneous parameterized dataflow graphs, IMAGE PROCESSING, image processing system modeling, iteration, iterative methods},
	doi = {10.1109/ICASSP.2005.1416258},
	author = {Sen,Mainak and Bhattacharyya, Shuvra S. and Lv,Tiehan and Wolf,W.}
}
@article {14110,
	title = {Complete stagnation of},
	journal = {Linear Algebra and its Applications},
	volume = {367},
	year = {2003},
	month = {2003/07/01/},
	pages = {165 - 183},
	abstract = {We study problems for which the iterative method for solving linear systems of equations makes no progress in its initial iterations. Our tool for analysis is a nonlinear system of equations, the stagnation system, that characterizes this behavior. We focus on complete stagnation, for which there is no progress until the last iteration. We give necessary and sufficient conditions for complete stagnation of systems involving unitary matrices, and show that if a normal matrix completely stagnates then so does an entire family of nonnormal matrices with the same eigenvalues. Finally, we show that there are real matrices for which complete stagnation occurs for certain complex right-hand sides but not for real ones.},
	keywords = {Convergence, GMRES, iterative methods, Stagnation},
	isbn = {0024-3795},
	doi = {16/S0024-3795(02)00612-2},
	url = {http://www.sciencedirect.com/science/article/pii/S0024379502006122},
	author = {Zavorin, Ilya and O{\textquoteright}Leary, Dianne P. and Elman, Howard}
}
@article {15730,
	title = {Complete stagnation of GMRES},
	journal = {Linear Algebra and its Applications},
	volume = {367},
	year = {2003},
	month = {2003/07/01/},
	pages = {165 - 183},
	abstract = {We study problems for which the iterative method gmres for solving linear systems of equations makes no progress in its initial iterations. Our tool for analysis is a nonlinear system of equations, the stagnation system, that characterizes this behavior. We focus on complete stagnation, for which there is no progress until the last iteration. We give necessary and sufficient conditions for complete stagnation of systems involving unitary matrices, and show that if a normal matrix completely stagnates then so does an entire family of nonnormal matrices with the same eigenvalues. Finally, we show that there are real matrices for which complete stagnation occurs for certain complex right-hand sides but not for real ones.},
	keywords = {Convergence, GMRES, iterative methods, Stagnation},
	isbn = {0024-3795},
	doi = {10.1016/S0024-3795(02)00612-2},
	url = {http://www.sciencedirect.com/science/article/pii/S0024379502006122},
	author = {Zavorin, Ilya and O{\textquoteright}Leary,Dianne P. and Elman, Howard}
}
@article {17283,
	title = {Low-effort, high-payoff user interface reengineering},
	journal = {IEEE Software},
	volume = {14},
	year = {1997},
	month = {1997/08//Jul},
	pages = {66 - 72},
	abstract = {Although increasingly sophisticated design methodologies for developing new user interfaces exist, low-effort, high-payoff user interface reengineering represents a new direction-and opportunity. Yet reengineering a working system is complex and risky because of the potential disruption to users and managers, their justifiable fear of change, and the lack of guarantees that such changes will be for the better. Our largely positive experiences with the projects described here lead us to believe that user interface reengineering is a viable and important process. Low effort, high-payoff improvement recommendations can probably be made for most existing systems. Nevertheless, a narrowly focused user interface reengineering plan may be inappropriate when the major problems lie outside the scope of the user interface, such as inadequate functionalities, frequent crashes, and network problems. Attempts at improving less severe problems while ignoring deeper ones may be perceived as insensitive by the users. In such cases it is important to consider either making similar short-term improvements for other parts of the systems or postponing short-term user interface reengineering in favour of a more complete system reengineering. Similarly, the need for interface stability might outweigh the benefits of the short-term improvements if a complete reengineering is planned for the near future. But most likely these proposed diagnostic strategies and opportunities for improvement are only a prelude to the much larger task of business reengineering, which implies extensive user interface reengineering},
	keywords = {Business process re-engineering, complete system reengineering, Design methodology, Error analysis, Hardware, inadequate functionalities, interface stability, iterative methods, low-effort high-payoff user interface reengineering, short-term improvements, short-term user interface reengineering, software engineering, Software testing, System analysis and design, System testing, systems re-engineering, User centered design, user centred design, User interfaces},
	isbn = {0740-7459},
	doi = {10.1109/52.595958},
	author = {Plaisant, Catherine and Rose,A. and Shneiderman, Ben and Vanniamparampil,A. J}
}
