| |
Records |
Links |
|
Author |
Enric Marti; Debora Gil; Carme Julia |
|
| |
Title |
A PBL experience in the teaching of Computer Graphics |
Type |
Conference Article |
| |
Year |
2005 |
Publication |
EUROGRAPHICS Proceedings |
Abbreviated Journal |
|
|
| |
Volume |
5 |
Issue |
1 |
Pages |
95-103 |
|
| |
Keywords  |
project-based learning; computer graphics education; Open GL; rendering techniques; computer animation techniques; Graphics packages; Hierarchy and geometric transformations; Animation; Color; shading; shadowing and texture; fractals; hidden line/surface removal; Problem Based Learning |
|
| |
Abstract |
Project-Based Learning (PBL) is an educational strategy to improve student’s learning capability that, in recent years, has had a progressive acceptance in undergraduate studies. This methodology is based on solving a problem or project in a student working group. In this way, PBL focuses on learning the necessary tools to correctly find a solution to given problems. Since the learning initiative is transferred to the student, the PBL method promotes students own abilities. This allows a better assessment of the true workload that carries out the student in the subject. It follows that the methodology conforms to the guidelines of the Bologna document, which quantifies the student workload in a subject by means of the European credit transfer system (ECTS). PBL is currently applied in undergraduate studies needing strong practical training such as medicine, nursing or law sciences. Although this is also the case in engineering studies, amazingly, few experiences have been reported. In this paper we propose to use PBL in the educational organization of the Computer Graphics subjects in the Computer Science degree. Our PBL project focuses in the development of a C++ graphical environment based on the OpenGL libraries for visualization and handling of different graphical objects. The starting point is a basic skeleton that already includes lighting functions, perspective projection with mouse interaction to change the point of view and three predefined objects. Students have to complete this skeleton by adding their own functions to solve the project. A total number of 10 projects have been proposed and successfully solved. The exercises range from human face rendering to articulated objects, such as robot arms or puppets. In the present paper we extensively report the statement and educational objectives for two of the projects: solar system visualization and a chess game. We report our earlier educational experience based on the standard classroom theoretical, problem and practice sessions and the reasons that motivated searching for other learning methods. We have mainly chosen PBL because it improves the student learning initiative. We have applied the PBL educational model since the beginning of the second semester. The student’s feedback increases in his interest for the subject. We present a comparative study of the teachers’ and students’ workload between PBL and the classic teaching approach, which suggests that the workload increase in PBL is not as high as it seems. |
|
| |
Address |
Dublin; Ireland; September 2005 |
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
EUROGRAPHICS |
|
| |
Notes |
IAM;ADAS; |
Approved |
no |
|
| |
Call Number |
IAM @ iam @ MGJ2005 |
Serial |
1593 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Josep Llados; Horst Bunke; Enric Marti |
|
| |
Title |
Finding rotational symmetries by cyclic string matching |
Type |
Journal Article |
| |
Year |
1997 |
Publication |
Pattern recognition letters |
Abbreviated Journal |
PRL |
|
| |
Volume |
18 |
Issue |
14 |
Pages |
1435-1442 |
|
| |
Keywords |
Rotational symmetry; Reflectional symmetry; String matching |
|
| |
Abstract |
Symmetry is an important shape feature. In this paper, a simple and fast method to detect perfect and distorted rotational symmetries of 2D objects is described. The boundary of a shape is polygonally approximated and represented as a string. Rotational symmetries are found by cyclic string matching between two identical copies of the shape string. The set of minimum cost edit sequences that transform the shape string to a cyclically shifted version of itself define the rotational symmetry and its order. Finally, a modification of the algorithm is proposed to detect reflectional symmetries. Some experimental results are presented to show the reliability of the proposed algorithm |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
Elsevier |
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
DAG;IAM; |
Approved |
no |
|
| |
Call Number |
IAM @ iam @ LBM1997a |
Serial |
1562 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Josep Llados; Horst Bunke; Enric Marti |
|
| |
Title |
Structural Recognition of hand drawn floor plans |
Type |
Conference Article |
| |
Year |
1996 |
Publication |
VI National Symposium on Pattern Recognition and Image Analysis |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
|
|
| |
Keywords |
Rotational Symmetry; Reflectional Symmetry; String Matching. |
|
| |
Abstract |
A system to recognize hand drawn architectural drawings in a CAD environment has been deve- loped. In this paper we focus on its high level interpretation module. To interpret a floor plan, the system must identify several building elements, whose description is stored in a library of pat- terns, as well as their spatial relationships. We propose a structural approach based on subgraph isomorphism techniques to obtain a high-level interpretation of the document. The vectorized input document and the patterns to be recognized are represented by attributed graphs. Discrete relaxation techniques (AC4 algorithm) have been applied to develop the matching algorithm. The process has been divided in three steps: node labeling, local consistency and global consistency verification. The hand drawn creation causes disturbed line drawings with several accuracy errors, which must be taken into account. Here we have identified them and the AC4 algorithm has been adapted to manage them. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
Cordoba |
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
DAG;IAM; |
Approved |
no |
|
| |
Call Number |
IAM @ iam @ LIM1995 |
Serial |
1565 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Petia Radeva; Joan Serrat; Enric Marti |
|
| |
Title |
A snake for model-based segmentation |
Type |
Conference Article |
| |
Year |
1995 |
Publication |
Proc. Conf. Fifth Int Computer Vision |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
816-821 |
|
| |
Keywords |
snakes; elastic matching; model-based segmenta tion |
|
| |
Abstract |
Despite the promising results of numerous applications, the hitherto proposed snake techniques share some common problems: snake attraction by spurious edge points, snake degeneration (shrinking and attening), convergence and stability of the deformation process, snake initialization and local determination of the parameters of elasticity. We argue here that these problems can be solved only when all the snake aspects are considered. The snakes proposed here implement a new potential eld and external force in order to provide a deformation convergence, attraction by both near and far edges as well as snake behaviour selective according to the edge orientation. Furthermore, we conclude that in the case of model-based seg mentation, the internal force should include structural information about the expected snake shape. Experiments using this kind of snakes for segmenting bones in complex hand radiographs show a signi cant improvement. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
MILAB;ADAS;IAM |
Approved |
no |
|
| |
Call Number |
IAM @ iam @ RSM1995 |
Serial |
1634 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Gemma Sanchez; Josep Llados; Enric Marti |
|
| |
Title |
Segmentation and analysis of linial texture in plans |
Type |
Conference Article |
| |
Year |
1997 |
Publication |
Intelligence Artificielle et Complexité. |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
|
|
| |
Keywords |
Structural Texture, Voronoi, Hierarchical Clustering, String Matching. |
|
| |
Abstract |
The problem of texture segmentation and interpretation is one of the main concerns in the field of document analysis. Graphical documents often contain areas characterized by a structural texture whose recognition allows both the document understanding, and its storage in a more compact way. In this work, we focus on structural linial textures of regular repetition contained in plan documents. Starting from an atributed graph which represents the vectorized input image, we develop a method to segment textured areas and recognize their placement rules. We wish to emphasize that the searched textures do not follow a predefined pattern. Minimal closed loops of the input graph are computed, and then hierarchically clustered. In this hierarchical clustering, a distance function between two closed loops is defined in terms of their areas difference and boundary resemblance computed by a string matching procedure. Finally it is noted that, when the texture consists of isolated primitive elements, the same method can be used after computing a Voronoi Tesselation of the input graph. |
|
| |
Address |
Paris, France |
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
Paris |
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
AERFAI |
|
| |
Notes |
DAG;IAM; |
Approved |
no |
|
| |
Call Number |
IAM @ iam @ SLM1997 |
Serial |
1649 |
|
| Permanent link to this record |
