Charles V. Stewart
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Charles V. Stewart has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Michal Sofka
Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY 12180-3590, United States
3 shared publications Chia-Ling Tsai
Dept. of Comput. Sci., Rensselaer Polytech. Inst., Troy, NY, USA
2 shared publications- Gehua Yang
Rensselaer Polytechnic Institute (United States)
2 shared publications Amitha Perera
Rensselaer Polytechnic Institute
1 shared publication- Amitha Perera
GE Global Research, Niskayuna, NY, USA
1 shared publication - Avi Kelman
Rensselaer Polytechnic Institute Department of Computer Science, Troy, New York 12180-3590
1 shared publication
Latest Publications
- Open Access
Wildbook: Crowdsourcing, computer vision, and data science for conservation
Photographs, taken by field scientists, tourists, automated cameras, and incidental photographers, are the most abundant source of data on wildlife today. Wildbook is an autonomous computational system that starts from massive collections of images and, by detecting various species of animals and identifying individuals, combined with sophisticated data management, turns them into high resolution information database, enabling scientific inquiry, conservation, and citizen science. We have built Wildbooks for whales (flukebook.org), sharks (whaleshark.org), two species of zebras (Grevy's and plains), and several others. In January 2016, Wildbook enabled the first ever full species (the endangered Grevy's zebra) census using photographs taken by ordinary citizens in Kenya. The resulting numbers are now the official species census used by IUCN Red List: http://www.iucnredlist.org/details/7950/0. In 2016, Wildbook partnered up with WWF to build Wildbook for Sea Turtles, Internet of Turtles (IoT), as well as systems for seals and lynx. Most recently, we have demonstrated that we can now use publicly available social media images to count and track wild animals. In this paper we present and discuss both the impact and challenges that the use of crowdsourced images can have on wildlife conservation.
Open AccessWildbook: Crowdsourcing, computer vision, and data science for conservation
Photographs, taken by field scientists, tourists, automated cameras, and incidental photographers, are the most abundant source of data on wildlife today. Wildbook is an autonomous computational system that starts from massive collections of images and, by detecting various species of animals and identifying individuals, combined with sophisticated data management, turns them into high resolution information database, enabling scientific inquiry, conservation, and citizen science. We have built Wildbooks for whales (flukebook.org), sharks (whaleshark.org), two species of zebras (Grevy's and plains), and several others. In January 2016, Wildbook enabled the first ever full species (the endangered Grevy's zebra) census using photographs taken by ordinary citizens in Kenya. The resulting numbers are now the official species census used by IUCN Red List: http://www.iucnredlist.org/details/7950/0. In 2016, Wildbook partnered up with WWF to build Wildbook for Sea Turtles, Internet of Turtles (IoT), as well as systems for seals and lynx. Most recently, we have demonstrated that we can now use publicly available social media images to count and track wild animals. In this paper we present and discuss both the impact and challenges that the use of crowdsourced images can have on wildlife conservation.
- 11 June 2011
- Published by Springer Nature in International Journal of Computer Vision
- Vol. 97 (1) , 2-17
Physical Scale Keypoints: Matching and Registration for Combined Intensity/Range Images
- 11 June 2011
- Published by Springer Nature in International Journal of Computer Vision
- Vol. 97 (1) , 2-17
Physical Scale Keypoints: Matching and Registration for Combined Intensity/Range Images
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636919,p. 1-7
Keypoint Descriptors for Matching Across Multiple Image Modalities and Non-linear Intensity Variations
In this paper, we investigate the effect of substantial inter-image intensity changes and changes in modality on the performance of keypoint detection, description, and matching algorithms in the context of image registration. In doing so, we modify widely-used keypoint descriptors such as SIFT and shape contexts, attempting to capture the insight that some structural information is indeed preserved between images despite dramatic appearance changes. These extensions include (a) pairing opposite-direction gradients in the formation of orientation histograms and (b) focusing on edge structures only. We also compare the stability of MSER, Laplacian-of-Gaussian, and Harris corner keypoint location detection and the impact of detection errors on matching results. Our experiments on multimodal image pairs and on image pairs with significant intensity differences show that indexing based on our modified descriptors produces more correct matches on difficult pairs than current techniques at the cost of a small decrease in performance on easier pairs. This extends the applicability of image registration algorithms such as the Dual-Bootstrap which rely on correctly matching only a small number of keypoints.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636919,p. 1-7
Keypoint Descriptors for Matching Across Multiple Image Modalities and Non-linear Intensity Variations
In this paper, we investigate the effect of substantial inter-image intensity changes and changes in modality on the performance of keypoint detection, description, and matching algorithms in the context of image registration. In doing so, we modify widely-used keypoint descriptors such as SIFT and shape contexts, attempting to capture the insight that some structural information is indeed preserved between images despite dramatic appearance changes. These extensions include (a) pairing opposite-direction gradients in the formation of orientation histograms and (b) focusing on edge structures only. We also compare the stability of MSER, Laplacian-of-Gaussian, and Harris corner keypoint location detection and the impact of detection errors on matching results. Our experiments on multimodal image pairs and on image pairs with significant intensity differences show that indexing based on our modified descriptors produces more correct matches on difficult pairs than current techniques at the cost of a small decrease in performance on easier pairs. This extends the applicability of image registration algorithms such as the Dual-Bootstrap which rely on correctly matching only a small number of keypoints.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636919,p. 1-8
Simultaneous Covariance Driven Correspondence (CDC) and Transformation Estimation in the Expectation Maximization Framework
This paper proposes a new registration algorithm, Co-variance Driven Correspondences (CDC), that depends fundamentally on the estimation of uncertainty in point correspondences. This uncertainty is derived from the covariance matrices of the individual point locations and from the covariance matrix of the estimated transformation parameters. Based on this uncertainty, CDC uses a robust objective function and an EM-like algorithm to simultaneously estimate the transformation parameters, their covariance matrix, and the likely correspondences. Unlike the Robust Point Matching (RPM) algorithm, CDC requires neither an annealing schedule nor an explicit outlier process. Experiments on synthetic and real images using a polynomial transformation models in 2D and in 3D show that CDC has a broader domain of convergence than the well-known Iterative Closest Point (ICP) algorithm and is more robust to missing or extraneous structures in the data than RPM.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636919,p. 1-8
Simultaneous Covariance Driven Correspondence (CDC) and Transformation Estimation in the Expectation Maximization Framework
This paper proposes a new registration algorithm, Co-variance Driven Correspondences (CDC), that depends fundamentally on the estimation of uncertainty in point correspondences. This uncertainty is derived from the covariance matrices of the individual point locations and from the covariance matrix of the estimated transformation parameters. Based on this uncertainty, CDC uses a robust objective function and an EM-like algorithm to simultaneously estimate the transformation parameters, their covariance matrix, and the likely correspondences. Unlike the Robust Point Matching (RPM) algorithm, CDC requires neither an annealing schedule nor an explicit outlier process. Experiments on synthetic and real images using a polynomial transformation models in 2D and in 3D show that CDC has a broader domain of convergence than the well-known Iterative Closest Point (ICP) algorithm and is more robust to missing or extraneous structures in the data than RPM.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5, 3972-3977
A Correspondence-Based Software Toolkit for Image Registration
This paper presents a correspondence-based toolkit for image registration. Written in C++, the toolkit complements the capabilities of the insight toolkit (ITK). Major components include features, feature sets, match generators, error scale estimators, robust transformation estimators, and convergence testers, all combined and controlled by several different registration engines. Correspondence-based algorithms which can be implemented using the toolkit extend from ICP to hybrids of intensity-based and feature-based registration. The toolkit is being used both as an education tool and the foundation for developing new algorithms.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5, 3972-3977
A Correspondence-Based Software Toolkit for Image Registration
This paper presents a correspondence-based toolkit for image registration. Written in C++, the toolkit complements the capabilities of the insight toolkit (ITK). Major components include features, feature sets, match generators, error scale estimators, robust transformation estimators, and convergence testers, all combined and controlled by several different registration engines. Correspondence-based algorithms which can be implemented using the toolkit extend from ICP to hybrids of intensity-based and feature-based registration. The toolkit is being used both as an education tool and the foundation for developing new algorithms.
- 3 November 2003
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Medical Imaging
- Vol. 22 (11) , 1379-1394
The dual-bootstrap iterative closest point algorithm with application to retinal image registration
Motivated by the problem of retinal image registration, this paper introduces and analyzes a new registration algorithm called Dual-Bootstrap Iterative Closest Point (Dual-Bootstrap ICP). The approach is to start from one or more initial, low-order estimates that are only accurate in small image regions, called bootstrap regions. In each bootstrap region, the algorithm iteratively: 1) refines the transformation estimate using constraints only from within the bootstrap region; 2) expands the bootstrap region; and 3) tests to see if a higher order transformation model can be used, stopping when the region expands to cover the overlap between images. Steps 1): and 3), the bootstrap steps, are governed by the covariance matrix of the estimated transformation. Estimation refinement [Step 2)] uses a novel robust version of the ICP algorithm. In registering retinal image pairs, Dual-Bootstrap ICP is initialized by automatically matching individual vascular landmarks, and it aligns images based on detected blood vessel centerlines. The resulting quadratic transformations are accurate to less than a pixel. On tests involving approximately 6000 image pairs, it successfully registered 99.5% of the pairs containing at least one common landmark, and 100% of the pairs containing at least one common landmark and at least 35% image overlap.
- 3 November 2003
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Medical Imaging
- Vol. 22 (11) , 1379-1394
The dual-bootstrap iterative closest point algorithm with application to retinal image registration
Motivated by the problem of retinal image registration, this paper introduces and analyzes a new registration algorithm called Dual-Bootstrap Iterative Closest Point (Dual-Bootstrap ICP). The approach is to start from one or more initial, low-order estimates that are only accurate in small image regions, called bootstrap regions. In each bootstrap region, the algorithm iteratively: 1) refines the transformation estimate using constraints only from within the bootstrap region; 2) expands the bootstrap region; and 3) tests to see if a higher order transformation model can be used, stopping when the region expands to cover the overlap between images. Steps 1): and 3), the bootstrap steps, are governed by the covariance matrix of the estimated transformation. Estimation refinement [Step 2)] uses a novel robust version of the ICP algorithm. In registering retinal image pairs, Dual-Bootstrap ICP is initialized by automatically matching individual vascular landmarks, and it aligns images based on detected blood vessel centerlines. The resulting quadratic transformations are accurate to less than a pixel. On tests involving approximately 6000 image pairs, it successfully registered 99.5% of the pairs containing at least one common landmark, and 100% of the pairs containing at least one common landmark and at least 35% image overlap.
- 1 January 2003
- Published by Springer Nature
- Vol. 18, 475-486
A View-Based Approach to Registration: Theory and Application to Vascular Image Registration
This paper presents an approach to registration centered on the notion of a view — a combination of an image resolution, a transformation model, an image region over which the model currently applies, and a set of image primitives from this region. The registration process is divided into three stages: initialization, automatic view generation, and estimation. For a given initial estimate, the latter two alternate until convergence; several initial estimates may be explored. The estimation process uses a novel generalization of the Iterative Closest Point (ICP) technique that simultaneously considers multiple correspondences for each point. View-based registration is applied successfully to alignment of vascular and neuronal images in 2-d and 3-d using similarity, affine, and quadratic transformations.
- 1 January 2003
- Published by Springer Nature
- Vol. 18, 475-486
A View-Based Approach to Registration: Theory and Application to Vascular Image Registration
This paper presents an approach to registration centered on the notion of a view — a combination of an image resolution, a transformation model, an image region over which the model currently applies, and a set of image primitives from this region. The registration process is divided into three stages: initialization, automatic view generation, and estimation. For a given initial estimate, the latter two alternate until convergence; several initial estimates may be explored. The estimation process uses a novel generalization of the Iterative Closest Point (ICP) technique that simultaneously considers multiple correspondences for each point. View-based registration is applied successfully to alignment of vascular and neuronal images in 2-d and 3-d using similarity, affine, and quadratic transformations.
- 3 May 2000
- Published by Elsevier in Image and Vision Computing
- Vol. 18 (10) , 795-804
Real time tracking of borescope tip pose
- 3 May 2000
- Published by Elsevier in Image and Vision Computing
- Vol. 18 (10) , 795-804
Real time tracking of borescope tip pose
- 1 April 2000
- Published by Elsevier in Computer Vision and Image Understanding
- Vol. 78 (1) , 1-7
Robust Computer Vision: An Interdisciplinary Challenge
- 1 April 2000
- Published by Elsevier in Computer Vision and Image Understanding
- Vol. 78 (1) , 1-7
Robust Computer Vision: An Interdisciplinary Challenge
- 1 December 1996
- Published by Springer Nature in International Journal of Computer Vision
- Vol. 20 (3)
Geometric constraints and stereo disparity computation
- 1 December 1996
- Published by Springer Nature in International Journal of Computer Vision
- Vol. 20 (3)
Geometric constraints and stereo disparity computation