Embedded platforms are expected to integrate thousands of cores in the near future, and one of the major difficulties remains in scaling the interconnection network. We propose a novel Scalable NETwork concept, named ...
详细信息
Embedded platforms are expected to integrate thousands of cores in the near future, and one of the major difficulties remains in scaling the interconnection network. We propose a novel Scalable NETwork concept, named SNet, that broadens the NoCs space to include a combined software/hardware dynamic routing methodology. It exploits a distributed, adaptive, non-supervised routing strategy, based on the ACO algorithm (Ant Colony Optimization), to define routing paths among communicating tasks. Data transmission is achieved by a small footprint hardware module, named DMC (Direct Management of Communications). SNet has the advantage of being highly flexible, and enables to define a wide range of routing topologies to match application requirements. In this paper, we apply the SNet paradigm to a manycore architecture and we evaluate its performances by running a high number of test cases.
In a recent study C. Lohou, G. Bertrand [A new 3D 12-subiteration thinning algorithm based on P-simple points, in: International Workshop on Combinatorial linage Analysis, IWCIA 2,001, Philadelphia, PA, USA, ENTCS, vo...
详细信息
In a recent study C. Lohou, G. Bertrand [A new 3D 12-subiteration thinning algorithm based on P-simple points, in: International Workshop on Combinatorial linage Analysis, IWCIA 2,001, Philadelphia, PA, USA, ENTCS, vol. 46. 2001, pp. 39-58 Anew 3D 6-subiteration thinning algorithm based on P-simple points, in: International Conference on Discrete Geometry for Computer Imagery, DGCI'2002, Bordeaux, France, ENTCS. vol. 2301, Springer, Berlin, 2(X)2, pp, 102-113., A 3D 12-subiteration thinning algorithm based on P-simple points. Discrete Appl. Math. 139(1-3) (2004) 171-195.], we proposed a new methodology to build thinning algorithms based on the deletion of P-simple points. This methodology may permit to conceive a thinning algorithm A' from an existent thinning algorithm A, such that A' deletes at least all the points removed by A, while preserving the same end points (in particular, we have already proposed a 12-subiteration thinning algorithm C. Lohou, G. Bertrand [International Workshop on Combinatorial linage Analysis. IWCIA 2001, Philadelphia, PA, USA, ENTCS, vol. 46, 2001. pp. 39-58 A 3D 12-subiteration thinning algorithm based on P-simple points, Discrete Appl. Math. 139(1-3) (2004) 171-195.]). In this paper, by applying this methodology. we propose a 6-subiteration curve thinning algorithm which deletes at least all the points removed by two 6-subiteration curve thinning algorithms: either the one proposed by Palagyi and Kuba [A 3D 6-subiteration thinning algorithm for extracting medial lines, Pattern Recogn. Lett. 19(7) (1998) 613-627.], or the one proposed by Gong and Bertrand [A simple parallel 3D thinning algorithm, in: International Conference on Pattern Recognition, Atlantic City, NJ, USA, 1990, pp. 188-190.]. (c) 2005 Elsevier B.V. All rights reserved.
作者：
Lohou, CBertrand, GESIEE
Lab Algorithm & Architecture Syst Informat F-93162 Noisy Le Grand France
In this paper, we propose a new methodology to conceive a thinning scheme based on the parallel deletion of P-simple points. This scheme needs neither a preliminary labelling nor an extended neighborhood, in the oppos...
详细信息
In this paper, we propose a new methodology to conceive a thinning scheme based on the parallel deletion of P-simple points. This scheme needs neither a preliminary labelling nor an extended neighborhood, in the opposite of the already proposed thinning algorithms based on P-simple points. Moreover, from an existent thinning algorithm A, we construct another thinning algorithm A', such that A' deletes at least all the points removed by A, while preserving the same end points. In fact, we propose a 12-subiteration thinning algorithm which deletes at least the points removed by the one proposed by Palagyi and Kuba (Graphical Models Image Process. 61 (1999) 199). (C) 2003 Elsevier B.V. All rights reserved.
作者：
Lohou, CBertrand, GESIEE
Lab Algorithm & Architecture Syst Informat F-93162 Noisy Le Grand France
In this paper, we propose a new methodology to conceive a thinning scheme based on the parallel deletion of P-simple points. This scheme needs neither a preliminary labelling nor an extended neighborhood, in the oppos...
详细信息
In this paper, we propose a new methodology to conceive a thinning scheme based on the parallel deletion of P-simple points. This scheme needs neither a preliminary labelling nor an extended neighborhood, in the opposite of the already proposed thinning algorithms based on P-simple points. Moreover, from an existent thinning algorithm A, we construct another thinning algorithm A', such that A' deletes at least all the points removed by A, while preserving the same end points. In fact, we propose a 12-subiteration thinning algorithm which deletes at least the points removed by the one proposed by Palagyi and Kuba (Graphical Models Image Process. 61 (1999) 199). (C) 2003 Elsevier B.V. All rights reserved.
The boundary identification represents an interesting and difficult problem in image processing, mainly if two flat zones are separated by a gradual transition. The most common edge detection operators work properly f...
详细信息
The boundary identification represents an interesting and difficult problem in image processing, mainly if two flat zones are separated by a gradual transition. The most common edge detection operators work properly for sharp edges, but can fail considerably for gradual transitions. In this work, we propose a method to eliminate gradual transitions, which preserves the number of the image flat zones. As an application example, we show that our method can be used to identify very common gradual video transitions such as fades and dissolves.
The boundary identification represents an interesting and difficult problem in image processing, mainly if two flat zones are separated by a gradual transition. The most common edge detection operators work properly f...
详细信息
The boundary identification represents an interesting and difficult problem in image processing, mainly if two flat zones are separated by a gradual transition. The most common edge detection operators work properly for sharp edges, but can fail considerably for gradual transitions. In this work, we propose a method to eliminate gradual transitions, which preserves the number of the image flat zones. As an application example, we show that our method can be used to identify very common gradual video transitions such as fades and dissolves.
This paper proposes a new data-driven segmentation technique of 3D T1-weighted magnetic resonance scans of human head. This technique serves to the construction of individual head models. Several structures of the hea...
详细信息
This paper proposes a new data-driven segmentation technique of 3D T1-weighted magnetic resonance scans of human head. This technique serves to the construction of individual head models. Several structures of the head are extracted. The morphology-oriented approach combined with an extensive use of topological constraints provides a robust and automatic method requiring minimum user intervention. This new approach is suitable to applications where the topology is one of the main constraints. The originality of the approach lies in the satisfaction of such constraints and in an effort towards robustness. (C) 2003 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
暂无评论