## Waltz Filtering in Java with JSolver (1999)

Venue: | In PA Java'99 |

Citations: | 1 - 0 self |

### BibTeX

@INPROCEEDINGS{Chun99waltzfiltering,

author = {Andy Hon Wai Chun and Andy Hon and Wai Chun},

title = {Waltz Filtering in Java with JSolver},

booktitle = {In PA Java'99},

year = {1999}

}

### OpenURL

### Abstract

This paper uses the Waltz Filtering Algorithm and the Line-Labelling Problem to illustrate how AI algorithms can easily be implemented using Java and JSolver 2 -- a constraint-programming class library. The Waltz Filtering Algorithm popularised the technique of constraint propagation -- the cornerstone for algorithms to solve constraint-satisfaction problems (CSP). It was initially developed as a computer-vision algorithm to interpret line drawings of threedimensional scenes. This algorithm was originally implemented in MicroPlanner and Lisp. Although most AI algorithms were invented using either Lisp or Prolog, many commercial applications require the use of modern computer languages such as Java. In this paper, we will illustrate how a line-labelling program can developed using constraint-programming techniques provided by JSolver. JSolver implements advanced AI techniques such as constraint propagation, declarative programming, and non-deterministic search in Java. Th...

### Citations

1000 |
Consistency in networks of relations
- Mackworth
- 1977
(Show Context)
Citation Context ... Advanced Object Technologies Ltd., a high-tech company specialising in resource optimisation systems. 2 JSolver is available for download from http://www.aotl.comstechnique of constraint propagation =-=[4, 10]-=-. Constraint propagation combined with non-deterministic search became a success paradigm to solve constraint-satisfaction problems (CSP) [2, 8, 14, 15, 16]. In recent years, CSP algorithms have be us... |

371 | Algorithms for Constraint-Satisfaction Problems: A Survey
- Kumar
- 1992
(Show Context)
Citation Context ...ttp://www.aotl.comstechnique of constraint propagation [4, 10]. Constraint propagation combined with non-deterministic search became a success paradigm to solve constraint-satisfaction problems (CSP) =-=[2, 8, 14, 15, 16]-=-. In recent years, CSP algorithms have be used successfully to solve many different types of real life problems [9, 12], such as resource allocation, job-shop scheduling, timetabling, and duty rosteri... |

350 | Understanding line drawings of scenes with shadows
- Waltz
- 1975
(Show Context)
Citation Context ...nstraint propagation, declarative programming, and non-deterministic search in Java. These techniques have been successfully used for scheduling and resource allocation systems. 1. INTRODUCTION Waltz =-=[17, 18]-=- initially proposed the filtering algorithm as a way to reduce combinatorics associated with line labelling of three-dimensional scenes. This algorithm popularised the technique of constraint propagat... |

289 |
An introduction to Prolog III
- COLMERAUER
- 1990
(Show Context)
Citation Context ...ttp://www.aotl.comstechnique of constraint propagation [4, 10]. Constraint propagation combined with non-deterministic search became a success paradigm to solve constraint-satisfaction problems (CSP) =-=[2, 8, 14, 15, 16]-=-. In recent years, CSP algorithms have be used successfully to solve many different types of real life problems [9, 12], such as resource allocation, job-shop scheduling, timetabling, and duty rosteri... |

173 |
On seeing things
- Clowes
- 1971
(Show Context)
Citation Context ...lected from a finite set of possible labels. Each label provides specific semantic information on the nature of the edge and the regions on each of its sides. This approach to analysing line drawings =-=[3, 1, 5]-=- was extended by Waltz to include shadows and cracks. Waltz also enhanced the line-labelling search with his filtering algorithm. For illustration purposes, this paper will only use a small subset of ... |

154 |
Impossible objects as nonsense sentences
- Huffman
- 1971
(Show Context)
Citation Context ...lected from a finite set of possible labels. Each label provides specific semantic information on the nature of the edge and the regions on each of its sides. This approach to analysing line drawings =-=[3, 1, 5]-=- was extended by Waltz to include shadows and cracks. Waltz also enhanced the line-labelling search with his filtering algorithm. For illustration purposes, this paper will only use a small subset of ... |

144 |
Generating semantic descriptions from drawings of scenes with shadows
- Waltz
- 1975
(Show Context)
Citation Context ...nstraint propagation, declarative programming, and non-deterministic search in Java. These techniques have been successfully used for scheduling and resource allocation systems. 1. INTRODUCTION Waltz =-=[17, 18]-=- initially proposed the filtering algorithm as a way to reduce combinatorics associated with line labelling of three-dimensional scenes. This algorithm popularised the technique of constraint propagat... |

123 | A C++ Implementation of CLP
- Puget
- 1994
(Show Context)
Citation Context ...the line labels at both ends of an edge must agree. Although constraint programming has a relatively long history [15], with constraint language extensions found in Prolog [2, 16], Lisp [14], and C++ =-=[6, 9, 11]-=-, it is only recently that constraint-programming techniques can be found in Java [7]. The example line-labelling problem in this paper is implemented using the JSolver constraint-programming class li... |

41 | Nondeterministic lisp as a substrate for constraint logic programming
- Siskind, McAllester
- 1993
(Show Context)
Citation Context ...ttp://www.aotl.comstechnique of constraint propagation [4, 10]. Constraint propagation combined with non-deterministic search became a success paradigm to solve constraint-satisfaction problems (CSP) =-=[2, 8, 14, 15, 16]-=-. In recent years, CSP algorithms have be used successfully to solve many different types of real life problems [9, 12], such as resource allocation, job-shop scheduling, timetabling, and duty rosteri... |

23 |
Computer Recognition of Three-Dimensional Objects in a Visual Scene. Tech Rept MAC-TR-59
- Guzman
- 1968
(Show Context)
Citation Context ...lected from a finite set of possible labels. Each label provides specific semantic information on the nature of the edge and the regions on each of its sides. This approach to analysing line drawings =-=[3, 1, 5]-=- was extended by Waltz to include shadows and cracks. Waltz also enhanced the line-labelling search with his filtering algorithm. For illustration purposes, this paper will only use a small subset of ... |

14 |
The Definition and Implementation of a Computer Programming Language Based on Constraints
- Jr, L
- 1980
(Show Context)
Citation Context |

8 |
Using Object-Oriented Constraint Programming Tools to Implement Flexible `Easy to Use' Scheduling Systems
- Pape
- 1993
(Show Context)
Citation Context ...me a success paradigm to solve constraint-satisfaction problems (CSP) [2, 8, 14, 15, 16]. In recent years, CSP algorithms have be used successfully to solve many different types of real life problems =-=[9, 12]-=-, such as resource allocation, job-shop scheduling, timetabling, and duty rostering. The Waltz Filtering Algorithm was originally implemented in Micro-Planner and Lisp. However, software technology ha... |

6 |
Object-Oriented Constraint Programming for Transportation Problems
- Puget
- 1992
(Show Context)
Citation Context ...me a success paradigm to solve constraint-satisfaction problems (CSP) [2, 8, 14, 15, 16]. In recent years, CSP algorithms have be used successfully to solve many different types of real life problems =-=[9, 12]-=-, such as resource allocation, job-shop scheduling, timetabling, and duty rostering. The Waltz Filtering Algorithm was originally implemented in Micro-Planner and Lisp. However, software technology ha... |

1 |
The consistent labeling problem: Part 1
- Cambridge
- 1968
(Show Context)
Citation Context ... Advanced Object Technologies Ltd., a high-tech company specialising in resource optimisation systems. 2 JSolver is available for download from http://www.aotl.comstechnique of constraint propagation =-=[4, 10]-=-. Constraint propagation combined with non-deterministic search became a success paradigm to solve constraint-satisfaction problems (CSP) [2, 8, 14, 15, 16]. In recent years, CSP algorithms have be us... |