Given a collection of images, where each image contains several faces and is associated with a few names in the corresponding caption, the goal of face naming is to infer the correct name for each face
AUTOMATIC FACE NAMING BY LEARNING DISCRIMINATIVE AFFINITY MATRICES FROM WEAKL...Nexgen Technology
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
Automatic face naming by learning discriminative affinity matrices from weakl...Raja Ram
This paper proposes two new methods for automatic face naming using weakly labeled images. The first method, called regularized low-rank representation (rLRR), learns a discriminative affinity matrix by incorporating weak supervision into low-rank representation to penalize reconstruction coefficients between faces of different subjects. The second method, called ambiguously supervised structural metric learning (ASML), learns a discriminative distance metric and uses it to obtain an affinity matrix. The two affinity matrices are then combined and used in an iterative scheme to infer face names. Experiments on synthetic and real-world datasets demonstrate the effectiveness of the proposed approaches.
Comparative Analysis of Partial Occlusion Using Face Recognition TechniquesCSCJournals
This paper presents a comparison of partial occlusion using face recognition techniques that gives in which technique produce better result for total success rate. The partial occlusion of face recognition is especially useful for people where part of their face is scarred and defect thus need to be covered. Hence, either top part/eye region or bottom part of face will be recognized respectively. The partial face information are tested with Principle Component Analysis (PCA), Non-negative matrix factorization (NMF), Local NMF (LNMF) and Spatially Confined NMF (SFNMF). The comparative results show that the recognition rate of 95.17% with r = 80 by using SFNMF for bottom face region. On the other hand, eye region achieves 95.12% with r = 10 by using LNMF.
Study on a Hybrid Segmentation Approach for Handwritten Numeral Strings in Fo...inventionjournals
This paper presents a hybrid approach to segment single- or multiple-touching handwritten numeral strings in form document, the core of which is the combined use of foreground, background and recognition analysis. The algorithm first located some feature points on both the foreground and background skeleton images containing connected numeral strings in form document. Possible segmentation paths were then constructed by matching these feature points, with an unexpected benefit of removing useless strokes. Subsequently, all these segmentation paths were validated and ranked by a recognition-based analysis, where a well-trained two-stage classifier was applied to each separated digit image to obtain its reliability. Finally, by introducing a locally optimal strategy to accelerate the recognition process, the top ranked segmentation path survived to help make a decision on whether to accept or not. Experimental results show that the proposed method can achieve a correct segmentation rate of 96.2 percent on a large dataset collected by our own.
AUTOMATIC FACE NAMING BY LEARNING DISCRIMINATIVE AFFINITY MATRICES FROM WEAKL...Nexgen Technology
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
Automatic face naming by learning discriminative affinity matrices from weakl...Raja Ram
This paper proposes two new methods for automatic face naming using weakly labeled images. The first method, called regularized low-rank representation (rLRR), learns a discriminative affinity matrix by incorporating weak supervision into low-rank representation to penalize reconstruction coefficients between faces of different subjects. The second method, called ambiguously supervised structural metric learning (ASML), learns a discriminative distance metric and uses it to obtain an affinity matrix. The two affinity matrices are then combined and used in an iterative scheme to infer face names. Experiments on synthetic and real-world datasets demonstrate the effectiveness of the proposed approaches.
Comparative Analysis of Partial Occlusion Using Face Recognition TechniquesCSCJournals
This paper presents a comparison of partial occlusion using face recognition techniques that gives in which technique produce better result for total success rate. The partial occlusion of face recognition is especially useful for people where part of their face is scarred and defect thus need to be covered. Hence, either top part/eye region or bottom part of face will be recognized respectively. The partial face information are tested with Principle Component Analysis (PCA), Non-negative matrix factorization (NMF), Local NMF (LNMF) and Spatially Confined NMF (SFNMF). The comparative results show that the recognition rate of 95.17% with r = 80 by using SFNMF for bottom face region. On the other hand, eye region achieves 95.12% with r = 10 by using LNMF.
Study on a Hybrid Segmentation Approach for Handwritten Numeral Strings in Fo...inventionjournals
This paper presents a hybrid approach to segment single- or multiple-touching handwritten numeral strings in form document, the core of which is the combined use of foreground, background and recognition analysis. The algorithm first located some feature points on both the foreground and background skeleton images containing connected numeral strings in form document. Possible segmentation paths were then constructed by matching these feature points, with an unexpected benefit of removing useless strokes. Subsequently, all these segmentation paths were validated and ranked by a recognition-based analysis, where a well-trained two-stage classifier was applied to each separated digit image to obtain its reliability. Finally, by introducing a locally optimal strategy to accelerate the recognition process, the top ranked segmentation path survived to help make a decision on whether to accept or not. Experimental results show that the proposed method can achieve a correct segmentation rate of 96.2 percent on a large dataset collected by our own.
The document proposes a novel approach for tag ranking in image annotation that combines tag ranking with matrix recovery. It aggregates prediction models for tags into a matrix and casts tag ranking as a matrix recovery problem. The method introduces a matrix trace norm to control model complexity, allowing reliable prediction even with limited training images. Experiments on image datasets demonstrate its effectiveness compared to state-of-the-art image annotation and tag ranking approaches.
Learning to rank image tags with limited training examplesCloudTechnologies
We are the company providing Complete Solution for all Academic Final Year/Semester Student Projects. Our projects are
suitable for B.E (CSE,IT,ECE,EEE), B.Tech (CSE,IT,ECE,EEE),M.Tech (CSE,IT,ECE,EEE) B.sc (IT & CSE), M.sc (IT & CSE),
MCA, and many more..... We are specialized on Java,Dot Net ,PHP & Andirod technologies. Each Project listed comes with
the following deliverable: 1. Project Abstract 2. Complete functional code 3. Complete Project report with diagrams 4.
Database 5. Screen-shots 6. Video File
SERVICE AT CLOUDTECHNOLOGIES
IEEE, WEB, WINDOWS PROJECTS ON DOT NET, JAVA& ANDROID TECHNOLOGIES,EMBEDDED SYSTEMS,MAT LAB,VLSI DESIGN.
ME, M-TECH PAPER PUBLISHING
COLLEGE TRAINING
Thanks&Regards
cloudtechnologies
# 304, Siri Towers,Behind Prime Hospitals
Maitrivanam, Ameerpet.
Contact:-8121953811,8522991105.040-65511811
cloudtechnologiesprojects@gmail.com
http://cloudstechnologies.in/
Semi-Supervised Discriminant Analysis Based On Data Structureiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Scene text recognition in mobile applications by character descriptor and str...eSAT Journals
This document presents a method for scene text recognition in mobile applications using character descriptors and structure configuration. It proposes using a character descriptor that combines feature detectors and descriptors to extract text features effectively. It also models character structure using stroke configuration maps derived from character boundaries and skeletons. The method was tested on various datasets and achieved accuracy rates above 70%, outperforming existing methods. It can detect text regions and recognize text information for applications like text understanding and retrieval on mobile devices.
Multiview Alignment Hashing for Efficient Image Search1crore projects
The document describes a new method called Multiview Alignment Hashing (MAH) for efficient image search. MAH aims to fuse multiple image feature representations while preserving the high-dimensional joint probability distribution of the data and obtaining orthogonal bases. It does this by formulating an objective function that is optimized using an alternate optimization procedure. This finds low-dimensional matrix factorizations via a technique called Regularized Kernel Nonnegative Matrix Factorization. After optimization, binary hash codes are obtained for images that can be used for efficient similarity search. The method is evaluated on several image datasets and is shown to outperform other state-of-the-art multiview hashing techniques.
Application of normalized cross correlation to image registrationeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
This document summarizes a study on using a fuzzy total margin based support vector machine (FTM-SVM) approach to handle class imbalance in machine learning classification problems. It discusses how traditional SVM classifiers can overfit to the majority class in imbalanced data sets. The proposed FTM-SVM method aims to address this issue by incorporating a total margin algorithm, different cost functions, and fuzzy membership functions to reduce the effect of outliers and noise on the minority class. The paper evaluates the FTM-SVM approach on artificial and imbalanced data sets, finding it achieves higher performance measures than some existing class imbalance learning methods.
This document presents a novel approach for measuring shape similarity and using it for object recognition. The key steps are:
1) Solving the correspondence problem between two shapes by attaching a descriptor called "shape context" to sample points on each shape. Shape context captures the distribution of remaining points relative to the reference point.
2) Using the point correspondences to estimate an aligning transformation between the shapes. This provides a measure of shape similarity as the matching error between corresponding points plus the magnitude of the transformation.
3) Treating recognition as a nearest neighbor problem to find the most similar stored prototype shape. The approach is demonstrated on various datasets including handwritten digits, silhouettes, and 3D objects
IMPROVING SUPERVISED CLASSIFICATION OF DAILY ACTIVITIES LIVING USING NEW COST...csandit
The growing population of elders in the society calls for a new approach in care giving. By
inferring what activities elderly are performing in their houses it is possible to determine their
physical and cognitive capabilities. In this paper we show the potential of important
discriminative classifiers namely the Soft-Support Vector Machines (C-SVM), Conditional
Random Fields (CRF) and k-Nearest Neighbors (k-NN) for recognizing activities from sensor
patterns in a smart home environment. We address also the class imbalance problem in activity
recognition field which has been known to hinder the learning performance of classifiers. Cost
sensitive learning is attractive under most imbalanced circumstances, but it is difficult to
determine the precise misclassification costs in practice. We introduce a new criterion for
selecting the suitable cost parameter C of the C-SVM method. Through our evaluation on four
real world imbalanced activity datasets, we demonstrate that C-SVM based on our proposed
criterion outperforms the state-of-the-art discriminative methods in activity recognition.
The document discusses fuzzy logical databases and an efficient algorithm for evaluating fuzzy equi-joins. It introduces fuzzy concepts in databases, defines a new measure for fuzzy equality, and proposes a fuzzy equi-join based on this measure. It then presents a sort-merge join algorithm called SMFEJ that uses interval ordering to efficiently evaluate the fuzzy equi-join in two phases: sorting relations on join attributes, and joining tuples with overlapping ranges.
LEARNING TO RANK IMAGE TAGS WITH LIMITED TRAINING EXAMPLES - IEEE PROJECTS I...Nexgen Technology
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
Efficient Image Retrieval by Multi-view Alignment Technique with Non Negative...RSIS International
The biggest challenge in today’s world is a searching of
images in a large database. For searching of an image a
technique which can be termed as Hashing is used. Already there
are many hashing techniques are present for retrieval of an
image in a large databank. The hashing technique can be done
on images by considering the high dimensional descriptor of an
image but in the existing hashing techniques single dimensional
descriptor is used from this the performance of the probability of
distribution of an image search will not achieve as expected. And
the drawback is that giving the query input in a texture format
leads to the limitations of image search that is firstly due to the
limited keyword and the second is Annotation approach by
human is ambiguous and incomplete.
To overcome from these drawbacks a new technique has been
proposed named as Multiview Alignment Hashing technique in
which it keeps the high dimensional feature descriptor data as
well probability of distribution of an images in a database. Along
with the Multiview feature descriptor another technique can be
used that is Nonnegetive Matrix Factorization (NMF). NMF is a
popular technique used in data mining in which clustering of a
data will be takes place by considering only the non- negative
matrix value.
So sánh cấu trúc protein_Protein structure comparisonbomxuan868
This document discusses various computational methods for comparing protein structures, including:
1. Structure alignment methods like DALI that align protein backbones to maximize similarity based on intramolecular distances between alpha carbons.
2. Methods like VAST that represent protein secondary structure as vectors and compare their spatial arrangements using graph theory.
3. Hashing methods like geometric hashing that assign protein structures invariant "keys" based on properties like angles between secondary structure vectors, in order to rapidly search databases for similar structures.
This document discusses fuzzy logical databases and an efficient algorithm for evaluating fuzzy equi-joins. It begins with an introduction to fuzzy concepts in databases, including representing imprecise data using fuzzy sets and membership functions. It then defines a new measure for fuzzy equality that is used to define a fuzzy equi-join. The document proposes a sort-merge join algorithm that sorts relations based on a partial order of intervals to efficiently evaluate the fuzzy equi-join in two phases: sorting and joining. Experimental results are said to show a significant improvement in efficiency when using this algorithm.
Scene Description From Images To SentencesIRJET Journal
This document presents an approach for generating sentences to describe images using distributed intelligence. It involves detecting objects in images using YOLO detection, finding relative positions of objects, labeling background scenes, generating tuples of objects/scenes/relations, extracting candidate sentences from Wikipedia containing tuple elements, searching images for each sentence and selecting the sentence whose images most closely match the input image. The approach is compared to the Babytalk model using BLEU and ROUGE scores, showing comparable performance. Future work to improve object detection and use larger knowledge sources is discussed.
Automatic face naming by learning discriminativenexgentech15
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
AUTOMATIC FACE NAMING BY LEARNING DISCRIMINATIVE AFFINITY MATRICES FROM WEAKL...nexgentechnology
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
Automatic Face Naming by Learning Discriminative Affinity Matrices From Weakl...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
LEARNING MIXTURES OF MARKOV CHAINS FROM AGGREGATE DATA WITH STRUCTURAL CONSTR...Nexgen Technology
TO GET THIS PROJECT COMPLETE SOURCE ON SUPPORT WITH EXECUTION PLEASE CALL BELOW CONTACT DETAILS
MOBILE: 9791938249, 0413-2211159, WEB: WWW.NEXGENPROJECT.COM,WWW.FINALYEAR-IEEEPROJECTS.COM, EMAIL:Praveen@nexgenproject.com
NEXGEN TECHNOLOGY provides total software solutions to its customers. Apsys works closely with the customers to identify their business processes for computerization and help them implement state-of-the-art solutions. By identifying and enhancing their processes through information technology solutions. NEXGEN TECHNOLOGY help it customers optimally use their resources.
This document contains summaries of several academic papers. The papers discuss topics related to computer vision, image processing, and machine learning including monocular depth estimation, subspace clustering, person re-identification, image set coding, 3D shape matching, single-image super-resolution, video synopsis, frame rate upconversion, in-loop filtering in video coding, microscopy image denoising, visual tracking, stereo matching, and brain image segmentation. Contact information is provided for TSYS Academic Projects in Adyar, India.
This document discusses using hidden Markov models (HMMs) for unsupervised learning in hyperspectral image classification. It proposes an HMM-based probability density function classifier that models hyperspectral data using a reduced feature space. The approach uses an unsupervised learning scheme for maximum likelihood parameter estimation, combining both model selection and estimation. This HMM method can accurately model and synthesize approximate observations of true hyperspectral data in a reduced feature space without relying on supervised learning.
The document proposes a novel approach for tag ranking in image annotation that combines tag ranking with matrix recovery. It aggregates prediction models for tags into a matrix and casts tag ranking as a matrix recovery problem. The method introduces a matrix trace norm to control model complexity, allowing reliable prediction even with limited training images. Experiments on image datasets demonstrate its effectiveness compared to state-of-the-art image annotation and tag ranking approaches.
Learning to rank image tags with limited training examplesCloudTechnologies
We are the company providing Complete Solution for all Academic Final Year/Semester Student Projects. Our projects are
suitable for B.E (CSE,IT,ECE,EEE), B.Tech (CSE,IT,ECE,EEE),M.Tech (CSE,IT,ECE,EEE) B.sc (IT & CSE), M.sc (IT & CSE),
MCA, and many more..... We are specialized on Java,Dot Net ,PHP & Andirod technologies. Each Project listed comes with
the following deliverable: 1. Project Abstract 2. Complete functional code 3. Complete Project report with diagrams 4.
Database 5. Screen-shots 6. Video File
SERVICE AT CLOUDTECHNOLOGIES
IEEE, WEB, WINDOWS PROJECTS ON DOT NET, JAVA& ANDROID TECHNOLOGIES,EMBEDDED SYSTEMS,MAT LAB,VLSI DESIGN.
ME, M-TECH PAPER PUBLISHING
COLLEGE TRAINING
Thanks&Regards
cloudtechnologies
# 304, Siri Towers,Behind Prime Hospitals
Maitrivanam, Ameerpet.
Contact:-8121953811,8522991105.040-65511811
cloudtechnologiesprojects@gmail.com
http://cloudstechnologies.in/
Semi-Supervised Discriminant Analysis Based On Data Structureiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Scene text recognition in mobile applications by character descriptor and str...eSAT Journals
This document presents a method for scene text recognition in mobile applications using character descriptors and structure configuration. It proposes using a character descriptor that combines feature detectors and descriptors to extract text features effectively. It also models character structure using stroke configuration maps derived from character boundaries and skeletons. The method was tested on various datasets and achieved accuracy rates above 70%, outperforming existing methods. It can detect text regions and recognize text information for applications like text understanding and retrieval on mobile devices.
Multiview Alignment Hashing for Efficient Image Search1crore projects
The document describes a new method called Multiview Alignment Hashing (MAH) for efficient image search. MAH aims to fuse multiple image feature representations while preserving the high-dimensional joint probability distribution of the data and obtaining orthogonal bases. It does this by formulating an objective function that is optimized using an alternate optimization procedure. This finds low-dimensional matrix factorizations via a technique called Regularized Kernel Nonnegative Matrix Factorization. After optimization, binary hash codes are obtained for images that can be used for efficient similarity search. The method is evaluated on several image datasets and is shown to outperform other state-of-the-art multiview hashing techniques.
Application of normalized cross correlation to image registrationeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
This document summarizes a study on using a fuzzy total margin based support vector machine (FTM-SVM) approach to handle class imbalance in machine learning classification problems. It discusses how traditional SVM classifiers can overfit to the majority class in imbalanced data sets. The proposed FTM-SVM method aims to address this issue by incorporating a total margin algorithm, different cost functions, and fuzzy membership functions to reduce the effect of outliers and noise on the minority class. The paper evaluates the FTM-SVM approach on artificial and imbalanced data sets, finding it achieves higher performance measures than some existing class imbalance learning methods.
This document presents a novel approach for measuring shape similarity and using it for object recognition. The key steps are:
1) Solving the correspondence problem between two shapes by attaching a descriptor called "shape context" to sample points on each shape. Shape context captures the distribution of remaining points relative to the reference point.
2) Using the point correspondences to estimate an aligning transformation between the shapes. This provides a measure of shape similarity as the matching error between corresponding points plus the magnitude of the transformation.
3) Treating recognition as a nearest neighbor problem to find the most similar stored prototype shape. The approach is demonstrated on various datasets including handwritten digits, silhouettes, and 3D objects
IMPROVING SUPERVISED CLASSIFICATION OF DAILY ACTIVITIES LIVING USING NEW COST...csandit
The growing population of elders in the society calls for a new approach in care giving. By
inferring what activities elderly are performing in their houses it is possible to determine their
physical and cognitive capabilities. In this paper we show the potential of important
discriminative classifiers namely the Soft-Support Vector Machines (C-SVM), Conditional
Random Fields (CRF) and k-Nearest Neighbors (k-NN) for recognizing activities from sensor
patterns in a smart home environment. We address also the class imbalance problem in activity
recognition field which has been known to hinder the learning performance of classifiers. Cost
sensitive learning is attractive under most imbalanced circumstances, but it is difficult to
determine the precise misclassification costs in practice. We introduce a new criterion for
selecting the suitable cost parameter C of the C-SVM method. Through our evaluation on four
real world imbalanced activity datasets, we demonstrate that C-SVM based on our proposed
criterion outperforms the state-of-the-art discriminative methods in activity recognition.
The document discusses fuzzy logical databases and an efficient algorithm for evaluating fuzzy equi-joins. It introduces fuzzy concepts in databases, defines a new measure for fuzzy equality, and proposes a fuzzy equi-join based on this measure. It then presents a sort-merge join algorithm called SMFEJ that uses interval ordering to efficiently evaluate the fuzzy equi-join in two phases: sorting relations on join attributes, and joining tuples with overlapping ranges.
LEARNING TO RANK IMAGE TAGS WITH LIMITED TRAINING EXAMPLES - IEEE PROJECTS I...Nexgen Technology
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
Efficient Image Retrieval by Multi-view Alignment Technique with Non Negative...RSIS International
The biggest challenge in today’s world is a searching of
images in a large database. For searching of an image a
technique which can be termed as Hashing is used. Already there
are many hashing techniques are present for retrieval of an
image in a large databank. The hashing technique can be done
on images by considering the high dimensional descriptor of an
image but in the existing hashing techniques single dimensional
descriptor is used from this the performance of the probability of
distribution of an image search will not achieve as expected. And
the drawback is that giving the query input in a texture format
leads to the limitations of image search that is firstly due to the
limited keyword and the second is Annotation approach by
human is ambiguous and incomplete.
To overcome from these drawbacks a new technique has been
proposed named as Multiview Alignment Hashing technique in
which it keeps the high dimensional feature descriptor data as
well probability of distribution of an images in a database. Along
with the Multiview feature descriptor another technique can be
used that is Nonnegetive Matrix Factorization (NMF). NMF is a
popular technique used in data mining in which clustering of a
data will be takes place by considering only the non- negative
matrix value.
So sánh cấu trúc protein_Protein structure comparisonbomxuan868
This document discusses various computational methods for comparing protein structures, including:
1. Structure alignment methods like DALI that align protein backbones to maximize similarity based on intramolecular distances between alpha carbons.
2. Methods like VAST that represent protein secondary structure as vectors and compare their spatial arrangements using graph theory.
3. Hashing methods like geometric hashing that assign protein structures invariant "keys" based on properties like angles between secondary structure vectors, in order to rapidly search databases for similar structures.
This document discusses fuzzy logical databases and an efficient algorithm for evaluating fuzzy equi-joins. It begins with an introduction to fuzzy concepts in databases, including representing imprecise data using fuzzy sets and membership functions. It then defines a new measure for fuzzy equality that is used to define a fuzzy equi-join. The document proposes a sort-merge join algorithm that sorts relations based on a partial order of intervals to efficiently evaluate the fuzzy equi-join in two phases: sorting and joining. Experimental results are said to show a significant improvement in efficiency when using this algorithm.
Scene Description From Images To SentencesIRJET Journal
This document presents an approach for generating sentences to describe images using distributed intelligence. It involves detecting objects in images using YOLO detection, finding relative positions of objects, labeling background scenes, generating tuples of objects/scenes/relations, extracting candidate sentences from Wikipedia containing tuple elements, searching images for each sentence and selecting the sentence whose images most closely match the input image. The approach is compared to the Babytalk model using BLEU and ROUGE scores, showing comparable performance. Future work to improve object detection and use larger knowledge sources is discussed.
Automatic face naming by learning discriminativenexgentech15
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
AUTOMATIC FACE NAMING BY LEARNING DISCRIMINATIVE AFFINITY MATRICES FROM WEAKL...nexgentechnology
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
Automatic Face Naming by Learning Discriminative Affinity Matrices From Weakl...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
LEARNING MIXTURES OF MARKOV CHAINS FROM AGGREGATE DATA WITH STRUCTURAL CONSTR...Nexgen Technology
TO GET THIS PROJECT COMPLETE SOURCE ON SUPPORT WITH EXECUTION PLEASE CALL BELOW CONTACT DETAILS
MOBILE: 9791938249, 0413-2211159, WEB: WWW.NEXGENPROJECT.COM,WWW.FINALYEAR-IEEEPROJECTS.COM, EMAIL:Praveen@nexgenproject.com
NEXGEN TECHNOLOGY provides total software solutions to its customers. Apsys works closely with the customers to identify their business processes for computerization and help them implement state-of-the-art solutions. By identifying and enhancing their processes through information technology solutions. NEXGEN TECHNOLOGY help it customers optimally use their resources.
This document contains summaries of several academic papers. The papers discuss topics related to computer vision, image processing, and machine learning including monocular depth estimation, subspace clustering, person re-identification, image set coding, 3D shape matching, single-image super-resolution, video synopsis, frame rate upconversion, in-loop filtering in video coding, microscopy image denoising, visual tracking, stereo matching, and brain image segmentation. Contact information is provided for TSYS Academic Projects in Adyar, India.
This document discusses using hidden Markov models (HMMs) for unsupervised learning in hyperspectral image classification. It proposes an HMM-based probability density function classifier that models hyperspectral data using a reduced feature space. The approach uses an unsupervised learning scheme for maximum likelihood parameter estimation, combining both model selection and estimation. This HMM method can accurately model and synthesize approximate observations of true hyperspectral data in a reduced feature space without relying on supervised learning.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
The document contains abstracts from 10 different research papers related to image processing and computer vision. The papers cover topics such as face recognition, reversible watermarking, building footprint detection from SAR images, change detection in remote sensing images, estimating information from image colors, vehicle detection, histology image retrieval, automatic license plate recognition, SAR image segmentation, and context-dependent logo matching and recognition.
An attribute assisted reranking model for web image searchShakas Technologies
Image search reranking is an effective approach to refine the text-based image search result. Most existing reranking approaches are based on low-level visual features. In this paper, we propose to exploit semantic attributes for image search reranking. Based on the classifiers for all the predefined attributes, each image is represented by an attribute feature consisting of the responses from these classifiers
ON THE PREDICTION ACCURACIES OF THREE MOST KNOWN REGULARIZERS : RIDGE REGRESS...ijaia
The document compares the prediction accuracies of ridge regression, lasso regression, and elastic net regularization methods on 13 datasets. It finds that the prediction accuracy depends heavily on the nature of the datasets. When using cross-validation, the lasso method worked better than ridge regression and elastic net on two datasets. When using BIC scoring, BIC produced better predictions than cross-validation for 6 datasets, especially favoring ridge regression on highly correlated datasets. Overall, ridge regression, lasso, and elastic net tended to perform similarly except on two datasets where ridge regression outperformed the others.
IRJET-Multimodal Image Classification through Band and K-Means ClusteringIRJET Journal
This document proposes a bilayer graph-based learning framework for multimodal image classification using limited labeled pixels. It constructs a simple graph in the first layer where each vertex is a pixel and edge weights encode pixel similarity. Unsupervised learning estimates grouping relations among pixels. These relations form a hypergraph in the second layer, on which semisupervised learning classifies pixels to address challenges of complex relationships and limited labels in multimodal images. The framework effectively exploits the underlying data structure.
Face detection using the 3 x3 block rank patterns of gradient magnitude imagessipij
Face detection locates faces prior to various face-
related applications. The objective of face detecti
on is to
determine whether or not there are any faces in an
image and, if any, the location of each face is det
ected.
Face detection in real images is challenging due to
large variability of illumination and face appeara
nces.
This paper proposes a face detection algorithm usin
g the 3×3 block rank patterns of gradient magnitude
images and a geometrical face model. First, the ill
umination-corrected image of the face region is obt
ained
using the brightness plane that is produced using t
he locally minimum brightness of each block. Next,
the
illumination-corrected image is histogram equalized
, the face region is divided into nine (3×3) blocks
, and
two directional (horizontal and vertical) gradient
magnitude images are computed, from which the 3×3
block rank patterns are obtained. For face detectio
n, using the FERET and GT databases three types of
the
3×3 block rank patterns are a priori determined as
templates based on the distribution of the sum of t
he
gradient magnitudes of each block in the face candi
date region that is also composed of nine (3×3) blo
cks.
The 3×3 block rank patterns roughly classify whethe
r the detected face candidate region contains a fac
e or
not. Finally, facial features are detected and used
to validate the face model. The face candidate is
validated as a face if it is matched with the geome
trical face model. The proposed algorithm is tested
on the
Caltech database images and real images. Experiment
al results with a number of test images show the
effectiveness of the proposed algorithm.
IMPROVING SUPERVISED CLASSIFICATION OF DAILY ACTIVITIES LIVING USING NEW COST...cscpconf
The growing population of elders in the society calls for a new approach in care giving. By inferring what activities elderly are performing in their houses it is possible to determine their
physical and cognitive capabilities. In this paper we show the potential of important discriminative classifiers namely the Soft-Support Vector Machines (C-SVM), Conditional Random Fields (CRF) and k-Nearest Neighbors (k-NN) for recognizing activities from sensor patterns in a smart home environment. We address also the class imbalance problem in activity recognition field which has been known to hinder the learning performance of classifiers. Cost sensitive learning is attractive under most imbalanced circumstances, but it is difficult to determine the precise misclassification costs in practice. We introduce a new criterion for selecting the suitable cost parameter C of the C-SVM method. Through our evaluation on four real world imbalanced activity datasets, we demonstrate that C-SVM based on our proposed criterion outperforms the state-of-the-art discriminative methods in activity recognition.
LEARNING SPLINE MODELS WITH THE EM ALGORITHM FOR SHAPE RECOGNITIONgerogepatton
This paper demonstrates how cubic Spline (B-Spline) models can be used to recognize 2-dimension nonrigid handwritten isolated characters. Each handwritten character is represented by a set of nonoverlapping uniformly distributed landmarks. The Spline models are constructed by utilizing cubic order of
polynomial to model the shapes under study. The approach is a two-stage process. The first stage is
learning, we construct a mixture of spline class parameters to capture the variations in spline coefficients
using the apparatus Expectation Maximization algorithm. The second stage is recognition, here we use the
Fréchet distance to compute the variations between the spline models and test spline shape for recognition.
We test the approach on a set of handwritten Arabic letters.
A Personal Privacy Data Protection Scheme for Encryption and Revocation of Hi...Shakas Technologies
A Personal Privacy Data Protection Scheme for Encryption and Revocation of High-Dimensional Attri
Shakas Technologies ( Galaxy of Knowledge)
#11/A 2nd East Main Road,
Gandhi Nagar,
Vellore - 632006.
Mobile : +91-9500218218 / 8220150373| land line- 0416- 3552723
Shakas Training & Development | Shakas Sales & Services | Shakas Educational Trust|IEEE projects | Research & Development | Journal Publication |
Email : info@shakastech.com | shakastech@gmail.com |
website: www.shakastech.com
Facebook: https://www.facebook.com/pages/Shakas-Technologies
Detecting Mental Disorders in social Media through Emotional patterns-The cas...Shakas Technologies
Detecting Mental Disorders in social Media through Emotional patterns-The case of Anorexia and depression
Shakas Technologies ( Galaxy of Knowledge)
#11/A 2nd East Main Road,
Gandhi Nagar,
Vellore - 632006.
Mobile : +91-9500218218 / 8220150373| land line- 0416- 3552723
Shakas Training & Development | Shakas Sales & Services | Shakas Educational Trust|IEEE projects | Research & Development | Journal Publication |
Email : info@shakastech.com | shakastech@gmail.com |
website: www.shakastech.com
Facebook: https://www.facebook.com/pages/Shakas-Technologies
CO2 EMISSION RATING BY VEHICLES USING DATA SCIENCE
Shakas Technologies ( Galaxy of Knowledge)
#11/A 2nd East Main Road,
Gandhi Nagar,
Vellore - 632006.
Mobile : +91-9500218218 / 8220150373| land line- 0416- 3552723
Shakas Training & Development | Shakas Sales & Services | Shakas Educational Trust|IEEE projects | Research & Development | Journal Publication |
Email : info@shakastech.com | shakastech@gmail.com |
website: www.shakastech.com
Facebook: https://www.facebook.com/pages/Shakas-Technologies
Identifying Hot Topic Trends in Streaming Text Data Using News Sequential Evo...Shakas Technologies
Identifying Hot Topic Trends in Streaming Text Data Using News Sequential Evolution Model Based on Distributed Representations.
Shakas Technologies ( Galaxy of Knowledge)
#11/A 2nd East Main Road,
Gandhi Nagar,
Vellore - 632006.
Mobile : +91-9500218218 / 8220150373| land line- 0416- 3552723
Shakas Training & Development | Shakas Sales & Services | Shakas Educational Trust|IEEE projects | Research & Development | Journal Publication |
Email : info@shakastech.com | shakastech@gmail.com |
website: www.shakastech.com
Facebook: https://www.facebook.com/pages/Shakas-Technologies
From Natural Language to Structured Solr Queries using LLMsSease
This talk draws on experimentation to enable AI applications with Solr. One important use case is to use AI for better accessibility and discoverability of the data: while User eXperience techniques, lexical search improvements, and data harmonization can take organizations to a good level of accessibility, a structural (or “cognitive” gap) remains between the data user needs and the data producer constraints.
That is where AI – and most importantly, Natural Language Processing and Large Language Model techniques – could make a difference. This natural language, conversational engine could facilitate access and usage of the data leveraging the semantics of any data source.
The objective of the presentation is to propose a technical approach and a way forward to achieve this goal.
The key concept is to enable users to express their search queries in natural language, which the LLM then enriches, interprets, and translates into structured queries based on the Solr index’s metadata.
This approach leverages the LLM’s ability to understand the nuances of natural language and the structure of documents within Apache Solr.
The LLM acts as an intermediary agent, offering a transparent experience to users automatically and potentially uncovering relevant documents that conventional search methods might overlook. The presentation will include the results of this experimental work, lessons learned, best practices, and the scope of future work that should improve the approach and make it production-ready.
Northern Engraving | Nameplate Manufacturing Process - 2024Northern Engraving
Manufacturing custom quality metal nameplates and badges involves several standard operations. Processes include sheet prep, lithography, screening, coating, punch press and inspection. All decoration is completed in the flat sheet with adhesive and tooling operations following. The possibilities for creating unique durable nameplates are endless. How will you create your brand identity? We can help!
How information systems are built or acquired puts information, which is what they should be about, in a secondary place. Our language adapted accordingly, and we no longer talk about information systems but applications. Applications evolved in a way to break data into diverse fragments, tightly coupled with applications and expensive to integrate. The result is technical debt, which is re-paid by taking even bigger "loans", resulting in an ever-increasing technical debt. Software engineering and procurement practices work in sync with market forces to maintain this trend. This talk demonstrates how natural this situation is. The question is: can something be done to reverse the trend?
Northern Engraving | Modern Metal Trim, Nameplates and Appliance PanelsNorthern Engraving
What began over 115 years ago as a supplier of precision gauges to the automotive industry has evolved into being an industry leader in the manufacture of product branding, automotive cockpit trim and decorative appliance trim. Value-added services include in-house Design, Engineering, Program Management, Test Lab and Tool Shops.
Getting the Most Out of ScyllaDB Monitoring: ShareChat's TipsScyllaDB
ScyllaDB monitoring provides a lot of useful information. But sometimes it’s not easy to find the root of the problem if something is wrong or even estimate the remaining capacity by the load on the cluster. This talk shares our team's practical tips on: 1) How to find the root of the problem by metrics if ScyllaDB is slow 2) How to interpret the load and plan capacity for the future 3) Compaction strategies and how to choose the right one 4) Important metrics which aren’t available in the default monitoring setup.
The Department of Veteran Affairs (VA) invited Taylor Paschal, Knowledge & Information Management Consultant at Enterprise Knowledge, to speak at a Knowledge Management Lunch and Learn hosted on June 12, 2024. All Office of Administration staff were invited to attend and received professional development credit for participating in the voluntary event.
The objectives of the Lunch and Learn presentation were to:
- Review what KM ‘is’ and ‘isn’t’
- Understand the value of KM and the benefits of engaging
- Define and reflect on your “what’s in it for me?”
- Share actionable ways you can participate in Knowledge - - Capture & Transfer
Conversational agents, or chatbots, are increasingly used to access all sorts of services using natural language. While open-domain chatbots - like ChatGPT - can converse on any topic, task-oriented chatbots - the focus of this paper - are designed for specific tasks, like booking a flight, obtaining customer support, or setting an appointment. Like any other software, task-oriented chatbots need to be properly tested, usually by defining and executing test scenarios (i.e., sequences of user-chatbot interactions). However, there is currently a lack of methods to quantify the completeness and strength of such test scenarios, which can lead to low-quality tests, and hence to buggy chatbots.
To fill this gap, we propose adapting mutation testing (MuT) for task-oriented chatbots. To this end, we introduce a set of mutation operators that emulate faults in chatbot designs, an architecture that enables MuT on chatbots built using heterogeneous technologies, and a practical realisation as an Eclipse plugin. Moreover, we evaluate the applicability, effectiveness and efficiency of our approach on open-source chatbots, with promising results.
QA or the Highway - Component Testing: Bridging the gap between frontend appl...zjhamm304
These are the slides for the presentation, "Component Testing: Bridging the gap between frontend applications" that was presented at QA or the Highway 2024 in Columbus, OH by Zachary Hamm.
This talk will cover ScyllaDB Architecture from the cluster-level view and zoom in on data distribution and internal node architecture. In the process, we will learn the secret sauce used to get ScyllaDB's high availability and superior performance. We will also touch on the upcoming changes to ScyllaDB architecture, moving to strongly consistent metadata and tablets.
[OReilly Superstream] Occupy the Space: A grassroots guide to engineering (an...Jason Yip
The typical problem in product engineering is not bad strategy, so much as “no strategy”. This leads to confusion, lack of motivation, and incoherent action. The next time you look for a strategy and find an empty space, instead of waiting for it to be filled, I will show you how to fill it in yourself. If you’re wrong, it forces a correction. If you’re right, it helps create focus. I’ll share how I’ve approached this in the past, both what works and lessons for what didn’t work so well.
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Keywords: AI, Containeres, Kubernetes, Cloud Native
Event Link: https://meine.doag.org/events/cloudland/2024/agenda/#agendaId.4211
"Choosing proper type of scaling", Olena SyrotaFwdays
Imagine an IoT processing system that is already quite mature and production-ready and for which client coverage is growing and scaling and performance aspects are life and death questions. The system has Redis, MongoDB, and stream processing based on ksqldb. In this talk, firstly, we will analyze scaling approaches and then select the proper ones for our system.
"Frontline Battles with DDoS: Best practices and Lessons Learned", Igor IvaniukFwdays
At this talk we will discuss DDoS protection tools and best practices, discuss network architectures and what AWS has to offer. Also, we will look into one of the largest DDoS attacks on Ukrainian infrastructure that happened in February 2022. We'll see, what techniques helped to keep the web resources available for Ukrainians and how AWS improved DDoS protection for all customers based on Ukraine experience
Astute Business Solutions | Oracle Cloud Partner |
Automatic face naming by learning discriminative affinity matrices from weakly labeled images
1. #13/ 19, 1st Floor, Municipal Colony, Kangayanellore Road, Gandhi Nagar, vellore – 6.
Off:0416-2247353 / 6066663 Mo: +91 9500218218 /8870603602,
Project Titles: http://shakastech.weebly.com/2015-2016-titles
Website:www.shakastech.com,Email - id:shakastech@gmail.com,info@shakastech.com
AUTOMATIC FACE NAMING BY LEARNING DISCRIMINATIVE AFFINITY
MATRICES FROM WEAKLY LABELED IMAGES
ABSTRACT
Given a collection of images, where each image contains several faces and is associated
with a few names in the corresponding caption, the goal of face naming is to infer the correct
name for each face. In this paper, we propose two new methods to effectively solve this problem
by learning two discriminative affinity matrices from these weakly labeled images. We first
propose a new method called regularized low-rank representation by effectively utilizing weakly
supervised information to learn a low-rank reconstruction coefficient matrix while exploring
multiple subspace structures of the data. Specifically, by introducing a specially designed
regularizer to the low-rank representation method, we penalize the corresponding reconstruction
coefficients related to the situations where a face is reconstructed by using face images from
other subjects or by using itself. With the inferred reconstruction coefficient matrix, a
discriminative affinity matrix can be obtained. Moreover, we also develop a new distance metric
learning method called ambiguously supervised structural metric learning by using weakly
supervised information to seek a discriminative distance metric. Hence, another discriminative
affinity matrix can be obtained using the similarity matrix (i.e., the kernel matrix) based on the
Mahalanobis distances of the data. Observing that these two affinity matrices contain
complementary information, we further combine them to obtain a fused affinity matrix, based on
which we develop a new iterative scheme to infer the name of each face. Comprehensive
experiments demonstrate the effectiveness of our approach.
2. #13/ 19, 1st Floor, Municipal Colony, Kangayanellore Road, Gandhi Nagar, vellore – 6.
Off:0416-2247353 / 6066663 Mo: +91 9500218218 /8870603602,
Project Titles: http://shakastech.weebly.com/2015-2016-titles
Website:www.shakastech.com,Email - id:shakastech@gmail.com,info@shakastech.com
EXISTING SYSTEM
Recently, there is an increasing research interest in developing automatic techniques for
face naming in images as well as in videos. To tag faces in news photos, Berg et al. proposed to
cluster the faces in the news images. Ozkan and Duygulu developed a graph-based method by
constructing the similarity graph of faces and finding the densest component. Guillaumin et al.
proposed the multiple-instance logistic discriminant metric learning (MildML) method. Luo and
Orabona proposed a structural support vector machine (SVM)-like algorithm called maximum
margin set (MMS) to solve the face naming problem. Recently, Zeng et al. proposed the low-
rank SVM (LR-SVM) approach to deal with this problem, based on the assumption that the
feature matrix formed by faces from the same subject is low rank. In the following, we compare
our proposed approaches with several related existing methods. Our rLRR method is related to
LRR and LR-SVM. LRR is an unsupervised approach for exploring multiple subspace structures
of data. In contrast to LRR, our rLRR utilizes the weak supervision from image captions and also
considers the image-level constraints when solving the weakly supervised face naming problem.
Moreover, our rLRR differs from LR-SVM [9] in the following two aspects. 1) To utilize the
weak supervision, LR-SVM considers weak supervision information in the partial permutation
matrices, while rLRR uses our proposed regularizer to penalize the corresponding reconstruction
coefficients. 2) LR-SVM is based on robust principal component analysis (RPCA) . Similarly to ,
LR-SVM does not reconstruct the data by using itself as the dictionary. In contrast, our rLRR is
related to the reconstruction based approach LRR. Moreover, our ASML is related to the
traditional metric learning works, such as large-margin nearest neighbors(LMNN) , Frobmetric ,
and metric learning to rank (MLR). LMNN and Frobmetric are based on accurate supervision
without ambiguity (i.e., the triplets of training samples are explicitly given), and they both use
the hinge loss in their formulation. In contrast, our ASML is based on the ambiguous
supervision, and we use a max margin loss to handle the ambiguity of the structural output, by
enforcing the distance based on the best label assignment matrix in the feasible label set to be
larger than the distance based on the best label assignment matrix in the infeasible label set by a
margin. Although a similar loss that deals with structural output is also used in MLR, it is used to
model the ranking orders of training samples, and there is no uncertainty regarding supervision
information in MLR (i.e., the groundtruth ordering for each query is given).
3. #13/ 19, 1st Floor, Municipal Colony, Kangayanellore Road, Gandhi Nagar, vellore – 6.
Off:0416-2247353 / 6066663 Mo: +91 9500218218 /8870603602,
Project Titles: http://shakastech.weebly.com/2015-2016-titles
Website:www.shakastech.com,Email - id:shakastech@gmail.com,info@shakastech.com
PROPOSED SYSTEM:
In this paper, we propose a new scheme for automatic face naming with caption-based
supervision. Specifically, we develop two methods to respectively obtain two discriminative
affinity matrices by learning from weakly labeled images. The two affinity matrices are further
fused to generate one fused affinity matrix, based on which an iterative scheme is developed for
automatic face naming. To obtain the first affinity matrix, we propose a new method called
regularized low-rank representation (rLRR) by incorporating weakly supervised information into
the low-rank representation (LRR) method, so that the affinity matrix can be obtained from the
resultant reconstruction coefficient matrix. To effectively infer the correspondences between the
faces based on visual features and the names in the candidate name sets, we exploit the subspace
structures among faces based on the following assumption: the faces from the same
subject/name lie in the same subspace and the subspaces are linearly independent. Liu et al.
showed that such subspace structures can be effectively recovered using LRR, when the
subspaces are independent and the data sampling rate is sufficient. They also showed that the
mined subspace information is encoded in the reconstruction coefficient matrix that is block-
diagonal in the ideal case. As an intuitive motivation, we implement LRR on a synthetic dataset
and the resultant reconstruction coefficient matrix is shown in Fig. 2(b) (More details can be
found in Sections V-A and V-C). This near block-diagonal matrix validates our assumption on
the subspace structures among faces. Specifically, the reconstruction coefficients between one
face and faces from the same subject are generally larger than others, indicating that the faces
from the same subject tend to lie in the same subspace. However, due to the significant variances
of inthe- wild faces in poses, illuminations, and expressions, the appearances of faces from
different subjects may be even more similar when compared with those from the same subject.
The faces may also be reconstructed using faces from other subjects. In this paper, we show that
the candidate names from the captions can provide important supervision information to better
discover the subspace structures. Our main contributions are summarized as follows.
1) Based on the caption-based weak supervision, we propose a new method rLRR by
introducing a new regularizer into LRR and we can calculate the first affinity matrix using the
resultant reconstruction coefficient matrix.
4. #13/ 19, 1st Floor, Municipal Colony, Kangayanellore Road, Gandhi Nagar, vellore – 6.
Off:0416-2247353 / 6066663 Mo: +91 9500218218 /8870603602,
Project Titles: http://shakastech.weebly.com/2015-2016-titles
Website:www.shakastech.com,Email - id:shakastech@gmail.com,info@shakastech.com
2) We also propose a new distance metric learning approach ASML to learn a discriminative
distance metric by effectively coping with the ambiguous labels of faces. The similarity matrix
(i.e., the kernel matrix) based on the Mahalanobis distances between all faces is used as the
second affinity matrix.
3) With the fused affinity matrix by combining the two affinity matrices from rLRR and
ASML, we propose an efficient scheme to infer the names of faces.
4) Comprehensive experiments are conducted on one synthetic dataset and two real-world
datasets, and the results demonstrate the effectiveness of our approaches.
Module 1
Affinity Matrix
Since the principles of proximity and smooth-continuation arise from local properties of
the configuration of the edges, we can model them using only local information. Both of these
local properties are modeled by the distribution of smooth curves that pass through two given
edges. The distribution of curves is modeled by a smooth, stochastic motion of a particle. Given
two edges, we determine the probability that a particle starts with the position and direction of
the first edge and ends with the position and direction of the second edge. The affinity from the
first to the second edge is the sum of the probabilities of all paths that a particle can take between
the two edges. The change in direction of the particle over time is normally distributed with zero
mean. Smaller the variance of the distribution, the smoother are the more probable curves that
pass between two edges. Thus the variance of the normal distribution models the principle of
smooth-continuation. In addition each particle has a non-zero probability for decaying at any
time. Hence, edges that are farther apart are likely to have fewer curves that pass through both of
them. Thus the decay of the particles models the principle of proximity. The affinities between
all pairs of edges form the affinity matrix .
5. #13/ 19, 1st Floor, Municipal Colony, Kangayanellore Road, Gandhi Nagar, vellore – 6.
Off:0416-2247353 / 6066663 Mo: +91 9500218218 /8870603602,
Project Titles: http://shakastech.weebly.com/2015-2016-titles
Website:www.shakastech.com,Email - id:shakastech@gmail.com,info@shakastech.com
Module 2
Learning discriminative affinity matrices For automatic face naming
In this section, we propose a new approach for automatic face naming with caption-
based supervision. In Sections III-A and III-B, we formally introduce the problem and
definitions, followed by the introduction of our proposed approach. Specifically, we learn two
discriminative affinity matrices by effectively utilizing the ambiguous labels, and perform face
naming based on the fused affinity matrix. In Sections III-C and III-D, we introduce our
proposed approaches rLRR and ASML for obtaining the two affinity matrices respectively. In
the remainder of this paper, we use lowercase/uppercase letters in boldface to denote a
vector/matrix (e.g., a denotes a vector and A denotes a matrix). The corresponding nonbold letter
with a subscript denotes the entry in a vector/matrix (e.g., ai denotes the i th entry of the vector
a, and Ai, j denotes an entry at the i th row and j th column of the matrix A). The superscript _
denotes the transpose of a vector or a matrix. We define In as the n ×n identity matrix, and 0n, 1n
∈ Rn as the n×1 column vectors of all zeros and all ones, respectively. For simplicity, we also
use I, 0 and 1 instead of In, 0n, and 1n when the dimensionality is obvious. Moreover, we use A
◦ B (resp., a ◦ b) to denote the element-wise product between two matrices A and B (resp., two
vectors a and b). tr(A) denotes the trace of A (i.e., tr(A) = _i Ai,i ), and _A,B_ denotes the inner
product of two matrices (i.e., _A,B_ = tr(A_B)). The inequality a ≤ b means that ai ≤ bi ∀ i = 1, .
. . , n and A 0 means that A is a positive semidefinite (PSD) matrix. _A_F = (_i, j A2i , j )1/2
denotes the Frobenious norm of a matrix A. _A_∞ denotes the largest absolute value of all
elements in A.
Module 3
Learning Discriminative Affinity Matrix With Regularized Low-Rank Representation
(rLRR)
We first give a brief review of LRR, and then present the proposed method that
introduces a discriminative regularizer into the objective of LRR. 1) Brief Review of LRR: LRR
[2] was originally proposed to solve the subspace clustering problem, which aims to explore the
subspace structure in the given data X = [x1, . . . , xn] ∈ Rd×n. Based on the assumption that the
subspaces are linearly independent, LRR [2] seeks a reconstruction matrix W = [w1, . . . ,wn] ∈
6. #13/ 19, 1st Floor, Municipal Colony, Kangayanellore Road, Gandhi Nagar, vellore – 6.
Off:0416-2247353 / 6066663 Mo: +91 9500218218 /8870603602,
Project Titles: http://shakastech.weebly.com/2015-2016-titles
Website:www.shakastech.com,Email - id:shakastech@gmail.com,info@shakastech.com
Rn×n, where each wi denotes the representation of xi using X (i.e., the data matrix itself) as the
dictionary. Since X is used as the dictionary to reconstruct itself, the optimal solution W∗ of
LRR encodes the pairwise affinities between the data samples. As discussed in [2, Th. 3.1], in
the noise-free case, W∗ should be ideally block diagonal, where W∗ i, j _= 0 if the i th sample
and the j th sample are in the same subspace.
Module 4
Learning Discriminative Affinity Matrix by Ambiguously Supervised Structural Metric
Learning (ASML)
Besides obtaining the affinity matrix from the coefficient matrix W∗ from rLRR (or
LRR), we believe the similarity matrix (i.e., the kernel matrix) among the faces is also an
appropriate choice for the affinity matrix. Instead of straightforwardly using the Euclidean
distances, we seek a discriminative Mahalanobis distance metric M so that Mahalanobis
distances can be calculated based on the learnt metric, and the similarity matrix can be obtained
based on the Mahalanobis distances. In the following, we first briefly review the LMNN method,
which deals with fully-supervised problems with the groung-truth labels of samples provided,
and then introduce our proposed ASML method that extends LMNN for face naming from
weakly labeled images.
Module 5
Inferring names of faces
With the coefficient matrix W∗ learned from rLRR, we can calculate the first affinity
matrix as AW = 12 (W1+W2) and normalize AW to the range [0, 1]. Furthermore, with the learnt
distance metric M from ASML, we can calculate the second affinity matrix as AK = K, where K
is a kernel matrix based on the Mahalanobis distances between the faces. Since the two affinity
matrices explore weak supervision information in different ways, they contain complementary
information and both of them are beneficial for face naming. For better face naming
performance, we combine these two affinity matrices and perform face naming based on the
fused affinity matrix. Specifically, we obtain a fused affinity matrix A as the linear combination
of the two affinity matrices, i.e., A = (1 − α)AW + αAK, where α is a parameter in the range [0,
7. #13/ 19, 1st Floor, Municipal Colony, Kangayanellore Road, Gandhi Nagar, vellore – 6.
Off:0416-2247353 / 6066663 Mo: +91 9500218218 /8870603602,
Project Titles: http://shakastech.weebly.com/2015-2016-titles
Website:www.shakastech.com,Email - id:shakastech@gmail.com,info@shakastech.com
1]. Finally, we perform face naming based on A. Since the fused affinity matrix is obtained
based on rLRR and ASML, we name our proposed method as rLRRml.
CONCLUSION
In this paper, we have proposed a new scheme for face naming with caption-based
supervision, in which one image that may contain multiple faces is associated with a caption
specifying only who is in the image. To effectively utilize the caption-based weak supervision,
we propose an LRR based method, called rLRR by introducing a new regularizer to utilize such
weak supervision information. We also develop a new distance metric learning method ASML
using weak supervision information to seek a discriminant Mahalanobis distance metric. Two
affinity matrices can be obtained from rLRR and ASML, respectively. Moreover, we further fuse
the two affinity matrices and additionally propose an iterative scheme for face naming based on
the fused affinity matrix. The experiments conducted on a synthetic dataset clearly demonstrate
the effectiveness of the new regularizer in rLRR. In the experiments on two challenging real-
world datasets (i.e., the Soccer player dataset and the Labeled Yahoo! News dataset), our rLRR
outperforms LRR, and our ASML is better than the existing distance metric learning method
MildML. Moreover, our proposed rLRRml outperforms rLRR and ASML, as well as several
state-of-the-art baseline algorithms. To further improve the face naming performances, we plan
to extend our rLRR in the future by additionally incorporating the _1-norm-based regularizer and
using other losses when designing new regularizers. We will also study how to automatically
determine the optimal parameters for our methods in the future.
REFERENCES
[1] P. Viola and M. J. Jones, “Robust real-time face detection,” Int. J. Comput. Vis., vol. 57, no.
2, pp. 137–154, 2004.
[2] G. Liu, Z. Lin, and Y. Yu, “Robust subspace segmentation by low-rank representation,” in
Proc. 27th Int. Conf. Mach. Learn., Haifa, Israel, Jun. 2010, pp. 663–670.
[3] T. L. Berg et al., “Names and faces in the news,” in Proc. 17th IEEE Comput. Soc. Conf.
Comput. Vis. Pattern Recognit., Washington, DC, USA, Jun./Jul. 2004, pp. II-848–II-854.
8. #13/ 19, 1st Floor, Municipal Colony, Kangayanellore Road, Gandhi Nagar, vellore – 6.
Off:0416-2247353 / 6066663 Mo: +91 9500218218 /8870603602,
Project Titles: http://shakastech.weebly.com/2015-2016-titles
Website:www.shakastech.com,Email - id:shakastech@gmail.com,info@shakastech.com
[4] D. Ozkan and P. Duygulu, “A graph based approach for naming faces in news photos,” in
Proc. 19th IEEE Comput. Soc. Conf. Comput. Vis. Pattern Recognit., New York, NY, USA, Jun.
2006, pp. 1477–1482.
[5] P. T. Pham, M. Moens, and T. Tuytelaars, “Cross-media alignment of names and faces,”
IEEE Trans. Multimedia, vol. 12, no. 1, pp. 13–27, Jan. 2010.
[6] M. Guillaumin, J. Verbeek, and C. Schmid, “Multiple instance metric learning from
automatically labeled bags of faces,” in Proc. 11th Eur. Conf. Comput. Vis., Heraklion, Crete,
Sep. 2010, pp. 634–647.
[7] J. Luo and F. Orabona, “Learning from candidate labeling sets,” in Proc. 23rd Annu. Conf.
Adv. Neural Inf. Process. Syst., Vancouver, BC, Canada, Dec. 2010, pp. 1504–1512.
[8] X. Zhang, L. Zhang, X.-J. Wang, and H.-Y. Shum, “Finding celebrities in billions of web
images,” IEEE Trans. Multimedia, vol. 14, no. 4, pp. 995–1007, Aug. 2012.
[9] Z. Zeng et al., “Learning by associating ambiguously labeled images,” in Proc. 26th IEEE
Conf. Comput. Vis. Pattern Recognit., Portland, OR, USA, Jun. 2013, pp. 708–715.
[10] M. Everingham, J. Sivic, and A. Zisserman, “Hello! My name is... Buffy—Automatic
naming of characters in TV video,” in Proc. 17th Brit. Mach. Vis. Conf., Edinburgh, U.K., Sep.
2006, pp. 899–908.
[11] J. Sang and C. Xu, “Robust face-name graph matching for movie character identification,”
IEEE Trans. Multimedia, vol. 14, no. 3, pp. 586–596, Jun. 2012.
[12] Y.-F. Zhang, C. Xu, H. Lu, and Y.-M. Huang, “Character identification in feature-length
films using global face-name matching,” IEEE Trans. Multimedia, vol. 11, no. 7, pp. 1276–1288,
Nov. 2009.
[13] M. Tapaswi, M. Bäuml, and R. Stiefelhagen, “‘Knock! Knock! Who is it?’ Probabilistic
person identification in TV series,” in Proc. 25th IEEE Conf. Comput. Vis. Pattern Recognit.,
Providence, RI, USA, Jun. 2012,
pp. 2658–2665.