Please wait, while we are loading the content...
Please wait, while we are loading the content...
Content Provider | ACM Digital Library |
---|---|
Author | Brinn, L. W. |
Abstract | A central problem in computer vision is that of determining whether a given object O appears in a scene S. We outline a general method of solution applicable to r dimensional location spaces, where r<=2. Spaces of dimension r < 3 may occur when it is necessary to identify not only spatial position but also the time and conditions under which observations were made (type of equipment used, etc.).We assume that the scene S is a bounded region in r dimensional Euclidean space (Rr), and we consider the object O as represented by the values of a given feature function f at certain distinguished points p1, p2,…,pn on O. If Q is the polyhedron in Rr with vertices p1,p2,…,pn, we refer to Q as the query polyhedron. We suppose that a metric d is defined for feature values and that a tolerance t = (t1,t2,…,tn), has been given.For each i, l ≤ i ≤ n, let Ri be the set of points p in S for which d(f(p),f(pi)) ≤ ti. We refer to the Ri as the object polyhedra and say that the object O has been found in S to within the tolerance t iff there exists a translation T of the query polyhedron Q with T(pi) ε Ri for each i. The original problem is now a problem in computational geometry. This approach is due to W. Grosky.We consider the restricted problem in which each Ri is a closed nonempty convex polyhedron. The Ri need not be disjoint, nor is there any restriction (beyond convexity) on their shape. We assume that each Ri is given as the solution set of a system Li of ki linear inequalities (that is, as an intersection of ki closed halfspaces). The representation is convenient for higher dimensional spaces. We can determine whether the translation T exists in time O(k), where k = k1 + k2 + … + kn.The approach is to translate not Q, but the object polyhedra Ri. For each i, 2 ≤ i ≤ n, let Ti be the unique translation in Rr with Ti(pi) = p1, and let Ri′ = Ti(Ri). There is a translation T with T(pi)ε Ri for each i iff there is a translation T with T(p1) ε R = R1∩ R2'∩ R3'∩…∩Rn'. Thus, the required translation T exists iff R is nonempty. For 2 ≤ i ≤ n, the linear system Li′ which defines Ri′ can be found from the system Li in time O(ki) by a simple change of variable applied to each inequality in Li separately. The linear system L consisting of the conjunction L1⋏L2′⋏ L3′⋏…⋏Ln′ to be satisfied by the coordinates of p1 can thus be constructed in time O(k). This system consists of k linear constraints and defines the feasible region of a r variable linear programming problem. The method of N. Megiddo [1] will find a point p in the feasible set or characterize the set as empty in time O(k). The translation T is then defined by the requirement that T(p1) = p.By an optimal translation T of Q we mean one which minimizes (or maximizes) some linear function h of r variables at T(p1). If r = 4, for example, we may wish to locate object O when it first appears in S (that is, to minimize h(x,y,z,t) = t = 0x+0y+0z+1t). By the method outlined above, an optimal translation T may be found in time 0(k) if the feasible set is nonempty.Additional results have been obtained concerning nontranslational motion of the query polyhedron Q and more general matching conditions. |
File Format | |
ISBN | 0897912187 |
DOI | 10.1145/322917.323061 |
Language | English |
Publisher | Association for Computing Machinery (ACM) |
Publisher Date | 1987-02-01 |
Publisher Place | New York |
Access Restriction | Subscribed |
Content Type | Text |
Resource Type | Article |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
Sl. | Authority | Responsibilities | Communication Details |
---|---|---|---|
1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
Loading...
|