@conference {14845,
	title = {Using the inner-distance for classification of articulated shapes},
	booktitle = {Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on},
	volume = {2},
	year = {2005},
	month = {2005/06//},
	pages = {719 - 726 vol. 2 - 719 - 726 vol. 2},
	abstract = {We propose using the inner-distance between landmark points to build shape descriptors. The inner-distance is defined as the length of the shortest path between landmark points within the shape silhouette. We show that the inner-distance is articulation insensitive and more effective at capturing complex shapes with part structures than Euclidean distance. To demonstrate this idea, it is used to build a new shape descriptor based on shape contexts. After that, we design a dynamic programming based method for shape matching and comparison. We have tested our approach on a variety of shape databases including an articulated shape dataset, MPEG7 CE-Shape-1, Kimia silhouettes, a Swedish leaf database and a human motion silhouette dataset. In all the experiments, our method demonstrates effective performance compared with other algorithms.},
	keywords = {articulated, CE-Shape-1, classification;, database;, databases;, dataset;, descriptor;, dynamic, human, image, inner-distance;, Kimia, landmark, leaf, matching;, MOTION, MPEG7, points;, programming;, SHAPE, silhouette, silhouette;, Swedish, visual},
	doi = {10.1109/CVPR.2005.362},
	author = {Ling,H. and Jacobs, David W.}
}
@conference {18190,
	title = {Data hiding in curves for collusion-resistant digital fingerprinting},
	booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on},
	volume = {1},
	year = {2004},
	month = {2004/10//},
	pages = {51 - 54 Vol. 1 - 51 - 54 Vol. 1},
	abstract = {This paper presents a new data hiding method for curves. The proposed algorithm parameterizes a curve using the B-spline model and adds a spread spectrum sequence in the coordinates of the B-spline control points. We demonstrate through experiments the robustness of the proposed data hiding algorithm against printing-and-scanning and collusions, and show its feasibility for collusion-resistant fingerprinting of topographic maps as well as writings/drawings from pen-based input devices.},
	keywords = {(mathematics);, B-spline, coding;, collusion-resistant, CONTROL, data, devices;, digital, document, encapsulation;, extraction;, feature, fingerprinting;, hiding;, image, INPUT, maps;, model;, pen-based, points;, printing-and-scanning, processing;, robustness;, sequence;, spectrum, splines, spread, topographic, watermarking;},
	doi = {10.1109/ICIP.2004.1418687},
	author = {Gou,Hongmei and M. Wu}
}
@conference {12315,
	title = {Finding close friends on the Internet},
	booktitle = {Network Protocols, 2001. Ninth International Conference on},
	year = {2001},
	month = {2001/11//},
	pages = {301 - 309},
	abstract = {We consider the problem of finding nearby application-peers (close friends) over the Internet. We focus on unicast-only solutions and introduce a new scheme -Beaconing-for finding peers that are near. Our scheme uses distance measurement points (called beacons) and can be implemented entirely in the application-layer without investing in large infrastructure changes. We present an extensive evaluation of Beaconing and compare it to existing schemes including Expanding Ring searches and Triangulation. Our experiments show that 3-8 beacons are sufficient to provide efficient peer-location service on 10 000 node Internet-like topologies. Further, our results are 2-5 times more accurate than existing techniques. We also present results from an implementation of Beaconing over a non-trivial wide-area testbed. In our experiments, Beaconing is able to efficiently (< 3 K Bytes and < 50 packets on average), quickly (< 1 second on average), and accurately (< 20 ms error on average) find nearby peers on the Internet.},
	keywords = {application-layer;, application-peers;, Beaconing;, beacons;, close, distance, Expanding, friends;, Internet-like, Internet;, IP;, measurement, nearby, network, peer-location, points;, protocols;, Ring, searches;, service;, solutions;, testbed;, topologies;, topology;, transport, Triangulation;, unicast-only, wide-area},
	doi = {10.1109/ICNP.2001.992910},
	author = {Kommareddy,C. and Shankar,N. and Bhattacharjee, Bobby}
}
@conference {14881,
	title = {Segmenting independently moving, noisy points},
	booktitle = {Motion of Non-Rigid and Articulated Objects, 1994., Proceedings of the 1994 IEEE Workshop on},
	year = {1994},
	month = {1994/11//},
	pages = {96 - 103},
	abstract = {There has been much work on using point features tracked through a video sequence to determine structure and motion. In many situations, to use this work, we must first isolate subsets of points that share a common motion. This is hard because we must distinguish between independent motions and apparent deviations from a single motion due to noise. We propose several methods of searching for point-sets with consistent 3D motions. We analyze the potential sensitivity of each method for detecting independent motions, and experiment with each method on a real image sequence},
	keywords = {3D, common, consistent, estimation;, features;, image, independently, linear, MOTION, motion;, moving, noisy, point, points;, programming;, real, segmentation;, sequence;, sequences;, video},
	doi = {10.1109/MNRAO.1994.346249},
	author = {Jacobs, David W. and Chennubhotla,C.}
}
@conference {14838,
	title = {2D images of 3-D oriented points},
	booktitle = {Computer Vision and Pattern Recognition, 1993. Proceedings CVPR {\textquoteright}93., 1993 IEEE Computer Society Conference on},
	year = {1993},
	month = {1993/06//},
	pages = {226 - 232},
	abstract = {A number of vision problems have been shown to become simpler when one models projection from 3-D to 2-D as a nonrigid linear transformation. These results have been largely restricted to models and scenes that consist only of 3-D points. It is shown that, with this projection model, several vision tasks become fundamentally more complex in the somewhat more complicated domain of oriented points. More space is required for indexing models in a database, more images are required to derive structure from motion, and new views of an object cannot be synthesized linearly from old views},
	keywords = {2D, 3-D, database, derivation;, image, images;, indexing;, linear, model, nonrigid, oriented, points;, processing;, recovery;, structure-form-motion, structure-from-motion, transformation;},
	doi = {10.1109/CVPR.1993.340985},
	author = {Jacobs, David W.}
}
@conference {15207,
	title = {Efficient minimum cost matching using quadrangle inequality},
	booktitle = {Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on},
	year = {1992},
	month = {1992/10//},
	pages = {583 - 592},
	abstract = {The authors present efficient algorithms for finding a minimum cost perfect matching, and for solving the transportation problem in bipartite graphs, G = (Red cup; Blue, Red times; Blue), where |Red| = n, |Blue| = m, n les; m, and the cost function obeys the quadrangle inequality. The first results assume that all the red points and all the blue points lie on a curve that is homeomorphic to either a line or a circle and the cost function is given by the Euclidean distance along the curve. They present a linear time algorithm for the matching problem. They generalize the method to solve the corresponding transportation problem in O((m+n)log(m+n)) time. The next result is an O(n log m) algorithm for minimum cost matching when the cost array is a bitonic Monge array. An example of this is when the red points lie on one straight line and the blue points lie on another straight line (that is not necessarily parallel to the first one). Finally, they provide a weakly polynomial algorithm for the transportation problem in which the associated cost array is a bitonic Monge array},
	keywords = {algorithm;, array;, bipartite, bitonic, blue, complexity;, computational, cost, distance;, Euclidean, function;, geometry;, graph, graphs;, inequality;, linear, MATCHING, matching;, minimisation;, minimum, Monge, perfect, points;, polynomial, problem;, quadrangle, red, theory;, TIME, transportation, transportation;, weakly},
	doi = {10.1109/SFCS.1992.267793},
	author = {Aggarwal,A. and Bar-Noy,A. and Khuller, Samir and Kravets,D. and Schieber,B.}
}
