Home   >   CSC-OpenAccess Library   >    Manuscript Information
Full Text Available

(149.41KB)
This is an Open Access publication published under CSC-OpenAccess Policy.
Multi-Dimensional Features Reduction of Consistency Subset Evaluator on Unsupervised Expectation Maximization Classifier for Imaging Surveillance Application
Chue-Poh Tan, Ka-Sing Lim, Weng-Kin Lai
Pages - 18 - 26     |    Revised - 15-02-2008     |    Published - 30-02-2008
Volume - 2   Issue - 1    |    Publication Date - February 2008  Table of Contents
MORE INFORMATION
KEYWORDS
Consistency Subset Evaluator, Principal Component Analysis, Unsupervised Expectation Maximization, Classification, Imaging surveillance
ABSTRACT
This paper presents the application of multi dimensional feature reduction of Consistency Subset Evaluator (CSE) and Principal Component Analysis (PCA) and Unsupervised Expectation Maximization (UEM) classifier for imaging surveillance system. Recently, research in image processing has raised much interest in the security surveillance systems community. Weapon detection is one of the greatest challenges facing by the community recently. In order to overcome this issue, application of the UEM classifier is performed to focus on the need of detecting dangerous weapons. However, CSE and PCA are used to explore the usefulness of each feature and reduce the multi dimensional features to simplified features with no underlying hidden structure. In this paper, we take advantage of the simplified features and classifier to categorize images object with the hope to detect dangerous weapons effectively. In order to validate the effectiveness of the UEM classifier, several classifiers are used to compare the overall accuracy of the system with the compliment from the features reduction of CSE and PCA. These unsupervised classifiers include Farthest First, Densitybased Clustering and k-Means methods. The final outcome of this research clearly indicates that UEM has the ability in improving the classification accuracy using the extracted features from the multi-dimensional feature reduction of CSE. Besides, it is also shown that PCA is able to speed-up the computational time with the reduced dimensionality of the features compromising the slight decrease of accuracy.
CITED BY (9)  
1 Polaka, I. (2015, August). Feature Selection Approaches In Antibody Display. In Environment. Technology. Resources. Proceedings of the International Scientific and Practical Conference (Vol. 2, pp. 16-23).
2 Markkandeyan, S., & Devi, M. I. (2015). Efficient Machine Learning Technique for Web Page Classification. Arabian Journal for Science and Engineering, 40(12), 3555-3566.
3 Gasparovica-Asite, M., Polaka, I., & Alekseyeva, L. (2015). The Impact of Feature Selection on the Information Held in Bioinformatics Data. Information Technology and Management Science, 18(1), 115-121.
4 Polaka, i. evolutionary induction of decision tree classifier ensembles using class density structure.
5 Polaka, I. (2011, June). Feature selection approaches in antibody display data analysis. In 8th International Scientific and Practical Conference (Vol. 2, pp. 16-23).
6 Lili, N. A. (2010). The Automated Model Classifier Construction with Multimodal Features for Detecting Human Actions.
7 Bakkers, T. (2010). On the performance of segmentation techniques for identifying media use habits (Doctoral dissertation, Tilburg University).
8 Abdullah, L. N. (2009). A Framework for Human Action Detection via Extraction of Multimodal Features.
9 NA, L. (2009). A framework for human action detection via extraction of multimodal features. International Journal of Image Processing (IJIP), 3(2), 73.
1 Google Scholar
2 ScientificCommons
3 Academic Index
4 CiteSeerX
5 refSeek
6 iSEEK
7 Socol@r
8 ResearchGATE
9 Bielefeld Academic Search Engine (BASE)
10 OpenJ-Gate
11 Scribd
12 SlideShare
13 PDFCAST
14 PdfSR
1 A.T. Ali, and E.L. Dagless. “Computer vision for security surveillance and movement control”, IEE Colloquium on Electronic Images and Image Processing in Security and Forensic Science, pp. 1-7. 1990.
2 A.C.M. Fong. “Web-based intelligent surveillance systems for detection of criminal activities”, Journal of Computing and Control Engineering, 12(6), pp. 263-270, 2001.
3 Y. T. Chien, Y. S. Huang, S. W. Jeng, Y. H. Tasi, and H. X. Zhao. “A real-time security surveillance system for personal authentication”. IEEE 37th Annual 2003 International Carnahan Conference on Security Technology 2003, pp. 190-195, 2003.
4 P. Geurts. “Contribution to decision tree induction: bias/ variance tradeoff and time series classification”. PhD. Thesis, Department of Electrical Engineering and Computer Science, University of Liege, May 2002.
5 http://www.cs.sdce.edu/ShapeMatcher/
6 H. Almuallim and T. G. Dietterich. “Learning with many irrelevant features". Proceedings of the Ninth National Conference on Artificial Intelligence, pp. 547-552, 1991.
7 H. Liu and R. Setiono. “A probabilistic approach to feature selection". Proceedings of the 13th International Conference on Machine Learning. pp. 319-327, 1996.
8 M. A. Hall and G. Holmes. “Benchmarking Attribute Selection Techniques for Discrete Class Data Mining”. IEEE Transactions On Knowledge And Data Engineering, 15(3), 2003.
9 I. Kononenko. “Estimating attributes: Analysis and extensions of relief". Proceedings of the Seventh European Conference on Machine Learning, pp. 171-182, 1994
10 U. M. Fayyad and K. B. Irani. “Multi-interval discretisation of continuous-valued attributes”. Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, pp. 1022-1027, 1993.
11 M. A. Aizerman, E. M. Braverman, and L.I. Rozoner. “Theoretical foundations of the potential function method in pattern recognition learning”. Automation and Remote Control, 25:826-837, 1964.
12 M. E. Tipping and C. M. Bishop. “Mixtures of probabilistic principal component analyzers”. Neural Computation, 11(2): 443-482, 1999.
13 M. E. Tipping and C. M. Bishop. “Probabilistic principal component analysis”. Journal of the Royal Statistical Society, 61(3): 611, 1999.
14 J. Han and M. Kamber. “Data Mining: Concepts and Techniques”. Morgan Kaufmann, San Francisco, CA (2001).
15 T. F. Cox and M. A. A. Cox. “Multidimensional Scaling”. Chapman and Hall (2001).
16 I. Borg and P. Groenen. ”Modern Multidimensional Scaling: Theory and Applications”. Springer (1997).
17 F. Dellaert. “The Expectation Maximization Algorithm, College of Computing, Georgia Institute of Technology”. Technical Report, 2002.
18 S. T. Roweis and L. K. Saul. “Nonlinear dimensionality reduction by locally linear embedding”. Science, 290(2):2323-2326, 2000.
19 S. Dasgupta and P. M. Long. “Performance guarantees for hierarchical clustering”. Journal of Computer and System Sciences, 70(4):555-569, 2005.
20 X. Zheng, Z. Cai and Q. Li. “An experimental comparison of three kinds of clustering algorithms”. IEEE International Conference on Neural Networks and Brain, pp. 767 -771, 2005.
21 M. Ester, H. P. Kriegel, J. Sander and X. Xu, “A density-based algorithm for discovering clusters in large spatial databases with noise”. The 2nd International Conference on Knowledge Discovery and Data Mining, Portland, Oregon, USA, 1996.
22 M. Rehman and S. A. Mehdi. “Comparison of density-based clustering algorithms”. Lahore College for Women University, Lahore, Pakistan, University of Management and Technology, Lahore, Pakistan.
23 T. H. Cormen, C. E. Leiserson and R. L. Rivest. “Introduction to algorithms”. McGraw-Hill Book Company, 1990.
24 K. Alsabti, S. Ranka and V. Singh. “An efficient k-Means clustering algorithm”. Available online at http://www.cise.ufl.edu/~ranka/1997.
25 R. C. Dubes and A. K. Jain. “Algorithms for clustering data”. Prentice Hall (1998).
26 T. Zhang, R. Ramakrishnan and M. Livny. “An efficient Data Clustering Method for very large databases”. Proceedings of the 1996 ACM Sigmod International Conference on Management of Data, Montreal, Canada, pp.103-114, 1996.
Mr. Chue-Poh Tan
- Malaysia
chue.poh@mimos.my
Mr. Ka-Sing Lim
- Malaysia
Mr. Weng-Kin Lai
- Malaysia