Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | ACM Digital Library |
|---|---|
| Author | Peter, Adrian M. Moyou, Mark Gurumoorthy, Karthik S. Rangarajan, Anand |
| Abstract | For over 30 years, the static Hamilton-Jacobi (HJ) equation, specifically its incarnation as the eikonal equation, has been a bedrock for a plethora of computer vision models, including popular applications such as shape-from-shading, medial axis representations, level-set segmentation, and geodesic processing (i.e. path planning). Numerical solutions to this nonlinear partial differential equation have long relied on staples like fast marching and fast sweeping algorithms—approaches which rely on intricate convergence analysis, approximations, and specialized implementations. Here, we present a new variational functional on a scalar field comprising a spatially varying quadratic term and a standard regularization term. The Euler-Lagrange equation corresponding to the new functional is a linear differential equation which when discretized results in a linear system of equations. This approach leads to many algorithm choices since there are myriad efficient sparse linear solvers. The limiting behavior, for a particular case, of this linear differential equation can be shown to converge to the nonlinear eikonal. In addition, our approach eliminates the need to explicitly construct viscosity solutions as customary with direct solutions to the eikonal. Though our solution framework is applicable to the general class of eikonal problems, we detail specifics for the popular vision applications of shape-from-shading, vessel segmentation, and path planning. We showcase experimental results on a variety of images and complex mazes, in which we hold our own against state-of-the art fast marching and fast sweeping techniques, while retaining the considerable advantages of a linear systems approach. |
| Starting Page | 1 |
| Ending Page | 8 |
| Page Count | 8 |
| File Format | |
| ISBN | 9781450330619 |
| DOI | 10.1145/2683483.2683498 |
| Language | English |
| Publisher | Association for Computing Machinery (ACM) |
| Publisher Date | 2014-12-14 |
| Publisher Place | New York |
| Access Restriction | Subscribed |
| Subject Keyword | Eikonal eq-uation Quantum mechanics Path planning Screened poisson equation Hamilton-jacobi equation Schrödinger equation Sparse linear systems |
| 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...
|