Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

87 results for “Invariant”
Set a search alert
Research ArticleOpen accessIn the abstractSHAPE RETRIEVAL THROUGH MAHALANOBIS DISTANCE WITH SHORTEST AUGMENTING PATH ALGORITHMS. Muruganathan, N. Devarajan, D. Chitra, T. ManigandanShape matching and object recognition plays an vital role in the computer vision. The shape matching is difficult in case of the real world images like mpeg database images since the real world images has the internal and external contours. The Mahalanobis distance based shape context approach is proposed to measure similarity between shapes and exploit it for shape retrieval. … …Journal of Computer Science, Vol. 10, Issue 4 · 3 Dec 2013 · 6,860 accessesView PDFCite
Research ArticleOpen accessIn the abstractA MODIFIED ADAPTIVE WAVELET SHRINKAGE SPECKLE FILTER FOR ULTRASOUND IMAGESNirmaladevi Periyasamy, Asokan RamasamyThe usage of ultrasound imaging for medical diagnosis is limited due to the presence of speckle noise. In this study Modified Adaptive Wavelet Shrinkage Filter (MAWSF) in the translational invariant domain is proposed for the removal of speckle noise. The adaptive wavelet threshold function removes the fixed bias of soft thresholding. A new inter-scale dependency model is proposed, to perform … …Journal of Computer Science, Vol. 9, Issue 10 · 16 Sep 2013 · 6,541 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Novel Channel Estimation Technique for Complexity Reduction of Least Minimum Mean Square ErrorHany Mohamed El-Ansary, Hussein Ghouz, Ashraf Mamdouh Aziz, Gamal MabroukChannel estimation technique is to predict the frequency response of the radio channel using pilot signal. Channel estimation technique is important part of LTE receiver design. Such technique is used to recover the transmitted signal correctly and to know how the channel conditions are changed over frequency and time. Each channel estimator has a specified complexity computed according to its … …American Journal of Applied Sciences, Vol. 10, Issue 10 · 5 Sep 2013 · 7,007 accessesView PDFCite
Research ArticleOpen accessIn the abstractVehicle Identification using Fuzzy Adaline Neural NetworkGokul Murugesan, Shriram K. Vasudevan, Sivaraman Ramachandran et al.Video surveillance is an important aspect in today’s world, where a particular scene of area requires monitoring to avoid terrorist attacks and unauthorized entries. Vehicle recognition is an important area in object tracking and recognition. Objects may be of rigid or non-rigid in nature with varying velocity and have different features. Important features like shape, logo, color and texture are … …Journal of Computer Science, Vol. 9, Issue 6 · 6 Jun 2013 · 7,181 accessesView PDFCite
Research ArticleOpen accessIn the abstractComparative Evaluation of Adaptive Filter and Neuro-Fuzzy Filter in Artifacts Removal From Electroencephalogram SignalPaulchamy Balaiah, IlavennilaProblem statement: This study presents an effective method for removing mixed artifacts (EOG-Electro-ocular gram, ECG-Electrocardiogram, EMG-Electromyogram) from the EEG-Electroencephalogram records. The noise sources increases the difficulty in analyzing the EEG and obtaining clinical information. EEG signals are multidimensional, non-stationary (i.e., statistical properties are not invariant in time), time domain biological signals, which are not reproducible. It is supposed to contain … …American Journal of Applied Sciences, Vol. 9, Issue 10 · 15 Aug 2012 · 7,090 accessesView PDFCite
Research ArticleOpen accessIn the abstractFeature Fusion in Improving Object Class RecognitionNoridayu Manshor, Amir Rizaan Abdul Rahiman, Mandava Rajeswari, Dhanesh RamachandramProblem statement: Extraction of features in object class recognition researches previously gives attention to local features as discriminative features. This is because local features have invariant properties that are robust to viewpoints, translation and rotation. However this feature still has a limitation to represent high-level representation of objects. The problem will occur if the object is too small and do … …Journal of Computer Science, Vol. 8, Issue 8 · 24 Jul 2012 · 6,912 accessesView PDFCite
Research ArticleOpen accessIn the abstractFinding the Envelope and Efficient Frontier of Financial AssetsFarida Kachapova, Ilias KachapovProblem statement: One of the problems considered in financial mathematics is finding portfolios of given financial assets that minimize risk for targeted returns. The set of such portfolios is called the envelope of the assets. Traditionally this problem is solved as a calculus minimization problem involving partial derivatives and Lagrange multipliers. Approach: In this study we describe an invariant geometric … …Journal of Mathematics and Statistics, Vol. 8, Issue 3 · 16 Jul 2012 · 9,285 accessesView PDFCite
Research ArticleOpen accessIn the abstractAutomatic Palmprint Identification based on High Order Zernike MomentR. Gayathri, P. RamamoorthyProblem statement: Hand geometry contains relatively invariant features of an individual. Palmprint recognition is an efficient biometric solution for authentication system. The existence of several hand-based authentication commercial systems indicates the effectiveness of this type of biometric. Approach: We proposed a palmprint verification system using high order Zernike moment that was robust to rotation, translation and occlusion. Zernike moment was … …American Journal of Applied Sciences, Vol. 9, Issue 5 · 12 Mar 2012 · 7,198 accessesView PDFCite
Research ArticleOpen accessIn the abstractSome Applications of Spanning Trees in Complete and Complete Bipartite GraphsS. N. DaoudProblem statement: The number of spanning trees τ(G) in graphs (networks) is an important invariant, it is also an important measure of reliability of a network. Approach: Using linear algebra and matrix analysis techniques to evaluate the associated determinants. Results: In this study we derive simple formulas for the number of spanning trees of complete graph Kn and complete bipartite … …American Journal of Applied Sciences, Vol. 9, Issue 4 · 15 Feb 2012 · 7,266 accessesView PDFCite
Research ArticleOpen accessIn the abstractNumber of Spanning Trees of Circulant Graphs C6n and their ApplicationsS. N. DaoudProblem statement: The number of spanning trees of a graph G is usually denoted by τ(G). A circulant graph with n vertices and k jumps is Cn (a1,…..,ak). Approach: In this study the number τ(G) of spanning trees of the circulant graphs C6n with some non-fixed jumps such as C6n (1, n), C6n (1, n, 2n), C6n (1, n, 3n), … …Journal of Mathematics and Statistics, Vol. 8, Issue 1 · 12 Dec 2011 · 7,632 accessesView PDFCite