Research Article | Open Access

Changjun Zha, Yao Li, Jinyao Gui, Huimin Duan, Tailong Xu, "Compressive Imaging of Moving Object Based on Linear Array Sensor", *Journal of Electrical and Computer Engineering*, vol. 2016, Article ID 4560642, 6 pages, 2016. https://doi.org/10.1155/2016/4560642

# Compressive Imaging of Moving Object Based on Linear Array Sensor

**Academic Editor:**Raj Senani

#### Abstract

Using the characteristics of a moving object, this paper presents a compressive imaging method for moving objects based on a linear array sensor. The method uses a higher sampling frequency and a traditional algorithm to recover the image through a column-by-column process. During the compressive sampling stage, the output values of the linear array sensor are multiplied by a coefficient that is a measurement matrix element, and then the measurement value can be acquired by adding all the multiplication values together. During the reconstruction stage, the orthogonal matching pursuit algorithm is used to recover the original image when all the measurement values are obtained. Numerical simulations and experimental results show that the proposed compressive imaging method not only effectively captures the information required from the moving object for image reconstruction but also achieves direct separation of the moving object from a static scene.

#### 1. Introduction

In practical situations, objects that are observed moving across borders or uninhabited regions could be either human or animal, and there are considerable differences between their profiles [1, 2]. Large numbers of research results have indicated that it is feasible to determine which objects are human and which are animal based on these differences, but the current research is generally concerned with the acquisition and recognition of the object profile image [3–8]. For image acquisition, the most common method is the use of a linear array sensor to acquire the moving object image [9–11], but the acquired image is relatively simple and cannot show the object in greater detail, meaning that it is difficult to distinguish between similar actions on different objects. Therefore, how to obtain higher-resolution images when using only a small number of sensors has become a question that is worthy of exploration.

As one of the most important research fields in compressive sensing, compressive imaging can capture a small number of measurements to be used for image reconstruction, and the most typical compressive imaging is the single-pixel camera [12–14]. To acquire compressive measurements, the camera uses a single pixel and a spatial light modulator. However, before the single-pixel camera can capture all required measurements, the scene must be in a static state or state of only slight change [15]; otherwise, the original image cannot be reconstructed. In addition, at borders or in uninhabited regions, we only care about the moving object in the monitored region and do not require a static scene. However, the reconstructed image using the single-pixel camera contains both the object and the scene, and elimination of the static scene and realization of moving object compressive sampling are subjects that require further study. To solve this problem using a combination of a linear array sensor and the theory of compressive sensing, this paper proposes a compressive imaging method for moving objects based on compressive sensing. Theoretical analyses and experimental results demonstrate the effectiveness of the proposed method.

This paper is organized as follows. Section 2 introduces the principle of compressive sensing. Section 3 describes our proposed compressive imaging scheme in detail, and experimental results are provided in Section 4. Section 5 contains a summary of this paper and gives our conclusions.

#### 2. Theory of Compressive Sensing

Consider a one-dimensional sparse signal , which can be represented as a linear combination of the columns of :If only values are nonzero in the vector , then is the sparse representation of in the domain . For the sparse signal reconstruction problem, can be estimated by minimizing the -norm with the measurement matrix and the measurements :

Finally, the original signal can be reconstructed using the coefficient vector , which satisfies -minimization [16, 17]; that is,

In practice, when taking the effects of noise into account, (3) can be rewritten as where is the error tolerance [18–20].

For static objects, each projection measurement contains the same original information [15], but this does not apply for a moving object. We present a novel compressive imaging method to achieve compressive sampling of moving objects in the next section.

#### 3. Compressive Imaging System for Moving Object

Figure 1 shows the proposed compressive imaging system for moving objects based on a linear array sensor. Unlike single-pixel cameras, the system captures the moving object image measurements through a column-by-column process. The measurement is based on the inner product of the row vector of the measurement matrix and the output values of the linear array sensor.

Assume here that the image of the moving object is expressed as . We use the measurement matrix to capture compressive measurements of the th column vector of the image . Based on the theory of compressive sensing, these measurements can be expressed as ; that is,where and . During the compressive sampling stage, each row of the measurement matrix obtains a single measurement. When this measurement is obtained, the next row of the measurement matrix is used as the output coefficient of the sensor group. In this way, measurements of the th column vector of the image are obtained.

Because the object is in a state of motion, each of the rows of the measurement matrix samples different columns of the target image, as shown in Figure 2. Therefore, (5) should be rewritten as

**(a) Original image**

**(b) Measurement matrix**

**(c) Compressive sampling for static object**

**(d) Compressive sampling for moving object**

