- Research Article
- Open Access
Feature-Based Image Comparison for Semantic Neighbor Selection in Resource-Constrained Visual Sensor Networks
© Yang Bai and Hairong Qi. 2010
- Received: 28 December 2009
- Accepted: 20 September 2010
- Published: 26 September 2010
Visual Sensor Networks (VSNs), formed by large number of low-cost, small-size visual sensor nodes, represent a new trend in surveillance and monitoring practices. Sensor collaboration is essential to VSNs and normally performed among sensors having similar measurements. The directional sensing characteristics of imagers and the presence of visual occlusion present unique challenges to neighborhood formation, as geographically-close neighbors might not monitor similar scenes. In this paper, we propose the concept of forming semantic neighbors, where collaboration is only performed among geographically-close nodes that capture similar images, thus requiring image comparison as a necessary step. To avoid large amount of data transfer, we propose feature-based image comparison as features provide more compact representation of the image. The paper studies several representative feature detectors and descriptors, in order to identify a suitable feature-based image comparison system for the resource-constrained VSN. We consider two sets of metrics from both the resource consumption and accuracy perspectives to evaluate various combinations of feature detectors and descriptors. Based on experimental results obtained from the Oxford dataset and the MSP dataset, we conclude that the combination of Harris detector and moment invariants presents the best balance between resource consumption and accuracy for semantic neighbor formation in VSNs.
- Sensor Network
- Discrete Wavelet Transform
- Scale Invariant Feature Transform
- Visual Sensor
- Moment Invariant
At the convergence of advances in computer vision, imaging, embedded computing, and sensor networks, Visual Sensor Networks (VSNs) emerge as a cross-disciplinary research field and are attracting more and more attention. A VSN is a group of networked visual sensors with image/video capturing, computing, and wireless communication capabilities powered by on-board batteries [1, 2]. From the perspective of a single node, it is built at low cost, resulting in limited sensing, processing, and communication capabilities. However, the low cost of single sensor nodes makes it possible to randomly deploy a large number of them, and through collaboration, some challenging high-level vision tasks can be achieved. The application of VSNs has spanned a wide spectrum of domains, including environmental surveillance, human behavior monitoring, and object tracking and recognition [3, 4].
Generally speaking, collaboration among sensors is achieved through sensing the same area from similar or different perspectives as well as exchanging/fusing their measurements, based on which a more panoramic understanding toward the sensing area can be built. In order to collaborate, sensors should firstly form clusters such that within each cluster, they would have similar measurements for the same scene. This cluster formation process is relatively easy for wireless sensor networks using scalar sensors, whose sensing range is normally omnidirectional, and the geographical closeness of scalar sensors implies the similarities among their measurements. However, for visual sensors, this process is a lot different. On one hand, the sensing range of a visual sensor, that is, the Field of View (FOV), is directional. On the other hand, visual occlusions ubiquitously exist. Hence, geographical closeness can no longer guarantee measurement similarity.
In this paper, we propose to form the semantic neighborhood for collaboration purpose based on image comparison among g-neighbors. Direct image comparison using raw image data is almost prohibited in VSNs due to their resource-constrained nature. The communication bandwidth in VSNs is typically low and is not equipped for frequent large amount of data transfer. In addition, due to the fact that the radio transceiver accounts for most of the energy consumption in all activities (e.g., sensing, processing, etc.) on a typical sensor node , the limited on-board battery could not support large amount of data transfer. Therefore, we propose feature-based image comparison for s-neighbor formation as image features can be more compact than the raw image in terms of data volume but still provide good representation of the image content. And we will examine combinations of feature detectors and descriptors, including the detectors used in SIFT and SURF, wavelet-based detector, Harris detector and the descriptors used in SIFT and SURF, and moment invariants, to identify a suitable feature-based image comparison system for the resource-constrained VSN.
The organization of this paper is as follows. Section 2 reviews the related work in feature-based image comparison algorithms and neighbor selection for Wireless Sensor Networks; Section 3 explains the proposed feature-based image comparison method; Section 4 provides performance comparison based on two datasets and examines how image overlap affects the performance of the feature-based image comparison method; Section 5 concludes this paper.
This paper studies the feature-based image comparison method for s-neighbor selection in visual sensor networks. Hence, this section reviews literatures from two perspectives, image comparison using features and neighbor selection in sensor networks in general. We also describe the difference between this paper and our previously published work. Moreover, we compare the feature detection/description techniques used for image comparison in VSNs and those developed for general Content-Based Image Retrieval (CBIR) systems.
2.1. Feature-Based Image Comparison
In computer vision terminologies, image feature is a mathematical description of the raw image. Generally speaking, comparing the image features is more effective and accurate than comparing raw images. Three steps are involved for feature-based image comparison: feature detection, feature description, and feature matching.
where denotes the average intensity within a window surrounding the pixel. Harris and Stephens used a circular Gaussian averaging window, so that the corner strength measure can suppress the noise and the calculation is isotropic.
Fauqueur et al. proposed a keypoint detection method that applies Dual Tree Complex Wavelet Transform (DTCWT) . They built a "Keypoint Energy Map'' for localizing keypoints from decimated DTCWT coefficients, and the keypoint scale parameter is determined by the gradient minima of the keypoint energy map in its vicinity. However, the DTCWT analysis is redundant, that is, the data volume of the decomposition structure is more than that of the original image and thus incurs additional computational cost and data storage.
In Scale Invariant Feature Transform (SIFT), Lowe proposed to use the Difference of Gaussian (DoG) operator to detect keypoints (blob-like features) in multiscale space . DoG is an approximation of Laplacian of Gaussian (LoG) intending to speed up the computation, and the latter was used to detect edges in images. To filter out the edge responses from DoG, Lowe added a postprocessing step that relies on analyzing eigenvalues of the Hessian matrix in a similar way as Harris did in his detector. To speed up image feature detection, Bay et al. proposed the Speeded-Up Robust Feature (SURF) . SURF relies on the Hessian matrix for interest point detection and approximates it by a series of predefined templates suitable for fast convolution using integral images .
The second step in image comparison is to describe the detected feature points. The descriptor should be distinctive and invariant to noise, geometric, and photometric deformations. In SIFT, the feature descriptor is a histogram of the oriented local gradients around the keypoint. The bins of the histogram are stored in a vector typically with 128 entries. In SURF, the descriptor is composed of the Haar wavelet responses with typically 64 entries. Compared to the 128-entry or 64-entry feature descriptors, there is also the moment invariants feature descriptor which is of much lower dimension . The "moment invariants'' is a vector containing 7 entries and is invariant to translation, scale, and rotation changes.
The third step in image comparison is feature matching, both SIFT and SURF use Euclidean distance as a similarity measure because all entries in the feature descriptor have comparable magnitudes and thus can be properly normalized. For moment invariants, Mahalanobis distance is used.
2.2. Neighbor Selection in Sensor Networks
In sensor networks, a neighborhood is defined as a group of nearby sensors taking the same or similar measurements. Depending on the characteristics of sensing devices, the neighbor selection algorithms can be very different. In traditional sensor networks where scalar sensing is used, the sensors are generally omnidirectional, and their measurements are mostly related to the distance between the event point and the sensor, which implies that the closer two sensors stand, the more similar their measurements are. That is, the neighborhood is determined based on distances between sensors.
The concept of neighbor selection originated from sensor networks under the name "cooperative strategies'' and was used to prolong the network lifetime by arranging an efficient sleep-wakeup selection among neighbor nodes . This method puts some nodes within the neighborhood into the sleep mode for energy conservation purpose when its neighbors are capable of taking measurements. Chen et al. introduced a power-saving technique named SPAN which assumes that every node is aware of its active neighbors within a 2-hop distance and exchanges this active-neighbor information with its peers . All nodes can thus use this information to decide which node to turn off. Ye et al. proposed a Probing Environment and Adaptive Sleeping (PEAS) protocol that puts the node into the sleep mode as long as possible if there is a nearby active node within its neighborhood . Younis and Fahmy presented a Hybrid Energy-Efficient Distributed (HEED) clustering protocol to organize the ad hoc network in clusters and select cluster head based on node's power level and proximity to its neighbors . Among all these studies, the neighborhood information is regarded as trivial since it is only determined by the geographical distance between node pairs.
On the other hand, visual sensors are usually directional sensing devices. Therefore, their measurement similarity depends not only on their distances, but also on the content of the images captured. For example, two surveillance cameras on the two sides of a wall pointing at opposite directions are geographically close, but they are not capturing the same scene and hence should not be defined as neighbors. In this paper, we use feature-based image comparison method for s-neighbor selection where the s-neighbors should satisfy two conditions, geographically close and having similar measurements. The second condition essentially imposes the orientation and occlusion-free constraints.
Medeiros et al. distinguished the differences between scalar sensor networks and camera networks and proposed a light-weight event-driven sensor clustering protocol for a wireless camera network . But the focus of their work is in clustering protocol design, and a simple color histogram feature is used to find semantic neighbors.
2.3. Comparison to Our Previous Work
The feature-based image comparison framework in VSNs was first proposed as a conference publication by the authors . In that work, we focused on the design of a feature description algorithm, Extended-SURF, for better representation of the feature points, which uses a 128-element vector to describe a feature point.
In this paper, we focus more on the comprehensive performance evaluation regarding various combinations of feature detectors and descriptors, in order to arrive at an appropriate design option suitable for the resource-constrained VSN.
2.4. Comparison to Features Used in Content-Based Image Retrieval
Content-Based Image Retrieval (CBIR) is a technique that uses the visual content of an image as the query to retrieve similar images from an image database. The visual content of each image is represented by image signatures built from various image features . A group of local features, such as color-based features, texture features, shape features, and local invariant-based features are broadly adopted in CBIR systems, among which the local invariant-based features, including SIFT and SURF, are receiving much attention because of their robustness to scale and affine variances.
Although both a CBIR system and a VSN adopt image feature detection/description algorithms, their selection criteria are different. For a CBIR system, the feature detection and description can be performed offline, leaving less concern on the computational cost of the algorithms. For a VSN, all feature detection and description processes need to be carried out in real time within the network, demanding feature detectors/descriptors with low computational cost and the resulting image features to be compact and effective.
In this section, we detail the three steps, that is, feature detection, feature description, and feature matching, in feature-based image comparison.
3.1. Feature Detection
We evaluate the performance of four feature detectors, including the feature detectors used in SIFT and SURF, Harris corner detector, and an improved DWT-based detector.
The feature detection method in SIFT involves two steps . The first step is to calculate the Difference of Gaussian of the image and find local extremes in scale space. This step is to detect all possible keypoints that bear blob-like patterns. The second step is to calculate the Hessian matrix at each keypoint location from step one and reject those keypoints if their Hessian matrices have two significantly different eigenvalues. Essentially this operation excludes the keypoints detected on edges.
The feature detection method in SURF detects the interest points by finding the local extremes of the determinant of Hessian matrix at each pixel. SURF utilizes integral images for fast convolution, and the Hessian matrix at each pixel is approximated by a series of predefined templates. Compared to SIFT, the computational efficiency of feature detection in SURF has been improved to a great extent. However, they still cannot compete with the Harris detector or the improved DWT-based detector.
Here, we propose a computationally light-weight corner detector based on Discrete Wavelet Transform (DWT) that is robust to both scale change and noise. The algorithm includes two steps, with the first step localizing the corner points and the second step determining the scale parameter for each corner detected. In the first step, the DWT coefficients computed through Fast Wavelet Transform are used to build a corner strength map at each decomposition level and these maps are upsampled by Gaussian kernel interpolation to the original image size. These interpolated corner strength maps are then summed to build the corner strength measure. The local maxima of the corner strength measure are detected as corners. In the second step, the scale of the corner point is calculated to eliminate small-scale corners on discrete edges. The scale of a corner point is defined as a function of the corner distribution in its vicinity. We provide a fast calculation of the scale parameters utilizing a Gaussian kernel convolution.
3.2. Feature Description
As discussed in Section 2.1, SIFT uses a 128-element vector to describe each feature calculated from the image, and SURF uses a 64-element vector. When there are many feature points detected, transmission of the feature vectors is nontrivial. At the extreme case, the amount of data transferred in feature-based image comparison can be larger than that in raw data-based comparison. To further improve the transmission efficiency, we resort to the moment invariants, that is, a 7-element vector, to represent each corner point detected.
The 7-element feature descriptor is invariant to rotation, translation, and scale, making it a good candidate to overcome the two shortcomings of Harris detector, that is, corner point displacement and variant to rotation. It is calculated based on the texture-based statistical descriptor moment. For a detailed definition and calculation of the invariant moments, please refer to .
3.3. Feature Matching
The feature-based image comparison is based on the assumption that if two feature points in different images are corresponding to the same real-world point, then the two feature descriptors should be "close'' enough and they form a pair of matching features. If two images have enough number of matching features, we claim the two images are similar, implying they capture a similar scene.
There have been two popular distance metrics used, Euclidean distance and Mahalanobis distance. Mahalanobis distance is generally more accurate since it takes into account the covariance among the variables and is scale invariant. However, the calculation of the covariance matrix does incur additional cost. The closeness between the SIFT and SURF descriptors is evaluated using the Euclidean distance since all entries in the feature descriptor have similar scale and thus can be properly normalized. However, the Mahalanobis distance has to be adopted when evaluating the closeness among moment invariant descriptors as the scale of the 7 entries in the descriptor tends to vary a lot.
In this section, we perform thorough comparative study on feature-based image comparison with various combinations of the four feature detectors (i.e., SIFT detector, SURF detector, Harris detector, and the improved DWT-based detector) and the three feature descriptors (i.e., SIFT descriptor, SURF descriptor, and the moment invariants).
The performance is evaluated on two image datasets. The Oxford dataset contains images from different scenes and is for general image feature evaluation purpose . The same dataset was used in  to provide a performance evaluation of local descriptors. The second dataset is gathered from a small-size VSN testbed constructed in the Advanced Imaging and Collaborative Information Processing (AICIP) lab at the University of Tennessee. The images from the second dataset are taken in an office setup. Unlike the Oxford dataset, where images from different groups bear distinctive differences, all images taken from the small-size VSN have similarity to some degree, making feature-based image comparison more challenging.
To further investigate into how the degree of overlap between images affect the performance of feature-based image comparison, we adopt another dataset, the Columbia Object Image Library (COIL-100) set. The COIL-100 is a dataset containing images of 100 objects. Each object was placed on a motorized turntable against a black background, and the turntable rotated to vary the object's pose with respect to a fixed camera. An image was taken every time the turntable rotated (separation angle), generating images for each object with different poses. The image overlap can be evaluated by the separation angle between two images, the smaller the separation angle, the more overlap they have.
We use five metrics for performance evaluation purpose, that is, number of feature points detected, number of bytes transferred, computation time, recall, and precision. The first three metrics are straightforward and used to evaluate resource consumption of the algorithm. The latter two reflect algorithm performance compared to the ground truth.
The higher the recall, the less "misses'' compared to the true match; and the higher the precision, the less "false alarms''.
We also propose a so-called rank-based score function, where the performance of each detector/descriptor combination is ranked in terms of data volume, recall, and precision. Since there are altogether combinations of detector/descriptor, the rank for each of the three metrics is a number within the ( ) range with being the best and the worst. By taking the summation of the three ranks (i.e., data volume, recall, and precision) for each detector/descriptor combination, a single score (in the ( ) range) can be obtained, making it more convenient to evaluate detector/descriptor combinations across different performance metrics.
4.3. Window Size
A free parameter in the feature-based image comparison system is the size of local area (or window size) used to calculate local statistics around a detected feature point. We use the default window size from the SIFT and SURF descriptors, which is and , respectively. The window size for calculating the invariant moments is determined through empirical study. We use "graffiti'' images from the Oxford dataset, formed into image pairs whose perspective change can be represented by a homography matrix. The homography matrices are provided as the ground truth, so that we can calculate the correspondence between feature points. The recalls and precisions are averaged over resutls from the image pairs.
4.4. Finding Correspondence between Feature Points
When comparing the similarity between two images, the first step is to find the correspondence of detected feature points (or features) across the two images. The second step is to count the number of corresponding feature pairs. If this number is large enough, the two images are claimed to be "similar''.
Given two sets of feature descriptors generated by analyzing two images, for each feature descriptor in the first image, the distances between this descriptor and all feature descriptors in the second image are calculated. If the ratio between the smallest distance and the second smallest distance is below a threshold, the feature pair with the smallest distance is claimed to be a matching feature pair or that the two feature points that these two descriptors are describing correspond to each other. The threshold has been experimentally determined to be . Both SIFT and SURF use this threshold in their implementations.
4.5. Feature-Based Image Comparison on the Oxford Dataset
Recall and precision of each feature detector/descriptor combination. The test run on the Oxford dataset and results in the 4th through 6th columns are for each image on average. For reference, the average raw image volume is 574.2 KB. Assume that a float type number takes 4 Bytes in storage. (The number in the parentheses in columns 4, 5, and 6 indicates the "rank'' of the detector/descriptor combination in terms of the corresponding performance metric in that column. The "rank-based score'' in the last column is the summation of the three ranks along the row.)
No. of feature points
Feature data vol. (KB)
Harris + SIFT descr.
Harris + SURF descr.
DWT + SIFT descr.
DWT + SURF descr.
SIFT detec.+ M. I.
SURF detec.+ M. I.
Harris + M. I.
DWT + M.I.
From the aspect of computational speed, Harris detector takes seconds to detect corners on each image; the improved DWT-based detector takes 0.3727 seconds to detect 1145 corners on each image; SIFT takes seconds to detect 5938 keypoints on each image; SURF takes seconds to detect 1478 interest points on each image. Note that the Harris detector and the improved DWT-based detector are implemented in Matlab while the SIFT  and SURF  implementations are in C code. Considering the difference in implementation efficiency between Matlab and C, the speed between the Harris detector and the others would differ even more.
From Table 1, we observe that in terms of resource consumption, SIFT is the worst, considering it actually creates even larger volume of data than the raw image, with the slowest computational speed. Except for the combination of the DWT-based detector and the SIFT descriptor, which generates comparable data volume as the raw image, all other combinations of feature detector/descriptor provide savings in data volume and therefore data transmission, especially those using moment invariants.
In terms of performance accuracy, SIFT and SURF provide highest precision although the recalls are low. Harris detector performs well when used together with SIFT or SURF descriptor, generating better balance between recall and precision. The DWT-based corner detector does not perform as well as the Harris detector when used with SIFT or SURF descriptor. This is because the DWT-based detector is more sensitive to discretization noise caused by image rotations which happen to be very common in the Oxford dataset ( out of the groups contain strong rotational variations, another contain weak rotational variations).
In addition, by observing the fourth to seventh rows, we find out that the SIFT descriptor is superior to the SURF descriptor in terms of the precision. And from the eighth to eleventh rows, we observe that the moment invariants-based feature descriptors are all inferior to SIFT or SURF descriptors in terms of precision. Considering the definitions of recall and precision, a comparable recall value but extremely low precision value implies that there are too many False Positives (or false alarms).
Using the rank-based overall score, four combinations perform noticeably better than the others, including Harris + SIFT, Harris + SURF, Harris + Moment Invariants, and DWT-based + Moment Invariants. We see that 3 out of the 4 best combinations involve Harris detector, and moment invariants, as a descriptor, appear twice in the top 4.
4.6. Feature-Based Image Comparison on the MSP Image Dataset
We apply the combinations of feature detector/descriptor on the images, and every feature set will be selected as the query to be compared with the others. The ground truth is found from the knowledge of the deployment map, through which we would know which MSP is shooting at the same scene as other MSPs and therefore build the image matching relations.
Recall and precision of each feature detector/descriptor combination. The test run on the MSP dataset and results in the 4th through 6th columns are for each image on average. For reference, the average raw image volume is 19.2 KB. Assume a float type number takes 4 Bytes in storage. (The numbers in the parentheses in columns 4, 5, and 6 indicate the "rank'' of the detector/descriptor combination in terms of the corresponding performance metric in that column. The "rank-based score'' in the last column is the summation of the three ranks along the row.)
No. of feature points
Feature data vol. (KB)
Harris + SIFT descr.
Harris + SURF descr.
DWT + SIFT descr.
DWT + SURF descr.
SIFT detec.+ M. I.
SURF detec.+ M. I.
Harris + M. I.
DWT + M. I.
In terms of performance accuracy, as we expected, all combinations of feature detector/descriptor give us worse results compared to those generated from the Oxford dataset. As a reference, the most mature image features, SIFT and SURF, could only provide a very low precision of and , respectively, with SURF providing the highest recall. By observing rows through , we find out that SIFT descriptors are superior to SURF descriptors in terms of precision, which is consistent with the Oxford dataset. According to the eighth to eleventh rows, the moment invariants-based descriptors are still inferior to SIFT or SURF descriptors, but for this dataset, the margin is much smaller.
For detectors, Harris detector and DWT-based detector are comparable in terms of recall and precision. This conclusion is different from that of the Oxford dataset, because in the MSP dataset, all images are taken with MSPs laying down on the ground, and there is little rotational variation in images.
Measured from the rank-based overall score, Harris detector plus Moment Invariants prevails and SURF ranks the second.
4.7. Feature-Based Image Comparison on the COIL-100 Dataset
By comparing Tables 1 and 2, the recall and precision rates for the MSP dataset are severely worse than those for the Oxford dataset. Although both datasets contain image pairs having similar scenes, the degree of overlap in the similar image is different. The similar images in Oxford dataset have much more overlap than those in the MSP dataset. The third experiment is designed to reveal the relationship between the amount of image overlap and the algorithm performance in terms of recall and precision rates.
The recall and precision, as well as their summations, are plotted separately in Figure 8. Recall and precision are two contradictory indices in that when other conditions are the same, lower recall rate would result in higher precision rate and vice versa. Therefore, their summation is used to illustrate the general trend of the performance degradation. We use the summation instead of the average of recall and precision to provide an offset, so that the curve can be better visualized. The summation curve stays stable when there is a separation angle between the two images of the same object; when the separation angle increases to , the curve drops to . The curve drops to its minimum when the separation angle is , with a performance degradation of , after which the performance starts to improve with the curve climbing back up.
We conclude from Figure 8 that the feature-based image comparison method (specifically, using Harris detector plus SIFT descriptor) can perform well (within degradation) as long as the similar images have a certain degree of overlap that corresponds to a separation angle in viewpoints. But as the amount of overlap decreases, the performance drops to . Note that these measurements have not considered the factor of distance variations between the camera and the object, which would further reduce the performance. The performance improvements beyond the separation angle of are due to the fact that the objects used in our experiment all show circular symmetry.
A Visual Sensor Network environment is a more challenging setup for feature-based image comparison algorithms. First of all, it poses difficulties for image comparison itself by having to differentiate images of much similarity. Second, it requires the algorithms to be computationally of light weight, so that the low-end processor can afford running it. Finally, it requires the feature set to be compact enough, so that the transmission overhead is low.
From our experiments, although mature image features, SIFT or SURF, could perform well on general image comparison problems, such as the Oxford dataset, their performances degrade severely in the VSN environment, where images have high similarity. Moreover, their computational burden and large volume of feature sets are strictly prohibitive for the VSN. On the other hand, simple feature detectors, like the Harris detector or the proposed improved DWT-based detector, combined with the compact moment invariants-based feature descriptor, show their advantages in terms of low resource consumption and comparable performance over the mature image features.
The low performance accuracy for feature-based image comparison in VSNs is due to the fact that the images have high similarities as the common background exists in all images. Therefore, one way to increase the performance accuracy is to perform background removal techniques prior to image feature detection.
The paper studied the feature-based image comparison methods for Visual Sensor Networks where the resources are stringent. The purpose of this study is to cluster visual sensors into different semantic neighborhoods to facilitate collaboration. Four image feature detectors, Harris detector, the improved DWT-based corner detector, SIFT detector, and SURF detector, as well as three image feature descriptors, SIFT descriptor, SURF feature descriptor, and moment invariants-based feature descriptor were examined, and different detector/descriptor combinations were tested on two image datasets. Although for general image comparison problems SIFT and SURF provide better performance in terms of accuracy, our experiment showed that for VSNs, where all images have high similarity, simple feature detectors, like Harris detector, DWT-based detector, and compact feature descriptors, like the moment invariants-based descriptor, can provide comparable performance in terms of accuracy but much superiority in terms of resource consumption. Overall, the Harris detector plus the moment invariant provides the best balance between resource consumption and performance accuracy.
This work was supported in part by National Science Foundation under Grant NSF ECS-0449309 and NSF CNS-1017156.
- Kundur D, Lin C-Y, Lu C-S: Visual sensor networks. EURASIP Journal on Advances in Signal Processing 2007., 2007:Google Scholar
- Soro S, Heinzelman W: A survey of visual sensor networks. Advances in Multimedia 2009, 2009:-21.Google Scholar
- Obraczka K, Manduchi R, Garcia-Luna-Aveces JJ: Managing the information flow in visual sensor networks. Proceedings of the 5th International Symposium on Wireless Personal Multimedia Communications, 2002 3: 1177-1181.View ArticleGoogle Scholar
- Sankaranarayanan AC, Veeraraghavan A, Chellappa R: Object detection, tracking and recognition for multiple smart cameras. Proceedings of the IEEE 2008,96(10):1606-1624.View ArticleGoogle Scholar
- Estrin D: Tutorial on wireless sensor networks: sensor network protocols. Proceedings of the 8th Annual International Conference on Mobile Computing and Networking (MobiCom '02), 2002Google Scholar
- Harris C, Stephens M: A combined corner and edge detector. Proceedings of the 4th Alvey Vision Conference, 1988 77-116.Google Scholar
- Fauqueur J, Kingsbury N, Anderson R: Multiscale keypoint detection using the dual-tree complex wavelet transform. Proceedings of IEEE International Conference on Image Processing, 2006 1625-1628.Google Scholar
- Lowe DG: Distinctive image features from scale-invariant keypoints. International Journal of Computer Vision 2004,60(2):91-110.View ArticleGoogle Scholar
- Bay H, Tuytelaars T, van Gool L: SURF: speeded up robust features. Proceedings of the 9th European Conference on Computer Vision (ECCV '06), 2006, Lecture Notes in Computer Science 3951: 404-417.Google Scholar
- Viola P, Jones M: Rapid object detection using a boosted cascade of simple features. Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '01), December 2001 I511-I518.Google Scholar
- Hu M-K: Visual pattern recognition by moment invariants. IRE Transactions on Information Theory 1962, 8: 179-187.MATHGoogle Scholar
- Blough DM, Santi P: Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary ad hoc networks. Proceedings of the Annual International Conference on Mobile Computing and Networking (MOBICOM '02), September 2002, Atlanta, Ga, USA 183-192.View ArticleGoogle Scholar
- Chen B, Jamieson K, Balakrishnan H, Morris R: Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks. Wireless Networks 2002,8(5):481-494. 10.1023/A:1016542229220View ArticleMATHGoogle Scholar
- Ye F, Zhong G, Cheng J, Lu S, Zhang L: PEAS: a robust energy conserving protocol for long-lived sensor networks. Proceedings of the 23th IEEE International Conference on Distributed Computing Systems, May 2003 28-37.Google Scholar
- Younis O, Fahmy S: HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks. IEEE Transactions on Mobile Computing 2004,3(4):366-379. 10.1109/TMC.2004.41View ArticleGoogle Scholar
- Medeiros H, Park J, Kak A: A light-weight event-driven protocol for sensor clustering in wireless camera networks. Proceedings of the 1st ACM/IEEE International Conference on Distributed Smart Cameras (ICDSC '07), September 2007, Vienna, Austria 203-210.Google Scholar
- Bai Y, Qi H: Redundancy removal through semantic neighbor selection in visual sensor networks. Proceedings of the 3rd ACM/IEEE International Conference on Distributed Smart Cameras (ICDSC '09), August-September 2009, Como, Italy 1-8.Google Scholar
- Datta R, Joshi D, Li J, Wang JZ: Image retrieval: ideas, influences, and trends of the new age. ACM Computing Surveys 2008.,40(2, article 5):Google Scholar
- Gonzalez RC, Woods RE: Digital Image Processing. 3rd edition. Prentice-Hall, Upper Saddle River, NJ, USA; 2007.Google Scholar
- Mikolajczyk K, Schmid C: A performance evaluation of local descriptors. IEEE Transactions on Pattern Analysis and Machine Intelligence 2005,27(10):1615-1630.View ArticleGoogle Scholar
- Beall C, Qi H: Distributed self-deployment in visual sensor networks. Proceedings of the 9th International Conference on Control, Automation, Robotics and Vision (ICARCV '06), December 2006 1-6.Google Scholar
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.