Margret N. Silva, Vipul Dalal |
Nose Tip Detection Using Gradient Weighting Filter Smoothing |
In the area of face recognition systems, features especially nose tip has less significant attention for
smoothing. This proposed model is based on the process of smoothing of 3D face images with feature detection
like nose tip. Our proposed method uses Gradient Weighting Filter technique for smoothing with particular
points' neighborhood surrounding in 3D face and replaces that with the weighted value of surrounding points in
3D face images. We will use the gradient weighting algorithm for detecting the nose tip and this method will
correctly detect the nose tip in any position along with X, Y and Z axes. All the experiments will be performed
on GAVAB, a 3D face database.
Nose tip, Gradient Weighting Filter, 3D Face images, Smoothing, Noise.
[1]. P. Bagchi, D. Bhattacharjee, M. Nasipuri, D.K. Basu, " A novel approach for nose tip detection using
smoothing by weighted median filtering applied to 3D face images in variant poses, " in Proceedings of
the Int. Conf. Pattern Recognition, Informatics and Medical Engineering, March 21-23, 2012, pp. 272-
277. |
M.Arulmani, V.R.Hema Latha |
||||||||||||
3G Mobile phone Induces Cancer?... (A New theory on impact of IR Radiation and O type blood) | ||||||||||||
This research article focus that "3G Mobile Phone" shall be considered as a Technological
advancement tool and Nature‟s gift for enhancement of Human life style rather than considered as a Health
Hazard barrier and Induces cancer.
This article emphasize that cancer shall be considered as the 3rd generation disease due to impact of
IR Radiation and evolution of "O" type Blood origin in Human, in the expanding universe rather than use of
mobile phone. In other words IR radiation environment and O type blood origin shall be considered as having
highly degraded immunity against cancer.
Elephants do not use Mobile phone!..., Apes do not consume tobacco!!... Birds do not drink
Alcohol!!!..., But the cancer disease attacks Elephants, Apes, Birds also!... Current theory couldn‟t have any
definite conclusion on the reason for fast cancer growth?... "3G mobile phone working in Non ionized state, RF radiation Bandwidth can't induce cancer disease. In fact
IR radiation and O type blood origin shall be considered as the root cause for human immunity loss and
carcinogenic effect".
1) Philosophy of Human Blood origin and three blood species era.
2) Philosophy of Expanding Universe and three geological period. 3) Philosophy of Neutrino fluid. 4) New definition for cell and cell structure. [1]. Intensive Internet "e-book" study through, Google search and wikipedia
|
||||||||||||
P.Mahesh, Dr. N. Vasudevan, Dr. S. Ravi, Dr. G. Saravana Kumar |
||||||||||||
Linear Operator Based Motion Detection | ||||||||||||
This paper proposes a novel method to detect moving objects in a continuous video sequence. A
simple linear operator based classifier, is implemented to separate target objects from their background. It also
estimates stochastic parameters for each pixel of the image. The output data exhibits a frame categorization
sanctioning a simple and efficient pixel-level transition identification framework. The degree of similarity
between adjacent pixels and their relationship, neighbourhood can be utilized for precise detection. This paper
explores the aforesaid inference to establish a spatiotemporal systematic alignment of the leaf level solution.
This method accomplishes sturdiness and exactitude, with memory utilization and a highly efficient
computational structure. Linear Operator Based Motion Detection.
[1] Vasileios Argyriou, "Sub Hexagonal Phase Correlation for Motion Estimation", IEEE transactions on
Image Processing, Vol. 20, No. 1, January 2011.
[2] B. Horn, Robot Vision, Cambridge, MA. MIT Press, 1986. [3] V.A. and T. Poggio, "Against quantitative optical flow", Proceeding of First International Conference on Computer Vision, pp. 171-180, 1987. [4] Y.H., B.M.J., F.R., "The dense estimation of motion and appearance in layers", Proceedings of Computer Vision and Pattern Recognition Workshop, p.165, June 2004. [5] P.I., W.M., and R. Van den Boomgaard, "Dense motion estimation using regularization constraints on local parametric models", IEEE transactions on Image Processing, Vo. 13, No. 11, Nov. 2004....
|
||||||||||||
Deepti Mishra |
A Review on Clustering Based Methods and Usage for Pattern Recognition |
Pattern recognition is an important field of computer science concerned with recognizing patterns,
particularly visual and sound patterns. It is an area of work that has applications in many disciplines. Pattern
recognition is the science of making inferences based on data. It is the study of how machines can observe the
environment, learn to distinguish patterns of interest, make sound and reasonable decisions about the categories
of the patterns. The pattern recognition is based on the concept of supervised learning and unsupervised
learning. The approach based on supervised learning is called classification and the approach based on
unsupervised learning is called clustering. Both the approaches are the techniques of data mining. Data mining
is the approach which searches for new, valuable and nontrivial information from large volumes of data. The
study includes the techniques that are based on clustering and are useful for pattern recognition. The study aims
at providing the review of clustering techniques and their applications in pattern recognition. The discussion on
the study will guide the researchers for improving their research direction.
Pattern Recognition, Data Mining, Clustering, unsupervised learning, supervised learning.
[1]. Pratima D. and Nimmakanti N., " Pattern Recognition algorithms for cluster identification problem",
Special Issue of International Journal of Computer Science & Informatics (IJCSI),vol.- II, Issue-1, 2. [5]. Richard o. Duda, Peter E. Hart, David G. Stork, " Pattern Classification",.... |
P.Sakthi priyanka, M.Ganthimathi, M.Dhivya, S.Surya |
||||||||||||
A Preserving Location Privacy of Mobile Network | ||||||||||||
Mobile network consists of number of mobile nodes moving in the network randomly, In mobile
networks, authentication is a required primitive for most security protocols. Unfortunately, an adversary can monitor
pseudonyms used for authentication to track the location of mobile nodes. A frequently proposed solution to protect
location privacy suggests that mobile nodes collectively change their pseudonyms in regions called mix zones. This
approach is costly. Self interested mobile nodes might, thus, decide not to cooperate and jeopardize the achievable
location privacy. To analyze non-cooperative behavior of mobile nodes by using a game-theoretic model, where
each player aims at maximizing its location privacy at a minimum cost. We obtain Nash equilibria in static n-player
complete information games. As in practice mobile nodes do not know their opponents' payoffs, we then consider
static incomplete information games.To establish that symmetric Bayesian-Nash equilibria exist with simple
threshold strategies. By means of numerical results, we predict behavior of selfish mobile nodes. We then
investigate dynamic games where players decide to change their pseudonym one after the other and show how this
affects strategies at equilibrium. Finally, we design protocols—Pseudo Game protocols—based on the results of our
analysis and simulate their performance in vehicular network scenarios,The pseudonyms key changes mainly used in
many areas such as peer to peer communication and wireless network, because this network only each time change
the location .Public and private key is used for transferring the information ,number of routing algorithm is used for
route the information.
Security and privacy protection, mobile computing, network protocols.
1.G. Myles, A. Friday, and N. Davies, ―Preserving privacy in environments with location-based
applications,‖ IEEE Pervasive Computing, vol. 2, no. 1, pp. 56–64, Mar. 2003.
[2]. 2. M. Gruteser and D. Grunwald, ―Anonymous usage of location-based services through spatial and temporal cloaking,‖ in Proc. of ACM Int'l Conf. Mobile Systems, Applications, and Services (MobiSys), San Francisco, CA, May 2003. [3]. 3.E. Schoch, F. Kargl, T. Leinmuller, S. Schlott, and P. Papadimitratos, Impact of pseudonym changes on geographic routing in VANETs,‖ Lecture Notes in Computer Science (LNCS), vol. 4357, pp. 43–57, Mar. 2007. [4]. 4. E. Fonseca, A. Festag, R. Baldessari, and R. Aguiar, ―Support of anonymity in VANETs - Putting pseudonymity into practice,‖ in Proc. Of IEEE WCNC, Hong Kong, China, Mar. 2007. [5]. 5.. M. Lei, X. Hong, and S. V. Vrbsky, ―Protecting location privacy with dynamic MAC address changing in wireless networks,‖ in Proc. Of IEEE Globecom, Washington, DC, Nov. 2007.....
|
||||||||||||
Prof.T.Chandrasekhar, J.S.Chakravarthi, Y.V.Sai Roja |
||||||||||||
A VLIW Vector Media Coprocessor with Cascaded SIMD ALUs | ||||||||||||
High-definition video applications, such as digital TV and digital video cameras, require high
processing performance for high-quality visual images in addition to a complex video CODEC. Pre-/post
processing to improve video quality is becoming much more important because requirements for Pre/post
processing vary among applications and processing algorithms have not been stabilized. Therefore, a new
processor architecture that has a highly parallel data path is needed. In this Paper, we introduce a VLIW vector
media coprocessor, "vector coprocessor (VCP)," that includes three asymmetric execution pipelines with
cascaded SIMD ALUs. To improve performance efficiency, we reduce the area ratio of the control circuit while
increasing the ratio of the arithmetic circuit. The total gate count of VCP is 1268 kgates and its maximum
operating frequency is 300 MHz at 90-nm CMOS process. Some of the processing kernels in an adaptive
prefilter that is applied to preprocessing for video encoding are evaluated. In the case of the edgeness and the
sum of absolute differences, the performance is 183 giga operations per second. VCP offers enough
performance for HD video processing and good cost-performance while all processing pipeline units operate
effectively.
Single instruction stream, multiple data stream (SIMD), vector coprocessor (VCP), very long
instruction word (VLIW).
[1]. S. Kyo, S. Okazaki, and T. Arai, "An integrated memory array processor architecture for embedded
image recognition systems," in Proc.Int. Symp. Computer Architecture (ISCA), 2005, pp. 134–145.
|
||||||||||||
V.Jayasudha, V.Umarani |
EUP-Growth+ - Efficient Algorithm for Mining High Utility Itemset |
In recent years, Utility mining becomes an emerging topicin the field of data mining. From a
transaction database the discovery of itemsets with high utility like profits are referred as a high utility itemsets
mining. In this paper, a new algorithm is proposed,named Enhanced Utility Pattern Growth+ (EUP-Growth+),
for reducing a large number of candidate itemsets for high utility itemsetswith a set of effective strategies. These
strategies are used for pruning candidate itemsets effectively. By reducing a hefty number of candidate itemsets
the mining performance upgrades in terms of execution time and space requirement. The selective information
ofpotential high utility itemsetsare stored in the appropriate memory using a hashing technique and maintained
in a tree-based data structure named Improved Utility Pattern Tree (IMUP-Tree). The performance of EUPGrowth+
is compared with the State-of-the-art algorithms on many types of both real and synthetic data sets.
Experimental and comparative results reveal that the proposed algorithms, EUP- Growth+, not only reduce the
number of PHUIs effectivelybut also outperform other algorithms.
Candidate pruning, utility mining, frequent itemset, potential high utility itemset,
[1]. R. Agrawal and R. Srikant, "Fast Algorithms for Mining Association Rules," Proc. 20th Int‟l Conf.
Very Large Data Bases (VLDB), pp. 487-499, 1994. [4]. C.H. Cai, A.W.C. Fu, C.H. Cheng, and W.W. Kwong, "Mining Association Rules with Weighted
Items," Proc. Int‟l Database Eng. and Applications Symp. (IDEAS ‟98), pp. 68-77, 1998. |
R.Sakthi, V.Umarani |
||||||||||||
BSS Homomorphic Encryption: A Privacy model for large transactional database | ||||||||||||
Data mining is the extraction of interesting patterns or knowledge from huge amount of data. In
recent years, privacy issues in data mining have been increased enormously especially when internet is booming
with social networks, e-commerce, forums, blocks, etc. Because of privacy issues the personal information
collected from the users are used in unethical way that leads to information insecurity. Hence Privacy Preserving
Data Mining is a research area concerned with the privacy driven from personally identifiable information when
considered for data mining. The Rob Frugal method is introduced to overcome the privacy vulnerabilities of
outsourced data. It is an encryption scheme, based on one to one substitution ciphers for items and adding fake
patterns for database. Here the attackers/hackers can find data by guessing attack. However, it contains a
number of fake patterns which leads to security issue in privacy preserving. To overcome this problem, the
proposed strategy encompasses Blind Source Separation Homomorphic encryption in order to reduce the
number of fake patterns and to improve the security level for outsourced data with less complexity. To avoid
guessing attack from unauthorized users, the encrypted data are converted into matrix format. Our
comprehensive experiments on a very large and real transaction database demonstrate that our techniques are
effective, scalable, and protect privacy.
Association rule mining, privacy-preserving, fake pattern partitioning, grouping.
[1]. R. Chow, P. Golle, M. Jakobsson, E. Shi, J. Staddon, R. Masuoka, and J. Molina. Controlling data in
the cloud: Outsourcing computation without outsourcing control. Pages 85–90, 2009.
|
||||||||||||