In general, the vectors are not equal, which means that the original image cannot be reconstructed from measurements that do not contain the same information.

In a real situation, when a person or an animal passes through the sensors’ field of view, the velocity is always limited. Therefore, we could capture effective measurements of the th column vector by using a higher sampling frequency. If we assume that the object’s average velocity is and the sensors’ sampling frequency is , then within a short time , the number of measurements can be expressed as

From (7), we see that when is fixed, becomes smaller and smaller as the sensors’ sampling frequency increases, and the differences among the columns in the range of also become smaller, as shown in Figure 3. Assuming that the vector acquired in corresponds to the th column vector of the original image, then the column vectors that were captured using the higher sampling frequency can be represented aswhere are the error vectors. By combining (6) with (8), we obtainwhere

At this point, the th column vector of the original image can be reconstructed using (4), which indicates that the entire image of the moving object can be obtained by merging all of the reconstructed columns.

For a static scene, the sensors acquire compressive measurements from the same column of the scene image. Thus, all of the columns of the reconstructed image are the same, and the reconstructed scene image is no longer the static scene that we can see.

To facilitate a clearer description, we assume that no moving objects are passing through the sensor’s field of view. The reconstructed column is then expressed as , and the reconstructed image can be represented aswhere . From (11), we can see that the reconstructed scene is a texture image. In other words, the static scene can be eliminated using the proposed compressive imaging method.

#### 4. Simulation Experiment and Analysis

To verify the validity of the proposed method, a single column pixel of an industrial camera is used to capture the data from a moving object. The number of single column pixels is 120 and the camera’s frame rate is 150 fps. Some frames of the real video and a portion of the collected data under different motions and different backgrounds are shown in Figure 4.

**(a) Some frames in real video**

**(b) Part of the data collected by a column of pixels in a camera**

Assuming that the sparsity level of each column in the original image is , then the numbers of measurements are 70, 80, 90, and 100, which represent the total numbers of 58.3%, 66.7%, 75%, and 83.3%, respectively; we then adopt the orthogonal matching pursuit algorithm to reconstruct the original image and obtain the results shown in Figure 5.

**(a)**

**(b)**

**(c)**

**(d)**

As shown in Figure 5, the proposed compressive imaging system can reconstruct the image of a moving object. Different from Figure 4(a), the reconstructed image contains only the moving object. It is clear that the reconstruction quality improves as the number of measurements increases.

#### 5. Conclusions

When a traditional single-pixel camera captures compressive measurements, the scene is required to remain in a state of rest. This paper proposed a compressive imaging method for a moving object, where the method generally adopts a higher sampling frequency to capture the measurements of the moving object through a column-by-column process. The results of simulations and real data experiments show that our method can reconstruct the image of a moving object and can separate the moving object from a static scene. Therefore, the proposed method is of practical significance for application to the monitoring of borders or uninhabited regions.

#### Competing Interests

The authors declare that they have no competing interests.

#### Acknowledgments

This work is supported by the Anhui Provincial Natural Science Foundation (no. 1508085QF118), the Hefei University Science Foundation (no. 2014xk06), the Key Projects of Research and Development Foundation of Hefei University (no. 14KY02ZD), and the Opening Foundation of Key Laboratory of Intelligent Computing & Signal Processing (Anhui University), Ministry of Education.

#### References

