Pub Date : 2003-05-12DOI: 10.1109/CAMP.2003.1598174
S. Moutault, Jacques-Olivier Klein, A. Dupret
In this article a switched capacitors based cell, dedicated to analog computing is presented. The aim is to allow the automatic synthesis of analog computing circuit. Therefore, the set of operations that this structure synthesizes and an analysis of the effects of technological non-ideal effects are presented
{"title":"A universal switched capacitors operator for the automatic synthesis of analog computation circuits","authors":"S. Moutault, Jacques-Olivier Klein, A. Dupret","doi":"10.1109/CAMP.2003.1598174","DOIUrl":"https://doi.org/10.1109/CAMP.2003.1598174","url":null,"abstract":"In this article a switched capacitors based cell, dedicated to analog computing is presented. The aim is to allow the automatic synthesis of analog computing circuit. Therefore, the set of operations that this structure synthesizes and an analysis of the effects of technological non-ideal effects are presented","PeriodicalId":443821,"journal":{"name":"2003 IEEE International Workshop on Computer Architectures for Machine Perception","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134373508","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-05-12DOI: 10.1109/CAMP.2003.1598150
J. L. Bosque, O. D. Robles, Luis Pastor
CBIR systems, which typically manage a great amount of multimedia information, need efficient implementations to give an answer in a proper response time. Distributed solutions on heterogeneous clusters offer a good cost/performance ratio to solve this problem. One of the critical parameters to be tuned is the load assigned to each of the cluster nodes. This paper presents a new load balancing algorithm for a parallel implementation of a CBIR system on a heterogeneous cluster. The approach is based on a dynamic, distributed, global and high scalable load balancing algorithm. Some experiments are presented to validate and verify the approach performance
{"title":"Load balancing algorithms for CBIR environments","authors":"J. L. Bosque, O. D. Robles, Luis Pastor","doi":"10.1109/CAMP.2003.1598150","DOIUrl":"https://doi.org/10.1109/CAMP.2003.1598150","url":null,"abstract":"CBIR systems, which typically manage a great amount of multimedia information, need efficient implementations to give an answer in a proper response time. Distributed solutions on heterogeneous clusters offer a good cost/performance ratio to solve this problem. One of the critical parameters to be tuned is the load assigned to each of the cluster nodes. This paper presents a new load balancing algorithm for a parallel implementation of a CBIR system on a heterogeneous cluster. The approach is based on a dynamic, distributed, global and high scalable load balancing algorithm. Some experiments are presented to validate and verify the approach performance","PeriodicalId":443821,"journal":{"name":"2003 IEEE International Workshop on Computer Architectures for Machine Perception","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129973012","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-05-12DOI: 10.1109/CAMP.2003.1598146
V. Cantoni, R. Marmo
Researchers have argued that an attentional mechanism is required to perform many vision tasks. In this paper we propose an approach to object classification that is based on the multi layer perceptron neural network implemented on the selective tuning model, in order to classify the scan-path of an object. A form of scan-path is obtained using the selective tuning model. The neural network takes as input this scan-path and gives, as output, the estimated class. The entire structure can learn, from a wide variety of examples, how to classify scan-path patterns in a supervised manner and then to recognize objects in digital images. This model of selective visual attention provides for a solution to the problems of selection in an image and information routing through the visual processing hierarchy. This approach is described in some detail and a performance example of scan-path classification is shown. The results confirm that the selective tuning model is both robust and fast
{"title":"Object classification using a MLP on a selective tuning model","authors":"V. Cantoni, R. Marmo","doi":"10.1109/CAMP.2003.1598146","DOIUrl":"https://doi.org/10.1109/CAMP.2003.1598146","url":null,"abstract":"Researchers have argued that an attentional mechanism is required to perform many vision tasks. In this paper we propose an approach to object classification that is based on the multi layer perceptron neural network implemented on the selective tuning model, in order to classify the scan-path of an object. A form of scan-path is obtained using the selective tuning model. The neural network takes as input this scan-path and gives, as output, the estimated class. The entire structure can learn, from a wide variety of examples, how to classify scan-path patterns in a supervised manner and then to recognize objects in digital images. This model of selective visual attention provides for a solution to the problems of selection in an image and information routing through the visual processing hierarchy. This approach is described in some detail and a performance example of scan-path classification is shown. The results confirm that the selective tuning model is both robust and fast","PeriodicalId":443821,"journal":{"name":"2003 IEEE International Workshop on Computer Architectures for Machine Perception","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126019276","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-05-12DOI: 10.1109/CAMP.2003.1598161
S.K. Singh, Mayank Vatsa, Richa Singh, K. K. Shukla
As continual research is being conducted in the area of computer vision, one of the most practical applications under vigorous development is in the construction of a robust real-time face recognition system. While the problem of recognizing faces under gross variations remains largely unsolved, a demonstration system as proof of concept that such systems are now becoming practical have been developed. A system capable of reliable recognition, with reduced constraints in regards to the position and orientation of the face and the illumination and background of the image has been implemented. In this paper an attempt is made to compare existing face recognition algorithms which are widely used and subject of interest
{"title":"A comparative study of various face recognition algorithms (feature based, eigen based, line based, neural network approaches)","authors":"S.K. Singh, Mayank Vatsa, Richa Singh, K. K. Shukla","doi":"10.1109/CAMP.2003.1598161","DOIUrl":"https://doi.org/10.1109/CAMP.2003.1598161","url":null,"abstract":"As continual research is being conducted in the area of computer vision, one of the most practical applications under vigorous development is in the construction of a robust real-time face recognition system. While the problem of recognizing faces under gross variations remains largely unsolved, a demonstration system as proof of concept that such systems are now becoming practical have been developed. A system capable of reliable recognition, with reduced constraints in regards to the position and orientation of the face and the illumination and background of the image has been implemented. In this paper an attempt is made to compare existing face recognition algorithms which are widely used and subject of interest","PeriodicalId":443821,"journal":{"name":"2003 IEEE International Workshop on Computer Architectures for Machine Perception","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116193714","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-05-12DOI: 10.1109/CAMP.2003.1598143
R. Huber, C. Nowak, B. Spatzek, D. Schreiber
Image processing strongly relies on the quality of the input images, as images of good quality can significantly decrease the development effort for image processing and analysis algorithms. A flexible acquisition system for image enhancement, which is able to operate in real time under changing brightness conditions, is suggested. The system is based on controlling the aperture of the lens, which makes it useable in combination with all types of image sensors. The control scheme is based on an adaptive image quality estimator and can be used for full images and regions of interest within images. We demonstrate the realtime performance of our approach for different static and dynamic in-and outdoor test scenarios with and without region of interest
{"title":"Adaptive aperture control for image enhancement","authors":"R. Huber, C. Nowak, B. Spatzek, D. Schreiber","doi":"10.1109/CAMP.2003.1598143","DOIUrl":"https://doi.org/10.1109/CAMP.2003.1598143","url":null,"abstract":"Image processing strongly relies on the quality of the input images, as images of good quality can significantly decrease the development effort for image processing and analysis algorithms. A flexible acquisition system for image enhancement, which is able to operate in real time under changing brightness conditions, is suggested. The system is based on controlling the aperture of the lens, which makes it useable in combination with all types of image sensors. The control scheme is based on an adaptive image quality estimator and can be used for full images and regions of interest within images. We demonstrate the realtime performance of our approach for different static and dynamic in-and outdoor test scenarios with and without region of interest","PeriodicalId":443821,"journal":{"name":"2003 IEEE International Workshop on Computer Architectures for Machine Perception","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114771611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-05-12DOI: 10.1109/CAMP.2003.1598172
S. Sukhsawas, K. Benkrid, D. Crookes
FPGA technology enjoys both the high performance of a dedicated hardware solution and the flexibility of software that is offered by its inherent reprogrammability feature. Image processing is one application area that can benefit greatly from FPGAs performance and flexibility. This paper presents the design and implementation of a high-level reconfigurable image coprocessor on FPGAs. The image coprocessor high level instruction set is based on the operators of image algebra. Central to this Instruction set are the five core neighbourhood operations of image algebra: convolution, additive maximum, additive minimum, multiplicative maximum and multiplicative minimum. These are parameterised in terms of the neighbourhood operation's window coefficients, window size and image size. Handel-C language was used to design the image coprocessor with a fully tested prototype on Celoxica Virtex-E based RC1000-PP PCI board. The paper describes the user's programming interface, and outlines the approach to generating FPGA architectures dynamically for the image coprocessor. It also presents sample implementation results (speed, area) for different neighbourhood operations
{"title":"A reconfigurable high level FPGA-based coprocessor","authors":"S. Sukhsawas, K. Benkrid, D. Crookes","doi":"10.1109/CAMP.2003.1598172","DOIUrl":"https://doi.org/10.1109/CAMP.2003.1598172","url":null,"abstract":"FPGA technology enjoys both the high performance of a dedicated hardware solution and the flexibility of software that is offered by its inherent reprogrammability feature. Image processing is one application area that can benefit greatly from FPGAs performance and flexibility. This paper presents the design and implementation of a high-level reconfigurable image coprocessor on FPGAs. The image coprocessor high level instruction set is based on the operators of image algebra. Central to this Instruction set are the five core neighbourhood operations of image algebra: convolution, additive maximum, additive minimum, multiplicative maximum and multiplicative minimum. These are parameterised in terms of the neighbourhood operation's window coefficients, window size and image size. Handel-C language was used to design the image coprocessor with a fully tested prototype on Celoxica Virtex-E based RC1000-PP PCI board. The paper describes the user's programming interface, and outlines the approach to generating FPGA architectures dynamically for the image coprocessor. It also presents sample implementation results (speed, area) for different neighbourhood operations","PeriodicalId":443821,"journal":{"name":"2003 IEEE International Workshop on Computer Architectures for Machine Perception","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122045423","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-05-12DOI: 10.1109/CAMP.2003.1598168
Yankun Wei, Wael Badawy
A new moving object contour detection approach is proposed in this paper. This approach combines still image segmentation and motion segmentation techniques together to provide fast processing speed and accuracy of object contour. The motion segmentation algorithm used in the proposed approach is the hierarchical adaptive structured mesh (HASM), which extracts the motion boundary of the moving objects and removes noise regions. Then inside the motion boundary, the foreground pixels are detected and the morphological operations are applied to produce foreground blobs. Simple edge detection technique is used to get the continue contour of the moving object. The combination of these two techniques reduces the whole computational cost of traditional contour extraction approaches and efficiently extracts the moving object contour
{"title":"A new moving object contour detection approach","authors":"Yankun Wei, Wael Badawy","doi":"10.1109/CAMP.2003.1598168","DOIUrl":"https://doi.org/10.1109/CAMP.2003.1598168","url":null,"abstract":"A new moving object contour detection approach is proposed in this paper. This approach combines still image segmentation and motion segmentation techniques together to provide fast processing speed and accuracy of object contour. The motion segmentation algorithm used in the proposed approach is the hierarchical adaptive structured mesh (HASM), which extracts the motion boundary of the moving objects and removes noise regions. Then inside the motion boundary, the foreground pixels are detected and the morphological operations are applied to produce foreground blobs. Simple edge detection technique is used to get the continue contour of the moving object. The combination of these two techniques reduces the whole computational cost of traditional contour extraction approaches and efficiently extracts the moving object contour","PeriodicalId":443821,"journal":{"name":"2003 IEEE International Workshop on Computer Architectures for Machine Perception","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126739443","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-05-12DOI: 10.1109/CAMP.2003.1598142
S. Thainimit, C. Chu
Illumination in an image often needs to be corrected or adjusted for several reasons. Recognition of images, such as those of faces, that are based on image data as patterns depends on having the lighting direction of the query image and that of the database images be aligned. In computational video, acquired images are often texture mapped to blend with computer generated polygonal surfaces. The shading of a polygonal surfaces changes as the light source direction relative to the composite object changes due, for instance, to the object's motion. We experiment with methods that can adjust the texture mapped image according to the illumination change. We test our concept on images of human faces
{"title":"Illumination correction in digital images","authors":"S. Thainimit, C. Chu","doi":"10.1109/CAMP.2003.1598142","DOIUrl":"https://doi.org/10.1109/CAMP.2003.1598142","url":null,"abstract":"Illumination in an image often needs to be corrected or adjusted for several reasons. Recognition of images, such as those of faces, that are based on image data as patterns depends on having the lighting direction of the query image and that of the database images be aligned. In computational video, acquired images are often texture mapped to blend with computer generated polygonal surfaces. The shading of a polygonal surfaces changes as the light source direction relative to the composite object changes due, for instance, to the object's motion. We experiment with methods that can adjust the texture mapped image according to the illumination change. We test our concept on images of human faces","PeriodicalId":443821,"journal":{"name":"2003 IEEE International Workshop on Computer Architectures for Machine Perception","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127358880","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-05-12DOI: 10.1109/CAMP.2003.1598156
J. Kim, D. S. Wills
Vector quantization (VQ) is widely used for color image and video compression. However, its high computational overhead prohibits many applications in real-time systems. This paper presents a novel method to accelerate full-search VQ algorithm by adding quantized color pack extension (QCPX) instruction set architecture (ISA). QCPX not only supports a packed 16-bit YCbCr data format but also obtains performance and code density improvements through three-color pixels in parallel in a 16-bit width. To measure execution performance of the QCPX instruction set architecture (ISA), it is evaluated in a SIMD pixel array platform developed at Georgia Tech. In addition, by varying the grain size (pixel per processing element, PPE), this study can fully measure the impact of QCPX in the presence of different levels of data parallelism. Simulation results indicate that QCPX version achieves speedups from 27% to 297% over non-QCPX with the most impressive improvements >200 % occurring above the communication-bound 16 PPE granularity. QCPX also reduces average PE idle cycles by 45%. QCPX can be incorporated in range of architectures from current ILP processors to future massively data parallel machines
{"title":"Evaluating color instruction set extension for real-time vector quantization","authors":"J. Kim, D. S. Wills","doi":"10.1109/CAMP.2003.1598156","DOIUrl":"https://doi.org/10.1109/CAMP.2003.1598156","url":null,"abstract":"Vector quantization (VQ) is widely used for color image and video compression. However, its high computational overhead prohibits many applications in real-time systems. This paper presents a novel method to accelerate full-search VQ algorithm by adding quantized color pack extension (QCPX) instruction set architecture (ISA). QCPX not only supports a packed 16-bit YCbCr data format but also obtains performance and code density improvements through three-color pixels in parallel in a 16-bit width. To measure execution performance of the QCPX instruction set architecture (ISA), it is evaluated in a SIMD pixel array platform developed at Georgia Tech. In addition, by varying the grain size (pixel per processing element, PPE), this study can fully measure the impact of QCPX in the presence of different levels of data parallelism. Simulation results indicate that QCPX version achieves speedups from 27% to 297% over non-QCPX with the most impressive improvements >200 % occurring above the communication-bound 16 PPE granularity. QCPX also reduces average PE idle cycles by 45%. QCPX can be incorporated in range of architectures from current ILP processors to future massively data parallel machines","PeriodicalId":443821,"journal":{"name":"2003 IEEE International Workshop on Computer Architectures for Machine Perception","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129065228","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-05-12DOI: 10.1109/CAMP.2003.1598149
V. Gesù, S. Furco, V. L. Franca, Domenico Tegolo
In this paper we describe VIRES (visual information retrieval extendible system) an open distributed pictorial database for image retrieval. The retrieval methods, pictorial indexing and data are distributed over the network. VIRES has been designed as an open architecture. The system is based on the concept of distributed model via dictionary in order to reach a good versatility without changing the kernel of VIRES
本文描述了一个用于图像检索的开放式分布式图形数据库VIRES (visual information retrieval extensibility system)。检索方法、图形索引和数据分布在网络上。VIRES被设计成一个开放的体系结构。该系统基于字典分布式模型的概念，在不改变VIRES内核的前提下实现了良好的通用性
{"title":"VIRES: a distributed open architecture for pictorial database","authors":"V. Gesù, S. Furco, V. L. Franca, Domenico Tegolo","doi":"10.1109/CAMP.2003.1598149","DOIUrl":"https://doi.org/10.1109/CAMP.2003.1598149","url":null,"abstract":"In this paper we describe VIRES (visual information retrieval extendible system) an open distributed pictorial database for image retrieval. The retrieval methods, pictorial indexing and data are distributed over the network. VIRES has been designed as an open architecture. The system is based on the concept of distributed model via dictionary in order to reach a good versatility without changing the kernel of VIRES","PeriodicalId":443821,"journal":{"name":"2003 IEEE International Workshop on Computer Architectures for Machine Perception","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127877958","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：