Search

Weeds that grow among crops are undesirable plants and have adversely affected crop growth and yield. Therefore, the study explores corn identification and positioning methods based on machine vision. The ultra-green feature algorithm and maximum between-class variance method (OTSU) were used to segment maize corn, weeds, and land; the segmentation effect was significant and can meet the following shape feature extraction requirements. Finally, the identification and positioning of corn were achieved by morphological reconstruction and pixel projection histogram method. The experiment reveals that when a weeding robot travels at a speed of 1.6 km/h, the recognition accuracy can reach 94.1%. The technique used in this study is accessible for normal cases and can make a good recognition effect; the accuracy and real-time requirements of robot recognition are improved and reduced the calculation time.

In complex industrial processes, the technique of fault diagnosis has been playing an increasingly considerable role in ensuring the safety of life and property. Unfortunately, the process data of complex industrial processes have the features of high dimension. Feature extraction from high-dimensional data is promising to coping with the fault data with high dimension. Recently, one of manifold learning methods named discriminant locality preserving projection achieves excellent performance in feature extraction. However, the performance of discriminant locality preserving projection (DLPP) is subject to the problem of matrix decomposition in the denominator of the objection function caused by the small sample size (SSS) issue. To overcome this limitation, novel DLPP integrated with Monte Carlo sampling is proposed to enhance the performance of feature extraction through dimensionality reduction. In the proposed MC-DLPP, Monte Carlo sampling is first utilized to generate fault samples for each fault type. With the aid of the virtually generated fault samples, the rank of the matrix in the denominator of the objection function of DLPP increases, thus well addressing the SSS problem. The Softmax classifier is used for fault diagnosis. To test the performance of the improved DLPP-based fault diagnosis, case studies using the Tennessee Eastman process are carried out. Simulation results confirm the presented MC-DLPP achieves superior accuracy in fault diagnosis.

Projection techniques are often used to visualize high-dimensional data, allowing users to better understand the overall structure of multi-dimensional spaces on a 2D screen. Although many such methods exist, comparably little work has been done on generalizable methods of inverse-projection -- the process of mapping the projected points, or more generally, the projection space back to the original high-dimensional space. In this paper we present NNInv, a deep learning technique with the ability to approximate the inverse of any projection or mapping. NNInv learns to reconstruct high-dimensional data from any arbitrary point on a 2D projection space, giving users the ability to interact with the learned high-dimensional representation in a visual analytics system. We provide an analysis of the parameter space of NNInv, and offer guidance in selecting these parameters. We extend validation of the effectiveness of NNInv through a series of quantitative and qualitative analyses. We then demonstrate the method's utility by applying it to three visualization tasks: interactive instance interpolation, classifier agreement, and gradient visualization.

Spike camera is a new type of bio-inspired vision sensor, each pixel of which perceives the brightness of the scene independently, and finally outputs 3-dimensional spatiotemporal spike streams. To bridge the spike camera and traditional frame-based vision, there is some works to reconstruct spike streams into regular images. However, the low spatial resolution (400×250) of the spike camera limits the quality of the reconstructed images. Thus, it is meaningful to explore a super-resolution reconstruction for spike streams. In this paper, we propose an end-to-end network to reconstruct high-resolution images from low-resolution spike streams. To utilize more spatiotemporal features of spike streams, our network adopts a multi-level features learning mechanism, including intra-stream feature extraction by spike encoder, inter-stream dependencies extraction based on optical flow module, and joint features learning via spike-based iterative projection. Experimental results demonstrate that our network is superior to the combination of state-of-the-art intensity image reconstruction methods and super-resolution networks on simulated and real datasets.

Spherical images or videos, as typical non-Euclidean data, are usually stored in the form of 2D panoramas obtained through an equirectangular projection, which is neither equal area nor conformal. The distortion caused by the projection limits the performance of vanilla Deep Neural Networks (DNNs) designed for traditional Euclidean data. In this paper, we design a novel Spherical Deep Neural Network (DNN) to deal with the distortion caused by the equirectangular projection. Specifically, we customize a set of components, including a spherical convolution, a spherical pooling, a spherical ConvLSTM cell and a spherical MSE loss, as the replacements of their counterparts in vanilla DNNs for spherical data. The core idea is to change the identical behavior of the conventional operations in vanilla DNNs across different feature patches so that they will be adjusted to the distortion caused by the variance of sampling rate among different feature patches. We demonstrate the effectiveness of our Spherical DNNs for saliency detection and gaze estimation in 360° videos. To facilitate the study of the 360 video saliency detection, we further construct a large-scale 360° video saliency detection dataset. Comprehensive experiments validate the effectiveness of our proposed Spherical DNNs for spherical handwritten digit classification and sport classification, saliency detection and gaze tracking in 360° videos.

Facing with rapidly increasing demands for analyzing high-order data or multiway data, feature-extracting methods become imperative for analysis and processing. The traditional feature-extracting methods, however, either need to overly vectorize the data and smash the original structure hidden in data, such as PCA and PCA-like methods, which is unfavorable to the data recovery, or cannot eliminate the redundant information very well, such as tucker decomposition (TD) and TD-like methods. To overcome these limitations, we propose a more flexible and more powerful tool, called the multiview principal components analysis (Multiview-PCA) in this article. By segmenting a random tensor into equal-sized subarrays called sections and maximizing variations caused by orthogonal projections of these sections, the Multiview-PCA finds principal components in a parsimonious and flexible way. In so doing, two new operations on tensors, the S -direction inner/outer product, are introduced to formulate tensor projection and recovery. With different segmentation ways characterized by section depth and direction, the Multiview-PCA can be implemented many times in different ways, which defines the sequential and global Multiview-PCA, respectively. These multiple Multiview-PCA take the PCA and PCA-like, and TD and TD-like as the special cases, which correspond to the deepest section depth and the shallowest section depth, respectively. We propose an adaptive depth and direction selection algorithm for the implementation of Multiview-PCA. The Multiview-PCA is then tested in terms of subspace recovery ability, compression ability, and feature extraction performance when applied to a set of artificial data, surveillance videos, and hyperspectral imaging data. All numerical results support the flexibility, effectiveness, and usefulness of Multiview-PCA.

