Taxicab geometry

Known as: City block norm, L1-norm, City-block metric 
Taxicab geometry, considered by Hermann Minkowski in 19th-century Germany, is a form of geometry in which the usual distance function of metric or… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1968-2017
010020030019682017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
It is now well understood that (1) it is possible to reconstruct sparse signals exactly from what appear to be highly incomplete… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Variational methods are among the most successful approaches to calculate the optical flow between two image frames. A… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We study the notion of Compressed Sensing (CS) as put forward in [14] and related work [20, 3, 4]. The basic idea behind CS is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
In this paper, we introduce a new feature-based steganalytic method for JPEG images and use it as a benchmark for comparing JPEG… (More)
  • table 1
  • figure 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Existing studies on time series are based on two categories of distance functions. The first category consists of the Lp-norms… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 8
  • figure 9
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Suppose a discrete-time signal ( ), 0 , is a superposition of atoms taken from a combined time–frequency dictionary made of spike… (More)
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The time-frequency and time-scale communities have recently developed a large number of overcomplete waveform dictionaries… (More)
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
  • figure 2.5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
or perhaps with a forcing term g(u, x, t) on the right-hand side. Here u 5 (u1 , ..., um), f 5 (f1 , ..., fd), x 5 (x1 , ..., xd… (More)
  • figure 1
  • table III
  • table IV
  • table VI
  • table VII
Is this relevant?
Highly Cited
1968
Highly Cited
1968
This paper describes algori thms for comput ing various functions on a digital picture which depend on the distance to a given… (More)
  • figure 6
  • figure 19
  • figure 20
  • figure 22
  • figure 24
Is this relevant?