A fast computational approach for illusory contour reconstruction
Illusory contour reconstruction can be modeled as a minimization problem with a tractable variational level set formulation, utilizing Euler’s elastica to reconstruct the illusory boundaries. However, this kind of formulation is very difficult to solve numerically as it is hard to implement such opt...
| Main Authors: | , , , |
|---|---|
| Format: | Journal Article |
| Published: |
Springer
2018
|
| Online Access: | http://hdl.handle.net/20.500.11937/71774 |
| _version_ | 1848762568979513344 |
|---|---|
| author | Tan, L. Liu, Wan-Quan Li, L. Pan, Z. |
| author_facet | Tan, L. Liu, Wan-Quan Li, L. Pan, Z. |
| author_sort | Tan, L. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | Illusory contour reconstruction can be modeled as a minimization problem with a tractable variational level set formulation, utilizing Euler’s elastica to reconstruct the illusory boundaries. However, this kind of formulation is very difficult to solve numerically as it is hard to implement such optimization algorithms efficiently in practice. In this paper, we propose an equivalently reduced variational level set formulation by taking the level set functions as signed distance functions. Technically, an alternating direction method of multipliers (ADMM) is developed by introducing some auxiliary variables, Lagrange multipliers and applying an alternating optimization strategy. With the proposed ADMM method, the minimization problem can be transformed into a series of sub-problems, which can be solved easily via using the Gauss-Seidel iterations and Fast Fourier Transform (FFT). The corresponding level set functions are regarded as signed distance functions during computation process using a simple algebraic projection method, which avoids the traditional re-initialization process for conventional level set functions. Extensive experiments have been conducted on both synthetic and real images, which validated the proposed approach, and demonstrated the advantages of the proposed ADMM-Projection (ADMM-P) method over the existing algorithms based on traditional gradient descent method (GDM) in terms of computational efficiency. |
| first_indexed | 2025-11-14T10:49:39Z |
| format | Journal Article |
| id | curtin-20.500.11937-71774 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T10:49:39Z |
| publishDate | 2018 |
| publisher | Springer |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-717742019-05-23T03:38:19Z A fast computational approach for illusory contour reconstruction Tan, L. Liu, Wan-Quan Li, L. Pan, Z. Illusory contour reconstruction can be modeled as a minimization problem with a tractable variational level set formulation, utilizing Euler’s elastica to reconstruct the illusory boundaries. However, this kind of formulation is very difficult to solve numerically as it is hard to implement such optimization algorithms efficiently in practice. In this paper, we propose an equivalently reduced variational level set formulation by taking the level set functions as signed distance functions. Technically, an alternating direction method of multipliers (ADMM) is developed by introducing some auxiliary variables, Lagrange multipliers and applying an alternating optimization strategy. With the proposed ADMM method, the minimization problem can be transformed into a series of sub-problems, which can be solved easily via using the Gauss-Seidel iterations and Fast Fourier Transform (FFT). The corresponding level set functions are regarded as signed distance functions during computation process using a simple algebraic projection method, which avoids the traditional re-initialization process for conventional level set functions. Extensive experiments have been conducted on both synthetic and real images, which validated the proposed approach, and demonstrated the advantages of the proposed ADMM-Projection (ADMM-P) method over the existing algorithms based on traditional gradient descent method (GDM) in terms of computational efficiency. 2018 Journal Article http://hdl.handle.net/20.500.11937/71774 10.1007/s11042-018-6546-8 Springer restricted |
| spellingShingle | Tan, L. Liu, Wan-Quan Li, L. Pan, Z. A fast computational approach for illusory contour reconstruction |
| title | A fast computational approach for illusory contour reconstruction |
| title_full | A fast computational approach for illusory contour reconstruction |
| title_fullStr | A fast computational approach for illusory contour reconstruction |
| title_full_unstemmed | A fast computational approach for illusory contour reconstruction |
| title_short | A fast computational approach for illusory contour reconstruction |
| title_sort | fast computational approach for illusory contour reconstruction |
| url | http://hdl.handle.net/20.500.11937/71774 |