@article {15907,
	title = {Sparsity-motivated automatic target recognition},
	journal = {Applied OpticsAppl. Opt.},
	volume = {50},
	year = {2011},
	month = {2011/04/01/},
	pages = {1425 - 1433},
	abstract = {We present an automatic target recognition algorithm using the recently developed theory of sparse representations and compressive sensing. We show how sparsity can be helpful for efficient utilization of data for target recognition. We verify the efficacy of the proposed algorithm in terms of the recognition rate and confusion matrices on the well known Comanche (Boeing{\textendash}Sikorsky, USA) forward-looking IR data set consisting of ten different military targets at different orientations.},
	keywords = {IMAGE PROCESSING, Image recognition, algorithms and filters, pattern recognition, Vision - patterns and recognition},
	doi = {10.1364/AO.50.001425},
	url = {http://ao.osa.org/abstract.cfm?URI=ao-50-10-1425},
	author = {Patel, Vishal M. and Nasrabadi,Nasser M. and Chellapa, Rama}
}
@conference {19295,
	title = {Buffer management for multi-application image processing on multi-core platforms: Analysis and case study},
	booktitle = {2010 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP)},
	year = {2010},
	month = {2010},
	pages = {1662 - 1665},
	abstract = {Due to the limited amounts of on-chip memory, large volumes of data, and performance and power consumption overhead associated with interprocessor communication, efficient management of buffer memory is critical to multi-core image processing. To address this problem, this paper develops new modeling and analysis techniques based on dataflow representations, and demonstrates these techniques on a multi-core implementation case study involving multiple, concurrently-executing image processing applications. Our techniques are based on careful representation and exploitation of frame- or block-based operations, which involve repeated invocations of the same computations across regularly- arranged subsets of data. Using these new approaches to manage block-based image data, this paper demonstrates methods to analyze synchronization overhead and FIFO buffer sizes when mapping image processing applications onto heterogeneous, multi core architectures.},
	keywords = {block-based image data, buffer memory management, buffer storage, concurrently-executing image processing application, data flow computing, data flow representation, data subset, Dataflow, Digital signal processing, Energy consumption, Energy management, Engineering management, FIFO buffer sizes, Hardware, Image analysis, IMAGE PROCESSING, image processing application, image representation, interprocessor communication, memory architecture, Memory management, multiapplication image processing, multicore image processing, multiprocessing, on-chip memory, power consumption, power consumption overhead, Runtime, scheduling, set theory, shared memory, storage management chips, synchronization overhead},
	author = {Ko,Dong-Ik and Won, N. and Bhattacharyya, Shuvra S.}
}
@article {12463,
	title = {Compressive Video Acquisition, Fusion and Processing},
	year = {2010},
	month = {2010/12/14/},
	abstract = {Modern developments in sensor technology, signal processing, and wireless communications have enabled the conception and deployment of large-scale networked sensing systems spanning numerous collection platforms and varied modalities. These systems have the potential to make intelligent decisions by integrating information from massive amounts of sensor data. Before such benefits can be achieved, significant advances must be made in methods for communicating, fusing, and processing this evergrowing volume of diverse data. In this one-year research project, we aimed to expose the fundamental issues and pave the way for further careful study of compressive approaches to video acquisition, fusion, and processing. In doing so, we developed a theoretical definition of video temporal bandwidth and applied the theory to compressive sampling and reconstruction. We created a new framework for compressive video sensing based on linear dynamical systems, lowering the compressive measurement rate. Finally, we applied our own joint manifold model to a variety of relevant image processing problems, demonstrating the model{\textquoteright}s effectiveness and ability to overcome noise and occlusion obstacles. We also showed how joint manifold models can discover an object{\textquoteright}s trajectory, an important step towards video fusion.},
	keywords = {*DATA FUSION, *DETECTORS, *SIGNAL PROCESSING, *VIDEO SIGNALS, ACQUISITION, COLLECTION, COMMUNICATION AND RADIO SYSTEMS, COMPRESSIVE PROPERTIES, COMPRESSIVE SAMPLING, compressive sensing, COMPRESSIVE VIDEO, decision making, DEPLOYMENT, DETECTION, DYNAMICS, IMAGE PROCESSING, Linear systems, Linearity, MANIFOLDS(ENGINES), measurement, MISCELLANEOUS DETECTION AND DETECTORS, MODELS, sampling, THEORY, TRAJECTORIES},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA533703},
	author = {Baraniuk,Richard G. and Chellapa, Rama and Wakin,Michael}
}
@conference {12481,
	title = {Object Dependent Manifold Priors for Image Deconvolution},
	booktitle = {Digital Image Processing and Analysis},
	series = {OSA Technical Digest (CD)},
	year = {2010},
	month = {2010/06/07/},
	pages = {DMC2 - DMC2},
	publisher = {Optical Society of America},
	organization = {Optical Society of America},
	abstract = {In this paper we propose a manifold based deconvolution algorithm by estimating a manifold from a set of natural images that exploits the availability of the sample class data for regularizing the deblurring problem.},
	keywords = {Deconvolution, IMAGE PROCESSING, Inverse problems},
	url = {http://www.opticsinfobase.org/abstract.cfm?URI=DIPA-2010-DMC2},
	author = {Ni,Jie and Turaga,Pavan and M.Patel,Vishal and Chellapa, Rama}
}
@article {12469,
	title = {Sparsity Motivated Automated Target Recognition},
	year = {2010},
	month = {2010/09/29/},
	abstract = {Sparsity-based methods have recently been suggested for tasks such as face and iris recognition. In this project, we evaluated the effectiveness of such methods for automatic target recognition in infrared images. We show how sparsity can be helpful for efficient utilization of data for target recognition. We evaluated the effectiveness of the proposed algorithm in terms of recognition rate and confusion matrices on the well known Comanche forward-looking infrared (FLIR) data set consisting of ten different military targets at different orientations. This work was done in collaboration with Dr. Nasser Nasrabadi, Chief Scientist, SEDD, Army research laboratory. This work will be presented at the International Conference on Image Processing being held in Hong Kong in September 2010. A journal paper reporting our work is under preparation.},
	keywords = {*ALGORITHMS, *INFRARED IMAGES, *TARGET RECOGNITION, ARMY RESEARCH, efficiency, FORWARD LOOKING INFRARED SYSTEMS, IMAGE PROCESSING, NUMERICAL MATHEMATICS, OPTICS, PE611102, TARGET DETECTION, TARGET DIRECTION, RANGE AND POSITION FINDING},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA535014},
	author = {Chellapa, Rama}
}
@article {12513,
	title = {Multicamera Tracking of Articulated Human Motion Using Shape and Motion Cues},
	journal = {Image Processing, IEEE Transactions on},
	volume = {18},
	year = {2009},
	month = {2009/09//},
	pages = {2114 - 2126},
	abstract = {We present a completely automatic algorithm for initializing and tracking the articulated motion of humans using image sequences obtained from multiple cameras. A detailed articulated human body model composed of sixteen rigid segments that allows both translation and rotation at joints is used. Voxel data of the subject obtained from the images is segmented into the different articulated chains using Laplacian eigenmaps. The segmented chains are registered in a subset of the frames using a single-frame registration technique and subsequently used to initialize the pose in the sequence. A temporal registration method is proposed to identify the partially segmented or unregistered articulated chains in the remaining frames in the sequence. The proposed tracker uses motion cues such as pixel displacement as well as 2-D and 3-D shape cues such as silhouettes, motion residue, and skeleton curves. The tracking algorithm consists of a predictor that uses motion cues and a corrector that uses shape cues. The use of complementary cues in the tracking alleviates the twin problems of drift and convergence to local minima. The use of multiple cameras also allows us to deal with the problems due to self-occlusion and kinematic singularity. We present tracking results on sequences with different kinds of motion to illustrate the effectiveness of our approach. The pose of the subject is correctly tracked for the duration of the sequence as can be verified by inspection.},
	keywords = {2D shape cues, 3D shape cues, algorithms, Anatomic;Models, articulated human motion, automatic algorithm, Biological;Movement;Posture;Skeleton;Video Recording;, Computer-Assisted;Models, Eigenvalues and eigenfunctions, human pose estimation, HUMANS, Image motion analysis, IMAGE PROCESSING, image registration, Image segmentation, Image sequences, kinematic singularity, Laplacian eigenmaps, multicamera tracking algorithm, pixel displacement, pose estimation, single-frame registration technique, temporal registration method, tracking},
	isbn = {1057-7149},
	doi = {10.1109/TIP.2009.2022290},
	author = {Sundaresan, A. and Chellapa, Rama}
}
@conference {14229,
	title = {Measuring 1st order stretchwith a single filter},
	booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing, 2008. ICASSP 2008},
	year = {2008},
	month = {2008/04/31/March},
	pages = {909 - 912},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We analytically develop a filter that is able to measure the linear stretch of the transformation around a point, and present results of applying it to real signals. We show that this method is a real-time alternative solution for measuring local signal transformations. Experimentally, this method can accurately measure stretch, however, it is sensitive to shift.},
	keywords = {Cepstral analysis, Educational institutions, filter, filtering theory, Fourier transforms, Frequency domain analysis, Frequency estimation, Gabor filters, Image analysis, IMAGE PROCESSING, linear stretch measurement, local signal transformation measurement, Nonlinear filters, Phase estimation, Signal analysis, Speech processing},
	isbn = {978-1-4244-1483-3},
	doi = {10.1109/ICASSP.2008.4517758},
	author = {Bitsakos,K. and Domke, J. and Ferm{\"u}ller, Cornelia and Aloimonos, J.}
}
@conference {15916,
	title = {A new multiresolution generalized directional filter bank design and application in image enhancement},
	booktitle = {15th IEEE International Conference on Image Processing, 2008. ICIP 2008},
	year = {2008},
	month = {2008/10//},
	pages = {2816 - 2819},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In this paper, we present an image enhancement technique based on a new multiscale generalized directional filter bank design. The design presented is a shift-invariant overcomplete representation, which is well suited to extracting geometric features such as edges. Special cases of this design method can be made to reduce to different and improved implementations of the shearlet and the contourlet transforms, which are known to represent certain classes of images optimally. Use of this new filter bank design has proven itself competitive in image restoration for noisy images and is well suited for distinguishing noise from weak edges. Experimental results show that our unique image enhancement technique out-performs wavelet and contourlet based enhancement methods.},
	keywords = {Algorithm design and analysis, Approximation error, Channel bank filters, contourlet transform, Design methodology, Discrete transforms, Feature extraction, Filter bank, Frequency, geometric feature extraction, Image Enhancement, IMAGE PROCESSING, image resolution, image restoration, Multidimensional digital filters, Multidimensional systems, multiresolution generalized directional filter bank design, shearlet transform, shift-invariant overcomplete representation, transforms, Wavelet transforms},
	isbn = {978-1-4244-1765-0},
	doi = {10.1109/ICIP.2008.4712380},
	author = {Patel, Vishal M. and Easley,G. R and Healy,D. M}
}
@book {13327,
	title = {Shape Analysis and Structuring},
	year = {2008},
	month = {2008///},
	publisher = {Springer},
	organization = {Springer},
	abstract = {With a lot of recent developments in the field, this much-needed book has come at just the right time. It covers a variety of topics related to preserving and enhancing shape information at a geometric level. The contributors also cover subjects that are relevant to effectively capturing the structure of a shape by identifying relevant shape components and their mutual relationships.},
	keywords = {Computer Graphics, Computer vision, Computers / Computer Graphics, Computers / Image Processing, Geometrical models, Geometry, Geometry, Analytic, Image analysis, IMAGE PROCESSING, Mathematics / Functional Analysis, Mathematics / Geometry / General, Mathematics / Graphic Methods, Mathematics / Mathematical Analysis, shapes, Technology \& Engineering / Engineering (General), Visualization},
	isbn = {9783540332640},
	author = {De Floriani, Leila and Spagnuolo,Michela}
}
@conference {17854,
	title = {Model-based OpenMP implementation of a 3D facial pose tracking system},
	booktitle = {2006 International Conference on Parallel Processing Workshops, 2006. ICPP 2006 Workshops},
	year = {2006},
	month = {2006///},
	pages = {8 pp.-73 - 8 pp.-73},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Most image processing applications are characterized by computation-intensive operations, and high memory and performance requirements. Parallelized implementation on shared-memory systems offer an attractive solution to this class of applications. However, we cannot thoroughly exploit the advantages of such architectures without proper modeling and analysis of the application. In this paper, we describe our implementation of a 3D facial pose tracking system using the OpenMP platform. Our implementation is based on a design methodology that uses coarse-grain dataflow graphs to model and schedule the application. We present our modeling approach, details of the implementation that we derived based on this modeling approach, and associated performance results. The parallelized implementation achieves significant speedup, and meets or exceeds the target frame rate under various configurations},
	keywords = {3D facial pose tracking system, application modeling, application program interfaces, application scheduling, coarse-grain dataflow graphs, Concurrent computing, data flow graphs, Educational institutions, face recognition, IMAGE PROCESSING, image processing applications, Inference algorithms, Message passing, OpenMP platform, parallel implementation, PARALLEL PROCESSING, parallel programming, Particle tracking, Processor scheduling, SHAPE, shared memory systems, shared-memory systems, Solid modeling, tracking},
	isbn = {0-7695-2637-3},
	doi = {10.1109/ICPPW.2006.55},
	author = {Saha,S. and Chung-Ching Shen and Chia-Jui Hsu and Aggarwal,G. and Veeraraghavan,A. and Sussman, Alan and Bhattacharyya, Shuvra S.}
}
@book {12621,
	title = {Unconstrained face recognition},
	year = {2006},
	month = {2006///},
	publisher = {Springer Science \& Business},
	organization = {Springer Science \& Business},
	abstract = {Face recognition has been actively studied over the past decade and continues to be a big research challenge. Just recently, researchers have begun to investigate face recognition under unconstrained conditions. Unconstrained Face Recognition provides a comprehensive review of this biometric, especially face recognition from video, assembling a collection of novel approaches that are able to recognize human faces under various unconstrained situations. The underlying basis of these approaches is that, unlike conventional face recognition algorithms, they exploit the inherent characteristics of the unconstrained situation and thus improve the recognition performance when compared with conventional algorithms.Unconstrained Face Recognition is structured to meet the needs of a professional audience of researchers and practitioners in industry. This volume is also suitable for advanced-level students in computer science.},
	keywords = {Computer science, Computer vision, Computers / Computer Graphics, Computers / Computer Science, Computers / Computer Vision \& Pattern Recognition, Computers / General, Computers / Image Processing, Computers / Information Technology, Computers / Information Theory, Computers / Interactive \& Multimedia, Computers / Security / Cryptography, Computers / User Interfaces, Data encryption (Computer science), Data structures (Computer science), Electronic books, Human face recognition (Computer science), IMAGE PROCESSING, Image processing - Digital techniques, multimedia systems, Optical pattern recognition, Science / Life Sciences / Biology},
	isbn = {9780387264073},
	author = {Zhou,S. Kevin and Chellapa, Rama and Zhao,Wenyi}
}
@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.}
}
@conference {12393,
	title = {Systematic exploitation of data parallelism in hardware synthesis of DSP applications},
	booktitle = {Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP {\textquoteright}04). IEEE International Conference on},
	volume = {5},
	year = {2004},
	month = {2004/05//},
	pages = {V - 229-32 vol.5 - V - 229-32 vol.5},
	abstract = {We describe an approach that we have explored for low-power synthesis and optimization of image, video, and digital signal processing (DSP) applications. In particular, we consider the systematic exploitation of data parallelism across the operations of an application dataflow graph when synthesizing a dedicated hardware implementation. Data parallelism occurs commonly in DSP applications, and provides flexible opportunities to increase throughput or lower power consumption. Exploiting this parallelism in a dedicated hardware implementation comes at the expense of increased resource requirements, which must be balanced carefully when applying the technique in a design tool. We propose a high level synthesis algorithm to determine the data parallelism factor for each computation, and, based on the area and performance trade-off curve, design an efficient hardware representation of the dataflow graph. For performance estimation, our approach uses a cyclostatic dataflow intermediate representation of the hardware structure under synthesis. We then apply an automatic hardware generation framework to build the actual circuit.},
	keywords = {area-performance trade-off curve, automatic Verilog code generation, circuit optimisation, data flow graphs, data parallelism, dedicated hardware implementation synthesis, design tool, Digital signal processing, DSP applications, embedded systems, hardware description languages, hardware synthesis, high level synthesis, high level synthesis algorithm, IMAGE PROCESSING, PARALLEL PROCESSING, power consumption, Signal processing, synchronous dataflow graph, video processing},
	doi = {10.1109/ICASSP.2004.1327089},
	author = {Sen,M. and Bhattacharyya, Shuvra S.}
}
@article {15594,
	title = {A Fast Implementation of the ISOCLUS Algorithm},
	journal = {IEEE 2003 International Geoscience and Remote Sensing Symposium},
	year = {2003},
	month = {2003///},
	abstract = {Unsupervised clustering is a fundamental building block in numerous image processing applications. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute the coordinates of a set of cluster centers in d-space, such that those centers minimize the mean squared distance from each data point to its nearest center. This clustering algorithm is similar to another well-known clustering method, called k-means. One significant feature of ISOCLUS over k-means is that the actual number of clusters reported might be fewer or more than the number supplied as part of the input. The algorithm uses different heuristics to determine whether to merge lor split clusters. As ISOCLUS can run very slowly, particularly on large data sets, there has been a growing .interest in the remote sensing community in computing it efficiently. We have developed a faster implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm of Kanungo, et al. They showed that, by using a kd-tree data structure for storing the data, it is possible to reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm, and we show that it is possible to achieve essentially the same results as ISOCLUS on large data sets, but with significantly lower running times. This adaptation involves computing a number of cluster statistics that are needed for ISOCLUS but not for k-means. Both the k-means and ISOCLUS algorithms are based on iterative schemes, in which nearest neighbors are calculated until some convergence criterion is satisfied. Each iteration requires that the nearest center for each data point be computed. Naively, this requires O(kn) time, where k denotes the current number of centers. Traditional techniques for accelerating nearest neighbor searching involve storing the k centers in a data structure. However, because of the iterative nature of the algorithm, this data structure would need to be rebuilt with each new iteration. Our approach is to store the data points in a kd-tree data structure. The assignment of points to nearest neighbors is carried out by a filtering process, which successively eliminates centers that can not possibly be the nearest neighbor for a given region of space. This algorithm is significantly faster, because large groups of data points can be assigned to their nearest center in a single operation. Preliminary results on a number of real Landsat datasets show that our revised ISOCLUS-like scheme runs about twice as fast.},
	keywords = {algorithms, Cluster Analysis, Data structures, HEURISTIC METHODS, IMAGE PROCESSING, INTEGERS, LANDSAT SATELLITES, MEAN SQUARE VALUES, Remote sensing},
	url = {http://ntrs.nasa.gov/search.jsp?R=20030053175},
	author = {Memarsadeghi,Nargess and Mount, Dave and Netanyahu,Nathan S. and LeMoigne,Jacqueline}
}
@conference {17892,
	title = {A high performance multi-perspective vision studio},
	booktitle = {Proceedings of the 17th annual international conference on Supercomputing},
	series = {ICS {\textquoteright}03},
	year = {2003},
	month = {2003///},
	pages = {348 - 357},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We describe a multi-perspective vision studio as a flexible high performance framework for solving complex image processing and machine vision problems on multi-view image sequences. The studio abstracts multi-view image data from image sequence acquisition facilities, stores and catalogs sequences in a high performance distributed database, allows customization of back-end processing services, and can serve custom client applications, thus helping make multi-view video sequence processing efficient and generic. To illustrate our approach, we describe two multi-perspective studio applications, and discuss performance and scalability results.},
	keywords = {database, distributed system, high-performance, IMAGE PROCESSING, multi-perspective, VISION, volumetric reconstruction},
	isbn = {1-58113-733-8},
	doi = {10.1145/782814.782862},
	url = {http://doi.acm.org/10.1145/782814.782862},
	author = {Borovikov,Eugene and Sussman, Alan}
}
@article {12736,
	title = {Statistical physical model for foliage clutter in ultra-wideband synthetic aperture radar images},
	journal = {Journal of the Optical Society of America AThe Journal of the Optical Society of America A},
	volume = {20},
	year = {2003},
	month = {2003/01/01/},
	pages = {32 - 39},
	abstract = {Analyzing foliage-penetrating (FOPEN) ultra-wideband synthetic aperture radar (SAR) images is a challenging problem owing to the noisy and impulsive nature of foliage clutter. Indeed, many target-detection algorithms for FOPEN SAR data are characterized by high false-alarm rates. In this work, a statistical{\textendash}physical model for foliage clutter is proposed that explains the presence of outliers in the data and suggests the use of symmetric alpha-stable (SαS) distributions for accurate clutter modeling. Furthermore, with the use of general assumptions of the noise sources and propagation conditions, the proposed model relates the parameters of the SαS model to physical parameters such as the attenuation coefficient and foliage density.},
	keywords = {IMAGE PROCESSING, Remote sensing and sensors},
	doi = {10.1364/JOSAA.20.000032},
	url = {http://josaa.osa.org/abstract.cfm?URI=josaa-20-1-32},
	author = {Banerjee,Amit and Chellapa, Rama}
}
@conference {14219,
	title = {Eyes from eyes: new cameras for structure from motion},
	booktitle = {Third Workshop on Omnidirectional Vision, 2002. Proceedings},
	year = {2002},
	month = {2002///},
	pages = {19 - 26},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We investigate the relationship between camera design and the problem of recovering the motion and structure of a scene from video data. The visual information that could possibly be obtained is described by the plenoptic function. A camera can be viewed as a device that captures a subset of this function, that is, it measures some of the light rays in some part of the space. The information contained in the subset determines how difficult it is to solve subsequent interpretation processes. By examining the differential structure of the time varying plenoptic function we relate different known and new camera models to the spatiotemporal structure of the observed scene. This allows us to define a hierarchy of camera designs, where the order is determined by the stability and complexity of the computations necessary to estimate structure and motion. At the low end of this hierarchy is the standard planar pinhole camera for which the structure from motion problem is non-linear and ill-posed. At the high end is a new camera, which we call the full field of view polydioptric camera, for which the problem is linear and stable. In between are multiple-view cameras with large fields of view which we have built, as well as catadioptric panoramic sensors and other omni-directional cameras. We develop design suggestions for the polydioptric camera, and based upon this new design we propose a linear algorithm for ego-motion estimation, which in essence combines differential motion estimation with differential stereo.},
	keywords = {Algorithm design and analysis, Camera design, CAMERAS, Design automation, differential stereo, Educational institutions, ego-motion estimation, Eyes, Geometrical optics, IMAGE PROCESSING, Layout, Motion estimation, observed scene, Optical films, polydioptric camera, RETINA},
	isbn = {0-7695-1629-7},
	doi = {10.1109/OMNVIS.2002.1044486},
	author = {Neumann, J. and Ferm{\"u}ller, Cornelia and Aloimonos, J.}
}
@article {17293,
	title = {Meeting human needs with new digital imaging technologies},
	journal = {IEEE Multimedia},
	volume = {9},
	year = {2002},
	month = {2002/12//Oct},
	pages = {8 - 14},
	abstract = {It{\textquoteright}s a visual world. Images capture many people{\textquoteright}s thrills, emotions, and concerns. Art can shock or inspire, and family photos are some of our greatest treasures. It{\textquoteright}s not surprising that visual information is a vital component of the new computing. Most people depend on visual input to understand the world around them and as a basis for further creative activities. The popularity of visual media such as photos, short videos, and animations attests to their mainstream acceptance. Digital photos and image-laden Web pages have already become major computing applications, but users still want higher-resolution images and faster downloads},
	keywords = {animation, animations, Computer applications, digital images, digital imaging technologies, Helium, History, HUMANS, Image databases, IMAGE PROCESSING, Photography, photos, software libraries, Videos, visual media, Web pages},
	isbn = {1070-986X},
	doi = {10.1109/MMUL.2002.1041942},
	author = {Shneiderman, Ben}
}
@conference {18470,
	title = {Virtual audio system customization using visual matching of ear parameters},
	booktitle = {16th International Conference on Pattern Recognition, 2002. Proceedings},
	volume = {3},
	year = {2002},
	month = {2002///},
	pages = {1003- 1006 vol.3 - 1003- 1006 vol.3},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Applications in the creation of virtual auditory spaces (VAS) and sonification require individualized head related transfer functions (HRTFs) for perceptual fidelity. HRTFs exhibit significant variation from person to person due to differences between their pinnae, and their body sizes. We propose and preliminarily implement a simple HRTF customization based on the use of a published database of HRTFs (Algazi et al., 2001) that also contains geometrical measurements of subject pinnae. We measure some of these features via simple image processing, and select the HRTF that has features most closely corresponding to the individual{\textquoteright}s features. This selection procedure is implemented along with the virtual auditory system described in (Zotkin et al., 2002), and listener tests conducted comparing the customized HRTF and a fixed HRTF. Despite the simplicity of the method, tests reveal average improvement in localization accuracy of about 25 percent, though performance improvement varies with source location and individuals.},
	keywords = {acoustic signal processing, Audio systems, Auditory system, Computer vision, database, Ear, ear parameter matching, geometrical measurements, Head, head related transfer functions, HRTF customization, Image databases, IMAGE PROCESSING, medical image processing, performance improvement, Position measurement, sonification, Spatial databases, System testing, Transfer functions, virtual audio system customization, virtual auditory spaces, virtual auditory system, visual matching},
	isbn = {0-7695-1695-X},
	doi = {10.1109/ICPR.2002.1048207},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani and Davis, Larry S. and Mohan,A. and Raykar,V.}
}
@book {17339,
	title = {Readings in Information Visualization: Using Vision to Think},
	year = {1999},
	month = {1999/01/25/},
	publisher = {Morgan Kaufmann},
	organization = {Morgan Kaufmann},
	abstract = {This groundbreaking book defines the emerging field of information visualization and offers the first-ever collection of the classic papers of the discipline, with introductions and analytical discussions of each topic and paper. The authors{\textquoteright} intention is to present papers that focus on the use of visualization to discover relationships, using interactive graphics to amplify thought. This book is intended for research professionals in academia and industry; new graduate students and professors who want to begin work in this burgeoning field; professionals involved in financial data analysis, statistics, and information design; scientific data managers; and professionals involved in medical, bioinformatics, and other areas.* Full-color reproduction throughout* Author power team - an exciting and timely collaboration between the field{\textquoteright}s pioneering, most-respected names* The only book on Information Visualization with the depth necessary for use as a text or as a reference for the information professional* Text includes the classic source papers as well as a collection of cutting edge work},
	keywords = {Computer Graphics, Computers / Computer Engineering, Computers / Computer Graphics, Computers / Computer Graphics / General, Computers / Computer Science, Computers / General, Computers / Information Technology, Computers / Information Theory, Computers / Intelligence (AI) \& Semantics, Computers / Social Aspects / Human-Computer Interaction, IMAGE PROCESSING, Information display systems, Information Visualization, Psychology / General, Visualization},
	isbn = {9781558605336},
	author = {Card,Stuart K. and Mackinlay,Jock D. and Shneiderman, Ben}
}
@article {16656,
	title = {Feature discovery and classification of Doppler umbilical artery blood flow velocity waveforms},
	journal = {Computers in Biology and Medicine},
	volume = {26},
	year = {1996},
	month = {1996/11//},
	pages = {451 - 462},
	abstract = {Doppler umbilical artery blood flow velocity waveform measurements are used in perinatal surveillance for the evaluation of fetal condition. There is an ongoing debate on the predictive value of Doppler measurements concerning the critical effect of the selection of parameters for the interpretation of Doppler waveforms. In this paper, we describe how neural network methods can be used both to discover relevant classification features and subsequently to classify Doppler umbilical artery blood flow velocity waveforms. Results obtained from 199 normal and high risk patients{\textquoteright} umbilical artery waveforms highlighted a classification concordance varying from 90 to 98\% accuracy.},
	keywords = {Doppler umbilical artery blood flow velocity waveforms, Feature extraction, IMAGE PROCESSING, Pattern classification},
	isbn = {0010-4825},
	doi = {10.1016/S0010-4825(96)00018-2},
	url = {http://www.sciencedirect.com/science/article/pii/S0010482596000182},
	author = {Baykal,Nazife and Reogia,James A. and Yalabik,Nese and Erkmen,Aydan and Beksac,M.Sinan}
}
@book {13298,
	title = {Image Analysis and Processing: 8th International Conference, Iciap {\textquoteright}95, San Remo, Italy, September 13-15, 1995 : Proceedings},
	year = {1995},
	month = {1995/09/28/},
	publisher = {Springer},
	organization = {Springer},
	abstract = {This book presents the proceedings of the 8th International Conference on Image Analysis and Processing, ICIAP {\textquoteright}95, held in Sanremo, Italy in September 1995 under the sponsorship of the International Association of Pattern Recognition IAPR.The volume presents 108 papers selected from more than 180 submissions together with six invited contributions. The papers are written by a total of 265 contributing authors and give a comprehensive state-of-the-art report on all current issues of image analysis and processing. Theoretical aspects are addressed as well as systems design and advanced applications, particularly in medical imaging.},
	keywords = {Artificial intelligence, COMPUTER AIDED DESIGN, Computer Graphics, Computer science, Computer vision, Computers / CAD-CAM, Computers / Computer Graphics, Computers / Computer Science, Computers / Computer Vision \& Pattern Recognition, Computers / Image Processing, Computers / Intelligence (AI) \& Semantics, Computers / Optical Data Processing, Computers / Software Development \& Engineering / General, Electronic books, IMAGE PROCESSING, Image processing/ Congresses, Imaging systems, Optical data processing, Optical pattern recognition, software engineering},
	isbn = {9783540602989},
	author = {Braccini,Carlo and De Floriani, Leila and Vernazza,Gianni}
}
@article {17222,
	title = {Image-browser taxonomy and guidelines for designers},
	journal = {IEEE Software},
	volume = {12},
	year = {1995},
	month = {1995/03//},
	pages = {21 - 32},
	abstract = {In many applications users must browse large images. Most designers merely use two one-dimensional scroll bars or ad hoc designs for two-dimensional scroll bars. However, the complexity of two-dimensional browsing suggests that more careful analysis, design, and evaluation might lead to significant improvements. Our exploration of existing 2D browsers has led us to identify many features and a wide variety of tasks performed with the browsers. We introduce an informal specification technique to describe 2D browsers and a task taxonomy, suggest design features and guidelines, and assess existing strategies. We focus on the tools to explore a selected image and so do not cover techniques to browse a series of images or to browse large-image databases},
	keywords = {analysis, Computer Graphics, design, designer guidelines, Equations, Europe, Evaluation, Formal specifications, Graphical user interfaces, Guidelines, IMAGE PROCESSING, image-browser taxonomy, informal specification technique, Laboratories, large image browsing, Layout, Road transportation, selected image exploration, SHAPE, Software design, task taxonomy, Taxonomy, tools, two-dimensional browsing, user interface management systems, visual databases},
	isbn = {0740-7459},
	doi = {10.1109/52.368260},
	author = {Plaisant, Catherine and Carr,D. and Shneiderman, Ben}
}
@article {15009,
	title = {Parallel algorithms for image histogramming and connected components with an experimental study (extended abstract)},
	journal = {ACM SIGPLAN Notices},
	volume = {30},
	year = {1995},
	month = {1995/08//},
	pages = {123 - 133},
	abstract = {This paper presents efficient and portable implementations of two useful primitives in image processing algorithms, histogramming and connected components. Our general framework is a single-address space, distributed memory programming model. We use efficient techniques for distributing and coalescing data as well as efficient combinations of task and data parallelism. Our connected components algorithm uses a novel approach for parallel merging which performs drastically limited updating during iterative steps, and concludes with a total consistency update at the final step. The algorithms have been coded in Split-C and run on a variety of platforms. Our experimental results are consistent with the theoretical analysis and provide the best known execution times for  these two primitives, even when compared with machine-specific implementations. More efficient implementations of Split-C will likely result in even faster execution times.},
	keywords = {connected components, histogramming, IMAGE PROCESSING, image understanding, Parallel algorithms, scalable parallel processing},
	isbn = {0362-1340},
	doi = {10.1145/209937.209950},
	url = {http://doi.acm.org/10.1145/209937.209950},
	author = {Bader,David A. and JaJa, Joseph F.}
}
@article {14189,
	title = {A syntactic approach to scale-space-based corner description},
	journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
	volume = {16},
	year = {1994},
	month = {1994/07//},
	pages = {748 - 751},
	abstract = {Planar curves are described by information about corners integrated over various levels of resolution. The detection of corners takes place on a digital representation. To compensate for ambiguities arising from sampling problems due to the discreteness, results about the local behavior of curvature extrema in continuous scale-space are employed},
	keywords = {Computer vision, corner detection, curvature extrema, edge detection, IMAGE PROCESSING, image resolution, Image segmentation, Laboratories, Large-scale systems, PARALLEL PROCESSING, pattern recognition, planar curves, resolution, Sampling methods, sampling problems, scale space based corner description, SHAPE, Smoothing methods, syntactic approach},
	isbn = {0162-8828},
	doi = {10.1109/34.297957},
	author = {Ferm{\"u}ller, Cornelia and Kropatsch,W.}
}
@conference {14169,
	title = {Hierarchical curve representation},
	booktitle = {, 11th IAPR International Conference on Pattern Recognition, 1992. Vol.III. Conference C: Image, Speech and Signal Analysis, Proceedings},
	year = {1992},
	month = {1992/09/30/Aug-3},
	pages = {143 - 146},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Presents a robust method for describing planar curves in multiple resolution using curvature information. The method is developed by taking into account the discrete nature of digital images as well as the discrete aspect of a multiresolution structure (pyramid). The authors deal with the robustness of the technique, which is due to the additional information that is extracted from observing the behavior of corners in the pyramid. Furthermore the resulting algorithm is conceptually simple and easily parallelizable. They develop theoretical results, analyzing the curvature of continuous curves in scale-space, which show the behavior of curvature extrema under varying scale. These results are used to eliminate any ambiguities that might arise from sampling problems due to the discreteness of the representation. Finally, experimental results demonstrate the potential of the method},
	keywords = {Automation, continuous curves, curvature, data mining, digital images, Educational institutions, Feature extraction, hierarchical curve representation, IMAGE PROCESSING, image recognition, image resolution, Image segmentation, multiresolution structure, Object recognition, planar curves, pyramid, Robustness, Sampling methods, Smoothing methods},
	isbn = {0-8186-2920-7},
	doi = {10.1109/ICPR.1992.201947},
	author = {Ferm{\"u}ller, Cornelia and Kropatsch,W.}
}
@conference {14233,
	title = {Multi-resolution shape description by corners},
	booktitle = {, 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1992. Proceedings CVPR {\textquoteright}92},
	year = {1992},
	month = {1992/06/15/18},
	pages = {271 - 276},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A robust method for describing planar curves in multiple resolution using curvature information is presented. The method is developed by taking into account the discrete nature of digital images as well as the discrete aspect of a multiresolution structure (pyramid). The main contribution lies in the robustness of the technique, which is due to the additional information that is extracted from observing the behavior of corners in the whole pyramid. Furthermore, the resulting algorithm is conceptually simple and easily parallelizable. Theoretical results are developed analyzing the curvature of continuous curves in scale-space and showing the behavior of curvature extrema under varying scale. The results are used to eliminate any ambiguities that might arise from sampling problems due to the discreteness of the representation. Experimental results demonstrate the potential of the method},
	keywords = {ambiguities, Automation, computational geometry, Computer vision, continuous curves, corners, curvature extrema, curvature information, curve fitting, digital images, Feature extraction, IMAGE PROCESSING, image resolution, Image segmentation, Laboratories, multiple resolution, multiresolution structure, parallelizable, planar curves, Robustness, Sampling methods, scale-space, SHAPE, Smoothing methods, varying scale},
	isbn = {0-8186-2855-3},
	doi = {10.1109/CVPR.1992.223264},
	author = {Ferm{\"u}ller, Cornelia and Kropatsch,W.}
}
@conference {14246,
	title = {Perceptual computational advantages of tracking},
	booktitle = {, 11th IAPR International Conference on Pattern Recognition, 1992. Vol.I. Conference A: Computer Vision and Applications, Proceedings},
	year = {1992},
	month = {1992/09/30/Aug-3},
	pages = {599 - 602},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The paradigm of active vision advocates studying visual problems in the form of modules that are directly related to a visual task for observers that are active. It is argued that in many cases when an object is moving in an unrestricted manner (translation and rotation) in the 3D world only the motion{\textquoteright}s translational components are of interest. For a monocular observer, using only the normal flow-the spatiotemporal derivatives of the image intensity function-the authors solve the problem of computing the direction of translation. Their strategy uses fixation and tracking. Fixation simplifies much of the computation by placing the object at the center of the visual field, and the main advantage of tracking is the accumulation of information over time. The authors show how tracking is accomplished using normal flow measurements and use it for two different tasks in the solution process. First, it serves as a tool to compensate for the lack of existence of an optical flow field and thus to estimate the translation parallel to the image plane; and second, it gathers information about the motion component perpendicular to the image plane},
	keywords = {active vision, Automation, Employment, fixation, image intensity function, Image motion analysis, IMAGE PROCESSING, Motion estimation, Nonlinear optics, Optical computing, Optical sensors, parameter estimation, pattern recognition, perceptual computational advantages, spatiotemporal derivatives, Spatiotemporal phenomena, tracking, unrestricted motion, visual flow measurements},
	isbn = {0-8186-2910-X},
	doi = {10.1109/ICPR.1992.201633},
	author = {Ferm{\"u}ller, Cornelia and Aloimonos, J.}
}
@article {15045,
	title = {VLSI Architectures and Implementation of Predictive Tree- Searched Vector Quantizers for Real-Time Video Compression},
	volume = {ISR-TR-1992-48},
	year = {1992},
	month = {1992///},
	institution = {Institute for Systems Research, University of Maryland, College Park},
	abstract = {We describe a pipelined systolic architecture for implementing predictive Tree-Searched Vector Quantization (PTSVQ) for real- time image and speech coding applications. This architecture uses identical processors for both the encoding and decoding processes. the overall design is regular and the control is simple. Input data is processed at a rate of 1 pixel per clock cycle, which allows real-time processing of images at video rates. We implemented these processors using 1.2um CMOS technology. Spice simulations indicate correct operation at 40 MHz. Prototype version of these chips fabricated using 2um CMOS technology work at 20 MHz.},
	keywords = {data compression, IMAGE PROCESSING, Signal processing, Speech processing, Systems Integration, systolic architecture, Vector quantization, VLSI architectures},
	url = {http://drum.lib.umd.edu/handle/1903/5230},
	author = {Yu,S.-S. and Kolagotla,Ravi K. and JaJa, Joseph F.}
}
@article {11945,
	title = {Correspondence from Correspondence},
	journal = {Optical Society of America, Topical Meeting on Machine Vision},
	year = {1980},
	month = {1980///},
	pages = {46 - 51},
	abstract = {Image matching (or registration), is in general terms, aligning two identical or similar images or parts of images, and it is basic to a number of vision problems. These include optical nagivation (also known as motion analysis), stereo image interpretation, object analysis, change detection and others. The difficult part of all these problems, is the matching problem, i.e., the computation of the correspondence of elements in the different views. The computation of correspondence, in both the stereo and the motion problem is impossible without the use of some assumptions about the visual world and various researchers have proposed several theories for the computation of visual correspondence that worked well for the domains that fitted their assumptions. Studied here is the problem of the computation of visual correspondence, under the assumption that some values of the correspondence function are already known. The mathematical constraints that are needed for growing a solution for the correspondence function from points where its value is known are developed.},
	keywords = {ALIGNMENT, COMPUTATION, Error analysis, IMAGE PROCESSING, IMAGES, STEREOSCOPIC VISION, VECTORS (MATHEMATICS)},
	url = {http://adsabs.harvard.edu/abs/1980osa..meet...46A},
	author = {Aloimonos, J. and Kamgar-Parsi,Behrooz}
}