During the last two decades, the decentralized execution of business processes has been one of the main research topics in Business Process Management. Several models (languages) for processes' specification in order to facilitate their distributed execution, have been proposed. LSAWfP is among the most recent in this area: it helps to specify administrative processes with grammatical models indicating, in addition to their fundamental elements, the permissions (reading, writing and execution) of each actor in relation to each of their tasks. In this paper, we present a model for a completely decentralized and artifact-centric execution of administrative processes specified using LSAWfP. The presented model puts particular emphasis on actors' views: it then allows the confidential execution of certain tasks by ensuring that, each actor potentially has only a partial perception of the processes' global execution states. The model thus solves a very important problem in business process execution, which is often sidelined in existing approaches. To accomplish this, the model rely on three projection algorithms allowing to partially replicate the processes' global execution states at a given moment, to consistently update the obtained partial states and to deduce new coherent global states. The proposal of these three algorithms, the proof of underlying mathematical tools' stability and a proposal of their implementation, are this paper's main contributions.

Cross-manifold clustering is a hard topic and many traditional clustering methods fail because of the cross-manifold structures. In this paper, we propose a Multiple Flat Projections Clustering (MFPC) to deal with cross-manifold clustering problems. In our MFPC, the given samples are projected into multiple subspaces to discover the global structures of the implicit manifolds. Thus, the cross-manifold clusters are distinguished from the various projections. Further, our MFPC is extended to nonlinear manifold clustering via kernel tricks to deal with more complex cross-manifold clustering. A series of non-convex matrix optimization problems in MFPC are solved by a proposed recursive algorithm. The synthetic tests show that our MFPC works on the cross-manifold structures well. Moreover, experimental results on the benchmark datasets show the excellent performance of our MFPC compared with some state-of-the-art clustering methods., Comment: 12 pages, 58 figures

We present an unsupervised multi-view partial least squares (PLS) by learning a common latent space from given multi-view data. Although PLS is a frequently used technique for analyzing relationships between two datasets, its extension to more than two views in unsupervised setting is seldom studied. In this paper, we fill up the gap, and our model bears similarity to the extension of canonical correlation analysis (CCA) to more than two sets of variables and is built on the findings from analyzing PLS, CCA and its variants. The resulting problem involves a set of orthogonality constraints on view-specific projection matrices, and is numerically challenging to existing methods that may have numerical instabilities and offers no orthogonality guarantee on view-specific projection matrices. To solve this problem, we propose a stable deflation algorithm that relies on proven numerical linear algebra techniques, can guarantee the orthogonality constraints, and simultaneously maximize the covariance in the common space. We further adapt our algorithm to efficiently handle large-scale high-dimensional data. Extensive experiments have been conducted to evaluate the algorithm through performing two learning tasks, cross-modal retrieval and multi-view feature extraction. The results demonstrate that the proposed algorithm outperforms the baselines and is scalable for large-scale high-dimensional datasets.

Over the last decade, many studies have adopted the data envelopment analysis (DEA)-type metafrontier framework to relax the constraint of technological heterogeneity. In conventional metafrontier analyses, either radial or nonradial DEA models are used in two separate DEA efficiency analyses. The results of a metafrontier analysis may be biased if this approach is adopted in a nonradial DEA model. One possible problem is that the value of the technology gap ratio is greater than one because the technology gaps to be estimated for decision-making units (DMUs) under different technology groups relative to the metatechnology have no connection between group frontiers and metafrontiers. Furthermore, the direction of projection of each DMU onto the metafrontier is totally independent of the direction to the efficiency frontier of the respective group frontier. Our proposed integration of group technology and metatechnology constraints into a union model offers a possible solution to the existing metafrontier problem and provides more robust metafrontier results regardless whether radial or nonradial DEA models are used. Four numerical examples and one empirical application are demonstrated, and the results appear to support the use of our proposed model.

Linear discriminant analysis (LDA) is a well-known technique for supervised dimensionality reduction and has been extensively applied in many real-world applications. LDA assumes that the samples are Gaussian distributed, and the local data distribution is consistent with the global distribution. However, real-world data seldom satisfy this assumption. To handle the data with complex distributions, some methods emphasize the local geometrical structure and perform discriminant analysis between neighbors. But the neighboring relationship tends to be affected by the noise in the input space. In this research, we propose a new supervised dimensionality reduction method, namely, locality adaptive discriminant analysis (LADA). In order to directly process the data with matrix representation, such as images, the 2-D LADA (2DLADA) is also developed. The proposed methods have the following salient properties: 1) they find the principle projection directions without imposing any assumption on the data distribution; 2) they explore the data relationship in the desired subspace, which contains less noise; and 3) they find the local data relationship automatically without the efforts for tuning parameters. The performance of dimensionality reduction shows the superiorities of the proposed methods over the state of the art.

