A. Barczak, N. Reyes, Teo Susnjak, Martin J. Johnson
{"title":"Real-time computation of moment invariants combined with contrast stretching","authors":"A. Barczak, N. Reyes, Teo Susnjak, Martin J. Johnson","doi":"10.5281/ZENODO.42493","DOIUrl":"https://doi.org/10.5281/ZENODO.42493","url":null,"abstract":"There is a large body of evidence that demonstrates the practicable use of moment invariants in real-time computer vision applications. Object detection, recognition and tracking are some of them, to name a few. However, the efficacy of moment invariants is highly susceptible to varying illumination conditions, which is inherent in real-world applications. Contrast stretching alleviates the problem, but performing contrast stretching prior to the calculation of moment invariants is computationally intensive and not suitable for real-time use. We address this problem by proposing an efficient real-time method that integrates the calculation of moment invariants up to the 4th order with a contrast stretching operation (all in one go), by utilising Summed-Area Tables (SATs). The method is limited to general contrast stretching, not necessarily covering very distinct illumination sources from different directions; that is, illumination conditions that create extra strong edges. We test the proposed method with a popular benchmarking image database (Amsterdam Library of Object Images) that is publicly available. Such images were acquired in a controlled environment, demonstrating varying lighting conditions. We show empirically that the method works in real-time and accurate enough for practical object detection applications.","PeriodicalId":331889,"journal":{"name":"2011 19th European Signal Processing Conference","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133626815","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}
{"title":"Enhancement of multi-valued images using PDE coupling","authors":"S. Bettahar, A. Stambouli, P. Lambert, A. Benoît","doi":"10.5281/ZENODO.42385","DOIUrl":"https://doi.org/10.5281/ZENODO.42385","url":null,"abstract":"In this paper, we present a new model for the enhancement of noisy and blurred multi-valued images. The proposed model is based on using single vectors of the gradient magnitude and the second derivatives as a manner to relate different colour components of the image. This model can be viewed as a generalization of Bettahar-Stambouli filter to multi-valued images. The proposed algorithm is more efficient than the mentioned filter and some previous works at colour images denoising and deblurring without creating false colours.","PeriodicalId":331889,"journal":{"name":"2011 19th European Signal Processing Conference","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134343107","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}
J. Nsenga, S. Dawans, V. Ramon, A. Bourdoux, F. Horlin
{"title":"Residual energy-aware collaborative transmission beamforming in wireless sensor networks","authors":"J. Nsenga, S. Dawans, V. Ramon, A. Bourdoux, F. Horlin","doi":"10.5281/ZENODO.42629","DOIUrl":"https://doi.org/10.5281/ZENODO.42629","url":null,"abstract":"Energy-Efficient transmission techniques are very important for extending the lifetime of a wireless sensor network (WSN) given that recharging batteries of a large number of WSN nodes is a very difficult and expensive operation. Collaborative transmission beamforming (CTB) saves energy consumed by each node by distributing between different WSN nodes the required total power transmission to get a desired bit error rate (BER) at the receiver. Moreover, by coherently combining the different signals transmitted by the WSN nodes, CTB increases the signal strength in the direction of the receiver, therefore decreases the total power transmission of the WSN. In this paper, we propose a new CTB technique that minimizes the total power transmission of the WSN while balancing the residual energy in different nodes. By solving this multi-objective optimization problem, we show that the WSN lifetime can be improved up to 30 % compared to the basic CTB algorithm, which aims at minimizing the total power transmission without taking into account the residual energy.","PeriodicalId":331889,"journal":{"name":"2011 19th European Signal Processing Conference","volume":"81 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123269175","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}
{"title":"Iterative cosparse projection algorithms for the recovery of cosparse vectors","authors":"R. Giryes, Sangnam Nam, R. Gribonval, M. Davies","doi":"10.5281/ZENODO.42621","DOIUrl":"https://doi.org/10.5281/ZENODO.42621","url":null,"abstract":"Recently, a cosparse analysis model was introduced as an alternative to the standard sparse synthesis model. This model was shown to yield uniqueness guarantees in the context of linear inverse problems, and a new reconstruction algorithm was provided, showing improved performance compared to analysis ℓ1 optimization. In this work we pursue the parallel between the two models and propose a new family of algorithms mimicking the family of Iterative Hard Thresholding algorithms, but for the cosparse analysis model. We provide performance guarantees for algorithms from this family under a Restricted Isometry Property adapted to the context of analysis models, and we demonstrate the performance of the algorithms on simulations.","PeriodicalId":331889,"journal":{"name":"2011 19th European Signal Processing Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123401191","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}
{"title":"A compression method for 3-D laser range scans of indoor environments based on compressive sensing","authors":"Oguzcan Dobrucali, B. Barshan","doi":"10.5281/ZENODO.42501","DOIUrl":"https://doi.org/10.5281/ZENODO.42501","url":null,"abstract":"Modeling and representing 3-D environments require the transmission and storage of vast amount of measurements that need to be compressed efficiently. We propose a novel compression technique based on compressive sensing for 3-D range measurements that are found to be correlated with each other. The main issue here is finding a highly sparse representation of the range measurements, since they do not have highly sparse representations in common domains, such as the frequency domain. To solve this problem, we generate sparse innovations between consecutive range measurements along the axis of the sensor's motion. We obtain highly sparse innovations compared with other possible ones generated by estimation and filtering. Being a lossy technique, the proposed method performs reasonably well compared with widely used compression techniques.","PeriodicalId":331889,"journal":{"name":"2011 19th European Signal Processing Conference","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122953882","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}
{"title":"Segmentation through DWT and adaptive morphological closing","authors":"N. Haq, K. Hayat, S. H. Shirazi, W. Puech","doi":"10.5281/ZENODO.42547","DOIUrl":"https://doi.org/10.5281/ZENODO.42547","url":null,"abstract":"Object segmentation is an essential task in computer vision and object recognitions. In this paper, we present an image segmentation technique that extract edge information from wavelet coefficients and uses mathematical morphology to segment the image. We threshold the image to get its binary version and get a high-pass image by the inverse DWT of its high frequency subbands from the wavelet domain. This is followed by an adaptive morphological closing operation that dynamically adjusts the structuring element according to the local orientation of edges. The ensued holes are, subsequently, filled by a morphological fill operation. For comparison, we are relying on the well-established Canny's method and show that, for images with low-textured background, our method performs better.","PeriodicalId":331889,"journal":{"name":"2011 19th European Signal Processing Conference","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123650356","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}
Mehrdad Yaghoobi, Sangnam Nam, R. Gribonval, M. Davies
{"title":"Analysis operator learning for overcomplete cosparse representations","authors":"Mehrdad Yaghoobi, Sangnam Nam, R. Gribonval, M. Davies","doi":"10.5281/ZENODO.42656","DOIUrl":"https://doi.org/10.5281/ZENODO.42656","url":null,"abstract":"We consider the problem of learning a low-dimensional signal model from a collection of training samples. The mainstream approach would be to learn an overcomplete dictionary to provide good approximations of the training samples using sparse synthesis coefficients. This famous sparse model has a less well known counterpart, in analysis form, called the cosparse analysis model. In this new model, signals are characterized by their parsimony in a transformed domain using an overcomplete analysis operator. We propose to learn an analysis operator from a training corpus using a constrained optimization program based on L1 optimization. We derive a practical learning algorithm, based on projected subgradients, and demonstrate its ability to robustly recover a ground truth analysis operator, provided the training set is of sufficient size. A local optimality condition is derived, providing preliminary theoretical support for the well-posedness of the learning problem under appropriate conditions.","PeriodicalId":331889,"journal":{"name":"2011 19th European Signal Processing Conference","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122054518","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}
{"title":"Fractal coding of image-color spaces for saliency-based object detection in naturally complex scenes","authors":"K. Kamejima","doi":"10.5281/ZENODO.42291","DOIUrl":"https://doi.org/10.5281/ZENODO.42291","url":null,"abstract":"A saliency-based approach is presented for object detection in naturally complex scenes. By regenerating the chromatic diversity in a probabilistic color space, the distribution of saliency colors is extracted as the viewer specific visualization of landmark objects. The saliency distribution is articulated into a system of fractal attractors spanning object images. Detected fractal models are visualized according to the perspective underlying the scene image.","PeriodicalId":331889,"journal":{"name":"2011 19th European Signal Processing Conference","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124169772","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}
{"title":"A hierarchical multiwavelet based stereo correspondence matching technique","authors":"P. B. Zadeh, C. Serdean","doi":"10.5281/ZENODO.42335","DOIUrl":"https://doi.org/10.5281/ZENODO.42335","url":null,"abstract":"This paper presents a hierarchical stereo correspondence matching technique based on multiwavelet transforms. A global error energy minimization technique is employed to generate a disparity map for each of the four multiwavelet approximation subband pairs. The information in the four disparity maps is then combined using a Fuzzy algorithm to generate a single disparity map. This initial disparity map is estimated at the lowest resolution and needs to be progressively passed on to higher resolution levels. Hence, the search at higher resolution levels is significantly reduced, thereby reducing the computational cost of the overall process and improving the reliability of the final disparity map. Results show that the proposed technique produces a smoother disparity map with less mismatch errors compared to applying the same method in both spatial and wavelet domains. The proposed algorithm fares very well when compared to other state of art techniques from the Middlebury database.","PeriodicalId":331889,"journal":{"name":"2011 19th European Signal Processing Conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124775076","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}
{"title":"A real-time stereo matching algorithm using graphic hardware and hierarchical method","authors":"Sang Hwa Lee, Siddharth Sharma","doi":"10.5281/ZENODO.42390","DOIUrl":"https://doi.org/10.5281/ZENODO.42390","url":null,"abstract":"This paper proposes a real-time stereo matching algorithm implemented in the graphic hardware. The likelihood model is parallelized and implemented using GPU programming for real-time operation. And the prior energy model is proposed to improve the accuracy of disparity estimation. First, the likelihood matching based on rank transform is implemented in GPU programming. The shared memory handling in graphic hardware is introduced in calculating the matching errors. Once an initial disparity map is determined based on the likelihood model, then the disparity map is iteratively updated by the prior model of disparity field. The prior model reflects the smoothness of disparity map and is implemented by a pixel-wise energy function. The disparity is determined by minimizing the joint energy function which combines the likelihood model with the prior model. These processes are performed in the hierarchical successive approximation approach. The disparity map is interpolated using color-based similarity. This paper evaluates the proposed approach with the Middlebury stereo images. According to the experiments, the proposed method shows good estimation accuracy with more than 30 frame/second for 640×480 images and 60 disparity range. The proposed method is expected real-time stereo camera systems to be popular in the usual PC environments.","PeriodicalId":331889,"journal":{"name":"2011 19th European Signal Processing Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116532890","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}