Results 1  10
of
2,886
Recognitionbycomponents: A theory of human image understanding
 Psychological Review
, 1987
"... The perceptual recognition of objects is conceptualized to be a process in which the image of the input is segmented at regions of deep concavity into an arrangement of simple geometric components, such as blocks, cylinders, wedges, and cones. The fundamental assumption of the proposed theory, recog ..."
Abstract

Cited by 1272 (23 self)
 Add to MetaCart
, recognitionbycomponents (RBC), is that a modest set of generalizedcone components, called geons (N ^ 36), can be derived from contrasts of five readily detectable properties of edges in a twodimensional image: curvature, collinearity, symmetry, parallelism, and cotermmation. The detection
Region Filling and Object Removal by ExemplarBased Image Inpainting
, 2004
"... A new algorithm is proposed for removing large objects from digital images. The challenge is to fill in the hole that is left behind in a visually plausible way. In the past, this problem has been addressed by two classes of algorithms: 1) “texture synthesis” algorithms for generating large image re ..."
Abstract

Cited by 365 (1 self)
 Add to MetaCart
regions from sample textures and 2) “inpainting ” techniques for filling in small image gaps. The former has been demonstrated for “textures”—repeating twodimensional patterns with some stochasticity; the latter focus on linear “structures ” which can be thought of as onedimensional patterns
The Turn Model for Adaptive Routing
 JOURNAL OF ACM
, 1994
"... This paper presents a model for designing wormhole routing algorithms, A unique feature of the model is th~t lt is not based cm adding physical or virtual channels to direct networks (although it can be applied to networks with extra channels). Instead, the model is based [In analyzlng the directio ..."
Abstract

Cited by 361 (6 self)
 Add to MetaCart
topologies for wormhole routing, ~zdimensional meshes and kary /zcubes without extra channels. In such networks, just a quarter of the turns must be prohibited to prevent deadlock. The remaining three quarters of the turns allow routing to be fidaptwe, Adaptive routing algorithms are described for twodimensional
TwoDimensional Cellular Automata,”
 Journal of Statistical Physics,
, 1985
"... A largely phenomenological study of twodimensional cellular automata is reported. Qualitative classes of behavior similar to those in onedimensional cellular automata are found. Growth from simple seeds in twodimensional cellular automata can produce patterns with complicated boundaries, charact ..."
Abstract

Cited by 123 (1 self)
 Add to MetaCart
A largely phenomenological study of twodimensional cellular automata is reported. Qualitative classes of behavior similar to those in onedimensional cellular automata are found. Growth from simple seeds in twodimensional cellular automata can produce patterns with complicated boundaries
Swarming patterns in a twodimensional kinematic model for biological groups
 SIAM J. Appl. Math
, 2004
"... Abstract. We construct a continuum model for the motion of biological organisms experiencing social interactions and study its patternforming behavior. The model takes the form of a conservation law in two spatial dimensions. The social interactions are modeled in the velocity term, which is nonloc ..."
Abstract

Cited by 118 (15 self)
 Add to MetaCart
Abstract. We construct a continuum model for the motion of biological organisms experiencing social interactions and study its patternforming behavior. The model takes the form of a conservation law in two spatial dimensions. The social interactions are modeled in the velocity term, which
Fast twodimensional pattern matching with rotations
 In Proc. 15th Annual Symposium on Combinatorial Pattern Matching (CPM 2004), LNCS v. 3109
, 2004
"... Abstract The problem of pattern matching with rotation is that of ÿnding all occurrences of a twodimensional pattern in a text, in all possible rotations. We prove an upper and lower bound on the number of such di erent possible rotated patterns. Subsequently, given an m × m array (pattern) and an ..."
Abstract

Cited by 18 (4 self)
 Add to MetaCart
Abstract The problem of pattern matching with rotation is that of ÿnding all occurrences of a twodimensional pattern in a text, in all possible rotations. We prove an upper and lower bound on the number of such di erent possible rotated patterns. Subsequently, given an m × m array (pattern
Complexity of TwoDimensional Patterns
, 2000
"... In dynamical systems such as cellular automata and iterated maps, it is often useful to look at a language or set of symbol sequences produced by the system. There are wellestablished classification schemes, such as the Chomsky hierarchy, with which we can measure the complexity of these sets of se ..."
Abstract

Cited by 26 (4 self)
 Add to MetaCart
of sequences, and thus the complexity of the systems which produce them. In this paper, we look at the first few levels of a hierarchy of complexity for twoormoredimensional patterns. We show that several de nitions of "regular language" or "local rule" that are equivalent in d = 1 lead
Object removal by exemplarbased inpainting
, 2003
"... A new algorithm is proposed for removing large objects from digital images. The challenge is to fill in the hole that is left behind in a visually plausible way. In the past, this problem has been addressed by two classes of algorithms: (i) “texture synthesis ” algorithms for generating large image ..."
Abstract

Cited by 188 (3 self)
 Add to MetaCart
regions from sample textures, and (ii) “inpainting ” techniques for filling in small image gaps. The former work well for “textures ” – repeating twodimensional patterns with some stochasticity; the latter focus on linear “structures ” which can be thought of as onedimensional patterns, such as lines
Optimal TwoDimensional Compressed Matching
 In Proc. Data Compression Conference
, 1994
"... Recent proliferation of digitized data and the unprecedented growth in the volume of stored and transmitted data motivated the definition of the compressed matching paradigm. This is the problem of efficiently finding a pattern P in a compressed text T without the need to decompress. We present the ..."
Abstract

Cited by 85 (9 self)
 Add to MetaCart
Recent proliferation of digitized data and the unprecedented growth in the volume of stored and transmitted data motivated the definition of the compressed matching paradigm. This is the problem of efficiently finding a pattern P in a compressed text T without the need to decompress. We present
Complexity of twodimensional patterns
, 1999
"... Abstract. To describe quantitatively the complexity of twodimensional patterns we introduce a complexity measure based on a mean information gain. Two types of patterns are studied: geometric ornaments and patterns arising in random sequential adsorption of discs on a plane (RSA). For the geometric ..."
Abstract
 Add to MetaCart
Abstract. To describe quantitatively the complexity of twodimensional patterns we introduce a complexity measure based on a mean information gain. Two types of patterns are studied: geometric ornaments and patterns arising in random sequential adsorption of discs on a plane (RSA
Results 1  10
of
2,886