Brown & Levinson opened their 1987 commentary on their theory of politeness by reemphasizing not only that their framework presumed “that Grice’s theory of conversational implicature and the framework of maxims that give rise to such implicatures is essentially correct” (p. 3), but also that their theory presupposed “the other great contribution by Grice, namely his account of the nature of communication as a special kind of intention designed to be recognized by the recipient” (p. 7; cf. Levinson 1983: 16-18; 1995: 227-232). Brown & Levinson also closed their 1987 commentary with a projection for future development of their theory

The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link. This paper proposes an adaptive localized decision variable analysis approach under the decomposition-based framework to solve the large scale multi-objective and many objective optimization problems. Its main idea is to incorporate the guidance of reference vectors into the control variable analysis and optimize the decision variables using an adaptive strategy. Especially, in the control variable analysis, for each search direction, the convergence relevance degree of each decision variable is measured by a projection-based detection method. In the decision variable optimization, the grouped decision variables are optimized with an adaptive scalarization strategy, which is able to adaptively balance the convergence and diversity of the solutions in the objective space. The proposed algorithm is evaluated with a suite of test problems with 2-10 objectives and 200-1000 variables. Experimental results validate the effectiveness and efficiency of the proposed algorithm on the large scale multiobjective and many-objective optimization problems.

In this article, a continuous-time complex-valued projection neural network (CCPNN) in a matrix state space is first proposed for a general complex-variable basis pursuit problem. The proposed CCPNN is proved to be stable in the sense of Lyapunov and to be globally convergent to the optimal solution under the condition that the sensing matrix is not row full rank. Furthermore, an improved discrete-time complex projection neural network (IDCPNN) is proposed by discretizing the CCPNN model. The proposed IDCPNN consists of a two-step stop strategy to reduce the calculational cost. The proposed IDCPNN is theoretically guaranteed to be global convergent to the optimal solution. Finally, the proposed IDCPNN is applied to the reconstruction of sparse signals based on compressed sensing. Computed results show that the proposed IDCPNN is superior to related complex-valued neural networks and conventional basis pursuit algorithms in terms of solution quality and computation time.

Most of the existing blind omnidirectional image quality assessment (BOIQA) methods are based on data-driven approach where the end-to-end neural network or deep learning tools are mainly used for feature extraction. However, it usually lacks interpretability and is difficult to discover the perceptual mechanism behind. In this paper, from the perspective of perception modeling, we propose a novel multi-angle projection based BOIQA (MP-BOIQA) method. Considering the omnibearing and near eye display characteristics with head mounted display, multiple color cubemap projection images with respect to different viewpoints are grouped as the color omnidirectional distortion (COD) units so as to simulate the user’s viewing behavior in subjective quality assessment. In the designed multi-angle projection based feature extractor, tensor decomposition is implemented on each COD unit for dimensionality reduction, and piecewise exponential fitting is used to get the distribution of mean subtracted contrast normalized coefficients of the unit’s feature matrices in tensor domain. Finally, the extracted features are pooled with random forest. The experimental results on three omnidirectional image quality datasets show that the MP-BOIQA method can deliver highly competitive performance compared with some representative full-reference quality assessment methods, as well as some state-of-the-art BOIQA methods.

In daily pipeline inspection, it is significant to ensure good network communication and security. With the development of drone technology, it is possible to apply drones as air routers to collect information from pipeline networks and transmit it to pipeline inspectors. It is also crucial to achieve optimal drone deployment in pipeline networks. This article proposes a two-phase evolution optimal 3-D drone layout algorithm to deploy drones in pipeline networks. First, a 3-D pipeline graph model is designed to represent the possible projection position of drones, and the objective function is proposed for optimal drone deployment. Then, in the first phase, based on the features of the 3-D pipeline graph, the drone flight rules and constraint conditions are presented to calculate the number of drones and the initial layout sequence. In the second phase, according to the objective function and the above results, every drone is continuously moved in a small area to achieve a tradeoff between signal coverage and interference. Moreover, the key parameters of the objective function can be discussed to further optimize drone deployment. Simulation results are presented to illustrate the effectiveness and advantages of the proposed algorithm.

A major drawback of nonlinear dimensionality reduction (DR) techniques is their inability to preserve some authentic information from the source domain, leading to projections that are often hard to interpret when it comes to observing anything other than the topological structure of the data. In this paper, we propose a nonlinear DR approach enforcing projection constraints resulting from an a priori knowledge about the structure of the data in multivariate periodical time series. We then propose several ways of exploiting this constrained projection to extract user-relevant information, such as the nominal behavior of a periodical dynamical system or the deviant behaviors which may occur at different time scales. The techniques are demonstrated on both a synthetic dataset composed of simulated multivariate data exhibiting a periodical behavior, and a real dataset corresponding to six months of sensor data acquisitions and recordings inside experimental buildings. 1 We would like to thank the Institut National de l'Energie Solaire (INES) and the CEA, LITEN, Laboratoire Energetique du Bâtiment for providing the data.

This article presents a framework for real-time analysis and visualization of ballet dance movements performed within a Cave Virtual Reality Environment (CAVE). A Kinect sensor captures and extracts dance-based movement features, from which a topology preserved "posture space" is constructed using a spherical self-organizing map (SSOM). Recordings of dance movements are parsed into gestural elements by projection onto the SSOM to form unique trajectories in posture space. Dependencies between postures in a trajectory are modeled using a Markovian empirical transition matrix, which is then used to recognize attempted movements. This allows for quantitative assessment and feedback of a student's performance, delivered using concurrent, localized visualizations together with a performance score based on incremental dynamic time warping (IDTW).

