doc_key stringlengths 8 24 | sentences listlengths 1 1 | tokens listlengths 23 316 | text stringlengths 181 2.06k | entities listlengths 0 50 | gold_relations listlengths 0 31 | coreference_clusters listlengths 0 10 |
|---|---|---|---|---|---|---|
CVPR_2004_18_abs | [
[
"The",
"automated",
"segmentation",
"of",
"images",
"into",
"semantically",
"meaningful",
"parts",
"requires",
"shape",
"information",
"since",
"low-level",
"feature",
"analysis",
"alone",
"often",
"fails",
"to",
"reach",
"thi... | [
"The",
"automated",
"segmentation",
"of",
"images",
"into",
"semantically",
"meaningful",
"parts",
"requires",
"shape",
"information",
"since",
"low-level",
"feature",
"analysis",
"alone",
"often",
"fails",
"to",
"reach",
"this",
"goal.",
"We",
"introduce",
"a",
"... | The automated segmentation of images into semantically meaningful parts requires shape information since low-level feature analysis alone often fails to reach this goal. We introduce a novel method of shape constrained image segmentation which is based on mixtures of feature distributions for color and texture as well ... | [
{
"end": 26,
"id": "T1",
"label": "Task",
"start": 4,
"text": "automated segmentation"
},
{
"end": 36,
"id": "T2",
"label": "Material",
"start": 30,
"text": "images"
},
{
"end": 98,
"id": "T3",
"label": "OtherScientificTerm",
"start": 81,
"text": "... | [
{
"head": "images",
"head_span": [
30,
36
],
"relation": "USED-FOR",
"tail": "automated segmentation",
"tail_span": [
4,
26
]
},
{
"head": "method",
"head_span": [
191,
197
],
"relation": "USED-FOR",
"tail": "shape constrained i... | [
[
"approach",
"method"
]
] |
CVPR_2004_21_abs | [
[
"Uncertainty",
"handling",
"plays",
"an",
"important",
"role",
"during",
"shape",
"tracking.",
"We",
"have",
"recently",
"shown",
"that",
"the",
"fusion",
"of",
"measurement",
"information",
"with",
"system",
"dynamics",
"... | [
"Uncertainty",
"handling",
"plays",
"an",
"important",
"role",
"during",
"shape",
"tracking.",
"We",
"have",
"recently",
"shown",
"that",
"the",
"fusion",
"of",
"measurement",
"information",
"with",
"system",
"dynamics",
"and",
"shape",
"priors",
"greatly",
"impro... | Uncertainty handling plays an important role during shape tracking. We have recently shown that the fusion of measurement information with system dynamics and shape priors greatly improves the tracking performance for very noisy images such as ultrasound sequences [22]. Nevertheless , this approach required user initia... | [
{
"end": 20,
"id": "T1",
"label": "Task",
"start": 0,
"text": "Uncertainty handling"
},
{
"end": 66,
"id": "T2",
"label": "Task",
"start": 52,
"text": "shape tracking"
},
{
"end": 171,
"id": "T3",
"label": "Method",
"start": 100,
"text": "fusion of... | [
{
"head": "Uncertainty handling",
"head_span": [
0,
20
],
"relation": "USED-FOR",
"tail": "shape tracking",
"tail_span": [
52,
66
]
},
{
"head": "ultrasound sequences",
"head_span": [
244,
264
],
"relation": "HYPONYM-OF",
"tail"... | [
[
"shape tracking",
"tracking",
"tracking"
],
[
"automatic initial-ization problem",
"it"
],
[
"tracking framework",
"framework"
],
[
"fusion of measurement information with system dynamics and shape priors",
"approach"
]
] |
CVPR_2004_30_abs | [
[
"Background",
"modeling",
"is",
"an",
"important",
"component",
"of",
"many",
"vision",
"systems.",
"Existing",
"work",
"in",
"the",
"area",
"has",
"mostly",
"addressed",
"scenes",
"that",
"consist",
"of",
"static",
"o... | [
"Background",
"modeling",
"is",
"an",
"important",
"component",
"of",
"many",
"vision",
"systems.",
"Existing",
"work",
"in",
"the",
"area",
"has",
"mostly",
"addressed",
"scenes",
"that",
"consist",
"of",
"static",
"or",
"quasi-static",
"structures.",
"When",
"... | Background modeling is an important component of many vision systems. Existing work in the area has mostly addressed scenes that consist of static or quasi-static structures. When the scene exhibits a persistent dynamic behavior in time, such an assumption is violated and detection performance deteriorates. In this pap... | [
{
"end": 19,
"id": "T1",
"label": "Task",
"start": 0,
"text": "Background modeling"
},
{
"end": 68,
"id": "T2",
"label": "Task",
"start": 54,
"text": "vision systems"
},
{
"end": 173,
"id": "T3",
"label": "OtherScientificTerm",
"start": 140,
"text"... | [
{
"head": "Background modeling",
"head_span": [
0,
19
],
"relation": "PART-OF",
"tail": "vision systems",
"tail_span": [
54,
68
]
},
{
"head": "persistent dynamic behavior",
"head_span": [
201,
228
],
"relation": "FEATURE-OF",
"... | [
[
"scene",
"scenes"
],
[
"approach",
"method"
]
] |
CVPR_2005_10_abs | [
[
"Probabilistic",
"models",
"have",
"been",
"previously",
"shown",
"to",
"be",
"efficient",
"and",
"effective",
"for",
"modeling",
"and",
"recognition",
"of",
"human",
"motion.",
"In",
"particular",
"we",
"focus",
"on",
... | [
"Probabilistic",
"models",
"have",
"been",
"previously",
"shown",
"to",
"be",
"efficient",
"and",
"effective",
"for",
"modeling",
"and",
"recognition",
"of",
"human",
"motion.",
"In",
"particular",
"we",
"focus",
"on",
"methods",
"which",
"represent",
"the",
"hu... | Probabilistic models have been previously shown to be efficient and effective for modeling and recognition of human motion. In particular we focus on methods which represent the human motion model as a triangulated graph. Previous approaches learned models based just on positions and velocities of the body parts while ... | [
{
"end": 20,
"id": "T1",
"label": "Method",
"start": 0,
"text": "Probabilistic models"
},
{
"end": 122,
"id": "T2",
"label": "Task",
"start": 82,
"text": "modeling and recognition of human motion"
},
{
"end": 196,
"id": "T3",
"label": "Method",
"start"... | [
{
"head": "Probabilistic models",
"head_span": [
0,
20
],
"relation": "USED-FOR",
"tail": "modeling and recognition of human motion",
"tail_span": [
82,
122
]
},
{
"head": "triangulated graph",
"head_span": [
202,
220
],
"relation":... | [
[
"models",
"them",
"human motion model"
],
[
"approach",
"approach",
"model",
"model",
"hybrid proba-bilistic model"
]
] |
CVPR_2005_11_abs | [
[
"This",
"work",
"presents",
"a",
"real-time",
"system",
"for",
"multiple",
"object",
"tracking",
"in",
"dynamic",
"scenes.",
"A",
"unique",
"characteristic",
"of",
"the",
"system",
"is",
"its",
"ability",
"to",
"cope",... | [
"This",
"work",
"presents",
"a",
"real-time",
"system",
"for",
"multiple",
"object",
"tracking",
"in",
"dynamic",
"scenes.",
"A",
"unique",
"characteristic",
"of",
"the",
"system",
"is",
"its",
"ability",
"to",
"cope",
"with",
"long-duration",
"and",
"complete",... | This work presents a real-time system for multiple object tracking in dynamic scenes. A unique characteristic of the system is its ability to cope with long-duration and complete occlusion without a prior knowledge about the shape or motion of objects. The system produces good segment and tracking results at a frame ra... | [
{
"end": 37,
"id": "T1",
"label": "Method",
"start": 21,
"text": "real-time system"
},
{
"end": 84,
"id": "T2",
"label": "Task",
"start": 42,
"text": "multiple object tracking in dynamic scenes"
},
{
"end": 123,
"id": "T3",
"label": "Generic",
"start":... | [
{
"head": "real-time system",
"head_span": [
21,
37
],
"relation": "USED-FOR",
"tail": "multiple object tracking in dynamic scenes",
"tail_span": [
42,
84
]
},
{
"head": "system",
"head_span": [
117,
123
],
"relation": "USED-FOR",
... | [
[
"real-time system",
"system",
"system"
]
] |
CVPR_2005_18_abs | [
[
"We",
"study",
"and",
"compare",
"two",
"novel",
"embedding",
"methods",
"for",
"segmenting",
"feature",
"points",
"of",
"piece-wise",
"planar",
"structures",
"from",
"two",
"(uncalibrated)",
"perspective",
"images.",
"We",
... | [
"We",
"study",
"and",
"compare",
"two",
"novel",
"embedding",
"methods",
"for",
"segmenting",
"feature",
"points",
"of",
"piece-wise",
"planar",
"structures",
"from",
"two",
"(uncalibrated)",
"perspective",
"images.",
"We",
"show",
"that",
"a",
"set",
"of",
"dif... | We study and compare two novel embedding methods for segmenting feature points of piece-wise planar structures from two (uncalibrated) perspective images. We show that a set of different homographies can be embedded in different ways to a higher-dimensional real or complex space, so that each homography corresponds to ... | [
{
"end": 48,
"id": "T1",
"label": "Method",
"start": 31,
"text": "embedding methods"
},
{
"end": 110,
"id": "T2",
"label": "Task",
"start": 53,
"text": "segmenting feature points of piece-wise planar structures"
},
{
"end": 199,
"id": "T3",
"label": "Other... | [
{
"head": "embedding methods",
"head_span": [
31,
48
],
"relation": "USED-FOR",
"tail": "segmenting feature points of piece-wise planar structures",
"tail_span": [
53,
110
]
},
{
"head": "subspace-segmentation methods",
"head_span": [
560,
... | [
[
"3-D reconstruction",
"3-D reconstruction"
]
] |
CVPR_2005_21_abs | [
[
"Active",
"shape",
"models",
"are",
"a",
"powerful",
"and",
"widely",
"used",
"tool",
"to",
"interpret",
"complex",
"image",
"data.",
"By",
"building",
"models",
"of",
"shape",
"variation",
"they",
"enable",
"search",
... | [
"Active",
"shape",
"models",
"are",
"a",
"powerful",
"and",
"widely",
"used",
"tool",
"to",
"interpret",
"complex",
"image",
"data.",
"By",
"building",
"models",
"of",
"shape",
"variation",
"they",
"enable",
"search",
"algorithms",
"to",
"use",
"a",
"pri-ori",... | Active shape models are a powerful and widely used tool to interpret complex image data. By building models of shape variation they enable search algorithms to use a pri-ori knowledge in an efficient and gainful way. However, due to the linearity of PCA, non-linearities like rotations or independently moving sub-parts ... | [
{
"end": 19,
"id": "T1",
"label": "Method",
"start": 0,
"text": "Active shape models"
},
{
"end": 87,
"id": "T2",
"label": "Material",
"start": 69,
"text": "complex image data"
},
{
"end": 126,
"id": "T3",
"label": "Method",
"start": 101,
"text": "... | [
{
"head": "Active shape models",
"head_span": [
0,
19
],
"relation": "USED-FOR",
"tail": "complex image data",
"tail_span": [
69,
87
]
},
{
"head": "search algorithms",
"head_span": [
139,
156
],
"relation": "USED-FOR",
"tail": ... | [
[
"Active shape models",
"active shape models"
],
[
"algorithm",
"model",
"method"
]
] |
CVPR_2006_10_abs | [
[
"In",
"this",
"paper",
"we",
"discuss",
"object",
"detection",
"when",
"only",
"a",
"small",
"number",
"of",
"training",
"examples",
"are",
"given.",
"Specifically,",
"we",
"show",
"how",
"to",
"incorporate",
"a",
... | [
"In",
"this",
"paper",
"we",
"discuss",
"object",
"detection",
"when",
"only",
"a",
"small",
"number",
"of",
"training",
"examples",
"are",
"given.",
"Specifically,",
"we",
"show",
"how",
"to",
"incorporate",
"a",
"simple",
"prior",
"on",
"the",
"distribution"... | In this paper we discuss object detection when only a small number of training examples are given. Specifically, we show how to incorporate a simple prior on the distribution of natural images into support vector machines. SVMs are known to be robust to overfitting; however, a few training examples usually do not repre... | [
{
"end": 41,
"id": "T1",
"label": "Task",
"start": 25,
"text": "object detection"
},
{
"end": 192,
"id": "T2",
"label": "OtherScientificTerm",
"start": 149,
"text": "prior on the distribution of natural images"
},
{
"end": 221,
"id": "T3",
"label": "Method... | [
{
"head": "SVMs",
"head_span": [
223,
227
],
"relation": "USED-FOR",
"tail": "overfitting",
"tail_span": [
254,
265
]
},
{
"head": "prior on the distribution of natural images",
"head_span": [
149,
192
],
"relation": "USED-FOR",
... | [
[
"support vector machines",
"SVMs"
],
[
"detector",
"detectors"
]
] |
CVPR_2006_11_abs | [
[
"A",
"recognition",
"scheme",
"that",
"scales",
"efficiently",
"to",
"a",
"large",
"number",
"of",
"objects",
"is",
"presented.",
"The",
"efficiency",
"and",
"quality",
"is",
"exhibited",
"in",
"a",
"live",
"demonstrat... | [
"A",
"recognition",
"scheme",
"that",
"scales",
"efficiently",
"to",
"a",
"large",
"number",
"of",
"objects",
"is",
"presented.",
"The",
"efficiency",
"and",
"quality",
"is",
"exhibited",
"in",
"a",
"live",
"demonstration",
"that",
"recognizes",
"CD-covers",
"fr... | A recognition scheme that scales efficiently to a large number of objects is presented. The efficiency and quality is exhibited in a live demonstration that recognizes CD-covers from a database of 40000 images of popular music CD's. The scheme builds upon popular techniques of indexing descriptors extracted from local ... | [
{
"end": 20,
"id": "T1",
"label": "Method",
"start": 2,
"text": "recognition scheme"
},
{
"end": 102,
"id": "T2",
"label": "Metric",
"start": 92,
"text": "efficiency"
},
{
"end": 114,
"id": "T3",
"label": "Metric",
"start": 107,
"text": "quality"
... | [
{
"head": "efficiency",
"head_span": [
92,
102
],
"relation": "CONJUNCTION",
"tail": "quality",
"tail_span": [
107,
114
]
},
{
"head": "indexing descriptors",
"head_span": [
278,
298
],
"relation": "USED-FOR",
"tail": "scheme",
... | [
[
"recognition scheme",
"scheme"
],
[
"vocabulary tree",
"vocabulary tree"
]
] |
CVPR_2006_18_abs | [
[
"A",
"new",
"exemplar-based",
"framework",
"unifying",
"image",
"completion",
",",
"texture",
"synthesis",
"and",
"image",
"inpainting",
"is",
"presented",
"in",
"this",
"work.",
"Contrary",
"to",
"existing",
"greedy",
"te... | [
"A",
"new",
"exemplar-based",
"framework",
"unifying",
"image",
"completion",
",",
"texture",
"synthesis",
"and",
"image",
"inpainting",
"is",
"presented",
"in",
"this",
"work.",
"Contrary",
"to",
"existing",
"greedy",
"techniques,",
"these",
"tasks",
"are",
"pose... | A new exemplar-based framework unifying image completion , texture synthesis and image inpainting is presented in this work. Contrary to existing greedy techniques, these tasks are posed in the form of a discrete global optimization problem with a well defined objective function. For solving this problem a novel optimi... | [
{
"end": 30,
"id": "T1",
"label": "Method",
"start": 6,
"text": "exemplar-based framework"
},
{
"end": 56,
"id": "T2",
"label": "Task",
"start": 40,
"text": "image completion"
},
{
"end": 76,
"id": "T3",
"label": "Task",
"start": 59,
"text": "textu... | [
{
"head": "image completion",
"head_span": [
40,
56
],
"relation": "CONJUNCTION",
"tail": "texture synthesis",
"tail_span": [
59,
76
]
},
{
"head": "texture synthesis",
"head_span": [
59,
76
],
"relation": "CONJUNCTION",
"tail":... | [
[
"discrete global optimization problem",
"problem"
],
[
"extensions",
"extensions",
"extensions",
"method"
],
[
"belief propagation (BP)",
"BP"
]
] |
CVPR_2006_21_abs | [
[
"The",
"introduction",
"of",
"prior",
"knowledge",
"has",
"greatly",
"enhanced",
"numerous",
"purely",
"low-level",
"driven",
"image",
"processing",
"algorithms.",
"In",
"this",
"work,",
"we",
"focus",
"on",
"the",
"proble... | [
"The",
"introduction",
"of",
"prior",
"knowledge",
"has",
"greatly",
"enhanced",
"numerous",
"purely",
"low-level",
"driven",
"image",
"processing",
"algorithms.",
"In",
"this",
"work,",
"we",
"focus",
"on",
"the",
"problem",
"of",
"non-rigid",
"image",
"registrat... | The introduction of prior knowledge has greatly enhanced numerous purely low-level driven image processing algorithms. In this work, we focus on the problem of non-rigid image registration. A number of powerful registration criteria have been developed in the last decade, most prominently the criterion of maximum mutua... | [
{
"end": 35,
"id": "T1",
"label": "OtherScientificTerm",
"start": 20,
"text": "prior knowledge"
},
{
"end": 117,
"id": "T2",
"label": "Method",
"start": 73,
"text": "low-level driven image processing algorithms"
},
{
"end": 188,
"id": "T3",
"label": "Task"... | [
{
"head": "maximum mutual information",
"head_span": [
307,
333
],
"relation": "HYPONYM-OF",
"tail": "registration criteria",
"tail_span": [
211,
232
]
},
{
"head": "low-level criterion",
"head_span": [
440,
459
],
"relation": "FEAT... | [
[
"maximum mutual information",
"criterion",
"it"
],
[
"non-rigid image registration",
"registration"
],
[
"statistically learned prior knowledge",
"prior"
],
[
"image registration methods",
"registration process",
"it"
]
] |
CVPR_2007_10_abs | [
[
"Traditional",
"linear",
"Fukunaga-Koontz",
"Transform",
"(FKT)",
"[1]",
"is",
"a",
"powerful",
"discriminative",
"subspaces",
"building",
"approach.",
"Previous",
"work",
"has",
"successfully",
"extended",
"FKT",
"to",
"be",
... | [
"Traditional",
"linear",
"Fukunaga-Koontz",
"Transform",
"(FKT)",
"[1]",
"is",
"a",
"powerful",
"discriminative",
"subspaces",
"building",
"approach.",
"Previous",
"work",
"has",
"successfully",
"extended",
"FKT",
"to",
"be",
"able",
"to",
"deal",
"with",
"small-sam... | Traditional linear Fukunaga-Koontz Transform (FKT) [1] is a powerful discriminative subspaces building approach. Previous work has successfully extended FKT to be able to deal with small-sample-size. In this paper, we extend traditional linear FKT to enable it to work in multi-class problem and also in higher dimension... | [
{
"end": 50,
"id": "T1",
"label": "Method",
"start": 12,
"text": "linear Fukunaga-Koontz Transform (FKT)"
},
{
"end": 111,
"id": "T2",
"label": "Method",
"start": 69,
"text": "discriminative subspaces building approach"
},
{
"end": 156,
"id": "T3",
"label"... | [
{
"head": "linear Fukunaga-Koontz Transform (FKT)",
"head_span": [
12,
50
],
"relation": "HYPONYM-OF",
"tail": "discriminative subspaces building approach",
"tail_span": [
69,
111
]
},
{
"head": "FKT",
"head_span": [
153,
156
],
"re... | [
[
"linear Fukunaga-Koontz Transform (FKT)",
"FKT",
"linear FKT"
],
[
"Kernel Fukunaga-Koontz Transform",
"non-linear generalization"
]
] |
CVPR_2007_11_abs | [
[
"This",
"paper",
"proposes",
"a",
"framework",
"in",
"which",
"Lagrangian",
"Particle",
"Dynamics",
"is",
"used",
"for",
"the",
"segmentation",
"of",
"high",
"density",
"crowd",
"flows",
"and",
"detection",
"of",
"flow... | [
"This",
"paper",
"proposes",
"a",
"framework",
"in",
"which",
"Lagrangian",
"Particle",
"Dynamics",
"is",
"used",
"for",
"the",
"segmentation",
"of",
"high",
"density",
"crowd",
"flows",
"and",
"detection",
"of",
"flow",
"instabilities.",
"For",
"this",
"purpose... | This paper proposes a framework in which Lagrangian Particle Dynamics is used for the segmentation of high density crowd flows and detection of flow instabilities. For this purpose, a flow field generated by a moving crowd is treated as an aperiodic dynamical system. A grid of particles is overlaid on the flow field, a... | [
{
"end": 69,
"id": "T1",
"label": "Method",
"start": 41,
"text": "Lagrangian Particle Dynamics"
},
{
"end": 126,
"id": "T2",
"label": "Task",
"start": 86,
"text": "segmentation of high density crowd flows"
},
{
"end": 162,
"id": "T3",
"label": "Task",
... | [
{
"head": "Lagrangian Particle Dynamics",
"head_span": [
41,
69
],
"relation": "USED-FOR",
"tail": "segmentation of high density crowd flows",
"tail_span": [
86,
126
]
},
{
"head": "Lagrangian Particle Dynamics",
"head_span": [
41,
69
]... | [
[
"flow field",
"flow field"
],
[
"Cauchy Green Deformation tensor",
"tensor"
],
[
"Lagrangian Coherent Structures (LCS)",
"LCS"
]
] |
CVPR_2007_18_abs | [
[
"In",
"this",
"paper,",
"we",
"propose",
"a",
"human",
"action",
"recognition",
"system",
"suitable",
"for",
"embedded",
"computer",
"vision",
"applications",
"in",
"security",
"systems,",
"human-computer",
"interaction",
"and... | [
"In",
"this",
"paper,",
"we",
"propose",
"a",
"human",
"action",
"recognition",
"system",
"suitable",
"for",
"embedded",
"computer",
"vision",
"applications",
"in",
"security",
"systems,",
"human-computer",
"interaction",
"and",
"intelligent",
"environments.",
"Our",
... | In this paper, we propose a human action recognition system suitable for embedded computer vision applications in security systems, human-computer interaction and intelligent environments. Our system is suitable for embedded computer vision application based on three reasons. Firstly, the system was based on a linear S... | [
{
"end": 59,
"id": "T1",
"label": "Method",
"start": 28,
"text": "human action recognition system"
},
{
"end": 110,
"id": "T2",
"label": "Task",
"start": 73,
"text": "embedded computer vision applications"
},
{
"end": 130,
"id": "T3",
"label": "Task",
... | [
{
"head": "security systems",
"head_span": [
114,
130
],
"relation": "CONJUNCTION",
"tail": "human-computer interaction",
"tail_span": [
132,
158
]
},
{
"head": "human-computer interaction",
"head_span": [
132,
158
],
"relation": "C... | [
[
"human action recognition system",
"system",
"system",
"system"
],
[
"embedded computer vision applications",
"embedded computer vision application"
],
[
"Hierarchical Motion History Histogram (HMHH) feature",
"HMHH"
],
[
"classification progress",
"SVM classifi... |
CVPR_2007_21_abs | [
[
"This",
"paper",
"describes",
"our",
"work",
"on",
"classification",
"of",
"outdoor",
"scenes.",
"First,",
"images",
"are",
"partitioned",
"into",
"regions",
"using",
"one-class",
"classification",
"and",
"patch-based",
"clust... | [
"This",
"paper",
"describes",
"our",
"work",
"on",
"classification",
"of",
"outdoor",
"scenes.",
"First,",
"images",
"are",
"partitioned",
"into",
"regions",
"using",
"one-class",
"classification",
"and",
"patch-based",
"clustering",
"algorithms",
"where",
"one-class"... | This paper describes our work on classification of outdoor scenes. First, images are partitioned into regions using one-class classification and patch-based clustering algorithms where one-class classifiers model the regions with relatively uniform color and texture properties, and clustering of patches aims to detect ... | [
{
"end": 65,
"id": "T1",
"label": "Task",
"start": 33,
"text": "classification of outdoor scenes"
},
{
"end": 140,
"id": "T2",
"label": "Method",
"start": 116,
"text": "one-class classification"
},
{
"end": 178,
"id": "T3",
"label": "Method",
"start": ... | [
{
"head": "patch-based clustering algorithms",
"head_span": [
145,
178
],
"relation": "CONJUNCTION",
"tail": "one-class classification",
"tail_span": [
116,
140
]
},
{
"head": "uniform color and texture properties",
"head_span": [
241,
277
... | [
[
"region selection algorithm",
"models"
]
] |
CVPR_2008_100_abs | [
[
"Structured-light",
"methods",
"actively",
"generate",
"geometric",
"correspondence",
"data",
"between",
"projectors",
"and",
"cameras",
"in",
"order",
"to",
"facilitate",
"robust",
"3D",
"reconstruction.",
"In",
"this",
"paper,",... | [
"Structured-light",
"methods",
"actively",
"generate",
"geometric",
"correspondence",
"data",
"between",
"projectors",
"and",
"cameras",
"in",
"order",
"to",
"facilitate",
"robust",
"3D",
"reconstruction.",
"In",
"this",
"paper,",
"we",
"present",
"Photogeometric",
"S... | Structured-light methods actively generate geometric correspondence data between projectors and cameras in order to facilitate robust 3D reconstruction. In this paper, we present Photogeometric Structured Light whereby a standard structured light method is extended to include photometric methods. Photometric processing... | [
{
"end": 24,
"id": "T1",
"label": "Method",
"start": 0,
"text": "Structured-light methods"
},
{
"end": 72,
"id": "T2",
"label": "Material",
"start": 43,
"text": "geometric correspondence data"
},
{
"end": 151,
"id": "T3",
"label": "Task",
"start": 127,... | [
{
"head": "geometric correspondence data",
"head_span": [
43,
72
],
"relation": "USED-FOR",
"tail": "robust 3D reconstruction",
"tail_span": [
127,
151
]
},
{
"head": "Structured-light methods",
"head_span": [
0,
24
],
"relation": "... | [
[
"photometric methods",
"Photometric processing"
],
[
"framework",
"Photogeometric Structured Light"
]
] |
CVPR_2008_103_abs | [
[
"In",
"this",
"paper,",
"we",
"propose",
"a",
"partially-blurred-image",
"classification",
"and",
"analysis",
"framework",
"for",
"automatically",
"detecting",
"images",
"containing",
"blurred",
"regions",
"and",
"recognizing",
"t... | [
"In",
"this",
"paper,",
"we",
"propose",
"a",
"partially-blurred-image",
"classification",
"and",
"analysis",
"framework",
"for",
"automatically",
"detecting",
"images",
"containing",
"blurred",
"regions",
"and",
"recognizing",
"the",
"blur",
"types",
"for",
"those",
... | In this paper, we propose a partially-blurred-image classification and analysis framework for automatically detecting images containing blurred regions and recognizing the blur types for those regions without needing to perform blur kernel estimation and image deblurring. We develop several blur features modeled by ima... | [
{
"end": 89,
"id": "T1",
"label": "Method",
"start": 28,
"text": "partially-blurred-image classification and analysis framework"
},
{
"end": 124,
"id": "T2",
"label": "Task",
"start": 94,
"text": "automatically detecting images"
},
{
"end": 124,
"id": "T3",
... | [
{
"head": "partially-blurred-image classification and analysis framework",
"head_span": [
28,
89
],
"relation": "USED-FOR",
"tail": "automatically detecting images",
"tail_span": [
94,
124
]
},
{
"head": "blurred regions",
"head_span": [
136,
... | [
[
"blurred regions",
"regions"
],
[
"partially-blurred-image classification and analysis framework",
"blur detection",
"method"
]
] |
CVPR_2008_256_abs | [
[
"Given",
"an",
"object",
"model",
"and",
"a",
"black-box",
"measure",
"of",
"similarity",
"between",
"the",
"model",
"and",
"candidate",
"targets,",
"we",
"consider",
"visual",
"object",
"tracking",
"as",
"a",
"numeric... | [
"Given",
"an",
"object",
"model",
"and",
"a",
"black-box",
"measure",
"of",
"similarity",
"between",
"the",
"model",
"and",
"candidate",
"targets,",
"we",
"consider",
"visual",
"object",
"tracking",
"as",
"a",
"numerical",
"optimization",
"problem.",
"During",
"... | Given an object model and a black-box measure of similarity between the model and candidate targets, we consider visual object tracking as a numerical optimization problem. During normal tracking conditions when the object is visible from frame to frame, local optimization is used to track the local mode of the similar... | [
{
"end": 21,
"id": "T1",
"label": "Method",
"start": 9,
"text": "object model"
},
{
"end": 59,
"id": "T2",
"label": "Metric",
"start": 28,
"text": "black-box measure of similarity"
},
{
"end": 77,
"id": "T3",
"label": "Generic",
"start": 72,
"text"... | [
{
"head": "numerical optimization problem",
"head_span": [
141,
171
],
"relation": "USED-FOR",
"tail": "visual object tracking",
"tail_span": [
113,
135
]
},
{
"head": "local optimization",
"head_span": [
255,
273
],
"relation": "US... | [
[
"object model",
"model"
],
[
"global optimization problem",
"it"
],
[
"Adaptive Simulated Annealing (ASA)",
"method",
"ASA"
],
[
"numerical hybrid local and global mode-seeking tracker",
"approach"
]
] |
CVPR_2008_257_abs | [
[
"Graphical",
"models",
"such",
"as",
"Bayesian",
"Networks",
"(BNs)",
"are",
"being",
"increasingly",
"applied",
"to",
"various",
"computer",
"vision",
"problems.",
"One",
"bottleneck",
"in",
"using",
"BN",
"is",
"that",
... | [
"Graphical",
"models",
"such",
"as",
"Bayesian",
"Networks",
"(BNs)",
"are",
"being",
"increasingly",
"applied",
"to",
"various",
"computer",
"vision",
"problems.",
"One",
"bottleneck",
"in",
"using",
"BN",
"is",
"that",
"learning",
"the",
"BN",
"model",
"parame... | Graphical models such as Bayesian Networks (BNs) are being increasingly applied to various computer vision problems. One bottleneck in using BN is that learning the BN model parameters often requires a large amount of reliable and representative training data, which proves to be difficult to acquire for many computer v... | [
{
"end": 16,
"id": "T1",
"label": "Method",
"start": 0,
"text": "Graphical models"
},
{
"end": 48,
"id": "T2",
"label": "Method",
"start": 25,
"text": "Bayesian Networks (BNs)"
},
{
"end": 115,
"id": "T3",
"label": "Task",
"start": 91,
"text": "com... | [
{
"head": "Bayesian Networks (BNs)",
"head_span": [
25,
48
],
"relation": "HYPONYM-OF",
"tail": "Graphical models",
"tail_span": [
0,
16
]
},
{
"head": "Graphical models",
"head_span": [
0,
16
],
"relation": "USED-FOR",
"tail": ... | [
[
"Bayesian Networks (BNs)",
"BN model",
"BN",
"model"
],
[
"knowledge",
"qualitative prior",
"them",
"qualitative prior knowledge"
],
[
"computer vision",
"computer vision problems",
"computer vision tasks"
],
[
"closed-form solution",
"method",
"... |
CVPR_2008_258_abs | [
[
"We",
"propose",
"a",
"novel",
"step",
"toward",
"the",
"unsupervised",
"seg-mentation",
"of",
"whole",
"objects",
"by",
"combining",
"\"",
"hints",
"\"",
"of",
"partial",
"scene",
"segmentation",
"offered",
"by",
"mul... | [
"We",
"propose",
"a",
"novel",
"step",
"toward",
"the",
"unsupervised",
"seg-mentation",
"of",
"whole",
"objects",
"by",
"combining",
"\"",
"hints",
"\"",
"of",
"partial",
"scene",
"segmentation",
"offered",
"by",
"multiple",
"soft,",
"binary",
"mattes.",
"These... | We propose a novel step toward the unsupervised seg-mentation of whole objects by combining " hints " of partial scene segmentation offered by multiple soft, binary mattes. These mattes are implied by a set of hypothesized object boundary fragments in the scene. Rather than trying to find or define a single " best " se... | [
{
"end": 78,
"id": "T1",
"label": "Task",
"start": 35,
"text": "unsupervised seg-mentation of whole objects"
},
{
"end": 131,
"id": "T2",
"label": "Task",
"start": 105,
"text": "partial scene segmentation"
},
{
"end": 171,
"id": "T3",
"label": "OtherScient... | [
{
"head": "partial scene segmentation",
"head_span": [
105,
131
],
"relation": "USED-FOR",
"tail": "unsupervised seg-mentation of whole objects",
"tail_span": [
35,
78
]
},
{
"head": "soft, binary mattes",
"head_span": [
152,
171
],
... | [
[
"soft, binary mattes",
"mattes"
],
[
"unsupervised seg-mentation of whole objects",
"unsupervised object discovery",
"unsupervised object discovery"
],
[
"It",
"approach"
]
] |
CVPR_2008_259_abs | [
[
"In",
"this",
"paper,",
"we",
"develop",
"a",
"geometric",
"framework",
"for",
"linear",
"or",
"nonlinear",
"discriminant",
"subspace",
"learning",
"and",
"classification.",
"In",
"our",
"framework,",
"the",
"structures",
... | [
"In",
"this",
"paper,",
"we",
"develop",
"a",
"geometric",
"framework",
"for",
"linear",
"or",
"nonlinear",
"discriminant",
"subspace",
"learning",
"and",
"classification.",
"In",
"our",
"framework,",
"the",
"structures",
"of",
"classes",
"are",
"conceptualized",
... | In this paper, we develop a geometric framework for linear or nonlinear discriminant subspace learning and classification. In our framework, the structures of classes are conceptualized as a semi-Riemannian manifold which is considered as a submanifold embedded in an ambient semi-Riemannian space. The class structures ... | [
{
"end": 47,
"id": "T1",
"label": "Method",
"start": 28,
"text": "geometric framework"
},
{
"end": 121,
"id": "T2",
"label": "Task",
"start": 52,
"text": "linear or nonlinear discriminant subspace learning and classification"
},
{
"end": 139,
"id": "T3",
"... | [
{
"head": "geometric framework",
"head_span": [
28,
47
],
"relation": "USED-FOR",
"tail": "linear or nonlinear discriminant subspace learning and classification",
"tail_span": [
52,
121
]
},
{
"head": "semi-Riemannian manifold",
"head_span": [
19... | [
[
"geometric framework",
"framework",
"framework"
],
[
"Semi-Riemannian metrics",
"local metrics of the semi-Riemannian space"
],
[
"algorithm",
"Semi-Riemannian Discriminant Analysis (SRDA)",
"SRDA",
"SRDA"
]
] |
CVPR_2009_10_abs | [
[
"We",
"propose",
"a",
"novel",
"probabilistic",
"framework",
"for",
"learning",
"visual",
"models",
"of",
"3D",
"object",
"categories",
"by",
"combining",
"appearance",
"information",
"and",
"geometric",
"constraints.",
"Objec... | [
"We",
"propose",
"a",
"novel",
"probabilistic",
"framework",
"for",
"learning",
"visual",
"models",
"of",
"3D",
"object",
"categories",
"by",
"combining",
"appearance",
"information",
"and",
"geometric",
"constraints.",
"Objects",
"are",
"represented",
"as",
"a",
... | We propose a novel probabilistic framework for learning visual models of 3D object categories by combining appearance information and geometric constraints. Objects are represented as a coherent ensemble of parts that are consistent under 3D viewpoint transformations. Each part is a collection of salient image features... | [
{
"end": 42,
"id": "T1",
"label": "Method",
"start": 19,
"text": "probabilistic framework"
},
{
"end": 93,
"id": "T2",
"label": "Task",
"start": 56,
"text": "visual models of 3D object categories"
},
{
"end": 129,
"id": "T3",
"label": "OtherScientificTerm"... | [
{
"head": "probabilistic framework",
"head_span": [
19,
42
],
"relation": "USED-FOR",
"tail": "visual models of 3D object categories",
"tail_span": [
56,
93
]
},
{
"head": "appearance information",
"head_span": [
107,
129
],
"relati... | [
[
"probabilistic framework",
"model",
"approach",
"generative proba-bilistic framework",
"algorithm",
"model"
]
] |
CVPR_2009_11_abs | [
[
"Due",
"to",
"the",
"capacity",
"of",
"pan-tilt-zoom",
"(PTZ)",
"cameras",
"to",
"simultaneously",
"cover",
"a",
"panoramic",
"area",
"and",
"maintain",
"high",
"resolution",
"imagery,",
"researches",
"in",
"automated",
"s... | [
"Due",
"to",
"the",
"capacity",
"of",
"pan-tilt-zoom",
"(PTZ)",
"cameras",
"to",
"simultaneously",
"cover",
"a",
"panoramic",
"area",
"and",
"maintain",
"high",
"resolution",
"imagery,",
"researches",
"in",
"automated",
"surveillance",
"systems",
"with",
"multiple",... | Due to the capacity of pan-tilt-zoom (PTZ) cameras to simultaneously cover a panoramic area and maintain high resolution imagery, researches in automated surveillance systems with multiple PTZ cameras have become increasingly important. Most existing algorithms require the prior knowledge of intrinsic parameters of the... | [
{
"end": 50,
"id": "T1",
"label": "OtherScientificTerm",
"start": 23,
"text": "pan-tilt-zoom (PTZ) cameras"
},
{
"end": 91,
"id": "T2",
"label": "OtherScientificTerm",
"start": 77,
"text": "panoramic area"
},
{
"end": 128,
"id": "T3",
"label": "OtherScient... | [
{
"head": "prior knowledge of intrinsic parameters of the PTZ camera",
"head_span": [
274,
331
],
"relation": "USED-FOR",
"tail": "algorithms",
"tail_span": [
251,
261
]
},
{
"head": "algorithms",
"head_span": [
251,
261
],
"relatio... | [
[
"pixel accuracy",
"pixel accuracy"
],
[
"automated surveillance systems",
"automated surveillance systems"
],
[
"mapping algorithm",
"algorithm"
]
] |
CVPR_2009_18_abs | [
[
"We",
"present",
"a",
"new",
"method",
"for",
"detecting",
"interest",
"points",
"using",
"histogram",
"information.",
"Unlike",
"existing",
"interest",
"point",
"detectors,",
"which",
"measure",
"pixel-wise",
"differences",
"... | [
"We",
"present",
"a",
"new",
"method",
"for",
"detecting",
"interest",
"points",
"using",
"histogram",
"information.",
"Unlike",
"existing",
"interest",
"point",
"detectors,",
"which",
"measure",
"pixel-wise",
"differences",
"in",
"image",
"intensity,",
"our",
"dete... | We present a new method for detecting interest points using histogram information. Unlike existing interest point detectors, which measure pixel-wise differences in image intensity, our detectors incorporate histogram-based representations , and thus can find image regions that present a distinct distribution in the ne... | [
{
"end": 23,
"id": "T1",
"label": "Generic",
"start": 17,
"text": "method"
},
{
"end": 53,
"id": "T2",
"label": "Task",
"start": 28,
"text": "detecting interest points"
},
{
"end": 81,
"id": "T3",
"label": "OtherScientificTerm",
"start": 60,
"text"... | [
{
"head": "histogram information",
"head_span": [
60,
81
],
"relation": "USED-FOR",
"tail": "detecting interest points",
"tail_span": [
28,
53
]
},
{
"head": "method",
"head_span": [
17,
23
],
"relation": "USED-FOR",
"tail": "de... | [
[
"method",
"detectors"
],
[
"histogram-based interest point detectors",
"method",
"interest point detectors",
"detectors"
]
] |
CVPR_2009_21_abs | [
[
"Many",
"computer",
"vision",
"applications,",
"such",
"as",
"image",
"classification",
"and",
"video",
"indexing,",
"are",
"usually",
"multi-label",
"classification",
"problems",
"in",
"which",
"an",
"instance",
"can",
"be",
... | [
"Many",
"computer",
"vision",
"applications,",
"such",
"as",
"image",
"classification",
"and",
"video",
"indexing,",
"are",
"usually",
"multi-label",
"classification",
"problems",
"in",
"which",
"an",
"instance",
"can",
"be",
"assigned",
"to",
"more",
"than",
"one... | Many computer vision applications, such as image classification and video indexing, are usually multi-label classification problems in which an instance can be assigned to more than one category. In this paper, we present a novel multi-label classification approach with hypergraph regu-larization that addresses the cor... | [
{
"end": 33,
"id": "T1",
"label": "Task",
"start": 5,
"text": "computer vision applications"
},
{
"end": 63,
"id": "T2",
"label": "Task",
"start": 43,
"text": "image classification"
},
{
"end": 82,
"id": "T3",
"label": "Task",
"start": 68,
"text": ... | [
{
"head": "image classification",
"head_span": [
43,
63
],
"relation": "CONJUNCTION",
"tail": "video indexing",
"tail_span": [
68,
82
]
},
{
"head": "image classification",
"head_span": [
43,
63
],
"relation": "HYPONYM-OF",
"tai... | [
[
"multi-label classification problems",
"multi-label classification problems"
],
[
"algorithm",
"multi-label classification approach",
"SVM like learning system"
]
] |
CVPR_2010_10_abs | [
[
"We",
"present",
"a",
"new",
"approach",
"for",
"building",
"an",
"efficient",
"and",
"robust",
"classifier",
"for",
"the",
"two",
"class",
"problem,",
"that",
"localizes",
"objects",
"that",
"may",
"appear",
"in",
... | [
"We",
"present",
"a",
"new",
"approach",
"for",
"building",
"an",
"efficient",
"and",
"robust",
"classifier",
"for",
"the",
"two",
"class",
"problem,",
"that",
"localizes",
"objects",
"that",
"may",
"appear",
"in",
"the",
"image",
"under",
"different",
"orien-... | We present a new approach for building an efficient and robust classifier for the two class problem, that localizes objects that may appear in the image under different orien-tations. In contrast to other works that address this problem using multiple classifiers, each one specialized for a specific orientation, we pro... | [
{
"end": 25,
"id": "T1",
"label": "Generic",
"start": 17,
"text": "approach"
},
{
"end": 73,
"id": "T2",
"label": "Method",
"start": 63,
"text": "classifier"
},
{
"end": 99,
"id": "T3",
"label": "Task",
"start": 86,
"text": "class problem"
},
{... | [
{
"head": "approach",
"head_span": [
17,
25
],
"relation": "USED-FOR",
"tail": "classifier",
"tail_span": [
63,
73
]
},
{
"head": "conditions",
"head_span": [
1092,
1102
],
"relation": "FEATURE-OF",
"tail": "database",
"tail... | [
[
"approach",
"algorithm",
"approach",
"approach"
],
[
"estimator",
"estimation stage"
],
[
"classification stage",
"classifier",
"classifier"
],
[
"class problem",
"problem"
]
] |
CVPR_2010_11_abs | [
[
"When",
"classifying",
"high-dimensional",
"sequence",
"data,",
"traditional",
"methods",
"(e.g.,",
"HMMs,",
"CRFs)",
"may",
"require",
"large",
"amounts",
"of",
"training",
"data",
"to",
"avoid",
"overfitting.",
"In",
"such",... | [
"When",
"classifying",
"high-dimensional",
"sequence",
"data,",
"traditional",
"methods",
"(e.g.,",
"HMMs,",
"CRFs)",
"may",
"require",
"large",
"amounts",
"of",
"training",
"data",
"to",
"avoid",
"overfitting.",
"In",
"such",
"cases",
"dimensionality",
"reduction",
... | When classifying high-dimensional sequence data, traditional methods (e.g., HMMs, CRFs) may require large amounts of training data to avoid overfitting. In such cases dimensionality reduction can be employed to find a low-dimensional representation on which classification can be done more efficiently. Existing methods ... | [
{
"end": 47,
"id": "T1",
"label": "Task",
"start": 5,
"text": "classifying high-dimensional sequence data"
},
{
"end": 80,
"id": "T2",
"label": "Method",
"start": 76,
"text": "HMMs"
},
{
"end": 86,
"id": "T3",
"label": "Method",
"start": 82,
"text"... | [
{
"head": "HMMs",
"head_span": [
76,
80
],
"relation": "CONJUNCTION",
"tail": "CRFs",
"tail_span": [
82,
86
]
},
{
"head": "HMMs",
"head_span": [
76,
80
],
"relation": "USED-FOR",
"tail": "classifying high-dimensional sequence d... | [
[
"sequence kernel dimension reduction approach (S-KDR)",
"approach",
"approach"
]
] |
CVPR_2010_18_abs | [
[
"Graph-cuts",
"optimization",
"is",
"prevalent",
"in",
"vision",
"and",
"graphics",
"problems.",
"It",
"is",
"thus",
"of",
"great",
"practical",
"importance",
"to",
"parallelize",
"the",
"graph-cuts",
"optimization",
"using",
... | [
"Graph-cuts",
"optimization",
"is",
"prevalent",
"in",
"vision",
"and",
"graphics",
"problems.",
"It",
"is",
"thus",
"of",
"great",
"practical",
"importance",
"to",
"parallelize",
"the",
"graph-cuts",
"optimization",
"using",
"to-day's",
"ubiquitous",
"multi-core",
... | Graph-cuts optimization is prevalent in vision and graphics problems. It is thus of great practical importance to parallelize the graph-cuts optimization using to-day's ubiquitous multi-core machines. However, the current best serial algorithm by Boykov and Kolmogorov [4] (called the BK algorithm) still has the superio... | [
{
"end": 23,
"id": "T1",
"label": "Method",
"start": 0,
"text": "Graph-cuts optimization"
},
{
"end": 68,
"id": "T2",
"label": "Task",
"start": 40,
"text": "vision and graphics problems"
},
{
"end": 153,
"id": "T3",
"label": "Method",
"start": 130,
... | [
{
"head": "Graph-cuts optimization",
"head_span": [
0,
23
],
"relation": "USED-FOR",
"tail": "vision and graphics problems",
"tail_span": [
40,
68
]
},
{
"head": "BK algorithm",
"head_span": [
285,
297
],
"relation": "HYPONYM-OF",
... | [
[
"Graph-cuts optimization",
"graph-cuts optimization"
],
[
"BK algorithm",
"BK algorithm"
],
[
"regularly-shaped dis-joint subgraphs",
"them",
"subgraphs"
],
[
"algorithm",
"approach",
"adaptive bottom-up approach"
]
] |
CVPR_2010_21_abs | [
[
"Conditional",
"Random",
"Field",
"models",
"have",
"proved",
"effective",
"for",
"several",
"low-level",
"computer",
"vision",
"problems.",
"Inference",
"in",
"these",
"models",
"involves",
"solving",
"a",
"combinatorial",
"o... | [
"Conditional",
"Random",
"Field",
"models",
"have",
"proved",
"effective",
"for",
"several",
"low-level",
"computer",
"vision",
"problems.",
"Inference",
"in",
"these",
"models",
"involves",
"solving",
"a",
"combinatorial",
"optimization",
"problem,",
"with",
"methods... | Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization problem, with methods such as graph cuts, belief propagation. Although several methods have been proposed to learn the model parameters from train... | [
{
"end": 31,
"id": "T1",
"label": "Method",
"start": 0,
"text": "Conditional Random Field models"
},
{
"end": 100,
"id": "T2",
"label": "Task",
"start": 66,
"text": "low-level computer vision problems"
},
{
"end": 111,
"id": "T3",
"label": "Task",
"sta... | [
{
"head": "Inference",
"head_span": [
102,
111
],
"relation": "USED-FOR",
"tail": "models",
"tail_span": [
121,
127
]
},
{
"head": "combinatorial optimization problem",
"head_span": [
147,
181
],
"relation": "PART-OF",
"tail": "... | [
[
"Conditional Random Field models",
"models"
],
[
"parameters",
"model parameters"
],
[
"convex optimization problem",
"combinatorial optimization problem"
],
[
"structured learning methods",
"structured methods"
],
[
"large margin piece-wise learning method",
... |
CVPR_2010_30_abs | [
[
"We",
"introduce",
"a",
"method",
"to",
"accelerate",
"the",
"evaluation",
"of",
"object",
"detection",
"cascades",
"with",
"the",
"help",
"of",
"a",
"divide-and-conquer",
"procedure",
"in",
"the",
"space",
"of",
"cand... | [
"We",
"introduce",
"a",
"method",
"to",
"accelerate",
"the",
"evaluation",
"of",
"object",
"detection",
"cascades",
"with",
"the",
"help",
"of",
"a",
"divide-and-conquer",
"procedure",
"in",
"the",
"space",
"of",
"candidate",
"regions.",
"Compared",
"to",
"the",... | We introduce a method to accelerate the evaluation of object detection cascades with the help of a divide-and-conquer procedure in the space of candidate regions. Compared to the exhaustive procedure that thus far is the state-of-the-art for cascade evaluation, the proposed method requires fewer evaluations of the clas... | [
{
"end": 21,
"id": "T1",
"label": "Generic",
"start": 15,
"text": "method"
},
{
"end": 79,
"id": "T2",
"label": "Task",
"start": 40,
"text": "evaluation of object detection cascades"
},
{
"end": 127,
"id": "T3",
"label": "Method",
"start": 99,
"tex... | [
{
"head": "method",
"head_span": [
15,
21
],
"relation": "USED-FOR",
"tail": "evaluation of object detection cascades",
"tail_span": [
40,
79
]
},
{
"head": "space of candidate regions",
"head_span": [
135,
161
],
"relation": "FEATU... | [
[
"evaluation of object detection cascades",
"cascade evaluation"
],
[
"method",
"method",
"method",
"method",
"method"
]
] |
CVPR_2011_10_abs | [
[
"Reflections",
"in",
"image",
"sequences",
"consist",
"of",
"several",
"layers",
"superimposed",
"over",
"each",
"other.",
"This",
"phenomenon",
"causes",
"many",
"image",
"processing",
"techniques",
"to",
"fail",
"as",
"t... | [
"Reflections",
"in",
"image",
"sequences",
"consist",
"of",
"several",
"layers",
"superimposed",
"over",
"each",
"other.",
"This",
"phenomenon",
"causes",
"many",
"image",
"processing",
"techniques",
"to",
"fail",
"as",
"they",
"assume",
"the",
"presence",
"of",
... | Reflections in image sequences consist of several layers superimposed over each other. This phenomenon causes many image processing techniques to fail as they assume the presence of only one layer at each examined site e.g. motion estimation and object recognition. This work presents an automated technique for detectin... | [
{
"end": 11,
"id": "T1",
"label": "OtherScientificTerm",
"start": 0,
"text": "Reflections"
},
{
"end": 30,
"id": "T2",
"label": "OtherScientificTerm",
"start": 0,
"text": "Reflections in image sequences"
},
{
"end": 30,
"id": "T3",
"label": "Material",
... | [
{
"head": "motion estimation",
"head_span": [
224,
241
],
"relation": "CONJUNCTION",
"tail": "object recognition",
"tail_span": [
246,
264
]
},
{
"head": "motion trajectories",
"head_span": [
366,
385
],
"relation": "USED-FOR",
... | [
[
"It",
"detector",
"technique"
]
] |
CVPR_2011_11_abs | [
[
"We",
"propose",
"a",
"novel",
"approach",
"to",
"associate",
"objects",
"across",
"multiple",
"PTZ",
"cameras",
"that",
"can",
"be",
"used",
"to",
"perform",
"camera",
"handoff",
"in",
"wide-area",
"surveillance",
"sc... | [
"We",
"propose",
"a",
"novel",
"approach",
"to",
"associate",
"objects",
"across",
"multiple",
"PTZ",
"cameras",
"that",
"can",
"be",
"used",
"to",
"perform",
"camera",
"handoff",
"in",
"wide-area",
"surveillance",
"scenarios.",
"While",
"previous",
"approaches",
... | We propose a novel approach to associate objects across multiple PTZ cameras that can be used to perform camera handoff in wide-area surveillance scenarios. While previous approaches relied on geometric, appearance, or correlation-based information for establishing correspondences between static cameras, they each have... | [
{
"end": 27,
"id": "T1",
"label": "Generic",
"start": 19,
"text": "approach"
},
{
"end": 76,
"id": "T2",
"label": "OtherScientificTerm",
"start": 65,
"text": "PTZ cameras"
},
{
"end": 155,
"id": "T3",
"label": "Task",
"start": 105,
"text": "camera ... | [
{
"head": "approach",
"head_span": [
19,
27
],
"relation": "USED-FOR",
"tail": "camera handoff in wide-area surveillance scenarios",
"tail_span": [
105,
155
]
},
{
"head": "geometric, appearance, or correlation-based information",
"head_span": [
... | [
[
"approach",
"approach",
"approach"
],
[
"approaches",
"approaches"
]
] |
CVPR_2011_18_abs | [
[
"We",
"present",
"a",
"method",
"for",
"estimating",
"the",
"relative",
"pose",
"of",
"two",
"calibrated",
"or",
"uncalibrated",
"non-overlapping",
"surveillance",
"cameras",
"from",
"observing",
"a",
"moving",
"object.",
... | [
"We",
"present",
"a",
"method",
"for",
"estimating",
"the",
"relative",
"pose",
"of",
"two",
"calibrated",
"or",
"uncalibrated",
"non-overlapping",
"surveillance",
"cameras",
"from",
"observing",
"a",
"moving",
"object.",
"We",
"show",
"how",
"to",
"tackle",
"th... | We present a method for estimating the relative pose of two calibrated or uncalibrated non-overlapping surveillance cameras from observing a moving object. We show how to tackle the problem of missing point correspondences heavily required by SfM pipelines and how to go beyond this basic paradigm. We relax the non-line... | [
{
"end": 19,
"id": "T1",
"label": "Generic",
"start": 13,
"text": "method"
},
{
"end": 123,
"id": "T2",
"label": "Task",
"start": 39,
"text": "relative pose of two calibrated or uncalibrated non-overlapping surveillance cameras"
},
{
"end": 222,
"id": "T3",
... | [
{
"head": "SfM pipelines",
"head_span": [
243,
256
],
"relation": "USED-FOR",
"tail": "missing point correspondences",
"tail_span": [
193,
222
]
},
{
"head": "non-linear nature",
"head_span": [
312,
329
],
"relation": "FEATURE-OF",
... | [
[
"SfM pipelines",
"paradigm"
],
[
"problem",
"problem",
"missing point correspondences",
"problem"
],
[
"assumptions",
"assumptions"
],
[
"method",
"quasi closed-form solution",
"closed form solution",
"approach"
]
] |
CVPR_2011_292_abs | [
[
"Video",
"provides",
"not",
"only",
"rich",
"visual",
"cues",
"such",
"as",
"motion",
"and",
"appearance,",
"but",
"also",
"much",
"less",
"explored",
"long-range",
"temporal",
"interactions",
"among",
"objects.",
"We",
... | [
"Video",
"provides",
"not",
"only",
"rich",
"visual",
"cues",
"such",
"as",
"motion",
"and",
"appearance,",
"but",
"also",
"much",
"less",
"explored",
"long-range",
"temporal",
"interactions",
"among",
"objects.",
"We",
"aim",
"to",
"capture",
"such",
"interacti... | Video provides not only rich visual cues such as motion and appearance, but also much less explored long-range temporal interactions among objects. We aim to capture such interactions and to construct a powerful intermediate-level video representation for subsequent recognition. Motivated by this goal, we seek to obtai... | [
{
"end": 5,
"id": "T1",
"label": "Material",
"start": 0,
"text": "Video"
},
{
"end": 40,
"id": "T2",
"label": "OtherScientificTerm",
"start": 29,
"text": "visual cues"
},
{
"end": 55,
"id": "T3",
"label": "OtherScientificTerm",
"start": 49,
"text":... | [
{
"head": "motion",
"head_span": [
49,
55
],
"relation": "CONJUNCTION",
"tail": "appearance",
"tail_span": [
60,
70
]
},
{
"head": "intermediate-level video representation",
"head_span": [
212,
251
],
"relation": "USED-FOR",
"ta... | [
[
"long-range temporal interactions",
"interactions"
]
] |
CVPR_2011_293_abs | [
[
"Color",
"is",
"known",
"to",
"be",
"highly",
"discriminative",
"for",
"many",
"object",
"recognition",
"tasks,",
"but",
"is",
"difficult",
"to",
"infer",
"from",
"uncontrolled",
"images",
"in",
"which",
"the",
"illumi... | [
"Color",
"is",
"known",
"to",
"be",
"highly",
"discriminative",
"for",
"many",
"object",
"recognition",
"tasks,",
"but",
"is",
"difficult",
"to",
"infer",
"from",
"uncontrolled",
"images",
"in",
"which",
"the",
"illuminant",
"is",
"not",
"known.",
"Traditional",... | Color is known to be highly discriminative for many object recognition tasks, but is difficult to infer from uncontrolled images in which the illuminant is not known. Traditional methods for color constancy can improve surface re-flectance estimates from such uncalibrated images, but their output depends significantly ... | [
{
"end": 76,
"id": "T1",
"label": "Task",
"start": 52,
"text": "object recognition tasks"
},
{
"end": 128,
"id": "T2",
"label": "Material",
"start": 109,
"text": "uncontrolled images"
},
{
"end": 152,
"id": "T3",
"label": "OtherScientificTerm",
"start"... | [
{
"head": "methods",
"head_span": [
179,
186
],
"relation": "USED-FOR",
"tail": "color constancy",
"tail_span": [
191,
206
]
},
{
"head": "methods",
"head_span": [
179,
186
],
"relation": "USED-FOR",
"tail": "surface re-flectanc... | [
[
"color constancy",
"color constancy"
],
[
"method",
"method"
]
] |
CVPR_2011_300_abs | [
[
"We",
"present",
"an",
"algorithm",
"for",
"calibrated",
"camera",
"relative",
"pose",
"estimation",
"from",
"lines.",
"Given",
"three",
"lines",
"with",
"two",
"of",
"the",
"lines",
"parallel",
"and",
"orthogonal",
"t... | [
"We",
"present",
"an",
"algorithm",
"for",
"calibrated",
"camera",
"relative",
"pose",
"estimation",
"from",
"lines.",
"Given",
"three",
"lines",
"with",
"two",
"of",
"the",
"lines",
"parallel",
"and",
"orthogonal",
"to",
"the",
"third",
"we",
"can",
"compute"... | We present an algorithm for calibrated camera relative pose estimation from lines. Given three lines with two of the lines parallel and orthogonal to the third we can compute the relative rotation between two images. We can also compute the relative translation from two intersection points. We also present a framework ... | [
{
"end": 23,
"id": "T1",
"label": "Generic",
"start": 14,
"text": "algorithm"
},
{
"end": 70,
"id": "T2",
"label": "Task",
"start": 28,
"text": "calibrated camera relative pose estimation"
},
{
"end": 196,
"id": "T3",
"label": "OtherScientificTerm",
"s... | [
{
"head": "algorithm",
"head_span": [
14,
23
],
"relation": "USED-FOR",
"tail": "calibrated camera relative pose estimation",
"tail_span": [
28,
70
]
},
{
"head": "synthetic and real data",
"head_span": [
408,
431
],
"relation": "US... | [
[
"algorithm",
"approach",
"framework",
"algorithm",
"algorithm"
]
] |
CVPR_2011_303_abs | [
[
"The",
"co-occurrence",
"pattern,",
"a",
"combination",
"of",
"binary",
"or",
"local",
"features,",
"is",
"more",
"discriminative",
"than",
"individual",
"features",
"and",
"has",
"shown",
"its",
"advantages",
"in",
"objec... | [
"The",
"co-occurrence",
"pattern,",
"a",
"combination",
"of",
"binary",
"or",
"local",
"features,",
"is",
"more",
"discriminative",
"than",
"individual",
"features",
"and",
"has",
"shown",
"its",
"advantages",
"in",
"object,",
"scene,",
"and",
"action",
"recogniti... | The co-occurrence pattern, a combination of binary or local features, is more discriminative than individual features and has shown its advantages in object, scene, and action recognition. We discuss two types of co-occurrence patterns that are complementary to each other, the conjunction (AND) and disjunction (OR) of ... | [
{
"end": 25,
"id": "T1",
"label": "OtherScientificTerm",
"start": 4,
"text": "co-occurrence pattern"
},
{
"end": 68,
"id": "T2",
"label": "OtherScientificTerm",
"start": 44,
"text": "binary or local features"
},
{
"end": 187,
"id": "T3",
"label": "Task",
... | [
{
"head": "co-occurrence pattern",
"head_span": [
4,
25
],
"relation": "USED-FOR",
"tail": "object, scene, and action recognition",
"tail_span": [
150,
187
]
},
{
"head": "noisy training dataset",
"head_span": [
578,
600
],
"relatio... | [
[
"co-occurrence pattern",
"AND and OR patterns",
"co-occurrence patterns",
"conjunction (AND) and disjunction (OR) of binary features"
],
[
"object, scene, and action cat-egorization",
"object, scene, and action recognition"
],
[
"dis-criminative co-occurrence patterns",
"di... |
CVPR_2012_10_abs | [
[
"Automated",
"facial",
"expression",
"recognition",
"has",
"received",
"increased",
"attention",
"over",
"the",
"past",
"two",
"decades.",
"Existing",
"works",
"in",
"the",
"field",
"usually",
"do",
"not",
"encode",
"eithe... | [
"Automated",
"facial",
"expression",
"recognition",
"has",
"received",
"increased",
"attention",
"over",
"the",
"past",
"two",
"decades.",
"Existing",
"works",
"in",
"the",
"field",
"usually",
"do",
"not",
"encode",
"either",
"the",
"temporal",
"evolution",
"or",
... | Automated facial expression recognition has received increased attention over the past two decades. Existing works in the field usually do not encode either the temporal evolution or the intensity of the observed facial displays. They also fail to jointly model multidimensional (multi-class) continuous facial behaviour... | [
{
"end": 39,
"id": "T1",
"label": "Task",
"start": 0,
"text": "Automated facial expression recognition"
},
{
"end": 114,
"id": "T2",
"label": "Generic",
"start": 100,
"text": "Existing works"
},
{
"end": 179,
"id": "T3",
"label": "OtherScientificTerm",
... | [
{
"head": "intensity of the observed facial displays",
"head_span": [
187,
228
],
"relation": "CONJUNCTION",
"tail": "temporal evolution",
"tail_span": [
161,
179
]
},
{
"head": "ordinal man-ifold",
"head_span": [
511,
528
],
"relat... | [
[
"Existing works",
"They"
],
[
"model",
"the proposed method"
],
[
"topology",
"intrinsic topology of multidimensional continuous facial"
]
] |
CVPR_2012_11_abs | [
[
"We",
"propose",
"a",
"unified",
"variational",
"formulation",
"for",
"joint",
"motion",
"estimation",
"and",
"segmentation",
"with",
"explicit",
"occlusion",
"handling.",
"This",
"is",
"done",
"by",
"a",
"multi-label",
"r... | [
"We",
"propose",
"a",
"unified",
"variational",
"formulation",
"for",
"joint",
"motion",
"estimation",
"and",
"segmentation",
"with",
"explicit",
"occlusion",
"handling.",
"This",
"is",
"done",
"by",
"a",
"multi-label",
"representation",
"of",
"the",
"flow",
"fiel... | We propose a unified variational formulation for joint motion estimation and segmentation with explicit occlusion handling. This is done by a multi-label representation of the flow field, where each label corresponds to a parametric representation of the motion. We use a convex formulation of the multi-label Potts mode... | [
{
"end": 44,
"id": "T1",
"label": "Method",
"start": 13,
"text": "unified variational formulation"
},
{
"end": 89,
"id": "T2",
"label": "Task",
"start": 49,
"text": "joint motion estimation and segmentation"
},
{
"end": 122,
"id": "T3",
"label": "Method",
... | [
{
"head": "unified variational formulation",
"head_span": [
13,
44
],
"relation": "USED-FOR",
"tail": "joint motion estimation and segmentation",
"tail_span": [
49,
89
]
},
{
"head": "explicit occlusion handling",
"head_span": [
95,
122
... | [
[
"convex formulation",
"formulation"
],
[
"Explicit occlusion handling",
"explicit occlusion handling"
]
] |
CVPR_2012_18_abs | [
[
"We",
"propose",
"a",
"novel",
"technique",
"called",
"bispectral",
"photo-metric",
"stereo",
"that",
"makes",
"effective",
"use",
"of",
"fluorescence",
"for",
"shape",
"reconstruction.",
"Fluorescence",
"is",
"a",
"common",
... | [
"We",
"propose",
"a",
"novel",
"technique",
"called",
"bispectral",
"photo-metric",
"stereo",
"that",
"makes",
"effective",
"use",
"of",
"fluorescence",
"for",
"shape",
"reconstruction.",
"Fluorescence",
"is",
"a",
"common",
"phenomenon",
"occurring",
"in",
"many",
... | We propose a novel technique called bispectral photo-metric stereo that makes effective use of fluorescence for shape reconstruction. Fluorescence is a common phenomenon occurring in many objects from natural gems and corals, to fluorescent dyes used in clothing. One of the important characteristics of fluorescence is ... | [
{
"end": 28,
"id": "T1",
"label": "Generic",
"start": 19,
"text": "technique"
},
{
"end": 66,
"id": "T2",
"label": "Method",
"start": 36,
"text": "bispectral photo-metric stereo"
},
{
"end": 107,
"id": "T3",
"label": "OtherScientificTerm",
"start": 95,... | [
{
"head": "fluorescence",
"head_span": [
95,
107
],
"relation": "USED-FOR",
"tail": "bispectral photo-metric stereo",
"tail_span": [
36,
66
]
},
{
"head": "bispectral photo-metric stereo",
"head_span": [
36,
66
],
"relation": "USED-... | [
[
"technique",
"bispectral photo-metric stereo",
"photomet-ric stereo"
]
] |
CVPR_2013_10_abs | [
[
"We",
"present",
"a",
"novel",
"algorithm",
"for",
"estimating",
"the",
"broad",
"3D",
"geometric",
"structure",
"of",
"outdoor",
"video",
"scenes.",
"Leveraging",
"spatio-temporal",
"video",
"segmentation,",
"we",
"decompose"... | [
"We",
"present",
"a",
"novel",
"algorithm",
"for",
"estimating",
"the",
"broad",
"3D",
"geometric",
"structure",
"of",
"outdoor",
"video",
"scenes.",
"Leveraging",
"spatio-temporal",
"video",
"segmentation,",
"we",
"decompose",
"a",
"dynamic",
"scene",
"captured",
... | We present a novel algorithm for estimating the broad 3D geometric structure of outdoor video scenes. Leveraging spatio-temporal video segmentation, we decompose a dynamic scene captured by a video into geometric classes, based on predictions made by region-classifiers that are trained on appearance and motion features... | [
{
"end": 28,
"id": "T1",
"label": "Generic",
"start": 19,
"text": "algorithm"
},
{
"end": 100,
"id": "T2",
"label": "Task",
"start": 54,
"text": "3D geometric structure of outdoor video scenes"
},
{
"end": 147,
"id": "T3",
"label": "Method",
"start": 1... | [
{
"head": "algorithm",
"head_span": [
19,
28
],
"relation": "USED-FOR",
"tail": "3D geometric structure of outdoor video scenes",
"tail_span": [
54,
100
]
},
{
"head": "region-classifiers",
"head_span": [
251,
269
],
"relation": "US... | [
[
"algorithm",
"method",
"system"
],
[
"dataset",
"dataset"
]
] |
CVPR_2014_10_abs | [
[
"We",
"present",
"an",
"image",
"set",
"classification",
"algorithm",
"based",
"on",
"unsupervised",
"clustering",
"of",
"labeled",
"training",
"and",
"unla-beled",
"test",
"data",
"where",
"labels",
"are",
"only",
"used",... | [
"We",
"present",
"an",
"image",
"set",
"classification",
"algorithm",
"based",
"on",
"unsupervised",
"clustering",
"of",
"labeled",
"training",
"and",
"unla-beled",
"test",
"data",
"where",
"labels",
"are",
"only",
"used",
"in",
"the",
"stopping",
"criterion.",
... | We present an image set classification algorithm based on unsupervised clustering of labeled training and unla-beled test data where labels are only used in the stopping criterion. The probability distribution of each class over the set of clusters is used to define a true set based similarity measure. To this end, we ... | [
{
"end": 48,
"id": "T1",
"label": "Method",
"start": 14,
"text": "image set classification algorithm"
},
{
"end": 81,
"id": "T2",
"label": "Method",
"start": 58,
"text": "unsupervised clustering"
},
{
"end": 126,
"id": "T3",
"label": "Material",
"start... | [
{
"head": "probability distribution",
"head_span": [
185,
209
],
"relation": "USED-FOR",
"tail": "set based similarity measure",
"tail_span": [
274,
302
]
},
{
"head": "proximity matrix",
"head_span": [
400,
416
],
"relation": "USED... | [
[
"image set classification algorithm",
"algorithm"
],
[
"spectral clustering algorithm",
"iterative sparse spectral clustering algorithm"
]
] |
CVPR_2014_11_abs | [
[
"In",
"this",
"paper,",
"we",
"cast",
"the",
"problem",
"of",
"point",
"cloud",
"matching",
"as",
"a",
"shape",
"matching",
"problem",
"by",
"transforming",
"each",
"of",
"the",
"given",
"point",
"clouds",
"into",
... | [
"In",
"this",
"paper,",
"we",
"cast",
"the",
"problem",
"of",
"point",
"cloud",
"matching",
"as",
"a",
"shape",
"matching",
"problem",
"by",
"transforming",
"each",
"of",
"the",
"given",
"point",
"clouds",
"into",
"a",
"shape",
"representation",
"called",
"t... | In this paper, we cast the problem of point cloud matching as a shape matching problem by transforming each of the given point clouds into a shape representation called the Schrödinger distance transform (SDT) representation. This is achieved by solving a static Schrödinger equation instead of the corresponding static ... | [
{
"end": 58,
"id": "T1",
"label": "Task",
"start": 38,
"text": "point cloud matching"
},
{
"end": 86,
"id": "T2",
"label": "Task",
"start": 64,
"text": "shape matching problem"
},
{
"end": 133,
"id": "T3",
"label": "OtherScientificTerm",
"start": 121,
... | [
{
"head": "shape matching problem",
"head_span": [
64,
86
],
"relation": "USED-FOR",
"tail": "point cloud matching",
"tail_span": [
38,
58
]
},
{
"head": "Schrödinger distance transform (SDT) representation",
"head_span": [
173,
224
],
... | [
[
"it",
"Schrödinger distance transform (SDT) representation",
"SDT representation"
],
[
"unit Hilbert sphere",
"sphere"
],
[
"point cloud matching",
"point cloud matching"
],
[
"Riemannian framework",
"framework"
],
[
"rigid and non-rigid transformations",
... |
CVPR_2014_18_abs | [
[
"We",
"address",
"the",
"problem",
"of",
"populating",
"object",
"category",
"detection",
"datasets",
"with",
"dense,",
"per-object",
"3D",
"reconstructions",
",",
"bootstrapped",
"from",
"class",
"labels,",
"ground",
"truth",... | [
"We",
"address",
"the",
"problem",
"of",
"populating",
"object",
"category",
"detection",
"datasets",
"with",
"dense,",
"per-object",
"3D",
"reconstructions",
",",
"bootstrapped",
"from",
"class",
"labels,",
"ground",
"truth",
"figure-ground",
"segmentations",
"and",
... | We address the problem of populating object category detection datasets with dense, per-object 3D reconstructions , bootstrapped from class labels, ground truth figure-ground segmentations and a small set of keypoint annotations. Our proposed algorithm first estimates camera viewpoint using rigid structure-from-motion,... | [
{
"end": 71,
"id": "T1",
"label": "Material",
"start": 37,
"text": "object category detection datasets"
},
{
"end": 113,
"id": "T2",
"label": "Task",
"start": 84,
"text": "per-object 3D reconstructions"
},
{
"end": 188,
"id": "T3",
"label": "Method",
"... | [
{
"head": "algorithm",
"head_span": [
243,
252
],
"relation": "USED-FOR",
"tail": "camera viewpoint",
"tail_span": [
269,
285
]
},
{
"head": "rigid structure-from-motion",
"head_span": [
292,
319
],
"relation": "USED-FOR",
"tail... | [
[
"method",
"algorithm"
],
[
"per-object 3D reconstructions",
"per-object 3D reconstructions"
],
[
"object category detection datasets",
"object-category detection datasets"
],
[
"visual hull sampling process",
"visual hull proposals"
]
] |
CVPR_2014_21_abs | [
[
"In",
"this",
"paper",
"we",
"present",
"a",
"novel",
"autonomous",
"pipeline",
"to",
"build",
"a",
"personalized",
"parametric",
"model",
"(pose-driven",
"avatar)",
"using",
"a",
"single",
"depth",
"sensor.",
"Our",
"... | [
"In",
"this",
"paper",
"we",
"present",
"a",
"novel",
"autonomous",
"pipeline",
"to",
"build",
"a",
"personalized",
"parametric",
"model",
"(pose-driven",
"avatar)",
"using",
"a",
"single",
"depth",
"sensor.",
"Our",
"method",
"first",
"captures",
"a",
"few",
... | In this paper we present a novel autonomous pipeline to build a personalized parametric model (pose-driven avatar) using a single depth sensor. Our method first captures a few high-quality scans of the user rotating herself at multiple poses from different views. We fit each incomplete scan using template fitting techn... | [
{
"end": 52,
"id": "T1",
"label": "Generic",
"start": 33,
"text": "autonomous pipeline"
},
{
"end": 114,
"id": "T2",
"label": "Method",
"start": 64,
"text": "personalized parametric model (pose-driven avatar)"
},
{
"end": 142,
"id": "T3",
"label": "OtherSc... | [
{
"head": "autonomous pipeline",
"head_span": [
33,
52
],
"relation": "USED-FOR",
"tail": "personalized parametric model (pose-driven avatar)",
"tail_span": [
64,
114
]
},
{
"head": "single depth sensor",
"head_span": [
123,
142
],
... | [
[
"autonomous pipeline",
"system",
"method"
],
[
"parametric model",
"it",
"parametric model"
]
] |
CVPR_2015_300_abs | [
[
"We",
"address",
"the",
"problem",
"of",
"estimating",
"location",
"information",
"of",
"an",
"image",
"using",
"principles",
"from",
"automated",
"representation",
"learning.",
"We",
"pursue",
"a",
"hierarchical",
"sparse",
... | [
"We",
"address",
"the",
"problem",
"of",
"estimating",
"location",
"information",
"of",
"an",
"image",
"using",
"principles",
"from",
"automated",
"representation",
"learning.",
"We",
"pursue",
"a",
"hierarchical",
"sparse",
"coding",
"approach",
"that",
"learns",
... | We address the problem of estimating location information of an image using principles from automated representation learning. We pursue a hierarchical sparse coding approach that learns features useful in discriminating images across locations, by initializing it with a geometric prior corresponding to transformations... | [
{
"end": 57,
"id": "T1",
"label": "Task",
"start": 26,
"text": "estimating location information"
},
{
"end": 69,
"id": "T2",
"label": "Material",
"start": 64,
"text": "image"
},
{
"end": 125,
"id": "T3",
"label": "Method",
"start": 92,
"text": "aut... | [
{
"head": "image",
"head_span": [
64,
69
],
"relation": "USED-FOR",
"tail": "estimating location information",
"tail_span": [
26,
57
]
},
{
"head": "automated representation learning",
"head_span": [
92,
125
],
"relation": "USED-FOR... | [
[
"approach",
"approach",
"hierarchical sparse coding approach",
"it"
]
] |
CVPR_2015_303_abs | [
[
"In",
"this",
"paper",
"we",
"target",
"at",
"generating",
"generic",
"action",
"proposals",
"in",
"unconstrained",
"videos.",
"Each",
"action",
"proposal",
"corresponds",
"to",
"a",
"temporal",
"series",
"of",
"spatial",
... | [
"In",
"this",
"paper",
"we",
"target",
"at",
"generating",
"generic",
"action",
"proposals",
"in",
"unconstrained",
"videos.",
"Each",
"action",
"proposal",
"corresponds",
"to",
"a",
"temporal",
"series",
"of",
"spatial",
"bounding",
"boxes,",
"i.e.,",
"a",
"spa... | In this paper we target at generating generic action proposals in unconstrained videos. Each action proposal corresponds to a temporal series of spatial bounding boxes, i.e., a spatio-temporal video tube, which has a good potential to locate one human action. Assuming each action is performed by a human with meaningful... | [
{
"end": 62,
"id": "T1",
"label": "OtherScientificTerm",
"start": 38,
"text": "generic action proposals"
},
{
"end": 86,
"id": "T2",
"label": "Material",
"start": 66,
"text": "unconstrained videos"
},
{
"end": 108,
"id": "T3",
"label": "OtherScientificTerm... | [
{
"head": "spatio-temporal video tube",
"head_span": [
177,
203
],
"relation": "HYPONYM-OF",
"tail": "temporal series of spatial bounding boxes",
"tail_span": [
126,
167
]
},
{
"head": "spatio-temporal video tube",
"head_span": [
177,
203
... | [
[
"action proposals",
"action proposals"
]
] |
CVPR_2016_15_abs | [
[
"This",
"paper",
"proposes",
"a",
"method",
"for",
"learning",
"joint",
"embed-dings",
"of",
"images",
"and",
"text",
"using",
"a",
"two-branch",
"neural",
"network",
"with",
"multiple",
"layers",
"of",
"linear",
"proj... | [
"This",
"paper",
"proposes",
"a",
"method",
"for",
"learning",
"joint",
"embed-dings",
"of",
"images",
"and",
"text",
"using",
"a",
"two-branch",
"neural",
"network",
"with",
"multiple",
"layers",
"of",
"linear",
"projections",
"followed",
"by",
"nonlinearities.",... | This paper proposes a method for learning joint embed-dings of images and text using a two-branch neural network with multiple layers of linear projections followed by nonlinearities. The network is trained using a large-margin objective that combines cross-view ranking constraints with within-view neighborhood structu... | [
{
"end": 28,
"id": "T1",
"label": "Generic",
"start": 22,
"text": "method"
},
{
"end": 78,
"id": "T2",
"label": "OtherScientificTerm",
"start": 42,
"text": "joint embed-dings of images and text"
},
{
"end": 112,
"id": "T3",
"label": "Method",
"start": ... | [
{
"head": "method",
"head_span": [
22,
28
],
"relation": "USED-FOR",
"tail": "joint embed-dings of images and text",
"tail_span": [
42,
78
]
},
{
"head": "two-branch neural network",
"head_span": [
87,
112
],
"relation": "USED-FOR",... | [
[
"two-branch neural network",
"network"
],
[
"method",
"approach",
"method"
]
] |
CVPR_2016_405_abs | [
[
"With",
"the",
"recent",
"popularity",
"of",
"animated",
"GIFs",
"on",
"social",
"media,",
"there",
"is",
"need",
"for",
"ways",
"to",
"index",
"them",
"with",
"rich",
"meta-data.",
"To",
"advance",
"research",
"on... | [
"With",
"the",
"recent",
"popularity",
"of",
"animated",
"GIFs",
"on",
"social",
"media,",
"there",
"is",
"need",
"for",
"ways",
"to",
"index",
"them",
"with",
"rich",
"meta-data.",
"To",
"advance",
"research",
"on",
"animated",
"GIF",
"understanding,",
"we",
... | With the recent popularity of animated GIFs on social media, there is need for ways to index them with rich meta-data. To advance research on animated GIF understanding, we collected a new dataset, Tumblr GIF (TGIF), with 100K animated GIFs from Tumblr and 120K natural language descriptions obtained via crowdsourcing. ... | [
{
"end": 43,
"id": "T1",
"label": "Material",
"start": 30,
"text": "animated GIFs"
},
{
"end": 59,
"id": "T2",
"label": "Material",
"start": 47,
"text": "social media"
},
{
"end": 117,
"id": "T3",
"label": "Material",
"start": 103,
"text": "rich me... | [
{
"head": "natural language descriptions",
"head_span": [
443,
472
],
"relation": "USED-FOR",
"tail": "animated GIFs",
"tail_span": [
477,
490
]
},
{
"head": "natural language descriptions",
"head_span": [
443,
472
],
"relation": "U... | [
[
"dataset",
"it",
"dataset",
"animated GIF description dataset",
"dataset",
"Tumblr GIF (TGIF)"
]
] |
CVPR_2016_406_abs | [
[
"Image",
"matching",
"is",
"a",
"fundamental",
"problem",
"in",
"Computer",
"Vision.",
"In",
"the",
"context",
"of",
"feature-based",
"matching,",
"SIFT",
"and",
"its",
"variants",
"have",
"long",
"excelled",
"in",
"a"... | [
"Image",
"matching",
"is",
"a",
"fundamental",
"problem",
"in",
"Computer",
"Vision.",
"In",
"the",
"context",
"of",
"feature-based",
"matching,",
"SIFT",
"and",
"its",
"variants",
"have",
"long",
"excelled",
"in",
"a",
"wide",
"array",
"of",
"applications.",
... | Image matching is a fundamental problem in Computer Vision. In the context of feature-based matching, SIFT and its variants have long excelled in a wide array of applications. However, for ultra-wide baselines, as in the case of aerial images captured under large camera rotations, the appearance variation goes beyond t... | [
{
"end": 14,
"id": "T1",
"label": "Task",
"start": 0,
"text": "Image matching"
},
{
"end": 58,
"id": "T2",
"label": "Task",
"start": 43,
"text": "Computer Vision"
},
{
"end": 100,
"id": "T3",
"label": "Task",
"start": 78,
"text": "feature-based mat... | [
{
"head": "Image matching",
"head_span": [
0,
14
],
"relation": "HYPONYM-OF",
"tail": "Computer Vision",
"tail_span": [
43,
58
]
},
{
"head": "dataset of urban aerial imagery",
"head_span": [
739,
770
],
"relation": "USED-FOR",
... | [
[
"models",
"models"
],
[
"SIFT",
"SIFT"
]
] |
CVPR_2016_413_abs | [
[
"Learned",
"confidence",
"measures",
"gain",
"increasing",
"importance",
"for",
"outlier",
"removal",
"and",
"quality",
"improvement",
"in",
"stereo",
"vision.",
"However,",
"acquiring",
"the",
"necessary",
"training",
"data",
... | [
"Learned",
"confidence",
"measures",
"gain",
"increasing",
"importance",
"for",
"outlier",
"removal",
"and",
"quality",
"improvement",
"in",
"stereo",
"vision.",
"However,",
"acquiring",
"the",
"necessary",
"training",
"data",
"is",
"typically",
"a",
"tedious",
"and... | Learned confidence measures gain increasing importance for outlier removal and quality improvement in stereo vision. However, acquiring the necessary training data is typically a tedious and time consuming task that involves manual interaction, active sensing devices and/or synthetic scenes. To overcome this problem, w... | [
{
"end": 27,
"id": "T1",
"label": "Method",
"start": 0,
"text": "Learned confidence measures"
},
{
"end": 74,
"id": "T2",
"label": "Task",
"start": 59,
"text": "outlier removal"
},
{
"end": 98,
"id": "T3",
"label": "Task",
"start": 79,
"text": "qua... | [
{
"head": "quality improvement",
"head_span": [
79,
98
],
"relation": "PART-OF",
"tail": "stereo vision",
"tail_span": [
102,
115
]
},
{
"head": "outlier removal",
"head_span": [
59,
74
],
"relation": "PART-OF",
"tail": "stereo ... | [
[
"task",
"problem"
],
[
"approach",
"stereo algorithm",
"approach"
],
[
"Learned confidence measures",
"learned confidence measures",
"them"
]
] |
CVPR_2016_416_abs | [
[
"We",
"investigate",
"the",
"problem",
"of",
"fine-grained",
"sketch-based",
"image",
"retrieval",
"(SBIR),",
"where",
"free-hand",
"human",
"sketches",
"are",
"used",
"as",
"queries",
"to",
"perform",
"instance-level",
"retri... | [
"We",
"investigate",
"the",
"problem",
"of",
"fine-grained",
"sketch-based",
"image",
"retrieval",
"(SBIR),",
"where",
"free-hand",
"human",
"sketches",
"are",
"used",
"as",
"queries",
"to",
"perform",
"instance-level",
"retrieval",
"of",
"images.",
"This",
"is",
... | We investigate the problem of fine-grained sketch-based image retrieval (SBIR), where free-hand human sketches are used as queries to perform instance-level retrieval of images. This is an extremely challenging task because (i) visual comparisons not only need to be fine-grained but also executed cross-domain, (ii) fre... | [
{
"end": 78,
"id": "T1",
"label": "Task",
"start": 30,
"text": "fine-grained sketch-based image retrieval (SBIR)"
},
{
"end": 110,
"id": "T2",
"label": "OtherScientificTerm",
"start": 86,
"text": "free-hand human sketches"
},
{
"end": 176,
"id": "T3",
"lab... | [
{
"head": "free-hand human sketches",
"head_span": [
86,
110
],
"relation": "USED-FOR",
"tail": "instance-level retrieval of images",
"tail_span": [
142,
176
]
},
{
"head": "annotated cross-domain sketch-photo datasets",
"head_span": [
430,
... | [] |
E06-1004 | [
[
"In",
"this",
"paper",
"we",
"study",
"a",
"set",
"of",
"problems",
"that",
"are",
"of",
"considerable",
"importance",
"to",
"Statistical",
"Machine",
"Translation",
"(SMT)",
"but",
"which",
"have",
"not",
"been",
... | [
"In",
"this",
"paper",
"we",
"study",
"a",
"set",
"of",
"problems",
"that",
"are",
"of",
"considerable",
"importance",
"to",
"Statistical",
"Machine",
"Translation",
"(SMT)",
"but",
"which",
"have",
"not",
"been",
"addressed",
"satisfactorily",
"by",
"the",
"S... |
In this paper we study a set of problems that are of considerable importance to Statistical Machine Translation (SMT) but which have not been addressed satisfactorily by the SMT research community . Over the last decade, a variety of SMT algorithms have been built and empirically tested whereas little is known... | [
{
"end": 121,
"id": "T1",
"label": "Task",
"start": 84,
"text": "Statistical Machine Translation (SMT)"
},
{
"end": 256,
"id": "T2",
"label": "Method",
"start": 242,
"text": "SMT algorithms"
},
{
"end": 356,
"id": "T3",
"label": "Metric",
"start": 332,... | [
{
"head": "polynomial time solution",
"head_span": [
705,
729
],
"relation": "USED-FOR",
"tail": "hard problems",
"tail_span": [
749,
762
]
},
{
"head": "computational complexity",
"head_span": [
462,
486
],
"relation": "EVALUATE-FO... | [
[
"hard problems",
"problems",
"problems"
],
[
"Statistical Machine Translation (SMT)",
"SMT"
],
[
"computations",
"computations"
]
] |
E06-1018 | [
[
"In",
"this",
"paper",
"a",
"novel",
"solution",
"to",
"automatic",
"and",
"unsupervised",
"word",
"sense",
"induction",
"(WSI)",
"is",
"introduced.",
"It",
"represents",
"an",
"instantiation",
"of",
"the",
"one",
"sen... | [
"In",
"this",
"paper",
"a",
"novel",
"solution",
"to",
"automatic",
"and",
"unsupervised",
"word",
"sense",
"induction",
"(WSI)",
"is",
"introduced.",
"It",
"represents",
"an",
"instantiation",
"of",
"the",
"one",
"sense",
"per",
"collocation",
"observation",
"(... | In this paper a novel solution to automatic and unsupervised word sense induction (WSI) is introduced. It represents an instantiation of the one sense per collocation observation (Gale et al., 1992). Like most existing approaches it utilizes clustering of word co-occurrences . This approach differs from other ap... | [
{
"end": 31,
"id": "T1",
"label": "Generic",
"start": 23,
"text": "solution"
},
{
"end": 89,
"id": "T2",
"label": "Task",
"start": 35,
"text": "automatic and unsupervised word sense induction (WSI)"
},
{
"end": 108,
"id": "T3",
"label": "Generic",
"st... | [
{
"head": "sentence co-occurrences",
"head_span": [
523,
546
],
"relation": "USED-FOR",
"tail": "two-step clustering process",
"tail_span": [
487,
514
]
},
{
"head": "clustering of word co-occurrences",
"head_span": [
248,
281
],
"r... | [
[
"solution",
"it",
"It",
"it",
"approach"
],
[
"one sense per collocation observation",
"one sense per collocation observation"
],
[
"automatic and unsupervised word sense induction (WSI)",
"WSI"
],
[
"word sense disambiguation algorithms",
"WSI algorithm"
... |
E06-1022 | [
[
"We",
"present",
"results",
"on",
"addressee",
"identification",
"in",
"four-participants",
"face-to-face",
"meetings",
"using",
"Bayesian",
"Network",
"and",
"Naive",
"Bayes",
"classifiers",
".",
"First,",
"we",
"investigate",
... | [
"We",
"present",
"results",
"on",
"addressee",
"identification",
"in",
"four-participants",
"face-to-face",
"meetings",
"using",
"Bayesian",
"Network",
"and",
"Naive",
"Bayes",
"classifiers",
".",
"First,",
"we",
"investigate",
"how",
"well",
"the",
"addressee",
"of... | We present results on addressee identification in four-participants face-to-face meetings using Bayesian Network and Naive Bayes classifiers . First, we investigate how well the addressee of a dialogue act can be predicted based on gaze , utterance and conversational context features . Then, we explo... | [
{
"end": 93,
"id": "T1",
"label": "Task",
"start": 24,
"text": "addressee identification in four-participants face-to-face meetings"
},
{
"end": 118,
"id": "T2",
"label": "Method",
"start": 102,
"text": "Bayesian Network"
},
{
"end": 148,
"id": "T3",
"la... | [
{
"head": "Naive Bayes classifiers",
"head_span": [
125,
148
],
"relation": "CONJUNCTION",
"tail": "Bayesian Network",
"tail_span": [
102,
118
]
},
{
"head": "gaze",
"head_span": [
246,
250
],
"relation": "CONJUNCTION",
"tail": ... | [
[
"classifiers",
"classifiers",
"classifiers"
]
] |
E06-1031 | [
[
"Most",
"state-of-the-art",
"evaluation",
"measures",
"for",
"machine",
"translation",
"assign",
"high",
"costs",
"to",
"movements",
"of",
"word",
"blocks.",
"In",
"many",
"cases",
"though",
"such",
"movements",
"still",
"... | [
"Most",
"state-of-the-art",
"evaluation",
"measures",
"for",
"machine",
"translation",
"assign",
"high",
"costs",
"to",
"movements",
"of",
"word",
"blocks.",
"In",
"many",
"cases",
"though",
"such",
"movements",
"still",
"result",
"in",
"correct",
"or",
"almost",
... | Most state-of-the-art evaluation measures for machine translation assign high costs to movements of word blocks. In many cases though such movements still result in correct or almost correct sentences . In this paper, we will present a new evaluation measure which explicitly models block reordering as an... | [
{
"end": 43,
"id": "T1",
"label": "Metric",
"start": 24,
"text": "evaluation measures"
},
{
"end": 69,
"id": "T2",
"label": "Task",
"start": 50,
"text": "machine translation"
},
{
"end": 270,
"id": "T3",
"label": "Metric",
"start": 252,
"text": "ev... | [
{
"head": "evaluation measures",
"head_span": [
24,
43
],
"relation": "EVALUATE-FOR",
"tail": "machine translation",
"tail_span": [
50,
69
]
},
{
"head": "evaluation measure",
"head_span": [
252,
270
],
"relation": "USED-FOR",
"... | [
[
"measure",
"it",
"automatic evaluation measures",
"evaluation measure",
"measure",
"evaluation measures"
]
] |
E06-1035 | [
[
"In",
"this",
"paper,",
"we",
"investigate",
"the",
"problem",
"of",
"automatically",
"predicting",
"segment",
"boundaries",
"in",
"spoken",
"multiparty",
"dialogue",
".",
"We",
"extend",
"prior",
"work",
"in",
"two",
... | [
"In",
"this",
"paper,",
"we",
"investigate",
"the",
"problem",
"of",
"automatically",
"predicting",
"segment",
"boundaries",
"in",
"spoken",
"multiparty",
"dialogue",
".",
"We",
"extend",
"prior",
"work",
"in",
"two",
"ways.",
"We",
"first",
"apply",
"approaches... | In this paper, we investigate the problem of automatically predicting segment boundaries in spoken multiparty dialogue . We extend prior work in two ways. We first apply approaches that have been proposed for predicting top-level topic shifts to the problem of identifying subtopic boundaries . We then explore ... | [
{
"end": 90,
"id": "T1",
"label": "Task",
"start": 60,
"text": "predicting segment boundaries"
},
{
"end": 122,
"id": "T2",
"label": "Material",
"start": 96,
"text": "spoken multiparty dialogue"
},
{
"end": 185,
"id": "T3",
"label": "Generic",
"start"... | [
{
"head": "ASR output",
"head_span": [
358,
368
],
"relation": "COMPARE",
"tail": "human transcription",
"tail_span": [
385,
404
]
},
{
"head": "machine learning approach",
"head_span": [
710,
735
],
"relation": "USED-FOR",
"tai... | [
[
"conversational cues",
"indicators"
],
[
"predicting top-level boundaries",
"top-level prediction task"
],
[
"tasks",
"tasks",
"predicting top-level and predicting subtopic boundaries"
],
[
"machine learning approach",
"models"
],
[
"predicting subtopic bou... |
E06-1045 | [
[
"We",
"describe",
"an",
"implementation",
"of",
"data-driven",
"selection",
"of",
"emphatic",
"facial",
"displays",
"for",
"an",
"embodied",
"conversational",
"agent",
"in",
"a",
"dialogue",
"system",
".",
"A",
"corpus",
... | [
"We",
"describe",
"an",
"implementation",
"of",
"data-driven",
"selection",
"of",
"emphatic",
"facial",
"displays",
"for",
"an",
"embodied",
"conversational",
"agent",
"in",
"a",
"dialogue",
"system",
".",
"A",
"corpus",
"of",
"sentences",
"in",
"the",
"domain",... |
We describe an implementation of data-driven selection of emphatic facial displays for an embodied conversational agent in a dialogue system . A corpus of sentences in the domain of the target dialogue system was recorded, and the facial displays used by the speaker were annotated. The data from those recordi... | [
{
"end": 55,
"id": "T1",
"label": "Task",
"start": 34,
"text": "data-driven selection"
},
{
"end": 83,
"id": "T2",
"label": "Material",
"start": 59,
"text": "emphatic facial displays"
},
{
"end": 121,
"id": "T3",
"label": "Task",
"start": 92,
"text... | [
{
"head": "embodied conversational agent",
"head_span": [
92,
121
],
"relation": "PART-OF",
"tail": "dialogue system",
"tail_span": [
129,
144
]
},
{
"head": "data-driven selection",
"head_span": [
34,
55
],
"relation": "USED-FOR",
... | [
[
"facial displays",
"emphatic facial displays",
"facial displays"
],
[
"cross-validation",
"cross-validation",
"cross-validation"
],
[
"model",
"models",
"models"
],
[
"corpus",
"corpus of sentences",
"data"
],
[
"dialogue system",
"dialogue s... |
E83-1021 | [
[
"This",
"article",
"deals",
"with",
"the",
"interpretation",
"of",
"conceptual",
"operations",
"underlying",
"the",
"communicative",
"use",
"of",
"natural",
"language",
"(NL)",
"within",
"the",
"Structured",
"Inheritance",
"Ne... | [
"This",
"article",
"deals",
"with",
"the",
"interpretation",
"of",
"conceptual",
"operations",
"underlying",
"the",
"communicative",
"use",
"of",
"natural",
"language",
"(NL)",
"within",
"the",
"Structured",
"Inheritance",
"Network",
"(SI-Nets)",
"paradigm",
".",
"T... |
This article deals with the interpretation of conceptual operations underlying the communicative use of natural language (NL) within the Structured Inheritance Network (SI-Nets) paradigm . The operations are reduced to functions of a formal language , thus changing the level of abstraction of the operations ... | [
{
"end": 71,
"id": "T1",
"label": "Task",
"start": 50,
"text": "conceptual operations"
},
{
"end": 131,
"id": "T2",
"label": "Material",
"start": 110,
"text": "natural language (NL)"
},
{
"end": 194,
"id": "T3",
"label": "Method",
"start": 145,
"te... | [
{
"head": "NL",
"head_span": [
566,
568
],
"relation": "USED-FOR",
"tail": "conceptual system",
"tail_span": [
543,
560
]
},
{
"head": "epistemological level",
"head_span": [
650,
671
],
"relation": "FEATURE-OF",
"tail": "KL-ONE... | [
[
"conceptual operations",
"operations",
"operations",
"operations"
],
[
"SI-Nets",
"Structured Inheritance Network (SI-Nets) paradigm",
"SI-Nets",
"SI-Nets"
],
[
"NL",
"natural language (NL)"
],
[
"experimental language",
"KL-Conc",
"KL-Conc"
]
] |
E83-1029 | [
[
"In",
"this",
"paper",
"a",
"system",
"which",
"understands",
"and",
"conceptualizes",
"scenes",
"descriptions",
"in",
"natural",
"language",
"is",
"presented.",
"Specifically,",
"the",
"following",
"components",
"of",
"the",
... | [
"In",
"this",
"paper",
"a",
"system",
"which",
"understands",
"and",
"conceptualizes",
"scenes",
"descriptions",
"in",
"natural",
"language",
"is",
"presented.",
"Specifically,",
"the",
"following",
"components",
"of",
"the",
"system",
"are",
"described:",
"the",
... |
In this paper a system which understands and conceptualizes scenes descriptions in natural language is presented. Specifically, the following components of the system are described: the syntactic analyzer , based on a Procedural Systemic Grammar , the semantic analyzer relying on the Conceptual Dependency Theor... | [
{
"end": 23,
"id": "T1",
"label": "Generic",
"start": 17,
"text": "system"
},
{
"end": 101,
"id": "T2",
"label": "Task",
"start": 62,
"text": "scenes descriptions in natural language"
},
{
"end": 155,
"id": "T3",
"label": "Generic",
"start": 145,
"... | [
{
"head": "Procedural Systemic Grammar",
"head_span": [
223,
250
],
"relation": "USED-FOR",
"tail": "syntactic analyzer",
"tail_span": [
190,
208
]
},
{
"head": "Conceptual Dependency Theory",
"head_span": [
293,
321
],
"relation": ... | [
[
"system",
"system"
]
] |
E85-1004 | [
[
"This",
"paper",
"reports",
"a",
"completed",
"stage",
"of",
"ongoing",
"research",
"at",
"the",
"University",
"of",
"York.",
"Landsbergen's",
"advocacy",
"of",
"analytical",
"inverses",
"for",
"compositional",
"syntax",
"... | [
"This",
"paper",
"reports",
"a",
"completed",
"stage",
"of",
"ongoing",
"research",
"at",
"the",
"University",
"of",
"York.",
"Landsbergen's",
"advocacy",
"of",
"analytical",
"inverses",
"for",
"compositional",
"syntax",
"rules",
"encourages",
"the",
"application",
... |
This paper reports a completed stage of ongoing research at the University of York. Landsbergen's advocacy of analytical inverses for compositional syntax rules encourages the application of Definite Clause Grammar techniques to the construction of a parser returning Montague analysis trees . A parser MDCC ... | [
{
"end": 131,
"id": "T1",
"label": "Method",
"start": 112,
"text": "analytical inverses"
},
{
"end": 164,
"id": "T2",
"label": "OtherScientificTerm",
"start": 138,
"text": "compositional syntax rules"
},
{
"end": 231,
"id": "T3",
"label": "Method",
"st... | [
{
"head": "analytical inverses",
"head_span": [
112,
131
],
"relation": "USED-FOR",
"tail": "compositional syntax rules",
"tail_span": [
138,
164
]
},
{
"head": "augmented Friedman - Warren algorithm",
"head_span": [
354,
391
],
"re... | [
[
"basic DCG mechanism",
"Definite Clause Grammar techniques"
]
] |
E85-1037 | [
[
"Systemic",
"grammar",
"has",
"been",
"used",
"for",
"AI",
"text",
"generation",
"work",
"in",
"the",
"past,",
"but",
"the",
"implementations",
"have",
"tended",
"be",
"ad",
"hoc",
"or",
"inefficient.",
"This",
"pa... | [
"Systemic",
"grammar",
"has",
"been",
"used",
"for",
"AI",
"text",
"generation",
"work",
"in",
"the",
"past,",
"but",
"the",
"implementations",
"have",
"tended",
"be",
"ad",
"hoc",
"or",
"inefficient.",
"This",
"paper",
"presents",
"an",
"approach",
"to",
"s... |
Systemic grammar has been used for AI text generation work in the past, but the implementations have tended be ad hoc or inefficient. This paper presents an approach to systemic text generation where AI problem solving techniques are applied directly to an unadulterated systemic grammar . This approach is... | [
{
"end": 18,
"id": "T1",
"label": "Method",
"start": 2,
"text": "Systemic grammar"
},
{
"end": 57,
"id": "T2",
"label": "Task",
"start": 39,
"text": "AI text generation"
},
{
"end": 101,
"id": "T3",
"label": "Generic",
"start": 86,
"text": "impleme... | [
{
"head": "Systemic grammar",
"head_span": [
2,
18
],
"relation": "USED-FOR",
"tail": "AI text generation",
"tail_span": [
39,
57
]
},
{
"head": "AI problem solving techniques",
"head_span": [
210,
239
],
"relation": "USED-FOR",
... | [
[
"Systemic grammar",
"implementations"
],
[
"text generation",
"AI text generation",
"text generation"
],
[
"problem solving",
"approach",
"AI problem solving techniques",
"approach"
]
] |
E85-1041 | [
[
"We",
"propose",
"a",
"draft",
"scheme",
"of",
"the",
"model",
"formalizing",
"the",
"structure",
"of",
"communicative",
"context",
"in",
"dialogue",
"interaction",
".",
"The",
"relationships",
"between",
"the",
"interacti... | [
"We",
"propose",
"a",
"draft",
"scheme",
"of",
"the",
"model",
"formalizing",
"the",
"structure",
"of",
"communicative",
"context",
"in",
"dialogue",
"interaction",
".",
"The",
"relationships",
"between",
"the",
"interacting",
"partners",
"are",
"considered",
"as"... |
We propose a draft scheme of the model formalizing the structure of communicative context in dialogue interaction . The relationships between the interacting partners are considered as system of three automata representing the partners of the dialogue and environment.
| [
{
"end": 40,
"id": "T1",
"label": "Generic",
"start": 35,
"text": "model"
},
{
"end": 93,
"id": "T2",
"label": "OtherScientificTerm",
"start": 59,
"text": "structure of communicative context"
},
{
"end": 119,
"id": "T3",
"label": "Material",
"start": 9... | [
{
"head": "dialogue interaction",
"head_span": [
99,
119
],
"relation": "FEATURE-OF",
"tail": "structure of communicative context",
"tail_span": [
59,
93
]
},
{
"head": "model",
"head_span": [
35,
40
],
"relation": "USED-FOR",
"... | [] |
E87-1037 | [
[
"Currently",
"several",
"grammatical",
"formalisms",
"converge",
"towards",
"being",
"declarative",
"and",
"towards",
"utilizing",
"context-free",
"phrase-structure",
"grammar",
"as",
"a",
"backbone,",
"e.g.",
"LFG",
"and",
"PATR-... | [
"Currently",
"several",
"grammatical",
"formalisms",
"converge",
"towards",
"being",
"declarative",
"and",
"towards",
"utilizing",
"context-free",
"phrase-structure",
"grammar",
"as",
"a",
"backbone,",
"e.g.",
"LFG",
"and",
"PATR-II",
".",
"Typically",
"the",
"process... |
Currently several grammatical formalisms converge towards being declarative and towards utilizing context-free phrase-structure grammar as a backbone, e.g. LFG and PATR-II . Typically the processing of these formalisms is organized within a chart-parsing framework . The declarative character of the formalisms... | [
{
"end": 42,
"id": "T1",
"label": "Method",
"start": 20,
"text": "grammatical formalisms"
},
{
"end": 139,
"id": "T2",
"label": "Method",
"start": 102,
"text": "context-free phrase-structure grammar"
},
{
"end": 165,
"id": "T3",
"label": "OtherScientificTe... | [
{
"head": "context-free phrase-structure grammar",
"head_span": [
102,
139
],
"relation": "USED-FOR",
"tail": "grammatical formalisms",
"tail_span": [
20,
42
]
},
{
"head": "rule-invocation strategies",
"head_span": [
697,
723
],
"r... | [
[
"grammatical formalisms",
"formalisms",
"formalisms"
],
[
"rule-invocation strategies",
"rule-invocation strategy"
],
[
"context-free chart parsing",
"chart-parsing framework"
]
] |
E87-1043 | [
[
"The",
"verb",
"forms",
"are",
"often",
"claimed",
"to",
"convey",
"two",
"kinds",
"of",
"information",
":",
"1.",
"whether",
"the",
"event",
"described",
"in",
"a",
"sentence",
"is",
"present",
",",
"past",
"o... | [
"The",
"verb",
"forms",
"are",
"often",
"claimed",
"to",
"convey",
"two",
"kinds",
"of",
"information",
":",
"1.",
"whether",
"the",
"event",
"described",
"in",
"a",
"sentence",
"is",
"present",
",",
"past",
"or",
"future",
"(=",
"deictic",
"information",
... |
The verb forms are often claimed to convey two kinds of information : 1. whether the event described in a sentence is present , past or future (= deictic information ) 2. whether the event described in a sentence is presented as completed, going on, just starting or being finished (= aspectual infor... | [
{
"end": 16,
"id": "T1",
"label": "OtherScientificTerm",
"start": 6,
"text": "verb forms"
},
{
"end": 71,
"id": "T2",
"label": "Generic",
"start": 60,
"text": "information"
},
{
"end": 180,
"id": "T3",
"label": "OtherScientificTerm",
"start": 161,
... | [
{
"head": "deictic information",
"head_span": [
161,
180
],
"relation": "HYPONYM-OF",
"tail": "information",
"tail_span": [
60,
71
]
},
{
"head": "aspectual information",
"head_span": [
305,
326
],
"relation": "HYPONYM-OF",
"tai... | [
[
"analysis of verb form meanings",
"analysis"
]
] |
E89-1006 | [
[
"A",
"proposal",
"to",
"deal",
"with",
"French",
"tenses",
"in",
"the",
"framework",
"of",
"Discourse",
"Representation",
"Theory",
"is",
"presented,",
"as",
"it",
"has",
"been",
"implemented",
"for",
"a",
"fragment",
... | [
"A",
"proposal",
"to",
"deal",
"with",
"French",
"tenses",
"in",
"the",
"framework",
"of",
"Discourse",
"Representation",
"Theory",
"is",
"presented,",
"as",
"it",
"has",
"been",
"implemented",
"for",
"a",
"fragment",
"at",
"the",
"IMS",
".",
"It",
"is",
"... |
A proposal to deal with French tenses in the framework of Discourse Representation Theory is presented, as it has been implemented for a fragment at the IMS . It is based on the theory of tenses of H. Kamp and Ch. Rohrer. Instead of using operators to express the meaning of the tenses the Reichenbachian p... | [
{
"end": 11,
"id": "T1",
"label": "Generic",
"start": 3,
"text": "proposal"
},
{
"end": 39,
"id": "T2",
"label": "OtherScientificTerm",
"start": 26,
"text": "French tenses"
},
{
"end": 93,
"id": "T3",
"label": "Method",
"start": 62,
"text": "Discou... | [
{
"head": "resolution component",
"head_span": [
1215,
1235
],
"relation": "COMPARE",
"tail": "syntactic analysis",
"tail_span": [
1264,
1282
]
},
{
"head": "Discourse Representation Theory",
"head_span": [
62,
93
],
"relation": "US... | [
[
"system of relevant times",
"system",
"system of relevant times",
"system of temporal coordinates"
],
[
"proposal",
"it",
"It"
]
] |
E89-1016 | [
[
"This",
"paper",
"presents",
"a",
"critical",
"discussion",
"of",
"the",
"various",
"approaches",
"that",
"have",
"been",
"used",
"in",
"the",
"evaluation",
"of",
"Natural",
"Language",
"systems",
".",
"We",
"conclude"... | [
"This",
"paper",
"presents",
"a",
"critical",
"discussion",
"of",
"the",
"various",
"approaches",
"that",
"have",
"been",
"used",
"in",
"the",
"evaluation",
"of",
"Natural",
"Language",
"systems",
".",
"We",
"conclude",
"that",
"previous",
"approaches",
"have",
... |
This paper presents a critical discussion of the various approaches that have been used in the evaluation of Natural Language systems . We conclude that previous approaches have neglected to evaluate systems in the context of their use, e.g. solving a task requiring data retrieval . This raises questions a... | [
{
"end": 71,
"id": "T1",
"label": "Generic",
"start": 61,
"text": "approaches"
},
{
"end": 139,
"id": "T2",
"label": "Task",
"start": 101,
"text": "evaluation of Natural Language systems"
},
{
"end": 139,
"id": "T3",
"label": "Method",
"start": 115,
... | [
{
"head": "systems",
"head_span": [
209,
216
],
"relation": "USED-FOR",
"tail": "task",
"tail_span": [
263,
267
]
},
{
"head": "approaches",
"head_span": [
169,
179
],
"relation": "EVALUATE-FOR",
"tail": "systems",
"tail_spa... | [
[
"approaches",
"approaches"
],
[
"Natural Language systems",
"systems"
],
[
"task",
"task",
"task"
],
[
"technique",
"Wizard of Oz technique"
],
[
"prototype Natural Language system",
"Natural Language systems"
],
[
"task",
"database access"
... |
E89-1040 | [
[
"Theoretical",
"research",
"in",
"the",
"area",
"of",
"machine",
"translation",
"usually",
"involves",
"the",
"search",
"for",
"and",
"creation",
"of",
"an",
"appropriate",
"formalism",
".",
"An",
"important",
"issue",
... | [
"Theoretical",
"research",
"in",
"the",
"area",
"of",
"machine",
"translation",
"usually",
"involves",
"the",
"search",
"for",
"and",
"creation",
"of",
"an",
"appropriate",
"formalism",
".",
"An",
"important",
"issue",
"in",
"this",
"respect",
"is",
"the",
"wa... |
Theoretical research in the area of machine translation usually involves the search for and creation of an appropriate formalism . An important issue in this respect is the way in which the compositionality of translation is to be defined. In this paper, we will introduce the anaphoric component of the Mimo ... | [
{
"end": 57,
"id": "T1",
"label": "Task",
"start": 38,
"text": "machine translation"
},
{
"end": 132,
"id": "T2",
"label": "Generic",
"start": 123,
"text": "formalism"
},
{
"end": 228,
"id": "T3",
"label": "Task",
"start": 217,
"text": "translation... | [
{
"head": "formalism",
"head_span": [
123,
132
],
"relation": "USED-FOR",
"tail": "machine translation",
"tail_span": [
38,
57
]
},
{
"head": "anaphoric component",
"head_span": [
582,
601
],
"relation": "USED-FOR",
"tail": "lin... | [
[
"formalism",
"Mimo formalism",
"Mimo"
],
[
"anaphoric component",
"anaphoric component"
],
[
"wh-movement",
"wh-movement"
],
[
"translation of anaphoric relations",
"translation of anaphoric relations"
]
] |
E91-1012 | [
[
"A",
"purely",
"functional",
"implementation",
"of",
"LR-parsers",
"is",
"given,",
"together",
"with",
"a",
"simple",
"correctness",
"proof",
".",
"It",
"is",
"presented",
"as",
"a",
"generalization",
"of",
"the",
"rec... | [
"A",
"purely",
"functional",
"implementation",
"of",
"LR-parsers",
"is",
"given,",
"together",
"with",
"a",
"simple",
"correctness",
"proof",
".",
"It",
"is",
"presented",
"as",
"a",
"generalization",
"of",
"the",
"recursive",
"descent",
"parser",
".",
"For",
... |
A purely functional implementation of LR-parsers is given, together with a simple correctness proof . It is presented as a generalization of the recursive descent parser . For non-LR grammars the time-complexity of our parser is cubic if the functions that constitute the parser are implemented as memo-funct... | [
{
"end": 50,
"id": "T1",
"label": "Method",
"start": 40,
"text": "LR-parsers"
},
{
"end": 103,
"id": "T2",
"label": "Method",
"start": 86,
"text": "correctness proof"
},
{
"end": 108,
"id": "T3",
"label": "Generic",
"start": 106,
"text": "It"
},
... | [
{
"head": "Memo-functions",
"head_span": [
394,
408
],
"relation": "USED-FOR",
"tail": "parse forest",
"tail_span": [
490,
502
]
},
{
"head": "LR-parser",
"head_span": [
789,
798
],
"relation": "USED-FOR",
"tail": "CF grammars",... | [
[
"LR-parsers",
"algorithm",
"LR-parser",
"It",
"parser",
"parser"
],
[
"Memo-functions",
"memo-functions"
],
[
"Extended CF grammars",
"grammars"
]
] |
E91-1043 | [
[
"In",
"this",
"paper",
"I",
"will",
"argue",
"for",
"a",
"model",
"of",
"grammatical",
"processing",
"that",
"is",
"based",
"on",
"uniform",
"processing",
"and",
"knowledge",
"sources",
".",
"The",
"main",
"feature... | [
"In",
"this",
"paper",
"I",
"will",
"argue",
"for",
"a",
"model",
"of",
"grammatical",
"processing",
"that",
"is",
"based",
"on",
"uniform",
"processing",
"and",
"knowledge",
"sources",
".",
"The",
"main",
"feature",
"of",
"this",
"model",
"is",
"to",
"vie... |
In this paper I will argue for a model of grammatical processing that is based on uniform processing and knowledge sources . The main feature of this model is to view parsing and generation as two strongly interleaved tasks performed by a single parametrized deduction process. It will be shown that this v... | [
{
"end": 66,
"id": "T1",
"label": "Method",
"start": 35,
"text": "model of grammatical processing"
},
{
"end": 104,
"id": "T2",
"label": "Method",
"start": 86,
"text": "uniform processing"
},
{
"end": 128,
"id": "T3",
"label": "Material",
"start": 111,... | [
{
"head": "uniform processing",
"head_span": [
86,
104
],
"relation": "USED-FOR",
"tail": "model of grammatical processing",
"tail_span": [
35,
66
]
},
{
"head": "parsing",
"head_span": [
176,
183
],
"relation": "CONJUNCTION",
"... | [
[
"model of grammatical processing",
"model"
]
] |
E91-1050 | [
[
"Unification",
"is",
"often",
"the",
"appropriate",
"method",
"for",
"expressing",
"relations",
"between",
"representations",
"in",
"the",
"form",
"of",
"feature",
"structures",
";",
"however,",
"there",
"are",
"circumstances"... | [
"Unification",
"is",
"often",
"the",
"appropriate",
"method",
"for",
"expressing",
"relations",
"between",
"representations",
"in",
"the",
"form",
"of",
"feature",
"structures",
";",
"however,",
"there",
"are",
"circumstances",
"in",
"which",
"a",
"different",
"ap... |
Unification is often the appropriate method for expressing relations between representations in the form of feature structures ; however, there are circumstances in which a different approach is desirable. A declarative formalism is presented which permits direct mappings of one feature structure into ano... | [
{
"end": 13,
"id": "T1",
"label": "Method",
"start": 2,
"text": "Unification"
},
{
"end": 46,
"id": "T2",
"label": "Generic",
"start": 40,
"text": "method"
},
{
"end": 98,
"id": "T3",
"label": "Task",
"start": 63,
"text": "relations between repre... | [
{
"head": "approach",
"head_span": [
191,
199
],
"relation": "COMPARE",
"tail": "method",
"tail_span": [
40,
46
]
},
{
"head": "method",
"head_span": [
40,
46
],
"relation": "USED-FOR",
"tail": "relations between representatio... | [
[
"Unification",
"method"
],
[
"approach",
"declarative formalism"
]
] |
E93-1004 | [
[
"In",
"this",
"paper",
"we",
"introduce",
"a",
"modal",
"language",
"LT",
"for",
"imposing",
"constraints",
"on",
"trees",
",",
"and",
"an",
"extension",
"LT",
"(LF)",
"for",
"imposing",
"constraints",
"on",
"trees... | [
"In",
"this",
"paper",
"we",
"introduce",
"a",
"modal",
"language",
"LT",
"for",
"imposing",
"constraints",
"on",
"trees",
",",
"and",
"an",
"extension",
"LT",
"(LF)",
"for",
"imposing",
"constraints",
"on",
"trees",
"decorated",
"with",
"feature",
"structures... |
In this paper we introduce a modal language LT for imposing constraints on trees , and an extension LT (LF) for imposing constraints on trees decorated with feature structures . The motivation for introducing these languages is to provide tools for formalising grammatical frameworks perspicuously, and the... | [
{
"end": 48,
"id": "T1",
"label": "Method",
"start": 31,
"text": "modal language LT"
},
{
"end": 85,
"id": "T2",
"label": "OtherScientificTerm",
"start": 63,
"text": "constraints on trees"
},
{
"end": 113,
"id": "T3",
"label": "Method",
"start": 95,
... | [
{
"head": "modal language LT",
"head_span": [
31,
48
],
"relation": "HYPONYM-OF",
"tail": "languages",
"tail_span": [
226,
235
]
},
{
"head": "languages",
"head_span": [
226,
235
],
"relation": "USED-FOR",
"tail": "grammatical f... | [
[
"languages",
"modal languages"
],
[
"extension LT (LF)",
"LT (LF)"
]
] |
E93-1023 | [
[
"One",
"of",
"the",
"major",
"problems",
"one",
"is",
"faced",
"with",
"when",
"decomposing",
"words",
"into",
"their",
"constituent",
"parts",
"is",
"ambiguity",
":",
"the",
"generation",
"of",
"multiple",
"analyses",... | [
"One",
"of",
"the",
"major",
"problems",
"one",
"is",
"faced",
"with",
"when",
"decomposing",
"words",
"into",
"their",
"constituent",
"parts",
"is",
"ambiguity",
":",
"the",
"generation",
"of",
"multiple",
"analyses",
"for",
"one",
"input",
"word",
",",
"ma... |
One of the major problems one is faced with when decomposing words into their constituent parts is ambiguity : the generation of multiple analyses for one input word , many of which are implausible. In order to deal with ambiguity , the MORphological PArser MORPA is provided with a probabilistic context-... | [
{
"end": 114,
"id": "T1",
"label": "OtherScientificTerm",
"start": 105,
"text": "ambiguity"
},
{
"end": 132,
"id": "T2",
"label": "Task",
"start": 122,
"text": "generation"
},
{
"end": 242,
"id": "T3",
"label": "OtherScientificTerm",
"start": 233,
... | [
{
"head": "probabilistic context-free grammar (PCFG)",
"head_span": [
298,
339
],
"relation": "USED-FOR",
"tail": "MORphological PArser MORPA",
"tail_span": [
250,
276
]
},
{
"head": "probability-based scoring function",
"head_span": [
465,
... | [
[
"MORPA",
"MORphological PArser MORPA",
"it"
],
[
"PCFG",
"probabilistic context-free grammar (PCFG)"
]
] |
E93-1025 | [
[
"We",
"give",
"an",
"analysis",
"of",
"ellipsis",
"resolution",
"in",
"terms",
"of",
"a",
"straightforward",
"discourse",
"copying",
"algorithm",
"that",
"correctly",
"predicts",
"a",
"wide",
"range",
"of",
"phenomena.",
... | [
"We",
"give",
"an",
"analysis",
"of",
"ellipsis",
"resolution",
"in",
"terms",
"of",
"a",
"straightforward",
"discourse",
"copying",
"algorithm",
"that",
"correctly",
"predicts",
"a",
"wide",
"range",
"of",
"phenomena.",
"The",
"treatment",
"does",
"not",
"suffe... |
We give an analysis of ellipsis resolution in terms of a straightforward discourse copying algorithm that correctly predicts a wide range of phenomena. The treatment does not suffer from problems inherent in identity-of-relations analyses . Furthermore, in contrast to the approach of Dalrymple et al. [1991], the... | [
{
"end": 45,
"id": "T1",
"label": "Task",
"start": 13,
"text": "analysis of ellipsis resolution"
},
{
"end": 105,
"id": "T2",
"label": "Method",
"start": 78,
"text": "discourse copying algorithm"
},
{
"end": 171,
"id": "T3",
"label": "Generic",
"start... | [
{
"head": "full NPs",
"head_span": [
383,
391
],
"relation": "CONJUNCTION",
"tail": "referential elements",
"tail_span": [
402,
422
]
},
{
"head": "analysis",
"head_span": [
588,
596
],
"relation": "USED-FOR",
"tail": "discourse... | [
[
"analysis of ellipsis resolution",
"analysis",
"treatment",
"treatment"
]
] |
E93-1043 | [
[
"In",
"this",
"paper",
"a",
"morphological",
"component",
"with",
"a",
"limited",
"capability",
"to",
"automatically",
"interpret",
"(and",
"generate)",
"derived",
"words",
"is",
"presented.",
"The",
"system",
"combines",
... | [
"In",
"this",
"paper",
"a",
"morphological",
"component",
"with",
"a",
"limited",
"capability",
"to",
"automatically",
"interpret",
"(and",
"generate)",
"derived",
"words",
"is",
"presented.",
"The",
"system",
"combines",
"an",
"extended",
"two-level",
"morphology",... |
In this paper a morphological component with a limited capability to automatically interpret (and generate) derived words is presented. The system combines an extended two-level morphology [Trost, 1991a; Trost, 1991b] with a feature-based word grammar building on a hierarchical lexicon . Polymorphemic stems ... | [
{
"end": 41,
"id": "T1",
"label": "Method",
"start": 18,
"text": "morphological component"
},
{
"end": 125,
"id": "T2",
"label": "OtherScientificTerm",
"start": 112,
"text": "derived words"
},
{
"end": 151,
"id": "T3",
"label": "Generic",
"start": 145,... | [
{
"head": "morphological component",
"head_span": [
18,
41
],
"relation": "USED-FOR",
"tail": "derived words",
"tail_span": [
112,
125
]
},
{
"head": "hierarchical lexicon",
"head_span": [
276,
296
],
"relation": "USED-FOR",
"ta... | [
[
"morphological component",
"system",
"system",
"system"
],
[
"derived words",
"derived words"
]
] |
E93-1066 | [
[
"This",
"poster",
"paper",
"describes",
"a",
"full",
"scale",
"two-level",
"morphological",
"description",
"(Karttunen,",
"1983;",
"Koskenniemi,",
"1983)",
"of",
"Turkish",
"word",
"structures",
".",
"The",
"description",
"has... | [
"This",
"poster",
"paper",
"describes",
"a",
"full",
"scale",
"two-level",
"morphological",
"description",
"(Karttunen,",
"1983;",
"Koskenniemi,",
"1983)",
"of",
"Turkish",
"word",
"structures",
".",
"The",
"description",
"has",
"been",
"implemented",
"using",
"the"... |
This poster paper describes a full scale two-level morphological description (Karttunen, 1983; Koskenniemi, 1983) of Turkish word structures . The description has been implemented using the PC-KIMMO environment (Antworth, 1990) and is based on a root word lexicon of about 23,000 roots words . Almost all the sp... | [
{
"end": 78,
"id": "T1",
"label": "Task",
"start": 32,
"text": "full scale two-level morphological description"
},
{
"end": 144,
"id": "T2",
"label": "Material",
"start": 121,
"text": "Turkish word structures"
},
{
"end": 162,
"id": "T3",
"label": "Generic... | [
{
"head": "full scale two-level morphological description",
"head_span": [
32,
78
],
"relation": "USED-FOR",
"tail": "Turkish word structures",
"tail_span": [
121,
144
]
},
{
"head": "PC-KIMMO environment",
"head_span": [
195,
215
],
... | [
[
"full scale two-level morphological description",
"description"
],
[
"Turkish",
"Turkish"
]
] |
E95-1021 | [
[
"In",
"this",
"paper",
"we",
"compare",
"two",
"competing",
"approaches",
"to",
"part-of-speech",
"tagging",
",",
"statistical",
"and",
"constraint-based",
"disambiguation",
",",
"using",
"French",
"as",
"our",
"test",
"la... | [
"In",
"this",
"paper",
"we",
"compare",
"two",
"competing",
"approaches",
"to",
"part-of-speech",
"tagging",
",",
"statistical",
"and",
"constraint-based",
"disambiguation",
",",
"using",
"French",
"as",
"our",
"test",
"language",
".",
"We",
"imposed",
"a",
"tim... |
In this paper we compare two competing approaches to part-of-speech tagging , statistical and constraint-based disambiguation , using French as our test language . We imposed a time limit on our experiment: the amount of time spent on the design of our constraint system was about the same as the time we used to... | [
{
"end": 50,
"id": "T1",
"label": "Generic",
"start": 40,
"text": "approaches"
},
{
"end": 77,
"id": "T2",
"label": "Task",
"start": 55,
"text": "part-of-speech tagging"
},
{
"end": 128,
"id": "T3",
"label": "Task",
"start": 81,
"text": "statistica... | [
{
"head": "constraint system",
"head_span": [
260,
277
],
"relation": "COMPARE",
"tail": "statistical model",
"tail_span": [
359,
376
]
},
{
"head": "statistical method",
"head_span": [
455,
473
],
"relation": "COMPARE",
"tail":... | [
[
"approaches",
"statistical and constraint-based disambiguation",
"systems"
],
[
"statistical model",
"statistical method"
],
[
"constraint-based tagger",
"constraint system"
]
] |
E95-1033 | [
[
"We",
"provide",
"a",
"unified",
"account",
"of",
"sentence-level",
"and",
"text-level",
"anaphora",
"within",
"the",
"framework",
"of",
"a",
"dependency-based",
"grammar",
"model",
".",
"Criteria",
"for",
"anaphora",
"res... | [
"We",
"provide",
"a",
"unified",
"account",
"of",
"sentence-level",
"and",
"text-level",
"anaphora",
"within",
"the",
"framework",
"of",
"a",
"dependency-based",
"grammar",
"model",
".",
"Criteria",
"for",
"anaphora",
"resolution",
"within",
"sentence",
"boundaries"... |
We provide a unified account of sentence-level and text-level anaphora within the framework of a dependency-based grammar model . Criteria for anaphora resolution within sentence boundaries rephrase major concepts from GB's binding theory , while those for text-level anaphora incorporate an adapted version o... | [
{
"end": 72,
"id": "T1",
"label": "OtherScientificTerm",
"start": 34,
"text": "sentence-level and text-level anaphora"
},
{
"end": 131,
"id": "T2",
"label": "Method",
"start": 101,
"text": "dependency-based grammar model"
},
{
"end": 142,
"id": "T3",
"labe... | [
{
"head": "dependency-based grammar model",
"head_span": [
101,
131
],
"relation": "USED-FOR",
"tail": "sentence-level and text-level anaphora",
"tail_span": [
34,
72
]
},
{
"head": "those",
"head_span": [
256,
261
],
"relation": "U... | [
[
"Criteria",
"those"
]
] |
E95-1036 | [
[
"This",
"paper",
"presents",
"an",
"analysis",
"of",
"temporal",
"anaphora",
"in",
"sentences",
"which",
"contain",
"quantification",
"over",
"events",
",",
"within",
"the",
"framework",
"of",
"Discourse",
"Representation",
... | [
"This",
"paper",
"presents",
"an",
"analysis",
"of",
"temporal",
"anaphora",
"in",
"sentences",
"which",
"contain",
"quantification",
"over",
"events",
",",
"within",
"the",
"framework",
"of",
"Discourse",
"Representation",
"Theory",
".",
"The",
"analysis",
"in",
... |
This paper presents an analysis of temporal anaphora in sentences which contain quantification over events , within the framework of Discourse Representation Theory . The analysis in (Partee, 1984) of quantified sentences , introduced by a temporal connective , gives the wrong truth-conditions when the temp... | [
{
"end": 54,
"id": "T1",
"label": "Task",
"start": 37,
"text": "temporal anaphora"
},
{
"end": 112,
"id": "T2",
"label": "OtherScientificTerm",
"start": 86,
"text": "quantification over events"
},
{
"end": 171,
"id": "T3",
"label": "Method",
"start": 1... | [
{
"head": "DRT",
"head_span": [
735,
738
],
"relation": "USED-FOR",
"tail": "problem",
"tail_span": [
700,
707
]
},
{
"head": "solution",
"head_span": [
776,
784
],
"relation": "USED-FOR",
"tail": "temporal anaphora phenomena",
... | [
[
"temporal anaphora",
"problem",
"problem"
],
[
"solution",
"Generalized Quantifier approach"
],
[
"solution",
"solution"
],
[
"DRT",
"Discourse Representation Theory"
]
] |
E99-1014 | [
[
"This",
"paper",
"proposes",
"an",
"approach",
"to",
"full",
"parsing",
"suitable",
"for",
"Information",
"Extraction",
"from",
"texts",
".",
"Sequences",
"of",
"cascades",
"of",
"rules",
"deterministically",
"analyze",
"t... | [
"This",
"paper",
"proposes",
"an",
"approach",
"to",
"full",
"parsing",
"suitable",
"for",
"Information",
"Extraction",
"from",
"texts",
".",
"Sequences",
"of",
"cascades",
"of",
"rules",
"deterministically",
"analyze",
"the",
"text",
",",
"building",
"unambiguous... |
This paper proposes an approach to full parsing suitable for Information Extraction from texts . Sequences of cascades of rules deterministically analyze the text , building unambiguous structures . Initially basic chunks are analyzed; then argumental relations are recognized; finally modifier attachment... | [
{
"end": 32,
"id": "T1",
"label": "Generic",
"start": 24,
"text": "approach"
},
{
"end": 49,
"id": "T2",
"label": "Task",
"start": 37,
"text": "full parsing"
},
{
"end": 87,
"id": "T3",
"label": "Task",
"start": 65,
"text": "Information Extraction"... | [
{
"head": "full parsing",
"head_span": [
37,
49
],
"relation": "USED-FOR",
"tail": "Information Extraction",
"tail_span": [
65,
87
]
},
{
"head": "IE module",
"head_span": [
479,
488
],
"relation": "PART-OF",
"tail": "FACILE, a ... | [
[
"approach",
"It",
"approach"
]
] |
E99-1015 | [
[
"In",
"order",
"to",
"build",
"robust",
"automatic",
"abstracting",
"systems",
",",
"there",
"is",
"a",
"need",
"for",
"better",
"training",
"resources",
"than",
"are",
"currently",
"available.",
"In",
"this",
"paper,"... | [
"In",
"order",
"to",
"build",
"robust",
"automatic",
"abstracting",
"systems",
",",
"there",
"is",
"a",
"need",
"for",
"better",
"training",
"resources",
"than",
"are",
"currently",
"available.",
"In",
"this",
"paper,",
"we",
"introduce",
"an",
"annotation",
"... |
In order to build robust automatic abstracting systems , there is a need for better training resources than are currently available. In this paper, we introduce an annotation scheme for scientific articles which can be used to build such a resource in a consistent way. The seven categories of the scheme are b... | [
{
"end": 56,
"id": "T1",
"label": "Task",
"start": 27,
"text": "automatic abstracting systems"
},
{
"end": 105,
"id": "T2",
"label": "Material",
"start": 87,
"text": "training resources"
},
{
"end": 186,
"id": "T3",
"label": "Method",
"start": 169,
... | [
{
"head": "training resources",
"head_span": [
87,
105
],
"relation": "USED-FOR",
"tail": "automatic abstracting systems",
"tail_span": [
27,
56
]
},
{
"head": "annotation scheme",
"head_span": [
169,
186
],
"relation": "USED-FOR",
... | [
[
"annotation scheme",
"scheme",
"scheme"
],
[
"training resources",
"resource"
]
] |
E99-1023 | [
[
"Dividing",
"sentences",
"in",
"chunks",
"of",
"words",
"is",
"a",
"useful",
"preprocessing",
"step",
"for",
"parsing",
",",
"information",
"extraction",
"and",
"information",
"retrieval",
".",
"(Ramshaw",
"and",
"Marcus,"... | [
"Dividing",
"sentences",
"in",
"chunks",
"of",
"words",
"is",
"a",
"useful",
"preprocessing",
"step",
"for",
"parsing",
",",
"information",
"extraction",
"and",
"information",
"retrieval",
".",
"(Ramshaw",
"and",
"Marcus,",
"1995)",
"have",
"introduced",
"a",
"\... |
Dividing sentences in chunks of words is a useful preprocessing step for parsing , information extraction and information retrieval . (Ramshaw and Marcus, 1995) have introduced a "convenient" data representation for chunking by converting it to a tagging task . In this paper we will examine seven differen... | [
{
"end": 41,
"id": "T1",
"label": "Task",
"start": 1,
"text": "Dividing sentences in chunks of words"
},
{
"end": 86,
"id": "T2",
"label": "Task",
"start": 79,
"text": "parsing"
},
{
"end": 112,
"id": "T3",
"label": "Task",
"start": 90,
"text": ... | [
{
"head": "data representation",
"head_span": [
202,
221
],
"relation": "USED-FOR",
"tail": "chunking",
"tail_span": [
228,
236
]
},
{
"head": "parsing",
"head_span": [
79,
86
],
"relation": "CONJUNCTION",
"tail": "information e... | [
[
"Dividing sentences in chunks of words",
"chunking",
"chunking",
"chunking",
"it"
]
] |
E99-1029 | [
[
"One",
"of",
"the",
"claimed",
"benefits",
"of",
"Tree",
"Adjoining",
"Grammars",
"is",
"that",
"they",
"have",
"an",
"extended",
"domain",
"of",
"locality",
"(EDOL)",
".",
"We",
"consider",
"how",
"this",
"can",
... | [
"One",
"of",
"the",
"claimed",
"benefits",
"of",
"Tree",
"Adjoining",
"Grammars",
"is",
"that",
"they",
"have",
"an",
"extended",
"domain",
"of",
"locality",
"(EDOL)",
".",
"We",
"consider",
"how",
"this",
"can",
"be",
"exploited",
"to",
"limit",
"the",
"n... |
One of the claimed benefits of Tree Adjoining Grammars is that they have an extended domain of locality (EDOL) . We consider how this can be exploited to limit the need for feature structure unification during parsing . We compare two wide-coverage lexicalized grammars of English , LEXSYS and XTAG , finding ... | [
{
"end": 56,
"id": "T1",
"label": "Method",
"start": 33,
"text": "Tree Adjoining Grammars"
},
{
"end": 70,
"id": "T2",
"label": "Generic",
"start": 66,
"text": "they"
},
{
"end": 114,
"id": "T3",
"label": "OtherScientificTerm",
"start": 80,
"text":... | [
{
"head": "Tree Adjoining Grammars",
"head_span": [
33,
56
],
"relation": "FEATURE-OF",
"tail": "extended domain of locality (EDOL)",
"tail_span": [
80,
114
]
},
{
"head": "feature structure unification",
"head_span": [
178,
207
],
... | [
[
"lexicalized grammars of English",
"grammars"
],
[
"EDOL",
"extended domain of locality (EDOL)"
],
[
"Tree Adjoining Grammars",
"they"
]
] |
E99-1034 | [
[
"This",
"paper",
"explores",
"the",
"issue",
"of",
"using",
"different",
"co-occurrence",
"similarities",
"between",
"terms",
"for",
"separating",
"query",
"terms",
"that",
"are",
"useful",
"for",
"retrieval",
"from",
"tho... | [
"This",
"paper",
"explores",
"the",
"issue",
"of",
"using",
"different",
"co-occurrence",
"similarities",
"between",
"terms",
"for",
"separating",
"query",
"terms",
"that",
"are",
"useful",
"for",
"retrieval",
"from",
"those",
"that",
"are",
"harmful.",
"The",
"... |
This paper explores the issue of using different co-occurrence similarities between terms for separating query terms that are useful for retrieval from those that are harmful. The hypothesis under examination is that useful terms tend to be more similar to each other than to other query terms . Preliminary ... | [
{
"end": 77,
"id": "T1",
"label": "OtherScientificTerm",
"start": 51,
"text": "co-occurrence similarities"
},
{
"end": 122,
"id": "T2",
"label": "Generic",
"start": 111,
"text": "query terms"
},
{
"end": 154,
"id": "T3",
"label": "Task",
"start": 145,
... | [
{
"head": "query terms",
"head_span": [
111,
122
],
"relation": "USED-FOR",
"tail": "retrieval",
"tail_span": [
145,
154
]
},
{
"head": "useful terms",
"head_span": [
227,
239
],
"relation": "COMPARE",
"tail": "query terms",
... | [
[
"similarities",
"Term similarities"
]
] |
E99-1038 | [
[
"We",
"present",
"an",
"operable",
"definition",
"of",
"focus",
"which",
"is",
"argued",
"to",
"be",
"of",
"a",
"cognito-pragmatic",
"nature",
"and",
"explore",
"how",
"it",
"is",
"determined",
"in",
"discourse",
"... | [
"We",
"present",
"an",
"operable",
"definition",
"of",
"focus",
"which",
"is",
"argued",
"to",
"be",
"of",
"a",
"cognito-pragmatic",
"nature",
"and",
"explore",
"how",
"it",
"is",
"determined",
"in",
"discourse",
"in",
"a",
"formalized",
"manner.",
"For",
"t... |
We present an operable definition of focus which is argued to be of a cognito-pragmatic nature and explore how it is determined in discourse in a formalized manner. For this purpose, a file card model of discourse model and knowledge store is introduced enabling the decomposition and formal representation ... | [
{
"end": 34,
"id": "T1",
"label": "Generic",
"start": 15,
"text": "operable definition"
},
{
"end": 97,
"id": "T2",
"label": "OtherScientificTerm",
"start": 73,
"text": "cognito-pragmatic nature"
},
{
"end": 116,
"id": "T3",
"label": "Generic",
"start"... | [
{
"head": "cognito-pragmatic nature",
"head_span": [
73,
97
],
"relation": "FEATURE-OF",
"tail": "operable definition",
"tail_span": [
15,
34
]
},
{
"head": "FDA",
"head_span": [
381,
384
],
"relation": "HYPONYM-OF",
"tail": "pr... | [
[
"operable definition",
"it"
],
[
"FDA",
"FDA"
]
] |
ECCV_1998_39_abs | [
[
"Image",
"sequence",
"processing",
"techniques",
"are",
"used",
"to",
"study",
"exchange",
",",
"growth,",
"and",
"transport",
"processes",
"and",
"to",
"tackle",
"key",
"questions",
"in",
"environmental",
"physics",
"and"... | [
"Image",
"sequence",
"processing",
"techniques",
"are",
"used",
"to",
"study",
"exchange",
",",
"growth,",
"and",
"transport",
"processes",
"and",
"to",
"tackle",
"key",
"questions",
"in",
"environmental",
"physics",
"and",
"biology.",
"These",
"applications",
"re... | Image sequence processing techniques are used to study exchange , growth, and transport processes and to tackle key questions in environmental physics and biology. These applications require high accuracy for the estimation of the motion field since the most interesting parameters of the dynamical processes studied are... | [
{
"end": 36,
"id": "T1",
"label": "Method",
"start": 0,
"text": "Image sequence processing techniques"
},
{
"end": 97,
"id": "T2",
"label": "Task",
"start": 55,
"text": "exchange , growth, and transport processes"
},
{
"end": 150,
"id": "T3",
"label": "Mat... | [
{
"head": "environmental physics",
"head_span": [
129,
150
],
"relation": "CONJUNCTION",
"tail": "biology",
"tail_span": [
155,
162
]
},
{
"head": "Image sequence processing techniques",
"head_span": [
0,
36
],
"relation": "USED-FOR... | [
[
"tensor method",
"tensor method"
],
[
"Image sequence processing techniques",
"techniques"
]
] |
ECCV_2006_13_abs | [
[
"In",
"spite",
"of",
"over",
"two",
"decades",
"of",
"intense",
"research,",
"illumination",
"and",
"pose",
"invariance",
"remain",
"prohibitively",
"challenging",
"aspects",
"of",
"face",
"recognition",
"for",
"most",
"pr... | [
"In",
"spite",
"of",
"over",
"two",
"decades",
"of",
"intense",
"research,",
"illumination",
"and",
"pose",
"invariance",
"remain",
"prohibitively",
"challenging",
"aspects",
"of",
"face",
"recognition",
"for",
"most",
"practical",
"applications.",
"The",
"objective... | In spite of over two decades of intense research, illumination and pose invariance remain prohibitively challenging aspects of face recognition for most practical applications. The objective of this work is to recognize faces using video sequences both for training and recognition input, in a realistic, unconstrained s... | [
{
"end": 62,
"id": "T1",
"label": "Task",
"start": 50,
"text": "illumination"
},
{
"end": 82,
"id": "T2",
"label": "Task",
"start": 67,
"text": "pose invariance"
},
{
"end": 143,
"id": "T3",
"label": "Task",
"start": 127,
"text": "face recognition"... | [
{
"head": "illumination",
"head_span": [
50,
62
],
"relation": "CONJUNCTION",
"tail": "pose invariance",
"tail_span": [
67,
82
]
},
{
"head": "pose invariance",
"head_span": [
67,
82
],
"relation": "PART-OF",
"tail": "face recog... | [
[
"fully automatic recognition system",
"system"
],
[
"video sequences",
"data set"
]
] |
ECCV_2012_29_abs | [
[
"This",
"paper",
"addresses",
"the",
"problem",
"of",
"optimal",
"alignment",
"of",
"non-rigid",
"surfaces",
"from",
"multi-view",
"video",
"observations",
"to",
"obtain",
"a",
"temporally",
"consistent",
"representation.",
"C... | [
"This",
"paper",
"addresses",
"the",
"problem",
"of",
"optimal",
"alignment",
"of",
"non-rigid",
"surfaces",
"from",
"multi-view",
"video",
"observations",
"to",
"obtain",
"a",
"temporally",
"consistent",
"representation.",
"Conventional",
"non-rigid",
"surface",
"tra... | This paper addresses the problem of optimal alignment of non-rigid surfaces from multi-view video observations to obtain a temporally consistent representation. Conventional non-rigid surface tracking performs frame-to-frame alignment which is subject to the accumulation of errors resulting in a drift over time. Recent... | [
{
"end": 75,
"id": "T1",
"label": "Task",
"start": 36,
"text": "optimal alignment of non-rigid surfaces"
},
{
"end": 110,
"id": "T2",
"label": "OtherScientificTerm",
"start": 81,
"text": "multi-view video observations"
},
{
"end": 159,
"id": "T3",
"label":... | [
{
"head": "multi-view video observations",
"head_span": [
81,
110
],
"relation": "USED-FOR",
"tail": "optimal alignment of non-rigid surfaces",
"tail_span": [
36,
75
]
},
{
"head": "optimal alignment of non-rigid surfaces",
"head_span": [
36,
... | [
[
"non-sequential tracking",
"non-sequential tracking approaches"
],
[
"local segments",
"segments"
],
[
"cluster tree",
"cluster tree",
"cluster tree"
]
] |
ECCV_2012_30_abs | [
[
"This",
"paper",
"considers",
"the",
"problem",
"of",
"reconstructing",
"the",
"motion",
"of",
"a",
"3D",
"articulated",
"tree",
"from",
"2D",
"point",
"correspondences",
"subject",
"to",
"some",
"temporal",
"prior.",
... | [
"This",
"paper",
"considers",
"the",
"problem",
"of",
"reconstructing",
"the",
"motion",
"of",
"a",
"3D",
"articulated",
"tree",
"from",
"2D",
"point",
"correspondences",
"subject",
"to",
"some",
"temporal",
"prior.",
"Hitherto,",
"smooth",
"motion",
"has",
"bee... | This paper considers the problem of reconstructing the motion of a 3D articulated tree from 2D point correspondences subject to some temporal prior. Hitherto, smooth motion has been encouraged using a trajectory basis, yielding a hard combinatorial problem with time complexity growing exponentially in the number of fra... | [
{
"end": 86,
"id": "T1",
"label": "Task",
"start": 36,
"text": "reconstructing the motion of a 3D articulated tree"
},
{
"end": 116,
"id": "T2",
"label": "OtherScientificTerm",
"start": 92,
"text": "2D point correspondences"
},
{
"end": 147,
"id": "T3",
"l... | [
{
"head": "trajectory basis",
"head_span": [
201,
217
],
"relation": "USED-FOR",
"tail": "smooth motion",
"tail_span": [
159,
172
]
},
{
"head": "Branch and bound strategies",
"head_span": [
325,
352
],
"relation": "USED-FOR",
"... | [
[
"time complexity",
"complexity"
],
[
"they",
"Branch and bound strategies"
],
[
"reconstructing the motion of a 3D articulated tree",
"reconstruction"
]
] |
ECCV_2012_37_abs | [
[
"The",
"goal",
"of",
"this",
"paper",
"is",
"to",
"discover",
"a",
"set",
"of",
"discriminative",
"patches",
"which",
"can",
"serve",
"as",
"a",
"fully",
"unsupervised",
"mid-level",
"visual",
"representation.",
"The",... | [
"The",
"goal",
"of",
"this",
"paper",
"is",
"to",
"discover",
"a",
"set",
"of",
"discriminative",
"patches",
"which",
"can",
"serve",
"as",
"a",
"fully",
"unsupervised",
"mid-level",
"visual",
"representation.",
"The",
"desired",
"patches",
"need",
"to",
"sati... | The goal of this paper is to discover a set of discriminative patches which can serve as a fully unsupervised mid-level visual representation. The desired patches need to satisfy two requirements: 1) to be representative, they need to occur frequently enough in the visual world; 2) to be discriminative, they need to be... | [
{
"end": 69,
"id": "T1",
"label": "Method",
"start": 47,
"text": "discriminative patches"
},
{
"end": 141,
"id": "T2",
"label": "Task",
"start": 97,
"text": "unsupervised mid-level visual representation"
},
{
"end": 384,
"id": "T3",
"label": "Generic",
... | [
{
"head": "discriminative patches",
"head_span": [
47,
69
],
"relation": "USED-FOR",
"tail": "unsupervised mid-level visual representation",
"tail_span": [
97,
141
]
},
{
"head": "image patches",
"head_span": [
580,
593
],
"relation... | [
[
"discriminative patches",
"discriminative patches",
"discrim-inative patches",
"they",
"patches",
"this"
],
[
"unsupervised mid-level visual representation",
"unsupervised mid-level visual representation"
]
] |
ECCV_2012_40_abs | [
[
"In",
"this",
"paper,",
"we",
"introduce",
"KAZE",
"features,",
"a",
"novel",
"multiscale",
"2D",
"feature",
"detection",
"and",
"description",
"algorithm",
"in",
"nonlinear",
"scale",
"spaces.",
"Previous",
"approaches",
... | [
"In",
"this",
"paper,",
"we",
"introduce",
"KAZE",
"features,",
"a",
"novel",
"multiscale",
"2D",
"feature",
"detection",
"and",
"description",
"algorithm",
"in",
"nonlinear",
"scale",
"spaces.",
"Previous",
"approaches",
"detect",
"and",
"describe",
"features",
"... | In this paper, we introduce KAZE features, a novel multiscale 2D feature detection and description algorithm in nonlinear scale spaces. Previous approaches detect and describe features at different scale levels by building or approximating the Gaussian scale space of an image. However, Gaussian blurring does not respec... | [
{
"end": 41,
"id": "T1",
"label": "Method",
"start": 28,
"text": "KAZE features"
},
{
"end": 108,
"id": "T2",
"label": "Method",
"start": 51,
"text": "multiscale 2D feature detection and description algorithm"
},
{
"end": 134,
"id": "T3",
"label": "OtherSc... | [
{
"head": "nonlinear scale spaces",
"head_span": [
112,
134
],
"relation": "FEATURE-OF",
"tail": "multiscale 2D feature detection and description algorithm",
"tail_span": [
51,
108
]
},
{
"head": "KAZE features",
"head_span": [
28,
41
]... | [
[
"localization accuracy and distinctiviness",
"localization accuracy and distinctiveness"
],
[
"KAZE features",
"features",
"results",
"2D features"
],
[
"nonlinear scale space",
"nonlinear scale space",
"nonlinear scale space"
]
] |
ECCV_2014_47_abs | [
[
"The",
"problem",
"of",
"predicting",
"image",
"or",
"video",
"interestingness",
"from",
"their",
"low-level",
"feature",
"representations",
"has",
"received",
"increasing",
"interest.",
"As",
"a",
"highly",
"subjective",
"vis... | [
"The",
"problem",
"of",
"predicting",
"image",
"or",
"video",
"interestingness",
"from",
"their",
"low-level",
"feature",
"representations",
"has",
"received",
"increasing",
"interest.",
"As",
"a",
"highly",
"subjective",
"visual",
"attribute,",
"annotating",
"the",
... | The problem of predicting image or video interestingness from their low-level feature representations has received increasing interest. As a highly subjective visual attribute, annotating the interesting-ness value of training data for learning a prediction model is challenging. To make the annotation less subjective a... | [
{
"end": 56,
"id": "T1",
"label": "Task",
"start": 15,
"text": "predicting image or video interestingness"
},
{
"end": 101,
"id": "T2",
"label": "Method",
"start": 68,
"text": "low-level feature representations"
},
{
"end": 175,
"id": "T3",
"label": "Other... | [
{
"head": "low-level feature representations",
"head_span": [
68,
101
],
"relation": "USED-FOR",
"tail": "predicting image or video interestingness",
"tail_span": [
15,
56
]
},
{
"head": "crowdsourcing tools",
"head_span": [
360,
379
],... | [
[
"way",
"approach"
]
] |
ECCV_2014_50_abs | [
[
"This",
"paper",
"presents",
"an",
"approach",
"to",
"estimate",
"the",
"intrinsic",
"texture",
"properties",
"(albedo,",
"shading,",
"normal)",
"of",
"scenes",
"from",
"multiple",
"view",
"acquisition",
"under",
"unknown",
... | [
"This",
"paper",
"presents",
"an",
"approach",
"to",
"estimate",
"the",
"intrinsic",
"texture",
"properties",
"(albedo,",
"shading,",
"normal)",
"of",
"scenes",
"from",
"multiple",
"view",
"acquisition",
"under",
"unknown",
"illumination",
"conditions.",
"We",
"intr... | This paper presents an approach to estimate the intrinsic texture properties (albedo, shading, normal) of scenes from multiple view acquisition under unknown illumination conditions. We introduce the concept of intrinsic textures, which are pixel-resolution surface textures representing the intrinsic appearance paramet... | [
{
"end": 31,
"id": "T1",
"label": "Generic",
"start": 23,
"text": "approach"
},
{
"end": 112,
"id": "T2",
"label": "Task",
"start": 48,
"text": "intrinsic texture properties (albedo, shading, normal) of scenes"
},
{
"end": 143,
"id": "T3",
"label": "Task",... | [
{
"head": "unknown illumination conditions",
"head_span": [
150,
181
],
"relation": "FEATURE-OF",
"tail": "multiple view acquisition",
"tail_span": [
118,
143
]
},
{
"head": "multiple view acquisition",
"head_span": [
118,
143
],
"r... | [
[
"intrinsic textures",
"pixel-resolution surface textures"
],
[
"approach",
"it",
"intrinsic image methods",
"method",
"approach"
],
[
"relight-ing of free-viewpoint rendering",
"relighting"
]
] |
ECCV_2016_100_abs | [
[
"In",
"this",
"paper,",
"we",
"present",
"an",
"approach",
"for",
"learning",
"a",
"visual",
"representation",
"from",
"the",
"raw",
"spatiotemporal",
"signals",
"in",
"videos.",
"Our",
"representation",
"is",
"learned",
... | [
"In",
"this",
"paper,",
"we",
"present",
"an",
"approach",
"for",
"learning",
"a",
"visual",
"representation",
"from",
"the",
"raw",
"spatiotemporal",
"signals",
"in",
"videos.",
"Our",
"representation",
"is",
"learned",
"without",
"supervision",
"from",
"semantic... | In this paper, we present an approach for learning a visual representation from the raw spatiotemporal signals in videos. Our representation is learned without supervision from semantic labels. We formulate our method as an unsupervised sequential verification task, i.e., we determine whether a sequence of frames from ... | [
{
"end": 37,
"id": "T1",
"label": "Generic",
"start": 29,
"text": "approach"
},
{
"end": 74,
"id": "T2",
"label": "Method",
"start": 53,
"text": "visual representation"
},
{
"end": 120,
"id": "T3",
"label": "Material",
"start": 84,
"text": "raw spa... | [
{
"head": "raw spatiotemporal signals in videos",
"head_span": [
84,
120
],
"relation": "USED-FOR",
"tail": "visual representation",
"tail_span": [
53,
74
]
},
{
"head": "approach",
"head_span": [
29,
37
],
"relation": "USED-FOR",
... | [
[
"visual representation",
"representation"
],
[
"approach",
"method",
"our method",
"Our method",
"method"
],
[
"unsupervised sequential verification task",
"task"
],
[
"visual representation",
"representation"
]
] |
ECCV_2016_107_abs | [
[
"Diagrams",
"are",
"common",
"tools",
"for",
"representing",
"complex",
"concepts",
",",
"relationships",
"and",
"events,",
"often",
"when",
"it",
"would",
"be",
"difficult",
"to",
"portray",
"the",
"same",
"information",
... | [
"Diagrams",
"are",
"common",
"tools",
"for",
"representing",
"complex",
"concepts",
",",
"relationships",
"and",
"events,",
"often",
"when",
"it",
"would",
"be",
"difficult",
"to",
"portray",
"the",
"same",
"information",
"with",
"natural",
"images.",
"Understandi... | Diagrams are common tools for representing complex concepts , relationships and events, often when it would be difficult to portray the same information with natural images. Understanding natural images has been extensively studied in computer vision, while diagram understanding has received little attention. In this p... | [
{
"end": 8,
"id": "T1",
"label": "Method",
"start": 0,
"text": "Diagrams"
},
{
"end": 59,
"id": "T2",
"label": "OtherScientificTerm",
"start": 43,
"text": "complex concepts"
},
{
"end": 75,
"id": "T3",
"label": "OtherScientificTerm",
"start": 62,
"... | [
{
"head": "Diagrams",
"head_span": [
0,
8
],
"relation": "USED-FOR",
"tail": "complex concepts",
"tail_span": [
43,
59
]
},
{
"head": "Diagrams",
"head_span": [
0,
8
],
"relation": "USED-FOR",
"tail": "relationships",
"tail_... | [
[
"natural images",
"natural images"
],
[
"diagram interpretation and reasoning",
"task"
],
[
"Diagram Parse Graphs (DPG)",
"DPGs",
"DPGs"
],
[
"diagram question answering",
"diagram question answering"
],
[
"syntactic parsing of diagrams",
"syntactic pars... |
ECCV_2016_110_abs | [
[
"Recent",
"progress",
"in",
"computer",
"vision",
"has",
"been",
"driven",
"by",
"high-capacity",
"models",
"trained",
"on",
"large",
"datasets.",
"Unfortunately,",
"creating",
"large",
"datasets",
"with",
"pixel-level",
"labe... | [
"Recent",
"progress",
"in",
"computer",
"vision",
"has",
"been",
"driven",
"by",
"high-capacity",
"models",
"trained",
"on",
"large",
"datasets.",
"Unfortunately,",
"creating",
"large",
"datasets",
"with",
"pixel-level",
"labels",
"has",
"been",
"extremely",
"costly... | Recent progress in computer vision has been driven by high-capacity models trained on large datasets. Unfortunately, creating large datasets with pixel-level labels has been extremely costly due to the amount of human effort required. In this paper, we present an approach to rapidly creating pixel-accurate semantic lab... | [
{
"end": 34,
"id": "T1",
"label": "Task",
"start": 19,
"text": "computer vision"
},
{
"end": 74,
"id": "T2",
"label": "Method",
"start": 54,
"text": "high-capacity models"
},
{
"end": 100,
"id": "T3",
"label": "Material",
"start": 86,
"text": "larg... | [
{
"head": "pixel-level labels",
"head_span": [
146,
164
],
"relation": "FEATURE-OF",
"tail": "large datasets",
"tail_span": [
126,
140
]
},
{
"head": "high-capacity models",
"head_span": [
54,
74
],
"relation": "USED-FOR",
"tail... | [
[
"large datasets",
"large datasets"
]
] |
ECCV_2016_204_abs | [
[
"Our",
"goal",
"is",
"to",
"learn",
"a",
"Mahalanobis",
"distance",
"by",
"minimizing",
"a",
"loss",
"defined",
"on",
"the",
"weighted",
"sum",
"of",
"the",
"precision",
"at",
"different",
"ranks.",
"Our",
"core",
... | [
"Our",
"goal",
"is",
"to",
"learn",
"a",
"Mahalanobis",
"distance",
"by",
"minimizing",
"a",
"loss",
"defined",
"on",
"the",
"weighted",
"sum",
"of",
"the",
"precision",
"at",
"different",
"ranks.",
"Our",
"core",
"motivation",
"is",
"that",
"minimizing",
"a... | Our goal is to learn a Mahalanobis distance by minimizing a loss defined on the weighted sum of the precision at different ranks. Our core motivation is that minimizing a weighted rank loss is a natural criterion for many problems in computer vision such as person re-identification. We propose a novel metric learning f... | [
{
"end": 43,
"id": "T1",
"label": "Task",
"start": 23,
"text": "Mahalanobis distance"
},
{
"end": 64,
"id": "T2",
"label": "OtherScientificTerm",
"start": 60,
"text": "loss"
},
{
"end": 92,
"id": "T3",
"label": "OtherScientificTerm",
"start": 80,
"... | [
{
"head": "loss",
"head_span": [
60,
64
],
"relation": "USED-FOR",
"tail": "Mahalanobis distance",
"tail_span": [
23,
43
]
},
{
"head": "person re-identification",
"head_span": [
258,
282
],
"relation": "HYPONYM-OF",
"tail": "co... | [
[
"loss",
"weighted rank loss"
],
[
"person re-identification datasets",
"them"
],
[
"non-linear extension of WARCA",
"method"
],
[
"Weighted Approximate Rank Component Analysis (WARCA)",
"WARCA"
]
] |
ECCV_2016_205_abs | [
[
"Two",
"main",
"classes",
"of",
"approaches",
"have",
"been",
"studied",
"to",
"perform",
"monocular",
"nonrigid",
"3D",
"reconstruction:",
"Template-based",
"methods",
"and",
"Non-rigid",
"Structure",
"from",
"Motion",
"techn... | [
"Two",
"main",
"classes",
"of",
"approaches",
"have",
"been",
"studied",
"to",
"perform",
"monocular",
"nonrigid",
"3D",
"reconstruction:",
"Template-based",
"methods",
"and",
"Non-rigid",
"Structure",
"from",
"Motion",
"techniques.",
"While",
"the",
"first",
"ones"... | Two main classes of approaches have been studied to perform monocular nonrigid 3D reconstruction: Template-based methods and Non-rigid Structure from Motion techniques. While the first ones have been applied to reconstruct poorly-textured surfaces, they assume the availability of a 3D shape model prior to reconstructio... | [
{
"end": 30,
"id": "T1",
"label": "Generic",
"start": 20,
"text": "approaches"
},
{
"end": 96,
"id": "T2",
"label": "Task",
"start": 60,
"text": "monocular nonrigid 3D reconstruction"
},
{
"end": 120,
"id": "T3",
"label": "Method",
"start": 98,
"te... | [
{
"head": "approaches",
"head_span": [
20,
30
],
"relation": "USED-FOR",
"tail": "monocular nonrigid 3D reconstruction",
"tail_span": [
60,
96
]
},
{
"head": "Template-based methods",
"head_span": [
98,
120
],
"relation": "HYPONYM-O... | [
[
"Template-based methods",
"ones",
"they"
],
[
"ones",
"Non-rigid Structure from Motion techniques"
],
[
"template-free approach",
"approach"
],
[
"3D reconstruction",
"monocular nonrigid 3D reconstruction",
"3D reconstructions",
"reconstruction"
]
] |
ECCV_2016_212_abs | [
[
"Person",
"re-identification",
"is",
"challenging",
"due",
"to",
"the",
"large",
"variations",
"of",
"pose,",
"illumination,",
"occlusion",
"and",
"camera",
"view.",
"Owing",
"to",
"these",
"variations,",
"the",
"pedestrian",
... | [
"Person",
"re-identification",
"is",
"challenging",
"due",
"to",
"the",
"large",
"variations",
"of",
"pose,",
"illumination,",
"occlusion",
"and",
"camera",
"view.",
"Owing",
"to",
"these",
"variations,",
"the",
"pedestrian",
"data",
"is",
"distributed",
"as",
"hi... | Person re-identification is challenging due to the large variations of pose, illumination, occlusion and camera view. Owing to these variations, the pedestrian data is distributed as highly-curved manifolds in the feature space, despite the current convolutional neural networks (CNN)'s capability of feature extraction.... | [
{
"end": 24,
"id": "T1",
"label": "Task",
"start": 0,
"text": "Person re-identification"
},
{
"end": 75,
"id": "T2",
"label": "OtherScientificTerm",
"start": 71,
"text": "pose"
},
{
"end": 89,
"id": "T3",
"label": "OtherScientificTerm",
"start": 77,
... | [
{
"head": "convolutional neural networks (CNN)",
"head_span": [
249,
284
],
"relation": "USED-FOR",
"tail": "feature extraction",
"tail_span": [
301,
319
]
},
{
"head": "highly-curved manifolds",
"head_span": [
183,
206
],
"relation... | [
[
"Person re-identification",
"person re-identification",
"person re-identification",
"person re-identification"
]
] |
ECCV_2016_215_abs | [
[
"Joint",
"image",
"filters",
"can",
"leverage",
"the",
"guidance",
"image",
"as",
"a",
"prior",
"and",
"transfer",
"the",
"structural",
"details",
"from",
"the",
"guidance",
"image",
"to",
"the",
"target",
"image",
... | [
"Joint",
"image",
"filters",
"can",
"leverage",
"the",
"guidance",
"image",
"as",
"a",
"prior",
"and",
"transfer",
"the",
"structural",
"details",
"from",
"the",
"guidance",
"image",
"to",
"the",
"target",
"image",
"for",
"suppressing",
"noise",
"or",
"enhanci... | Joint image filters can leverage the guidance image as a prior and transfer the structural details from the guidance image to the target image for suppressing noise or enhancing spatial resolution. Existing methods rely on various kinds of explicit filter construction or hand-designed objective functions. It is thus di... | [
{
"end": 19,
"id": "T1",
"label": "Method",
"start": 0,
"text": "Joint image filters"
},
{
"end": 51,
"id": "T2",
"label": "Material",
"start": 37,
"text": "guidance image"
},
{
"end": 122,
"id": "T3",
"label": "Material",
"start": 108,
"text": "gu... | [
{
"head": "explicit filter construction",
"head_span": [
240,
268
],
"relation": "USED-FOR",
"tail": "Existing methods",
"tail_span": [
198,
214
]
},
{
"head": "hand-designed objective functions",
"head_span": [
272,
305
],
"relatio... | [
[
"methods",
"Existing methods",
"them"
],
[
"learning-based approach",
"method",
"model"
],
[
"Joint image filters",
"joint filter",
"joint filter"
]
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.