Is there a replacement for the canon 7d

Is there a replacement for the canon 7d

See this thread
http://forums.usa.canon.com/t5/EOS/Is-there-going-to-be-another-canon-7d-with-ten-frames-a-second/m-...

Similar Messages

  • Is there a manual for the canon MX922

    Solved!
    Go to Solution.

    Hi JM, thanks for posting1
    Click on the link below for access to a free  downloadable copy of the user's guide for your MX920 Series printer.  Please note that you may need to choose your computer's operating system before downloading.  We hope this helps!
    http://www.usa.canon.com/cusa/support/consumer/printers_multifunction/pixma_mx_series/pixma_mx922#Br...

  • Is there a replacement for the old device control/status in the visa format?

    I'm tring to control the serial lines individually and can't seem to do it in labview 6.1. I have done it using device control/status in the older version of labview 5.0

    Yes, this is easy to do in LabVIEW 6. I am attaching a simple VI that monitors the line states and lets you control DTR and RTS.
    This example VI is one we plan to add to this Developer Exchange site in the near future, so if you have any feedback, please let us know.
    Dan Mondrik
    Senior Software Engineer, NI-VISA
    National Instruments
    Attachments:
    Troubleshooting_Serial_Line_Monitor.vi ‏51 KB

  • What are the correct settings for the Canon 5D mark II in FCP 7 ?

    I am shooting full HD at 23s97 fps.. tried making a preset for the Canon but when I import fils FCP always wants to change to appropriate settings for this file type but doesn't tell me what that is...
    (latest firmware installed)
    Please, can someone provide all the correct settings for me?
    And also, why doesn't the camera show up on the desktop/in the menus when attached to the mac? I have ro use EOS utility every time I want to get anything off of the camera... and FCP doesn't see it either. That's just not right - FCP MUST recognise my camera!! : (
    Please help - I don't want to start editing until I have the right settings for this footage.
    Thanks
    Jim

    Welcome to the Boards
    Not sure what you mean with the following, looks like a word dropped?
    I have ro use EOS utility every time I want to get anything off of the camera...
    Anyway, some more specs on your system could help point where the issue is. With the new Plug-In by Canon you can Log & Transfer from the Flash Card (not sure how you connected the camera.) Alternatively you could just drag the files in (but make sure to keep all files such as THM in case you use Log and Transfer later.)
    Generally it is best to transcode to Pro Res to be able to work with the files in Final Cut. (Log & Transfer should do that, or using Compressor/Mpeg Streamclip.)
    It (Final Cut) is probably changing the timeline to match the codec, or depending on your last preset used, just switching things around. In other words if you were editing in DV and had a set up for that, new sequences would default to that and if you try to ad anything else you will get the message.
    Take a look at the search over there -> to look for the Canon 5D threads for some more info.
    What I would do is just pull one of the clips in to start and look at what the sequence settings are aftr Final Cut changes them for you - they should be fine generally, though you will want to change Codecs to Pro Res.
    I like just batch conversion of all my clips from the 5D Markk II and then work from there. (I do not hook up the camera to the computer, just use a card reader.)

  • A replacement for the Quicksort function in the C++ library

    Hi every one,
    I'd like to introduce and share a new Triple State Quicksort algorithm which was the result of my research in sorting algorithms during the last few years. The new algorithm reduces the number of swaps to about two thirds (2/3) of classical Quicksort. A multitude
    of other improvements are implemented. Test results against the std::sort() function shows an average of 43% improvement in speed throughout various input array types. It does this by trading space for performance at the price of n/2 temporary extra spaces.
    The extra space is allocated automatically and efficiently in a way that reduces memory fragmentation and optimizes performance.
    Triple State Algorithm
    The classical way of doing Quicksort is as follows:
    - Choose one element p. Called pivot. Try to make it close to the median.
    - Divide the array into two parts. A lower (left) part that is all less than p. And a higher (right) part that is all greater than p.
    - Recursively sort the left and right parts using the same method above.
    - Stop recursion when a part reaches a size that can be trivially sorted.
     The difference between the various implementations is in how they choose the pivot p, and where equal elements to the pivot are placed. There are several schemes as follows:
    [ <=p | ? | >=p ]
    [ <p | >=p | ? ]
    [ <=p | =p | ? | >p ]
    [ =p | <p | ? | >p ]  Then swap = part to middle at the end
    [ =p | <p | ? | >p | =p ]  Then swap = parts to middle at the end
    Where the goal (or the ideal goal) of the above schemes (at the end of a recursive stage) is to reach the following:
    [ <p | =p | >p ]
    The above would allow exclusion of the =p part from further recursive calls thus reducing the number of comparisons. However, there is a difficulty in reaching the above scheme with minimal swaps. All previous implementation of Quicksort could not immediately
    put =p elements in the middle using minimal swaps, first because p might not be in the perfect middle (i.e. median), second because we don’t know how many elements are in the =p part until we finish the current recursive stage.
    The new Triple State method first enters a monitoring state 1 while comparing and swapping. Elements equal to p are immediately copied to the middle if they are not already there, following this scheme:
    [ <p | ? | =p | ? | >p ]
    Then when either the left (<p) part or the right (>p) part meet the middle (=p) part, the algorithm will jump to one of two specialized states. One state handles the case for a relatively small =p part. And the other state handles the case for a relatively
    large =p part. This method adapts to the nature of the input array better than the ordinary classical Quicksort.
    Further reducing number of swaps
    A typical quicksort loop scans from left, then scans from right. Then swaps. As follows:
    while (l<=r)
    while (ar[l]<p)
    l++;
    while (ar[r]>p)
    r--;
    if (l<r)
    { Swap(ar[l],ar[r]);
    l++; r--;
    else if (l==r)
    { l++; r--; break;
    The Swap macro above does three copy operations:
    Temp=ar[l]; ar[l]=ar[r]; ar[r]=temp;
    There exists another method that will almost eliminate the need for that third temporary variable copy operation. By copying only the first ar[r] that is less than or equal to p, to the temp variable, we create an empty space in the array. Then we proceed scanning
    from left to find the first ar[l] that is greater than or equal to p. Then copy ar[r]=ar[l]. Now the empty space is at ar[l]. We scan from right again then copy ar[l]=ar[r] and continue as such. As long as the temp variable hasn’t been copied back to the array,
    the empty space will remain there juggling left and right. The following code snippet explains.
    // Pre-scan from the right
    while (ar[r]>p)
    r--;
    temp = ar[r];
    // Main loop
    while (l<r)
    while (l<r && ar[l]<p)
    l++;
    if (l<r) ar[r--] = ar[l];
    while (l<r && ar[r]>p)
    r--;
    if (l<r) ar[l++] = ar[r];
    // After loop finishes, copy temp to left side
    ar[r] = temp; l++;
    if (temp==p) r--;
    (For simplicity, the code above does not handle equal values efficiently. Refer to the complete code for the elaborate version).
    This method is not new, a similar method has been used before (read: http://www.azillionmonkeys.com/qed/sort.html)
    However it has a negative side effect on some common cases like nearly sorted or nearly reversed arrays causing undesirable shifting that renders it less efficient in those cases. However, when used with the Triple State algorithm combined with further common
    cases handling, it eventually proves more efficient than the classical swapping approach.
    Run time tests
    Here are some test results, done on an i5 2.9Ghz with 6Gb of RAM. Sorting a random array of integers. Each test is repeated 5000 times. Times shown in milliseconds.
    size std::sort() Triple State QuickSort
    5000 2039 1609
    6000 2412 1900
    7000 2733 2220
    8000 2993 2484
    9000 3361 2778
    10000 3591 3093
    It gets even faster when used with other types of input or when the size of each element is large. The following test is done for random large arrays of up to 1000000 elements where each element size is 56 bytes. Test is repeated 25 times.
    size std::sort() Triple State QuickSort
    100000 1607 424
    200000 3165 845
    300000 4534 1287
    400000 6461 1700
    500000 7668 2123
    600000 9794 2548
    700000 10745 3001
    800000 12343 3425
    900000 13790 3865
    1000000 15663 4348
    Further extensive tests has been done following Jon Bentley’s framework of tests for the following input array types:
    sawtooth: ar[i] = i % arange
    random: ar[i] = GenRand() % arange + 1
    stagger: ar[i] = (i* arange + i) % n
    plateau: ar[i] = min(i, arange)
    shuffle: ar[i] = rand()%arange? (j+=2): (k+=2)
    I also add the following two input types, just to add a little torture:
    Hill: ar[i] = min(i<(size>>1)? i:size-i,arange);
    Organ Pipes: (see full code for details)
    Where each case above is sorted then reordered in 6 deferent ways then sorted again after each reorder as follows:
    Sorted, reversed, front half reversed, back half reversed, dithered, fort.
    Note: GenRand() above is a certified random number generator based on Park-Miller method. This is to avoid any non-uniform behavior in C++ rand().
    The complete test results can be found here:
    http://solostuff.net/tsqsort/Tests_Percentage_Improvement_VC++.xls
    or:
    https://docs.google.com/spreadsheets/d/1wxNOAcuWT8CgFfaZzvjoX8x_WpusYQAlg0bXGWlLbzk/edit?usp=sharing
    Theoretical Analysis
    A Classical Quicksort algorithm performs less than 2n*ln(n) comparisons on the average (check JACEK CICHON’s paper) and less than 0.333n*ln(n) swaps on the average (check Wild and Nebel’s paper). Triple state will perform about the same number of comparisons
    but with less swaps of about 0.222n*ln(n) in theory. In practice however, Triple State Quicksort will perform even less comparisons in large arrays because of a new 5 stage pivot selection algorithm that is used. Here is the detailed theoretical analysis:
    http://solostuff.net/tsqsort/Asymptotic_analysis_of_Triple_State_Quicksort.pdf
    Using SSE2 instruction set
    SSE2 uses the 128bit sized XMM registers that can do memory copy operations in parallel since there are 8 registers of them. SSE2 is primarily used in speeding up copying large memory blocks in real-time graphics demanding applications.
    In order to use SSE2, copied memory blocks have to be 16byte aligned. Triple State Quicksort will automatically detect if element size and the array starting address are 16byte aligned and if so, will switch to using SSE2 instructions for extra speedup. This
    decision is made only once when the function is called so it has minor overhead.
    Few other notes
    - The standard C++ sorting function in almost all platforms religiously takes a “call back pointer” to a comparison function that the user/programmer provides. This is obviously for flexibility and to allow closed sourced libraries. Triple State
    defaults to using a call back function. However, call back functions have bad overhead when called millions of times. Using inline/operator or macro based comparisons will greatly improve performance. An improvement of about 30% to 40% can be expected. Thus,
    I seriously advise against using a call back function when ever possible. You can disable the call back function in my code by #undefining CALL_BACK precompiler directive.
    - Like most other efficient implementations, Triple State switches to insertion sort for tiny arrays, whenever the size of a sub-part of the array is less than TINY_THRESH directive. This threshold is empirically chosen. I set it to 15. Increasing this
    threshold will improve the speed when sorting nearly sorted and reversed arrays, or arrays that are concatenations of both cases (which are common). But will slow down sorting random or other types of arrays. To remedy this, I provide a dual threshold method
    that can be enabled by #defining DUAL_THRESH directive. Once enabled, another threshold TINY_THRESH2 will be used which should be set lower than TINY_THRESH. I set it to 9. The algorithm is able to “guess” if the array or sub part of the array is already sorted
    or reversed, and if so will use TINY_THRESH as it’s threshold, otherwise it will use the smaller threshold TINY_THRESH2. Notice that the “guessing” here is NOT fool proof, it can miss. So set both thresholds wisely.
    - You can #define the RANDOM_SAMPLES precompiler directive to add randomness to the pivoting system to lower the chances of the worst case happening at a minor performance hit.
    -When element size is very large (320 bytes or more). The function/algorithm uses a new “late swapping” method. This will auto create an internal array of pointers, sort the pointers array, then swap the original array elements to sorted order using minimal
    swaps for a maximum of n/2 swaps. You can change the 320 bytes threshold with the LATE_SWAP_THRESH directive.
    - The function provided here is optimized to the bone for performance. It is one monolithic piece of complex code that is ugly, and almost unreadable. Sorry about that, but inorder to achieve improved speed, I had to ignore common and good coding standards
    a little. I don’t advise anyone to code like this, and I my self don’t. This is really a special case for sorting only. So please don’t trip if you see weird code, most of it have a good reason.
    Finally, I would like to present the new function to Microsoft and the community for further investigation and possibly, inclusion in VC++ or any C++ library as a replacement for the sorting function.
    You can find the complete VC++ project/code along with a minimal test program here:
    http://solostuff.net/tsqsort/
    Important: To fairly compare two sorting functions, both should either use or NOT use a call back function. If one uses and another doesn’t, then you will get unfair results, the one that doesn’t use a call back function will most likely win no matter how bad
    it is!!
    Ammar Muqaddas

    Thanks for your interest.
    Excuse my ignorance as I'm not sure what you meant by "1 of 5" optimization. Did you mean median of 5 ?
    Regarding swapping pointers, yes it is common sense and rather common among programmers to swap pointers instead of swapping large data types, at the small price of indirect access to the actual data through the pointers.
    However, there is a rather unobvious and quite terrible side effect of using this trick. After the pointer array is sorted, sequential (sorted) access to the actual data throughout the remaining of the program will suffer heavily because of cache misses.
    Memory is being accessed randomly because the pointers still point to the unsorted data causing many many cache misses, which will render the program itself slow, although the sort was fast!!.
    Multi-threaded qsort is a good idea in principle and easy to implement obviously because qsort itself is recursive. The thing is Multi-threaded qsort is actually just stealing CPU time from other cores that might be busy running other apps, this might slow
    down other apps, which might not be ideal for servers. The thing researchers usually try to do is to do the improvement in the algorithm it self.
    I Will try to look at your sorting code, lets see if I can compile it.

  • Can't install the software for the Canon MX870 series because it is not currently available from the Software Update server.

    I'm trying to setup my Canon MX870 USB ink jet printer plugged into my Airport Extreme's USB port.  However, I keep getting a message of; "Can't install the software for the Canon MX870 series because it is not currently available from the Software Update server."  And then I have to click cancel.
    The "Print & Scan" from System Preferences, can see the printer as it has the NAME: Canon MX870 series,  and the LOCATION: 'the name of my network',  and USE: MX870 series.  But after clicking "Add", it tries to install the software (I've already installed the latest drivers however on my Mac Pro) and that's when I get this message;
    "Can't install the software for the Canon MX870 series because it is not currently available from the Software Update server."
    Any ideas, help would be greatly appreciated!
    Marty

    Hello Marty,
    It sounds like you are not able to add your Canon printer in System Preferences.  I found an article with steps you can take to resolve this:
    Resolution
    USB printers and Bonjour-enabled network printers
    Follow these steps until the issue is addressed:
    Make sure that the printer is powered on, has ink / toner, and that there are no alerts on the printer’s control panel. Note: If you cannot clear an alert on the printer's control panel, stop here and check the printer's documentation or contact the manufacturer for support.
    Ensure the printer is properly connected to a USB port on the Mac or AirPort base station / Time Capsule. If the printer is a network-capable printer, make sure that it is properly connected to your home network.
    Use Software Update to find and install the latest available updates. If an update is installed, see if the issue persists.
    Open the Print & Scan pane or Print & Fax (Snow Leopard) pane in System Preferences.
    Delete the affected printer, then add the printer again.
    If the issue persists, try these additional steps:
    Reset the printing system, then add the printer again.
    If the issue still persists, reset the printing system again.  Download and install your printer's drivers. Then, add the printer again.
    Contact the printer vendor or visit their website for further assistance.
    You can find the full article here:
    Troubleshooting printer issues in OS X
    http://support.apple.com/kb/ts3147
    Thank you for posting in the Apple Support Communities. 
    Best,
    Sheila M.

  • Lens correction profile for the Canon 18-135 STM lens in Lightroom 5 ?

    How or where can I get the lens correction profile for the Canon 18-135 STM lens in Lightroom 5 ? In effect he is not available in my list of correction lens so my lightroom is up to date apparently :/
    Thanks in advance for answer.

    There are two types of Lens profiles - raw and JPEG. It looks like you are trying to process a JPEG image and Adobe has only provided a raw lens profile for the 18-135mm IS STM lens.
    You have four options:
    1) Check for available lens profile using the Adobe Lens Profile Downloader. I checked and a JPEG lens profile is NOT available for the 18-135mm lens.
    2) Follow the procedure outlined by Steve Sprengel in this post:
    http://feedback.photoshop.com/photoshop_family/topics/lr_5_lens_profile_not_applied_for_jp g_captures_only_for_raw_captures
    More detailed instructions here for a Pentax lens example:
    http://www.pentaxforums.com/forums/post-processing-articles/176761-creating-adobe-lens-cor rection-profiles-jpgs-raw-ones.html
    This allows using the available raw lens profile with JPEG images. To my knowledge Canon DSLR cameras do not apply distortion correction to JPEG images, so the raw profile should work well. You can check this by shooting raw+JPEG and comparing the two images inside LR
    3) Create you own lens profile using the Adobe Lens Profile Creator. (A complicated process, but it can be done!).
    4) Start shooting in raw mode or raw + JPEG mode, which will allow you to extract the most benefit from LR's processing controls.

  • Is there a driver for the PXI-8310 that works with Windows 7?

    The only one I can seem to find is for XP.

    Hello LouisTI,
    Unfortunately there is not a Windows 7 driver for the PXI-Cardbus8310, as this is a legacy device which is currently going EOL (End of Life). The XP driver for the 8310 (which you may already have found) can be downloaded here:
    http://joule.ni.com/nidu/cds/view/p/id/370/lang/en
    If using Win 7 is critical, we recommend the PXI-ExpressCard 8360 as a replacement for the 8310:
    http://sine.ni.com/nips/cds/view/p/lang/en/nid/202294
    Hope that helps!
    James M.  |  Applications Engineer  |  National Instruments
    James M. | Applications Engineer | National Instruments

  • What camera raw default settings would you use for the Canon 5D Mark 3. I have PS CS6.  Thank you.

    What camera raw default settings would you use for the Canon 5D Mark 3. I have PS CS6.  Thank you.

    Really, this is a question you should be asking yourself...
    What do you shoot? Makes a difference...
    Typical ISO that you shoot? Makes a difference...
    Shooting for clients or yourself? Makes a difference...
    Look, there is no magic bullet...the ACR/LR "Default" should only be changed for those adjustments you make 70-90% of the time and sould not be confused with image by image adjustments...
    So, as asked, your question can not really be answered other than to say, use a default that suits you.

  • Camera Raw for Elements 10 for the Canon EOS 7D MkII? Downloading

    Is there a "Camera Raw" for "Elements 10" for the "Canon EOS 7D MkII"?
    If so could I please have the link to where I can download it?
    Thanks

    Hi,
    The Canon 7D Mk II is currently not supported by any version of camera raw.
    It is expected that Camera raw 8.7 will include support and we are hoping that it will be released soon.
    PSE 12 has ceased to be updated - you will either need to update to PSE 13 or use the DNG 8.7 converter (when it becomes available) to convert the CR2 files to DNG files - PSE 12 will then beable to use the DNG files.
    Brian

  • When will the Camera plug-in be updated for the Canon 70D for Elements 9?

    When will the Camera plug-in be updated for the Canon 70D for Elements 9

    Hi,
    There hasn't been an update for PSE 9 since Sept 2011 so it is unlikely to ever be updated for the 70D.
    Your options are
    1) Upgrade PSE 12 when it comes out (probably soon)
    2) Use the Canon software (DPP) that came with your camera - convert to TIF files and import those into PSE
    3) Download/Install the free Adobe DNG 8.2RC Converter to convert your CR2 files to DNG files - the DNG files can then be processed by PSE 9
    Brian

  • WIA support for the Canon MX922

    Is there a WIA driver for the Canon MX922 multifunction printer? It doesn't respond to my version of Photoshop which requiresa scanner that is WIA compliant.

    Hello.
    The MX922 uses a TWAIN driver for scanning.
    For many of the latest versions of Photoshop, a TWAIN plugin would have to be installed in order to use a TWAIN scanner with the program.  Please visit www.adobe.com for information on how to update the plugin for your version of Photoshop.
    If additional assistance is needed, feel free to call us at 1-800-OKCANON.
    Did this answer your question? Please click the Accept as Solution button so that others may find the answer as well.

  • Is there an app for the ipad that will allow you to access your mac.

    Is there an app for the ipad that will allow you to access your mac via wifi or cell network.

    Yep, two of the most popular apps are "LogMeIn Ignition" and "iTeleport." Check them out, they'll both set you back by about 30$ though.

  • Is there a way for the sender of an email to see if it has been read

    is there a way for the sender of an email to see if the email has been read?    

    Some email clients allow for you to request a read receipt, but the sender also has the ability to refuse to send it as well. Much of that is controlled on the receiving end.

  • Replacement for the Replacement? help!! 1st generation program

    Hi my name is Juan Robles I recently enter to the 1st generation ipod program replacement, and they do send me a better ipod touch nano 8 gb 6 generation.
    but it doesn't charge, i let it charge for a hole day and I even try it with a usb cable and a wall charger and once you  disconected, it goes dead not even a blink... but if i plug it back to the cable it turn on very fast in less than 5 seconds.
    My question is do they support a replacement for the replacement they send me, it is less than 90 days of from the date of service.
    The Fedex box, the one with the replacement new ipod don't have the return address like the first one, the one where i send my 1st generation ipod. So any one  resolve a similar issue , i will love to have the return address. I allready try the thec phone support but they put me on hold for more tha a hour and nothing.
    Thanks in advance...

    Apple Service Operations
    3011 Laguna Blvd., Building A
    ELk Grove, CA 95758

Maybe you are looking for