IoT devices typically stream data such as sensor values to other devices including cloud-based services. Analyzing these streams for Cyber-attacks is a challenging task. This is due to the infinite nature of stream-based datatypes. Analyzing streams can require additional real-time processing and computational performance capabilities. In this paper, we focus on how concept drifts affect Botnet cyber-attack detection in IoT scenarios. To reveal the result, we incorporate the concept drift analysis to detect cyber-attacks on the Bot-IoT dataset, which consists of legitimate and simulated IoT network traffics, together with various types of attacks. We designed sub-datasets of the Bot-IoT to ensure the concept drift occurs that eventually complete the experiments. The detection accuracies improved 15% to 26% compared with the classification models without concept drift analysis. We also gain superior performance results by comparing confusion matrices when concept drift analysis is ongoing. We propose a technique featuring a dynamic sliding window based on the residual projection to perform concept drift analysis. During the process of finding concepts in data streams, the sample number is updated dynamically by comparing the anomalous quantity obtained by the residual projection method in the current window to the previous one. In addition to the Bot-IoT dataset, our method is also applied to two popular synthetic datasets SEA Concept and UG-2C-5D. The results demonstrate the effectiveness of our method with respect to the false alarm rate, misses, and average delay.

Current reconstruction of 3D images from DICOM (Digital Imaging and Communications in Medicine) files requires strict supervision for the reconstructed images to have the same metadata including slice thickness, spacing between slices, and image resolution. We propose an algorithm for reconstructing 3D images based on medical images in the DICOM format with varied metadata and resizing the 3D images while preserving the annotations. The 3D image resizing may facilitate processing because most current systems cannot handle the huge 3D image data sizes. After resizing the 3D images, the original annotations that can be used as ground truths to train and evaluate machine learning method are preserved by projection. Experimental results show that the proposed method can handle various DICOM files and correctly project annotations onto the resized image.

Stereoscopic omnidirectional content, as a novel visual media, has drawn wide attention in recent years due to its ability in providing strong immersive experience. Since Stereoscopic Omnidirectional Images (SOIs) involve the properties from panoramic and stereoscopic visual perception, it is very challenging to establish an efficient and effective visual quality evaluation model for SOIs. To better measure the user’s experience in virtual reality, we put forward a novel deep learning framework to assess the quality of SOIs in this paper. Firstly, the deformable convolutions instead of standard convolutions are adopted to ensure the invariant receptive fields of convolutional kernels on Equi-Rectangular Projection (ERP). Secondly, according to the stereoscopic property, we use binocular-difference information and a coarse-to-fine mechanism to construct the binocular feature extraction network. Thirdly, a three-channel network involving left-view, right-view and binocular-difference channels is presented to simulate the process of monocular and binocular interactions, in which independent quality labels are provided for each channel to reflect the individual effect of monocular and binocular visions on the whole visual quality. Finally, experimental results on two available benchmark databases demonstrate the superiority of the proposed metric over the state-of-the-art blind quality assessment models in predicting the quality of SOIs. Moreover, our model is efficient in computational cost as the feature extraction is directly applied on ERP images.

Full projector compensation aims to modify a projector input image to compensate for both geometric and photometric disturbance of the projection surface. Traditional methods usually solve the two parts separately and may suffer from suboptimal solutions. In this paper, we propose the first end-to-end differentiable solution, named CompenNeSt++, to solve the two problems jointly. First, we propose a novel geometric correction subnet, named WarpingNet, which is designed with a cascaded coarse-to-fine structure to learn the sampling grid directly from sampling images. Second, we propose a novel photometric compensation subnet, named CompenNeSt, which is designed with a siamese architecture to capture the photometric interactions between the projection surface and the projected images, and to use such information to compensate the geometrically corrected images. By concatenating WarpingNet with CompenNeSt, CompenNeSt++ accomplishes full projector compensation and is end-to-end trainable. Third, to improve practicability, we propose a novel synthetic data-based pre-training strategy to significantly reduce the number of training images and training time. Moreover, we construct the first setup-independent full compensation benchmark to facilitate future studies. In thorough experiments, our method shows clear advantages over prior art with promising compensation quality and meanwhile being practically convenient., Source code: https://github.com/BingyaoHuang/CompenNeSt-plusplus. arXiv admin note: text overlap with arXiv:1908.06246, arXiv:1904.04335

Since projection-based 3D bioprinting (PBP) could provide high resolution, it is well suited for printing delicate structures for tissue regeneration. However, the low crosslinking density and low photo-crosslinking rate of photocurable bioink make it difficult to print fine structures. Currently, an in-depth understanding of the is lacking. Here, a research framework is established for the analysis of printability during PBP. The gelatin methacryloyl (GelMA)-based bioink is used as an example, and the printability is systematically investigated. We analyze the photo-crosslinking reactions during the PBP process and summarize the specific requirements of bioinks for PBP. Two standard quantized models are established to evaluate 2D and 3D printing errors. Finally, the better strategies for bioprinting five typical structures, including solid organs, vascular structures, nerve conduits, thin-wall scaffolds, and micro needles, are presented., Graphical abstract Image 1, Highlights • The photo-crosslinking mechanism and operation specifications is systematically explored during PBP. • The mechanism of printing errors are analyzed, and a guide is provided to decrease the printing errors theoretically. • Two standard models are proposed for evaluating the printing errors. • Five typical applications are summarized and the suggestion printing strategies are formulated to improve the print quality.

