Recently, visual tracking based on sparse principle component analysis has drawn much
research attention. As we all know, principle component analysis (PCA) is widely used in data
processing and dimensionality reduction. But PCA is difficult to interpret in practical
application and all those principal components are linear combinations of all variables. In our
paper, a novel visual tracking method based on sparse principal component analysis and L1
tracking is introduced, which we named the method SPCA-L1 tracking. We firstly introduce
trivial templates of L1 tracking method, which are used to describe noise, into PCA appearance
model. Then we use lasso model to achieve sparse coefficients. Then we update the eigenbasis
and mean incrementally to make the method robust when solving different kinds of changes of
the target. Numerous experiments, where the targets undergo large changes in pose, scale and
illumination, demonstrate the effectiveness and robustness of the proposed method.
201907 AutoML and Neural Architecture SearchDaeJin Kim
Brief introduction of NAS
Review of EfficientNet (Google Brain), RandWire (FAIR) papers
NAS flow slide from KihoSuh's slideshare (https://www.slideshare.net/KihoSuh/neural-architecture-search-with-reinforcement-learning-76883153)
[References]
[1] EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks (https://arxiv.org/abs/1905.11946)
[2] Exploring Randomly Wired Neural Networks for Image Recognition (https://arxiv.org/abs/1904.01569)
Critical Paths Identification on Fuzzy Network Projectiosrjce
In this paper, a new approach for identifying fuzzy critical path is presented, based on converting the
fuzzy network project into deterministic network project, by transforming the parameters set of the fuzzy
activities into the time probability density function PDF of each fuzzy time activity. A case study is considered as
a numerical tested problem to demonstrate our approach.
201907 AutoML and Neural Architecture SearchDaeJin Kim
Brief introduction of NAS
Review of EfficientNet (Google Brain), RandWire (FAIR) papers
NAS flow slide from KihoSuh's slideshare (https://www.slideshare.net/KihoSuh/neural-architecture-search-with-reinforcement-learning-76883153)
[References]
[1] EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks (https://arxiv.org/abs/1905.11946)
[2] Exploring Randomly Wired Neural Networks for Image Recognition (https://arxiv.org/abs/1904.01569)
Critical Paths Identification on Fuzzy Network Projectiosrjce
In this paper, a new approach for identifying fuzzy critical path is presented, based on converting the
fuzzy network project into deterministic network project, by transforming the parameters set of the fuzzy
activities into the time probability density function PDF of each fuzzy time activity. A case study is considered as
a numerical tested problem to demonstrate our approach.
MetaPerturb: Transferable Regularizer for Heterogeneous Tasks and ArchitecturesMLAI2
Regularization and transfer learning are two popular techniques to enhance generalization on unseen data, which is a fundamental problem of machine learning. Regularization techniques are versatile, as they are task- and architecture-agnostic, but they do not exploit a large amount of data available. Transfer learning methods learn to transfer knowledge from one domain to another, but may not generalize across tasks and architectures, and may introduce new training cost for adapting to the target task. To bridge the gap between the two, we propose a transferable perturbation, MetaPerturb, which is meta-learned to improve generalization performance on unseen data. MetaPerturb is implemented as a set-based lightweight network that is agnostic to the size and the order of the input, which is shared across the layers. Then, we propose a meta-learning framework, to jointly train the perturbation function over heterogeneous tasks in parallel. As MetaPerturb is a set-function trained over diverse distributions across layers and tasks, it can generalize to heterogeneous tasks and architectures. We validate the efficacy and generality of MetaPerturb trained on a specific source domain and architecture, by applying it to the training of diverse neural architectures on heterogeneous target datasets against various regularizers and fine-tuning. The results show that the networks trained with MetaPerturb significantly outperform the baselines on most of the tasks and architectures, with a negligible increase in the parameter size and no hyperparameters to tune.
Self Organizing Maps: Fundamentals.
Introduction to Neural Networks.
1. What is a Self Organizing Map?
2. Topographic Maps
3. Setting up a Self Organizing Map
4. Kohonen Networks
5. Components of Self Organization
6. Overview of the SOM Algorithm
Single Channel Speech De-noising Using Kernel Independent Component Analysis...theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
Presentation of my NSERC-USRA funded summer research project given at the Canadian Undergraduate Mathematics Conference (CUMC) 2014.
Please refer to the project site: http://jessebett.com/Radial-Basis-Function-USRA/
CORRELATION OF EIGENVECTOR CENTRALITY TO OTHER CENTRALITY MEASURES: RANDOM, S...csandit
In this paper, we thoroughly investigate correlations of eigenvector centrality to five centrality
measures, including degree centrality, betweenness centrality, clustering coefficient centrality,
closeness centrality, and farness centrality, of various types of network (random network, smallworld
network, and real-world network). For each network, we compute those six centrality
measures, from which the correlation coefficient is determined. Our analysis suggests that the
degree centrality and the eigenvector centrality are highly correlated, regardless of the type of
network. Furthermore, the eigenvector centrality also highly correlates to betweenness on
random and real-world networks. However, it is inconsistent on small-world network, probably
owing to its power-law distribution. Finally, it is also revealed that eigenvector centrality is
distinct from clustering coefficient centrality, closeness centrality and farness centrality in all
tested occasions. The findings in this paper could lead us to further correlation analysis on
multiple centrality measures in the near future
MetaPerturb: Transferable Regularizer for Heterogeneous Tasks and ArchitecturesMLAI2
Regularization and transfer learning are two popular techniques to enhance generalization on unseen data, which is a fundamental problem of machine learning. Regularization techniques are versatile, as they are task- and architecture-agnostic, but they do not exploit a large amount of data available. Transfer learning methods learn to transfer knowledge from one domain to another, but may not generalize across tasks and architectures, and may introduce new training cost for adapting to the target task. To bridge the gap between the two, we propose a transferable perturbation, MetaPerturb, which is meta-learned to improve generalization performance on unseen data. MetaPerturb is implemented as a set-based lightweight network that is agnostic to the size and the order of the input, which is shared across the layers. Then, we propose a meta-learning framework, to jointly train the perturbation function over heterogeneous tasks in parallel. As MetaPerturb is a set-function trained over diverse distributions across layers and tasks, it can generalize to heterogeneous tasks and architectures. We validate the efficacy and generality of MetaPerturb trained on a specific source domain and architecture, by applying it to the training of diverse neural architectures on heterogeneous target datasets against various regularizers and fine-tuning. The results show that the networks trained with MetaPerturb significantly outperform the baselines on most of the tasks and architectures, with a negligible increase in the parameter size and no hyperparameters to tune.
Self Organizing Maps: Fundamentals.
Introduction to Neural Networks.
1. What is a Self Organizing Map?
2. Topographic Maps
3. Setting up a Self Organizing Map
4. Kohonen Networks
5. Components of Self Organization
6. Overview of the SOM Algorithm
Single Channel Speech De-noising Using Kernel Independent Component Analysis...theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
Presentation of my NSERC-USRA funded summer research project given at the Canadian Undergraduate Mathematics Conference (CUMC) 2014.
Please refer to the project site: http://jessebett.com/Radial-Basis-Function-USRA/
CORRELATION OF EIGENVECTOR CENTRALITY TO OTHER CENTRALITY MEASURES: RANDOM, S...csandit
In this paper, we thoroughly investigate correlations of eigenvector centrality to five centrality
measures, including degree centrality, betweenness centrality, clustering coefficient centrality,
closeness centrality, and farness centrality, of various types of network (random network, smallworld
network, and real-world network). For each network, we compute those six centrality
measures, from which the correlation coefficient is determined. Our analysis suggests that the
degree centrality and the eigenvector centrality are highly correlated, regardless of the type of
network. Furthermore, the eigenvector centrality also highly correlates to betweenness on
random and real-world networks. However, it is inconsistent on small-world network, probably
owing to its power-law distribution. Finally, it is also revealed that eigenvector centrality is
distinct from clustering coefficient centrality, closeness centrality and farness centrality in all
tested occasions. The findings in this paper could lead us to further correlation analysis on
multiple centrality measures in the near future
Exploring The Dynamic Integration of Heterogeneous Services csandit
The increase need for services to handle a plethora of business needs within the enterprise
landscape has yielded to an increase in the development of heterogeneous services across the
digital world. In today’s digital economy, services are the key components for communication
and collaboration amongst enterprises internally and externally. Since Internet has stimulated
the use of services, different services have been developed for different purposes prompting
those services to be heterogeneous due to incompatibles approaches relied upon at both
conceptual and exploitation phases. The proliferation of developed heterogeneous services in
the digital world therefore comes along with a range of challenges more precisely in the
integration layer. Traditionally, integration is achieved by using gateways, which require
considerable configuration effort. Many approaches and frameworks have been developed by
different researchers to overcome these challenges, but up to date the challenges of integration
heterogeneous services with minimal user-involvement still exist. In this paper, we are exploring
the challenges of heterogeneous services and characteristics thereof with the aim of developing
a seamless approach that will alleviate some of these challenges in near future. It is therefore of
outmost importance to understand the challenges and characteristics of heterogeneous services
before developing a mechanism that could eliminate these challenges.
Several solutions exist for file storage, sharing, and synchronization. Many of them involve a
central server, or a collection of servers, that either store the files, or act as a gateway for them
to be shared. Some systems take a decentralized approach, wherein interconnected users form a
peer-to-peer (P2P) network, and partake in the sharing process: they share the files they
possess with others, and can obtain the files owned by other peers.
In this paper, we survey various technologies, both cloud-based and P2P-based, that users use
to synchronize their files across the network, and discuss their strengths and weaknesses.
A LITERATURE REVIEW ON SEMANTIC WEB – UNDERSTANDING THE PIONEERS’ PERSPECTIVEcsandit
There are various definitions, view and explanations about Semantic Web, its usage and its underlying architecture. However, the various flavours of explanations seem to have swayed way off-topic to the real purpose of Semantic Web. In this paper, we try to review the literature of Semantic Web based on the original views of the pioneers of Semantic Web which includes, Sir Tim Berners-Lee, Dean Allemang, Ora Lassila and James Hendler. Understanding the vision of the pioneers of any technology is cornerstone to the development. We have broken down Semantic Web into two approaches which allows us to reason with why Semantic Web is not mainstream.
Key Management Scheme for Secure Group Communication in WSN with Multiple Gr...csandit
Security is one of the inherent challenges in the area of Wireless Sensor Network (WSN). At
present, majority of the security protocols involve massive iterations and complex steps of
encryptions thereby giving rise to degradation of quality of service. Many WSN applications are
based on secure group communication. In this paper, we have proposed a scheme for secure
group key management with simultaneous multiple groups. The scheme uses a key-based
approach for managing the groups and we show that membership change events can be
handled with less storage, communication and computation cost. The scheme also offers
authentication to the messages communicated within and among the groups.
WIRELESS SENSORS INTEGRATION INTO INTERNET OF THINGS AND THE SECURITY PRIMITIVEScsandit
The common vision of smart systems today, is by and large associated with one single concept,
the internet of things (IoT), where the whole physical infrastructure is linked with intelligent
monitoring and communication technologies through the use of wireless sensors. In such an
intelligent vibrant system, sensors are connected to send useful information and control
instructions via distributed sensor networks. Wireless sensors have an easy deployment and
better flexibility of devices contrary to wired setup. With the rapid technological development of
sensors, wireless sensor networks (WSNs) will become the key technology for IoT and an
invaluable resource for realizing the vision of Internet of things (IoT) paradigm. It is also
important to consider whether the sensors of a WSN should be completely integrated into IoT or
not. New security challenges arise when heterogeneous sensors are integrated into the IoT. Security needs to be considered at a global perspective, not just at a local scale. This paper gives an overview of sensor integration into IoT, some major security challenges and also a
number of security primitives that can be taken to protect their data over the internet.
Basic Evaluation of Antennas Used in Microwave Imaging for Breast Cancer Dete...csandit
Microwave imaging is one of the most promising techniques in diagnosis and screening of
breast cancer and in the medical field that currently under development. It is nonionizing,
noninvasive, sensitive to tumors, specific to cancers, and low-cost. Microwave measurements
can be carried out either in frequency domain or in time domain. In order to develop a
clinically viable medical imaging system, it is important to understand the characteristics of the
microwave antenna. In this paper we investigate some antenna characteristics and discuss
limitations of existing and proposed systems.
CREATING DATA OUTPUTS FROM MULTI AGENT TRAFFIC MICRO SIMULATION TO ASSIMILATI...csandit
The intensive development of traffic engineering and technologies that are integrated into
vehicles, roads and their surroundings, bring opportunities of real time transport mobility
modeling. Based on such model it is then possible to establish a predictive layer that is capable
of predicting short and long term traffic flow behavior. It is possible to create the real time
model of traffic mobility based on generated data. However, data may have different
geographical, temporal or other constraints, or failures. It is therefore appropriate to develop
tools that artificially create missing data, which can then be assimilated with real data. This
paper presents a mechanism describing strategies of generating artificial data using
microsimulations. It describes traffic microsimulation based on our solution of multiagent
framework over which a system for generating traffic data is built. The system generates data of
a structure corresponding to the data acquired in the real world.
A FLOATING POINT DIVISION UNIT BASED ON TAYLOR-SERIES EXPANSION ALGORITHM AND...csandit
Floating point division, even though being an infrequent operation in the traditional sense, is
indis-pensable when it comes to a range of non-traditional applications such as K-Means
Clustering and QR Decomposition just to name a few. In such applications, hardware support
for floating point division would boost the performance of the entire system. In this paper, we
present a novel architecture for a floating point division unit based on the Taylor-series
expansion algorithm. We show that the Iterative Logarithmic Multiplier is very well suited to be
used as a part of this architecture. We propose an implementation of the powering unit that can
calculate an odd power and an even power of a number simultaneously, meanwhile having little
hardware overhead when compared to the Iterative Logarithmic Multiplier.
EVALUATION AND STUDY OF SOFTWARE DEGRADATION IN THE EVOLUTION OF SIX VERSIONS...csandit
When a software system evolves, new requirements may be added, existing functionalities
modified, or some structural change introduced. During such evolution, disorder may be
introduced, complexity increased or unintended consequences introduced, producing rippleeffect
across the system. JHotDraw (JHD), a well-tested and widely used open source Javabased
graphics framework developed with the best software engineering practice was selected
as a test suite. Six versions were profiled and data collected dynamically, from which two metrics were derived namely entropy and software maturity index. These metrics were used to investigate degradation as the software transitions from one version to another. This study observed that entropy tends to decrease as the software evolves. It was also found that a
software product attains its lowest decrease in entropy at the turning point where its highest maturity index is attained, implying a possible correlation between the point of lowest decreasein entropy and software maturity index.
Explore the Effects of Emoticons on Twitter Sentiment Analysis csandit
In recent years, Twitter Sentiment Analysis (TSA) has become a hot research topic. The target of
this task is to analyse the sentiment polarity of the tweets. There are a lot of machine learning
methods specifically developed to solve TSA problems, such as fully supervised method,
distantly supervised method and combined method of these two. Considering the specialty of
tweets that a limitation of 140 characters, emoticons have important effects on TSA. In this
paper, we compare three emoticon pre-processing methods: emotion deletion (emoDel),
emoticons 2-valued translation (emo2label) and emoticon explanation (emo2explanation).
Then, we propose a method based on emoticon-weight lexicon, and conduct experiments based
on Naive Bayes classifier, to validate the crucial role emoticons play on guiding emotion
tendency in a tweet. Experiments on real data sets demonstrate that emoticons are vital to TSA.
What is Sleeping pralysis and how it effect us ?Harshit Agarwal
Sleep paralysis consists of a period when one cannot perform voluntary movements. REM sleep- The stage of sleep marked by rapid eye movements, dreaming, and paralysis of motor systems; sleep with an activated brain.
Restorative effects of sleep appear to be more important for brain than rest of body.
Market based instruments as a policy instrument for environmental problemsGlen Speering
A short (15min) presentation on examples of market based instruments for addressing environmental problems. Definitions, caveats and popularity are covered.
Offline Character Recognition Using Monte Carlo Method and Neural Networkijaia
Human Machine interface are constantly gaining improvements because of increasing development of
computer tools. Handwritten Character Recognition do have various significant applications like form
scanning, verification, validation, or checks reading. Because of the importance of these applications
passionate research in the field of Off-Line handwritten character recognition is going on. The challenge in
recognising the handwritings lies in the nature of humans, having unique styles in terms of font, contours,
etc. This paper presents a novice approach to identify the offline characters; we call it as character divider
approach which can be used after pre-processing stage. We devise an innovative approach for feature
extraction known as vector contour. We also discuss the pros and cons including limitations, of our
approach
EMPIRICAL APPLICATION OF SIMULATED ANNEALING USING OBJECT-ORIENTED METRICS TO...ijcsa
The work is about using Simulated Annealing Algorithm for the effort estimation model parameter
optimization which can lead to the reduction in the difference in actual and estimated effort used in model
development.
The model has been tested using OOP’s dataset, obtained from NASA for research purpose.The data set
based model equation parameters have been found that consists of two independent variables, viz. Lines of
Code (LOC) along with one more attribute as a dependent variable related to software development effort
(DE). The results have been compared with the earlier work done by the author on Artificial Neural
Network (ANN) and Adaptive Neuro Fuzzy Inference System (ANFIS) and it has been observed that the
developed SA based model is more capable to provide better estimation of software development effort than
ANN and ANFIS
Image classification is perhaps the most important part of digital image analysis. In this paper, we compare the most widely used model CNN Convolutional Neural Network , and MLP Multilayer Perceptron . We aim to show how both models differ and how both models approach towards the final goal, which is image classification. Souvik Banerjee | Dr. A Rengarajan "Hand-Written Digit Classification" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-4 , June 2021, URL: https://www.ijtsrd.compapers/ijtsrd42444.pdf Paper URL: https://www.ijtsrd.comcomputer-science/artificial-intelligence/42444/handwritten-digit-classification/souvik-banerjee
Integrated Hidden Markov Model and Kalman Filter for Online Object Trackingijsrd.com
Visual prior from generic real-world images study to represent that objects in a scene. The existing work presented online tracking algorithm to transfers visual prior learned offline for online object tracking. To learn complete dictionary to represent visual prior with collection of real world images. Prior knowledge of objects is generic and training image set does not contain any observation of target object. Transfer learned visual prior to construct object representation using Sparse coding and Multiscale max pooling. Linear classifier is learned online to distinguish target from background and also to identify target and background appearance variations over time. Tracking is carried out within Bayesian inference framework and learned classifier is used to construct observation model. Particle filter is used to estimate the tracking result sequentially however, unable to work efficiently in noisy scenes. Time sift variance were not appropriated to track target object with observer value to prior information of object structure. Proposal HMM based kalman filter to improve online target tracking in noisy sequential image frames. The covariance vector is measured to identify noisy scenes. Discrete time steps are evaluated for identifying target object with background separation. Experiment conducted on challenging sequences of scene. To evaluate the performance of object tracking algorithm in terms of tracking success rate, Centre location error, Number of scenes, Learning object sizes, and Latency for tracking.
Noise-robust classification with hypergraph neural networknooriasukmaningtyas
This paper presents a novel version of hypergraph neural network method. This method is utilized to solve the noisy label learning problem. First, we apply the PCA dimensional reduction technique to the feature matrices of the image datasets in order to reduce the “noise” and the redundant features in the feature matrices of the image datasets and to reduce the runtime constructing the hypergraph of the hypergraph neural network method. Then, the classic graph based semisupervised learning method, the classic hypergraph based semi-supervised learning method, the graph neural network, the hypergraph neural network, and our proposed hypergraph neural network are employed to solve the noisy label learning problem. The accuracies of these five methods are evaluated and compared. Experimental results show that the hypergraph neural network methods achieve the best performance when the noise level increases. Moreover, the hypergraph neural network methods are at least as good as the graph neural network.
MULTIPLE HUMAN TRACKING USING RETINANET FEATURES, SIAMESE NEURAL NETWORK, AND...IAEME Publication
Multiple human tracking based on object detection has been a challenge due to its
complexity. Errors in object detection would be propagated to tracking errors. In this
paper, we propose a tracking method that minimizes the error produced by object
detector. We use RetinaNet as object detector and Hungarian algorithm for tracking.
The cost matrix for Hungarian algorithm is calculated using the RetinaNet features,
bounding box center distances, and intersection of unions of bounding boxes. We
interpolate the missing detections in the last step. The proposed method yield 43.2
MOTA for MOT16 benchmark
A New Method Based on MDA to Enhance the Face Recognition PerformanceCSCJournals
A novel tensor based method is prepared to solve the supervised dimensionality reduction problem. In this paper a multilinear principal component analysis(MPCA) is utilized to reduce the tensor object dimension then a multilinear discriminant analysis(MDA), is applied to find the best subspaces. Because the number of possible subspace dimensions for any kind of tensor objects is extremely high, so testing all of them for finding the best one is not feasible. So this paper also presented a method to solve that problem, The main criterion of algorithm is not similar to Sequential mode truncation(SMT) and full projection is used to initialize the iterative solution and find the best dimension for MDA. This paper is saving the extra times that we should spend to find the best dimension. So the execution time will be decreasing so much. It should be noted that both of the algorithms work with tensor objects with the same order so the structure of the objects has been never broken. Therefore the performance of this method is getting better. The advantage of these algorithms is avoiding the curse of dimensionality and having a better performance in the cases with small sample sizes. Finally, some experiments on ORL and CMPU-PIE databases is provided.
A Survey On Tracking Moving Objects Using Various AlgorithmsIJMTST Journal
Sparse representation has been applied to the object tracking problem. Mining the self- similarities between particles via multitask learning can improve tracking performance. How-ever, some particles may be different from others when they are sampled from a large region. Imposing all particles share the same structure may degrade the results. To overcome this problem, we propose a tracking algorithm based on robust multitask sparse representation (RMTT) in this letter. When we learn the particle representations, we decompose the sparse coefficient matrix into two parts in our algorithm. Joint sparse regularization is imposed on one coefficient matrix while element-wise sparse regularization is imposed on another matrix. The former regularization exploits self-similarities of particles while the later one considers the differences between them.
2D Features-based Detector and Descriptor Selection System for Hierarchical R...gerogepatton
Detection and description of keypoints from an image is a well-studied problem in Computer Vision. Some
methods like SIFT, SURF or ORB are computationally really efficient. This paper proposes a solution for
a particular case study on object recognition of industrial parts based on hierarchical classification. Reducing the number of instances leads to better performance, indeed, that is what the use of the hierarchical
classification is looking for. We demonstrate that this method performs better than using just one method
like ORB, SIFT or FREAK, despite being fairly slower
In recent machine learning community, there is a trend of constructing a linear logarithm version of
nonlinear version through the ‘kernel method’ for example kernel principal component analysis, kernel
fisher discriminant analysis, support Vector Machines (SVMs), and the current kernel clustering
algorithms. Typically, in unsupervised methods of clustering algorithms utilizing kernel method, a
nonlinear mapping is operated initially in order to map the data into a much higher space feature, and then
clustering is executed. A hitch of these kernel clustering algorithms is that the clustering prototype resides
in increased features specs of dimensions and therefore lack intuitive and clear descriptions without
utilizing added approximation of projection from the specs to the data as executed in the literature
presented. This paper aims to utilize the ‘kernel method’, a novel clustering algorithm, founded on the
conventional fuzzy clustering algorithm (FCM) is anticipated and known as kernel fuzzy c-means algorithm
(KFCM). This method embraces a novel kernel-induced metric in the space of data in order to interchange
the novel Euclidean matric norm in cluster prototype and fuzzy clustering algorithm still reside in the space
of data so that the results of clustering could be interpreted and reformulated in the spaces which are
original. This property is used for clustering incomplete data. Execution on supposed data illustrate that
KFCM has improved performance of clustering and stout as compare to other transformations of FCM for
clustering incomplete data.
Semi-supervised learning approach using modified self-training algorithm to c...IJECEIAES
Burst header packet flooding is an attack on optical burst switching (OBS) network which may cause denial of service. Application of machine learning technique to detect malicious nodes in OBS network is relatively new. As finding sufficient amount of labeled data to perform supervised learning is difficult, semi-supervised method of learning (SSML) can be leveraged. In this paper, we studied the classical self-training algorithm (ST) which uses SSML paradigm. Generally, in ST, the available true-labeled data (L) is used to train a base classifier. Then it predicts the labels of unlabeled data (U). A portion from the newly labeled data is removed from U based on prediction confidence and combined with L. The resulting data is then used to re-train the classifier. This process is repeated until convergence. This paper proposes a modified self-training method (MST). We trained multiple classifiers on L in two stages and leveraged agreement among those classifiers to determine labels. The performance of MST was compared with ST on several datasets and significant improvement was found. We applied the MST on a simulated OBS network dataset and found very high accuracy with a small number of labeled data. Finally we compared this work with some related works.
2D FEATURES-BASED DETECTOR AND DESCRIPTOR SELECTION SYSTEM FOR HIERARCHICAL R...gerogepatton
Detection and description of keypoints from an image is a well-studied problem in Computer Vision. Some methods like SIFT, SURF or ORB are computationally really efficient. This paper proposes a solution for a particular case study on object recognition of industrial parts based on hierarchical classification. Reducing the number of instances leads to better performance, indeed, that is what the use of the hierarchical classification is looking for. We demonstrate that this method performs better than using just one method
like ORB, SIFT or FREAK, despite being fairly slower.
Similar to Robust Visual Tracking Based on Sparse PCA-L1 (20)
Generating a custom Ruby SDK for your web service or Rails API using Smithyg2nightmarescribd
Have you ever wanted a Ruby client API to communicate with your web service? Smithy is a protocol-agnostic language for defining services and SDKs. Smithy Ruby is an implementation of Smithy that generates a Ruby SDK using a Smithy model. In this talk, we will explore Smithy and Smithy Ruby to learn how to generate custom feature-rich SDKs that can communicate with any web service, such as a Rails JSON API.
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
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.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
2. 126 Computer Science & Information Technology (CS & IT)
second one is method based on sparse representation, in which most of the appearance
information about the target is represented by a linear combination of only a few basis vectors.
And the third one is method based on subspace analysis, which we are studying about. It includes
the methods based on Non-negative matrix factorization (NMF), methods based on Kernel, and
the ones based on principal component analysis (PCA).
Recently, the PCA draws more and more attention. There are many works following PCA. Ross
et al. [4] proposed an adaptive probabilistic tracking approach to update the models of a target by
means of incremental eigenbasis updates. Kwon and Lee [10] apply sparse PCA to formulate
tracking. Under the subspace assumption, Sui and Zhang[11] propose a locally structured
Gaussian Process and cast tracking as a regression problem. These methods based on PCA
provide a compact representation of the target, which is efficient in feature extraction and
removing redundant information. At the same time, the probabilistic model facilitates efficient
computation.
But subspaces learning is essentially sensitive to occlusion. For this reason, some methods for
occlusion handling need to be used with subspace learning together. Wang et al. [12] use the
subspace model to represent the target and impose sparsity on the residual errors to deal with
occlusions.
In this paper, under the framework of particle filter, we proposed a new tracking method based on
sparse principal component analysis, which can work more robustly, especially with the
occlusion. Our contributions are as follows:
1) Reconstruct new target models with PCA subspace learning and trivial templates, so we
can, at the same time, describe the candidates and noise, the trivial templates can deal
with the noise, like occlusion, during the tracking;
2) Use lasso model to get the sparse coefficient of principle components;
3) Incrementally learn and update the low-dimensional subspace representation, including
correctly update the eigenbasis.
The remaining part of this paper is organized as follows. In Section 2, we review some relevant
approaches that motivated our work. The details of our method are described in Section 3.
Experimental results are reported in Section 4. We conclude this paper in Section 5.
2. RELATED WORK
In this section, we will briefly introduce the tracking method IVT (Incremental Visual Tracking)
[4, 5] and L1 minimization visual tracking [7]. Both of the methods are in particle framework.
The IVT is a traditional tracking method based on incremental subspace learning. It learns and
updates the low-dimensional subspace representation of the targets. In order to estimate the
locations of the target in the new coming frames, IVT predicts the candidates by using a sampling
algorithm with likelihood estimates instead of gradient descent. It performs well with the
variation of the target and surrounding illumination. But when the target is occluded by other
things, it may drift away and miss the target in the end. And L1 minimization is a method by
casting tracking as a sparse approximation problem. It introduces a set of trivial templates to deal
3. Computer Science & Information Technology (CS & IT) 127
with the occlusion problem. The trivial templates are used to capture the noise and occlusion. The
L1 tracking is robust with the noise and partly occlusion. But the tracking speed is slowly and it
is not real-time.
Our work is motivated by the IVT method and L1 minimization method. We use PCA to
reconstruct the target templates, so the templates are orthometric with each other and need
smaller storage space. At the same time, we introduce the trivial templates to handle the noise.
And we choose the candidate with smallest residual as the new target. Then we update the
subspace by incrementally updating the eigenbasis.
3. OUR WORK
In this section, the details of our tracking method based on sparse PCA-L1 will be introduced.
Our tracking method is conducted within the particle filtering framework. The main parts of our
method are as follows.
A. New target models subspace and trivial templates
We want to reconstruct new target models involving PCA subspace and trivial templates, so we
can describe the candidates and noise at the same time. The trivial templates can deal with the
noise, like occlusion, during the tracking at the same time. The Fig.1 shows the difference
between the models of L1 tracking, IVT tracking and our tracking method, Sparse PCA-L1. In
Fig.1 (a), we can see the subspace representation of the target object in IVT tracking. Fig.1 (b)
shows the models of L1 minimization tracking, which includes trivial templates to capture the
occlusion. Our tracking models are represented in Fig.1 (c). At initialization, we manually select
the first target template from the first frame; then apply zero mean unit norm normalization, it is
the first template. The rest templates are created by moving one pixel in four possible directions
at the corner points of the first template in the first frame. These are the basic models. Then we
use PCA to learn those basic models, making them orthotropic to each other. Meanwhile we
introduce trivial templates to represent the occlusion. Thus our models need less space than L1
tracking models and more robust than IVT when the target is occluded.
We use ∈ ≫d×d×d×d×nnnn
1 2 nT = [t ,t ..t ] R (d n)to represent the new template set, and use
∈ d×d×d×d×dddd
1 dI = [i ,...i ] R to represent the trivial template set. So the candidate can be describe by
the following formulation:
T
I
a
y = (T,I)( )+ e
a
(1)
Where y is the observed candidate, Ta is the coefficient of the main templates, xa is the
coefficient of the trivial templates and e is the representation residual.
4. 128 Computer Science & Information Technology (CS & IT)
(a) IVT target models
(b) L1 minimization tracking target models
(c) SPCA-L1 target models
By using the new models, we can collect the most information of the target and candidates.
Meanwhile when the target is covered, the trivial templates can represent the noise and make
our tracking robust. It will be proved in the experiment part following.
B. Lasso model for sparse representation
As we introduced in the former part, after learning the basic templates, we use subspace learning
method PCA to reduce the dimension of template set. Then we need to get the sparse
coefficients a in formation (1).
5. Computer Science & Information Technology (CS & IT) 129
We know that the formation has more than one solution. But we want to get the sparse solution,
so we exploit the compressibility in the transform domain by solving the problem as an 1l
regularized least squares problem, which is known to typically yield sparse solutions. As the
coefficients include the ones of trivial templates, so the problem in our tracking method is
transformed to the following formation:
ˆ 2 2
2 1 I 2
a
1 d
a = arg min{ || y - Ba || +λ || a || + || a || }
2 2
s.t. ≥a 0 (2)
Where B = [T,I] in formation (1). 1||.|| and 2||.|| denote the 1l and 2l norms respectively.
At last, we choose the candidate which has the smallest residual as the new target.
2 2
2 2identity(y) = argmin{|| e || } = argmin{|| y - Ba || } (3)
C. Online Tracking models and incrementally update of the mean and eigenbasis
The appearance of a target object often change drastically due to different kinds of factors.
Therefore, we need to adapt the appearance online to reflect these changes. The appearance
model we have chosen, a eigenbasis, is typically learned off-line from a set of training images,
d×d×d×d×nnnn matrix, { }1 nT = t ,...,t , by taking computing the eigenvectors U . Then we present our
approach for drawing particles in the motion parameter space and predicting the most likely
candidate with the help of the learned appearance model.
The sample mean of the training images is ∑
n
ii=1
1
t = t
n
, and the sample covariance matrix is
∑
n T
i ii=1
1
(t - t )(t - t )
n - 1
,and its eigenvector is describe as U . Equivalently one can obtain U
by computing the singular value decomposition T
T = UΣV of the centered data matrix
1 n[(t - t )...(t - t )] , with columns equal to the respective training images minus their mean.
When the additional m images,d×d×d×d×mmmm matrix, { }n+1 n+mW = t ,...t comes, we retrain the
eigenbasis. This update could be performed by computing the singular value decomposition
′ ′T
[T W ] = U'Σ V of the centered data matrix 1 n+m[(t - t' )...(t - t' )] , where 't is the
average of the entire n+ m training images.
We describe a new method based on the Sequential Karhunen Loeve (SKL) algorithm. Letting
be the component of W orthogonal to U , we can express the concatenation of T and W in
a partitioned form as follows:
6. 130 Computer Science & Information Technology (CS & IT)
Let , which is a square matrix of size k + m ,where k is the number of
singular values in ΣΣΣΣ . The SVD of R , , can be computed in constant time
regardless of n , the initial number of data. Then the SVD of [T W ] can be expressed as
follows:
By using this algorithm, we can calculate the updating process more efficiently. The following
table (1) shows the storage space and computational complexity change before and after the
optimization. It is clear that both storage space and computational complexity are reduced, and it
is helpful to track more quickly.
Table1: Comparison before and after the optimization
4. RESULTS
In this section, we present the experiment results achieved by applying our method. To
demonstrate the performance of our method, we track the classical videos in the visual tracking,
involving 1) target pose change 2) different light conditions 3) scale change and so on. We do the
experiment on the computer: Inter(R) Core(TM) i5-4590 CPU, 3.30GHz, 4GB. And we use
Matlab to do the simulation. All the results are as follow: the red color stands for our method, the
pink is IVT, the yellow one represents L1 tracking, the black is APG, the blue is CT, and the
green is MIL. We pay especially attention to the comparison of our method with IVT, which
based on subspace.
A. Intuitive comparison
As the Fig.2 shows, the first car4 video shows a car passing beneath a bridge with sudden
illumination change. Our algorithm can track the car efficiently. While the MIL drifts a little
when the car undergoes illumination, and CT drifts and at last loses the target.
7. Computer Science & Information Technology (CS & IT) 131
a). Frame 26 b). Frame 38 c). Frame 56
d). Frame 71 e). Frame 76 f). Frame 96
Fig.2 Car4 tracking results
In Fig.3, the second David indoor video involves light change and target pose change, recorded at
15 frames per second with a moving digital camera. The man moves from a dark area to a bright
area, the back to the dark area, who undergoes lighting and pose changes. Notice that there is a
large scale variation in the target. It’s clear that our algorithm is able to track the target
throughout the sequences, no matter of light change or scale variation. The MIL method and L1
tracking experience drift, and the L1 even loses the target at #311.
a). Frame 36 b). Frame 57 c). Frame 93
d). Frame 189 e). Frame 300 f). Frame 311
Fig.3 David indoor tracking results
About Fig.4, the third video occluded face2 involves occlusion. In the video, the target is
occluded by a book. We can find that when the man’s face is covered by a book and a hat, L1
tracking and CT drifts away from the target. And when the man tilted his head, the IVT is not
8. 132 Computer Science & Information Technology (CS & IT)
robust. It is the same condition in Fig.3 when David turns left at #189, and since then the tracking
rectangle is not identical to the target. During the process, our method perform well and deal with
occlusion problem perfectly.
a). Frame 100 b). Frame 133 c). Frame 200
d). Frame 345 e). Frame 450 f). Frame 638
Fig.4 Occluded face2 tracking results
In Fig.5, It is a video of a girl, who turns her head around and later is covered by a man’s face.
MIL and APG perform a little bad, especially when the man covers the girl’s face. And the IVT
mistakes the man as the target instead of the girl because of occlusion. And our method locks the
target even she turns around. And just drifts a little when the man appears.
a). Frame 72 b). Frame 110 c). Frame 250
d). Frame 320 e). Frame 390 f). Frame 455
Fig.5 Girl tracking results
9. Computer Science & Information Technology (CS & IT) 133
B. Accuracy comparison
To evaluate the accuracy of our tracking algorithm, we consider the center position errors of each
tracking method. As we can see, the center position errors of CT and MIL in sequences ‘Car4,
David indoor and Girl’ increase at or after 100 frames. The L1 tracking method does a bad job in
David indoor. Meanwhile, the IVT performs badly when the target is occluded because the center
position errors increase in Occluded face2. But in these 4 videos, our tracking method does better
than the other 5 methods.
Fig.6 Center position errors of four challenging sequences
Besides, we calculate the average center position errors of the above results. As showing in Table
2, the red one represents the smallest average center position errors, the blue is the second best.
So our tracking enhances a little in accuracy than IVT and L1 tracking methods.
10. 134 Computer Science & Information Technology (CS & IT)
Table 2: Average center position errors
Trackers
Sequences
LAD
(pixels)
IVT MIL CT L1 APG
Car4 2.8 3.4 67.5 90.2 3.6 6.7
David indoor 3.3 6.1 27.0 7.5 66.7 10.2
Occluded face2 5.9 33.7 14.3 11.1 6.9 13.0
Girl 2.9 9.3 14.6 18.3 3.0 3.2
4. CONCLUSION
The tracking method sparse PCA-L1 is a robust tracking method. Because we add the trivial
template and PCA subspace together, the tracking method does a good job when the target
undergo pose, illumination and appearance change and occlusion. We mix the advantages that
PCA subspace can represent most information of the target and trivial template can describe the
noise like occlusion and so on. At the same time, we update the eigenbasis and mean accurately
and efficiently. So when the target changes, we can gradually form the new models according to
the eigenbasis.
REFERENCES
[1] Z. Kalal, J. Matas, and K. Mikolajczyk. P-N learning: Bootstrapping binary classifiers by structural
constraints. In CVPR, 2010.3,7.
[2] Grabner,H., Leistner,C., Bischof,H.: ‘Semi-supervised online boosting for robust tracking’. Proc.
European Conf. Computer Vision (ECCV), Marseille, France, October 2008,pp.234-247
[3] Sankarayanan, K., Davis, J.W.: ‘One class multiple instance learning and applications to target
tracking’. Proc. IEEE Conf. Computer Vision(ACCV), Daejeon, Korea, November 2012, pp.1-14
[4] Ross,D. , Lim, J. , Yang, M.H : ‘Adaptive probabilistic visual tracking with incremental subspace
update’. Proc. European Conf. Computer Vision(ECCV), Prague, Czech Republic, May 2004,
pp.470-482
[5] Lim, J., Ross, D., Lin, R.S., Yang, M.H.: ‘Incremental learning for visual tracking’, in Weiss, Y.,
Bottou, L., (Eds.), ‘Advances in neural information processing systems’ (MTI Press, 2005), pp.793-
800
[6] Mei, X., Ling, H.B.: ‘Robust visual tracking and vehicle classification via sparse representation’,
IEEE Trans. Pattern Anal. Mach. Intell., 2011,33,(11), pp.2259-2272
[7] Mei, X., Ling, H.B.: ‘Robust visual tracking using L1 minimization’. Proc. IEEE Int. Conf. Computer
Vision(ICCV), Kyoto, Japan, September 2009, pp.1436-1443w
11. Computer Science & Information Technology (CS & IT) 135
[8] Zou,H., and Hastie, T.(2005),’Regularization and Variable selection via the Elastic Net’ Journal of
the Royal Statistical Society, Series B,67,301-320.
[9] Jolliffe,I.T., Tredafilov, N.T., and Uddin, M.(2003),’A Modified Principle Component Technique
Based on the Lasso’ Journal of Computational and Graphical Statistics, 12,531-547.
[10] J. Kwon and K. Lee. Visual tracking decomposition. In CVPR,2010.2,3,7.
[11] Y. Sui and L. Zhang.’ Visual Tracking via Locally Structured Gaussian Process Regression’. IEEE
Signal Processing Letters,22(9):1331-1335,2015.3,7
[12] D. Wang, H. Lu and M. Yang. ‘Online object tracking with sparse prototypes’. IEEE Transactions on
Image Processing(TIP), 22(I):314-325,2013.2,3
[13] T. Zhang, B. Ghanem, S. Liu, and N. Ahuji, ‘Low rank sparse learning for robust visual tracking’. In
ECCV,2012.3,6,7.
[14] S. Hare, A. Saffari, and P. Torr. Struck:’ Structured output tracking with kernels’. In ICCV,2011.3.
[15] Yao Sui, Yafei Tang, Li Zhang. ‘Discriminative Low Rank Tracking’. ICCV 2015.3002-3010.
[16] A. d’ Aspremont, L. EI Ghaoui, M.Jordan, and G.Lanckriet.’ A direct formulation for sparse PCA
using semidefinite programming’. SIAM Review ,46(3),2007.
AUTHORS
Yuanyuan Zhang received B.S. degree in Electronic science and technology from
Nanjing University of Aeronautics and Astronautics, Nanjing, China, in 2014. Now
she is studying the M.S. degree in School of Electronics and Information Engineering
of Beihang University, Beijing, China. Her current research interests lie in the areas of
image processing and computer visual tracking.
Fuxiang Wang received the B.S. degree in 1999 and the Ph.D. degree in 2007, all
from Beihang University, Beijing, China. He is currently a lecture with the School of
Electronics and Information Engineering, Beihang University, Beijing, China. His
current research interests lie in the areas of blind separation and their applications.