- D. J. Russomanno, E. M. Carapezza, M. Yeasin, E. Jacobs, M. Smith, and S. Sorower, “Sparse detector sensor: profiling experiments for broad-scale classification,” in
*Proceedings of the Unattended Ground, Sea, and Air Sensor Technologies and Applications X*, vol. 6963 of*Proceedings of SPIE*, Orlando, Fla, USA, March 2008. View at: Publisher Site | Google Scholar - C. Zha and T. Xu, “Multiple feature sample classification via joint sparse representation,”
*Journal of Computational Information Systems*, vol. 11, no. 14, pp. 5125–5133, 2015. View at: Publisher Site | Google Scholar - D. J. Russomanno, S. Chari, E. L. Jacobs, and C. Halford, “Near-IR sparse detector sensor for intelligent electronic fence applications,”
*IEEE Sensors Journal*, vol. 10, no. 6, pp. 1106–1107, 2010. View at: Publisher Site | Google Scholar - S. Chari, C. Halford, E. Jacobs, F. Smith, J. Brown, and D. Russomanno, “Classification of humans and animals using an infrared profiling sensor,” in
*Unattended Ground, Sea, and Air Sensor Technologies and Applications XI*, vol. 7333 of*Proceedings of SPIE*, Orlando, Fla, USA, April 2009. View at: Publisher Site | Google Scholar - D. Russomanno, S. Chari, and C. Halford, “Sparse detector imaging sensor with two-class silhouette classification,”
*Sensors*, vol. 8, no. 12, pp. 7996–8015, 2008. View at: Publisher Site | Google Scholar - R. K. Reynolds, S. Chari, and D. J. Russomanno, “Embedded real-time classifier for profiling sensors and custom detector configuration,” in
*Ground/Air Multisensor Interoperability, Integration, and Networking for Persistent ISR II*, vol. 8047 of*Proceedings of SPIE*, Orlando, Fla, USA, April 2011. View at: Publisher Site | Google Scholar - A. Galvis and D. J. Russomanno, “Advancing profiling sensors with a wireless approach,”
*Sensors*, vol. 12, no. 12, pp. 16144–16167, 2012. View at: Publisher Site | Google Scholar - J. Hossen, E. L. Jacobs, and S. Chari, “Real-time classification of humans versus animals using profiling sensors and hidden Markov tree model,”
*Optical Engineering*, vol. 54, no. 7, Article ID 073102, 2015. View at: Publisher Site | Google Scholar - D. J. Russomanno, S. Chari, K. Emmanuel, E. Jacobs, and C. Halford, “Testing and evaluation of profiling sensors for perimeter security,”
*ITEA Journal*, vol. 31, no. 1, pp. 121–130, 2010. View at: Google Scholar - R. B. Sartain, K. Aliberti, T. Alexander et al., “Long-wave infrared profile feature extractor (PFx) sensor,” in
*Proceedings of the Unattended Ground, Sea, and Air Sensor Technologies and Applications XI*, vol. 7333 of*Proceedings of SPIE*, Orlando, Fla, USA, April 2009. View at: Publisher Site | Google Scholar - S. Chari, E. L. Jacobs, and D. Choudhary, “Pyroelectric linear array sensor for object recognition,”
*Optical Engineering*, vol. 53, no. 2, Article ID 023101, 2014. View at: Publisher Site | Google Scholar - D. Takhar, J. N. Laska, M. B. Wakin et al., “A new compressive imaging camera architecture using optical-domain compression,” in
*Computational Imaging IV*, vol. 6065 of*Proceedings of SPIE*, San Jose, Calif, USA, January 2006. View at: Publisher Site | Google Scholar - M. F. Duarte, M. A. Davenport, D. Takbar et al., “Single-pixel imaging via compressive sampling,”
*IEEE Signal Processing Magazine*, vol. 25, no. 2, pp. 83–91, 2008. View at: Publisher Site | Google Scholar - P. T. Boufounos and R. G. Baraniuk, “1-Bit compressive sensing,” in
*Proceedings of the 42nd Annual Conference on Information Sciences and Systems (CISS '08)*, pp. 16–21, Princeton, NJ, USA, March 2008. View at: Publisher Site | Google Scholar - I. Noor and E. L. Jacobs, “Adaptive compressive sensing algorithm for video acquisition using a single-pixel camera,”
*Journal of Electronic Imaging*, vol. 22, no. 2, Article ID 021013, 2013. View at: Publisher Site | Google Scholar - S. S. Chen, D. L. Donoho, and M. A. Saunders, “Atomic decomposition by basis pursuit,”
*SIAM Journal on Scientific Computing*, vol. 20, no. 1, pp. 33–61, 1998. View at: Publisher Site | Google Scholar | MathSciNet - D. L. Donoho, M. Elad, and V. N. Temlyakov, “Stable recovery of sparse overcomplete representations in the presence of noise,”
*IEEE Transactions on Information Theory*, vol. 52, no. 1, pp. 6–18, 2006. View at: Publisher Site | Google Scholar | MathSciNet - E. J. Candès, J. Romberg, and T. Tao, “Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information,”
*IEEE Transactions on Information Theory*, vol. 52, no. 2, pp. 489–509, 2006. View at: Publisher Site | Google Scholar | MathSciNet - E. J. Candès, J. K. Romberg, and T. Tao, “Stable signal recovery from incomplete and inaccurate measurements,”
*Communications on Pure and Applied Mathematics*, vol. 59, no. 8, pp. 1207–1223, 2006. View at: Publisher Site | Google Scholar | MathSciNet - J. A. Tropp and A. C. Gilbert, “Signal recovery from random measurements via orthogonal matching pursuit,”
*IEEE Transactions on Information Theory*, vol. 53, no. 12, pp. 4655–4666, 2007. View at: Publisher Site | Google Scholar | MathSciNet

#### Copyright

Copyright © 2016 Changjun Zha et al. 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.