Approximate Nearest Neighbor(ANN) search is the core problem in many large-scale machine learning and computer vision applications such as multimodal retrieval. Hashing is becoming increasingly popular, since it can provide efficient similarity search and compact data representations suitable for handling such large-scale ANN search problems. Most hashing algorithms concentrate on learning more effective projection functions. However, the accuracy loss in the quantization step has been ignored and barely studied. In this paper, we analyse the importance of various projected dimensions, distribute them into several groups and quantize them with two types of values which can both better preserve the neighborhood structure among data. One is Variable Integer-based Quantization (VIQ) that quantizes each projected dimension with integer values. The other is Variable Codebook-based Quantization (VCQ) that quantizes each projected dimension with corresponding codebook values. We conduct experiments on five common public data sets containing up to one million vectors. The results show that the proposed VCQ and VIQ algorithms can both achieve much higher accuracy than state-of-the-art quantization methods. Furthermore, although VCQ performs better than VIQ, ANN search with VIQ provides much higher search efficiency.

Objective Involuntary subject motion is the main source of artifacts in weight-bearing cone-beam CT of the knee. To achieve image quality for clinical diagnosis, the motion needs to be compensated. We propose to use inertial measurement units (IMUs) attached to the leg for motion estimation. Methods We perform a simulation study using real motion recorded with an optical tracking system. Three IMU-based correction approaches are evaluated, namely rigid motion correction, non-rigid 2D projection deformation and non-rigid 3D dynamic reconstruction. We present an initialization process based on the system geometry. With an IMU noise simulation, we investigate the applicability of the proposed methods in real applications. Results All proposed IMU-based approaches correct motion at least as good as a state-of-the-art marker-based approach. The structural similarity index and the root mean squared error between motion-free and motion corrected volumes are improved by 24-35% and 78-85%, respectively, compared with the uncorrected case. The noise analysis shows that the noise levels of commercially available IMUs need to be improved by a factor of 105 which is currently only achieved by specialized hardware not robust enough for the application. Conclusion Our simulation study confirms the feasibility of this novel approach and defines improvements necessary for a real application. Significance The presented work lays the foundation for IMU-based motion compensation in cone-beam CT of the knee and creates valuable insights for future developments.

Introduction The current technique of angulating for a skyline knee projection relies heavily on the radiographer's estimation of the patella tilt, rendering it subjective and prone to errors. This study therefore aims to (i) examine the correlation between angle ABC measured on the lateral X-ray image and skyline angulation (measured in degrees) and (ii) determine the inter-rater reliability of angle ABC measurements. Methods 145 sets of lateral and skyline X-ray images from patients aged 40–70 years old were retrospectively analysed. Angle ABC was measured using prominent landmarks such as the trochlear sulcus, tibial tuberosity and the anterior border of the patella on the lateral knee radiograph. It was then retrospectively compared with the skyline tube angulations to identify any correlation between the two. An inter-rater reliability test was also conducted using the intraclass correlation coefficient (ICC) to determine the reproducibility of the measurement method. Results A weak correlation was found between angle ABC and skyline angulation (r = 0.1, p = 0.25). The proposed method of measurement shows good inter-rater reliability (ICC = 0.81, 95% CI: 0.77 to 0.84). Conclusion There is insufficient evidence to indicate a correlation between angle ABC and skyline angulation. However, angle ABC can be reliably measured, implying the replicability of the measurement method for other purposes. Implications for practice The proposed measurement method of angle ABC on the lateral view could have future applications in other areas such as in the measurement of patellofemoral alignment and trochlear morphology.

The ultra-high-definition 16K Virtual Reality (VR) video is coming to ages with more ”real” virtual experience and less cybersickness. However, the huge bitrate and decoding overhead would overwhelm today’s network and mobile hardware. The widely-known Field-of-View (FoV) adaptation streaming method still has severe bitrate wastes and decoding overhead as it delivers FoV areas with grid-like static tiles. Inspired by this, we present a novel ShiftTile-traCking (STC) streaming scheme, which crops and delivers tiles by tracking FoV movement. It is equivalent to deliver an FoV planar video instead of VR videos. This would save huge bit-rate and reduce decoding complexity. We mainly entail three contributions. 1) To reduce projection distortions, a novel FoV-centric sphere projection is proposed, which projects VR videos with the center of users’ FoVs. 2) To cover diverse FoV movement trajectories with a limited number of tiles, we propose an optimal tiling algorithm by trajectory clustering. 3) To be resilient to FoV prediction errors, we propose an accuracy-sensitive streaming algorithm, which scales FoV areas by the prediction accuracy. The evaluation shows that under the same network conditions, STC improves up to 1.3dB V-PSNR, reduces up to 13.2% buffering ratio, and achieves 60% faster decoding speed (61.5 frames per second) compared with state-of-the-art solutions.

In the present work, a novel algorithm for the continuous projection of point triangles belonging to a triangle mesh is presented. The algorithm uses the normals defined at the vertices of the triangle to perform the projection. The direction of projection is not chosen a priori but depends on the point to be projected: the proposed algorithm, named Fast Continuous Projection method (FCP) lets the projection direction vary continuously on the mesh. Moreover, the direction is coherent with the original surface that is approximated with the triangle mesh. An optimized version of the algorithm is also presented: this uses pre-evaluated matrices to reduce the calculation time. This algorithm can be effectively used when a large set of points has to be projected on a coarse mesh as, for example, to generate the scanning vectors for laser engraving/milling.

