IJERD is now being indexed with Index Copernicus, Google Scholar, Informatics, ProQuest, Research Gate,
Docstoc, Scribd, UlrichWeb, Internet Archive
Academia.edu, Computer Science Directory, Wepapers, Geond, Auburn University, Aalborg University,
Queen’s University, Goethe University
IJERD : Volume 8, Issue 10
Bhavika K.Desai, Manoj Pandya, Dr.M.B.Potdar
|Comparison of Various Template Matching Techniques for Face Recognition|
TThis paper describes different methods for the pattern matching and face recognition using the template matching technique. Many different pattern matching techniques have been developed but more efficient and robust methods are needed . The pattern matching algorithm is used to identify the patterns available in image. These algorithms shown in this paper generalize and extend the concept of convolution, normalized cross correlation (NCC), zero mean normalized cross correlation (ZNCC), sum of absolute difference (SAD), optimized sum of absolute difference (OSAD), zero mean sum of absolute difference (ZSAD), optimized sum of squared difference (OSSD), zero mean sum of square difference (ZSSD), locally scale sum of square difference (LSSD), sum of hamming distance (SHD). Pattern matching is a significant job of the prototype detection process in today's world for eradicating the structural and efficient activities in a given image. Even though the pattern matching techniques are normally utilized in information processing and computer vision, it can be established in daily tasks. Template matching is conceptually a simple process, this need to match a template to an image where the template pattern is a part of the source image that contains the shape inside it .
Convolution, Normalized Cross Correlation, Pattern Matching, Template Matching.
. S. M. Metev and V. P. Veiko, Laser Assisted Microtechnology, 2nd ed., R. M. Osgood, Jr., Ed. Berlin,
Jaydeo K. Dharpure , M. B. Potdar, Monaj Pandya," Counting Objects using Convolution based
Pattern Matching Technique" International Journal of Applied Information Systems (IJAIS) – ISSN :
2249-0868 Foundation of Computer Science FCS, New York, USA Volume 5 – No. 8, June 2013 –
www.ijais.org.Counting Objects using Convolution based Pattern Matching Technique.
R.Shanthi, T.K.Revathi, Dr.J.Vellingiri
|Multicast Routing and Bandwidth Analysis Using Relay Node for Quality Video Transmission|
This paper propose a novel scalable video broadcast/multicast solution that efficiently integrates scalable video coding, broadcast and ad-hoc forwarding to achieve the optimal trade-off between the systemwide and worst-case video quality perceived by all viewers in the cell. In our solution, video is encoded into one base layer and multiple enhancement layers using Scalable Video Coding (SVC). The large number of Internet paths between popular video destinations and clients to create an empirical understanding of location, persistence, and recurrence of failures. The optimal resource allocation problem for scalable video multicast in networks. we design and implement a prototype packet forwarding module called source initiated frame restoration (SIFR). This paper deployed SIFR on PlanetLab nodes and compared the performance of SIFR to the default Internet routing. We show that SIFR outperforms IP-path selection by providing higher on-screen perceptual quality.
Multicast Routing and Bandwidth Analysis Using Relay Node for Quality Video Transmission
. D. G. Andersen,H.Balakrishnan, M. F. Kaashoek, and R.Morris, "Resilient overlay networks," in Proc. 18th ACM SOSP, Banff, Canada, Oct. 2001, pp. 131–145.
. S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss, "An architecture for differentiated services," IETF RFC# 2475, Dec. 1998.
. P. Calyam, M. Sridharan, W. Mandrawa, and P. Schopis, "Performance measurement and analysis of H.323 traffic," in Proc. PAM, Apr. 2004, pp. 137–146.
. K. Chen, C.Wu, Y. Chang, and C. Lei, "A crowdsourceable QoE evaluation framework for multimedia content," in Proc. ACM Multimedia, Beijing, China, Oct. 2009, pp. 491–500.
. A. Czumaj and V. Stemann, "Randomized allocation processes," in Proc. Symp. Found. Comput. Sci., Miami, FL,USA,Oct. 1997, p. 194....
S.Dhanalakshmi, S.Kaliraj, Dr.J.Vellingiri
|Efficient and Effective Detection of Node Replication Attacks in Mobile Sensor Networks|
Wireless sensor networks are often deployed in hostile environments, where an adversary can physically capture some of the nodes. Once a node is captured, the attacker can re-program it and replicate the node in a large number of replicas, thus easily taking over the network. The detection of node replication attacks in a wire- less sensor network is therefore a fundamental problem. Compared to the extensive exploration on the defense against node replication attacks in static networks, only a few solutions in mobile networks have been presented. Moreover, while most of the existing schemes in static networks rely on the witness-finding strategy, which cannot be applied to mobile networks, the velocity-exceeding strategy used in existing schemes in mobile networks incurs efficiency and security problems. In this paper Localized algorithms are proposed to resist node replication attacks in mobile sensor networks. The Merits of proposed algorithms are, it can effectively detect the node replication in localized manner. These algorithms are, also avoid network-wide synchronization and network-wide revocation.
Replication attack, security, wireless sensor networks, localized detection.
. G. Cormode and S. Muthukrishnan, "An improved data stream summary the count-min sketch and its applications," J. Algorithms, vol.55, no. 1, pp. 56–75, 2005.
. M. Conti, R. Di Pietro, L. V. Mancini, and A. Mei, "A randomized, efficient, and distributed protocol for the detection of node replication at- tacks in wireless sensor networks," in Proc. ACM Int. Symp. Mobile AdHoc Networking and Computing (MobiHoc), Montreal, Canada, 2007, pp. 80–89.
. M. Conti, R. D. Pietro, and A. Spognardi, "Wireless sensor replica detection in mobile environment," in Proc. Int. Conf. Distributed Computing and Networking (ICDCN), Hong Kong, China, 2012, pp.249–264.
. J. Ho, M. Wright, and S. K. Das, "Fast detection of replica node attacks in mobile sensor networks using sequential analysis," in Proc. IEEE Int. Conf. Computer Communications (INFOCOM), Brazil, 2009, pp.773–1781.
. D. B. Johnson and D. A. Maltz, "Dynamic source routing in ad hoc wireless networks," Mobile Comput., pp. 153–181, 1996...
|Decentralized Trust Based Routing Scheme for Vehicular Ad Hoc Networks|
The security of vehicular ad hoc networks (VANETs) has been receiving a significant amount of attention in the field of wireless mobile networking because VANETs are vulnerable to malicious attacks.Asymmetric cryptography schemes are not suitable for highly dynamic environments. Cryptanalysis is not verified and protocol is not secure.It adopts transitive trust relationships to improve the performance of the authentication procedure and only needs a few storage spaces.To propose a decentralized trust authentication mechanism for cryptanalysis scheme, inside attacks, secure routing protocol. Intend to develop an intrusion detection mechanism to enhance the network security.
Authentication, decentralized, trust-extended, vehicular ad hoc networks (VANETs).
. J. P. Hubaux, S. Capkun, and J. Luo, "The security and privacy of smart vehicles," IEEE Security Privacy Mag., vol. 2, no. 3, pp. 49–55, May– Jun. 2004.
. Dedicated Short Range Communications (DSRC) [Online]. Available: http://grouper.ieee.org/groups/scc32/dsrc/index.html
. M. Nekovee and B. B. Bogason, "Reliable and efficient information dissemination in intermittently connected vehicular ad hoc networks," in Proc. IEEE Vehicular Technol. Conf., Apr. 2007, pp. 2486– 2490.
. J. Zhao, Y. Zhang, and G. Cao, "Data pouring and buffering on the road: A new data dissemination paradigm for vehicular ad hoc networks," IEEE Trans. Vehicular Technol., vol. 56, no. 6, pp. 3266– 3277, Nov. 2007.
. J.-F. Lee, C.-S. Wang, and M.-C. Chuang, "Fast and reliable emergency message dissemination mechanism in vehicular ad hoc networks," in....
|Diffeomorphic MRI-Brain Registration Using Mean-Shift Algorithm|
A new methods to constrain brain MRI registration, and perform experiments evaluating the alignment of manually-traced structures, reduction of intersubject variance, and morph metric results using group wise registration is compared against traditional MRI. By using image registration, it restrict the scope of structures to those that can be represented volumetrically as images, such as MRI volumes or anatomical segmentations, or those that can be interpolated on a volumetric grid.This method uses Mean Shift algorithm to efficiently segment the gray and white matter.
Atlases morphometry, brain registration, diffeo- morphisms, MRI.
. A. R. Khan, L. Wang, and M. F. Beg, ―Freesurfer-initiated fully-automated subcortical brain segmentation
in MRI using large deformation diffeomor- phic metric mapping,‖ Neuroimage, vol. 41, no. 3, pp. 735–
. C. L. Guyader and L. Vese, ―A combined segmentation and registration framework with a nonlinear elasticity smoother,‖ Comput. Vis. Imag. Un-...
Amrinder Singh Chahal, Vikram Singh
|Review To Six Sigma: A Metric And A Methodology|
Recent advancement in the manufacturing techniques and increased demand of quality products necessitate the use of error reduction techniques. Six sigma developed as such error reduction technique that broaden the limits of quality in order to reduce defects up to 3.4 million per opportunities. Origin of six sigma by Motorola industry proven as the quality assurance technique and validated over many years. Present exertion is made to lime light the importance and need of the philosophy of six sigma so as to reduce the defects in the manufacturing industries. Work represents the importance of six sigma as well methodology used for implementation and the potential benefits by using six sigma.
Six Sigma,metric,methodology, quality assurance.
. "The Inventors of Six Sigma". Archived from the original on November 6, 2005. Retrieved January 29,