School of Computer Science
Permanent URI for this community
Delivering highest quality teaching and research to meet IT challenges of the future
Browse
Browsing School of Computer Science by Issue Date
Now showing 1 - 20 of 3138
Results Per Page
Sort Options
Item Metadata only The variational approach to shape from shading(Academic Press, 1986) Horn, B.K.P.; Brooks, M.J.Abstract not availableItem Metadata only Beyond LR(1). Using a two-stack (bottom-up) parser with zero backtracking as an alternative to LR(K).(Department of Information Science, University of Tasmania, 1995) Buckley, B.; Oudshoorn, Michael JohnItem Metadata only Determining light-source direction from images of shading(Ablex Publishing Corporation, 1995) Gibbins, D.; Brooks, M.; Chojnacki, W.Item Metadata only Identifying data redundancies within the land classification task: A case study using GIS and inductive learning techniques(UN: ESCAP Regional Remote Sensing Programme, 1995) Eklund, P. W.; Kirkby, Stephen Denis; Salim, A.Item Metadata only A note on complete integrals(American Mathematical Society, 1995) Chojnacki, W.We present a theorem concerning the representation of solutions of a first-order partial differential equation in terms of a complete integral of the equation. We discuss the geometrical significance of that theorem. © 1995 American Mathematical Society.Item Metadata only Applications of fuzzy matrices in agriculture(World Scientific, 1995) Eklund, Peter W.; Sun, Ximing; Thomas, D. A.; School of Computer ScienceItem Metadata only Solving the shape-from-shading problem on the CM-5(IEEE, 1995) Brooks, M.J.; Chojnacki, W.; van den Hengel, A.; Computer Architectures for Machine Perception (CAMP '95) (18 Sep 1995 - 20 Sep 1995 : Como, Italy)We consider the problem of recovering surface shape from image shading for the situation in which a distant overhead "sun" illuminates a Lambertian surface. An iterative scheme is presented which requires no prerequisite shape information. This scheme forms the basis for a parallel algorithm implemented on a CM-5. Performance of the CM-5 implementation is compared with that of a sequential implementation running on a Sun Sparc 2. Also considered are the complexity and scalability of the parallel algorithm as a function of image size and number of processors, respectively.Item Metadata only Abstract Data Types and the Digital System Description and Simulation Environments(Kluwer Academic Publishers, 1996) Wilsey, Peter A.; Mause, Norman E.; Ashenden, Peter J.; School of Computer ScienceItem Metadata only The Designer's Guide to VHDL(Morgan Kaufmann Publishers, 1996) Ashenden, Peter J.; School of Computer ScienceItem Metadata only Aspects and Taxonomy of Program Visualisation(World Scientific, 1996) Oudshoorn, Michael John; Widjaja, Hendra; Ellershaw, S. K.; School of Computer ScienceItem Metadata only Geographic Field Data Collection: Using machine learning techniques to verify minimum data requirements for the classification task(1996) Kirkby, Stephen Denis; Eklund, P. W.Item Metadata only Uniform Full-Information Image Matching Using Complex Wavelets(1996) Pan, He-PingItem Metadata only Programmed Monitoring and Digital System Simulation(Kluwer Academic Publishers, 1996) Wilsey, Philip A.; Vemuri, Ranga; Ashenden, Peter J.; Mause, N.; School of Computer ScienceItem Metadata only A partitioning-independent paradigm for nested data parallelism(Springer Science + Business Media, 1996) Engelhardt, D.; Wendelborn, A.Item Metadata only Recovering unknown focal lengths in self-calibration: an essentially linear algorithm and degenerate configurations(International Society for Photogrammetry and Remote Sensing, 1996) Newsam, G.; Huynh, D.; Brooks, M.; Pan, H.If sufficiently many pairs of corresponding points in a stereo image pair are available to construct the associated fundamental matrix, then it has been shown that 5 relative orientation parameters and 2 focal lengths can be recovered from this fundamental matrix. This paper presents a new and essentially linear algorithm for recovering focal lengths. Moreover the derivation of the algorithm also provides a complete characterisation of all degenerate configurations in which focal lengths cannot be uniquely recovered. There are two classes of degenerate configurations: either one of the optical axes of the cameras lies in the plane spanned by the baseline and the other optical axis; or one optical axis lies in the plane spanned by the baseline and the vector that is orthogonal to both the baseline and the other axis. The result that the first class of configurations (i.e. ones in which the optical axes are coplanar) is degenerate is of some practical importance since it shows that self-calibration of unknown focal lengths is not possible in certain stereo heads, a configuration widely used for binocular vision systems in robotics.Item Metadata only Group representations of bounded cosine functions(WALTER DE GRUYTER & CO, 1996) Chojnacki, W.Item Metadata only Research into the conditional task scheduling problem(International Academic Publishers, 1997) Huang, L.; Oudshoorn, Michael John; School of Computer ScienceItem Metadata only Collaboration & Networked Technology: A Case Study in Teaching Educational Computing(1997) Eklund, J.; Eklund, P. W.Item Metadata only Implementing a Shortest Path Algorithm in a 3D GIS Environment(Taylor and Francis, 1997) Kirkby, Stephen Denis; Pollitt, S. E.; Eklund, P. W.; School of Computer ScienceItem Metadata only The Web KB Set of Tools(Springer, 1997) Martin, P.; School of Computer Science