Graphics processing units (GPUs) have been a popular choice for the acceleration of iterative tomographic reconstruction algorithms. In this work, two dual-GPU approaches to iterative list-mode reconstruction of PET data are studied. The developed techniques split the image into equal-size cubes and distribute them between the GPUs. Benefiting from caching a plane of the image into the fast shared memory, line-driven forward and back projection kernels are implemented incorporating a shift-invariant point spread function (PSF). In the first approach, lines were individually convolved with the PSF kernel whereas the second approach convolves the reconstructed image with the PSF before the forward projection and after the back projection. The algorithms were implemented using two CUDA-compatible devices with no CPU/GPU data transfer during the reconstruction process. List-mode data obtained from Monte Carlo simulations were used to evaluate the methods. One complete iteration of 107 events on an image of 220 × 220 × 110 voxels is done in less than 510 ms for a non-PSF reconstruction and in 520 to 5220 ms for a PSF reconstruction depending on the PSF and the reconstruction parameters. Dual-GPU memory layout, implementation details, sample images, and performance metrics of the developed algorithms are discussed.

Locality-preserving projection (LPP) has been widely used in feature extraction. However, LPP does not use data category information and uses the 2 L -norm for distance measurement, which is highly sensitive to outliers. In this paper, we consider the LPP weight matrix from a supervised perspective and combine the low-rank regression method to propose a new model to discover and extract features. By using the L2,1-norm to constrain the loss function and the regression matrix, not only is the sensitivity to outliers reduced but the low-rank condition of the regression matrix is also restricted. Then, we propose a solution to the optimization problem. Finally, we apply the method to a series of face databases, handwriting digital datasets and palmprint datasets to test the performance, and the experimental results show that this method is effective compared with some existing methods.

This paper investigates the formation control issue of clustered vertical takeoff and landing (VTOL) unmanned airborne vehicles (UAVs) subject to undesired perturbations composed by actuator faults, parametric uncertainties and external disturbances. In particular, a cluster of VTOL UAVs fly together in a given velocity with a well-specified formation configuration. For this purpose, an adaptive fault-tolerant distributed control algorithm via local information interaction is proposed under a hierarchical framework. Specifically, a distributed command force resorting to projection-based adaptation is first synthesized in the outer position loop. Such a command force is of a saturation attribute in order that a bounded desired thrust and a non-singular command attitude can be extracted in terms of appropriate control parameters. Next, in the inner attitude loop, a desired torque also with the help of projection-based adaptation is synthesized. Given that the underlying undirected topology is connected, it is shown based on Lyapunov theory that, the proposed adaptive fault-tolerant distributed control algorithm ensures the accomplishment of the concerned formation control objective of the clustered VTOL UAVs in spite of the undesired perturbations. Simulations validate and further highlight the effectiveness of the proposed distributed control algorithm.

Tomographic coherent imaging requires the reconstruction of a series of two-dimensional projections of the object. We show that using the solution for the image of one projection as the starting point for the reconstruction of the next projection offers a reliable and rapid approach to the image reconstruction. The method is demonstrated on simulated and experimental data. This technique also simplifies reconstructions using data with curved incident wavefronts.

A new projection neural network approach is presented for the linear and convex quadratic second-order cone programming. In the method, the optimal conditions of the linear and convex second-order cone programming are equivalent to the cone projection equations. A Lyapunov function is given based on the G-norm distance function. Based on the cone projection function, the descent direction of Lyapunov function is used to design the new projection neural network. For the proposed neural network, we give the Lyapunov stability analysis and prove the global convergence. Finally, some numerical examples and two kinds of grasping force optimization problems are used to test the efficiency of the proposed neural network. The simulation results show that the proposed neural network is efficient for solving some linear and convex quadratic second-order cone programming problems. Especially, the proposed neural network can overcome the oscillating trajectory of the exist projection neural network for some linear second-order cone programming examples and the min-max grasping force optimization problem.

Tile-based rate adaption can improve the quality of experience (QoE) for adaptive 360-degree video streaming under constrained network conditions, which, however, is a challenging problem due to the requirements of accurate prediction for users’ viewports and optimal bitrate allocation for tiles. In this paper, we propose a strategy that deploys reinforcement learning-based Rate Adaptation with adaptive Prediction and Tiling for 360-degree video streaming, named RAPT360, to address these challenges. Specifically, to improve the accuracy of the state-of-the-art viewport prediction approaches, we fit the time-varying Laplace distribution-based probability density function of the prediction error for different prediction lengths. On the basis of that, we develop a viewport identification method to determine the viewport area of a user depending on the buffer occupancy, where the obtained viewport can cover the real viewport with any given probability confidence level. We then propose a viewport-aware adaptive tiling scheme to improve the bandwidth efficiency, where three types of tile granularities are allocated according to the shape and position of the 2-D projection of that viewport. By establishing an adaptive streaming model and QoE metric specific to 360-degree videos, we finally formulate the rate adaptation problem for tile-based 360-degree video streaming as a non-linear discrete optimization problem that targets at maximizing the long-term user QoE under a bandwidth-constrained network. To efficiently solve this problem, we model the rate adaptation logic as a Markov decision process (MDP) and employ the deep reinforcement learning (DRL)-based algorithm to dynamically learn the optimal bitrate allocation of tiles. Extensive experimental results show that RAPT360 achieves a performance gain of at least 1.47 dB on average chunk QoE, including a video quality improvement of at least 1.33 dB, in comparison to the existing strategies for tile-based adaptive 360-degree video streaming.

This paper studies a class of distributed attack strategies against state estimation of wireless sensor networks. The attack objective is to corrupt the least numbers of sensors so that the state estimate error approaches to a target bias while avoiding being detected and a high attacking lost. First, with precise knowledge of measurement model and applying a sparsity projection operation with average linear complexity rather than the popular brute force search and approximation techniques, a distributed optimization scheme is proposed which provides to an exact and low-complexity algorithmic solution to finding the optimal attack strategy. Furthermore, by introducing dead-zone type projection and region projection operators, a distributed optimization algorithm for robust sparse undetectable attacks is proposed with imprecise model knowledge. A distinguishing point of the proposed algorithms is that a trade-off between computational complexity and attacks impact can be achieved by properly designing a cost function. Simulation results on an unmanned ground vehicle are presented to substantiate the algorithm.

