2 Editorial / Neurocomputing 187 (2016) 1–3
proposed method performs better than the previous best by
around 13% accuracy.
The article entitled “Face Detection using Representation
Learning” proposes a fast face detection algorithm based on
representation learnt using convolutional neural network (CNN)
so as to explicitly capture various latent facial features. Firstly, in
order to improve the speed of detection in the system, authors
train an Adaboost background filter which can remove the back-
ground most quickly. Secondly, they use the CNN to extract more
distinctive features for those face and non-face patterns that have
not been filtered by Adaboost. CNN can automatically learn and
synthesize a problem-specific feature extractor from a training set,
without making any assumptions or using any hand-made design
concerning the features to extract or the areas of the face pattern
to analyze. Finally, support vector machines (SVM) are used to
detect instead of using the classification function of CNN itself.
Extensive experiments demonstrate the robustness and efficiency
of the system by comparing it with several popular face detection
algorithms on the widely used CMU þMIT frontal face dataset and
FDDB dataset.
2.2. Deep learning for visual understanding
The article entitled “Deep learning for visual understanding: A
review” reviews the state-of-the-art in deep learning algorithms in
computer vision by highlighting the contributions and challenges
from over 220 recent research papers. It first gives an overview of
various deep learning approaches and their recent developments,
and then briefly describes their applications in diverse vision
tasks, such as image classification, object detection, image retrie-
val, semantic segmentation and human pose estimation. Finally,
the paper summarizes the future trends and challenges in
designing and training deep neural networks.
The article entitled “DeepFish: Accurate Underwater Live Fish
Recognition with a Deep Architecture” proposes a framework to
recognize fish from videos captured by underwater cameras
deployed in the ocean observation network. First, they extract the
foreground via sparse and lowrank matrix decomposition. Then, a
deep architecture is used to extract features of the foreground fish
images. In this architecture, principal component analysis (PCA) is
used in two convolutional layers, followed by binary hashing in
the non-linear layer and block-wise histograms in the feature
pooling layer. Then spatial pyramid pooling (SPP) is used to extract
information invariant to large poses. Finally, a linear SVM classifier
is used for the classification. This deep network model can be
trained efficiently. On a real-world fish recognition dataset, they
achieve the state-of-the-art accuracy of 98.64%.
The article entitled “HSAE: A Hessian Regularized Sparse Auto-
Encoders” incorporates both Hessian regularization and sparsity
constraints into auto-encoders and then proposes a new auto-
encoder algorithm called Hessian regularized sparse auto-
encoders (HSAE). The advantages of the proposed HSAE lie in
two folds: (1) it employs Hessian regularization to well preserve
local geometry for data points; (2) it also efficiently extracts the
hidden structure in the data by using sparsity constraints. Finally,
they stack the single-layer auto-encoders and form a deep archi-
tecture of HSAE. To evaluate the effectiveness, they construct
extensive experiments on the popular datasets including MNIST
and CIFAR-10 dataset and compare the proposed HSAE with the
basic auto-encoders, sparse auto-encoders, Laplacian auto-
encoders and Hessian auto-encoders. The experimental results
demonstrate that HSAE outperforms the related baseline
algorithms.
The article entitled “Event-based Large Scale Surveillance Video
Summarization” proposes a novel approach of large scale sur-
veillance video summarization on the basis of event detection. In
the proposed approach, they firstly obtain the trajectories of
vehicles and pedestrians in a tracking-by-detection manner, and
then detect the abnormal events using the trajectories. Finally,
they design a disjoint max-coverage algorithm to generate a
summarized sequence with maximum coverage of interested
events and minimum number of frames. Compared with tradi-
tional key frame-based approaches, the approach enjoys the fol-
lowing favorable features. First, important information can be
efficiently extracted from the redundant contents since the
approach is event-centric and those interested events contain
almost all the important information. Second, abnormal events are
successfully detected by combining the Random Forest classifier
and the trajectory features. Third, the abnormal events are
designed to display, and hence further reduces the compression
ratio. Due to the above features, the proposed approach is suitable
for different scenarios, ranges from highway to crowded crossings.
Experiments on 12 surveillance sequences validate the effective-
ness and efficiency of the proposed approach.
The article entitled “Hierarchical Feature Learning With Drop-
out K-Means for Hyperspectral Image Classification” proposed a
dropout k-means based framework to extract an effective hier-
archical spatial feature for HSI. This paper focuses on unsupervised
hierarchical feature learning representation. The proposed fra-
mework is tested on two HSIs. The extensive experimental results
clearly show that the proposed dropout k-means based framework
achieves a superior classification performance.
The article entitled “Large-scale Video Copy Retrieval with
Temporal-compress SIFT” robustly encodes the temporal infor-
mation by tracking the SIFT to generate temporal-compress SIFT
(TCSIFT), which highly compress the quantity of local features to
reduce visual redundancy, and keep the advantages of SIFT as
much as possible at the same time. On the basis of TCSIFT, a novel
framework for large-scale video copy retrieval is proposed, in
which the process of retrieval and validation are implemented at
feature and frame level. Experimental results on two different
datasets form CC_WEB_VIDEO and TRECVID demonstrate that the
method can yield comparable accuracy, compact storage size, and
more efficient execution time, and also adapt to various video
transformations.
2.3. Other related topics
The paper entitled “Research on Recommender System Based
on Ontology and Genetic Algorithm” designs an easily realizable
recommendation system framework based on relational data by
integrating the relational data in the domain ontology and
applying a genetic algorithm to process the recommendation.
Experimental results show that there are obvious improvements
in the methods for dealing with sparsity and cold start problems
as well as the accuracy and timeliness of recommendations.
The paper entitled “Optimal parameters based stochastic dot
model for tone compensation of dither matrix” proposes the
optimal parameters based stochastic dot model (OPSDM) and
applies it to the tone compensation of dither matrices. In the
proposed model, Munsell value is taken as intermediate value and
a conversion method for the printouts is established at first. Then,
no printer model of printout result is measured, and recurrent
parameters of model are modified to obtain the optimal para-
meters of the stochastic dot model of printer by calculating the
minimum Munsell value error between the measure result and
simulated result of model. Finally, the dither matrix thresholds are
modified to make the simulated result of every gray level with
dither matrix close to the given level. The results of experimental
indicate that the modified dither matrix with proposed model can
significantly restrain the influence of the nonlinear characteristics
of printer.
 Editorial / Neurocomputing 187 (2016) 1–3
