J. Boardman, "Automating spectral unmixing of AVIRIS data using convex geometry concepts," in Summaries of the Fourth Annual JPL Airborne Geoscience Workshop, JPL Pub. 93-26, AVIRIS Workshop., vol. 1, 1993, pp. 11--14. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Systolic array for computing the pixel purity index .. - Lavenier, Fabiani, .. (Correct)
....The aim of the Pixel Purity Index (PPI) algorithm is to help identifying the pure pixels, so that all the remaining pixels can be expressed as a linear combination of them. The goal of the paper is not to explain how the PPI algorithm works. Readers interested in the PPI foundation can refer to [1] and [2] for a complete explanation. We will just briefly recall its principle. The PPI algorithm proceeds by generating a large number of random D dimensional vectors, called skewers, through the hyper spectral image as shown in figure 1. For each skewer, every data point is projected onto the ....
J.W. Boardman, "Automating spectral unmixing of AVIRIS data using convex geometric concepts", Summaries of the Fourth Annual JPL Airborne Geosciences Workshop, R.Q. Green ed., 1994
The Quickhull Algorithm for Convex Hulls - Barber, Dobkin, Huhdanpaa (1996) (89 citations) (Correct)
....halfspace intersection 1. INTRODUCTION The convex hull of a set of points is the smallest convex set that contains the points. The convex hull is a fundamental construction for mathematics and computational geometry. For example, Boardman uses the convex hull in his analysis of spectrometry data [Boardman 1993] and Weeks uses the convex hull to determine the canonical triangulation of cusped hyperbolic 3 manifolds [Weeks 1991] Other problems can be reduced to the convex hull for example, halfspace intersection, Delaunay triangulation, Voronoi diagrams, and power diagrams. In his review article, ....
.... structures in layered manufacturing [Allen and Dutta 1995] classification of molecules by their biological activity, vibration control, geographic information systems, neighbors of the origin in the R 8 lattice, stress analysis, stability of robot grasps [Belsis et al. 1995] spectrometry [Boardman 1993], constrained control allocation [Bordignon and Durham 1995] robot navigation [Cucka et al. 1995] micromagnetic modeling [Porter et al. 1996] and invariant sets of deltasigma modulators [Zhang et al. 1994] ACKNOWLEDGMENTS Albert Marden and Victor Milenkovic provided excellent environments ....
Boardman, J. 1993. Automating spectral unmixing of AVIRIS data using convex geometry concepts. Fourth Annual JPL Airborne Geoscience Workshop, Washington, D.C.
The Quickhull Algorithm for Convex Hulls - Barber, Dobkin, Huhdanpaa (1995) (89 citations) (Correct)
....or more dimensions. 1. Introduction The convex hull of a set of points is the smallest convex set that contains the points. The convex hull is a fundamental construction for mathematics and computational geometry. For example, Boardman uses the convex hull in his analysis of spectrometry data [6] and Weeks uses the convex hull to determine the canonical triangulation of cusped hyperbolic 3 manifolds [44] Other problems can be reduced to the convex hull for example, halfspace intersection, Delaunay 116 Fayerweather Street, Cambridge, MA 02138, bradb geom.umn.edu. This research was ....
....via ftp. It has been used for support structures in layered manufacturing [1] classification of molecules by their biological activity, vibration control, geographic information systems, neighbors of the origin in the R 8 lattice, stress analysis, stability of robot grasps [5] spectrometry [6], constrained control allocation [8] robot navigation [17] micromagnetic modeling [38] and invariant sets of delta sigma modulators [45] Acknowledgments: A special thanks to Albert Marden and Victor Milenkovic for providing excellent environments for completing this work. The referees ....
J.W. Boardman. Automating spectral unmixing of AVIRIS data using convex geometry concepts. Fourth Airborne Geoscience Workshop, Washington, D.C., October 1993.
Vertex Component Analysis: A Fast Algorithm to Unmix.. - Nascimento, Dias (2004) (Correct)
No context found.
J. Boardman, "Automating spectral unmixing of AVIRIS data using convex geometry concepts," in Summaries of the Fourth Annual JPL Airborne Geoscience Workshop, JPL Pub. 93-26, AVIRIS Workshop., vol. 1, 1993, pp. 11--14.
Does Independent Component Analysis Play a Role in Unmixing.. - Nascimento, Dias (2004) (Correct)
No context found.
J. Boardman, "Automating spectral unmixing of AVIRIS data using convex geometry concepts," in Summaries of the Fourth Annual JPL Airborne Geoscience Workshop, JPL Pub. 93-26, AVIRIS Workshop., vol. 1, 1993, pp. 11--14.
Co-design of Software and Hardware to Implement.. - Theiler, Frigo.. (2001) (Correct)
No context found.
J. W. Boardman, "Automating spectral unmixing of AVIRIS data using convex geometry concepts," in Summaries of the Fourth Annual JPL Airborne Geoscience Workshop, R. O. Green, ed., pp. 11--14, 1994.
Using Blocks of Skewers for Faster Computation of.. - Theiler, Lavenier, .. (2000) (2 citations) (Correct)
No context found.
J. W. Boardman, "Automating spectral unmixing of AVIRIS data using convex geometry concepts," in Summaries of the Fourth Annual JPL Airborne Geoscience Workshop, R. O. Green, ed., pp. 11--14, 1994.
Using Blocks of Skewers for Faster Computation of.. - Theiler, Lavenier, .. (2000) (2 citations) (Correct)
No context found.
J. W. Boardman, \Automating spectral unmixing of AVIRIS data using convex geometry concepts," in Summaries of the Fourth Annual JPL Airborne Geoscience Workshop, R. O. Green, ed., pp. 11-14, 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC