Business districts serve as basic structures for understanding the organization of real-world economic network. Discovering these business districts in cities establish new types of valuable applications that can bene...
详细信息
ISBN:
(纸本)9781538674499
Business districts serve as basic structures for understanding the organization of real-world economic network. Discovering these business districts in cities establish new types of valuable applications that can benefit end users: Business investors can better identify the proximity of existing business districts and hence, can contribute a better future planning for investing. In this paper, we propose improved affinity propagation clustering for business districts mining. Given check-in data, whose geography information represents business venues' location, we introduce a affinity propagation clustering algorithm(AP), a basic solution, to cluster venues. This strategy requires that real-valued messages are exchanged among business venues until a set of centers and corresponding business districts gradually emerges. However, the computational complexity of AP is affected by the scale of input. And it's not adaptive for random distribution of venues when mining business districts. To conduct business districts mining efficiently, we introduce a pruning method, termed as PAP. And then present merging based mine approach, termed as MAP. We conduct experiments from Yelp data, and experimental results show that our proposed method outperforms the basic solutions and resolves the problem well.
A fast algorithm is derived for the compressive bilateral filter (CBF) by representing the bilateral filter in a new way. This representation allows us to use the property of the Gaussian function to reduce the number...
详细信息
A fast algorithm is derived for the compressive bilateral filter (CBF) by representing the bilateral filter in a new way. This representation allows us to use the property of the Gaussian function to reduce the number of Gaussian filters required by the CBF by a factor of 2. Producing the same results as that of the CBF, the fast algorithm runs about two times faster than the CBF.
Generalized inversion is one of the important steps in the quantitative interpretation of gravity data. With appropriate algorithm and parameters, it gives a view of the subsurface which characterizes different geolog...
详细信息
Generalized inversion is one of the important steps in the quantitative interpretation of gravity data. With appropriate algorithm and parameters, it gives a view of the subsurface which characterizes different geological bodies. However, generalized inversion of gravity data is time consuming due to the large amount of data points and model cells adopted. Incorporating of various prior information as constraints deteriorates the above situation. In the work discussed in this paper, a method for fast nonlinear generalized inversion of gravity data is proposed. The fast multipole method is employed for forward modelling. The inversion objective function is established with weighted data misfit function along with model objective function. The total objective function is solved by a dataspace algorithm. Moreover, depth weighing factor is used to improve depth resolution of the result, and bound constraint is incorporated by a transfer function to limit the model parameters in a reliable range. The matrix inversion is accomplished by a preconditioned conjugate gradient method. With the above algorithm, equivalent density vectors can be obtained, and interpolation is performed to get the finally density model on the fine mesh in the model domain. Testing on synthetic gravity data demonstrated that the proposed method is faster than conventional generalized inversion algorithm to produce an acceptable solution for gravity inversion problem. The new developed inversion method was also applied for inversion of the gravity data collected over Sichuan basin, southwest China. The established density structure in this study helps understanding the crustal structure of Sichuan basin and provides reference for further oil and gas exploration in this area.
For re-calibration all parameters if the sites layout changing, a fast on-site calibration algorithm for dual linear CCD intersection measuring system is designed, which can avoid invariant parameters re-calibration w...
详细信息
For re-calibration all parameters if the sites layout changing, a fast on-site calibration algorithm for dual linear CCD intersection measuring system is designed, which can avoid invariant parameters re-calibration when the measuring system is moved. The measurement model of this system expresses the mathematical relation between output variables of the target coordinates and input variables of sites layout parameters as well as pixel coordinates. In accordance with the stability of interior parameters of the linear CCD camera, considering the stability of some external parameters, these stable parameters are coupled to a certain degree, which can reduce the calibration parameters number, and improve the speed of the calibration process. According to the coupling parameter, hierarchical mathematical model about the input variables, the coupling parameters and output variables is established, and target coordinates resolved mathematical model with changing site layout parameters is established, which can realize the fast on-site calibration for measuring system. The experiment results show that the calibration precision of proposed method meet the practical requirement of dual linear CCD intersection measuring system.
Lipid vesicles appear ubiquitously in biological *** how the mechanical and intermolecular interactions deform vesicle membranes is a fundamental question in *** this article we develop a fast algorithm to compute the...
详细信息
Lipid vesicles appear ubiquitously in biological *** how the mechanical and intermolecular interactions deform vesicle membranes is a fundamental question in *** this article we develop a fast algorithm to compute the surface configurations of lipid vesicles by introducing surface harmonic functions to approximate themembrane *** parameterization allows an analytical computation of themembrane curvature energy and its gradient for the efficient minimization of the curvature energy using a nonlinear conjugate gradient *** approach drastically reduces the degrees of freedom for approximating the membrane surfaces compared to the previously developed finite element and finite difference *** deformations with a reduced volume larger than 0.65 can be well approximated by using as small as 49 surface harmonic *** method thus has a great potential to reduce the computational expense of tracking multiple vesicles which deform for their interaction with external fields.
H.264/AVC video coding has permeated into every aspect of life, a new proposal has been present, which calculate the variance of the eight elements of the block to delete prediction mode selection. But this algorithm ...
详细信息
ISBN:
(纸本)9783642315756;9783642315763
H.264/AVC video coding has permeated into every aspect of life, a new proposal has been present, which calculate the variance of the eight elements of the block to delete prediction mode selection. But this algorithm is more suitable for smooth changes in the sequence of the images. Therefore, this paper proposes an improved algorithm for intra prediction mode selection to solve the problem mentioned above. Using this method on the ARMv4 phone platform into which has been transplanted the x264;the speed is 13.2% higher than original algorithm when only changing the 4x4 luminance blocks, while 4.86% than the new proposal mentioned abroad. The speed can be improved about 0.5 to 2 fps when I modify the 16x16 luminance and 8x8 chrominance blocks making another progress in intra-coding, bringing H.264/AVC more potential applications.
作者:
Plotkin, V. V.Russian Acad Sci
Siberian Branch AA Trofimuk Inst Petr Geol & Geophys Pr Akad Koptyuga 3 Novosibirsk 630090 Russia
A new algorithm is proposed to compute magnetotelluric (MT) curves for a horizontally layered earth with laterally inhomogeneous conductivity. It is fast and ensures correction of induced eddy currents and galvanic di...
详细信息
A new algorithm is proposed to compute magnetotelluric (MT) curves for a horizontally layered earth with laterally inhomogeneous conductivity. It is fast and ensures correction of induced eddy currents and galvanic distortions of MT curves produced by 3D inhomogeneities. The computation time is short (similar to 1 min) due to the use of the perturbation method for solving Maxwell's equations. The suggested algorithm has a better performance than the more costly classical Trefftz method but has an applicability limitation. (C) 2017, V.S. Sobolev IGM, Siberian Branch of the RAS. Published by Elsevier B.V. All rights reserved.
A screen content coding (SCC) standard based on high efficiency video coding (HEVC) was finalized by joint collaborative team on video coding (JCT-VC). The coding efficiency of the standard has been improved by adopti...
详细信息
ISBN:
(纸本)9781450353830
A screen content coding (SCC) standard based on high efficiency video coding (HEVC) was finalized by joint collaborative team on video coding (JCT-VC). The coding efficiency of the standard has been improved by adopting new technologies, such as intra block copy, palette mode, and adaptive motion vector resolution. However, the encoding time is significantly increased. Also, a transform skip mode is selected more frequently because traditional transform techniques for video compression cannot efficiently compress screen content videos. Therefore, we propose an early determination method for transform process in the HEVC-SCC. Residual variance is employed as a measure of complexity. Using statistics of residual variance and an online learning system, we can adaptively determine a threshold to detect the transform skip mode. Experimental results demonstrate that the proposed algorithm successfully reduces encoding time with a small coding efficiency loss.
High Efficiency Video Coding(HEVC) is the new generation of video coding standard. A quad-tree based Coding Unit(CTU) partitioning scheme is used to adapt to different video contents. However, it brings the dramatical...
详细信息
High Efficiency Video Coding(HEVC) is the new generation of video coding standard. A quad-tree based Coding Unit(CTU) partitioning scheme is used to adapt to different video contents. However, it brings the dramatically increasing of coding complexity because there are a large amount of CU partition structure to traverse. In this paper, we proposed a fast CU size decision method based on machine learning. CU features is extracted and Support Vector Machine(SVM) model is trained to classify CU splitting or non-splitting. Experimental results show that our proposed method can achieve 40.23% encoding time saving on average and the BD-rate loss is only 0.83% under All Intra(AI) configuration.
The latest video coding standard, High Efficiency Video Coding (HEVC) can achieve up to 50% bit rate saving while maintain the same subjective quality compared to H.264/AVC. However, this great advance is obtained at ...
详细信息
ISBN:
(纸本)9781509053162
The latest video coding standard, High Efficiency Video Coding (HEVC) can achieve up to 50% bit rate saving while maintain the same subjective quality compared to H.264/AVC. However, this great advance is obtained at the expense of significantly increased encoder complexity. In this paper, a two-step algorithm focusing on fast mode decision is proposed for HEVC intra prediction. Firstly, depth information of CU block is utilized to skip some unlikely selected modes, with the assumption that a brute-force search for a large CU is unnecessary. Secondly, the order of Most Probable Modes (MPM) and Rough Mode Decision (RMD) is adjusted, thus the amount of mode need be evaluated is further reduced. Experimental results show that the proposed algorithm can achieve about 31% encoder time saving on average while result in negligible BD-rate loss under the All Intra configuration compared with HM 16.0.
暂无评论