In many computer vision applications, an object can be represented by multiple different views. Due to the heterogeneous gap triggered by the different views' inconsistent distributions, it is challenging to exploit these multiview data for cross-view retrieval and classification. Motivated by the fact that both labeled and unlabeled data can enhance the relations among different views, this article proposes a deep cross-view learning framework called deep semisupervised classes- and correlation-collapsed cross-view learning (DSC³L) for cross-view retrieval and classification. Different from the existing methods which focus on the two-view problems, the proposed method learns U (generally U≥2) view-specific deep transformations to gradually project U different views into a shared space in which the projection embraces the supervised learning and the unsupervised learning. We propose collapsing the instances of the same class from all views into the same point, with the instances of different classes into distinct points simultaneously. Second, to exploit the abundant unlabeled U-wise multiview data, we propose to collapse-correlated data into the same point, with the uncorrelated data into distinct points. Specifically, these two processes are formulated to minimize the two Kullback-Leibler (KL) divergences between the conditional distribution and a desirable one, for each instance. Finally, the two KL divergences are integrated into a joint optimization to learn a discriminative shared space. The experimental results on five widely used public datasets demonstrate the effectiveness of the proposed method.

We develop a dual-control method for approximating investment strategies in multidimensional financial markets with convex trading constraints. The method relies on a projection of the optimal solution to an (unconstrained) auxiliary problem to obtain a feasible and near-optimal solution to the original problem. We obtain lower and upper bounds on the optimal value function using convex duality methods. The gap between the bounds indicates the precision of the near-optimal solution. We illustrate the effectiveness of our method in a market with different trading constraints such as borrowing, short-sale constraints and non-traded assets. We also show that our method works well for state-dependent utility functions.

In this paper, a novel projection neurodynamic network with fixed-time convergence is proposed for solving absolute value equations. In contrast to most existing projection neurodynamic networks, a conservative convergence time of the proposed projection neurodynamic network is presented. It is shown that the solution of the proposed approach converges to the solution of the corresponding absolute value equation in fixed-time under some mild conditions. Finally, a numerical example is presented to validate the main results.

Stationarity is fundamental for time-series modeling and prediction. In this article, we focus on the radial basis function network-based autoregressive (RBF-AR) models which have been widely used in practical applications. Compared to previous work, we give a less-restrictive sufficient condition for the asymptotic stationarity of the RBF-AR model. The parameter estimation of the RBF-AR model is converted to the optimization of a variable projection functional with constraints of stationarity to always derive a stationary model. The constrained evolutionary algorithm is used to solve the optimization problem. Numerical results demonstrate the effectiveness of the proposed method.

The control of kinematically redundant robots is often approached using nullspace projection, which requires precise models and can be computationally challenging. Humans have many more degrees of freedom than are required to accomplish their tasks, but given neuromechanical limitations, it seems unlikely that biology relies on precise models or complex computation. An alternative biologically-inspired approach leverages the compositionality of mechanical impedance. In theory, nullspace projection eliminates any conflict between two tasks. In contrast, superposition of task-space impedance and a full-rank joint-space impedance may impose a task conflict. This work compared nullspace projection with impedance superposition during unconstrained motion and forceful physical interaction. In practice, despite their theoretical differences, we did not observe a substantial influence of the nullspace projector weighting matrix. We found that nullspace projection and impedance superposition both resulted in measurable task conflict. Remarkably, when the dimensionality of the nullspace was increased, impedance superposition was comparable to nullspace projection.

In this paper, a novel data-driven method for weight initialization of Multilayer Perceptrons and Convolutional Neural Networks based on discriminant learning is proposed. The approach relaxes some of the limitations of competing data-driven methods, including unimodality assumptions, limitations on the architectures related to limited maximal dimensionalities of the corresponding projection spaces, as well as limitations related to high computational requirements due to the need of eigendecomposition on high-dimensional data. We also consider assumptions of the method on the data and propose a way to account for them in a form of a new normalization layer. The experiments on three large-scale image datasets show improved accuracy of the trained models compared to competing random-based and data-driven weight initialization methods, as well as better convergence properties in certain cases. publishedVersion

Multi-view clustering has attracted much attention recently. Among all clustering approaches, spectral ones have gained much popularity thanks to an elaborated and solid theoretical foundation. A major limitation of spectral clustering based methods is that these methods only provide a non-linear projection of the data, to which an additional step of clustering is required. This can degrade the quality of the final clustering due to various factors such as the initialization process or outliers. To overcome these challenges, this paper presents a constrained version of a recent method called Multiview Spectral Clustering via integrating Nonnegative Embedding and Spectral Embedding. Besides retaining the advantages of this method, our proposed model integrates two types of constraints: (i) a consistent smoothness of the nonnegative embedding over all views and (ii) an orthogonality constraint over the columns of the nonnegative embedding. Experimental results on several real datasets show the superiority of the proposed approach.

Population projections rely on one-sex renewal models. Consequently, changing the projection of male mortality does not affect the projection of birth, contradicting commonsense. A two-sex renewal model is presented in this paper to provide a better description of reproduction and more reasonable population projections. This model is nonlinear and includes the one-sex renewal models as special cases. In this model, age-specific birth rates are defined for two sexes jointly; total fertility, net reproduction rate, and intrinsic growth rate are also derived for two sexes jointly; and age-specific populations approach or converge to stable status. Applying the two-sex renewal model to Australia, it indicates that one-sex models underestimated the intrinsic growth rate by 14 percent. Compared to the results of one-sex models, the two-sex model would provide higher growth rate for low-fertility countries, and lower growth rate for high-fertility countries. In other words, the one-sex models are commonly biased. If the two-sex model is applied to all the countries, it would project smaller populations for the world in the future.

