Pub Date : 2010-07-07DOI: 10.1109/IPTA.2010.5586798
Leila Makkaoui, V. Lecuire, J. Moureaux
This paper deals with image compression over Wireless Camera Sensor Networks (WCSNs) in order to decrease the energy consumption of sensors and thus to maintain a long network lifetime. As the radio tranceiver is the most power greedy components of sensor nodes, it seems natural to consider lossy compression before transmission as the appropriate answer to the problem of energy consumption. However, the limitation of sensor nodes in terms of memory as well as processor speed makes most of the compression algorithms inapplicable. Indeed, the most popular methods such as JPEG or JPEG2000 can yield a higher energy consumption than when transmitting uncompressed images. Here we propose to solve this problem by the design of a fast zonal DCT-based image compression algorithm which allows an efficient tuning of the trade-off between energy consumption and image distortion, as shown by experimental results provided in the paper.
{"title":"Fast zonal DCT-based image compression for Wireless Camera Sensor Networks","authors":"Leila Makkaoui, V. Lecuire, J. Moureaux","doi":"10.1109/IPTA.2010.5586798","DOIUrl":"https://doi.org/10.1109/IPTA.2010.5586798","url":null,"abstract":"This paper deals with image compression over Wireless Camera Sensor Networks (WCSNs) in order to decrease the energy consumption of sensors and thus to maintain a long network lifetime. As the radio tranceiver is the most power greedy components of sensor nodes, it seems natural to consider lossy compression before transmission as the appropriate answer to the problem of energy consumption. However, the limitation of sensor nodes in terms of memory as well as processor speed makes most of the compression algorithms inapplicable. Indeed, the most popular methods such as JPEG or JPEG2000 can yield a higher energy consumption than when transmitting uncompressed images. Here we propose to solve this problem by the design of a fast zonal DCT-based image compression algorithm which allows an efficient tuning of the trade-off between energy consumption and image distortion, as shown by experimental results provided in the paper.","PeriodicalId":236574,"journal":{"name":"2010 2nd International Conference on Image Processing Theory, Tools and Applications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125117250","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 : 2010-07-07DOI: 10.1109/IPTA.2010.5586722
Somojit Saha, Sarit K. Das, A. Kar
This paper presents a high resolution MR image acquisition protocol for better visualization of normal gray structures of brain, a unique feature of the histogram of the reconstructed images of this protocol, an automated segmentation algorithm of the head contour and the entire brain by using this feature.
{"title":"A new segmentation technique for brain and head from high resolution MR image using unique histogram features","authors":"Somojit Saha, Sarit K. Das, A. Kar","doi":"10.1109/IPTA.2010.5586722","DOIUrl":"https://doi.org/10.1109/IPTA.2010.5586722","url":null,"abstract":"This paper presents a high resolution MR image acquisition protocol for better visualization of normal gray structures of brain, a unique feature of the histogram of the reconstructed images of this protocol, an automated segmentation algorithm of the head contour and the entire brain by using this feature.","PeriodicalId":236574,"journal":{"name":"2010 2nd International Conference on Image Processing Theory, Tools and Applications","volume":"247 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122059082","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 : 2010-07-07DOI: 10.1109/IPTA.2010.5586800
Pol Kennel, G. Subsol, M. Gueroult, P. Borianne
In this paper, we present an automatic method to recognize cell files in light microscopic images of conifer wood. This original method is composed of three steps: the segmentation step which extracts some anatomical structures from the image (based on the watershed algorithm), the classification step which identifies the interesting cells in these structures (by using CART method), and the cell files recognition step. Some preliminary results obtained on several species of conifers are presented and analyzed.
{"title":"Automatic identification of cell files in light microscopic images of conifer wood","authors":"Pol Kennel, G. Subsol, M. Gueroult, P. Borianne","doi":"10.1109/IPTA.2010.5586800","DOIUrl":"https://doi.org/10.1109/IPTA.2010.5586800","url":null,"abstract":"In this paper, we present an automatic method to recognize cell files in light microscopic images of conifer wood. This original method is composed of three steps: the segmentation step which extracts some anatomical structures from the image (based on the watershed algorithm), the classification step which identifies the interesting cells in these structures (by using CART method), and the cell files recognition step. Some preliminary results obtained on several species of conifers are presented and analyzed.","PeriodicalId":236574,"journal":{"name":"2010 2nd International Conference on Image Processing Theory, Tools and Applications","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124602904","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 : 2010-07-07DOI: 10.1109/IPTA.2010.5586768
Lounis Douadi, L. Khoudour, A. Chaari, J. Boonaert
This paper presents a full motion detection system with post-processing applied to video surveillance. Motion detection is performed based on background subtraction (BGS). Our purpose is to show how an appropriate post-processing improves segmentation result provided by a BGS technique from the literature. First, BGS is performed using the codebook algorithm [8]. Post-processing is then applied on the raw segmented images to enhance the segmentation quality. The proposed post-processing proceeds in two steps. The first step consists in removing shadows and highlights based on color data. In the second step connected component labeling is used to extract pertinent foreground blobs. The full system is evaluated with video surveillance sequences under adverse illumination conditions.
{"title":"Full motion detection system with post-processing","authors":"Lounis Douadi, L. Khoudour, A. Chaari, J. Boonaert","doi":"10.1109/IPTA.2010.5586768","DOIUrl":"https://doi.org/10.1109/IPTA.2010.5586768","url":null,"abstract":"This paper presents a full motion detection system with post-processing applied to video surveillance. Motion detection is performed based on background subtraction (BGS). Our purpose is to show how an appropriate post-processing improves segmentation result provided by a BGS technique from the literature. First, BGS is performed using the codebook algorithm [8]. Post-processing is then applied on the raw segmented images to enhance the segmentation quality. The proposed post-processing proceeds in two steps. The first step consists in removing shadows and highlights based on color data. In the second step connected component labeling is used to extract pertinent foreground blobs. The full system is evaluated with video surveillance sequences under adverse illumination conditions.","PeriodicalId":236574,"journal":{"name":"2010 2nd International Conference on Image Processing Theory, Tools and Applications","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126978977","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 : 2010-07-07DOI: 10.1109/IPTA.2010.5586726
B. Song, Shin-Cheol Jeong, Yanglim Choi
This paper presents a video super-resolution algorithm to interpolate an arbitrary frame in a low resolution video sequence from sparsely existing high resolution key pictures. Firstly, hierarchical motion estimation is performed between the input and the key low resolution frames on a patch basis. If motion-compensated error is small, an input LR patch is super-resolved by bi-directional overlapped block motion compensation. Otherwise, the input patch is spatially super-resolved using the dictionary which is learned from the key low resolution and its corresponding high resolution pictures beforehand. Finally, possible blocking artifacts between a motion-compensated patch and a spatially super-resolved patch are concealed using a specific de-blocking process. Experimental results show that the proposed algorithm provides significantly better subjective visual quality as well as objective quality than previous interpolation algorithms.
{"title":"Key frame-based video super-resolution using bi-directional overlapped block motion compensation and trained dictionary","authors":"B. Song, Shin-Cheol Jeong, Yanglim Choi","doi":"10.1109/IPTA.2010.5586726","DOIUrl":"https://doi.org/10.1109/IPTA.2010.5586726","url":null,"abstract":"This paper presents a video super-resolution algorithm to interpolate an arbitrary frame in a low resolution video sequence from sparsely existing high resolution key pictures. Firstly, hierarchical motion estimation is performed between the input and the key low resolution frames on a patch basis. If motion-compensated error is small, an input LR patch is super-resolved by bi-directional overlapped block motion compensation. Otherwise, the input patch is spatially super-resolved using the dictionary which is learned from the key low resolution and its corresponding high resolution pictures beforehand. Finally, possible blocking artifacts between a motion-compensated patch and a spatially super-resolved patch are concealed using a specific de-blocking process. Experimental results show that the proposed algorithm provides significantly better subjective visual quality as well as objective quality than previous interpolation algorithms.","PeriodicalId":236574,"journal":{"name":"2010 2nd International Conference on Image Processing Theory, Tools and Applications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128138479","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 : 2010-07-07DOI: 10.1109/IPTA.2010.5586766
S. Rivollier, J. Debayle, J. Pinoli
Shape diagrams are shape representations in the Euclidean plane introduced for studying 3D and 2D compact sets. A compact set is represented by a point within a shape diagram whose coordinates are morphological functionals defined from geometrical functionals and inequalities. Classically, the geometrical functionals for 2D sets are the area, the perimeter, the radii of the inscribed and circumscribed circles, and the minimum and maximum Feret diameters. The purpose of this paper is to present a particular shape diagram for which mathematical properties have been well-defined and to analyse the shape of several families of 2D sets for the discrimination of convex and non convex sets as well as the discrimination of similar sets.
{"title":"Shape representation and analysis of 2D compact sets by shape diagrams","authors":"S. Rivollier, J. Debayle, J. Pinoli","doi":"10.1109/IPTA.2010.5586766","DOIUrl":"https://doi.org/10.1109/IPTA.2010.5586766","url":null,"abstract":"Shape diagrams are shape representations in the Euclidean plane introduced for studying 3D and 2D compact sets. A compact set is represented by a point within a shape diagram whose coordinates are morphological functionals defined from geometrical functionals and inequalities. Classically, the geometrical functionals for 2D sets are the area, the perimeter, the radii of the inscribed and circumscribed circles, and the minimum and maximum Feret diameters. The purpose of this paper is to present a particular shape diagram for which mathematical properties have been well-defined and to analyse the shape of several families of 2D sets for the discrimination of convex and non convex sets as well as the discrimination of similar sets.","PeriodicalId":236574,"journal":{"name":"2010 2nd International Conference on Image Processing Theory, Tools and Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132018863","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 : 2010-07-07DOI: 10.1109/IPTA.2010.5586743
Gawain Jones, C. Gée, S. Villette, F. Truchetet
In Precision Agriculture, remote sensors such as imaging systems are commonly used to manage site-specific weeds. Although there are several algorithms using spatial information, few tests proving their efficiency have been performed on relevant database. In this paper we propose an innovative approach based on a simple model that simulates virtual crops to evaluate the robustness and efficiency of any crop/weed discrimination algorithm. A two-dimensional statistical and spatial crop field model is presented: it allows the design of virtual crops with given characteristics (plant size, inter-row width…) for various species (wheat, sunflower, maize…). The Weed Infestation Rate is set on demand at three different spatial distributions (point, aggregate, or a mixture) providing the diversity of the resulting simulated field. The spatial realism of the model is validated by two spatial descriptors (nearest neighbor method and Besag's function) at different scales through a pair of real/virtual pictures.
{"title":"Validation of a virtual agronomic image modelling","authors":"Gawain Jones, C. Gée, S. Villette, F. Truchetet","doi":"10.1109/IPTA.2010.5586743","DOIUrl":"https://doi.org/10.1109/IPTA.2010.5586743","url":null,"abstract":"In Precision Agriculture, remote sensors such as imaging systems are commonly used to manage site-specific weeds. Although there are several algorithms using spatial information, few tests proving their efficiency have been performed on relevant database. In this paper we propose an innovative approach based on a simple model that simulates virtual crops to evaluate the robustness and efficiency of any crop/weed discrimination algorithm. A two-dimensional statistical and spatial crop field model is presented: it allows the design of virtual crops with given characteristics (plant size, inter-row width…) for various species (wheat, sunflower, maize…). The Weed Infestation Rate is set on demand at three different spatial distributions (point, aggregate, or a mixture) providing the diversity of the resulting simulated field. The spatial realism of the model is validated by two spatial descriptors (nearest neighbor method and Besag's function) at different scales through a pair of real/virtual pictures.","PeriodicalId":236574,"journal":{"name":"2010 2nd International Conference on Image Processing Theory, Tools and Applications","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130711490","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 : 2010-07-07DOI: 10.1109/IPTA.2010.5586721
Alexander Cerón, Augusto Salazar, F. Prieto
In this work, the behavior of six curvature-based shape descriptors k1, k2, Mean, Gaussian, Shape Index, and Curvedness computed at different locations of the face surface was evaluated over synthetic face models and 3D face range images data sets in order to establish the one that offers better discriminancy in different cases. A set of points selected from relevant parts of the human face was extracted. For evaluating the six descriptors over the selected points, the Fisher coefficient was used. Two kinds of tests were designed; the first one, to establish which descriptor is the most representative over all the set of points (global relevance); the second test was performed with sub sets of points from selected regions (local relevance). Finally, we obtain which descriptors have the most relevant information in the selected points of the face surface, which is an important step before performing a classification or recognition process.
{"title":"Relevance analysis of 3D curvature-based shape descriptors on interest points of the face","authors":"Alexander Cerón, Augusto Salazar, F. Prieto","doi":"10.1109/IPTA.2010.5586721","DOIUrl":"https://doi.org/10.1109/IPTA.2010.5586721","url":null,"abstract":"In this work, the behavior of six curvature-based shape descriptors k1, k2, Mean, Gaussian, Shape Index, and Curvedness computed at different locations of the face surface was evaluated over synthetic face models and 3D face range images data sets in order to establish the one that offers better discriminancy in different cases. A set of points selected from relevant parts of the human face was extracted. For evaluating the six descriptors over the selected points, the Fisher coefficient was used. Two kinds of tests were designed; the first one, to establish which descriptor is the most representative over all the set of points (global relevance); the second test was performed with sub sets of points from selected regions (local relevance). Finally, we obtain which descriptors have the most relevant information in the selected points of the face surface, which is an important step before performing a classification or recognition process.","PeriodicalId":236574,"journal":{"name":"2010 2nd International Conference on Image Processing Theory, Tools and Applications","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132095707","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 : 2010-07-07DOI: 10.1109/IPTA.2010.5586830
J. Benois-Pineau
With the fastly developing standards for video compression, the availability of the video content at a large scale in the compressed form has become an everyday reality. Compressed video streams whatever is the compression standard contain primary information which without full decompression of the content can serve for its indexing and retrieval. This primary features optimized for the compression purposes are very often noisy and subject to compression artefacts. Hence their re-use for analysis and indexing purposes remains a challenge. In this paper we present the methodology which starting from the early low - resolution standards of MPEG family up to the new high-quality-high definition video compression approaches aims at answering the same question: how to re-use noisy primary features for fast and efficient video indexing.
{"title":"Indexing of compressed video: Methods, challenges, applications","authors":"J. Benois-Pineau","doi":"10.1109/IPTA.2010.5586830","DOIUrl":"https://doi.org/10.1109/IPTA.2010.5586830","url":null,"abstract":"With the fastly developing standards for video compression, the availability of the video content at a large scale in the compressed form has become an everyday reality. Compressed video streams whatever is the compression standard contain primary information which without full decompression of the content can serve for its indexing and retrieval. This primary features optimized for the compression purposes are very often noisy and subject to compression artefacts. Hence their re-use for analysis and indexing purposes remains a challenge. In this paper we present the methodology which starting from the early low - resolution standards of MPEG family up to the new high-quality-high definition video compression approaches aims at answering the same question: how to re-use noisy primary features for fast and efficient video indexing.","PeriodicalId":236574,"journal":{"name":"2010 2nd International Conference on Image Processing Theory, Tools and Applications","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133789253","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 : 2010-07-07DOI: 10.1109/IPTA.2010.5586761
Francisco Pedro Luque, F. Luque, C. Lastres, A. Santamaria, Iris Galloso, Jordi Muria
Residential gateways are systems based on different control technologies that provide a unified way of communication for various devices and appliances present in homes and buildings (sensors, control systems, electronic devices, etc.). The massive introduction of residential gateways in the market is often hindered by the lack of intuitive configuration and visualization interfaces. Moreover, users frequently obtain very limited feedback about the status of the building after the actions carried out by the residential gateway, what reduces the confidence in such systems.
{"title":"Virtual Domotic Systems: a 3D interaction technique to control virtual building devices using residential gateways","authors":"Francisco Pedro Luque, F. Luque, C. Lastres, A. Santamaria, Iris Galloso, Jordi Muria","doi":"10.1109/IPTA.2010.5586761","DOIUrl":"https://doi.org/10.1109/IPTA.2010.5586761","url":null,"abstract":"Residential gateways are systems based on different control technologies that provide a unified way of communication for various devices and appliances present in homes and buildings (sensors, control systems, electronic devices, etc.). The massive introduction of residential gateways in the market is often hindered by the lack of intuitive configuration and visualization interfaces. Moreover, users frequently obtain very limited feedback about the status of the building after the actions carried out by the residential gateway, what reduces the confidence in such systems.","PeriodicalId":236574,"journal":{"name":"2010 2nd International Conference on Image Processing Theory, Tools and Applications","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124408644","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
扫码关注我们
求助内容：
应助结果提醒方式：