Spelling suggestions: "subject:"[een] ARTIFICIAL INTELLIGENCE"" "subject:"[enn] ARTIFICIAL INTELLIGENCE""
111 |
Edge and Mean Based Image CompressionDesai, Ujjaval Y., Mizuki, Marcelo M., Masaki, Ichiro, Horn, Berthold K.P. 01 November 1996 (has links)
In this paper, we present a static image compression algorithm for very low bit rate applications. The algorithm reduces spatial redundancy present in images by extracting and encoding edge and mean information. Since the human visual system is highly sensitive to edges, an edge-based compression scheme can produce intelligible images at high compression ratios. We present good quality results for facial as well as textured, 256~x~256 color images at 0.1 to 0.3 bpp. The algorithm described in this paper was designed for high performance, keeping hardware implementation issues in mind. In the next phase of the project, which is currently underway, this algorithm will be implemented in hardware, and new edge-based color image sequence compression algorithms will be developed to achieve compression ratios of over 100, i.e., less than 0.12 bpp from 12 bpp. Potential applications include low power, portable video telephones.
|
112 |
Recognizing 3D Object Using Photometric InvariantNagao, Kenji, Grimson, Eric 22 April 1995 (has links)
In this paper we describe a new efficient algorithm for recognizing 3D objects by combining photometric and geometric invariants. Some photometric properties are derived, that are invariant to the changes of illumination and to relative object motion with respect to the camera and/or the lighting source in 3D space. We argue that conventional color constancy algorithms can not be used in the recognition of 3D objects. Further we show recognition does not require a full constancy of colors, rather, it only needs something that remains unchanged under the varying light conditions sand poses of the objects. Combining the derived color invariants and the spatial constraints on the object surfaces, we identify corresponding positions in the model and the data space coordinates, using centroid invariance of corresponding groups of feature positions. Tests are given to show the stability and efficiency of our approach to 3D object recognition.
|
113 |
Direct Object Recognition Using No Higher Than Second or Third Order Statistics of the ImageNagao, Kenji, Horn, Berthold 01 December 1995 (has links)
Novel algorithms for object recognition are described that directly recover the transformations relating the image to its model. Unlike methods fitting the typical conventional framework, these new methods do not require exhaustive search for each feature correspondence in order to solve for the transformation. Yet they allow simultaneous object identification and recovery of the transformation. Given hypothesized % potentially corresponding regions in the model and data (2D views) --- which are from planar surfaces of the 3D objects --- these methods allow direct compututation of the parameters of the transformation by which the data may be generated from the model. We propose two algorithms: one based on invariants derived from no higher than second and third order moments of the image, the other via a combination of the affine properties of geometrical and the differential attributes of the image. Empirical results on natural images demonstrate the effectiveness of the proposed algorithms. A sensitivity analysis of the algorithm is presented. We demonstrate in particular that the differential method is quite stable against perturbations --- although not without some error --- when compared with conventional methods. We also demonstrate mathematically that even a single point correspondence suffices, theoretically at least, to recover affine parameters via the differential method.
|
114 |
Complexity of probabilistic inference in belief nets--an experimental studyLi, Zhaoyu 16 November 1990 (has links)
There are three families of exact methods used for probabilistic inference in
belief nets. It is necessary to compare them and analyze the advantages and
the disadvantages of each algorithm, and know the time cost of making
inferences in a given belief network. This paper discusses the factors that
influence the computation time of each algorithm, presents the predictive model
of the time complexity for each algorithm and shows the statistical results of
testing the algorithms with randomly generated belief networks. / Graduation date: 1991
|
115 |
Representing and learning routine activitiesHexmoor, Henry H. January 1900 (has links)
Thesis (Ph. D.)--State University of New York at Buffalo, 1995. / "December 1995." Includes bibliographical references (p. 127-142). Also available in print.
|
116 |
Multilabel classification over category taxonomies.Cai, Lijuan. January 2008 (has links)
Thesis (Ph.D.)--Brown University, 2008. / Advisor : Thomas Hofmann. Includes bibliographical references (leaves 111-118).
|
117 |
Adaptive management of emerging battlefield network /Fountoukidis, Dimitrios P. January 2004 (has links) (PDF)
Thesis (M.S. in Information Technology Management and M.S. in Modeling Virtual Environment and Simulation)--Naval Postgraduate School, March 2004. / Thesis advisor(s): Alex Bordetsky, John Hiles. Includes bibliographical references. Also available online.
|
118 |
Symbolic model checking techniques for BDD-based planning in distributed environmentsGoel, Anuj, January 2002 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 2002. / Vita. Includes bibliographical references. Available also from UMI Company.
|
119 |
Symbolic model checking techniques for BDD-based planning in distributed environments /Goel, Anuj, January 2002 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 2002. / Vita. Includes bibliographical references (leaves 175-180). Available also in a digital version from Dissertation Abstracts.
|
120 |
Task encoding, motion planning and intelligent control using qualitative modelsRamamoorthy, Subramanian 28 August 2008 (has links)
Not available / text
|
Page generated in 0.0703 seconds