#### Filter Results:

- Full text PDF available (16)

#### Publication Year

1992

2017

- This year (1)
- Last 5 years (12)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Sébastien Bougleux, Abderrahim Elmoataz, Mahmoud Melkemi
- International Journal of Computer Vision
- 2008

We propose a discrete regularization framework on weighted graphs of arbitrary topology, which unifies local and nonlocal processing of images, meshes, and more generally discrete data. The approach considers the problem as a variational one, which consists in minimizing a weighted sum of two energy terms: a regularization one that uses the discrete… (More)

- Frederic Cordier, Hyewon Seo, Mahmoud Melkemi, Nickolas S. Sapidis
- Computer-Aided Design
- 2013

We describe a system for taking a 2D sketch of a mirror-symmetric 3D shape and lifting the curves to 3D, inferring the symmetry relationship from the original hand-drawn curves. The system takes as input a hand-drawn sketch and generates a set of 3D curves such that their orthogonal projection matches the input sketch. The main contribution is a method… (More)

- Mahmoud Melkemi, Mourad Djebali
- Pattern Recognition
- 2000

- Lhassane Idoumghar, Mahmoud Melkemi, René Schott, Maha Idrissi-Aouad
- Applied Comp. Int. Soft Computing
- 2011

HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion… (More)

- Ahmed Mostefaoui, Azzedine Boukerche, M. A. Merzoug, Mahmoud Melkemi
- Computer Networks
- 2015

- Mourad Djebali, Mahmoud Melkemi, Denis Vandorpe
- ICIP
- 1994

We propose a discrete regularization framework on weighted graphs of arbitrary topology, which unifies image and mesh filtering. The approach considers the problem as a variational one, which consists in minimizing a weighted sum of two energy terms: a regularization one that uses the discrete p-Laplace operator, and an approximation one. This formulation… (More)

- Mahmoud Melkemi
- Symposium on Computational Geometry
- 1997

In this paper, we develop a family of straightline graphs which we call A-shape of a finite point set (A is an arbitrary point set). Derived from the Delaunay triangulation, this family captures the notion of shape hull of a finite point set.

- Mourad Djebali, Mahmoud Melkemi, Nickolas S. Sapidis
- Symposium on Solid Modeling and Applications
- 2002

A segmentation and model-reconstruction algorithm is proposed based on polynomial approximation and on a novel version of "region growing". First, an initial partition is calculated on the basis of differential-geometric properties of the range image. Then, the first merging procedure is applied ("merge with constraints") aiming at correctly identifying… (More)

- Mahmoud Melkemi
- IJPRAI
- 2003