The paper entitled “Dimensionality Reduction on Anchorgraph
with an Efficient Locality Preserving Projection” proposes an
improved dimensionality reduction algorithm called
Anchorgraph-based Locality Preserving Projection (AgLPP), trying
to cope with the limitations via a novel estimation of the rela-
tionship between data points. They extend AgLPP into a kernel
version, and reformulate it into a novel sparse representation. The
experiments on several real-world datasets have demonstrated
the effectiveness and efficiency of the methods.
The paper entitled “An enhanced the performance of M-ary
SVM algorithm for multi-category classification and its applica-
tion” proposes an enhanced M-ary SVM algorithm in combination
with error correction coding method. The main process of the
approach is to first generate a group of best codes based on
information codes derived from the original category flags infor-
mation. Second, utilize such codes as the basis for training the
classifier. Third, in the final feed-forward phase, the output codes
composed of each sub-classifier are corrected by error detection
and correction principle whenever there exists any identifying
error occurs. The improved algorithm not only maintains the
highly simplified architecture of the standard M-ary algorithm, but
also improves its generalization ability. The experimental results
confirms the effectiveness of the improved algorithm brought
about by introducing as few sub-classifiers as possible. Finally, an
application instance for shuttle kiln control system is given.
The paper entitled “Sentiment Analysis via Integrating Dis-
tributed Representations of Variable-length Word Sequence”
integrates distributed semantic features of word sequence, with
fixed-size independent of the length of the word sequence. they
also learn distributed semantic features of part-of-speech (POS)
3
sequence as additional syntax-related clues to sentiment analysis.
Their semantic features are able to capture both local contexts and
global contexts automatically without involving comprehensive
task-specific feature engineering. They validate the effectiveness of
the method on the constructed sentiment dataset. Experiment
results show that the method are able to improve the quality of
sentiment analysis when comparing with several competitive
baselines.
Jun Yu n
Key Laboratory of Complex Systems Modeling and Simulation, Min-
istry of Education, School of Computer Science and Technology,
Hangzhou Dianzi University, Hangzhou 310018, China
E-mail address: yujun@hdu.edu.cn
Dapeng Tao
School of Information Science and Engineering, Yunnan University,
China
Richang Hong
HeFei University of Technology, Hefei, China
Xinbo Gao
Xidian University, Xi'an, China
Received 16 October 2015; accepted 16 October 2015
Available online 17 November 2015
n
Corresponding author.