D. A. Huffman. Impossible objects as non-sense sentences. Machine Intelligence, 6:295--323, 1971. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
From Local to Global Consistency - Dechter (1992) (73 citations) (Correct)
....problem using similar techniques and showed the same complexity bounds. However, once integer domains are introduced the full algebra (containing the relation) becomes intractable. Example 6.5. A different family of constraint networks arises in the domain of scene labeling. Huffman [15] and Clowes [2] developed a basic labeling scheme for blocks world picture graphs. Given a basic labeling set: convex) concave) occluding, object on arrowhead side with two possible senses) and a standard set of simplifying assumptions on scene content, the physically realizable ....
D.A. Huffman, Impossible objects as nonsense sentences, in: B. Meltzer and D. Michie eds., Machine Intelligence 6 (Edinburgh University Press, Edinburgh, Scotland 1971) 195-234.
Shape-from-Image via Cross-Sections - Ros, Thomas (2000) (Correct)
....it is an invariant projective property, and for trihedral drawings it can be checked with a pencil and an unmarked ruler alone. 1. Introduction Emulating the human performance in interpreting drawings of polyhedra has been one of the goals of Computer Vision along the past three decades [2, 13, 12, 3, 1]. A usual motivation behind the extensive work done in the area is helping to elucidate why humans are able to reject impossible figures , and recover 3D shapes from correct ones (fig. 1) despite the reduced information they offer, without textures on the surfaces, illumination patterns, or ....
....in (a) b) c) Figure 2. Correct (left) and incorrect drawings (right) terpretation. The incidence structure can be computed by applying the method in [12, pag. 45] after a labelling of its edges has been obtained using techniques described in [2, 13, 5]. For a polydisk in 3 space, we say that a face is sequentially adjacent to faces # 34150 if the edges between and these faces are sequentially linked, meaning that if ( denotes the edge between faces ) then in the sequence , ....
D. Huffman. Impossible objects as nonsense sentences. Machine Intelligence, 6:295--323, 1971.
Correcting Polyhedral Projections for Scene Reconstruction - Ros, Thomas (2001) (1 citation) (Correct)
....reconstruction. R V Theta F is the incidence set: there is an incidencepair (v# f)inR if vertex v must lie on face f in space. The incidence structure can be computed by applying the method in [13, page 45] after a labeling of its edges has been obtained using standard techniques like those in [2, 15,7,6]. In his book [13] Sugihara gives an algebraic test for correctness that, roughly speaking, consists of telling whether a system of linear equalities and inequalities has a solution, which is solvable via linear programming. This system contains an equation of the form (v x #v y #v z # 1) ....
D. Huffman. Impossible objects as nonsense sentences. Machine Intelligence, 6:295--323, 1971.
An Invitation to Discuss Computer Depiction - Durand (2002) (8 citations) (Correct)
....spaces was initially developed to discuss projection systems, but it can be extended to all aspects of depiction. Line drawing is an interesting example. Its primary space expression is the projection of edges and occluding contours onto the picture plane. However, as shown by e.g. Huffman [Huf71] Clowes [Clo71] and Guzman [Guz71] there is a set of sufficient rules in the picture plane that characterize the line drawing of a 3D objects. These rules in the secondary space describe vertices, edges, T vertices and end junctions, and ensure that the direction of occlusion is coherent within ....
D. Huffman. Impossible objects as nonsense sentences. In B. Meltzer and D. Michie, editors, Machine Intelligence 6, pages 295--324. Edinburgh U. Pr., 1971.
An Invitation to Discuss Computer Depiction - Durand (2002) (8 citations) (Correct)
....in primary space. The distinction between primary and secondary spaces can be extended to denotation and attributes. Line drawing is an interesting example. Its primary expression is the projection of edges and occluding contours onto the picture plane. However, as shown by e.g. Huffman [Huf71] Clowes [Clo71] and Guzman [Guz71] there is a set of sufficient rules in the picture plane that characterize the line drawing of a 3D objects. These rules in the secondary space describe vertices, edges, t vertices and end junctions, and ensure that the direction of occlusion is coherent within ....
D. Huffman. Impossible objects as nonsense sentences. In B. Meltzer and D. Michie, editors, Machine Intelligence 6, pages 295--324. Edinburgh U. Pr., 1971.
Recovering LSHGCs and SHGCs from Stereo - Chung (1996) (4 citations) (Correct)
....in parallel with the stereo work, there are work that recovers shapes from a single image. Questions are, what are the limitations of such monocular methods, and precisely howmuch more can our stereo method offer Early monocular work was focussed on the analysis of line drawings of polyhedra [12, 9, 15, 13]. There have also been some primitive attempts to handle curved surfaces such as [1, 22, 27, 11] Ponce et al. 18] examined invariant properties of 3 D shapes in their 2 D projections, and showed that the shape reconstruction problem can be simplified in the case where the objects viewed are GCs. ....
D. Huffman. Impossible objects as nonsense sentences. In B. Meltzer and D. Michie, editors, Machine Intelligence6, pages 295--323. Edinburgh University Press, Edinburgh, 1971.
Identification of Faces in a 2D Line Drawing Projection of a .. - Shpitalni, Lipson (Correct)
....enclosing the graph faces. Moreover, the objects considered are typically confined to plane faced objects from the trihedral or Origami world, for which simpler line labeling procedures can be applied. Single projection line drawing interpretation has been treated qualitatively by Huffman [6] and Clowes [7] and quantitatively using line labeling techniques by, for example, Kanade [8] and Sugihara [9] According to these techniques, an edge in a drawing can represent one of three states: concave face connection, convex face connection, or occluding face edge. A consistent set of line ....
D. A. Huffman, "Impossible objects as nonsense sentences," Machine Intelligence 6, Edinburgh Univ. Press., pp. 295-323, 1971.
The Detection Of 2D Image Features Using Local Energy - Robbins (1996) (Correct)
....a significant portion of the information in the original image. 2D image features allow this data reduction while constraining the detected image point to a ray through the viewed scene, making them useful for applications such as stereo matching [24] structure from motion [56] and line labeling [17, 27, 8, 73, 35]. 2.1 What are 2D Features Early attempts at 2D feature detection were often methods for the detection of greylevel corners (or L junctions) in images [28, 47] These image points typically arise from the projection of points that are object vertices or edges with high local curvature in the ....
....with high local curvature in the scene. While these L junctions are important, and perhaps the most common type of 2D feature, it is important to detect many other types of 2D intensity variations. Line labeling is one of the early endeavours in computer vision that met with considerable success [27, 8, 35]. Line labeling is the classification of each curve in a line drawing as corresponding to either a depth or orientation discontinuity in the scene, with further sub classification of each kind of discontinuity, and is a major component of the interpretation of line drawings. An example of such a ....
D. A. Huffman. Impossible objects as nonsense sentences. Machine Intelligence 6, pages 295--323, 1971.
Shape-from-Image via Cross-Sections - Ros, Thomas (2000) (Correct)
....it is an invariant projective property, and for trihedral drawings it can be checked with a pencil and an unmarked ruler alone. 1. Introduction Emulating the human performance in interpreting drawings of polyhedra has been one of the goals of Computer Vision along the past three decades [2, 13, 12, 3, 1]. A usual motivation behind the extensive work done in the area is helping to elucidate why humans are able to reject impossible figures , and recover 3D shapes from correct ones (fig. 1) despite the reduced information they offer, without textures on the surfaces, illumination patterns, or ....
....(a) b) c) l l l m m n n m1 n1 m2 n2 ff fi Figure 2. Correct (left) and incorrect drawings (right) terpretation. The incidence structure can be computed by applying the method in [12, pag. 45] after a labelling of its edges has been obtained using techniques described in [2, 13, 5]. For a polydisk P in 3 space, we say that a face f of P is sequentially adjacent to faces f i 1 ; f i 2 ; f i m of P if the edges between f and these faces are sequentially linked, meaning that if (f; f i k ) denotes the edge between faces f and f i k , then in the sequence s = f(f; f i ....
D. Huffman. Impossible objects as nonsense sentences. Machine Intelligence, 6:295--323, 1971.
Principles of Constraint Programming - Apt (2000) (9 citations) (Correct)
....existing object. For instance in this case one fork junction connecting C; E and G is missing. The arrows and mark the outer edges of the examined object and they should be chosen in such a way that one can go along the outer edges of the object by following the directions of the arrows. Huffman (1971) found that a scene formed by the already mentioned four types of junctions represents an existing object exactly when its edges can be labelled in such a way that only junctions listed in Figure 2.9 are used. Gamma Gamma Gamma Gamma Gamma Gamma Gamma ....
Huffman, D. (1971), Impossible objects as nonsense sentences, in B. Meltzer & D. Mitchie, eds, `Machine Intelligence 6', pp. 295--323.
Kwan-Yee Kenneth Wong - Wolfson College Department (Correct)
No context found.
D. A. Huffman. Impossible objects as non-sense sentences. Machine Intelligence, 6:295--323, 1971.
On Designing a Visual System (Towards a Gibsonian computational.. - Sloman (1989) (3 citations) (Correct)
No context found.
Huffman, D. (1971). Impossible objects as nonsense sentences. In Michie, D. and Meltzer, B., editors, Machine Intelligence 6. Edinburgh University Press.
EUROGRAPHICS Workshop on ... (2004), pp. 1--10 - Cani And Slater (Correct)
No context found.
D.A.Huffman, Impossible Objects as Nonsense Sentences, Machine Intelligence 6, 295--323, New York American Elsevier, 1971.
ACM Symposium on Solid Modeling and Applications (2004) - Brunet Patrikalakis Editors (Correct)
No context found.
D.A.Huffman, Impossible Objects as Nonsense Sentences, Machine Intelligence 6, 295--323, New York American Elsevier, 1971.
Figure 15: Results for two combinatorially equivalent.. - Program In This (Correct)
No context found.
D.A. Huffman. Impossible objects as nonsense sentences. Machine Intelligence, 6:295--323, 1971.
On the Minimality and Global Consistency of Row-Convex.. - van Beek, Dechter (13 citations) (Correct)
No context found.
D. A. Huffman. Impossible objects as nonsense sentences. In B. Meltzer and D. Michie, editors, Machine Intelligence 6, pages 295--323. Edinburgh Univ. Press, 1971.
Smart Sketch System for 3D Reconstruction Based Modeling - Naya, Conesa, Contero.. (Correct)
No context found.
Huffman, D.A.: Impossible Objects as Nonsense Sentences. In: Meltzer B., Michie D. (eds.) Machine Intelligence, No. 6, Edimburgh UK. Edinburgh University Press (1971) 295-323
Parametric Freehand Sketches - Ferran Naya Manuel (Correct)
No context found.
Huffman, D.A.: Impossible Objects as Nonsense Sentences. In: Meltzer B., Michie D. (eds.) Machine Intelligence, No. 6, Edimburgh UK. Edinburgh University Press (1971) 295-323
Interpreting Line Drawings of Objects with K-Vertices - Varley, Suzuki, Martin (Correct)
No context found.
D.A. Huffman, Impossible Objects as Nonsense Sentences, Machine Intelligence 6 295--323, 1971.
Making the Most of Using Depth Reasoning to Label Line.. - Varley, Suzuki, Martin (2004) (Correct)
No context found.
D.A.Huffman, Impossible Objects as Nonsense Sentences, Machine Intelligence 6, 295--323, New York American Elsevier, 1971.
Part-based Grouping and Recognition: A Model-Guided Approach - Pilu (1996) (1 citation) (Correct)
No context found.
D. Huffman. Impossible objects as nonsense sentences. Machine Intelligence,6,1971.
A System for Constructing Boundary Representation Solid.. - Varley, Martin (2000) (Correct)
No context found.
D.A.Huffman, Impossible Objects as Nonsense Sentences, Machine Intelligence 6, 295--323, New York American Elsevier, 1971.
Overcoming Superstrictness in Line Drawing Interpretation - Ros, Thomas (Correct)
No context found.
D. A. Huffman, "Impossible objects as nonsense sentences," Machine Intelligence, vol. 6, pp. 295--323, 1971.
Creating solid models from single 2D sketches - Grimstead, Martin (1995) (4 citations) (Correct)
No context found.
D A Huffman. Impossible Objects as Nonsense Sentences, pages 295--323. Machine Intelligence 6. New York: American Elsevier, 1971.
Rotationally Symmetric Operators for Surface Interpolation - Brady, Horn (1981) (7 citations) (Correct)
No context found.
Huffman D. A. "Impossible Objects as Nonsense Sentences," Machine Intelligence 6, eds. Meltzer B. and Michie D., Edinburgh University Press, 1971.
First 50 documents Next 50
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