Jean-Pierre Hombach | Inter National Institute Of fashion Design - Kondhwa (Pune) (original) (raw)
Uploads
Papers by Jean-Pierre Hombach
Proceedings of The National Academy of Sciences, Jan 1, 2002
American Naturalist, Jan 1, 1966
Vol. 100, No. 910 The American Naturalist January-February, 1966 FOOD WEB COMPLEXITY AND SPECIES ... more Vol. 100, No. 910 The American Naturalist January-February, 1966 FOOD WEB COMPLEXITY AND SPECIES DIVERSITY ROBERT Т. РАЖЕ Department of Zoology, University of Washington, Seattle, Washington Though longitudinal or latitudinal gradients in species ...
Bulletin of The American Meteorological Society, Jan 1, 1997
IEEE Transactions on Evolutionary Computation, Jan 1, 1997
This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the... more This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP). In the ACS, a set of cooperating agents called ants cooperate to find good solutions to TSPs. Ants cooperate using an indirect form of communication mediated by a pheromone they deposit on the edges of the TSP graph while building solutions. We study the ACS by running experiments to understand its operation. The results show that the ACS outperforms other nature-inspired algorithms such as simulated annealing and evolutionary computation, and we conclude comparing ACS-3-opt, a version of the ACS augmented with a local search procedure, to some of the best performing algorithms for symmetric and asymmetric TSPs
Emerging Infectious Diseases, Jan 1, 1999
Computing Research Repository, Jan 1, 2001
ACM Siggraph Computer Graphics, Jan 1, 1987
A concept for the optimization of nonlinear functions using particle swarm methodology is introdu... more A concept for the optimization of nonlinear functions using particle swarm methodology is introduced. The evolution of several paradigms is outlined, and an implementation of one of the paradigms is discussed. Benchmark testing of the paradigm is described, and applications, including nonlinear function optimization and neural network training, are proposed. The relationships between particle swarm optimization and both artificial life and genetic algorithms are described
IEEE Transactions on Image Processing, Jan 1, 2003
Computers & Graphics, Jan 1, 2004
In recent years point-based geometry has gained increasing attention as an alternative surface re... more In recent years point-based geometry has gained increasing attention as an alternative surface representation, both for efficient rendering and for flexible geometry processing of highly complex 3D-models. Point-sampled objects do neither have to store nor to maintain globally consistent topological information. Therefore they are more flexible compared to triangle meshes when it comes to handling highly complex or dynamically changing shapes. In this paper, we make an attempt to give an overview of the various point-based methods that have been proposed over the last years. In particular we review and evaluate different shape representations, geometric algorithms, and rendering methods, which use points as a universal graphics primitive.
Cursor snapping is a standard method for providing precise point- ing in direct manipulation grap... more Cursor snapping is a standard method for providing precise point- ing in direct manipulation graphical interfaces. In this paper, we introduce image snapping , a variant of cursor snapping that works in image-based programs such as paint systems. Image snapping moves the cursor location to nearby features in the image, such as edges. It is implemented by using gradient descent
IEEE Transactions on Image Processing, Jan 1, 2003
We present techniques for steganalysis of images that have been potentially subjected to steganog... more We present techniques for steganalysis of images that have been potentially subjected to steganographic algorithms, both within the passive warden and active warden frameworks. Our hypothesis is that steganographic schemes leave statistical evidence that can be exploited for detection with the aid of image quality features and multivariate regression analysis. To this effect image quality metrics have been identified based on the analysis of variance (ANOVA) technique as feature sets to distinguish between cover-images and stego-images. The classifier between cover and stego-images is built using multivariate regression on the selected quality metrics and is trained based on an estimate of the original image. Simulation results with the chosen feature set and well-known watermarking and steganographic techniques indicate that our approach is able with reasonable accuracy to distinguish between cover and stego images.
ACM Transactions on Graphics, Jan 1, 2004
Proceedings of The National Academy of Sciences, Jan 1, 2002
American Naturalist, Jan 1, 1966
Vol. 100, No. 910 The American Naturalist January-February, 1966 FOOD WEB COMPLEXITY AND SPECIES ... more Vol. 100, No. 910 The American Naturalist January-February, 1966 FOOD WEB COMPLEXITY AND SPECIES DIVERSITY ROBERT Т. РАЖЕ Department of Zoology, University of Washington, Seattle, Washington Though longitudinal or latitudinal gradients in species ...
Bulletin of The American Meteorological Society, Jan 1, 1997
IEEE Transactions on Evolutionary Computation, Jan 1, 1997
This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the... more This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP). In the ACS, a set of cooperating agents called ants cooperate to find good solutions to TSPs. Ants cooperate using an indirect form of communication mediated by a pheromone they deposit on the edges of the TSP graph while building solutions. We study the ACS by running experiments to understand its operation. The results show that the ACS outperforms other nature-inspired algorithms such as simulated annealing and evolutionary computation, and we conclude comparing ACS-3-opt, a version of the ACS augmented with a local search procedure, to some of the best performing algorithms for symmetric and asymmetric TSPs
Emerging Infectious Diseases, Jan 1, 1999
Computing Research Repository, Jan 1, 2001
ACM Siggraph Computer Graphics, Jan 1, 1987
A concept for the optimization of nonlinear functions using particle swarm methodology is introdu... more A concept for the optimization of nonlinear functions using particle swarm methodology is introduced. The evolution of several paradigms is outlined, and an implementation of one of the paradigms is discussed. Benchmark testing of the paradigm is described, and applications, including nonlinear function optimization and neural network training, are proposed. The relationships between particle swarm optimization and both artificial life and genetic algorithms are described
IEEE Transactions on Image Processing, Jan 1, 2003
Computers & Graphics, Jan 1, 2004
In recent years point-based geometry has gained increasing attention as an alternative surface re... more In recent years point-based geometry has gained increasing attention as an alternative surface representation, both for efficient rendering and for flexible geometry processing of highly complex 3D-models. Point-sampled objects do neither have to store nor to maintain globally consistent topological information. Therefore they are more flexible compared to triangle meshes when it comes to handling highly complex or dynamically changing shapes. In this paper, we make an attempt to give an overview of the various point-based methods that have been proposed over the last years. In particular we review and evaluate different shape representations, geometric algorithms, and rendering methods, which use points as a universal graphics primitive.
Cursor snapping is a standard method for providing precise point- ing in direct manipulation grap... more Cursor snapping is a standard method for providing precise point- ing in direct manipulation graphical interfaces. In this paper, we introduce image snapping , a variant of cursor snapping that works in image-based programs such as paint systems. Image snapping moves the cursor location to nearby features in the image, such as edges. It is implemented by using gradient descent
IEEE Transactions on Image Processing, Jan 1, 2003
We present techniques for steganalysis of images that have been potentially subjected to steganog... more We present techniques for steganalysis of images that have been potentially subjected to steganographic algorithms, both within the passive warden and active warden frameworks. Our hypothesis is that steganographic schemes leave statistical evidence that can be exploited for detection with the aid of image quality features and multivariate regression analysis. To this effect image quality metrics have been identified based on the analysis of variance (ANOVA) technique as feature sets to distinguish between cover-images and stego-images. The classifier between cover and stego-images is built using multivariate regression on the selected quality metrics and is trained based on an estimate of the original image. Simulation results with the chosen feature set and well-known watermarking and steganographic techniques indicate that our approach is able with reasonable accuracy to distinguish between cover and stego images.
ACM Transactions on Graphics, Jan 1, 2004