In video-based dynamic point cloud compression (V-PCC), 3D point clouds are projected into patches, and then the patches are padded into 2D images suitable for the video compression framework. However, the patch projection-based method produces a large number of empty pixels; the far and near components are projected to generate different 2D images (video frames), respectively. As a result, the generated video is with high resolutions and double frame rates, so the V-PCC has huge computational complexity. This paper proposes an occupancy map guided fast V-PCC method. Firstly, the relationship between the prediction coding and block complexity is studied based on a local linear image gradient model. Secondly, according to the V-PCC strategies of patch projection and block generation, we investigate the differences of rate-distortion characteristics between different types of blocks, and the temporal correlations between the far and near layers. Finally, by taking advantage of the fact that occupancy maps can explicitly indicate the block types, we propose an occupancy map guided fast coding method, in which coding is performed on the different types of blocks. Experiments have tested typical dynamic point clouds, and shown that the proposed method achieves an average 43.66% time-saving at the cost of only 0.27% and 0.16% Bjontegaard Delta (BD) rate increment under the geometry Point-to-Point (D1) error and attribute Luma Peak-Signal-Noise-Ratio (PSNR), respectively.

Classical efficiency studies on data envelopment analysis (DEA) consider all its inputs and outputs are desirable factors and real valued-data. Additionally, the DEA models only focus either on input-oriented projection minimizing inputs for an inefficient decision making unit (DMU) while keeping outputs at their maximum level, or output-oriented projection maximizing outputs under the present level of input consumption. To simultaneously deal with input excesses and output shortfalls maximizing both projections, this paper proposes a bi-objective DEA model in the context of undesirable factors and mixed integer requirements. These factors and requirements were integrated into the objective function and constraints of the existing bi-objective models. In addition, the proposed model estimates the returns to scale of DMUs that depends on the projections of input reduction and output augmentation. The applicability and usefulness of the proposed model were tested using the dataset of 39 Spanish airports retrieved from the literature. Besides, the proposed model was compared with the three existing bi-objective DEA models in the literature to test its validity.

Compressed sensing (CS) aims to reconstruct a high quality images with as little sample data as possible. Magnetic resonance imaging (MRI) plays an important role in medical imaging tools but has a slower data acquisition process. Applying CS to MRI offers significant scan time reductions. In this paper, we proposed a fast and efficient algorithm for compressed sensing magnetic resonance imaging (CS-MRI) reconstruction, denoted as adjustable shrinkage-thresholding projection algorithm (ASTP). It is designed to use adjustable shrinkage rules for lp-norm based CS-MRI model. This algorithm is established by using an iterative projection and acceleration scheme. In each iteration, the proposed adjustable shrinkage-thresholding rules are employed to ensure global convergence to accurate solution. Furthermore, the parameter p can be selected flexibly according to different practical application situations, and the orthogonal projection operation is used to reduce the dimension of the solution space to accelerate the convergence speed and improve the reconstruction quality. Numerical experiments show that proposed ASTP algorithm provides a higher accuracy, convergence speed and ability to suppress noise compared with some certain state-of-the-art algorithms.

Characters segmentation is a necessity and the most critical stage in Arabic OCR system. It has attracted the interest of a wide range of researchers. However, the nature of the Arabic cursive script poses extra challenges that need further investigation. Therefore, having a reliable and efficient Arabic OCR system that is independent of font variations is highly required. In this paper, an indirect, font-in dependent word and character segmentation algorithm for printed Arabic text investigated. The proposed algorithm takes a binary line image as an input and produces a set of binary images consisting of one character or ligature as an output. The segmentation performed at two levels: a word segmentation performed in the first level, by employing a vertical projection at the input line image along with using Interquartile Range (IQR) method to differentiate between word gaps and within word gaps. A projection profile method used as a second level of segmentation along with a set of statistical and topological features, which are font-independent, to identify the correct segmentation points from all potential points. The APTI dataset used to test the proposed algorithm with a variety of font type, size, and style. The algorithm experimented on 1800 lines (approximately 24,816 words) with an average accuracy of 97.7% for words segmentation and 97.51% for characters segmentation.

Unlike geocoded images, slant-range (SR) synthetic aperture radar (SAR) images vary from imaging resolution to angles, which are difficult to be registered directly using the traditional SAR image registration methods. A possible way is to match their corresponding geocoded images and to project the correspondences to SR images. However, this way is time consuming and suffers from both registration and projection errors. In this letter, an automatic and efficient method is proposed to directly match multiview SR SAR images. We first estimate the scale and rotation differences between two SR images from the metadata delivered by vendors alongside the image file. Specifically, the scale differences of the range and azimuth directions are estimated by transforming the range and azimuth pixel intervals into a uniform geographical resolution, and the rotation differences are estimated by comparing the azimuth angles of an image-pair. A global-to-local framework is then implemented to accelerate the registration process. In the global stage, we fix the scale and rotation parameters in SAR-scale-invariant-feature-transform (SAR-SIFT) method to avoid mismatches. In the local stage, the phase correlation of cropped patches is parallelized to generate accurate matches. Experimental results on 13 multiview SAR images of the Omaha city show that the proposed method can provide accurate and efficient registration results for each pair of the 13 images, and outperforms the state-of-the-art methods both in accuracy and in efficiency.