I'm sure this must be something I have just overlooked or misunderstood, but I cannot for figure out why I can't solve camera motion in this situation.  I have 8 tracked points, with seemingly very smooth motion, yet when attempting to solve camera motion it refuses giving the "At least 8 common tracks are needed on both key-frames for reconstruction". My keyframes are at frames 0 and 67, the same as was set for solving. Yet I still get nothing each time.    is a short clip of the situation for additional context.   You can see that the 8 points track from 0 to 67 then stop, yet that range for solving does not work.   Thanks in advance for the help.
The attached animated gif shows some frames of a video with a mesh box placed at each tracking marker used to successfully track (solution error &lt;.4) an 800 frame chunk of video.   The point is to illustrate just how poorly the camera tracker calculated: when the box is at a marker placed at the top of a faraway building on the left, it is actually visually much larger than when it is at the tracking marker closest to where the real camera was. I went to great lengths to be sure that the camera's sensor size and focal length are correct, and manually placed and followed all markers to be sure they were accurately tracking.   There is not a lot of parallax motion over the 800 frames, but there should have been enough to at least know that the point closest to the camera moved more than the point furthest away. Sometimes it seems to work, sometimes it doesn't. Does anybody know how to improve this?
Where, how and when I can acquire HM's? Is lemonade better when made with simple syrup? On a hot summer day and with a basketful of lemons I often want a nice cold glass of lemonade. A lot of recipes suggest making lemonade with simple syrup, which requires cooking, whereas other recipes just have stirred-in sugar.  What exactly are the benefits of making lemonade (or limeade) with simple syrup versus just stirring in sugar? Would a wormhole be able to move? BootChamp no longer works on El Capitan, what's the fastest way to boot into Windows? One of the boys who always give/gives the correct answer is Samuel.   As per rule, one of is followed by plural noun/pronoun and singular helping verb, so we should be using gives in the sentence. But the answer is give. Why do my xmodmap binds involving AltGr only work on some keys? I want to remap my AltGR+Right_Windows but I can't figure out how. No matter what I try, pressing the right windows key emits the name keysym when right alt is pressed or not.  These are the contents of the xmodmap file I am testing right now. In my keyboard, 38 is the keycode for "a", 48 is the keycode for aportrophe/doublequote and 134 is the keycode for the right windows key.  keycode  38 = 1 2 3 4 5 6 7 8 keycode  48 = 1 2 3 4 5 6 7 8 keycode 134 = 1 2 3 4 5 6 7 8   When I press Right_Alt+apostrophe, it outputs 5 but Right_Alt+a and Right_Alt+Right_Windows give 1 (both when right alt is pressed and when it isn't) which is not what I wanted.  My current keyboard layout is us(alt-intl) and the right alt is apparently set up to act as AltGr / Iso_Level3_Shift. The output of xmodmap -pm is the following:  xmodmap:  up to 4 keys per modifier, (keycodes in parentheses):  shift       Shift_L (0x32),  Shift_R (0x3e) lock        Caps_Lock (0x42) control     Control_L (0x25),  Control_R (0x69) mod1        Alt_L (0x40),  Meta_L (0xcd) mod2        Num_Lock (0x4d) mod3       mod4        Super_L (0x85),  Super_R (0x86),  Super_L (0xce),  Hyper_L (0xcf) mod5        ISO_Level3_Shift (0x5c),  Mode_switch (0xcb) How do I remap certain keys or devices? How can I filter items with a certain enchantement? Is it possible to plot a graph of any shape? How is the no-cloning theorem compatible with the fact that fan-out gates work? I have some difficulty with understanding no-cloning theorem. Simply speaking, according to the theorem, it is not possible to copy a quantum state.  On the other hand, CNOT gate can be used as so-called fan-out gate which purpose is to copy one qubit to another one, previously in state $|0\rangle$.  It seems that these two facts negate each other.   My question: How is no-cloning theorem compatible with the fact that fan-out gate works? Has the below question been answered here before?  Prove: For a given enclosed volume, a sphere has minimum surface area.  Please provide link or ways to solve it. I know it is a problem of Minima and involves finding derivative and second derivatives. However, how to to frame the leading equations which has to be differentiated?  I am looking for a way to solve only using High School level Calculus. I think there must be an answer. How do I fix the GPG error "NO_PUBKEY"? I added some extra repositories with the Software Sources program. But when I reload the package database, I get an error like the following:     W: GPG error:  trusty InRelease: The following signatures couldn't be verified because the public key is not available: NO_PUBKEY 8BAF9A6F   I know I can fix it using apt-key in a terminal, according to the official Ubuntu documentation. But I would have liked to do it graphically. Is there a way to do this without using a terminal? Why can mathematical equations describe this world? Since I want to understand the world, I learn physics from textbooks. But I feel there is a gap between the textbook and the world. I do not know     why the equations in the textbook can control the whole world? How can I bridge the gap? In research, how can one distinguish whether what we do is meaningful in reality or not?   Any help or suggestions or comments will be appreciated. Add-on for blocking sites in Google Search I want to block Yahoo Answers from Google searches. As there is no option from Google for that, are there any extensions for Chrome or add-ons for Firefox that can block sub-domain results from Google search? Proving a function is Lipschitz continuous Show that the following function is Lipschitz continuous and find a Lipschitz constant  $$y\mapsto f(x,y)\\ f(x,y)=\frac{y}{x}\ln(\frac{y}{x})\text{  , } |x-1|\leq\frac{1}{2}\text{  , } |y-e|\leq\frac{e}{2} $$  I have no clue on where to begin to prove this.   My first question is how I should interpret this function, is $x$ a sort of constant? Program does not wait before output A required field that isn't really required? ...the email field in my clients data entry system is required but users of the system are allowed to enter na@na.com if the customer refuses or doesn't have an email address. Is this best practice? Have any suggestions or workarounds for their solution? I am using pgfplot to draw graphs in latex. Now this is the problem I am facing:  \begin{tikzpicture}[scale=1] \begin{axis}[ybar,grid=major,bar width=2pt,width=8cm, height=8cm,xmin=1,xmax=540,ymin=1,ymax=240] \addplot [draw=black,fill=green]  table [x=size, y=cluster, col sep=comma] {sim-0.4-0.6.csv}; \end{axis} \end{tikzpicture}   It generates the following graph:    Since, I have values mainly between 0-50 on x-axis, I want to zoom there. After that, values comes around 500. S0, there are no graph points between 50 - 450. How should I do that? Summing a series having a geometric component Why doesn't **sort** sort the same on every machine? Using the same sort command with the same input produces different results on different machines.  How do I fix that?