The basic KD tree nearest neighbor search has better retrieval performance for low dimension feature space. However, when there is no time requirement to estimate the parameters from the training data, it is difficult to find the nearest neighbor time in the large training set. The number of observations required in the training data set increases exponentially with the increase of dimension. For the 128 dimensional SIFT feature vector nearest neighbor search in this study, simply using KD tree is not the best choice. So we adopt the method of hierarchical index to solve the problem of large image with global plane constraint information. For large original image, we can assist the next index according to the coarse position information returned by LSH index of upper thumbnail. First, for the lower layer, we need to construct an improved KD tree index structure based on location information. The main idea of KD tree index structure based on position information improvement is to establish a plane coordinate system with the upper left corner of the two-dimensional image plane as the coordinate origin, the horizontal direction as the X axis and the vertical direction as the Y axis. In the process of constructing the fourth resolution of the first five nodes of KD tree, X and Y coordinate information are used alternately to split the nodes. In this way, we can roughly locate the feature matching area to the size of the original image, so as to improve the retrieval accuracy and speed at the same time.
In this paper, we presents a novel image progressive deliver approach based on the continuous relationship, frame prediction and frame buffer between the drawn image sequences, which is a very simple and efficient method, especially when the network is unstable or the network bandwidth is not large. It makes use of the strong continuity between the action relativity in the user's actual operation and the continuous frames in the scene rendering, selects some key frames in a series of rendered high resolution images for progressive network transmission. The client of the network can use the received series of rendered images, then reconstruct the images of other viewpoints according to the images of these key frames, and set the image frame buffer to save the generated or transmitted images, so as to ensure a better user experience when the network is unstable. In the browsing process of 3D scene, it greatly reduces the number of images that need to be drawn by the background server, and also reduces the amount of image data actually transmitted by the network. In this way, under the same network bandwidth, it can smoothly browse the super large 3D scene by multiple people in real time, and improve the user's browsing experience. First of all, our algorithm divides and recognizes the action behavior of the browsing user, transforms the continuous interaction behavior of the browsing user into a series of standard behaviors, which can quantify the interaction behavior of the user, and provides a unified standardized standard for the subsequent prediction, image generation and image caching. Then select the image to be drawn or cached according to the interactive action of the browsing user, and select the image to be sent according to certain rules. Finally, the client program reconstructs the other time according to the received important frame sequence and a series of known constraints, and uses some strategies to cache some frames to prevent network jitter.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.